6680 lines
202 KiB
JavaScript
6680 lines
202 KiB
JavaScript
(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
|
|
var N3 = require('n3'),
|
|
N3Util = N3.Util;
|
|
|
|
var validate = function (turtleStream, callback) {
|
|
var parser = N3.Parser();
|
|
var errorCount = 0, warningCount = 0;
|
|
var regexp = {
|
|
'dateTime' : /^(-?(?:[1-9][0-9]*)?[0-9]{4})-(1[0-2]|0[1-9])-(3[0-1]|0[1-9]|[1-2][0-9])?T(2[0-3]|[0-1][0-9]):([0-5][0-9]):([0-5][0-9])(\.[0-9]+)??(Z|[+-](?:2[0-3]|[0-1][0-9]):[0-5][0-9])?$/,
|
|
'double' : /[-+]?\d*([.]\d+)?/,
|
|
'float' : /[-+]?\d*[.]\d+/,
|
|
'int' : /^[-+]?(0|[1-9]\d*)$/
|
|
};
|
|
|
|
var feedback = { warnings : [], errors : []};
|
|
|
|
parser.parse(turtleStream, function(error, triple, prefixes) {
|
|
if (error) {
|
|
feedback.errors.push(error);
|
|
}
|
|
|
|
if (triple) {
|
|
if (N3Util.isLiteral(triple.object)) {
|
|
var value = N3Util.getLiteralValue(triple.object);
|
|
var type = N3Util.getLiteralType(triple.object);
|
|
|
|
type = type.replace('http://www.w3.org/2001/XMLSchema#', '');
|
|
if (regexp[type] && !regexp[type].test(value)) {
|
|
feedback.warnings.push('WARNING: xsd:', type, 'does not validate for literal. {', triple.subject, triple.predicate, triple.object, '}');
|
|
}
|
|
}
|
|
} else {
|
|
callback(feedback);
|
|
}
|
|
});
|
|
};
|
|
|
|
if (typeof window !== 'undefined') {
|
|
window.validate = validate;
|
|
}
|
|
|
|
module.exports = validate;
|
|
|
|
},{"n3":2}],2:[function(require,module,exports){
|
|
// Replace local require by a lazy loader
|
|
var globalRequire = require;
|
|
require = function () {};
|
|
|
|
// Expose submodules
|
|
var exports = module.exports = {
|
|
Lexer: require('./lib/N3Lexer'),
|
|
Parser: require('./lib/N3Parser'),
|
|
Writer: require('./lib/N3Writer'),
|
|
Store: require('./lib/N3Store'),
|
|
StreamParser: require('./lib/N3StreamParser'),
|
|
StreamWriter: require('./lib/N3StreamWriter'),
|
|
Util: require('./lib/N3Util'),
|
|
};
|
|
|
|
// Load submodules on first access
|
|
Object.keys(exports).forEach(function (submodule) {
|
|
Object.defineProperty(exports, submodule, {
|
|
configurable: true,
|
|
enumerable: true,
|
|
get: function () {
|
|
delete exports[submodule];
|
|
return exports[submodule] = globalRequire('./lib/N3' + submodule);
|
|
},
|
|
});
|
|
});
|
|
|
|
},{"./lib/N3Lexer":3,"./lib/N3Parser":4,"./lib/N3Store":5,"./lib/N3StreamParser":6,"./lib/N3StreamWriter":7,"./lib/N3Util":8,"./lib/N3Writer":9}],3:[function(require,module,exports){
|
|
// **N3Lexer** tokenizes N3 documents.
|
|
var fromCharCode = String.fromCharCode;
|
|
var immediately = typeof setImmediate === 'function' ? setImmediate :
|
|
function setImmediate(func) { setTimeout(func, 0); };
|
|
|
|
// Regular expression and replacement string to escape N3 strings.
|
|
// Note how we catch invalid unicode sequences separately (they will trigger an error).
|
|
var escapeSequence = /\\u([a-fA-F0-9]{4})|\\U([a-fA-F0-9]{8})|\\[uU]|\\(.)/g;
|
|
var escapeReplacements = { '\\': '\\', "'": "'", '"': '"',
|
|
'n': '\n', 'r': '\r', 't': '\t', 'f': '\f', 'b': '\b',
|
|
'_': '_', '~': '~', '.': '.', '-': '-', '!': '!', '$': '$', '&': '&',
|
|
'(': '(', ')': ')', '*': '*', '+': '+', ',': ',', ';': ';', '=': '=',
|
|
'/': '/', '?': '?', '#': '#', '@': '@', '%': '%' };
|
|
var illegalIriChars = /[\x00-\x20<>\\"\{\}\|\^\`]/;
|
|
|
|
// ## Constructor
|
|
function N3Lexer(options) {
|
|
if (!(this instanceof N3Lexer))
|
|
return new N3Lexer(options);
|
|
|
|
// In line mode (N-Triples or N-Quads), only simple features may be parsed
|
|
if (options && options.lineMode) {
|
|
// Don't tokenize special literals
|
|
this._tripleQuotedString = this._number = this._boolean = /$0^/;
|
|
// Swap the tokenize method for a restricted version
|
|
var self = this;
|
|
this._tokenize = this.tokenize;
|
|
this.tokenize = function (input, callback) {
|
|
this._tokenize(input, function (error, token) {
|
|
if (!error && /IRI|prefixed|literal|langcode|type|\.|eof/.test(token.type))
|
|
callback && callback(error, token);
|
|
else
|
|
callback && callback(error || self._syntaxError(token.type, callback = null));
|
|
});
|
|
};
|
|
}
|
|
}
|
|
|
|
N3Lexer.prototype = {
|
|
// ## Regular expressions
|
|
// It's slightly faster to have these as properties than as in-scope variables.
|
|
|
|
_iri: /^<((?:[^>\\]|\\[uU])+)>/, // IRI with escape sequences; needs sanity check after unescaping
|
|
_unescapedIri: /^<([^\x00-\x20<>\\"\{\}\|\^\`]*)>/, // IRI without escape sequences; no unescaping
|
|
_unescapedString: /^"[^"\\]+"(?=[^"\\])/, // non-empty string without escape sequences
|
|
_singleQuotedString: /^"[^"\\]*(?:\\.[^"\\]*)*"(?=[^"\\])|^'[^'\\]*(?:\\.[^'\\]*)*'(?=[^'\\])/,
|
|
_tripleQuotedString: /^""("[^"\\]*(?:(?:\\.|"(?!""))[^"\\]*)*")""|^''('[^'\\]*(?:(?:\\.|'(?!''))[^'\\]*)*')''/,
|
|
_langcode: /^@([a-z]+(?:-[a-z0-9]+)*)(?=[^a-z0-9\-])/i,
|
|
_prefix: /^((?:[A-Za-z\xc0-\xd6\xd8-\xf6\xf8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff])(?:\.?[\-0-9A-Z_a-z\xb7\xc0-\xd6\xd8-\xf6\xf8-\u037d\u037f-\u1fff\u200c\u200d\u203f\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff])*)?:(?=[#\s<])/,
|
|
_prefixed: /^((?:[A-Za-z\xc0-\xd6\xd8-\xf6\xf8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff])(?:\.?[\-0-9A-Z_a-z\xb7\xc0-\xd6\xd8-\xf6\xf8-\u037d\u037f-\u1fff\u200c\u200d\u203f\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff])*)?:((?:(?:[0-:A-Z_a-z\xc0-\xd6\xd8-\xf6\xf8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff]|%[0-9a-fA-F]{2}|\\[!#-\/;=?\-@_~])(?:(?:[\.\-0-:A-Z_a-z\xb7\xc0-\xd6\xd8-\xf6\xf8-\u037d\u037f-\u1fff\u200c\u200d\u203f\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff]|%[0-9a-fA-F]{2}|\\[!#-\/;=?\-@_~])*(?:[\-0-:A-Z_a-z\xb7\xc0-\xd6\xd8-\xf6\xf8-\u037d\u037f-\u1fff\u200c\u200d\u203f\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff]|%[0-9a-fA-F]{2}|\\[!#-\/;=?\-@_~]))?)?)(?=\.?[,;\s#()\[\]\{\}"'<])/,
|
|
_blank: /^_:((?:[0-9A-Z_a-z\xc0-\xd6\xd8-\xf6\xf8-\u02ff\u0370-\u037d\u037f-\u1fff\u200c\u200d\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff])(?:\.?[\-0-9A-Z_a-z\xb7\xc0-\xd6\xd8-\xf6\xf8-\u037d\u037f-\u1fff\u200c\u200d\u203f\u2040\u2070-\u218f\u2c00-\u2fef\u3001-\ud7ff\uf900-\ufdcf\ufdf0-\ufffd]|[\ud800-\udb7f][\udc00-\udfff])*)(?=\.?[,;:\s#()\[\]\{\}"'<])/,
|
|
_number: /^[\-+]?(?:\d+\.?\d*([eE](?:[\-\+])?\d+)|\d*\.?\d+)(?=[.,;:\s#()\[\]\{\}"'<])/,
|
|
_boolean: /^(?:true|false)(?=[.,;:\s#()\[\]\{\}"'<])/,
|
|
_keyword: /^@[a-z]+(?=[\s#<:])/,
|
|
_sparqlKeyword: /^(?:PREFIX|BASE|GRAPH)(?=[\s#<:])/i,
|
|
_shortPredicates: /^a(?=\s+|<)/,
|
|
_newline: /^[ \t]*(?:#[^\n\r]*)?(?:\r\n|\n|\r)[ \t]*/,
|
|
_whitespace: /^[ \t]+/,
|
|
_endOfFile: /^(?:#[^\n\r]*)?$/,
|
|
|
|
// ## Private methods
|
|
|
|
// ### `_tokenizeToEnd` tokenizes as for as possible, emitting tokens through the callback.
|
|
_tokenizeToEnd: function (callback, inputFinished) {
|
|
// Continue parsing as far as possible; the loop will return eventually.
|
|
var input = this._input;
|
|
while (true) {
|
|
// Count and skip whitespace lines.
|
|
var whiteSpaceMatch;
|
|
while (whiteSpaceMatch = this._newline.exec(input))
|
|
input = input.substr(whiteSpaceMatch[0].length, input.length), this._line++;
|
|
// Skip whitespace on current line.
|
|
if (whiteSpaceMatch = this._whitespace.exec(input))
|
|
input = input.substr(whiteSpaceMatch[0].length, input.length);
|
|
|
|
// Stop for now if we're at the end.
|
|
if (this._endOfFile.test(input)) {
|
|
// If the input is finished, emit EOF.
|
|
if (inputFinished)
|
|
callback(input = null, { line: this._line, type: 'eof', value: '', prefix: '' });
|
|
return this._input = input;
|
|
}
|
|
|
|
// Look for specific token types based on the first character.
|
|
var line = this._line, type = '', value = '', prefix = '',
|
|
firstChar = input[0], match = null, matchLength = 0, unescaped, inconclusive = false;
|
|
switch (firstChar) {
|
|
case '^':
|
|
// Try to match a type.
|
|
if (input.length === 1) break;
|
|
else if (input[1] !== '^') return reportSyntaxError(this);
|
|
this._prevTokenType = '^';
|
|
// Move to type IRI or prefixed name.
|
|
input = input.substr(2);
|
|
if (input[0] !== '<') {
|
|
inconclusive = true;
|
|
break;
|
|
}
|
|
// Fall through in case the type is an IRI.
|
|
|
|
case '<':
|
|
// Try to find a full IRI without escape sequences.
|
|
if (match = this._unescapedIri.exec(input)) {
|
|
type = 'IRI';
|
|
value = match[1];
|
|
}
|
|
// Try to find a full IRI with escape sequences.
|
|
else if (match = this._iri.exec(input)) {
|
|
unescaped = this._unescape(match[1]);
|
|
if (unescaped === null || illegalIriChars.test(unescaped))
|
|
return reportSyntaxError(this);
|
|
type = 'IRI';
|
|
value = unescaped;
|
|
}
|
|
break;
|
|
|
|
case '_':
|
|
// Try to find a blank node. Since it can contain (but not end with) a dot,
|
|
// we always need a non-dot character before deciding it is a prefixed name.
|
|
// Therefore, try inserting a space if we're at the end of the input.
|
|
if ((match = this._blank.exec(input)) ||
|
|
inputFinished && (match = this._blank.exec(input + ' '))) {
|
|
type = 'prefixed';
|
|
prefix = '_';
|
|
value = match[1];
|
|
}
|
|
break;
|
|
|
|
case '"':
|
|
case "'":
|
|
// Try to find a non-empty double-quoted literal without escape sequences.
|
|
if (match = this._unescapedString.exec(input)) {
|
|
type = 'literal';
|
|
value = match[0];
|
|
}
|
|
// Try to find any other literal wrapped in a pair of single or double quotes.
|
|
else if (match = this._singleQuotedString.exec(input)) {
|
|
unescaped = this._unescape(match[0]);
|
|
if (unescaped === null)
|
|
return reportSyntaxError(this);
|
|
type = 'literal';
|
|
value = unescaped.replace(/^'|'$/g, '"');
|
|
}
|
|
// Try to find a literal wrapped in three pairs of single or double quotes.
|
|
else if (match = this._tripleQuotedString.exec(input)) {
|
|
unescaped = match[1] || match[2];
|
|
// Count the newlines and advance line counter.
|
|
this._line += unescaped.split(/\r\n|\r|\n/).length - 1;
|
|
unescaped = this._unescape(unescaped);
|
|
if (unescaped === null)
|
|
return reportSyntaxError(this);
|
|
type = 'literal';
|
|
value = unescaped.replace(/^'|'$/g, '"');
|
|
}
|
|
break;
|
|
|
|
case '@':
|
|
// Try to find a language code.
|
|
if (this._prevTokenType === 'literal' && (match = this._langcode.exec(input))) {
|
|
type = 'langcode';
|
|
value = match[1];
|
|
}
|
|
// Try to find a keyword.
|
|
else if (match = this._keyword.exec(input)) {
|
|
type = match[0];
|
|
}
|
|
break;
|
|
|
|
case '.':
|
|
// Try to find a dot as punctuation.
|
|
if (input.length === 1 ? inputFinished : (input[1] < '0' || input[1] > '9')) {
|
|
type = '.';
|
|
matchLength = 1;
|
|
break;
|
|
}
|
|
// Fall through to numerical case (could be a decimal dot).
|
|
|
|
case '0':
|
|
case '1':
|
|
case '2':
|
|
case '3':
|
|
case '4':
|
|
case '5':
|
|
case '6':
|
|
case '7':
|
|
case '8':
|
|
case '9':
|
|
case '+':
|
|
case '-':
|
|
// Try to find a number.
|
|
if (match = this._number.exec(input)) {
|
|
type = 'literal';
|
|
value = '"' + match[0] + '"^^http://www.w3.org/2001/XMLSchema#' +
|
|
(match[1] ? 'double' : (/^[+\-]?\d+$/.test(match[0]) ? 'integer' : 'decimal'));
|
|
}
|
|
break;
|
|
|
|
case 'B':
|
|
case 'b':
|
|
case 'p':
|
|
case 'P':
|
|
case 'G':
|
|
case 'g':
|
|
// Try to find a SPARQL-style keyword.
|
|
if (match = this._sparqlKeyword.exec(input))
|
|
type = match[0].toUpperCase();
|
|
else
|
|
inconclusive = true;
|
|
break;
|
|
|
|
case 'f':
|
|
case 't':
|
|
// Try to match a boolean.
|
|
if (match = this._boolean.exec(input)) {
|
|
type = 'literal';
|
|
value = '"' + match[0] + '"^^http://www.w3.org/2001/XMLSchema#boolean';
|
|
}
|
|
else
|
|
inconclusive = true;
|
|
break;
|
|
|
|
case 'a':
|
|
// Try to find an abbreviated predicate.
|
|
if (match = this._shortPredicates.exec(input)) {
|
|
type = 'abbreviation';
|
|
value = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#type';
|
|
}
|
|
else
|
|
inconclusive = true;
|
|
break;
|
|
|
|
case ',':
|
|
case ';':
|
|
case '[':
|
|
case ']':
|
|
case '(':
|
|
case ')':
|
|
case '{':
|
|
case '}':
|
|
// The next token is punctuation
|
|
matchLength = 1;
|
|
type = firstChar;
|
|
break;
|
|
|
|
default:
|
|
inconclusive = true;
|
|
}
|
|
|
|
// Some first characters do not allow an immediate decision, so inspect more.
|
|
if (inconclusive) {
|
|
// Try to find a prefix.
|
|
if ((this._prevTokenType === '@prefix' || this._prevTokenType === 'PREFIX') &&
|
|
(match = this._prefix.exec(input))) {
|
|
type = 'prefix';
|
|
value = match[1] || '';
|
|
}
|
|
// Try to find a prefixed name. Since it can contain (but not end with) a dot,
|
|
// we always need a non-dot character before deciding it is a prefixed name.
|
|
// Therefore, try inserting a space if we're at the end of the input.
|
|
else if ((match = this._prefixed.exec(input)) ||
|
|
inputFinished && (match = this._prefixed.exec(input + ' '))) {
|
|
type = 'prefixed';
|
|
prefix = match[1] || '';
|
|
value = this._unescape(match[2]);
|
|
}
|
|
}
|
|
|
|
// A type token is special: it can only be emitted after an IRI or prefixed name is read.
|
|
if (this._prevTokenType === '^')
|
|
type = (type === 'IRI' || type === 'prefixed') ? 'type' : '';
|
|
|
|
// What if nothing of the above was found?
|
|
if (!type) {
|
|
// We could be in streaming mode, and then we just wait for more input to arrive.
|
|
// Otherwise, a syntax error has occurred in the input.
|
|
// One exception: error on an unaccounted linebreak (= not inside a triple-quoted literal).
|
|
if (inputFinished || (!/^'''|^"""/.test(input) && /\n|\r/.test(input)))
|
|
return reportSyntaxError(this);
|
|
else
|
|
return this._input = input;
|
|
}
|
|
|
|
// Emit the parsed token.
|
|
callback(null, { line: line, type: type, value: value, prefix: prefix });
|
|
this._prevTokenType = type;
|
|
|
|
// Advance to next part to tokenize.
|
|
input = input.substr(matchLength || match[0].length, input.length);
|
|
}
|
|
|
|
// Signals the syntax error through the callback
|
|
function reportSyntaxError(self) { callback(self._syntaxError(/^\S*/.exec(input)[0])); }
|
|
},
|
|
|
|
// ### `_unescape` replaces N3 escape codes by their corresponding characters.
|
|
_unescape: function (item) {
|
|
try {
|
|
return item.replace(escapeSequence, function (sequence, unicode4, unicode8, escapedChar) {
|
|
var charCode;
|
|
if (unicode4) {
|
|
charCode = parseInt(unicode4, 16);
|
|
if (isNaN(charCode)) throw new Error(); // can never happen (regex), but helps performance
|
|
return fromCharCode(charCode);
|
|
}
|
|
else if (unicode8) {
|
|
charCode = parseInt(unicode8, 16);
|
|
if (isNaN(charCode)) throw new Error(); // can never happen (regex), but helps performance
|
|
if (charCode <= 0xFFFF) return fromCharCode(charCode);
|
|
return fromCharCode(0xD800 + ((charCode -= 0x10000) / 0x400), 0xDC00 + (charCode & 0x3FF));
|
|
}
|
|
else {
|
|
var replacement = escapeReplacements[escapedChar];
|
|
if (!replacement)
|
|
throw new Error();
|
|
return replacement;
|
|
}
|
|
});
|
|
}
|
|
catch (error) { return null; }
|
|
},
|
|
|
|
// ### `_syntaxError` creates a syntax error for the given issue
|
|
_syntaxError: function (issue) {
|
|
this._input = null;
|
|
return new Error('Syntax error: unexpected "' + issue + '" on line ' + this._line + '.');
|
|
},
|
|
|
|
|
|
// ## Public methods
|
|
|
|
// ### `tokenize` starts the transformation of an N3 document into an array of tokens.
|
|
// The input can be a string or a stream.
|
|
tokenize: function (input, callback) {
|
|
var self = this;
|
|
this._line = 1;
|
|
|
|
// If the input is a string, continuously emit tokens through the callback until the end.
|
|
if (typeof input === 'string') {
|
|
this._input = input;
|
|
immediately(function () { self._tokenizeToEnd(callback, true); });
|
|
}
|
|
// Otherwise, the input will be streamed.
|
|
else {
|
|
this._input = '';
|
|
|
|
// If no input was given, it will be streamed through `addChunk` and ended with `end`
|
|
if (!input || typeof input === 'function') {
|
|
this.addChunk = addChunk;
|
|
this.end = end;
|
|
if (!callback)
|
|
callback = input;
|
|
}
|
|
// Otherwise, the input itself must be a stream
|
|
else {
|
|
if (typeof input.setEncoding === 'function')
|
|
input.setEncoding('utf8');
|
|
input.on('data', addChunk);
|
|
input.on('end', end);
|
|
}
|
|
}
|
|
|
|
// Adds the data chunk to the buffer and parses as far as possible
|
|
function addChunk(data) {
|
|
if (self._input !== null) {
|
|
self._input += data;
|
|
self._tokenizeToEnd(callback, false);
|
|
}
|
|
}
|
|
|
|
// Parses until the end
|
|
function end() {
|
|
if (self._input !== null) {
|
|
self._tokenizeToEnd(callback, true);
|
|
}
|
|
}
|
|
},
|
|
};
|
|
|
|
// ## Exports
|
|
|
|
// Export the `N3Lexer` class as a whole.
|
|
module.exports = N3Lexer;
|
|
|
|
},{}],4:[function(require,module,exports){
|
|
// **N3Parser** parses N3 documents.
|
|
var N3Lexer = require('./N3Lexer');
|
|
|
|
var RDF_PREFIX = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#',
|
|
RDF_NIL = RDF_PREFIX + 'nil',
|
|
RDF_FIRST = RDF_PREFIX + 'first',
|
|
RDF_REST = RDF_PREFIX + 'rest';
|
|
|
|
var absoluteIRI = /:/,
|
|
documentPart = /[^\/]*$/,
|
|
rootIRI = /^(?:[^:]+:\/*)?[^\/]*/;
|
|
|
|
// The next ID for new blank nodes
|
|
var blankNodePrefix = 0, blankNodeCount = 0;
|
|
|
|
// ## Constructor
|
|
function N3Parser(options) {
|
|
if (!(this instanceof N3Parser))
|
|
return new N3Parser(options);
|
|
this._tripleStack = [];
|
|
this._graph = null;
|
|
|
|
// Set the document IRI.
|
|
options = options || {};
|
|
if (!options.documentIRI) {
|
|
this._baseIRI = null;
|
|
this._baseIRIPath = null;
|
|
}
|
|
else {
|
|
if (options.documentIRI.indexOf('#') > 0)
|
|
throw new Error('Invalid document IRI');
|
|
this._baseIRI = options.documentIRI;
|
|
this._baseIRIPath = this._baseIRI.replace(documentPart, '');
|
|
this._baseIRIRoot = this._baseIRI.match(rootIRI)[0];
|
|
}
|
|
|
|
// Set supported features depending on the format.
|
|
var format = (typeof options.format === 'string') && options.format.match(/\w*$/)[0].toLowerCase(),
|
|
isTurtle = format === 'turtle', isTriG = format === 'trig',
|
|
isNTriples = /triple/.test(format), isNQuads = /quad/.test(format),
|
|
isLineMode = isNTriples || isNQuads;
|
|
if (!(this._supportsNamedGraphs = !isTurtle))
|
|
this._readPredicateOrNamedGraph = this._readPredicate;
|
|
this._supportsQuads = !(isTurtle || isTriG || isNTriples);
|
|
// Disable relative IRIs in N-Triples or N-Quads mode
|
|
if (isLineMode) {
|
|
this._baseIRI = '';
|
|
this._resolveIRI = function (token) {
|
|
this._error('Disallowed relative IRI', token);
|
|
return this._callback = noop, this._subject = null;
|
|
};
|
|
}
|
|
this._blankNodePrefix = typeof options.blankNodePrefix !== 'string' ? '' :
|
|
'_:' + options.blankNodePrefix.replace(/^_:/, '');
|
|
this._lexer = options.lexer || new N3Lexer({ lineMode: isLineMode });
|
|
}
|
|
|
|
// ## Private class methods
|
|
|
|
// ### `_resetBlankNodeIds` restarts blank node identification.
|
|
N3Parser._resetBlankNodeIds = function () {
|
|
blankNodePrefix = blankNodeCount = 0;
|
|
};
|
|
|
|
N3Parser.prototype = {
|
|
// ## Private methods
|
|
|
|
// ### `_readInTopContext` reads a token when in the top context.
|
|
_readInTopContext: function (token) {
|
|
switch (token.type) {
|
|
// If an EOF token arrives in the top context, signal that we're done.
|
|
case 'eof':
|
|
if (this._graph !== null)
|
|
return this._error('Unclosed graph', token);
|
|
delete this._prefixes._;
|
|
return this._callback(null, null, this._prefixes);
|
|
// It could be a prefix declaration.
|
|
case '@prefix':
|
|
this._sparqlStyle = false;
|
|
return this._readPrefix;
|
|
case 'PREFIX':
|
|
this._sparqlStyle = true;
|
|
return this._readPrefix;
|
|
// It could be a base declaration.
|
|
case '@base':
|
|
this._sparqlStyle = false;
|
|
return this._readBaseIRI;
|
|
case 'BASE':
|
|
this._sparqlStyle = true;
|
|
return this._readBaseIRI;
|
|
// It could be a graph.
|
|
case '{':
|
|
if (this._supportsNamedGraphs) {
|
|
this._graph = '';
|
|
this._subject = null;
|
|
return this._readSubject;
|
|
}
|
|
case 'GRAPH':
|
|
if (this._supportsNamedGraphs) {
|
|
return this._readNamedGraphLabel;
|
|
}
|
|
// Otherwise, the next token must be a subject.
|
|
default:
|
|
return this._readSubject(token);
|
|
}
|
|
},
|
|
|
|
// ### `_readSubject` reads a triple's subject.
|
|
_readSubject: function (token) {
|
|
this._predicate = null;
|
|
switch (token.type) {
|
|
case 'IRI':
|
|
if (this._baseIRI === null || absoluteIRI.test(token.value))
|
|
this._subject = token.value;
|
|
else
|
|
this._subject = this._resolveIRI(token);
|
|
break;
|
|
case 'prefixed':
|
|
var prefix = this._prefixes[token.prefix];
|
|
if (prefix === undefined)
|
|
return this._error('Undefined prefix "' + token.prefix + ':"', token);
|
|
this._subject = prefix + token.value;
|
|
break;
|
|
case '[':
|
|
// Start a new triple with a new blank node as subject.
|
|
this._subject = '_:b' + blankNodeCount++;
|
|
this._tripleStack.push({ subject: this._subject, predicate: null, object: null, type: 'blank' });
|
|
return this._readBlankNodeHead;
|
|
case '(':
|
|
// Start a new list
|
|
this._tripleStack.push({ subject: RDF_NIL, predicate: null, object: null, type: 'list' });
|
|
this._subject = null;
|
|
return this._readListItem;
|
|
case '}':
|
|
return this._readPunctuation(token);
|
|
default:
|
|
return this._error('Expected subject but got ' + token.type, token);
|
|
}
|
|
// The next token must be a predicate,
|
|
// or, if the subject was actually a graph IRI, a named graph.
|
|
return this._readPredicateOrNamedGraph;
|
|
},
|
|
|
|
// ### `_readPredicate` reads a triple's predicate.
|
|
_readPredicate: function (token) {
|
|
var type = token.type;
|
|
switch (type) {
|
|
case 'IRI':
|
|
case 'abbreviation':
|
|
if (this._baseIRI === null || absoluteIRI.test(token.value))
|
|
this._predicate = token.value;
|
|
else
|
|
this._predicate = this._resolveIRI(token);
|
|
break;
|
|
case 'prefixed':
|
|
if (token.prefix === '_') {
|
|
return this._error('Disallowed blank node as predicate', token);
|
|
}
|
|
else {
|
|
var prefix = this._prefixes[token.prefix];
|
|
if (prefix === undefined)
|
|
return this._error('Undefined prefix "' + token.prefix + ':"', token);
|
|
this._predicate = prefix + token.value;
|
|
}
|
|
break;
|
|
case '.':
|
|
case ']':
|
|
case '}':
|
|
// Expected predicate didn't come, must have been trailing semicolon.
|
|
if (this._predicate === null)
|
|
return this._error('Unexpected ' + type, token);
|
|
this._subject = null;
|
|
return type === ']' ? this._readBlankNodeTail(token) : this._readPunctuation(token);
|
|
case ';':
|
|
// Extra semicolons can be safely ignored
|
|
return this._readPredicate;
|
|
default:
|
|
return this._error('Expected predicate to follow "' + this._subject + '"', token);
|
|
}
|
|
// The next token must be an object.
|
|
return this._readObject;
|
|
},
|
|
|
|
// ### `_readObject` reads a triple's object.
|
|
_readObject: function (token) {
|
|
switch (token.type) {
|
|
case 'IRI':
|
|
if (this._baseIRI === null || absoluteIRI.test(token.value))
|
|
this._object = token.value;
|
|
else
|
|
this._object = this._resolveIRI(token);
|
|
break;
|
|
case 'prefixed':
|
|
var prefix = this._prefixes[token.prefix];
|
|
if (prefix === undefined)
|
|
return this._error('Undefined prefix "' + token.prefix + ':"', token);
|
|
this._object = prefix + token.value;
|
|
break;
|
|
case 'literal':
|
|
this._object = token.value;
|
|
return this._readDataTypeOrLang;
|
|
case '[':
|
|
// Start a new triple with a new blank node as subject.
|
|
var blank = '_:b' + blankNodeCount++;
|
|
this._tripleStack.push({ subject: this._subject, predicate: this._predicate, object: blank, type: 'blank' });
|
|
this._subject = blank;
|
|
return this._readBlankNodeHead;
|
|
case '(':
|
|
// Start a new list
|
|
this._tripleStack.push({ subject: this._subject, predicate: this._predicate, object: RDF_NIL, type: 'list' });
|
|
this._subject = null;
|
|
return this._readListItem;
|
|
default:
|
|
return this._error('Expected object to follow "' + this._predicate + '"', token);
|
|
}
|
|
return this._getTripleEndReader();
|
|
},
|
|
|
|
// ### `_readPredicateOrNamedGraph` reads a triple's predicate, or a named graph.
|
|
_readPredicateOrNamedGraph: function (token) {
|
|
return token.type === '{' ? this._readGraph(token) : this._readPredicate(token);
|
|
},
|
|
|
|
// ### `_readGraph` reads a graph.
|
|
_readGraph: function (token) {
|
|
if (token.type !== '{')
|
|
return this._error('Expected graph but got ' + token.type, token);
|
|
// The "subject" we read is actually the GRAPH's label
|
|
this._graph = this._subject, this._subject = null;
|
|
return this._readSubject;
|
|
},
|
|
|
|
// ### `_readBlankNodeHead` reads the head of a blank node.
|
|
_readBlankNodeHead: function (token) {
|
|
if (token.type === ']') {
|
|
this._subject = null;
|
|
return this._readBlankNodeTail(token);
|
|
}
|
|
this._predicate = null;
|
|
return this._readPredicate(token);
|
|
},
|
|
|
|
// ### `_readBlankNodeTail` reads the end of a blank node.
|
|
_readBlankNodeTail: function (token) {
|
|
if (token.type !== ']')
|
|
return this._readBlankNodePunctuation(token);
|
|
|
|
// Store blank node triple.
|
|
if (this._subject !== null)
|
|
this._callback(null, { subject: this._subject,
|
|
predicate: this._predicate,
|
|
object: this._object,
|
|
graph: this._graph || '' });
|
|
|
|
// Restore parent triple that contains the blank node.
|
|
var triple = this._tripleStack.pop();
|
|
this._subject = triple.subject;
|
|
// Was the blank node the object?
|
|
if (triple.object !== null) {
|
|
// Restore predicate and object as well, and continue by reading punctuation.
|
|
this._predicate = triple.predicate;
|
|
this._object = triple.object;
|
|
return this._getTripleEndReader();
|
|
}
|
|
// The blank node was the subject, so continue reading the predicate.
|
|
// If the blank node didn't contain any predicates, it could also be the label of a named graph.
|
|
return this._predicate !== null ? this._readPredicate : this._readPredicateOrNamedGraph;
|
|
},
|
|
|
|
// ### `_readDataTypeOrLang` reads an _optional_ data type or language.
|
|
_readDataTypeOrLang: function (token) {
|
|
switch (token.type) {
|
|
case 'type':
|
|
var value;
|
|
if (token.prefix === '') {
|
|
if (this._baseIRI === null || absoluteIRI.test(token.value))
|
|
value = token.value;
|
|
else
|
|
value = this._resolveIRI(token);
|
|
}
|
|
else {
|
|
var prefix = this._prefixes[token.prefix];
|
|
if (prefix === undefined)
|
|
return this._error('Undefined prefix "' + token.prefix + ':"', token);
|
|
value = prefix + token.value;
|
|
}
|
|
this._object += '^^' + value;
|
|
return this._getTripleEndReader();
|
|
case 'langcode':
|
|
this._object += '@' + token.value.toLowerCase();
|
|
return this._getTripleEndReader();
|
|
default:
|
|
return this._getTripleEndReader().call(this, token);
|
|
}
|
|
},
|
|
|
|
// ### `_readListItem` reads items from a list.
|
|
_readListItem: function (token) {
|
|
var item = null, // The actual list item.
|
|
itemHead = null, // The head of the rdf:first predicate.
|
|
prevItemHead = this._subject, // The head of the previous rdf:first predicate.
|
|
stack = this._tripleStack, // The stack of triples part of recursion (lists, blanks, etc.).
|
|
parentTriple = stack[stack.length - 1], // The triple containing the current list.
|
|
next = this._readListItem; // The next function to execute.
|
|
|
|
switch (token.type) {
|
|
case 'IRI':
|
|
item = token.value;
|
|
break;
|
|
case 'prefixed':
|
|
var prefix = this._prefixes[token.prefix];
|
|
if (prefix === undefined)
|
|
return this._error('Undefined prefix "' + token.prefix + ':"', token);
|
|
item = prefix + token.value;
|
|
break;
|
|
case 'literal':
|
|
item = token.value;
|
|
next = this._readDataTypeOrLang;
|
|
break;
|
|
case '[':
|
|
// Stack the current list triple and start a new triple with a blank node as subject.
|
|
itemHead = '_:b' + blankNodeCount++;
|
|
item = '_:b' + blankNodeCount++;
|
|
stack.push({ subject: itemHead, predicate: RDF_FIRST, object: item, type: 'blank' });
|
|
this._subject = item;
|
|
next = this._readBlankNodeHead;
|
|
break;
|
|
case '(':
|
|
// Stack the current list triple and start a new list
|
|
itemHead = '_:b' + blankNodeCount++;
|
|
stack.push({ subject: itemHead, predicate: RDF_FIRST, object: RDF_NIL, type: 'list' });
|
|
this._subject = null;
|
|
next = this._readListItem;
|
|
break;
|
|
case ')':
|
|
// Restore the parent triple.
|
|
stack.pop();
|
|
// If this list is contained within a parent list, return the membership triple here.
|
|
// This will be `<parent list element> rdf:first <this list>.`.
|
|
if (stack.length !== 0 && stack[stack.length - 1].type === 'list')
|
|
this._callback(null, { subject: parentTriple.subject,
|
|
predicate: parentTriple.predicate,
|
|
object: parentTriple.object,
|
|
graph: this._graph || '' });
|
|
// Restore the parent triple's subject.
|
|
this._subject = parentTriple.subject;
|
|
// Was this list in the parent triple's subject?
|
|
if (parentTriple.predicate === null) {
|
|
// The next token is the predicate.
|
|
next = this._readPredicate;
|
|
// Skip writing the list tail if this was an empty list.
|
|
if (parentTriple.subject === RDF_NIL)
|
|
return next;
|
|
}
|
|
// The list was in the parent triple's object.
|
|
else {
|
|
// Restore the parent triple's predicate and object as well.
|
|
this._predicate = parentTriple.predicate;
|
|
this._object = parentTriple.object;
|
|
next = this._getTripleEndReader();
|
|
// Skip writing the list tail if this was an empty list.
|
|
if (parentTriple.object === RDF_NIL)
|
|
return next;
|
|
}
|
|
// Close the list by making the item head nil.
|
|
itemHead = RDF_NIL;
|
|
break;
|
|
default:
|
|
return this._error('Expected list item instead of "' + token.type + '"', token);
|
|
}
|
|
|
|
// Create a new blank node if no item head was assigned yet.
|
|
if (itemHead === null)
|
|
this._subject = itemHead = '_:b' + blankNodeCount++;
|
|
|
|
// Is this the first element of the list?
|
|
if (prevItemHead === null) {
|
|
// This list is either the object or the subject.
|
|
if (parentTriple.object === RDF_NIL)
|
|
parentTriple.object = itemHead;
|
|
else
|
|
parentTriple.subject = itemHead;
|
|
}
|
|
else {
|
|
// The rest of the list is in the current head.
|
|
this._callback(null, { subject: prevItemHead,
|
|
predicate: RDF_REST,
|
|
object: itemHead,
|
|
graph: this._graph || '' });
|
|
}
|
|
// Add the item's value.
|
|
if (item !== null)
|
|
this._callback(null, { subject: itemHead,
|
|
predicate: RDF_FIRST,
|
|
object: item,
|
|
graph: this._graph || '' });
|
|
return next;
|
|
},
|
|
|
|
// ### `_readPunctuation` reads punctuation between triples or triple parts.
|
|
_readPunctuation: function (token) {
|
|
var next, subject = this._subject, graph = this._graph;
|
|
switch (token.type) {
|
|
// A closing brace ends a graph
|
|
case '}':
|
|
if (this._graph === null)
|
|
return this._error('Unexpected graph closing', token);
|
|
this._graph = null;
|
|
// A dot just ends the statement, without sharing anything with the next.
|
|
case '.':
|
|
this._subject = null;
|
|
next = this._readInTopContext;
|
|
break;
|
|
// Semicolon means the subject is shared; predicate and object are different.
|
|
case ';':
|
|
next = this._readPredicate;
|
|
break;
|
|
// Comma means both the subject and predicate are shared; the object is different.
|
|
case ',':
|
|
next = this._readObject;
|
|
break;
|
|
// An IRI means this is a quad (only allowed if not already inside a graph).
|
|
case 'IRI':
|
|
if (this._supportsQuads && this._graph === null) {
|
|
if (this._baseIRI === null || absoluteIRI.test(token.value))
|
|
graph = token.value;
|
|
else
|
|
graph = this._resolveIRI(token);
|
|
subject = this._subject;
|
|
next = this._readQuadPunctuation;
|
|
break;
|
|
}
|
|
// An prefixed name means this is a quad (only allowed if not already inside a graph).
|
|
case 'prefixed':
|
|
if (this._supportsQuads && this._graph === null) {
|
|
var prefix = this._prefixes[token.prefix];
|
|
if (prefix === undefined)
|
|
return this._error('Undefined prefix "' + token.prefix + ':"', token);
|
|
graph = prefix + token.value;
|
|
next = this._readQuadPunctuation;
|
|
break;
|
|
}
|
|
default:
|
|
return this._error('Expected punctuation to follow "' + this._object + '"', token);
|
|
}
|
|
// A triple has been completed now, so return it.
|
|
if (subject !== null)
|
|
this._callback(null, { subject: subject,
|
|
predicate: this._predicate,
|
|
object: this._object,
|
|
graph: graph || '' });
|
|
return next;
|
|
},
|
|
|
|
// ### `_readBlankNodePunctuation` reads punctuation in a blank node
|
|
_readBlankNodePunctuation: function (token) {
|
|
var next;
|
|
switch (token.type) {
|
|
// Semicolon means the subject is shared; predicate and object are different.
|
|
case ';':
|
|
next = this._readPredicate;
|
|
break;
|
|
// Comma means both the subject and predicate are shared; the object is different.
|
|
case ',':
|
|
next = this._readObject;
|
|
break;
|
|
default:
|
|
return this._error('Expected punctuation to follow "' + this._object + '"', token);
|
|
}
|
|
// A triple has been completed now, so return it.
|
|
this._callback(null, { subject: this._subject,
|
|
predicate: this._predicate,
|
|
object: this._object,
|
|
graph: this._graph || '' });
|
|
return next;
|
|
},
|
|
|
|
// ### `_readQuadPunctuation` reads punctuation after a quad.
|
|
_readQuadPunctuation: function (token) {
|
|
if (token.type !== '.')
|
|
return this._error('Expected dot to follow quad', token);
|
|
return this._readInTopContext;
|
|
},
|
|
|
|
// ### `_readPrefix` reads the prefix of a prefix declaration.
|
|
_readPrefix: function (token) {
|
|
if (token.type !== 'prefix')
|
|
return this._error('Expected prefix to follow @prefix', token);
|
|
this._prefix = token.value;
|
|
return this._readPrefixIRI;
|
|
},
|
|
|
|
// ### `_readPrefixIRI` reads the IRI of a prefix declaration.
|
|
_readPrefixIRI: function (token) {
|
|
if (token.type !== 'IRI')
|
|
return this._error('Expected IRI to follow prefix "' + this._prefix + ':"', token);
|
|
var prefixIRI;
|
|
if (this._baseIRI === null || absoluteIRI.test(token.value))
|
|
prefixIRI = token.value;
|
|
else
|
|
prefixIRI = this._resolveIRI(token);
|
|
this._prefixes[this._prefix] = prefixIRI;
|
|
this._prefixCallback(this._prefix, prefixIRI);
|
|
return this._readDeclarationPunctuation;
|
|
},
|
|
|
|
// ### `_readBaseIRI` reads the IRI of a base declaration.
|
|
_readBaseIRI: function (token) {
|
|
if (token.type !== 'IRI')
|
|
return this._error('Expected IRI to follow base declaration', token);
|
|
if (token.value.indexOf('#') > 0)
|
|
return this._error('Invalid base IRI', token);
|
|
if (this._baseIRI === null || absoluteIRI.test(token.value))
|
|
this._baseIRI = token.value;
|
|
else
|
|
this._baseIRI = this._resolveIRI(token);
|
|
this._baseIRIPath = this._baseIRI.replace(documentPart, '');
|
|
this._baseIRIRoot = this._baseIRI.match(rootIRI)[0];
|
|
return this._readDeclarationPunctuation;
|
|
},
|
|
|
|
// ### `_readNamedGraphLabel` reads the label of a named graph.
|
|
_readNamedGraphLabel: function (token) {
|
|
switch (token.type) {
|
|
case 'IRI':
|
|
case 'prefixed':
|
|
return this._readSubject(token), this._readGraph;
|
|
case '[':
|
|
return this._readNamedGraphBlankLabel;
|
|
default:
|
|
return this._error('Invalid graph label', token);
|
|
}
|
|
},
|
|
|
|
// ### `_readNamedGraphLabel` reads a blank node label of a named graph.
|
|
_readNamedGraphBlankLabel: function (token) {
|
|
if (token.type !== ']')
|
|
return this._error('Invalid graph label', token);
|
|
this._subject = '_:b' + blankNodeCount++;
|
|
return this._readGraph;
|
|
},
|
|
|
|
// ### `_readDeclarationPunctuation` reads the punctuation of a declaration.
|
|
_readDeclarationPunctuation: function (token) {
|
|
// SPARQL-style declarations don't have punctuation.
|
|
if (this._sparqlStyle)
|
|
return this._readInTopContext(token);
|
|
|
|
if (token.type !== '.')
|
|
return this._error('Expected declaration to end with a dot', token);
|
|
return this._readInTopContext;
|
|
},
|
|
|
|
// ### `_getTripleEndReader` gets the next reader function at the end of a triple.
|
|
_getTripleEndReader: function () {
|
|
var stack = this._tripleStack;
|
|
if (stack.length === 0)
|
|
return this._readPunctuation;
|
|
|
|
switch (stack[stack.length - 1].type) {
|
|
case 'blank':
|
|
return this._readBlankNodeTail;
|
|
case 'list':
|
|
return this._readListItem;
|
|
}
|
|
},
|
|
|
|
// ### `_error` emits an error message through the callback.
|
|
_error: function (message, token) {
|
|
this._callback(new Error(message + ' at line ' + token.line + '.'));
|
|
},
|
|
|
|
// ### `_resolveIRI` resolves an IRI token against the base path
|
|
_resolveIRI: function (token) {
|
|
var iri = token.value;
|
|
switch (iri[0]) {
|
|
// An empty relative IRI indicates the base IRI
|
|
case undefined:
|
|
return this._baseIRI;
|
|
// Resolve relative fragment IRIs against the base IRI
|
|
case '#':
|
|
return this._baseIRI + iri;
|
|
// Resolve relative query string IRIs by replacing the query string
|
|
case '?':
|
|
return this._baseIRI.replace(/(?:\?.*)?$/, iri);
|
|
// Resolve root relative IRIs at the root of the base IRI
|
|
case '/':
|
|
return this._baseIRIRoot + iri;
|
|
// Resolve all other IRIs at the base IRI's path
|
|
default:
|
|
return this._baseIRIPath + iri;
|
|
}
|
|
},
|
|
|
|
// ## Public methods
|
|
|
|
// ### `parse` parses the N3 input and emits each parsed triple through the callback.
|
|
parse: function (input, tripleCallback, prefixCallback) {
|
|
// The read callback is the next function to be executed when a token arrives.
|
|
// We start reading in the top context.
|
|
this._readCallback = this._readInTopContext;
|
|
this._prefixes = Object.create(null);
|
|
this._prefixes._ = this._blankNodePrefix || '_:b' + blankNodePrefix++ + '_';
|
|
|
|
// If the input argument is not given, shift parameters
|
|
if (typeof input === 'function')
|
|
prefixCallback = tripleCallback, tripleCallback = input, input = null;
|
|
|
|
// Set the triple and prefix callbacks.
|
|
this._callback = tripleCallback || noop;
|
|
this._prefixCallback = prefixCallback || noop;
|
|
|
|
// Execute the read callback when a token arrives.
|
|
var self = this;
|
|
this._lexer.tokenize(input, function (error, token) {
|
|
if (error !== null)
|
|
self._callback(error), self._callback = noop;
|
|
else if (self._readCallback !== undefined)
|
|
self._readCallback = self._readCallback(token);
|
|
});
|
|
|
|
// If no input was given, it can be added with `addChunk` and ended with `end`
|
|
if (!input) {
|
|
this.addChunk = this._lexer.addChunk;
|
|
this.end = this._lexer.end;
|
|
}
|
|
}
|
|
};
|
|
|
|
// The empty function
|
|
function noop() {}
|
|
|
|
// ## Exports
|
|
|
|
// Export the `N3Parser` class as a whole.
|
|
module.exports = N3Parser;
|
|
|
|
},{"./N3Lexer":3}],5:[function(require,module,exports){
|
|
// **N3Store** objects store N3 triples by graph in memory.
|
|
|
|
var expandPrefixedName = require('./N3Util').expandPrefixedName;
|
|
|
|
// ## Constructor
|
|
function N3Store(triples, options) {
|
|
if (!(this instanceof N3Store))
|
|
return new N3Store(triples, options);
|
|
|
|
// The number of triples is initially zero.
|
|
this._size = 0;
|
|
// `_graphs` contains subject, predicate, and object indexes per graph.
|
|
this._graphs = Object.create(null);
|
|
// `_entities` maps entities such as `http://xmlns.com/foaf/0.1/name` to numbers.
|
|
// This saves memory, since only the numbers have to be stored in `_graphs`.
|
|
this._entities = Object.create(null);
|
|
this._entities['><'] = 0; // Dummy entry, so the first actual key is non-zero
|
|
this._entityCount = 0;
|
|
// `_blankNodeIndex` is the index of the last created blank node that was automatically named
|
|
this._blankNodeIndex = 0;
|
|
|
|
// Shift parameters if `triples` is not given
|
|
if (!options && triples && !triples[0])
|
|
options = triples, triples = null;
|
|
|
|
// Add triples and prefixes if passed
|
|
this._prefixes = Object.create(null);
|
|
if (options && options.prefixes)
|
|
this.addPrefixes(options.prefixes);
|
|
if (triples)
|
|
this.addTriples(triples);
|
|
}
|
|
|
|
N3Store.prototype = {
|
|
// ## Public properties
|
|
|
|
// ### `size` returns the number of triples in the store.
|
|
get size() {
|
|
// Return the triple count if if was cached.
|
|
var size = this._size;
|
|
if (size !== null)
|
|
return size;
|
|
|
|
// Calculate the number of triples by counting to the deepest level.
|
|
var graphs = this._graphs, subjects, subject;
|
|
for (var graphKey in graphs)
|
|
for (var subjectKey in (subjects = graphs[graphKey].subjects))
|
|
for (var predicateKey in (subject = subjects[subjectKey]))
|
|
size += Object.keys(subject[predicateKey]).length;
|
|
return this._size = size;
|
|
},
|
|
|
|
// ## Private methods
|
|
|
|
// ### `_addToIndex` adds a triple to a three-layered index.
|
|
_addToIndex: function (index0, key0, key1, key2) {
|
|
// Create layers as necessary.
|
|
var index1 = index0[key0] || (index0[key0] = {});
|
|
var index2 = index1[key1] || (index1[key1] = {});
|
|
// Setting the key to _any_ value signalizes the presence of the triple.
|
|
index2[key2] = null;
|
|
},
|
|
|
|
// ### `_removeFromIndex` removes a triple from a three-layered index.
|
|
_removeFromIndex: function (index0, key0, key1, key2) {
|
|
// Remove the triple from the index.
|
|
var index1 = index0[key0], index2 = index1[key1], key;
|
|
delete index2[key2];
|
|
|
|
// Remove intermediary index layers if they are empty.
|
|
for (key in index2) return;
|
|
delete index1[key1];
|
|
for (key in index1) return;
|
|
delete index0[key0];
|
|
},
|
|
|
|
// ### `_findInIndex` finds a set of triples in a three-layered index.
|
|
// The index base is `index0` and the keys at each level are `key0`, `key1`, and `key2`.
|
|
// Any of these keys can be `null`, which is interpreted as a wildcard.
|
|
// `name0`, `name1`, and `name2` are the names of the keys at each level,
|
|
// used when reconstructing the resulting triple
|
|
// (for instance: _subject_, _predicate_, and _object_).
|
|
// Finally, `graph` will be the graph of the created triples.
|
|
_findInIndex: function (index0, key0, key1, key2, name0, name1, name2, graph) {
|
|
var results = [], entityKeys = Object.keys(this._entities), tmp, index1, index2;
|
|
|
|
// If a key is specified, use only that part of index 0.
|
|
if (key0) (tmp = index0, index0 = {})[key0] = tmp[key0];
|
|
for (var value0 in index0) {
|
|
var entity0 = entityKeys[value0];
|
|
|
|
if (index1 = index0[value0]) {
|
|
// If a key is specified, use only that part of index 1.
|
|
if (key1) (tmp = index1, index1 = {})[key1] = tmp[key1];
|
|
for (var value1 in index1) {
|
|
var entity1 = entityKeys[value1];
|
|
|
|
if (index2 = index1[value1]) {
|
|
// If a key is specified, use only that part of index 2, if it exists.
|
|
var values = key2 ? (key2 in index2 ? [key2] : []) : Object.keys(index2);
|
|
// Create triples for all items found in index 2.
|
|
for (var l = values.length - 1; l >= 0; l--) {
|
|
var result = { subject: '', predicate: '', object: '', graph: graph };
|
|
result[name0] = entity0;
|
|
result[name1] = entity1;
|
|
result[name2] = entityKeys[values[l]];
|
|
results.push(result);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return results;
|
|
},
|
|
|
|
// ### `_countInIndex` counts matching triples in a three-layered index.
|
|
// The index base is `index0` and the keys at each level are `key0`, `key1`, and `key2`.
|
|
// Any of these keys can be `null`, which is interpreted as a wildcard.
|
|
_countInIndex: function (index0, key0, key1, key2) {
|
|
var count = 0, tmp, index1, index2;
|
|
|
|
// If a key is specified, count only that part of index 0.
|
|
if (key0) (tmp = index0, index0 = {})[key0] = tmp[key0];
|
|
for (var value0 in index0) {
|
|
if (index1 = index0[value0]) {
|
|
// If a key is specified, count only that part of index 1.
|
|
if (key1) (tmp = index1, index1 = {})[key1] = tmp[key1];
|
|
for (var value1 in index1) {
|
|
if (index2 = index1[value1]) {
|
|
// If a key is specified, count the triple if it exists.
|
|
if (key2) (key2 in index2) && count++;
|
|
// Otherwise, count all triples.
|
|
else count += Object.keys(index2).length;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return count;
|
|
},
|
|
|
|
// ## Public methods
|
|
|
|
// ### `addTriple` adds a new N3 triple to the store.
|
|
addTriple: function (subject, predicate, object, graph) {
|
|
// Shift arguments if a triple object is given instead of components
|
|
if (!predicate)
|
|
graph = subject.graph, object = subject.object,
|
|
predicate = subject.predicate, subject = subject.subject;
|
|
|
|
// Find the graph that will contain the triple.
|
|
graph = graph || '';
|
|
var graphItem = this._graphs[graph];
|
|
// Create the graph if it doesn't exist yet.
|
|
if (!graphItem) {
|
|
graphItem = this._graphs[graph] = {
|
|
subjects: {},
|
|
predicates: {},
|
|
objects: {}
|
|
};
|
|
// Freezing a graph helps subsequent `add` performance,
|
|
// and properties will never be modified anyway.
|
|
Object.freeze(graphItem);
|
|
}
|
|
|
|
// Since entities can often be long IRIs, we avoid storing them in every index.
|
|
// Instead, we have a separate index that maps entities to numbers,
|
|
// which are then used as keys in the other indexes.
|
|
var entities = this._entities;
|
|
subject = entities[subject] || (entities[subject] = ++this._entityCount);
|
|
predicate = entities[predicate] || (entities[predicate] = ++this._entityCount);
|
|
object = entities[object] || (entities[object] = ++this._entityCount);
|
|
|
|
this._addToIndex(graphItem.subjects, subject, predicate, object);
|
|
this._addToIndex(graphItem.predicates, predicate, object, subject);
|
|
this._addToIndex(graphItem.objects, object, subject, predicate);
|
|
|
|
// The cached triple count is now invalid.
|
|
this._size = null;
|
|
},
|
|
|
|
// ### `addTriples` adds multiple N3 triples to the store.
|
|
addTriples: function (triples) {
|
|
for (var i = triples.length - 1; i >= 0; i--)
|
|
this.addTriple(triples[i]);
|
|
},
|
|
|
|
// ### `addPrefix` adds support for querying with the given prefix
|
|
addPrefix: function (prefix, iri) {
|
|
this._prefixes[prefix] = iri;
|
|
},
|
|
|
|
// ### `addPrefixes` adds support for querying with the given prefixes
|
|
addPrefixes: function (prefixes) {
|
|
for (var prefix in prefixes)
|
|
this.addPrefix(prefix, prefixes[prefix]);
|
|
},
|
|
|
|
// ### `removeTriple` removes an N3 triple from the store if it exists.
|
|
removeTriple: function (subject, predicate, object, graph) {
|
|
// Shift arguments if a triple object is given instead of components.
|
|
if (!predicate)
|
|
graph = subject.graph, object = subject.object,
|
|
predicate = subject.predicate, subject = subject.subject;
|
|
graph = graph || '';
|
|
|
|
// Find internal identifiers for all components.
|
|
var graphItem, entities = this._entities, graphs = this._graphs;
|
|
if (!(subject = entities[subject])) return;
|
|
if (!(predicate = entities[predicate])) return;
|
|
if (!(object = entities[object])) return;
|
|
if (!(graphItem = graphs[graph])) return;
|
|
|
|
// Verify that the triple exists.
|
|
var subjects, predicates;
|
|
if (!(subjects = graphItem.subjects[subject])) return;
|
|
if (!(predicates = subjects[predicate])) return;
|
|
if (!(object in predicates)) return;
|
|
|
|
// Remove it from all indexes.
|
|
this._removeFromIndex(graphItem.subjects, subject, predicate, object);
|
|
this._removeFromIndex(graphItem.predicates, predicate, object, subject);
|
|
this._removeFromIndex(graphItem.objects, object, subject, predicate);
|
|
if (this._size !== null) this._size--;
|
|
|
|
// Remove the graph if it is empty.
|
|
for (subject in graphItem.subjects) return;
|
|
delete graphs[graph];
|
|
},
|
|
|
|
// ### `removeTriples` removes multiple N3 triples from the store.
|
|
removeTriples: function (triples) {
|
|
for (var i = triples.length - 1; i >= 0; i--)
|
|
this.removeTriple(triples[i]);
|
|
},
|
|
|
|
// ### `find` finds a set of triples matching a pattern, expanding prefixes as necessary.
|
|
// Setting `subject`, `predicate`, or `object` to `null` means an _anything_ wildcard.
|
|
// Setting `graph` to `null` means the default graph.
|
|
find: function (subject, predicate, object, graph) {
|
|
var prefixes = this._prefixes;
|
|
return this.findByIRI(
|
|
expandPrefixedName(subject, prefixes),
|
|
expandPrefixedName(predicate, prefixes),
|
|
expandPrefixedName(object, prefixes),
|
|
expandPrefixedName(graph, prefixes)
|
|
);
|
|
},
|
|
|
|
// ### `findByIRI` finds a set of triples matching a pattern.
|
|
// Setting `subject`, `predicate`, or `object` to a falsy value means an _anything_ wildcard.
|
|
// Setting `graph` to a falsy value means the default graph.
|
|
findByIRI: function (subject, predicate, object, graph) {
|
|
graph = graph || '';
|
|
var graphItem = this._graphs[graph], entities = this._entities;
|
|
|
|
// If the specified graph contain no triples, there are no results.
|
|
if (!graphItem) return [];
|
|
|
|
// Translate IRIs to internal index keys.
|
|
// Optimization: if the entity doesn't exist, no triples with it exist.
|
|
if (subject && !(subject = entities[subject])) return [];
|
|
if (predicate && !(predicate = entities[predicate])) return [];
|
|
if (object && !(object = entities[object])) return [];
|
|
|
|
// Choose the optimal index, based on what fields are present
|
|
if (subject) {
|
|
if (object)
|
|
// If subject and object are given, the object index will be the fastest.
|
|
return this._findInIndex(graphItem.objects, object, subject, predicate,
|
|
'object', 'subject', 'predicate', graph);
|
|
else
|
|
// If only subject and possibly predicate are given, the subject index will be the fastest.
|
|
return this._findInIndex(graphItem.subjects, subject, predicate, null,
|
|
'subject', 'predicate', 'object', graph);
|
|
}
|
|
else if (predicate)
|
|
// If only predicate and possibly object are given, the predicate index will be the fastest.
|
|
return this._findInIndex(graphItem.predicates, predicate, object, null,
|
|
'predicate', 'object', 'subject', graph);
|
|
else if (object)
|
|
// If only object is given, the object index will be the fastest.
|
|
return this._findInIndex(graphItem.objects, object, null, null,
|
|
'object', 'subject', 'predicate', graph);
|
|
else
|
|
// If nothing is given, iterate subjects and predicates first
|
|
return this._findInIndex(graphItem.subjects, null, null, null,
|
|
'subject', 'predicate', 'object', graph);
|
|
},
|
|
|
|
// ### `count` returns the number of triples matching a pattern, expanding prefixes as necessary.
|
|
// Setting `subject`, `predicate`, or `object` to `null` means an _anything_ wildcard.
|
|
// Setting `graph` to `null` means the default graph.
|
|
count: function (subject, predicate, object, graph) {
|
|
var prefixes = this._prefixes;
|
|
return this.countByIRI(
|
|
expandPrefixedName(subject, prefixes),
|
|
expandPrefixedName(predicate, prefixes),
|
|
expandPrefixedName(object, prefixes),
|
|
expandPrefixedName(graph, prefixes)
|
|
);
|
|
},
|
|
|
|
// ### `countByIRI` returns the number of triples matching a pattern.
|
|
// Setting `subject`, `predicate`, or `object` to `null` means an _anything_ wildcard.
|
|
// Setting `graph` to `null` means the default graph.
|
|
countByIRI: function (subject, predicate, object, graph) {
|
|
graph = graph || '';
|
|
var graphItem = this._graphs[graph], entities = this._entities;
|
|
|
|
// If the specified graph contain no triples, there are no results.
|
|
if (!graphItem) return 0;
|
|
|
|
// Translate IRIs to internal index keys.
|
|
// Optimization: if the entity doesn't exist, no triples with it exist.
|
|
if (subject && !(subject = entities[subject])) return 0;
|
|
if (predicate && !(predicate = entities[predicate])) return 0;
|
|
if (object && !(object = entities[object])) return 0;
|
|
|
|
// Choose the optimal index, based on what fields are present
|
|
if (subject) {
|
|
if (object)
|
|
// If subject and object are given, the object index will be the fastest.
|
|
return this._countInIndex(graphItem.objects, object, subject, predicate);
|
|
else
|
|
// If only subject and possibly predicate are given, the subject index will be the fastest.
|
|
return this._countInIndex(graphItem.subjects, subject, predicate, object);
|
|
}
|
|
else if (predicate) {
|
|
// If only predicate and possibly object are given, the predicate index will be the fastest.
|
|
return this._countInIndex(graphItem.predicates, predicate, object, subject);
|
|
}
|
|
else {
|
|
// If only object is possibly given, the object index will be the fastest.
|
|
return this._countInIndex(graphItem.objects, object, subject, predicate);
|
|
}
|
|
},
|
|
|
|
// ### `createBlankNode` creates a new blank node, returning its name.
|
|
createBlankNode: function (suggestedName) {
|
|
var name;
|
|
if (suggestedName) {
|
|
name = suggestedName = '_:' + suggestedName;
|
|
var index = 1;
|
|
while (this._entities[name])
|
|
name = suggestedName + index++;
|
|
}
|
|
else {
|
|
do { name = '_:b' + this._blankNodeIndex++; }
|
|
while (this._entities[name]);
|
|
}
|
|
this._entities[name] = this._entityCount++;
|
|
return name;
|
|
},
|
|
};
|
|
|
|
// ## Exports
|
|
|
|
// Export the `N3Store` class as a whole.
|
|
module.exports = N3Store;
|
|
|
|
},{"./N3Util":8}],6:[function(require,module,exports){
|
|
// **N3StreamParser** parses an N3 stream into a triple stream
|
|
var Transform = require('stream').Transform,
|
|
util = require('util'),
|
|
N3Parser = require('./N3Parser.js');
|
|
|
|
// ## Constructor
|
|
function N3StreamParser(options) {
|
|
if (!(this instanceof N3StreamParser))
|
|
return new N3StreamParser(options);
|
|
|
|
// Initialize Transform base class
|
|
Transform.call(this, { decodeStrings: true });
|
|
this._readableState.objectMode = true;
|
|
|
|
// Set up parser
|
|
var self = this, parser = new N3Parser(options);
|
|
parser.parse(
|
|
// Handle triples by pushing them down the pipeline
|
|
function (error, triple) {
|
|
triple && self.push(triple) ||
|
|
error && self.emit('error', error);
|
|
},
|
|
// Emit prefixes through the `prefix` event
|
|
this.emit.bind(this, 'prefix'));
|
|
|
|
// Implement Transform methods on top of parser
|
|
this._transform = function (chunk, encoding, done) { parser.addChunk(chunk); done(); };
|
|
this._flush = function (done) { parser.end(); done(); };
|
|
}
|
|
util.inherits(N3StreamParser, Transform);
|
|
|
|
// ## Exports
|
|
// Export the `N3StreamParser` class as a whole.
|
|
module.exports = N3StreamParser;
|
|
|
|
},{"./N3Parser.js":4,"stream":29,"util":32}],7:[function(require,module,exports){
|
|
// **N3StreamWriter** serializes a triple stream into an N3 stream
|
|
var Transform = require('stream').Transform,
|
|
util = require('util'),
|
|
N3Writer = require('./N3Writer.js');
|
|
|
|
// ## Constructor
|
|
function N3StreamWriter(options) {
|
|
if (!(this instanceof N3StreamWriter))
|
|
return new N3StreamWriter(options);
|
|
|
|
// Initialize Transform base class
|
|
Transform.call(this, { encoding: 'utf8' });
|
|
this._writableState.objectMode = true;
|
|
|
|
// Set up writer with a dummy stream object
|
|
var self = this;
|
|
var writer = new N3Writer({
|
|
write: function (chunk, encoding, callback) { self.push(chunk); callback && callback(); },
|
|
end: function (callback) { self.push(null); callback && callback(); },
|
|
}, options);
|
|
|
|
// Implement Transform methods on top of writer
|
|
this._transform = function (triple, encoding, done) { writer.addTriple(triple, done); };
|
|
this._flush = function (done) { writer.end(done); };
|
|
}
|
|
util.inherits(N3StreamWriter, Transform);
|
|
|
|
// ## Exports
|
|
// Export the `N3StreamWriter` class as a whole.
|
|
module.exports = N3StreamWriter;
|
|
|
|
},{"./N3Writer.js":9,"stream":29,"util":32}],8:[function(require,module,exports){
|
|
// **N3Util** provides N3 utility functions
|
|
|
|
var Xsd = 'http://www.w3.org/2001/XMLSchema#';
|
|
var XsdString = Xsd + 'string';
|
|
var XsdInteger = Xsd + 'integer';
|
|
var XsdDecimal = Xsd + 'decimal';
|
|
var XsdBoolean = Xsd + 'boolean';
|
|
var RdfLangString = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#langString';
|
|
|
|
var N3Util = {
|
|
// Tests whether the given entity (triple object) represents an IRI in the N3 library
|
|
isIRI: function (entity) {
|
|
if (!entity)
|
|
return entity;
|
|
var firstChar = entity[0];
|
|
return firstChar !== '"' && firstChar !== '_';
|
|
},
|
|
|
|
// Tests whether the given entity (triple object) represents a literal in the N3 library
|
|
isLiteral: function (entity) {
|
|
return entity && entity[0] === '"';
|
|
},
|
|
|
|
// Tests whether the given entity (triple object) represents a blank node in the N3 library
|
|
isBlank: function (entity) {
|
|
return entity && entity.substr(0, 2) === '_:';
|
|
},
|
|
|
|
// Gets the string value of a literal in the N3 library
|
|
getLiteralValue: function (literal) {
|
|
var match = /^"([^]*)"/.exec(literal);
|
|
if (!match)
|
|
throw new Error(literal + ' is not a literal');
|
|
return match[1];
|
|
},
|
|
|
|
// Gets the type of a literal in the N3 library
|
|
getLiteralType: function (literal) {
|
|
var match = /^"[^]*"(?:\^\^([^"]+)|(@)[^@"]+)?$/.exec(literal);
|
|
if (!match)
|
|
throw new Error(literal + ' is not a literal');
|
|
return match[1] || (match[2] ? RdfLangString : XsdString);
|
|
},
|
|
|
|
// Gets the language of a literal in the N3 library
|
|
getLiteralLanguage: function (literal) {
|
|
var match = /^"[^]*"(?:@([^@"]+)|\^\^[^"]+)?$/.exec(literal);
|
|
if (!match)
|
|
throw new Error(literal + ' is not a literal');
|
|
return match[1] ? match[1].toLowerCase() : '';
|
|
},
|
|
|
|
// Tests whether the given entity (triple object) represents a prefixed name
|
|
isPrefixedName: function (entity) {
|
|
return entity && /^[^:\/"']*:[^:\/"']+$/.test(entity);
|
|
},
|
|
|
|
// Expands the prefixed name to a full IRI (also when it occurs as a literal's type)
|
|
expandPrefixedName: function (prefixedName, prefixes) {
|
|
var match = /(?:^|"\^\^)([^:\/#"'\^_]*):[^\/]*$/.exec(prefixedName), prefix, base, index;
|
|
if (match)
|
|
prefix = match[1], base = prefixes[prefix], index = match.index;
|
|
if (base === undefined)
|
|
return prefixedName;
|
|
|
|
// The match index is non-zero when expanding a literal's type.
|
|
return index === 0 ? base + prefixedName.substr(prefix.length + 1)
|
|
: prefixedName.substr(0, index + 3) +
|
|
base + prefixedName.substr(index + prefix.length + 4);
|
|
},
|
|
|
|
// Creates an IRI in N3.js representation
|
|
createIRI: function (iri) {
|
|
return iri && iri[0] === '"' ? N3Util.getLiteralValue(iri) : iri;
|
|
},
|
|
|
|
// Creates a literal in N3.js representation
|
|
createLiteral: function (value, modifier) {
|
|
if (!modifier) {
|
|
switch (typeof value) {
|
|
case 'boolean':
|
|
modifier = XsdBoolean;
|
|
break;
|
|
case 'number':
|
|
if (isFinite(value)) {
|
|
modifier = value % 1 === 0 ? XsdInteger : XsdDecimal;
|
|
break;
|
|
}
|
|
default:
|
|
return '"' + value + '"';
|
|
}
|
|
}
|
|
return '"' + value +
|
|
(/^[a-z]+(-[a-z0-9]+)*$/i.test(modifier) ? '"@' + modifier.toLowerCase()
|
|
: '"^^' + modifier);
|
|
},
|
|
};
|
|
|
|
// Add the N3Util functions to the given object or its prototype
|
|
function AddN3Util(parent, toPrototype) {
|
|
for (var name in N3Util)
|
|
if (!toPrototype)
|
|
parent[name] = N3Util[name];
|
|
else
|
|
parent.prototype[name] = ApplyToThis(N3Util[name]);
|
|
|
|
return parent;
|
|
}
|
|
|
|
// Returns a function that applies `f` to the `this` object
|
|
function ApplyToThis(f) {
|
|
return function (a) { return f(this, a); };
|
|
}
|
|
|
|
// Expose N3Util, attaching all functions to it
|
|
module.exports = AddN3Util(AddN3Util);
|
|
|
|
},{}],9:[function(require,module,exports){
|
|
// **N3Writer** writes N3 documents.
|
|
|
|
// Matches a literal as represented in memory by the N3 library
|
|
var N3LiteralMatcher = /^"([^]*)"(?:\^\^(.+)|@([\-a-z]+))?$/i;
|
|
|
|
// rdf:type predicate (for 'a' abbreviation)
|
|
var RDF_PREFIX = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#',
|
|
RDF_TYPE = RDF_PREFIX + 'type';
|
|
|
|
// Characters in literals that require escaping
|
|
var escape = /["\\\t\n\r\b\f\u0000-\u0019\ud800-\udbff]/,
|
|
escapeAll = /["\\\t\n\r\b\f\u0000-\u0019]|[\ud800-\udbff][\udc00-\udfff]/g,
|
|
escapeReplacements = { '\\': '\\\\', '"': '\\"', '\t': '\\t',
|
|
'\n': '\\n', '\r': '\\r', '\b': '\\b', '\f': '\\f' };
|
|
|
|
// ## Constructor
|
|
function N3Writer(outputStream, options) {
|
|
if (!(this instanceof N3Writer))
|
|
return new N3Writer(outputStream, options);
|
|
|
|
// Shift arguments if the first argument is not a stream
|
|
if (outputStream && typeof outputStream.write !== 'function')
|
|
options = outputStream, outputStream = null;
|
|
options = options || {};
|
|
|
|
// If no output stream given, send the output as string through the end callback
|
|
if (!outputStream) {
|
|
var output = '';
|
|
this._outputStream = {
|
|
write: function (chunk, encoding, done) { output += chunk; done && done(); },
|
|
end: function (done) { done && done(null, output); },
|
|
};
|
|
this._endStream = true;
|
|
}
|
|
else {
|
|
this._outputStream = outputStream;
|
|
this._endStream = options.end === undefined ? true : !!options.end;
|
|
}
|
|
|
|
// Initialize writer, depending on the format
|
|
this._subject = null;
|
|
if (!(/triple|quad/i).test(options.format)) {
|
|
this._graph = '';
|
|
this._prefixIRIs = Object.create(null);
|
|
options.prefixes && this.addPrefixes(options.prefixes);
|
|
}
|
|
else {
|
|
this._writeTriple = this._writeTripleLine;
|
|
}
|
|
}
|
|
|
|
N3Writer.prototype = {
|
|
// ## Private methods
|
|
|
|
// ### `_write` writes the argument to the output stream
|
|
_write: function (string, callback) {
|
|
this._outputStream.write(string, 'utf8', callback);
|
|
},
|
|
|
|
// ### `_writeTriple` writes the triple to the output stream
|
|
_writeTriple: function (subject, predicate, object, graph, done) {
|
|
try {
|
|
// Write the graph's label if it has changed
|
|
if (this._graph !== graph) {
|
|
// Close the previous graph and start the new one
|
|
this._write((this._subject === null ? '' : (this._graph ? '\n}\n' : '.\n')) +
|
|
(graph ? this._encodeIriOrBlankNode(graph) + ' {\n' : ''));
|
|
this._graph = graph, this._subject = null;
|
|
}
|
|
// Don't repeat the subject if it's the same
|
|
if (this._subject === subject) {
|
|
// Don't repeat the predicate if it's the same
|
|
if (this._predicate === predicate)
|
|
this._write(', ' + this._encodeObject(object), done);
|
|
// Same subject, different predicate
|
|
else
|
|
this._write(';\n ' +
|
|
this._encodePredicate(this._predicate = predicate) + ' ' +
|
|
this._encodeObject(object), done);
|
|
}
|
|
// Different subject; write the whole triple
|
|
else
|
|
this._write((this._subject === null ? '' : '.\n') +
|
|
this._encodeSubject(this._subject = subject) + ' ' +
|
|
this._encodePredicate(this._predicate = predicate) + ' ' +
|
|
this._encodeObject(object), done);
|
|
}
|
|
catch (error) { done && done(error); }
|
|
},
|
|
|
|
// ### `_writeTripleLine` writes the triple or quad to the output stream as a single line
|
|
_writeTripleLine: function (subject, predicate, object, graph, done) {
|
|
// Don't use prefixes
|
|
delete this._prefixMatch;
|
|
// Write the triple
|
|
try {
|
|
this._write(this._encodeIriOrBlankNode(subject) + ' ' +
|
|
this._encodeIriOrBlankNode(predicate) + ' ' +
|
|
this._encodeObject(object) +
|
|
(graph ? ' ' + this._encodeIriOrBlankNode(graph) + '.\n' : '.\n'), done);
|
|
}
|
|
catch (error) { done && done(error); }
|
|
},
|
|
|
|
// ### `_encodeIriOrBlankNode` represents an IRI or blank node
|
|
_encodeIriOrBlankNode: function (iri) {
|
|
// A blank node is represented as-is
|
|
if (iri[0] === '_' && iri[1] === ':') return iri;
|
|
// Escape special characters
|
|
if (escape.test(iri))
|
|
iri = iri.replace(escapeAll, characterReplacer);
|
|
// Try to represent the IRI as prefixed name
|
|
var prefixMatch = this._prefixRegex.exec(iri);
|
|
return !prefixMatch ? '<' + iri + '>' :
|
|
(!prefixMatch[1] ? iri : this._prefixIRIs[prefixMatch[1]] + prefixMatch[2]);
|
|
},
|
|
|
|
// ### `_encodeLiteral` represents a literal
|
|
_encodeLiteral: function (value, type, language) {
|
|
// Escape special characters
|
|
if (escape.test(value))
|
|
value = value.replace(escapeAll, characterReplacer);
|
|
// Write the literal, possibly with type or language
|
|
if (language)
|
|
return '"' + value + '"@' + language;
|
|
else if (type)
|
|
return '"' + value + '"^^' + this._encodeIriOrBlankNode(type);
|
|
else
|
|
return '"' + value + '"';
|
|
},
|
|
|
|
// ### `_encodeSubject` represents a subject
|
|
_encodeSubject: function (subject) {
|
|
if (subject[0] === '"')
|
|
throw new Error('A literal as subject is not allowed: ' + subject);
|
|
return this._encodeIriOrBlankNode(subject);
|
|
},
|
|
|
|
// ### `_encodePredicate` represents a predicate
|
|
_encodePredicate: function (predicate) {
|
|
if (predicate[0] === '"')
|
|
throw new Error('A literal as predicate is not allowed: ' + predicate);
|
|
return predicate === RDF_TYPE ? 'a' : this._encodeIriOrBlankNode(predicate);
|
|
},
|
|
|
|
// ### `_encodeObject` represents an object
|
|
_encodeObject: function (object) {
|
|
// Represent an IRI or blank node
|
|
if (object[0] !== '"')
|
|
return this._encodeIriOrBlankNode(object);
|
|
// Represent a literal
|
|
var match = N3LiteralMatcher.exec(object);
|
|
if (!match) throw new Error('Invalid literal: ' + object);
|
|
return this._encodeLiteral(match[1], match[2], match[3]);
|
|
},
|
|
|
|
// ### `_blockedWrite` replaces `_write` after the writer has been closed
|
|
_blockedWrite: function () {
|
|
throw new Error('Cannot write because the writer has been closed.');
|
|
},
|
|
|
|
// ### `addTriple` adds the triple to the output stream
|
|
addTriple: function (subject, predicate, object, graph, done) {
|
|
// The triple was given as a triple object, so shift parameters
|
|
if (typeof object !== 'string')
|
|
this._writeTriple(subject.subject, subject.predicate, subject.object,
|
|
subject.graph || '', predicate);
|
|
// The optional `graph` parameter was not provided
|
|
else if (typeof graph !== 'string')
|
|
this._writeTriple(subject, predicate, object, '', graph);
|
|
// The `graph` parameter was provided
|
|
else
|
|
this._writeTriple(subject, predicate, object, graph, done);
|
|
},
|
|
|
|
// ### `addTriples` adds the triples to the output stream
|
|
addTriples: function (triples) {
|
|
for (var i = 0; i < triples.length; i++)
|
|
this.addTriple(triples[i]);
|
|
},
|
|
|
|
// ### `addPrefix` adds the prefix to the output stream
|
|
addPrefix: function (prefix, iri, done) {
|
|
var prefixes = {};
|
|
prefixes[prefix] = iri;
|
|
this.addPrefixes(prefixes, done);
|
|
},
|
|
|
|
// ### `addPrefixes` adds the prefixes to the output stream
|
|
addPrefixes: function (prefixes, done) {
|
|
// Add all useful prefixes
|
|
var prefixIRIs = this._prefixIRIs, hasPrefixes = false;
|
|
for (var prefix in prefixes) {
|
|
// Verify whether the prefix can be used and does not exist yet
|
|
var iri = prefixes[prefix];
|
|
if (/[#\/]$/.test(iri) && prefixIRIs[iri] !== (prefix += ':')) {
|
|
hasPrefixes = true;
|
|
prefixIRIs[iri] = prefix;
|
|
// Finish a possible pending triple
|
|
if (this._subject !== null) {
|
|
this._write(this._graph ? '\n}\n' : '.\n');
|
|
this._subject = null, this._graph = '';
|
|
}
|
|
// Write prefix
|
|
this._write('@prefix ' + prefix + ' <' + iri + '>.\n');
|
|
}
|
|
}
|
|
// Recreate the prefix matcher
|
|
if (hasPrefixes) {
|
|
var IRIlist = '', prefixList = '';
|
|
for (var prefixIRI in prefixIRIs) {
|
|
IRIlist += IRIlist ? '|' + prefixIRI : prefixIRI;
|
|
prefixList += (prefixList ? '|' : '') + prefixIRIs[prefixIRI];
|
|
}
|
|
IRIlist = IRIlist.replace(/[\]\/\(\)\*\+\?\.\\\$]/g, '\\$&');
|
|
this._prefixRegex = new RegExp('^(?:' + prefixList + ')[^\/]*$|' +
|
|
'^(' + IRIlist + ')([a-zA-Z][\\-_a-zA-Z0-9]*)$');
|
|
}
|
|
// End a prefix block with a newline
|
|
this._write(hasPrefixes ? '\n' : '', done);
|
|
},
|
|
|
|
// ### `_prefixRegex` matches a prefixed name or IRI that begins with one of the added prefixes
|
|
_prefixRegex: /$0^/,
|
|
|
|
// ### `end` signals the end of the output stream
|
|
end: function (done) {
|
|
// Finish a possible pending triple
|
|
if (this._subject !== null) {
|
|
this._write(this._graph ? '\n}\n' : '.\n');
|
|
this._subject = null;
|
|
}
|
|
// Disallow further writing
|
|
this._write = this._blockedWrite;
|
|
|
|
// Try to end the underlying stream, ensuring done is called exactly one time
|
|
var singleDone = done && function (error, result) { singleDone = null, done(error, result); };
|
|
if (this._endStream) {
|
|
try { return this._outputStream.end(singleDone); }
|
|
catch (error) { /* error closing stream */ }
|
|
}
|
|
singleDone && singleDone();
|
|
},
|
|
};
|
|
|
|
// Replaces a character by its escaped version
|
|
function characterReplacer(character) {
|
|
// Replace a single character by its escaped version
|
|
var result = escapeReplacements[character];
|
|
if (result === undefined) {
|
|
// Replace a single character with its 4-bit unicode escape sequence
|
|
if (character.length === 1) {
|
|
result = character.charCodeAt(0).toString(16);
|
|
result = '\\u0000'.substr(0, 6 - result.length) + result;
|
|
}
|
|
// Replace a surrogate pair with its 8-bit unicode escape sequence
|
|
else {
|
|
result = ((character.charCodeAt(0) - 0xD800) * 0x400 +
|
|
character.charCodeAt(1) + 0x2400).toString(16);
|
|
result = '\\U00000000'.substr(0, 10 - result.length) + result;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
// ## Exports
|
|
|
|
// Export the `N3Writer` class as a whole.
|
|
module.exports = N3Writer;
|
|
|
|
},{}],10:[function(require,module,exports){
|
|
/*!
|
|
* The buffer module from node.js, for the browser.
|
|
*
|
|
* @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
|
|
* @license MIT
|
|
*/
|
|
|
|
var base64 = require('base64-js')
|
|
var ieee754 = require('ieee754')
|
|
var isArray = require('is-array')
|
|
|
|
exports.Buffer = Buffer
|
|
exports.SlowBuffer = SlowBuffer
|
|
exports.INSPECT_MAX_BYTES = 50
|
|
Buffer.poolSize = 8192 // not used by this implementation
|
|
|
|
var kMaxLength = 0x3fffffff
|
|
var rootParent = {}
|
|
|
|
/**
|
|
* If `Buffer.TYPED_ARRAY_SUPPORT`:
|
|
* === true Use Uint8Array implementation (fastest)
|
|
* === false Use Object implementation (most compatible, even IE6)
|
|
*
|
|
* Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
|
|
* Opera 11.6+, iOS 4.2+.
|
|
*
|
|
* Note:
|
|
*
|
|
* - Implementation must support adding new properties to `Uint8Array` instances.
|
|
* Firefox 4-29 lacked support, fixed in Firefox 30+.
|
|
* See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.
|
|
*
|
|
* - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.
|
|
*
|
|
* - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of
|
|
* incorrect length in some situations.
|
|
*
|
|
* We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they will
|
|
* get the Object implementation, which is slower but will work correctly.
|
|
*/
|
|
Buffer.TYPED_ARRAY_SUPPORT = (function () {
|
|
try {
|
|
var buf = new ArrayBuffer(0)
|
|
var arr = new Uint8Array(buf)
|
|
arr.foo = function () { return 42 }
|
|
return 42 === arr.foo() && // typed array instances can be augmented
|
|
typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`
|
|
new Uint8Array(1).subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`
|
|
} catch (e) {
|
|
return false
|
|
}
|
|
})()
|
|
|
|
/**
|
|
* Class: Buffer
|
|
* =============
|
|
*
|
|
* The Buffer constructor returns instances of `Uint8Array` that are augmented
|
|
* with function properties for all the node `Buffer` API functions. We use
|
|
* `Uint8Array` so that square bracket notation works as expected -- it returns
|
|
* a single octet.
|
|
*
|
|
* By augmenting the instances, we can avoid modifying the `Uint8Array`
|
|
* prototype.
|
|
*/
|
|
function Buffer (subject, encoding, noZero) {
|
|
if (!(this instanceof Buffer))
|
|
return new Buffer(subject, encoding, noZero)
|
|
|
|
var type = typeof subject
|
|
|
|
// Find the length
|
|
var length
|
|
if (type === 'number')
|
|
length = subject > 0 ? subject >>> 0 : 0
|
|
else if (type === 'string') {
|
|
length = Buffer.byteLength(subject, encoding)
|
|
} else if (type === 'object' && subject !== null) { // assume object is array-like
|
|
if (subject.type === 'Buffer' && isArray(subject.data))
|
|
subject = subject.data
|
|
length = +subject.length > 0 ? Math.floor(+subject.length) : 0
|
|
} else
|
|
throw new TypeError('must start with number, buffer, array or string')
|
|
|
|
if (length > kMaxLength)
|
|
throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
|
|
'size: 0x' + kMaxLength.toString(16) + ' bytes')
|
|
|
|
var buf
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
// Preferred: Return an augmented `Uint8Array` instance for best performance
|
|
buf = Buffer._augment(new Uint8Array(length))
|
|
} else {
|
|
// Fallback: Return THIS instance of Buffer (created by `new`)
|
|
buf = this
|
|
buf.length = length
|
|
buf._isBuffer = true
|
|
}
|
|
|
|
var i
|
|
if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') {
|
|
// Speed optimization -- use set if we're copying from a typed array
|
|
buf._set(subject)
|
|
} else if (isArrayish(subject)) {
|
|
// Treat array-ish objects as a byte array
|
|
if (Buffer.isBuffer(subject)) {
|
|
for (i = 0; i < length; i++)
|
|
buf[i] = subject.readUInt8(i)
|
|
} else {
|
|
for (i = 0; i < length; i++)
|
|
buf[i] = ((subject[i] % 256) + 256) % 256
|
|
}
|
|
} else if (type === 'string') {
|
|
buf.write(subject, 0, encoding)
|
|
} else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) {
|
|
for (i = 0; i < length; i++) {
|
|
buf[i] = 0
|
|
}
|
|
}
|
|
|
|
if (length > 0 && length <= Buffer.poolSize)
|
|
buf.parent = rootParent
|
|
|
|
return buf
|
|
}
|
|
|
|
function SlowBuffer(subject, encoding, noZero) {
|
|
if (!(this instanceof SlowBuffer))
|
|
return new SlowBuffer(subject, encoding, noZero)
|
|
|
|
var buf = new Buffer(subject, encoding, noZero)
|
|
delete buf.parent
|
|
return buf
|
|
}
|
|
|
|
Buffer.isBuffer = function (b) {
|
|
return !!(b != null && b._isBuffer)
|
|
}
|
|
|
|
Buffer.compare = function (a, b) {
|
|
if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b))
|
|
throw new TypeError('Arguments must be Buffers')
|
|
|
|
var x = a.length
|
|
var y = b.length
|
|
for (var i = 0, len = Math.min(x, y); i < len && a[i] === b[i]; i++) {}
|
|
if (i !== len) {
|
|
x = a[i]
|
|
y = b[i]
|
|
}
|
|
if (x < y) return -1
|
|
if (y < x) return 1
|
|
return 0
|
|
}
|
|
|
|
Buffer.isEncoding = function (encoding) {
|
|
switch (String(encoding).toLowerCase()) {
|
|
case 'hex':
|
|
case 'utf8':
|
|
case 'utf-8':
|
|
case 'ascii':
|
|
case 'binary':
|
|
case 'base64':
|
|
case 'raw':
|
|
case 'ucs2':
|
|
case 'ucs-2':
|
|
case 'utf16le':
|
|
case 'utf-16le':
|
|
return true
|
|
default:
|
|
return false
|
|
}
|
|
}
|
|
|
|
Buffer.concat = function (list, totalLength) {
|
|
if (!isArray(list)) throw new TypeError('Usage: Buffer.concat(list[, length])')
|
|
|
|
if (list.length === 0) {
|
|
return new Buffer(0)
|
|
} else if (list.length === 1) {
|
|
return list[0]
|
|
}
|
|
|
|
var i
|
|
if (totalLength === undefined) {
|
|
totalLength = 0
|
|
for (i = 0; i < list.length; i++) {
|
|
totalLength += list[i].length
|
|
}
|
|
}
|
|
|
|
var buf = new Buffer(totalLength)
|
|
var pos = 0
|
|
for (i = 0; i < list.length; i++) {
|
|
var item = list[i]
|
|
item.copy(buf, pos)
|
|
pos += item.length
|
|
}
|
|
return buf
|
|
}
|
|
|
|
Buffer.byteLength = function (str, encoding) {
|
|
var ret
|
|
str = str + ''
|
|
switch (encoding || 'utf8') {
|
|
case 'ascii':
|
|
case 'binary':
|
|
case 'raw':
|
|
ret = str.length
|
|
break
|
|
case 'ucs2':
|
|
case 'ucs-2':
|
|
case 'utf16le':
|
|
case 'utf-16le':
|
|
ret = str.length * 2
|
|
break
|
|
case 'hex':
|
|
ret = str.length >>> 1
|
|
break
|
|
case 'utf8':
|
|
case 'utf-8':
|
|
ret = utf8ToBytes(str).length
|
|
break
|
|
case 'base64':
|
|
ret = base64ToBytes(str).length
|
|
break
|
|
default:
|
|
ret = str.length
|
|
}
|
|
return ret
|
|
}
|
|
|
|
// pre-set for values that may exist in the future
|
|
Buffer.prototype.length = undefined
|
|
Buffer.prototype.parent = undefined
|
|
|
|
// toString(encoding, start=0, end=buffer.length)
|
|
Buffer.prototype.toString = function (encoding, start, end) {
|
|
var loweredCase = false
|
|
|
|
start = start >>> 0
|
|
end = end === undefined || end === Infinity ? this.length : end >>> 0
|
|
|
|
if (!encoding) encoding = 'utf8'
|
|
if (start < 0) start = 0
|
|
if (end > this.length) end = this.length
|
|
if (end <= start) return ''
|
|
|
|
while (true) {
|
|
switch (encoding) {
|
|
case 'hex':
|
|
return hexSlice(this, start, end)
|
|
|
|
case 'utf8':
|
|
case 'utf-8':
|
|
return utf8Slice(this, start, end)
|
|
|
|
case 'ascii':
|
|
return asciiSlice(this, start, end)
|
|
|
|
case 'binary':
|
|
return binarySlice(this, start, end)
|
|
|
|
case 'base64':
|
|
return base64Slice(this, start, end)
|
|
|
|
case 'ucs2':
|
|
case 'ucs-2':
|
|
case 'utf16le':
|
|
case 'utf-16le':
|
|
return utf16leSlice(this, start, end)
|
|
|
|
default:
|
|
if (loweredCase)
|
|
throw new TypeError('Unknown encoding: ' + encoding)
|
|
encoding = (encoding + '').toLowerCase()
|
|
loweredCase = true
|
|
}
|
|
}
|
|
}
|
|
|
|
Buffer.prototype.equals = function (b) {
|
|
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
|
|
return Buffer.compare(this, b) === 0
|
|
}
|
|
|
|
Buffer.prototype.inspect = function () {
|
|
var str = ''
|
|
var max = exports.INSPECT_MAX_BYTES
|
|
if (this.length > 0) {
|
|
str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')
|
|
if (this.length > max)
|
|
str += ' ... '
|
|
}
|
|
return '<Buffer ' + str + '>'
|
|
}
|
|
|
|
Buffer.prototype.compare = function (b) {
|
|
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
|
|
return Buffer.compare(this, b)
|
|
}
|
|
|
|
// `get` will be removed in Node 0.13+
|
|
Buffer.prototype.get = function (offset) {
|
|
console.log('.get() is deprecated. Access using array indexes instead.')
|
|
return this.readUInt8(offset)
|
|
}
|
|
|
|
// `set` will be removed in Node 0.13+
|
|
Buffer.prototype.set = function (v, offset) {
|
|
console.log('.set() is deprecated. Access using array indexes instead.')
|
|
return this.writeUInt8(v, offset)
|
|
}
|
|
|
|
function hexWrite (buf, string, offset, length) {
|
|
offset = Number(offset) || 0
|
|
var remaining = buf.length - offset
|
|
if (!length) {
|
|
length = remaining
|
|
} else {
|
|
length = Number(length)
|
|
if (length > remaining) {
|
|
length = remaining
|
|
}
|
|
}
|
|
|
|
// must be an even number of digits
|
|
var strLen = string.length
|
|
if (strLen % 2 !== 0) throw new Error('Invalid hex string')
|
|
|
|
if (length > strLen / 2) {
|
|
length = strLen / 2
|
|
}
|
|
for (var i = 0; i < length; i++) {
|
|
var byte = parseInt(string.substr(i * 2, 2), 16)
|
|
if (isNaN(byte)) throw new Error('Invalid hex string')
|
|
buf[offset + i] = byte
|
|
}
|
|
return i
|
|
}
|
|
|
|
function utf8Write (buf, string, offset, length) {
|
|
var charsWritten = blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)
|
|
return charsWritten
|
|
}
|
|
|
|
function asciiWrite (buf, string, offset, length) {
|
|
var charsWritten = blitBuffer(asciiToBytes(string), buf, offset, length)
|
|
return charsWritten
|
|
}
|
|
|
|
function binaryWrite (buf, string, offset, length) {
|
|
return asciiWrite(buf, string, offset, length)
|
|
}
|
|
|
|
function base64Write (buf, string, offset, length) {
|
|
var charsWritten = blitBuffer(base64ToBytes(string), buf, offset, length)
|
|
return charsWritten
|
|
}
|
|
|
|
function utf16leWrite (buf, string, offset, length) {
|
|
var charsWritten = blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length, 2)
|
|
return charsWritten
|
|
}
|
|
|
|
Buffer.prototype.write = function (string, offset, length, encoding) {
|
|
// Support both (string, offset, length, encoding)
|
|
// and the legacy (string, encoding, offset, length)
|
|
if (isFinite(offset)) {
|
|
if (!isFinite(length)) {
|
|
encoding = length
|
|
length = undefined
|
|
}
|
|
} else { // legacy
|
|
var swap = encoding
|
|
encoding = offset
|
|
offset = length
|
|
length = swap
|
|
}
|
|
|
|
offset = Number(offset) || 0
|
|
|
|
if (length < 0 || offset < 0 || offset > this.length)
|
|
throw new RangeError('attempt to write outside buffer bounds');
|
|
|
|
var remaining = this.length - offset
|
|
if (!length) {
|
|
length = remaining
|
|
} else {
|
|
length = Number(length)
|
|
if (length > remaining) {
|
|
length = remaining
|
|
}
|
|
}
|
|
encoding = String(encoding || 'utf8').toLowerCase()
|
|
|
|
var ret
|
|
switch (encoding) {
|
|
case 'hex':
|
|
ret = hexWrite(this, string, offset, length)
|
|
break
|
|
case 'utf8':
|
|
case 'utf-8':
|
|
ret = utf8Write(this, string, offset, length)
|
|
break
|
|
case 'ascii':
|
|
ret = asciiWrite(this, string, offset, length)
|
|
break
|
|
case 'binary':
|
|
ret = binaryWrite(this, string, offset, length)
|
|
break
|
|
case 'base64':
|
|
ret = base64Write(this, string, offset, length)
|
|
break
|
|
case 'ucs2':
|
|
case 'ucs-2':
|
|
case 'utf16le':
|
|
case 'utf-16le':
|
|
ret = utf16leWrite(this, string, offset, length)
|
|
break
|
|
default:
|
|
throw new TypeError('Unknown encoding: ' + encoding)
|
|
}
|
|
return ret
|
|
}
|
|
|
|
Buffer.prototype.toJSON = function () {
|
|
return {
|
|
type: 'Buffer',
|
|
data: Array.prototype.slice.call(this._arr || this, 0)
|
|
}
|
|
}
|
|
|
|
function base64Slice (buf, start, end) {
|
|
if (start === 0 && end === buf.length) {
|
|
return base64.fromByteArray(buf)
|
|
} else {
|
|
return base64.fromByteArray(buf.slice(start, end))
|
|
}
|
|
}
|
|
|
|
function utf8Slice (buf, start, end) {
|
|
var res = ''
|
|
var tmp = ''
|
|
end = Math.min(buf.length, end)
|
|
|
|
for (var i = start; i < end; i++) {
|
|
if (buf[i] <= 0x7F) {
|
|
res += decodeUtf8Char(tmp) + String.fromCharCode(buf[i])
|
|
tmp = ''
|
|
} else {
|
|
tmp += '%' + buf[i].toString(16)
|
|
}
|
|
}
|
|
|
|
return res + decodeUtf8Char(tmp)
|
|
}
|
|
|
|
function asciiSlice (buf, start, end) {
|
|
var ret = ''
|
|
end = Math.min(buf.length, end)
|
|
|
|
for (var i = start; i < end; i++) {
|
|
ret += String.fromCharCode(buf[i] & 0x7F)
|
|
}
|
|
return ret
|
|
}
|
|
|
|
function binarySlice (buf, start, end) {
|
|
var ret = ''
|
|
end = Math.min(buf.length, end)
|
|
|
|
for (var i = start; i < end; i++) {
|
|
ret += String.fromCharCode(buf[i])
|
|
}
|
|
return ret
|
|
}
|
|
|
|
function hexSlice (buf, start, end) {
|
|
var len = buf.length
|
|
|
|
if (!start || start < 0) start = 0
|
|
if (!end || end < 0 || end > len) end = len
|
|
|
|
var out = ''
|
|
for (var i = start; i < end; i++) {
|
|
out += toHex(buf[i])
|
|
}
|
|
return out
|
|
}
|
|
|
|
function utf16leSlice (buf, start, end) {
|
|
var bytes = buf.slice(start, end)
|
|
var res = ''
|
|
for (var i = 0; i < bytes.length; i += 2) {
|
|
res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)
|
|
}
|
|
return res
|
|
}
|
|
|
|
Buffer.prototype.slice = function (start, end) {
|
|
var len = this.length
|
|
start = ~~start
|
|
end = end === undefined ? len : ~~end
|
|
|
|
if (start < 0) {
|
|
start += len;
|
|
if (start < 0)
|
|
start = 0
|
|
} else if (start > len) {
|
|
start = len
|
|
}
|
|
|
|
if (end < 0) {
|
|
end += len
|
|
if (end < 0)
|
|
end = 0
|
|
} else if (end > len) {
|
|
end = len
|
|
}
|
|
|
|
if (end < start)
|
|
end = start
|
|
|
|
var newBuf
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
newBuf = Buffer._augment(this.subarray(start, end))
|
|
} else {
|
|
var sliceLen = end - start
|
|
newBuf = new Buffer(sliceLen, undefined, true)
|
|
for (var i = 0; i < sliceLen; i++) {
|
|
newBuf[i] = this[i + start]
|
|
}
|
|
}
|
|
|
|
if (newBuf.length)
|
|
newBuf.parent = this.parent || this
|
|
|
|
return newBuf
|
|
}
|
|
|
|
/*
|
|
* Need to make sure that buffer isn't trying to write out of bounds.
|
|
*/
|
|
function checkOffset (offset, ext, length) {
|
|
if ((offset % 1) !== 0 || offset < 0)
|
|
throw new RangeError('offset is not uint')
|
|
if (offset + ext > length)
|
|
throw new RangeError('Trying to access beyond buffer length')
|
|
}
|
|
|
|
Buffer.prototype.readUIntLE = function (offset, byteLength, noAssert) {
|
|
offset = offset >>> 0
|
|
byteLength = byteLength >>> 0
|
|
if (!noAssert)
|
|
checkOffset(offset, byteLength, this.length)
|
|
|
|
var val = this[offset]
|
|
var mul = 1
|
|
var i = 0
|
|
while (++i < byteLength && (mul *= 0x100))
|
|
val += this[offset + i] * mul
|
|
|
|
return val
|
|
}
|
|
|
|
Buffer.prototype.readUIntBE = function (offset, byteLength, noAssert) {
|
|
offset = offset >>> 0
|
|
byteLength = byteLength >>> 0
|
|
if (!noAssert)
|
|
checkOffset(offset, byteLength, this.length)
|
|
|
|
var val = this[offset + --byteLength]
|
|
var mul = 1
|
|
while (byteLength > 0 && (mul *= 0x100))
|
|
val += this[offset + --byteLength] * mul;
|
|
|
|
return val
|
|
}
|
|
|
|
Buffer.prototype.readUInt8 = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 1, this.length)
|
|
return this[offset]
|
|
}
|
|
|
|
Buffer.prototype.readUInt16LE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 2, this.length)
|
|
return this[offset] | (this[offset + 1] << 8)
|
|
}
|
|
|
|
Buffer.prototype.readUInt16BE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 2, this.length)
|
|
return (this[offset] << 8) | this[offset + 1]
|
|
}
|
|
|
|
Buffer.prototype.readUInt32LE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 4, this.length)
|
|
|
|
return ((this[offset]) |
|
|
(this[offset + 1] << 8) |
|
|
(this[offset + 2] << 16)) +
|
|
(this[offset + 3] * 0x1000000)
|
|
}
|
|
|
|
Buffer.prototype.readUInt32BE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 4, this.length)
|
|
|
|
return (this[offset] * 0x1000000) +
|
|
((this[offset + 1] << 16) |
|
|
(this[offset + 2] << 8) |
|
|
this[offset + 3])
|
|
}
|
|
|
|
Buffer.prototype.readIntLE = function (offset, byteLength, noAssert) {
|
|
offset = offset >>> 0
|
|
byteLength = byteLength >>> 0
|
|
if (!noAssert)
|
|
checkOffset(offset, byteLength, this.length)
|
|
|
|
var val = this[offset]
|
|
var mul = 1
|
|
var i = 0
|
|
while (++i < byteLength && (mul *= 0x100))
|
|
val += this[offset + i] * mul
|
|
mul *= 0x80
|
|
|
|
if (val >= mul)
|
|
val -= Math.pow(2, 8 * byteLength)
|
|
|
|
return val
|
|
}
|
|
|
|
Buffer.prototype.readIntBE = function (offset, byteLength, noAssert) {
|
|
offset = offset >>> 0
|
|
byteLength = byteLength >>> 0
|
|
if (!noAssert)
|
|
checkOffset(offset, byteLength, this.length)
|
|
|
|
var i = byteLength
|
|
var mul = 1
|
|
var val = this[offset + --i]
|
|
while (i > 0 && (mul *= 0x100))
|
|
val += this[offset + --i] * mul
|
|
mul *= 0x80
|
|
|
|
if (val >= mul)
|
|
val -= Math.pow(2, 8 * byteLength)
|
|
|
|
return val
|
|
}
|
|
|
|
Buffer.prototype.readInt8 = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 1, this.length)
|
|
if (!(this[offset] & 0x80))
|
|
return (this[offset])
|
|
return ((0xff - this[offset] + 1) * -1)
|
|
}
|
|
|
|
Buffer.prototype.readInt16LE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 2, this.length)
|
|
var val = this[offset] | (this[offset + 1] << 8)
|
|
return (val & 0x8000) ? val | 0xFFFF0000 : val
|
|
}
|
|
|
|
Buffer.prototype.readInt16BE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 2, this.length)
|
|
var val = this[offset + 1] | (this[offset] << 8)
|
|
return (val & 0x8000) ? val | 0xFFFF0000 : val
|
|
}
|
|
|
|
Buffer.prototype.readInt32LE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 4, this.length)
|
|
|
|
return (this[offset]) |
|
|
(this[offset + 1] << 8) |
|
|
(this[offset + 2] << 16) |
|
|
(this[offset + 3] << 24)
|
|
}
|
|
|
|
Buffer.prototype.readInt32BE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 4, this.length)
|
|
|
|
return (this[offset] << 24) |
|
|
(this[offset + 1] << 16) |
|
|
(this[offset + 2] << 8) |
|
|
(this[offset + 3])
|
|
}
|
|
|
|
Buffer.prototype.readFloatLE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 4, this.length)
|
|
return ieee754.read(this, offset, true, 23, 4)
|
|
}
|
|
|
|
Buffer.prototype.readFloatBE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 4, this.length)
|
|
return ieee754.read(this, offset, false, 23, 4)
|
|
}
|
|
|
|
Buffer.prototype.readDoubleLE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 8, this.length)
|
|
return ieee754.read(this, offset, true, 52, 8)
|
|
}
|
|
|
|
Buffer.prototype.readDoubleBE = function (offset, noAssert) {
|
|
if (!noAssert)
|
|
checkOffset(offset, 8, this.length)
|
|
return ieee754.read(this, offset, false, 52, 8)
|
|
}
|
|
|
|
function checkInt (buf, value, offset, ext, max, min) {
|
|
if (!Buffer.isBuffer(buf)) throw new TypeError('buffer must be a Buffer instance')
|
|
if (value > max || value < min) throw new RangeError('value is out of bounds')
|
|
if (offset + ext > buf.length) throw new RangeError('index out of range')
|
|
}
|
|
|
|
Buffer.prototype.writeUIntLE = function (value, offset, byteLength, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
byteLength = byteLength >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0)
|
|
|
|
var mul = 1
|
|
var i = 0
|
|
this[offset] = value & 0xFF
|
|
while (++i < byteLength && (mul *= 0x100))
|
|
this[offset + i] = (value / mul) >>> 0 & 0xFF
|
|
|
|
return offset + byteLength
|
|
}
|
|
|
|
Buffer.prototype.writeUIntBE = function (value, offset, byteLength, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
byteLength = byteLength >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0)
|
|
|
|
var i = byteLength - 1
|
|
var mul = 1
|
|
this[offset + i] = value & 0xFF
|
|
while (--i >= 0 && (mul *= 0x100))
|
|
this[offset + i] = (value / mul) >>> 0 & 0xFF
|
|
|
|
return offset + byteLength
|
|
}
|
|
|
|
Buffer.prototype.writeUInt8 = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 1, 0xff, 0)
|
|
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)
|
|
this[offset] = value
|
|
return offset + 1
|
|
}
|
|
|
|
function objectWriteUInt16 (buf, value, offset, littleEndian) {
|
|
if (value < 0) value = 0xffff + value + 1
|
|
for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; i++) {
|
|
buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>
|
|
(littleEndian ? i : 1 - i) * 8
|
|
}
|
|
}
|
|
|
|
Buffer.prototype.writeUInt16LE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 2, 0xffff, 0)
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset] = value
|
|
this[offset + 1] = (value >>> 8)
|
|
} else objectWriteUInt16(this, value, offset, true)
|
|
return offset + 2
|
|
}
|
|
|
|
Buffer.prototype.writeUInt16BE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 2, 0xffff, 0)
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset] = (value >>> 8)
|
|
this[offset + 1] = value
|
|
} else objectWriteUInt16(this, value, offset, false)
|
|
return offset + 2
|
|
}
|
|
|
|
function objectWriteUInt32 (buf, value, offset, littleEndian) {
|
|
if (value < 0) value = 0xffffffff + value + 1
|
|
for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; i++) {
|
|
buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff
|
|
}
|
|
}
|
|
|
|
Buffer.prototype.writeUInt32LE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 4, 0xffffffff, 0)
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset + 3] = (value >>> 24)
|
|
this[offset + 2] = (value >>> 16)
|
|
this[offset + 1] = (value >>> 8)
|
|
this[offset] = value
|
|
} else objectWriteUInt32(this, value, offset, true)
|
|
return offset + 4
|
|
}
|
|
|
|
Buffer.prototype.writeUInt32BE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 4, 0xffffffff, 0)
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset] = (value >>> 24)
|
|
this[offset + 1] = (value >>> 16)
|
|
this[offset + 2] = (value >>> 8)
|
|
this[offset + 3] = value
|
|
} else objectWriteUInt32(this, value, offset, false)
|
|
return offset + 4
|
|
}
|
|
|
|
Buffer.prototype.writeIntLE = function (value, offset, byteLength, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert) {
|
|
checkInt(this,
|
|
value,
|
|
offset,
|
|
byteLength,
|
|
Math.pow(2, 8 * byteLength - 1) - 1,
|
|
-Math.pow(2, 8 * byteLength - 1))
|
|
}
|
|
|
|
var i = 0
|
|
var mul = 1
|
|
var sub = value < 0 ? 1 : 0
|
|
this[offset] = value & 0xFF
|
|
while (++i < byteLength && (mul *= 0x100))
|
|
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
|
|
|
|
return offset + byteLength
|
|
}
|
|
|
|
Buffer.prototype.writeIntBE = function (value, offset, byteLength, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert) {
|
|
checkInt(this,
|
|
value,
|
|
offset,
|
|
byteLength,
|
|
Math.pow(2, 8 * byteLength - 1) - 1,
|
|
-Math.pow(2, 8 * byteLength - 1))
|
|
}
|
|
|
|
var i = byteLength - 1
|
|
var mul = 1
|
|
var sub = value < 0 ? 1 : 0
|
|
this[offset + i] = value & 0xFF
|
|
while (--i >= 0 && (mul *= 0x100))
|
|
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
|
|
|
|
return offset + byteLength
|
|
}
|
|
|
|
Buffer.prototype.writeInt8 = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 1, 0x7f, -0x80)
|
|
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)
|
|
if (value < 0) value = 0xff + value + 1
|
|
this[offset] = value
|
|
return offset + 1
|
|
}
|
|
|
|
Buffer.prototype.writeInt16LE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 2, 0x7fff, -0x8000)
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset] = value
|
|
this[offset + 1] = (value >>> 8)
|
|
} else objectWriteUInt16(this, value, offset, true)
|
|
return offset + 2
|
|
}
|
|
|
|
Buffer.prototype.writeInt16BE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 2, 0x7fff, -0x8000)
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset] = (value >>> 8)
|
|
this[offset + 1] = value
|
|
} else objectWriteUInt16(this, value, offset, false)
|
|
return offset + 2
|
|
}
|
|
|
|
Buffer.prototype.writeInt32LE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset] = value
|
|
this[offset + 1] = (value >>> 8)
|
|
this[offset + 2] = (value >>> 16)
|
|
this[offset + 3] = (value >>> 24)
|
|
} else objectWriteUInt32(this, value, offset, true)
|
|
return offset + 4
|
|
}
|
|
|
|
Buffer.prototype.writeInt32BE = function (value, offset, noAssert) {
|
|
value = +value
|
|
offset = offset >>> 0
|
|
if (!noAssert)
|
|
checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
|
|
if (value < 0) value = 0xffffffff + value + 1
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
this[offset] = (value >>> 24)
|
|
this[offset + 1] = (value >>> 16)
|
|
this[offset + 2] = (value >>> 8)
|
|
this[offset + 3] = value
|
|
} else objectWriteUInt32(this, value, offset, false)
|
|
return offset + 4
|
|
}
|
|
|
|
function checkIEEE754 (buf, value, offset, ext, max, min) {
|
|
if (value > max || value < min) throw new RangeError('value is out of bounds')
|
|
if (offset + ext > buf.length) throw new RangeError('index out of range')
|
|
if (offset < 0) throw new RangeError('index out of range')
|
|
}
|
|
|
|
function writeFloat (buf, value, offset, littleEndian, noAssert) {
|
|
if (!noAssert)
|
|
checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)
|
|
ieee754.write(buf, value, offset, littleEndian, 23, 4)
|
|
return offset + 4
|
|
}
|
|
|
|
Buffer.prototype.writeFloatLE = function (value, offset, noAssert) {
|
|
return writeFloat(this, value, offset, true, noAssert)
|
|
}
|
|
|
|
Buffer.prototype.writeFloatBE = function (value, offset, noAssert) {
|
|
return writeFloat(this, value, offset, false, noAssert)
|
|
}
|
|
|
|
function writeDouble (buf, value, offset, littleEndian, noAssert) {
|
|
if (!noAssert)
|
|
checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)
|
|
ieee754.write(buf, value, offset, littleEndian, 52, 8)
|
|
return offset + 8
|
|
}
|
|
|
|
Buffer.prototype.writeDoubleLE = function (value, offset, noAssert) {
|
|
return writeDouble(this, value, offset, true, noAssert)
|
|
}
|
|
|
|
Buffer.prototype.writeDoubleBE = function (value, offset, noAssert) {
|
|
return writeDouble(this, value, offset, false, noAssert)
|
|
}
|
|
|
|
// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
|
|
Buffer.prototype.copy = function (target, target_start, start, end) {
|
|
var source = this
|
|
|
|
if (!start) start = 0
|
|
if (!end && end !== 0) end = this.length
|
|
if (target_start >= target.length) target_start = target.length
|
|
if (!target_start) target_start = 0
|
|
if (end > 0 && end < start) end = start
|
|
|
|
// Copy 0 bytes; we're done
|
|
if (end === start) return 0
|
|
if (target.length === 0 || source.length === 0) return 0
|
|
|
|
// Fatal error conditions
|
|
if (target_start < 0)
|
|
throw new RangeError('targetStart out of bounds')
|
|
if (start < 0 || start >= source.length) throw new RangeError('sourceStart out of bounds')
|
|
if (end < 0) throw new RangeError('sourceEnd out of bounds')
|
|
|
|
// Are we oob?
|
|
if (end > this.length)
|
|
end = this.length
|
|
if (target.length - target_start < end - start)
|
|
end = target.length - target_start + start
|
|
|
|
var len = end - start
|
|
|
|
if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {
|
|
for (var i = 0; i < len; i++) {
|
|
target[i + target_start] = this[i + start]
|
|
}
|
|
} else {
|
|
target._set(this.subarray(start, start + len), target_start)
|
|
}
|
|
|
|
return len
|
|
}
|
|
|
|
// fill(value, start=0, end=buffer.length)
|
|
Buffer.prototype.fill = function (value, start, end) {
|
|
if (!value) value = 0
|
|
if (!start) start = 0
|
|
if (!end) end = this.length
|
|
|
|
if (end < start) throw new RangeError('end < start')
|
|
|
|
// Fill 0 bytes; we're done
|
|
if (end === start) return
|
|
if (this.length === 0) return
|
|
|
|
if (start < 0 || start >= this.length) throw new RangeError('start out of bounds')
|
|
if (end < 0 || end > this.length) throw new RangeError('end out of bounds')
|
|
|
|
var i
|
|
if (typeof value === 'number') {
|
|
for (i = start; i < end; i++) {
|
|
this[i] = value
|
|
}
|
|
} else {
|
|
var bytes = utf8ToBytes(value.toString())
|
|
var len = bytes.length
|
|
for (i = start; i < end; i++) {
|
|
this[i] = bytes[i % len]
|
|
}
|
|
}
|
|
|
|
return this
|
|
}
|
|
|
|
/**
|
|
* Creates a new `ArrayBuffer` with the *copied* memory of the buffer instance.
|
|
* Added in Node 0.12. Only available in browsers that support ArrayBuffer.
|
|
*/
|
|
Buffer.prototype.toArrayBuffer = function () {
|
|
if (typeof Uint8Array !== 'undefined') {
|
|
if (Buffer.TYPED_ARRAY_SUPPORT) {
|
|
return (new Buffer(this)).buffer
|
|
} else {
|
|
var buf = new Uint8Array(this.length)
|
|
for (var i = 0, len = buf.length; i < len; i += 1) {
|
|
buf[i] = this[i]
|
|
}
|
|
return buf.buffer
|
|
}
|
|
} else {
|
|
throw new TypeError('Buffer.toArrayBuffer not supported in this browser')
|
|
}
|
|
}
|
|
|
|
// HELPER FUNCTIONS
|
|
// ================
|
|
|
|
var BP = Buffer.prototype
|
|
|
|
/**
|
|
* Augment a Uint8Array *instance* (not the Uint8Array class!) with Buffer methods
|
|
*/
|
|
Buffer._augment = function (arr) {
|
|
arr.constructor = Buffer
|
|
arr._isBuffer = true
|
|
|
|
// save reference to original Uint8Array get/set methods before overwriting
|
|
arr._get = arr.get
|
|
arr._set = arr.set
|
|
|
|
// deprecated, will be removed in node 0.13+
|
|
arr.get = BP.get
|
|
arr.set = BP.set
|
|
|
|
arr.write = BP.write
|
|
arr.toString = BP.toString
|
|
arr.toLocaleString = BP.toString
|
|
arr.toJSON = BP.toJSON
|
|
arr.equals = BP.equals
|
|
arr.compare = BP.compare
|
|
arr.copy = BP.copy
|
|
arr.slice = BP.slice
|
|
arr.readUIntLE = BP.readUIntLE
|
|
arr.readUIntBE = BP.readUIntBE
|
|
arr.readUInt8 = BP.readUInt8
|
|
arr.readUInt16LE = BP.readUInt16LE
|
|
arr.readUInt16BE = BP.readUInt16BE
|
|
arr.readUInt32LE = BP.readUInt32LE
|
|
arr.readUInt32BE = BP.readUInt32BE
|
|
arr.readIntLE = BP.readIntLE
|
|
arr.readIntBE = BP.readIntBE
|
|
arr.readInt8 = BP.readInt8
|
|
arr.readInt16LE = BP.readInt16LE
|
|
arr.readInt16BE = BP.readInt16BE
|
|
arr.readInt32LE = BP.readInt32LE
|
|
arr.readInt32BE = BP.readInt32BE
|
|
arr.readFloatLE = BP.readFloatLE
|
|
arr.readFloatBE = BP.readFloatBE
|
|
arr.readDoubleLE = BP.readDoubleLE
|
|
arr.readDoubleBE = BP.readDoubleBE
|
|
arr.writeUInt8 = BP.writeUInt8
|
|
arr.writeUIntLE = BP.writeUIntLE
|
|
arr.writeUIntBE = BP.writeUIntBE
|
|
arr.writeUInt16LE = BP.writeUInt16LE
|
|
arr.writeUInt16BE = BP.writeUInt16BE
|
|
arr.writeUInt32LE = BP.writeUInt32LE
|
|
arr.writeUInt32BE = BP.writeUInt32BE
|
|
arr.writeIntLE = BP.writeIntLE
|
|
arr.writeIntBE = BP.writeIntBE
|
|
arr.writeInt8 = BP.writeInt8
|
|
arr.writeInt16LE = BP.writeInt16LE
|
|
arr.writeInt16BE = BP.writeInt16BE
|
|
arr.writeInt32LE = BP.writeInt32LE
|
|
arr.writeInt32BE = BP.writeInt32BE
|
|
arr.writeFloatLE = BP.writeFloatLE
|
|
arr.writeFloatBE = BP.writeFloatBE
|
|
arr.writeDoubleLE = BP.writeDoubleLE
|
|
arr.writeDoubleBE = BP.writeDoubleBE
|
|
arr.fill = BP.fill
|
|
arr.inspect = BP.inspect
|
|
arr.toArrayBuffer = BP.toArrayBuffer
|
|
|
|
return arr
|
|
}
|
|
|
|
var INVALID_BASE64_RE = /[^+\/0-9A-z\-]/g
|
|
|
|
function base64clean (str) {
|
|
// Node strips out invalid characters like \n and \t from the string, base64-js does not
|
|
str = stringtrim(str).replace(INVALID_BASE64_RE, '')
|
|
// Node converts strings with length < 2 to ''
|
|
if (str.length < 2) return ''
|
|
// Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
|
|
while (str.length % 4 !== 0) {
|
|
str = str + '='
|
|
}
|
|
return str
|
|
}
|
|
|
|
function stringtrim (str) {
|
|
if (str.trim) return str.trim()
|
|
return str.replace(/^\s+|\s+$/g, '')
|
|
}
|
|
|
|
function isArrayish (subject) {
|
|
return isArray(subject) || Buffer.isBuffer(subject) ||
|
|
subject && typeof subject === 'object' &&
|
|
typeof subject.length === 'number'
|
|
}
|
|
|
|
function toHex (n) {
|
|
if (n < 16) return '0' + n.toString(16)
|
|
return n.toString(16)
|
|
}
|
|
|
|
function utf8ToBytes(string, units) {
|
|
var codePoint, length = string.length
|
|
var leadSurrogate = null
|
|
units = units || Infinity
|
|
var bytes = []
|
|
var i = 0
|
|
|
|
for (; i<length; i++) {
|
|
codePoint = string.charCodeAt(i)
|
|
|
|
// is surrogate component
|
|
if (codePoint > 0xD7FF && codePoint < 0xE000) {
|
|
|
|
// last char was a lead
|
|
if (leadSurrogate) {
|
|
|
|
// 2 leads in a row
|
|
if (codePoint < 0xDC00) {
|
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
|
|
leadSurrogate = codePoint
|
|
continue
|
|
}
|
|
|
|
// valid surrogate pair
|
|
else {
|
|
codePoint = leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00 | 0x10000
|
|
leadSurrogate = null
|
|
}
|
|
}
|
|
|
|
// no lead yet
|
|
else {
|
|
|
|
// unexpected trail
|
|
if (codePoint > 0xDBFF) {
|
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
|
|
continue
|
|
}
|
|
|
|
// unpaired lead
|
|
else if (i + 1 === length) {
|
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
|
|
continue
|
|
}
|
|
|
|
// valid lead
|
|
else {
|
|
leadSurrogate = codePoint
|
|
continue
|
|
}
|
|
}
|
|
}
|
|
|
|
// valid bmp char, but last char was a lead
|
|
else if (leadSurrogate) {
|
|
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
|
|
leadSurrogate = null
|
|
}
|
|
|
|
// encode utf8
|
|
if (codePoint < 0x80) {
|
|
if ((units -= 1) < 0) break
|
|
bytes.push(codePoint)
|
|
}
|
|
else if (codePoint < 0x800) {
|
|
if ((units -= 2) < 0) break
|
|
bytes.push(
|
|
codePoint >> 0x6 | 0xC0,
|
|
codePoint & 0x3F | 0x80
|
|
);
|
|
}
|
|
else if (codePoint < 0x10000) {
|
|
if ((units -= 3) < 0) break
|
|
bytes.push(
|
|
codePoint >> 0xC | 0xE0,
|
|
codePoint >> 0x6 & 0x3F | 0x80,
|
|
codePoint & 0x3F | 0x80
|
|
);
|
|
}
|
|
else if (codePoint < 0x200000) {
|
|
if ((units -= 4) < 0) break
|
|
bytes.push(
|
|
codePoint >> 0x12 | 0xF0,
|
|
codePoint >> 0xC & 0x3F | 0x80,
|
|
codePoint >> 0x6 & 0x3F | 0x80,
|
|
codePoint & 0x3F | 0x80
|
|
);
|
|
}
|
|
else {
|
|
throw new Error('Invalid code point')
|
|
}
|
|
}
|
|
|
|
return bytes
|
|
}
|
|
|
|
function asciiToBytes (str) {
|
|
var byteArray = []
|
|
for (var i = 0; i < str.length; i++) {
|
|
// Node's code seems to be doing this and not & 0x7F..
|
|
byteArray.push(str.charCodeAt(i) & 0xFF)
|
|
}
|
|
return byteArray
|
|
}
|
|
|
|
function utf16leToBytes (str, units) {
|
|
var c, hi, lo
|
|
var byteArray = []
|
|
for (var i = 0; i < str.length; i++) {
|
|
|
|
if ((units -= 2) < 0) break
|
|
|
|
c = str.charCodeAt(i)
|
|
hi = c >> 8
|
|
lo = c % 256
|
|
byteArray.push(lo)
|
|
byteArray.push(hi)
|
|
}
|
|
|
|
return byteArray
|
|
}
|
|
|
|
function base64ToBytes (str) {
|
|
return base64.toByteArray(base64clean(str))
|
|
}
|
|
|
|
function blitBuffer (src, dst, offset, length, unitSize) {
|
|
if (unitSize) length -= length % unitSize;
|
|
for (var i = 0; i < length; i++) {
|
|
if ((i + offset >= dst.length) || (i >= src.length))
|
|
break
|
|
dst[i + offset] = src[i]
|
|
}
|
|
return i
|
|
}
|
|
|
|
function decodeUtf8Char (str) {
|
|
try {
|
|
return decodeURIComponent(str)
|
|
} catch (err) {
|
|
return String.fromCharCode(0xFFFD) // UTF 8 invalid char
|
|
}
|
|
}
|
|
|
|
},{"base64-js":11,"ieee754":12,"is-array":13}],11:[function(require,module,exports){
|
|
var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
|
|
|
|
;(function (exports) {
|
|
'use strict';
|
|
|
|
var Arr = (typeof Uint8Array !== 'undefined')
|
|
? Uint8Array
|
|
: Array
|
|
|
|
var PLUS = '+'.charCodeAt(0)
|
|
var SLASH = '/'.charCodeAt(0)
|
|
var NUMBER = '0'.charCodeAt(0)
|
|
var LOWER = 'a'.charCodeAt(0)
|
|
var UPPER = 'A'.charCodeAt(0)
|
|
var PLUS_URL_SAFE = '-'.charCodeAt(0)
|
|
var SLASH_URL_SAFE = '_'.charCodeAt(0)
|
|
|
|
function decode (elt) {
|
|
var code = elt.charCodeAt(0)
|
|
if (code === PLUS ||
|
|
code === PLUS_URL_SAFE)
|
|
return 62 // '+'
|
|
if (code === SLASH ||
|
|
code === SLASH_URL_SAFE)
|
|
return 63 // '/'
|
|
if (code < NUMBER)
|
|
return -1 //no match
|
|
if (code < NUMBER + 10)
|
|
return code - NUMBER + 26 + 26
|
|
if (code < UPPER + 26)
|
|
return code - UPPER
|
|
if (code < LOWER + 26)
|
|
return code - LOWER + 26
|
|
}
|
|
|
|
function b64ToByteArray (b64) {
|
|
var i, j, l, tmp, placeHolders, arr
|
|
|
|
if (b64.length % 4 > 0) {
|
|
throw new Error('Invalid string. Length must be a multiple of 4')
|
|
}
|
|
|
|
// the number of equal signs (place holders)
|
|
// if there are two placeholders, than the two characters before it
|
|
// represent one byte
|
|
// if there is only one, then the three characters before it represent 2 bytes
|
|
// this is just a cheap hack to not do indexOf twice
|
|
var len = b64.length
|
|
placeHolders = '=' === b64.charAt(len - 2) ? 2 : '=' === b64.charAt(len - 1) ? 1 : 0
|
|
|
|
// base64 is 4/3 + up to two characters of the original data
|
|
arr = new Arr(b64.length * 3 / 4 - placeHolders)
|
|
|
|
// if there are placeholders, only get up to the last complete 4 chars
|
|
l = placeHolders > 0 ? b64.length - 4 : b64.length
|
|
|
|
var L = 0
|
|
|
|
function push (v) {
|
|
arr[L++] = v
|
|
}
|
|
|
|
for (i = 0, j = 0; i < l; i += 4, j += 3) {
|
|
tmp = (decode(b64.charAt(i)) << 18) | (decode(b64.charAt(i + 1)) << 12) | (decode(b64.charAt(i + 2)) << 6) | decode(b64.charAt(i + 3))
|
|
push((tmp & 0xFF0000) >> 16)
|
|
push((tmp & 0xFF00) >> 8)
|
|
push(tmp & 0xFF)
|
|
}
|
|
|
|
if (placeHolders === 2) {
|
|
tmp = (decode(b64.charAt(i)) << 2) | (decode(b64.charAt(i + 1)) >> 4)
|
|
push(tmp & 0xFF)
|
|
} else if (placeHolders === 1) {
|
|
tmp = (decode(b64.charAt(i)) << 10) | (decode(b64.charAt(i + 1)) << 4) | (decode(b64.charAt(i + 2)) >> 2)
|
|
push((tmp >> 8) & 0xFF)
|
|
push(tmp & 0xFF)
|
|
}
|
|
|
|
return arr
|
|
}
|
|
|
|
function uint8ToBase64 (uint8) {
|
|
var i,
|
|
extraBytes = uint8.length % 3, // if we have 1 byte left, pad 2 bytes
|
|
output = "",
|
|
temp, length
|
|
|
|
function encode (num) {
|
|
return lookup.charAt(num)
|
|
}
|
|
|
|
function tripletToBase64 (num) {
|
|
return encode(num >> 18 & 0x3F) + encode(num >> 12 & 0x3F) + encode(num >> 6 & 0x3F) + encode(num & 0x3F)
|
|
}
|
|
|
|
// go through the array every three bytes, we'll deal with trailing stuff later
|
|
for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) {
|
|
temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2])
|
|
output += tripletToBase64(temp)
|
|
}
|
|
|
|
// pad the end with zeros, but make sure to not forget the extra bytes
|
|
switch (extraBytes) {
|
|
case 1:
|
|
temp = uint8[uint8.length - 1]
|
|
output += encode(temp >> 2)
|
|
output += encode((temp << 4) & 0x3F)
|
|
output += '=='
|
|
break
|
|
case 2:
|
|
temp = (uint8[uint8.length - 2] << 8) + (uint8[uint8.length - 1])
|
|
output += encode(temp >> 10)
|
|
output += encode((temp >> 4) & 0x3F)
|
|
output += encode((temp << 2) & 0x3F)
|
|
output += '='
|
|
break
|
|
}
|
|
|
|
return output
|
|
}
|
|
|
|
exports.toByteArray = b64ToByteArray
|
|
exports.fromByteArray = uint8ToBase64
|
|
}(typeof exports === 'undefined' ? (this.base64js = {}) : exports))
|
|
|
|
},{}],12:[function(require,module,exports){
|
|
exports.read = function(buffer, offset, isLE, mLen, nBytes) {
|
|
var e, m,
|
|
eLen = nBytes * 8 - mLen - 1,
|
|
eMax = (1 << eLen) - 1,
|
|
eBias = eMax >> 1,
|
|
nBits = -7,
|
|
i = isLE ? (nBytes - 1) : 0,
|
|
d = isLE ? -1 : 1,
|
|
s = buffer[offset + i];
|
|
|
|
i += d;
|
|
|
|
e = s & ((1 << (-nBits)) - 1);
|
|
s >>= (-nBits);
|
|
nBits += eLen;
|
|
for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8);
|
|
|
|
m = e & ((1 << (-nBits)) - 1);
|
|
e >>= (-nBits);
|
|
nBits += mLen;
|
|
for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8);
|
|
|
|
if (e === 0) {
|
|
e = 1 - eBias;
|
|
} else if (e === eMax) {
|
|
return m ? NaN : ((s ? -1 : 1) * Infinity);
|
|
} else {
|
|
m = m + Math.pow(2, mLen);
|
|
e = e - eBias;
|
|
}
|
|
return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
|
|
};
|
|
|
|
exports.write = function(buffer, value, offset, isLE, mLen, nBytes) {
|
|
var e, m, c,
|
|
eLen = nBytes * 8 - mLen - 1,
|
|
eMax = (1 << eLen) - 1,
|
|
eBias = eMax >> 1,
|
|
rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0),
|
|
i = isLE ? 0 : (nBytes - 1),
|
|
d = isLE ? 1 : -1,
|
|
s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
|
|
|
|
value = Math.abs(value);
|
|
|
|
if (isNaN(value) || value === Infinity) {
|
|
m = isNaN(value) ? 1 : 0;
|
|
e = eMax;
|
|
} else {
|
|
e = Math.floor(Math.log(value) / Math.LN2);
|
|
if (value * (c = Math.pow(2, -e)) < 1) {
|
|
e--;
|
|
c *= 2;
|
|
}
|
|
if (e + eBias >= 1) {
|
|
value += rt / c;
|
|
} else {
|
|
value += rt * Math.pow(2, 1 - eBias);
|
|
}
|
|
if (value * c >= 2) {
|
|
e++;
|
|
c /= 2;
|
|
}
|
|
|
|
if (e + eBias >= eMax) {
|
|
m = 0;
|
|
e = eMax;
|
|
} else if (e + eBias >= 1) {
|
|
m = (value * c - 1) * Math.pow(2, mLen);
|
|
e = e + eBias;
|
|
} else {
|
|
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
|
|
e = 0;
|
|
}
|
|
}
|
|
|
|
for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8);
|
|
|
|
e = (e << mLen) | m;
|
|
eLen += mLen;
|
|
for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8);
|
|
|
|
buffer[offset + i - d] |= s * 128;
|
|
};
|
|
|
|
},{}],13:[function(require,module,exports){
|
|
|
|
/**
|
|
* isArray
|
|
*/
|
|
|
|
var isArray = Array.isArray;
|
|
|
|
/**
|
|
* toString
|
|
*/
|
|
|
|
var str = Object.prototype.toString;
|
|
|
|
/**
|
|
* Whether or not the given `val`
|
|
* is an array.
|
|
*
|
|
* example:
|
|
*
|
|
* isArray([]);
|
|
* // > true
|
|
* isArray(arguments);
|
|
* // > false
|
|
* isArray('');
|
|
* // > false
|
|
*
|
|
* @param {mixed} val
|
|
* @return {bool}
|
|
*/
|
|
|
|
module.exports = isArray || function (val) {
|
|
return !! val && '[object Array]' == str.call(val);
|
|
};
|
|
|
|
},{}],14:[function(require,module,exports){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
function EventEmitter() {
|
|
this._events = this._events || {};
|
|
this._maxListeners = this._maxListeners || undefined;
|
|
}
|
|
module.exports = EventEmitter;
|
|
|
|
// Backwards-compat with node 0.10.x
|
|
EventEmitter.EventEmitter = EventEmitter;
|
|
|
|
EventEmitter.prototype._events = undefined;
|
|
EventEmitter.prototype._maxListeners = undefined;
|
|
|
|
// By default EventEmitters will print a warning if more than 10 listeners are
|
|
// added to it. This is a useful default which helps finding memory leaks.
|
|
EventEmitter.defaultMaxListeners = 10;
|
|
|
|
// Obviously not all Emitters should be limited to 10. This function allows
|
|
// that to be increased. Set to zero for unlimited.
|
|
EventEmitter.prototype.setMaxListeners = function(n) {
|
|
if (!isNumber(n) || n < 0 || isNaN(n))
|
|
throw TypeError('n must be a positive number');
|
|
this._maxListeners = n;
|
|
return this;
|
|
};
|
|
|
|
EventEmitter.prototype.emit = function(type) {
|
|
var er, handler, len, args, i, listeners;
|
|
|
|
if (!this._events)
|
|
this._events = {};
|
|
|
|
// If there is no 'error' event listener then throw.
|
|
if (type === 'error') {
|
|
if (!this._events.error ||
|
|
(isObject(this._events.error) && !this._events.error.length)) {
|
|
er = arguments[1];
|
|
if (er instanceof Error) {
|
|
throw er; // Unhandled 'error' event
|
|
}
|
|
throw TypeError('Uncaught, unspecified "error" event.');
|
|
}
|
|
}
|
|
|
|
handler = this._events[type];
|
|
|
|
if (isUndefined(handler))
|
|
return false;
|
|
|
|
if (isFunction(handler)) {
|
|
switch (arguments.length) {
|
|
// fast cases
|
|
case 1:
|
|
handler.call(this);
|
|
break;
|
|
case 2:
|
|
handler.call(this, arguments[1]);
|
|
break;
|
|
case 3:
|
|
handler.call(this, arguments[1], arguments[2]);
|
|
break;
|
|
// slower
|
|
default:
|
|
len = arguments.length;
|
|
args = new Array(len - 1);
|
|
for (i = 1; i < len; i++)
|
|
args[i - 1] = arguments[i];
|
|
handler.apply(this, args);
|
|
}
|
|
} else if (isObject(handler)) {
|
|
len = arguments.length;
|
|
args = new Array(len - 1);
|
|
for (i = 1; i < len; i++)
|
|
args[i - 1] = arguments[i];
|
|
|
|
listeners = handler.slice();
|
|
len = listeners.length;
|
|
for (i = 0; i < len; i++)
|
|
listeners[i].apply(this, args);
|
|
}
|
|
|
|
return true;
|
|
};
|
|
|
|
EventEmitter.prototype.addListener = function(type, listener) {
|
|
var m;
|
|
|
|
if (!isFunction(listener))
|
|
throw TypeError('listener must be a function');
|
|
|
|
if (!this._events)
|
|
this._events = {};
|
|
|
|
// To avoid recursion in the case that type === "newListener"! Before
|
|
// adding it to the listeners, first emit "newListener".
|
|
if (this._events.newListener)
|
|
this.emit('newListener', type,
|
|
isFunction(listener.listener) ?
|
|
listener.listener : listener);
|
|
|
|
if (!this._events[type])
|
|
// Optimize the case of one listener. Don't need the extra array object.
|
|
this._events[type] = listener;
|
|
else if (isObject(this._events[type]))
|
|
// If we've already got an array, just append.
|
|
this._events[type].push(listener);
|
|
else
|
|
// Adding the second element, need to change to array.
|
|
this._events[type] = [this._events[type], listener];
|
|
|
|
// Check for listener leak
|
|
if (isObject(this._events[type]) && !this._events[type].warned) {
|
|
var m;
|
|
if (!isUndefined(this._maxListeners)) {
|
|
m = this._maxListeners;
|
|
} else {
|
|
m = EventEmitter.defaultMaxListeners;
|
|
}
|
|
|
|
if (m && m > 0 && this._events[type].length > m) {
|
|
this._events[type].warned = true;
|
|
console.error('(node) warning: possible EventEmitter memory ' +
|
|
'leak detected. %d listeners added. ' +
|
|
'Use emitter.setMaxListeners() to increase limit.',
|
|
this._events[type].length);
|
|
if (typeof console.trace === 'function') {
|
|
// not supported in IE 10
|
|
console.trace();
|
|
}
|
|
}
|
|
}
|
|
|
|
return this;
|
|
};
|
|
|
|
EventEmitter.prototype.on = EventEmitter.prototype.addListener;
|
|
|
|
EventEmitter.prototype.once = function(type, listener) {
|
|
if (!isFunction(listener))
|
|
throw TypeError('listener must be a function');
|
|
|
|
var fired = false;
|
|
|
|
function g() {
|
|
this.removeListener(type, g);
|
|
|
|
if (!fired) {
|
|
fired = true;
|
|
listener.apply(this, arguments);
|
|
}
|
|
}
|
|
|
|
g.listener = listener;
|
|
this.on(type, g);
|
|
|
|
return this;
|
|
};
|
|
|
|
// emits a 'removeListener' event iff the listener was removed
|
|
EventEmitter.prototype.removeListener = function(type, listener) {
|
|
var list, position, length, i;
|
|
|
|
if (!isFunction(listener))
|
|
throw TypeError('listener must be a function');
|
|
|
|
if (!this._events || !this._events[type])
|
|
return this;
|
|
|
|
list = this._events[type];
|
|
length = list.length;
|
|
position = -1;
|
|
|
|
if (list === listener ||
|
|
(isFunction(list.listener) && list.listener === listener)) {
|
|
delete this._events[type];
|
|
if (this._events.removeListener)
|
|
this.emit('removeListener', type, listener);
|
|
|
|
} else if (isObject(list)) {
|
|
for (i = length; i-- > 0;) {
|
|
if (list[i] === listener ||
|
|
(list[i].listener && list[i].listener === listener)) {
|
|
position = i;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (position < 0)
|
|
return this;
|
|
|
|
if (list.length === 1) {
|
|
list.length = 0;
|
|
delete this._events[type];
|
|
} else {
|
|
list.splice(position, 1);
|
|
}
|
|
|
|
if (this._events.removeListener)
|
|
this.emit('removeListener', type, listener);
|
|
}
|
|
|
|
return this;
|
|
};
|
|
|
|
EventEmitter.prototype.removeAllListeners = function(type) {
|
|
var key, listeners;
|
|
|
|
if (!this._events)
|
|
return this;
|
|
|
|
// not listening for removeListener, no need to emit
|
|
if (!this._events.removeListener) {
|
|
if (arguments.length === 0)
|
|
this._events = {};
|
|
else if (this._events[type])
|
|
delete this._events[type];
|
|
return this;
|
|
}
|
|
|
|
// emit removeListener for all listeners on all events
|
|
if (arguments.length === 0) {
|
|
for (key in this._events) {
|
|
if (key === 'removeListener') continue;
|
|
this.removeAllListeners(key);
|
|
}
|
|
this.removeAllListeners('removeListener');
|
|
this._events = {};
|
|
return this;
|
|
}
|
|
|
|
listeners = this._events[type];
|
|
|
|
if (isFunction(listeners)) {
|
|
this.removeListener(type, listeners);
|
|
} else {
|
|
// LIFO order
|
|
while (listeners.length)
|
|
this.removeListener(type, listeners[listeners.length - 1]);
|
|
}
|
|
delete this._events[type];
|
|
|
|
return this;
|
|
};
|
|
|
|
EventEmitter.prototype.listeners = function(type) {
|
|
var ret;
|
|
if (!this._events || !this._events[type])
|
|
ret = [];
|
|
else if (isFunction(this._events[type]))
|
|
ret = [this._events[type]];
|
|
else
|
|
ret = this._events[type].slice();
|
|
return ret;
|
|
};
|
|
|
|
EventEmitter.listenerCount = function(emitter, type) {
|
|
var ret;
|
|
if (!emitter._events || !emitter._events[type])
|
|
ret = 0;
|
|
else if (isFunction(emitter._events[type]))
|
|
ret = 1;
|
|
else
|
|
ret = emitter._events[type].length;
|
|
return ret;
|
|
};
|
|
|
|
function isFunction(arg) {
|
|
return typeof arg === 'function';
|
|
}
|
|
|
|
function isNumber(arg) {
|
|
return typeof arg === 'number';
|
|
}
|
|
|
|
function isObject(arg) {
|
|
return typeof arg === 'object' && arg !== null;
|
|
}
|
|
|
|
function isUndefined(arg) {
|
|
return arg === void 0;
|
|
}
|
|
|
|
},{}],15:[function(require,module,exports){
|
|
if (typeof Object.create === 'function') {
|
|
// implementation from standard node.js 'util' module
|
|
module.exports = function inherits(ctor, superCtor) {
|
|
ctor.super_ = superCtor
|
|
ctor.prototype = Object.create(superCtor.prototype, {
|
|
constructor: {
|
|
value: ctor,
|
|
enumerable: false,
|
|
writable: true,
|
|
configurable: true
|
|
}
|
|
});
|
|
};
|
|
} else {
|
|
// old school shim for old browsers
|
|
module.exports = function inherits(ctor, superCtor) {
|
|
ctor.super_ = superCtor
|
|
var TempCtor = function () {}
|
|
TempCtor.prototype = superCtor.prototype
|
|
ctor.prototype = new TempCtor()
|
|
ctor.prototype.constructor = ctor
|
|
}
|
|
}
|
|
|
|
},{}],16:[function(require,module,exports){
|
|
module.exports = Array.isArray || function (arr) {
|
|
return Object.prototype.toString.call(arr) == '[object Array]';
|
|
};
|
|
|
|
},{}],17:[function(require,module,exports){
|
|
// shim for using process in browser
|
|
|
|
var process = module.exports = {};
|
|
var queue = [];
|
|
var draining = false;
|
|
|
|
function drainQueue() {
|
|
if (draining) {
|
|
return;
|
|
}
|
|
draining = true;
|
|
var currentQueue;
|
|
var len = queue.length;
|
|
while(len) {
|
|
currentQueue = queue;
|
|
queue = [];
|
|
var i = -1;
|
|
while (++i < len) {
|
|
currentQueue[i]();
|
|
}
|
|
len = queue.length;
|
|
}
|
|
draining = false;
|
|
}
|
|
process.nextTick = function (fun) {
|
|
queue.push(fun);
|
|
if (!draining) {
|
|
setTimeout(drainQueue, 0);
|
|
}
|
|
};
|
|
|
|
process.title = 'browser';
|
|
process.browser = true;
|
|
process.env = {};
|
|
process.argv = [];
|
|
process.version = ''; // empty string to avoid regexp issues
|
|
|
|
function noop() {}
|
|
|
|
process.on = noop;
|
|
process.addListener = noop;
|
|
process.once = noop;
|
|
process.off = noop;
|
|
process.removeListener = noop;
|
|
process.removeAllListeners = noop;
|
|
process.emit = noop;
|
|
|
|
process.binding = function (name) {
|
|
throw new Error('process.binding is not supported');
|
|
};
|
|
|
|
// TODO(shtylman)
|
|
process.cwd = function () { return '/' };
|
|
process.chdir = function (dir) {
|
|
throw new Error('process.chdir is not supported');
|
|
};
|
|
process.umask = function() { return 0; };
|
|
|
|
},{}],18:[function(require,module,exports){
|
|
module.exports = require("./lib/_stream_duplex.js")
|
|
|
|
},{"./lib/_stream_duplex.js":19}],19:[function(require,module,exports){
|
|
(function (process){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
// a duplex stream is just a stream that is both readable and writable.
|
|
// Since JS doesn't have multiple prototypal inheritance, this class
|
|
// prototypally inherits from Readable, and then parasitically from
|
|
// Writable.
|
|
|
|
module.exports = Duplex;
|
|
|
|
/*<replacement>*/
|
|
var objectKeys = Object.keys || function (obj) {
|
|
var keys = [];
|
|
for (var key in obj) keys.push(key);
|
|
return keys;
|
|
}
|
|
/*</replacement>*/
|
|
|
|
|
|
/*<replacement>*/
|
|
var util = require('core-util-is');
|
|
util.inherits = require('inherits');
|
|
/*</replacement>*/
|
|
|
|
var Readable = require('./_stream_readable');
|
|
var Writable = require('./_stream_writable');
|
|
|
|
util.inherits(Duplex, Readable);
|
|
|
|
forEach(objectKeys(Writable.prototype), function(method) {
|
|
if (!Duplex.prototype[method])
|
|
Duplex.prototype[method] = Writable.prototype[method];
|
|
});
|
|
|
|
function Duplex(options) {
|
|
if (!(this instanceof Duplex))
|
|
return new Duplex(options);
|
|
|
|
Readable.call(this, options);
|
|
Writable.call(this, options);
|
|
|
|
if (options && options.readable === false)
|
|
this.readable = false;
|
|
|
|
if (options && options.writable === false)
|
|
this.writable = false;
|
|
|
|
this.allowHalfOpen = true;
|
|
if (options && options.allowHalfOpen === false)
|
|
this.allowHalfOpen = false;
|
|
|
|
this.once('end', onend);
|
|
}
|
|
|
|
// the no-half-open enforcer
|
|
function onend() {
|
|
// if we allow half-open state, or if the writable side ended,
|
|
// then we're ok.
|
|
if (this.allowHalfOpen || this._writableState.ended)
|
|
return;
|
|
|
|
// no more data can be written.
|
|
// But allow more writes to happen in this tick.
|
|
process.nextTick(this.end.bind(this));
|
|
}
|
|
|
|
function forEach (xs, f) {
|
|
for (var i = 0, l = xs.length; i < l; i++) {
|
|
f(xs[i], i);
|
|
}
|
|
}
|
|
|
|
}).call(this,require('_process'))
|
|
},{"./_stream_readable":21,"./_stream_writable":23,"_process":17,"core-util-is":24,"inherits":15}],20:[function(require,module,exports){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
// a passthrough stream.
|
|
// basically just the most minimal sort of Transform stream.
|
|
// Every written chunk gets output as-is.
|
|
|
|
module.exports = PassThrough;
|
|
|
|
var Transform = require('./_stream_transform');
|
|
|
|
/*<replacement>*/
|
|
var util = require('core-util-is');
|
|
util.inherits = require('inherits');
|
|
/*</replacement>*/
|
|
|
|
util.inherits(PassThrough, Transform);
|
|
|
|
function PassThrough(options) {
|
|
if (!(this instanceof PassThrough))
|
|
return new PassThrough(options);
|
|
|
|
Transform.call(this, options);
|
|
}
|
|
|
|
PassThrough.prototype._transform = function(chunk, encoding, cb) {
|
|
cb(null, chunk);
|
|
};
|
|
|
|
},{"./_stream_transform":22,"core-util-is":24,"inherits":15}],21:[function(require,module,exports){
|
|
(function (process){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
module.exports = Readable;
|
|
|
|
/*<replacement>*/
|
|
var isArray = require('isarray');
|
|
/*</replacement>*/
|
|
|
|
|
|
/*<replacement>*/
|
|
var Buffer = require('buffer').Buffer;
|
|
/*</replacement>*/
|
|
|
|
Readable.ReadableState = ReadableState;
|
|
|
|
var EE = require('events').EventEmitter;
|
|
|
|
/*<replacement>*/
|
|
if (!EE.listenerCount) EE.listenerCount = function(emitter, type) {
|
|
return emitter.listeners(type).length;
|
|
};
|
|
/*</replacement>*/
|
|
|
|
var Stream = require('stream');
|
|
|
|
/*<replacement>*/
|
|
var util = require('core-util-is');
|
|
util.inherits = require('inherits');
|
|
/*</replacement>*/
|
|
|
|
var StringDecoder;
|
|
|
|
util.inherits(Readable, Stream);
|
|
|
|
function ReadableState(options, stream) {
|
|
options = options || {};
|
|
|
|
// the point at which it stops calling _read() to fill the buffer
|
|
// Note: 0 is a valid value, means "don't call _read preemptively ever"
|
|
var hwm = options.highWaterMark;
|
|
this.highWaterMark = (hwm || hwm === 0) ? hwm : 16 * 1024;
|
|
|
|
// cast to ints.
|
|
this.highWaterMark = ~~this.highWaterMark;
|
|
|
|
this.buffer = [];
|
|
this.length = 0;
|
|
this.pipes = null;
|
|
this.pipesCount = 0;
|
|
this.flowing = false;
|
|
this.ended = false;
|
|
this.endEmitted = false;
|
|
this.reading = false;
|
|
|
|
// In streams that never have any data, and do push(null) right away,
|
|
// the consumer can miss the 'end' event if they do some I/O before
|
|
// consuming the stream. So, we don't emit('end') until some reading
|
|
// happens.
|
|
this.calledRead = false;
|
|
|
|
// a flag to be able to tell if the onwrite cb is called immediately,
|
|
// or on a later tick. We set this to true at first, becuase any
|
|
// actions that shouldn't happen until "later" should generally also
|
|
// not happen before the first write call.
|
|
this.sync = true;
|
|
|
|
// whenever we return null, then we set a flag to say
|
|
// that we're awaiting a 'readable' event emission.
|
|
this.needReadable = false;
|
|
this.emittedReadable = false;
|
|
this.readableListening = false;
|
|
|
|
|
|
// object stream flag. Used to make read(n) ignore n and to
|
|
// make all the buffer merging and length checks go away
|
|
this.objectMode = !!options.objectMode;
|
|
|
|
// Crypto is kind of old and crusty. Historically, its default string
|
|
// encoding is 'binary' so we have to make this configurable.
|
|
// Everything else in the universe uses 'utf8', though.
|
|
this.defaultEncoding = options.defaultEncoding || 'utf8';
|
|
|
|
// when piping, we only care about 'readable' events that happen
|
|
// after read()ing all the bytes and not getting any pushback.
|
|
this.ranOut = false;
|
|
|
|
// the number of writers that are awaiting a drain event in .pipe()s
|
|
this.awaitDrain = 0;
|
|
|
|
// if true, a maybeReadMore has been scheduled
|
|
this.readingMore = false;
|
|
|
|
this.decoder = null;
|
|
this.encoding = null;
|
|
if (options.encoding) {
|
|
if (!StringDecoder)
|
|
StringDecoder = require('string_decoder/').StringDecoder;
|
|
this.decoder = new StringDecoder(options.encoding);
|
|
this.encoding = options.encoding;
|
|
}
|
|
}
|
|
|
|
function Readable(options) {
|
|
if (!(this instanceof Readable))
|
|
return new Readable(options);
|
|
|
|
this._readableState = new ReadableState(options, this);
|
|
|
|
// legacy
|
|
this.readable = true;
|
|
|
|
Stream.call(this);
|
|
}
|
|
|
|
// Manually shove something into the read() buffer.
|
|
// This returns true if the highWaterMark has not been hit yet,
|
|
// similar to how Writable.write() returns true if you should
|
|
// write() some more.
|
|
Readable.prototype.push = function(chunk, encoding) {
|
|
var state = this._readableState;
|
|
|
|
if (typeof chunk === 'string' && !state.objectMode) {
|
|
encoding = encoding || state.defaultEncoding;
|
|
if (encoding !== state.encoding) {
|
|
chunk = new Buffer(chunk, encoding);
|
|
encoding = '';
|
|
}
|
|
}
|
|
|
|
return readableAddChunk(this, state, chunk, encoding, false);
|
|
};
|
|
|
|
// Unshift should *always* be something directly out of read()
|
|
Readable.prototype.unshift = function(chunk) {
|
|
var state = this._readableState;
|
|
return readableAddChunk(this, state, chunk, '', true);
|
|
};
|
|
|
|
function readableAddChunk(stream, state, chunk, encoding, addToFront) {
|
|
var er = chunkInvalid(state, chunk);
|
|
if (er) {
|
|
stream.emit('error', er);
|
|
} else if (chunk === null || chunk === undefined) {
|
|
state.reading = false;
|
|
if (!state.ended)
|
|
onEofChunk(stream, state);
|
|
} else if (state.objectMode || chunk && chunk.length > 0) {
|
|
if (state.ended && !addToFront) {
|
|
var e = new Error('stream.push() after EOF');
|
|
stream.emit('error', e);
|
|
} else if (state.endEmitted && addToFront) {
|
|
var e = new Error('stream.unshift() after end event');
|
|
stream.emit('error', e);
|
|
} else {
|
|
if (state.decoder && !addToFront && !encoding)
|
|
chunk = state.decoder.write(chunk);
|
|
|
|
// update the buffer info.
|
|
state.length += state.objectMode ? 1 : chunk.length;
|
|
if (addToFront) {
|
|
state.buffer.unshift(chunk);
|
|
} else {
|
|
state.reading = false;
|
|
state.buffer.push(chunk);
|
|
}
|
|
|
|
if (state.needReadable)
|
|
emitReadable(stream);
|
|
|
|
maybeReadMore(stream, state);
|
|
}
|
|
} else if (!addToFront) {
|
|
state.reading = false;
|
|
}
|
|
|
|
return needMoreData(state);
|
|
}
|
|
|
|
|
|
|
|
// if it's past the high water mark, we can push in some more.
|
|
// Also, if we have no data yet, we can stand some
|
|
// more bytes. This is to work around cases where hwm=0,
|
|
// such as the repl. Also, if the push() triggered a
|
|
// readable event, and the user called read(largeNumber) such that
|
|
// needReadable was set, then we ought to push more, so that another
|
|
// 'readable' event will be triggered.
|
|
function needMoreData(state) {
|
|
return !state.ended &&
|
|
(state.needReadable ||
|
|
state.length < state.highWaterMark ||
|
|
state.length === 0);
|
|
}
|
|
|
|
// backwards compatibility.
|
|
Readable.prototype.setEncoding = function(enc) {
|
|
if (!StringDecoder)
|
|
StringDecoder = require('string_decoder/').StringDecoder;
|
|
this._readableState.decoder = new StringDecoder(enc);
|
|
this._readableState.encoding = enc;
|
|
};
|
|
|
|
// Don't raise the hwm > 128MB
|
|
var MAX_HWM = 0x800000;
|
|
function roundUpToNextPowerOf2(n) {
|
|
if (n >= MAX_HWM) {
|
|
n = MAX_HWM;
|
|
} else {
|
|
// Get the next highest power of 2
|
|
n--;
|
|
for (var p = 1; p < 32; p <<= 1) n |= n >> p;
|
|
n++;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
function howMuchToRead(n, state) {
|
|
if (state.length === 0 && state.ended)
|
|
return 0;
|
|
|
|
if (state.objectMode)
|
|
return n === 0 ? 0 : 1;
|
|
|
|
if (n === null || isNaN(n)) {
|
|
// only flow one buffer at a time
|
|
if (state.flowing && state.buffer.length)
|
|
return state.buffer[0].length;
|
|
else
|
|
return state.length;
|
|
}
|
|
|
|
if (n <= 0)
|
|
return 0;
|
|
|
|
// If we're asking for more than the target buffer level,
|
|
// then raise the water mark. Bump up to the next highest
|
|
// power of 2, to prevent increasing it excessively in tiny
|
|
// amounts.
|
|
if (n > state.highWaterMark)
|
|
state.highWaterMark = roundUpToNextPowerOf2(n);
|
|
|
|
// don't have that much. return null, unless we've ended.
|
|
if (n > state.length) {
|
|
if (!state.ended) {
|
|
state.needReadable = true;
|
|
return 0;
|
|
} else
|
|
return state.length;
|
|
}
|
|
|
|
return n;
|
|
}
|
|
|
|
// you can override either this method, or the async _read(n) below.
|
|
Readable.prototype.read = function(n) {
|
|
var state = this._readableState;
|
|
state.calledRead = true;
|
|
var nOrig = n;
|
|
var ret;
|
|
|
|
if (typeof n !== 'number' || n > 0)
|
|
state.emittedReadable = false;
|
|
|
|
// if we're doing read(0) to trigger a readable event, but we
|
|
// already have a bunch of data in the buffer, then just trigger
|
|
// the 'readable' event and move on.
|
|
if (n === 0 &&
|
|
state.needReadable &&
|
|
(state.length >= state.highWaterMark || state.ended)) {
|
|
emitReadable(this);
|
|
return null;
|
|
}
|
|
|
|
n = howMuchToRead(n, state);
|
|
|
|
// if we've ended, and we're now clear, then finish it up.
|
|
if (n === 0 && state.ended) {
|
|
ret = null;
|
|
|
|
// In cases where the decoder did not receive enough data
|
|
// to produce a full chunk, then immediately received an
|
|
// EOF, state.buffer will contain [<Buffer >, <Buffer 00 ...>].
|
|
// howMuchToRead will see this and coerce the amount to
|
|
// read to zero (because it's looking at the length of the
|
|
// first <Buffer > in state.buffer), and we'll end up here.
|
|
//
|
|
// This can only happen via state.decoder -- no other venue
|
|
// exists for pushing a zero-length chunk into state.buffer
|
|
// and triggering this behavior. In this case, we return our
|
|
// remaining data and end the stream, if appropriate.
|
|
if (state.length > 0 && state.decoder) {
|
|
ret = fromList(n, state);
|
|
state.length -= ret.length;
|
|
}
|
|
|
|
if (state.length === 0)
|
|
endReadable(this);
|
|
|
|
return ret;
|
|
}
|
|
|
|
// All the actual chunk generation logic needs to be
|
|
// *below* the call to _read. The reason is that in certain
|
|
// synthetic stream cases, such as passthrough streams, _read
|
|
// may be a completely synchronous operation which may change
|
|
// the state of the read buffer, providing enough data when
|
|
// before there was *not* enough.
|
|
//
|
|
// So, the steps are:
|
|
// 1. Figure out what the state of things will be after we do
|
|
// a read from the buffer.
|
|
//
|
|
// 2. If that resulting state will trigger a _read, then call _read.
|
|
// Note that this may be asynchronous, or synchronous. Yes, it is
|
|
// deeply ugly to write APIs this way, but that still doesn't mean
|
|
// that the Readable class should behave improperly, as streams are
|
|
// designed to be sync/async agnostic.
|
|
// Take note if the _read call is sync or async (ie, if the read call
|
|
// has returned yet), so that we know whether or not it's safe to emit
|
|
// 'readable' etc.
|
|
//
|
|
// 3. Actually pull the requested chunks out of the buffer and return.
|
|
|
|
// if we need a readable event, then we need to do some reading.
|
|
var doRead = state.needReadable;
|
|
|
|
// if we currently have less than the highWaterMark, then also read some
|
|
if (state.length - n <= state.highWaterMark)
|
|
doRead = true;
|
|
|
|
// however, if we've ended, then there's no point, and if we're already
|
|
// reading, then it's unnecessary.
|
|
if (state.ended || state.reading)
|
|
doRead = false;
|
|
|
|
if (doRead) {
|
|
state.reading = true;
|
|
state.sync = true;
|
|
// if the length is currently zero, then we *need* a readable event.
|
|
if (state.length === 0)
|
|
state.needReadable = true;
|
|
// call internal read method
|
|
this._read(state.highWaterMark);
|
|
state.sync = false;
|
|
}
|
|
|
|
// If _read called its callback synchronously, then `reading`
|
|
// will be false, and we need to re-evaluate how much data we
|
|
// can return to the user.
|
|
if (doRead && !state.reading)
|
|
n = howMuchToRead(nOrig, state);
|
|
|
|
if (n > 0)
|
|
ret = fromList(n, state);
|
|
else
|
|
ret = null;
|
|
|
|
if (ret === null) {
|
|
state.needReadable = true;
|
|
n = 0;
|
|
}
|
|
|
|
state.length -= n;
|
|
|
|
// If we have nothing in the buffer, then we want to know
|
|
// as soon as we *do* get something into the buffer.
|
|
if (state.length === 0 && !state.ended)
|
|
state.needReadable = true;
|
|
|
|
// If we happened to read() exactly the remaining amount in the
|
|
// buffer, and the EOF has been seen at this point, then make sure
|
|
// that we emit 'end' on the very next tick.
|
|
if (state.ended && !state.endEmitted && state.length === 0)
|
|
endReadable(this);
|
|
|
|
return ret;
|
|
};
|
|
|
|
function chunkInvalid(state, chunk) {
|
|
var er = null;
|
|
if (!Buffer.isBuffer(chunk) &&
|
|
'string' !== typeof chunk &&
|
|
chunk !== null &&
|
|
chunk !== undefined &&
|
|
!state.objectMode) {
|
|
er = new TypeError('Invalid non-string/buffer chunk');
|
|
}
|
|
return er;
|
|
}
|
|
|
|
|
|
function onEofChunk(stream, state) {
|
|
if (state.decoder && !state.ended) {
|
|
var chunk = state.decoder.end();
|
|
if (chunk && chunk.length) {
|
|
state.buffer.push(chunk);
|
|
state.length += state.objectMode ? 1 : chunk.length;
|
|
}
|
|
}
|
|
state.ended = true;
|
|
|
|
// if we've ended and we have some data left, then emit
|
|
// 'readable' now to make sure it gets picked up.
|
|
if (state.length > 0)
|
|
emitReadable(stream);
|
|
else
|
|
endReadable(stream);
|
|
}
|
|
|
|
// Don't emit readable right away in sync mode, because this can trigger
|
|
// another read() call => stack overflow. This way, it might trigger
|
|
// a nextTick recursion warning, but that's not so bad.
|
|
function emitReadable(stream) {
|
|
var state = stream._readableState;
|
|
state.needReadable = false;
|
|
if (state.emittedReadable)
|
|
return;
|
|
|
|
state.emittedReadable = true;
|
|
if (state.sync)
|
|
process.nextTick(function() {
|
|
emitReadable_(stream);
|
|
});
|
|
else
|
|
emitReadable_(stream);
|
|
}
|
|
|
|
function emitReadable_(stream) {
|
|
stream.emit('readable');
|
|
}
|
|
|
|
|
|
// at this point, the user has presumably seen the 'readable' event,
|
|
// and called read() to consume some data. that may have triggered
|
|
// in turn another _read(n) call, in which case reading = true if
|
|
// it's in progress.
|
|
// However, if we're not ended, or reading, and the length < hwm,
|
|
// then go ahead and try to read some more preemptively.
|
|
function maybeReadMore(stream, state) {
|
|
if (!state.readingMore) {
|
|
state.readingMore = true;
|
|
process.nextTick(function() {
|
|
maybeReadMore_(stream, state);
|
|
});
|
|
}
|
|
}
|
|
|
|
function maybeReadMore_(stream, state) {
|
|
var len = state.length;
|
|
while (!state.reading && !state.flowing && !state.ended &&
|
|
state.length < state.highWaterMark) {
|
|
stream.read(0);
|
|
if (len === state.length)
|
|
// didn't get any data, stop spinning.
|
|
break;
|
|
else
|
|
len = state.length;
|
|
}
|
|
state.readingMore = false;
|
|
}
|
|
|
|
// abstract method. to be overridden in specific implementation classes.
|
|
// call cb(er, data) where data is <= n in length.
|
|
// for virtual (non-string, non-buffer) streams, "length" is somewhat
|
|
// arbitrary, and perhaps not very meaningful.
|
|
Readable.prototype._read = function(n) {
|
|
this.emit('error', new Error('not implemented'));
|
|
};
|
|
|
|
Readable.prototype.pipe = function(dest, pipeOpts) {
|
|
var src = this;
|
|
var state = this._readableState;
|
|
|
|
switch (state.pipesCount) {
|
|
case 0:
|
|
state.pipes = dest;
|
|
break;
|
|
case 1:
|
|
state.pipes = [state.pipes, dest];
|
|
break;
|
|
default:
|
|
state.pipes.push(dest);
|
|
break;
|
|
}
|
|
state.pipesCount += 1;
|
|
|
|
var doEnd = (!pipeOpts || pipeOpts.end !== false) &&
|
|
dest !== process.stdout &&
|
|
dest !== process.stderr;
|
|
|
|
var endFn = doEnd ? onend : cleanup;
|
|
if (state.endEmitted)
|
|
process.nextTick(endFn);
|
|
else
|
|
src.once('end', endFn);
|
|
|
|
dest.on('unpipe', onunpipe);
|
|
function onunpipe(readable) {
|
|
if (readable !== src) return;
|
|
cleanup();
|
|
}
|
|
|
|
function onend() {
|
|
dest.end();
|
|
}
|
|
|
|
// when the dest drains, it reduces the awaitDrain counter
|
|
// on the source. This would be more elegant with a .once()
|
|
// handler in flow(), but adding and removing repeatedly is
|
|
// too slow.
|
|
var ondrain = pipeOnDrain(src);
|
|
dest.on('drain', ondrain);
|
|
|
|
function cleanup() {
|
|
// cleanup event handlers once the pipe is broken
|
|
dest.removeListener('close', onclose);
|
|
dest.removeListener('finish', onfinish);
|
|
dest.removeListener('drain', ondrain);
|
|
dest.removeListener('error', onerror);
|
|
dest.removeListener('unpipe', onunpipe);
|
|
src.removeListener('end', onend);
|
|
src.removeListener('end', cleanup);
|
|
|
|
// if the reader is waiting for a drain event from this
|
|
// specific writer, then it would cause it to never start
|
|
// flowing again.
|
|
// So, if this is awaiting a drain, then we just call it now.
|
|
// If we don't know, then assume that we are waiting for one.
|
|
if (!dest._writableState || dest._writableState.needDrain)
|
|
ondrain();
|
|
}
|
|
|
|
// if the dest has an error, then stop piping into it.
|
|
// however, don't suppress the throwing behavior for this.
|
|
function onerror(er) {
|
|
unpipe();
|
|
dest.removeListener('error', onerror);
|
|
if (EE.listenerCount(dest, 'error') === 0)
|
|
dest.emit('error', er);
|
|
}
|
|
// This is a brutally ugly hack to make sure that our error handler
|
|
// is attached before any userland ones. NEVER DO THIS.
|
|
if (!dest._events || !dest._events.error)
|
|
dest.on('error', onerror);
|
|
else if (isArray(dest._events.error))
|
|
dest._events.error.unshift(onerror);
|
|
else
|
|
dest._events.error = [onerror, dest._events.error];
|
|
|
|
|
|
|
|
// Both close and finish should trigger unpipe, but only once.
|
|
function onclose() {
|
|
dest.removeListener('finish', onfinish);
|
|
unpipe();
|
|
}
|
|
dest.once('close', onclose);
|
|
function onfinish() {
|
|
dest.removeListener('close', onclose);
|
|
unpipe();
|
|
}
|
|
dest.once('finish', onfinish);
|
|
|
|
function unpipe() {
|
|
src.unpipe(dest);
|
|
}
|
|
|
|
// tell the dest that it's being piped to
|
|
dest.emit('pipe', src);
|
|
|
|
// start the flow if it hasn't been started already.
|
|
if (!state.flowing) {
|
|
// the handler that waits for readable events after all
|
|
// the data gets sucked out in flow.
|
|
// This would be easier to follow with a .once() handler
|
|
// in flow(), but that is too slow.
|
|
this.on('readable', pipeOnReadable);
|
|
|
|
state.flowing = true;
|
|
process.nextTick(function() {
|
|
flow(src);
|
|
});
|
|
}
|
|
|
|
return dest;
|
|
};
|
|
|
|
function pipeOnDrain(src) {
|
|
return function() {
|
|
var dest = this;
|
|
var state = src._readableState;
|
|
state.awaitDrain--;
|
|
if (state.awaitDrain === 0)
|
|
flow(src);
|
|
};
|
|
}
|
|
|
|
function flow(src) {
|
|
var state = src._readableState;
|
|
var chunk;
|
|
state.awaitDrain = 0;
|
|
|
|
function write(dest, i, list) {
|
|
var written = dest.write(chunk);
|
|
if (false === written) {
|
|
state.awaitDrain++;
|
|
}
|
|
}
|
|
|
|
while (state.pipesCount && null !== (chunk = src.read())) {
|
|
|
|
if (state.pipesCount === 1)
|
|
write(state.pipes, 0, null);
|
|
else
|
|
forEach(state.pipes, write);
|
|
|
|
src.emit('data', chunk);
|
|
|
|
// if anyone needs a drain, then we have to wait for that.
|
|
if (state.awaitDrain > 0)
|
|
return;
|
|
}
|
|
|
|
// if every destination was unpiped, either before entering this
|
|
// function, or in the while loop, then stop flowing.
|
|
//
|
|
// NB: This is a pretty rare edge case.
|
|
if (state.pipesCount === 0) {
|
|
state.flowing = false;
|
|
|
|
// if there were data event listeners added, then switch to old mode.
|
|
if (EE.listenerCount(src, 'data') > 0)
|
|
emitDataEvents(src);
|
|
return;
|
|
}
|
|
|
|
// at this point, no one needed a drain, so we just ran out of data
|
|
// on the next readable event, start it over again.
|
|
state.ranOut = true;
|
|
}
|
|
|
|
function pipeOnReadable() {
|
|
if (this._readableState.ranOut) {
|
|
this._readableState.ranOut = false;
|
|
flow(this);
|
|
}
|
|
}
|
|
|
|
|
|
Readable.prototype.unpipe = function(dest) {
|
|
var state = this._readableState;
|
|
|
|
// if we're not piping anywhere, then do nothing.
|
|
if (state.pipesCount === 0)
|
|
return this;
|
|
|
|
// just one destination. most common case.
|
|
if (state.pipesCount === 1) {
|
|
// passed in one, but it's not the right one.
|
|
if (dest && dest !== state.pipes)
|
|
return this;
|
|
|
|
if (!dest)
|
|
dest = state.pipes;
|
|
|
|
// got a match.
|
|
state.pipes = null;
|
|
state.pipesCount = 0;
|
|
this.removeListener('readable', pipeOnReadable);
|
|
state.flowing = false;
|
|
if (dest)
|
|
dest.emit('unpipe', this);
|
|
return this;
|
|
}
|
|
|
|
// slow case. multiple pipe destinations.
|
|
|
|
if (!dest) {
|
|
// remove all.
|
|
var dests = state.pipes;
|
|
var len = state.pipesCount;
|
|
state.pipes = null;
|
|
state.pipesCount = 0;
|
|
this.removeListener('readable', pipeOnReadable);
|
|
state.flowing = false;
|
|
|
|
for (var i = 0; i < len; i++)
|
|
dests[i].emit('unpipe', this);
|
|
return this;
|
|
}
|
|
|
|
// try to find the right one.
|
|
var i = indexOf(state.pipes, dest);
|
|
if (i === -1)
|
|
return this;
|
|
|
|
state.pipes.splice(i, 1);
|
|
state.pipesCount -= 1;
|
|
if (state.pipesCount === 1)
|
|
state.pipes = state.pipes[0];
|
|
|
|
dest.emit('unpipe', this);
|
|
|
|
return this;
|
|
};
|
|
|
|
// set up data events if they are asked for
|
|
// Ensure readable listeners eventually get something
|
|
Readable.prototype.on = function(ev, fn) {
|
|
var res = Stream.prototype.on.call(this, ev, fn);
|
|
|
|
if (ev === 'data' && !this._readableState.flowing)
|
|
emitDataEvents(this);
|
|
|
|
if (ev === 'readable' && this.readable) {
|
|
var state = this._readableState;
|
|
if (!state.readableListening) {
|
|
state.readableListening = true;
|
|
state.emittedReadable = false;
|
|
state.needReadable = true;
|
|
if (!state.reading) {
|
|
this.read(0);
|
|
} else if (state.length) {
|
|
emitReadable(this, state);
|
|
}
|
|
}
|
|
}
|
|
|
|
return res;
|
|
};
|
|
Readable.prototype.addListener = Readable.prototype.on;
|
|
|
|
// pause() and resume() are remnants of the legacy readable stream API
|
|
// If the user uses them, then switch into old mode.
|
|
Readable.prototype.resume = function() {
|
|
emitDataEvents(this);
|
|
this.read(0);
|
|
this.emit('resume');
|
|
};
|
|
|
|
Readable.prototype.pause = function() {
|
|
emitDataEvents(this, true);
|
|
this.emit('pause');
|
|
};
|
|
|
|
function emitDataEvents(stream, startPaused) {
|
|
var state = stream._readableState;
|
|
|
|
if (state.flowing) {
|
|
// https://github.com/isaacs/readable-stream/issues/16
|
|
throw new Error('Cannot switch to old mode now.');
|
|
}
|
|
|
|
var paused = startPaused || false;
|
|
var readable = false;
|
|
|
|
// convert to an old-style stream.
|
|
stream.readable = true;
|
|
stream.pipe = Stream.prototype.pipe;
|
|
stream.on = stream.addListener = Stream.prototype.on;
|
|
|
|
stream.on('readable', function() {
|
|
readable = true;
|
|
|
|
var c;
|
|
while (!paused && (null !== (c = stream.read())))
|
|
stream.emit('data', c);
|
|
|
|
if (c === null) {
|
|
readable = false;
|
|
stream._readableState.needReadable = true;
|
|
}
|
|
});
|
|
|
|
stream.pause = function() {
|
|
paused = true;
|
|
this.emit('pause');
|
|
};
|
|
|
|
stream.resume = function() {
|
|
paused = false;
|
|
if (readable)
|
|
process.nextTick(function() {
|
|
stream.emit('readable');
|
|
});
|
|
else
|
|
this.read(0);
|
|
this.emit('resume');
|
|
};
|
|
|
|
// now make it start, just in case it hadn't already.
|
|
stream.emit('readable');
|
|
}
|
|
|
|
// wrap an old-style stream as the async data source.
|
|
// This is *not* part of the readable stream interface.
|
|
// It is an ugly unfortunate mess of history.
|
|
Readable.prototype.wrap = function(stream) {
|
|
var state = this._readableState;
|
|
var paused = false;
|
|
|
|
var self = this;
|
|
stream.on('end', function() {
|
|
if (state.decoder && !state.ended) {
|
|
var chunk = state.decoder.end();
|
|
if (chunk && chunk.length)
|
|
self.push(chunk);
|
|
}
|
|
|
|
self.push(null);
|
|
});
|
|
|
|
stream.on('data', function(chunk) {
|
|
if (state.decoder)
|
|
chunk = state.decoder.write(chunk);
|
|
|
|
// don't skip over falsy values in objectMode
|
|
//if (state.objectMode && util.isNullOrUndefined(chunk))
|
|
if (state.objectMode && (chunk === null || chunk === undefined))
|
|
return;
|
|
else if (!state.objectMode && (!chunk || !chunk.length))
|
|
return;
|
|
|
|
var ret = self.push(chunk);
|
|
if (!ret) {
|
|
paused = true;
|
|
stream.pause();
|
|
}
|
|
});
|
|
|
|
// proxy all the other methods.
|
|
// important when wrapping filters and duplexes.
|
|
for (var i in stream) {
|
|
if (typeof stream[i] === 'function' &&
|
|
typeof this[i] === 'undefined') {
|
|
this[i] = function(method) { return function() {
|
|
return stream[method].apply(stream, arguments);
|
|
}}(i);
|
|
}
|
|
}
|
|
|
|
// proxy certain important events.
|
|
var events = ['error', 'close', 'destroy', 'pause', 'resume'];
|
|
forEach(events, function(ev) {
|
|
stream.on(ev, self.emit.bind(self, ev));
|
|
});
|
|
|
|
// when we try to consume some more bytes, simply unpause the
|
|
// underlying stream.
|
|
self._read = function(n) {
|
|
if (paused) {
|
|
paused = false;
|
|
stream.resume();
|
|
}
|
|
};
|
|
|
|
return self;
|
|
};
|
|
|
|
|
|
|
|
// exposed for testing purposes only.
|
|
Readable._fromList = fromList;
|
|
|
|
// Pluck off n bytes from an array of buffers.
|
|
// Length is the combined lengths of all the buffers in the list.
|
|
function fromList(n, state) {
|
|
var list = state.buffer;
|
|
var length = state.length;
|
|
var stringMode = !!state.decoder;
|
|
var objectMode = !!state.objectMode;
|
|
var ret;
|
|
|
|
// nothing in the list, definitely empty.
|
|
if (list.length === 0)
|
|
return null;
|
|
|
|
if (length === 0)
|
|
ret = null;
|
|
else if (objectMode)
|
|
ret = list.shift();
|
|
else if (!n || n >= length) {
|
|
// read it all, truncate the array.
|
|
if (stringMode)
|
|
ret = list.join('');
|
|
else
|
|
ret = Buffer.concat(list, length);
|
|
list.length = 0;
|
|
} else {
|
|
// read just some of it.
|
|
if (n < list[0].length) {
|
|
// just take a part of the first list item.
|
|
// slice is the same for buffers and strings.
|
|
var buf = list[0];
|
|
ret = buf.slice(0, n);
|
|
list[0] = buf.slice(n);
|
|
} else if (n === list[0].length) {
|
|
// first list is a perfect match
|
|
ret = list.shift();
|
|
} else {
|
|
// complex case.
|
|
// we have enough to cover it, but it spans past the first buffer.
|
|
if (stringMode)
|
|
ret = '';
|
|
else
|
|
ret = new Buffer(n);
|
|
|
|
var c = 0;
|
|
for (var i = 0, l = list.length; i < l && c < n; i++) {
|
|
var buf = list[0];
|
|
var cpy = Math.min(n - c, buf.length);
|
|
|
|
if (stringMode)
|
|
ret += buf.slice(0, cpy);
|
|
else
|
|
buf.copy(ret, c, 0, cpy);
|
|
|
|
if (cpy < buf.length)
|
|
list[0] = buf.slice(cpy);
|
|
else
|
|
list.shift();
|
|
|
|
c += cpy;
|
|
}
|
|
}
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
function endReadable(stream) {
|
|
var state = stream._readableState;
|
|
|
|
// If we get here before consuming all the bytes, then that is a
|
|
// bug in node. Should never happen.
|
|
if (state.length > 0)
|
|
throw new Error('endReadable called on non-empty stream');
|
|
|
|
if (!state.endEmitted && state.calledRead) {
|
|
state.ended = true;
|
|
process.nextTick(function() {
|
|
// Check that we didn't get one last unshift.
|
|
if (!state.endEmitted && state.length === 0) {
|
|
state.endEmitted = true;
|
|
stream.readable = false;
|
|
stream.emit('end');
|
|
}
|
|
});
|
|
}
|
|
}
|
|
|
|
function forEach (xs, f) {
|
|
for (var i = 0, l = xs.length; i < l; i++) {
|
|
f(xs[i], i);
|
|
}
|
|
}
|
|
|
|
function indexOf (xs, x) {
|
|
for (var i = 0, l = xs.length; i < l; i++) {
|
|
if (xs[i] === x) return i;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
}).call(this,require('_process'))
|
|
},{"_process":17,"buffer":10,"core-util-is":24,"events":14,"inherits":15,"isarray":16,"stream":29,"string_decoder/":30}],22:[function(require,module,exports){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
|
|
// a transform stream is a readable/writable stream where you do
|
|
// something with the data. Sometimes it's called a "filter",
|
|
// but that's not a great name for it, since that implies a thing where
|
|
// some bits pass through, and others are simply ignored. (That would
|
|
// be a valid example of a transform, of course.)
|
|
//
|
|
// While the output is causally related to the input, it's not a
|
|
// necessarily symmetric or synchronous transformation. For example,
|
|
// a zlib stream might take multiple plain-text writes(), and then
|
|
// emit a single compressed chunk some time in the future.
|
|
//
|
|
// Here's how this works:
|
|
//
|
|
// The Transform stream has all the aspects of the readable and writable
|
|
// stream classes. When you write(chunk), that calls _write(chunk,cb)
|
|
// internally, and returns false if there's a lot of pending writes
|
|
// buffered up. When you call read(), that calls _read(n) until
|
|
// there's enough pending readable data buffered up.
|
|
//
|
|
// In a transform stream, the written data is placed in a buffer. When
|
|
// _read(n) is called, it transforms the queued up data, calling the
|
|
// buffered _write cb's as it consumes chunks. If consuming a single
|
|
// written chunk would result in multiple output chunks, then the first
|
|
// outputted bit calls the readcb, and subsequent chunks just go into
|
|
// the read buffer, and will cause it to emit 'readable' if necessary.
|
|
//
|
|
// This way, back-pressure is actually determined by the reading side,
|
|
// since _read has to be called to start processing a new chunk. However,
|
|
// a pathological inflate type of transform can cause excessive buffering
|
|
// here. For example, imagine a stream where every byte of input is
|
|
// interpreted as an integer from 0-255, and then results in that many
|
|
// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in
|
|
// 1kb of data being output. In this case, you could write a very small
|
|
// amount of input, and end up with a very large amount of output. In
|
|
// such a pathological inflating mechanism, there'd be no way to tell
|
|
// the system to stop doing the transform. A single 4MB write could
|
|
// cause the system to run out of memory.
|
|
//
|
|
// However, even in such a pathological case, only a single written chunk
|
|
// would be consumed, and then the rest would wait (un-transformed) until
|
|
// the results of the previous transformed chunk were consumed.
|
|
|
|
module.exports = Transform;
|
|
|
|
var Duplex = require('./_stream_duplex');
|
|
|
|
/*<replacement>*/
|
|
var util = require('core-util-is');
|
|
util.inherits = require('inherits');
|
|
/*</replacement>*/
|
|
|
|
util.inherits(Transform, Duplex);
|
|
|
|
|
|
function TransformState(options, stream) {
|
|
this.afterTransform = function(er, data) {
|
|
return afterTransform(stream, er, data);
|
|
};
|
|
|
|
this.needTransform = false;
|
|
this.transforming = false;
|
|
this.writecb = null;
|
|
this.writechunk = null;
|
|
}
|
|
|
|
function afterTransform(stream, er, data) {
|
|
var ts = stream._transformState;
|
|
ts.transforming = false;
|
|
|
|
var cb = ts.writecb;
|
|
|
|
if (!cb)
|
|
return stream.emit('error', new Error('no writecb in Transform class'));
|
|
|
|
ts.writechunk = null;
|
|
ts.writecb = null;
|
|
|
|
if (data !== null && data !== undefined)
|
|
stream.push(data);
|
|
|
|
if (cb)
|
|
cb(er);
|
|
|
|
var rs = stream._readableState;
|
|
rs.reading = false;
|
|
if (rs.needReadable || rs.length < rs.highWaterMark) {
|
|
stream._read(rs.highWaterMark);
|
|
}
|
|
}
|
|
|
|
|
|
function Transform(options) {
|
|
if (!(this instanceof Transform))
|
|
return new Transform(options);
|
|
|
|
Duplex.call(this, options);
|
|
|
|
var ts = this._transformState = new TransformState(options, this);
|
|
|
|
// when the writable side finishes, then flush out anything remaining.
|
|
var stream = this;
|
|
|
|
// start out asking for a readable event once data is transformed.
|
|
this._readableState.needReadable = true;
|
|
|
|
// we have implemented the _read method, and done the other things
|
|
// that Readable wants before the first _read call, so unset the
|
|
// sync guard flag.
|
|
this._readableState.sync = false;
|
|
|
|
this.once('finish', function() {
|
|
if ('function' === typeof this._flush)
|
|
this._flush(function(er) {
|
|
done(stream, er);
|
|
});
|
|
else
|
|
done(stream);
|
|
});
|
|
}
|
|
|
|
Transform.prototype.push = function(chunk, encoding) {
|
|
this._transformState.needTransform = false;
|
|
return Duplex.prototype.push.call(this, chunk, encoding);
|
|
};
|
|
|
|
// This is the part where you do stuff!
|
|
// override this function in implementation classes.
|
|
// 'chunk' is an input chunk.
|
|
//
|
|
// Call `push(newChunk)` to pass along transformed output
|
|
// to the readable side. You may call 'push' zero or more times.
|
|
//
|
|
// Call `cb(err)` when you are done with this chunk. If you pass
|
|
// an error, then that'll put the hurt on the whole operation. If you
|
|
// never call cb(), then you'll never get another chunk.
|
|
Transform.prototype._transform = function(chunk, encoding, cb) {
|
|
throw new Error('not implemented');
|
|
};
|
|
|
|
Transform.prototype._write = function(chunk, encoding, cb) {
|
|
var ts = this._transformState;
|
|
ts.writecb = cb;
|
|
ts.writechunk = chunk;
|
|
ts.writeencoding = encoding;
|
|
if (!ts.transforming) {
|
|
var rs = this._readableState;
|
|
if (ts.needTransform ||
|
|
rs.needReadable ||
|
|
rs.length < rs.highWaterMark)
|
|
this._read(rs.highWaterMark);
|
|
}
|
|
};
|
|
|
|
// Doesn't matter what the args are here.
|
|
// _transform does all the work.
|
|
// That we got here means that the readable side wants more data.
|
|
Transform.prototype._read = function(n) {
|
|
var ts = this._transformState;
|
|
|
|
if (ts.writechunk !== null && ts.writecb && !ts.transforming) {
|
|
ts.transforming = true;
|
|
this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);
|
|
} else {
|
|
// mark that we need a transform, so that any data that comes in
|
|
// will get processed, now that we've asked for it.
|
|
ts.needTransform = true;
|
|
}
|
|
};
|
|
|
|
|
|
function done(stream, er) {
|
|
if (er)
|
|
return stream.emit('error', er);
|
|
|
|
// if there's nothing in the write buffer, then that means
|
|
// that nothing more will ever be provided
|
|
var ws = stream._writableState;
|
|
var rs = stream._readableState;
|
|
var ts = stream._transformState;
|
|
|
|
if (ws.length)
|
|
throw new Error('calling transform done when ws.length != 0');
|
|
|
|
if (ts.transforming)
|
|
throw new Error('calling transform done when still transforming');
|
|
|
|
return stream.push(null);
|
|
}
|
|
|
|
},{"./_stream_duplex":19,"core-util-is":24,"inherits":15}],23:[function(require,module,exports){
|
|
(function (process){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
// A bit simpler than readable streams.
|
|
// Implement an async ._write(chunk, cb), and it'll handle all
|
|
// the drain event emission and buffering.
|
|
|
|
module.exports = Writable;
|
|
|
|
/*<replacement>*/
|
|
var Buffer = require('buffer').Buffer;
|
|
/*</replacement>*/
|
|
|
|
Writable.WritableState = WritableState;
|
|
|
|
|
|
/*<replacement>*/
|
|
var util = require('core-util-is');
|
|
util.inherits = require('inherits');
|
|
/*</replacement>*/
|
|
|
|
var Stream = require('stream');
|
|
|
|
util.inherits(Writable, Stream);
|
|
|
|
function WriteReq(chunk, encoding, cb) {
|
|
this.chunk = chunk;
|
|
this.encoding = encoding;
|
|
this.callback = cb;
|
|
}
|
|
|
|
function WritableState(options, stream) {
|
|
options = options || {};
|
|
|
|
// the point at which write() starts returning false
|
|
// Note: 0 is a valid value, means that we always return false if
|
|
// the entire buffer is not flushed immediately on write()
|
|
var hwm = options.highWaterMark;
|
|
this.highWaterMark = (hwm || hwm === 0) ? hwm : 16 * 1024;
|
|
|
|
// object stream flag to indicate whether or not this stream
|
|
// contains buffers or objects.
|
|
this.objectMode = !!options.objectMode;
|
|
|
|
// cast to ints.
|
|
this.highWaterMark = ~~this.highWaterMark;
|
|
|
|
this.needDrain = false;
|
|
// at the start of calling end()
|
|
this.ending = false;
|
|
// when end() has been called, and returned
|
|
this.ended = false;
|
|
// when 'finish' is emitted
|
|
this.finished = false;
|
|
|
|
// should we decode strings into buffers before passing to _write?
|
|
// this is here so that some node-core streams can optimize string
|
|
// handling at a lower level.
|
|
var noDecode = options.decodeStrings === false;
|
|
this.decodeStrings = !noDecode;
|
|
|
|
// Crypto is kind of old and crusty. Historically, its default string
|
|
// encoding is 'binary' so we have to make this configurable.
|
|
// Everything else in the universe uses 'utf8', though.
|
|
this.defaultEncoding = options.defaultEncoding || 'utf8';
|
|
|
|
// not an actual buffer we keep track of, but a measurement
|
|
// of how much we're waiting to get pushed to some underlying
|
|
// socket or file.
|
|
this.length = 0;
|
|
|
|
// a flag to see when we're in the middle of a write.
|
|
this.writing = false;
|
|
|
|
// a flag to be able to tell if the onwrite cb is called immediately,
|
|
// or on a later tick. We set this to true at first, becuase any
|
|
// actions that shouldn't happen until "later" should generally also
|
|
// not happen before the first write call.
|
|
this.sync = true;
|
|
|
|
// a flag to know if we're processing previously buffered items, which
|
|
// may call the _write() callback in the same tick, so that we don't
|
|
// end up in an overlapped onwrite situation.
|
|
this.bufferProcessing = false;
|
|
|
|
// the callback that's passed to _write(chunk,cb)
|
|
this.onwrite = function(er) {
|
|
onwrite(stream, er);
|
|
};
|
|
|
|
// the callback that the user supplies to write(chunk,encoding,cb)
|
|
this.writecb = null;
|
|
|
|
// the amount that is being written when _write is called.
|
|
this.writelen = 0;
|
|
|
|
this.buffer = [];
|
|
|
|
// True if the error was already emitted and should not be thrown again
|
|
this.errorEmitted = false;
|
|
}
|
|
|
|
function Writable(options) {
|
|
var Duplex = require('./_stream_duplex');
|
|
|
|
// Writable ctor is applied to Duplexes, though they're not
|
|
// instanceof Writable, they're instanceof Readable.
|
|
if (!(this instanceof Writable) && !(this instanceof Duplex))
|
|
return new Writable(options);
|
|
|
|
this._writableState = new WritableState(options, this);
|
|
|
|
// legacy.
|
|
this.writable = true;
|
|
|
|
Stream.call(this);
|
|
}
|
|
|
|
// Otherwise people can pipe Writable streams, which is just wrong.
|
|
Writable.prototype.pipe = function() {
|
|
this.emit('error', new Error('Cannot pipe. Not readable.'));
|
|
};
|
|
|
|
|
|
function writeAfterEnd(stream, state, cb) {
|
|
var er = new Error('write after end');
|
|
// TODO: defer error events consistently everywhere, not just the cb
|
|
stream.emit('error', er);
|
|
process.nextTick(function() {
|
|
cb(er);
|
|
});
|
|
}
|
|
|
|
// If we get something that is not a buffer, string, null, or undefined,
|
|
// and we're not in objectMode, then that's an error.
|
|
// Otherwise stream chunks are all considered to be of length=1, and the
|
|
// watermarks determine how many objects to keep in the buffer, rather than
|
|
// how many bytes or characters.
|
|
function validChunk(stream, state, chunk, cb) {
|
|
var valid = true;
|
|
if (!Buffer.isBuffer(chunk) &&
|
|
'string' !== typeof chunk &&
|
|
chunk !== null &&
|
|
chunk !== undefined &&
|
|
!state.objectMode) {
|
|
var er = new TypeError('Invalid non-string/buffer chunk');
|
|
stream.emit('error', er);
|
|
process.nextTick(function() {
|
|
cb(er);
|
|
});
|
|
valid = false;
|
|
}
|
|
return valid;
|
|
}
|
|
|
|
Writable.prototype.write = function(chunk, encoding, cb) {
|
|
var state = this._writableState;
|
|
var ret = false;
|
|
|
|
if (typeof encoding === 'function') {
|
|
cb = encoding;
|
|
encoding = null;
|
|
}
|
|
|
|
if (Buffer.isBuffer(chunk))
|
|
encoding = 'buffer';
|
|
else if (!encoding)
|
|
encoding = state.defaultEncoding;
|
|
|
|
if (typeof cb !== 'function')
|
|
cb = function() {};
|
|
|
|
if (state.ended)
|
|
writeAfterEnd(this, state, cb);
|
|
else if (validChunk(this, state, chunk, cb))
|
|
ret = writeOrBuffer(this, state, chunk, encoding, cb);
|
|
|
|
return ret;
|
|
};
|
|
|
|
function decodeChunk(state, chunk, encoding) {
|
|
if (!state.objectMode &&
|
|
state.decodeStrings !== false &&
|
|
typeof chunk === 'string') {
|
|
chunk = new Buffer(chunk, encoding);
|
|
}
|
|
return chunk;
|
|
}
|
|
|
|
// if we're already writing something, then just put this
|
|
// in the queue, and wait our turn. Otherwise, call _write
|
|
// If we return false, then we need a drain event, so set that flag.
|
|
function writeOrBuffer(stream, state, chunk, encoding, cb) {
|
|
chunk = decodeChunk(state, chunk, encoding);
|
|
if (Buffer.isBuffer(chunk))
|
|
encoding = 'buffer';
|
|
var len = state.objectMode ? 1 : chunk.length;
|
|
|
|
state.length += len;
|
|
|
|
var ret = state.length < state.highWaterMark;
|
|
// we must ensure that previous needDrain will not be reset to false.
|
|
if (!ret)
|
|
state.needDrain = true;
|
|
|
|
if (state.writing)
|
|
state.buffer.push(new WriteReq(chunk, encoding, cb));
|
|
else
|
|
doWrite(stream, state, len, chunk, encoding, cb);
|
|
|
|
return ret;
|
|
}
|
|
|
|
function doWrite(stream, state, len, chunk, encoding, cb) {
|
|
state.writelen = len;
|
|
state.writecb = cb;
|
|
state.writing = true;
|
|
state.sync = true;
|
|
stream._write(chunk, encoding, state.onwrite);
|
|
state.sync = false;
|
|
}
|
|
|
|
function onwriteError(stream, state, sync, er, cb) {
|
|
if (sync)
|
|
process.nextTick(function() {
|
|
cb(er);
|
|
});
|
|
else
|
|
cb(er);
|
|
|
|
stream._writableState.errorEmitted = true;
|
|
stream.emit('error', er);
|
|
}
|
|
|
|
function onwriteStateUpdate(state) {
|
|
state.writing = false;
|
|
state.writecb = null;
|
|
state.length -= state.writelen;
|
|
state.writelen = 0;
|
|
}
|
|
|
|
function onwrite(stream, er) {
|
|
var state = stream._writableState;
|
|
var sync = state.sync;
|
|
var cb = state.writecb;
|
|
|
|
onwriteStateUpdate(state);
|
|
|
|
if (er)
|
|
onwriteError(stream, state, sync, er, cb);
|
|
else {
|
|
// Check if we're actually ready to finish, but don't emit yet
|
|
var finished = needFinish(stream, state);
|
|
|
|
if (!finished && !state.bufferProcessing && state.buffer.length)
|
|
clearBuffer(stream, state);
|
|
|
|
if (sync) {
|
|
process.nextTick(function() {
|
|
afterWrite(stream, state, finished, cb);
|
|
});
|
|
} else {
|
|
afterWrite(stream, state, finished, cb);
|
|
}
|
|
}
|
|
}
|
|
|
|
function afterWrite(stream, state, finished, cb) {
|
|
if (!finished)
|
|
onwriteDrain(stream, state);
|
|
cb();
|
|
if (finished)
|
|
finishMaybe(stream, state);
|
|
}
|
|
|
|
// Must force callback to be called on nextTick, so that we don't
|
|
// emit 'drain' before the write() consumer gets the 'false' return
|
|
// value, and has a chance to attach a 'drain' listener.
|
|
function onwriteDrain(stream, state) {
|
|
if (state.length === 0 && state.needDrain) {
|
|
state.needDrain = false;
|
|
stream.emit('drain');
|
|
}
|
|
}
|
|
|
|
|
|
// if there's something in the buffer waiting, then process it
|
|
function clearBuffer(stream, state) {
|
|
state.bufferProcessing = true;
|
|
|
|
for (var c = 0; c < state.buffer.length; c++) {
|
|
var entry = state.buffer[c];
|
|
var chunk = entry.chunk;
|
|
var encoding = entry.encoding;
|
|
var cb = entry.callback;
|
|
var len = state.objectMode ? 1 : chunk.length;
|
|
|
|
doWrite(stream, state, len, chunk, encoding, cb);
|
|
|
|
// if we didn't call the onwrite immediately, then
|
|
// it means that we need to wait until it does.
|
|
// also, that means that the chunk and cb are currently
|
|
// being processed, so move the buffer counter past them.
|
|
if (state.writing) {
|
|
c++;
|
|
break;
|
|
}
|
|
}
|
|
|
|
state.bufferProcessing = false;
|
|
if (c < state.buffer.length)
|
|
state.buffer = state.buffer.slice(c);
|
|
else
|
|
state.buffer.length = 0;
|
|
}
|
|
|
|
Writable.prototype._write = function(chunk, encoding, cb) {
|
|
cb(new Error('not implemented'));
|
|
};
|
|
|
|
Writable.prototype.end = function(chunk, encoding, cb) {
|
|
var state = this._writableState;
|
|
|
|
if (typeof chunk === 'function') {
|
|
cb = chunk;
|
|
chunk = null;
|
|
encoding = null;
|
|
} else if (typeof encoding === 'function') {
|
|
cb = encoding;
|
|
encoding = null;
|
|
}
|
|
|
|
if (typeof chunk !== 'undefined' && chunk !== null)
|
|
this.write(chunk, encoding);
|
|
|
|
// ignore unnecessary end() calls.
|
|
if (!state.ending && !state.finished)
|
|
endWritable(this, state, cb);
|
|
};
|
|
|
|
|
|
function needFinish(stream, state) {
|
|
return (state.ending &&
|
|
state.length === 0 &&
|
|
!state.finished &&
|
|
!state.writing);
|
|
}
|
|
|
|
function finishMaybe(stream, state) {
|
|
var need = needFinish(stream, state);
|
|
if (need) {
|
|
state.finished = true;
|
|
stream.emit('finish');
|
|
}
|
|
return need;
|
|
}
|
|
|
|
function endWritable(stream, state, cb) {
|
|
state.ending = true;
|
|
finishMaybe(stream, state);
|
|
if (cb) {
|
|
if (state.finished)
|
|
process.nextTick(cb);
|
|
else
|
|
stream.once('finish', cb);
|
|
}
|
|
state.ended = true;
|
|
}
|
|
|
|
}).call(this,require('_process'))
|
|
},{"./_stream_duplex":19,"_process":17,"buffer":10,"core-util-is":24,"inherits":15,"stream":29}],24:[function(require,module,exports){
|
|
(function (Buffer){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
// NOTE: These type checking functions intentionally don't use `instanceof`
|
|
// because it is fragile and can be easily faked with `Object.create()`.
|
|
function isArray(ar) {
|
|
return Array.isArray(ar);
|
|
}
|
|
exports.isArray = isArray;
|
|
|
|
function isBoolean(arg) {
|
|
return typeof arg === 'boolean';
|
|
}
|
|
exports.isBoolean = isBoolean;
|
|
|
|
function isNull(arg) {
|
|
return arg === null;
|
|
}
|
|
exports.isNull = isNull;
|
|
|
|
function isNullOrUndefined(arg) {
|
|
return arg == null;
|
|
}
|
|
exports.isNullOrUndefined = isNullOrUndefined;
|
|
|
|
function isNumber(arg) {
|
|
return typeof arg === 'number';
|
|
}
|
|
exports.isNumber = isNumber;
|
|
|
|
function isString(arg) {
|
|
return typeof arg === 'string';
|
|
}
|
|
exports.isString = isString;
|
|
|
|
function isSymbol(arg) {
|
|
return typeof arg === 'symbol';
|
|
}
|
|
exports.isSymbol = isSymbol;
|
|
|
|
function isUndefined(arg) {
|
|
return arg === void 0;
|
|
}
|
|
exports.isUndefined = isUndefined;
|
|
|
|
function isRegExp(re) {
|
|
return isObject(re) && objectToString(re) === '[object RegExp]';
|
|
}
|
|
exports.isRegExp = isRegExp;
|
|
|
|
function isObject(arg) {
|
|
return typeof arg === 'object' && arg !== null;
|
|
}
|
|
exports.isObject = isObject;
|
|
|
|
function isDate(d) {
|
|
return isObject(d) && objectToString(d) === '[object Date]';
|
|
}
|
|
exports.isDate = isDate;
|
|
|
|
function isError(e) {
|
|
return isObject(e) &&
|
|
(objectToString(e) === '[object Error]' || e instanceof Error);
|
|
}
|
|
exports.isError = isError;
|
|
|
|
function isFunction(arg) {
|
|
return typeof arg === 'function';
|
|
}
|
|
exports.isFunction = isFunction;
|
|
|
|
function isPrimitive(arg) {
|
|
return arg === null ||
|
|
typeof arg === 'boolean' ||
|
|
typeof arg === 'number' ||
|
|
typeof arg === 'string' ||
|
|
typeof arg === 'symbol' || // ES6 symbol
|
|
typeof arg === 'undefined';
|
|
}
|
|
exports.isPrimitive = isPrimitive;
|
|
|
|
function isBuffer(arg) {
|
|
return Buffer.isBuffer(arg);
|
|
}
|
|
exports.isBuffer = isBuffer;
|
|
|
|
function objectToString(o) {
|
|
return Object.prototype.toString.call(o);
|
|
}
|
|
}).call(this,require("buffer").Buffer)
|
|
},{"buffer":10}],25:[function(require,module,exports){
|
|
module.exports = require("./lib/_stream_passthrough.js")
|
|
|
|
},{"./lib/_stream_passthrough.js":20}],26:[function(require,module,exports){
|
|
var Stream = require('stream'); // hack to fix a circular dependency issue when used with browserify
|
|
exports = module.exports = require('./lib/_stream_readable.js');
|
|
exports.Stream = Stream;
|
|
exports.Readable = exports;
|
|
exports.Writable = require('./lib/_stream_writable.js');
|
|
exports.Duplex = require('./lib/_stream_duplex.js');
|
|
exports.Transform = require('./lib/_stream_transform.js');
|
|
exports.PassThrough = require('./lib/_stream_passthrough.js');
|
|
|
|
},{"./lib/_stream_duplex.js":19,"./lib/_stream_passthrough.js":20,"./lib/_stream_readable.js":21,"./lib/_stream_transform.js":22,"./lib/_stream_writable.js":23,"stream":29}],27:[function(require,module,exports){
|
|
module.exports = require("./lib/_stream_transform.js")
|
|
|
|
},{"./lib/_stream_transform.js":22}],28:[function(require,module,exports){
|
|
module.exports = require("./lib/_stream_writable.js")
|
|
|
|
},{"./lib/_stream_writable.js":23}],29:[function(require,module,exports){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
module.exports = Stream;
|
|
|
|
var EE = require('events').EventEmitter;
|
|
var inherits = require('inherits');
|
|
|
|
inherits(Stream, EE);
|
|
Stream.Readable = require('readable-stream/readable.js');
|
|
Stream.Writable = require('readable-stream/writable.js');
|
|
Stream.Duplex = require('readable-stream/duplex.js');
|
|
Stream.Transform = require('readable-stream/transform.js');
|
|
Stream.PassThrough = require('readable-stream/passthrough.js');
|
|
|
|
// Backwards-compat with node 0.4.x
|
|
Stream.Stream = Stream;
|
|
|
|
|
|
|
|
// old-style streams. Note that the pipe method (the only relevant
|
|
// part of this class) is overridden in the Readable class.
|
|
|
|
function Stream() {
|
|
EE.call(this);
|
|
}
|
|
|
|
Stream.prototype.pipe = function(dest, options) {
|
|
var source = this;
|
|
|
|
function ondata(chunk) {
|
|
if (dest.writable) {
|
|
if (false === dest.write(chunk) && source.pause) {
|
|
source.pause();
|
|
}
|
|
}
|
|
}
|
|
|
|
source.on('data', ondata);
|
|
|
|
function ondrain() {
|
|
if (source.readable && source.resume) {
|
|
source.resume();
|
|
}
|
|
}
|
|
|
|
dest.on('drain', ondrain);
|
|
|
|
// If the 'end' option is not supplied, dest.end() will be called when
|
|
// source gets the 'end' or 'close' events. Only dest.end() once.
|
|
if (!dest._isStdio && (!options || options.end !== false)) {
|
|
source.on('end', onend);
|
|
source.on('close', onclose);
|
|
}
|
|
|
|
var didOnEnd = false;
|
|
function onend() {
|
|
if (didOnEnd) return;
|
|
didOnEnd = true;
|
|
|
|
dest.end();
|
|
}
|
|
|
|
|
|
function onclose() {
|
|
if (didOnEnd) return;
|
|
didOnEnd = true;
|
|
|
|
if (typeof dest.destroy === 'function') dest.destroy();
|
|
}
|
|
|
|
// don't leave dangling pipes when there are errors.
|
|
function onerror(er) {
|
|
cleanup();
|
|
if (EE.listenerCount(this, 'error') === 0) {
|
|
throw er; // Unhandled stream error in pipe.
|
|
}
|
|
}
|
|
|
|
source.on('error', onerror);
|
|
dest.on('error', onerror);
|
|
|
|
// remove all the event listeners that were added.
|
|
function cleanup() {
|
|
source.removeListener('data', ondata);
|
|
dest.removeListener('drain', ondrain);
|
|
|
|
source.removeListener('end', onend);
|
|
source.removeListener('close', onclose);
|
|
|
|
source.removeListener('error', onerror);
|
|
dest.removeListener('error', onerror);
|
|
|
|
source.removeListener('end', cleanup);
|
|
source.removeListener('close', cleanup);
|
|
|
|
dest.removeListener('close', cleanup);
|
|
}
|
|
|
|
source.on('end', cleanup);
|
|
source.on('close', cleanup);
|
|
|
|
dest.on('close', cleanup);
|
|
|
|
dest.emit('pipe', source);
|
|
|
|
// Allow for unix-like usage: A.pipe(B).pipe(C)
|
|
return dest;
|
|
};
|
|
|
|
},{"events":14,"inherits":15,"readable-stream/duplex.js":18,"readable-stream/passthrough.js":25,"readable-stream/readable.js":26,"readable-stream/transform.js":27,"readable-stream/writable.js":28}],30:[function(require,module,exports){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
var Buffer = require('buffer').Buffer;
|
|
|
|
var isBufferEncoding = Buffer.isEncoding
|
|
|| function(encoding) {
|
|
switch (encoding && encoding.toLowerCase()) {
|
|
case 'hex': case 'utf8': case 'utf-8': case 'ascii': case 'binary': case 'base64': case 'ucs2': case 'ucs-2': case 'utf16le': case 'utf-16le': case 'raw': return true;
|
|
default: return false;
|
|
}
|
|
}
|
|
|
|
|
|
function assertEncoding(encoding) {
|
|
if (encoding && !isBufferEncoding(encoding)) {
|
|
throw new Error('Unknown encoding: ' + encoding);
|
|
}
|
|
}
|
|
|
|
// StringDecoder provides an interface for efficiently splitting a series of
|
|
// buffers into a series of JS strings without breaking apart multi-byte
|
|
// characters. CESU-8 is handled as part of the UTF-8 encoding.
|
|
//
|
|
// @TODO Handling all encodings inside a single object makes it very difficult
|
|
// to reason about this code, so it should be split up in the future.
|
|
// @TODO There should be a utf8-strict encoding that rejects invalid UTF-8 code
|
|
// points as used by CESU-8.
|
|
var StringDecoder = exports.StringDecoder = function(encoding) {
|
|
this.encoding = (encoding || 'utf8').toLowerCase().replace(/[-_]/, '');
|
|
assertEncoding(encoding);
|
|
switch (this.encoding) {
|
|
case 'utf8':
|
|
// CESU-8 represents each of Surrogate Pair by 3-bytes
|
|
this.surrogateSize = 3;
|
|
break;
|
|
case 'ucs2':
|
|
case 'utf16le':
|
|
// UTF-16 represents each of Surrogate Pair by 2-bytes
|
|
this.surrogateSize = 2;
|
|
this.detectIncompleteChar = utf16DetectIncompleteChar;
|
|
break;
|
|
case 'base64':
|
|
// Base-64 stores 3 bytes in 4 chars, and pads the remainder.
|
|
this.surrogateSize = 3;
|
|
this.detectIncompleteChar = base64DetectIncompleteChar;
|
|
break;
|
|
default:
|
|
this.write = passThroughWrite;
|
|
return;
|
|
}
|
|
|
|
// Enough space to store all bytes of a single character. UTF-8 needs 4
|
|
// bytes, but CESU-8 may require up to 6 (3 bytes per surrogate).
|
|
this.charBuffer = new Buffer(6);
|
|
// Number of bytes received for the current incomplete multi-byte character.
|
|
this.charReceived = 0;
|
|
// Number of bytes expected for the current incomplete multi-byte character.
|
|
this.charLength = 0;
|
|
};
|
|
|
|
|
|
// write decodes the given buffer and returns it as JS string that is
|
|
// guaranteed to not contain any partial multi-byte characters. Any partial
|
|
// character found at the end of the buffer is buffered up, and will be
|
|
// returned when calling write again with the remaining bytes.
|
|
//
|
|
// Note: Converting a Buffer containing an orphan surrogate to a String
|
|
// currently works, but converting a String to a Buffer (via `new Buffer`, or
|
|
// Buffer#write) will replace incomplete surrogates with the unicode
|
|
// replacement character. See https://codereview.chromium.org/121173009/ .
|
|
StringDecoder.prototype.write = function(buffer) {
|
|
var charStr = '';
|
|
// if our last write ended with an incomplete multibyte character
|
|
while (this.charLength) {
|
|
// determine how many remaining bytes this buffer has to offer for this char
|
|
var available = (buffer.length >= this.charLength - this.charReceived) ?
|
|
this.charLength - this.charReceived :
|
|
buffer.length;
|
|
|
|
// add the new bytes to the char buffer
|
|
buffer.copy(this.charBuffer, this.charReceived, 0, available);
|
|
this.charReceived += available;
|
|
|
|
if (this.charReceived < this.charLength) {
|
|
// still not enough chars in this buffer? wait for more ...
|
|
return '';
|
|
}
|
|
|
|
// remove bytes belonging to the current character from the buffer
|
|
buffer = buffer.slice(available, buffer.length);
|
|
|
|
// get the character that was split
|
|
charStr = this.charBuffer.slice(0, this.charLength).toString(this.encoding);
|
|
|
|
// CESU-8: lead surrogate (D800-DBFF) is also the incomplete character
|
|
var charCode = charStr.charCodeAt(charStr.length - 1);
|
|
if (charCode >= 0xD800 && charCode <= 0xDBFF) {
|
|
this.charLength += this.surrogateSize;
|
|
charStr = '';
|
|
continue;
|
|
}
|
|
this.charReceived = this.charLength = 0;
|
|
|
|
// if there are no more bytes in this buffer, just emit our char
|
|
if (buffer.length === 0) {
|
|
return charStr;
|
|
}
|
|
break;
|
|
}
|
|
|
|
// determine and set charLength / charReceived
|
|
this.detectIncompleteChar(buffer);
|
|
|
|
var end = buffer.length;
|
|
if (this.charLength) {
|
|
// buffer the incomplete character bytes we got
|
|
buffer.copy(this.charBuffer, 0, buffer.length - this.charReceived, end);
|
|
end -= this.charReceived;
|
|
}
|
|
|
|
charStr += buffer.toString(this.encoding, 0, end);
|
|
|
|
var end = charStr.length - 1;
|
|
var charCode = charStr.charCodeAt(end);
|
|
// CESU-8: lead surrogate (D800-DBFF) is also the incomplete character
|
|
if (charCode >= 0xD800 && charCode <= 0xDBFF) {
|
|
var size = this.surrogateSize;
|
|
this.charLength += size;
|
|
this.charReceived += size;
|
|
this.charBuffer.copy(this.charBuffer, size, 0, size);
|
|
buffer.copy(this.charBuffer, 0, 0, size);
|
|
return charStr.substring(0, end);
|
|
}
|
|
|
|
// or just emit the charStr
|
|
return charStr;
|
|
};
|
|
|
|
// detectIncompleteChar determines if there is an incomplete UTF-8 character at
|
|
// the end of the given buffer. If so, it sets this.charLength to the byte
|
|
// length that character, and sets this.charReceived to the number of bytes
|
|
// that are available for this character.
|
|
StringDecoder.prototype.detectIncompleteChar = function(buffer) {
|
|
// determine how many bytes we have to check at the end of this buffer
|
|
var i = (buffer.length >= 3) ? 3 : buffer.length;
|
|
|
|
// Figure out if one of the last i bytes of our buffer announces an
|
|
// incomplete char.
|
|
for (; i > 0; i--) {
|
|
var c = buffer[buffer.length - i];
|
|
|
|
// See http://en.wikipedia.org/wiki/UTF-8#Description
|
|
|
|
// 110XXXXX
|
|
if (i == 1 && c >> 5 == 0x06) {
|
|
this.charLength = 2;
|
|
break;
|
|
}
|
|
|
|
// 1110XXXX
|
|
if (i <= 2 && c >> 4 == 0x0E) {
|
|
this.charLength = 3;
|
|
break;
|
|
}
|
|
|
|
// 11110XXX
|
|
if (i <= 3 && c >> 3 == 0x1E) {
|
|
this.charLength = 4;
|
|
break;
|
|
}
|
|
}
|
|
this.charReceived = i;
|
|
};
|
|
|
|
StringDecoder.prototype.end = function(buffer) {
|
|
var res = '';
|
|
if (buffer && buffer.length)
|
|
res = this.write(buffer);
|
|
|
|
if (this.charReceived) {
|
|
var cr = this.charReceived;
|
|
var buf = this.charBuffer;
|
|
var enc = this.encoding;
|
|
res += buf.slice(0, cr).toString(enc);
|
|
}
|
|
|
|
return res;
|
|
};
|
|
|
|
function passThroughWrite(buffer) {
|
|
return buffer.toString(this.encoding);
|
|
}
|
|
|
|
function utf16DetectIncompleteChar(buffer) {
|
|
this.charReceived = buffer.length % 2;
|
|
this.charLength = this.charReceived ? 2 : 0;
|
|
}
|
|
|
|
function base64DetectIncompleteChar(buffer) {
|
|
this.charReceived = buffer.length % 3;
|
|
this.charLength = this.charReceived ? 3 : 0;
|
|
}
|
|
|
|
},{"buffer":10}],31:[function(require,module,exports){
|
|
module.exports = function isBuffer(arg) {
|
|
return arg && typeof arg === 'object'
|
|
&& typeof arg.copy === 'function'
|
|
&& typeof arg.fill === 'function'
|
|
&& typeof arg.readUInt8 === 'function';
|
|
}
|
|
},{}],32:[function(require,module,exports){
|
|
(function (process,global){
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
// copy of this software and associated documentation files (the
|
|
// "Software"), to deal in the Software without restriction, including
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
// following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
|
|
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
|
|
// USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
var formatRegExp = /%[sdj%]/g;
|
|
exports.format = function(f) {
|
|
if (!isString(f)) {
|
|
var objects = [];
|
|
for (var i = 0; i < arguments.length; i++) {
|
|
objects.push(inspect(arguments[i]));
|
|
}
|
|
return objects.join(' ');
|
|
}
|
|
|
|
var i = 1;
|
|
var args = arguments;
|
|
var len = args.length;
|
|
var str = String(f).replace(formatRegExp, function(x) {
|
|
if (x === '%%') return '%';
|
|
if (i >= len) return x;
|
|
switch (x) {
|
|
case '%s': return String(args[i++]);
|
|
case '%d': return Number(args[i++]);
|
|
case '%j':
|
|
try {
|
|
return JSON.stringify(args[i++]);
|
|
} catch (_) {
|
|
return '[Circular]';
|
|
}
|
|
default:
|
|
return x;
|
|
}
|
|
});
|
|
for (var x = args[i]; i < len; x = args[++i]) {
|
|
if (isNull(x) || !isObject(x)) {
|
|
str += ' ' + x;
|
|
} else {
|
|
str += ' ' + inspect(x);
|
|
}
|
|
}
|
|
return str;
|
|
};
|
|
|
|
|
|
// Mark that a method should not be used.
|
|
// Returns a modified function which warns once by default.
|
|
// If --no-deprecation is set, then it is a no-op.
|
|
exports.deprecate = function(fn, msg) {
|
|
// Allow for deprecating things in the process of starting up.
|
|
if (isUndefined(global.process)) {
|
|
return function() {
|
|
return exports.deprecate(fn, msg).apply(this, arguments);
|
|
};
|
|
}
|
|
|
|
if (process.noDeprecation === true) {
|
|
return fn;
|
|
}
|
|
|
|
var warned = false;
|
|
function deprecated() {
|
|
if (!warned) {
|
|
if (process.throwDeprecation) {
|
|
throw new Error(msg);
|
|
} else if (process.traceDeprecation) {
|
|
console.trace(msg);
|
|
} else {
|
|
console.error(msg);
|
|
}
|
|
warned = true;
|
|
}
|
|
return fn.apply(this, arguments);
|
|
}
|
|
|
|
return deprecated;
|
|
};
|
|
|
|
|
|
var debugs = {};
|
|
var debugEnviron;
|
|
exports.debuglog = function(set) {
|
|
if (isUndefined(debugEnviron))
|
|
debugEnviron = process.env.NODE_DEBUG || '';
|
|
set = set.toUpperCase();
|
|
if (!debugs[set]) {
|
|
if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) {
|
|
var pid = process.pid;
|
|
debugs[set] = function() {
|
|
var msg = exports.format.apply(exports, arguments);
|
|
console.error('%s %d: %s', set, pid, msg);
|
|
};
|
|
} else {
|
|
debugs[set] = function() {};
|
|
}
|
|
}
|
|
return debugs[set];
|
|
};
|
|
|
|
|
|
/**
|
|
* Echos the value of a value. Trys to print the value out
|
|
* in the best way possible given the different types.
|
|
*
|
|
* @param {Object} obj The object to print out.
|
|
* @param {Object} opts Optional options object that alters the output.
|
|
*/
|
|
/* legacy: obj, showHidden, depth, colors*/
|
|
function inspect(obj, opts) {
|
|
// default options
|
|
var ctx = {
|
|
seen: [],
|
|
stylize: stylizeNoColor
|
|
};
|
|
// legacy...
|
|
if (arguments.length >= 3) ctx.depth = arguments[2];
|
|
if (arguments.length >= 4) ctx.colors = arguments[3];
|
|
if (isBoolean(opts)) {
|
|
// legacy...
|
|
ctx.showHidden = opts;
|
|
} else if (opts) {
|
|
// got an "options" object
|
|
exports._extend(ctx, opts);
|
|
}
|
|
// set default options
|
|
if (isUndefined(ctx.showHidden)) ctx.showHidden = false;
|
|
if (isUndefined(ctx.depth)) ctx.depth = 2;
|
|
if (isUndefined(ctx.colors)) ctx.colors = false;
|
|
if (isUndefined(ctx.customInspect)) ctx.customInspect = true;
|
|
if (ctx.colors) ctx.stylize = stylizeWithColor;
|
|
return formatValue(ctx, obj, ctx.depth);
|
|
}
|
|
exports.inspect = inspect;
|
|
|
|
|
|
// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
|
|
inspect.colors = {
|
|
'bold' : [1, 22],
|
|
'italic' : [3, 23],
|
|
'underline' : [4, 24],
|
|
'inverse' : [7, 27],
|
|
'white' : [37, 39],
|
|
'grey' : [90, 39],
|
|
'black' : [30, 39],
|
|
'blue' : [34, 39],
|
|
'cyan' : [36, 39],
|
|
'green' : [32, 39],
|
|
'magenta' : [35, 39],
|
|
'red' : [31, 39],
|
|
'yellow' : [33, 39]
|
|
};
|
|
|
|
// Don't use 'blue' not visible on cmd.exe
|
|
inspect.styles = {
|
|
'special': 'cyan',
|
|
'number': 'yellow',
|
|
'boolean': 'yellow',
|
|
'undefined': 'grey',
|
|
'null': 'bold',
|
|
'string': 'green',
|
|
'date': 'magenta',
|
|
// "name": intentionally not styling
|
|
'regexp': 'red'
|
|
};
|
|
|
|
|
|
function stylizeWithColor(str, styleType) {
|
|
var style = inspect.styles[styleType];
|
|
|
|
if (style) {
|
|
return '\u001b[' + inspect.colors[style][0] + 'm' + str +
|
|
'\u001b[' + inspect.colors[style][1] + 'm';
|
|
} else {
|
|
return str;
|
|
}
|
|
}
|
|
|
|
|
|
function stylizeNoColor(str, styleType) {
|
|
return str;
|
|
}
|
|
|
|
|
|
function arrayToHash(array) {
|
|
var hash = {};
|
|
|
|
array.forEach(function(val, idx) {
|
|
hash[val] = true;
|
|
});
|
|
|
|
return hash;
|
|
}
|
|
|
|
|
|
function formatValue(ctx, value, recurseTimes) {
|
|
// Provide a hook for user-specified inspect functions.
|
|
// Check that value is an object with an inspect function on it
|
|
if (ctx.customInspect &&
|
|
value &&
|
|
isFunction(value.inspect) &&
|
|
// Filter out the util module, it's inspect function is special
|
|
value.inspect !== exports.inspect &&
|
|
// Also filter out any prototype objects using the circular check.
|
|
!(value.constructor && value.constructor.prototype === value)) {
|
|
var ret = value.inspect(recurseTimes, ctx);
|
|
if (!isString(ret)) {
|
|
ret = formatValue(ctx, ret, recurseTimes);
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
// Primitive types cannot have properties
|
|
var primitive = formatPrimitive(ctx, value);
|
|
if (primitive) {
|
|
return primitive;
|
|
}
|
|
|
|
// Look up the keys of the object.
|
|
var keys = Object.keys(value);
|
|
var visibleKeys = arrayToHash(keys);
|
|
|
|
if (ctx.showHidden) {
|
|
keys = Object.getOwnPropertyNames(value);
|
|
}
|
|
|
|
// IE doesn't make error fields non-enumerable
|
|
// http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
|
|
if (isError(value)
|
|
&& (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {
|
|
return formatError(value);
|
|
}
|
|
|
|
// Some type of object without properties can be shortcutted.
|
|
if (keys.length === 0) {
|
|
if (isFunction(value)) {
|
|
var name = value.name ? ': ' + value.name : '';
|
|
return ctx.stylize('[Function' + name + ']', 'special');
|
|
}
|
|
if (isRegExp(value)) {
|
|
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
|
|
}
|
|
if (isDate(value)) {
|
|
return ctx.stylize(Date.prototype.toString.call(value), 'date');
|
|
}
|
|
if (isError(value)) {
|
|
return formatError(value);
|
|
}
|
|
}
|
|
|
|
var base = '', array = false, braces = ['{', '}'];
|
|
|
|
// Make Array say that they are Array
|
|
if (isArray(value)) {
|
|
array = true;
|
|
braces = ['[', ']'];
|
|
}
|
|
|
|
// Make functions say that they are functions
|
|
if (isFunction(value)) {
|
|
var n = value.name ? ': ' + value.name : '';
|
|
base = ' [Function' + n + ']';
|
|
}
|
|
|
|
// Make RegExps say that they are RegExps
|
|
if (isRegExp(value)) {
|
|
base = ' ' + RegExp.prototype.toString.call(value);
|
|
}
|
|
|
|
// Make dates with properties first say the date
|
|
if (isDate(value)) {
|
|
base = ' ' + Date.prototype.toUTCString.call(value);
|
|
}
|
|
|
|
// Make error with message first say the error
|
|
if (isError(value)) {
|
|
base = ' ' + formatError(value);
|
|
}
|
|
|
|
if (keys.length === 0 && (!array || value.length == 0)) {
|
|
return braces[0] + base + braces[1];
|
|
}
|
|
|
|
if (recurseTimes < 0) {
|
|
if (isRegExp(value)) {
|
|
return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
|
|
} else {
|
|
return ctx.stylize('[Object]', 'special');
|
|
}
|
|
}
|
|
|
|
ctx.seen.push(value);
|
|
|
|
var output;
|
|
if (array) {
|
|
output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);
|
|
} else {
|
|
output = keys.map(function(key) {
|
|
return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);
|
|
});
|
|
}
|
|
|
|
ctx.seen.pop();
|
|
|
|
return reduceToSingleString(output, base, braces);
|
|
}
|
|
|
|
|
|
function formatPrimitive(ctx, value) {
|
|
if (isUndefined(value))
|
|
return ctx.stylize('undefined', 'undefined');
|
|
if (isString(value)) {
|
|
var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '')
|
|
.replace(/'/g, "\\'")
|
|
.replace(/\\"/g, '"') + '\'';
|
|
return ctx.stylize(simple, 'string');
|
|
}
|
|
if (isNumber(value))
|
|
return ctx.stylize('' + value, 'number');
|
|
if (isBoolean(value))
|
|
return ctx.stylize('' + value, 'boolean');
|
|
// For some reason typeof null is "object", so special case here.
|
|
if (isNull(value))
|
|
return ctx.stylize('null', 'null');
|
|
}
|
|
|
|
|
|
function formatError(value) {
|
|
return '[' + Error.prototype.toString.call(value) + ']';
|
|
}
|
|
|
|
|
|
function formatArray(ctx, value, recurseTimes, visibleKeys, keys) {
|
|
var output = [];
|
|
for (var i = 0, l = value.length; i < l; ++i) {
|
|
if (hasOwnProperty(value, String(i))) {
|
|
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
|
|
String(i), true));
|
|
} else {
|
|
output.push('');
|
|
}
|
|
}
|
|
keys.forEach(function(key) {
|
|
if (!key.match(/^\d+$/)) {
|
|
output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
|
|
key, true));
|
|
}
|
|
});
|
|
return output;
|
|
}
|
|
|
|
|
|
function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {
|
|
var name, str, desc;
|
|
desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };
|
|
if (desc.get) {
|
|
if (desc.set) {
|
|
str = ctx.stylize('[Getter/Setter]', 'special');
|
|
} else {
|
|
str = ctx.stylize('[Getter]', 'special');
|
|
}
|
|
} else {
|
|
if (desc.set) {
|
|
str = ctx.stylize('[Setter]', 'special');
|
|
}
|
|
}
|
|
if (!hasOwnProperty(visibleKeys, key)) {
|
|
name = '[' + key + ']';
|
|
}
|
|
if (!str) {
|
|
if (ctx.seen.indexOf(desc.value) < 0) {
|
|
if (isNull(recurseTimes)) {
|
|
str = formatValue(ctx, desc.value, null);
|
|
} else {
|
|
str = formatValue(ctx, desc.value, recurseTimes - 1);
|
|
}
|
|
if (str.indexOf('\n') > -1) {
|
|
if (array) {
|
|
str = str.split('\n').map(function(line) {
|
|
return ' ' + line;
|
|
}).join('\n').substr(2);
|
|
} else {
|
|
str = '\n' + str.split('\n').map(function(line) {
|
|
return ' ' + line;
|
|
}).join('\n');
|
|
}
|
|
}
|
|
} else {
|
|
str = ctx.stylize('[Circular]', 'special');
|
|
}
|
|
}
|
|
if (isUndefined(name)) {
|
|
if (array && key.match(/^\d+$/)) {
|
|
return str;
|
|
}
|
|
name = JSON.stringify('' + key);
|
|
if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) {
|
|
name = name.substr(1, name.length - 2);
|
|
name = ctx.stylize(name, 'name');
|
|
} else {
|
|
name = name.replace(/'/g, "\\'")
|
|
.replace(/\\"/g, '"')
|
|
.replace(/(^"|"$)/g, "'");
|
|
name = ctx.stylize(name, 'string');
|
|
}
|
|
}
|
|
|
|
return name + ': ' + str;
|
|
}
|
|
|
|
|
|
function reduceToSingleString(output, base, braces) {
|
|
var numLinesEst = 0;
|
|
var length = output.reduce(function(prev, cur) {
|
|
numLinesEst++;
|
|
if (cur.indexOf('\n') >= 0) numLinesEst++;
|
|
return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1;
|
|
}, 0);
|
|
|
|
if (length > 60) {
|
|
return braces[0] +
|
|
(base === '' ? '' : base + '\n ') +
|
|
' ' +
|
|
output.join(',\n ') +
|
|
' ' +
|
|
braces[1];
|
|
}
|
|
|
|
return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];
|
|
}
|
|
|
|
|
|
// NOTE: These type checking functions intentionally don't use `instanceof`
|
|
// because it is fragile and can be easily faked with `Object.create()`.
|
|
function isArray(ar) {
|
|
return Array.isArray(ar);
|
|
}
|
|
exports.isArray = isArray;
|
|
|
|
function isBoolean(arg) {
|
|
return typeof arg === 'boolean';
|
|
}
|
|
exports.isBoolean = isBoolean;
|
|
|
|
function isNull(arg) {
|
|
return arg === null;
|
|
}
|
|
exports.isNull = isNull;
|
|
|
|
function isNullOrUndefined(arg) {
|
|
return arg == null;
|
|
}
|
|
exports.isNullOrUndefined = isNullOrUndefined;
|
|
|
|
function isNumber(arg) {
|
|
return typeof arg === 'number';
|
|
}
|
|
exports.isNumber = isNumber;
|
|
|
|
function isString(arg) {
|
|
return typeof arg === 'string';
|
|
}
|
|
exports.isString = isString;
|
|
|
|
function isSymbol(arg) {
|
|
return typeof arg === 'symbol';
|
|
}
|
|
exports.isSymbol = isSymbol;
|
|
|
|
function isUndefined(arg) {
|
|
return arg === void 0;
|
|
}
|
|
exports.isUndefined = isUndefined;
|
|
|
|
function isRegExp(re) {
|
|
return isObject(re) && objectToString(re) === '[object RegExp]';
|
|
}
|
|
exports.isRegExp = isRegExp;
|
|
|
|
function isObject(arg) {
|
|
return typeof arg === 'object' && arg !== null;
|
|
}
|
|
exports.isObject = isObject;
|
|
|
|
function isDate(d) {
|
|
return isObject(d) && objectToString(d) === '[object Date]';
|
|
}
|
|
exports.isDate = isDate;
|
|
|
|
function isError(e) {
|
|
return isObject(e) &&
|
|
(objectToString(e) === '[object Error]' || e instanceof Error);
|
|
}
|
|
exports.isError = isError;
|
|
|
|
function isFunction(arg) {
|
|
return typeof arg === 'function';
|
|
}
|
|
exports.isFunction = isFunction;
|
|
|
|
function isPrimitive(arg) {
|
|
return arg === null ||
|
|
typeof arg === 'boolean' ||
|
|
typeof arg === 'number' ||
|
|
typeof arg === 'string' ||
|
|
typeof arg === 'symbol' || // ES6 symbol
|
|
typeof arg === 'undefined';
|
|
}
|
|
exports.isPrimitive = isPrimitive;
|
|
|
|
exports.isBuffer = require('./support/isBuffer');
|
|
|
|
function objectToString(o) {
|
|
return Object.prototype.toString.call(o);
|
|
}
|
|
|
|
|
|
function pad(n) {
|
|
return n < 10 ? '0' + n.toString(10) : n.toString(10);
|
|
}
|
|
|
|
|
|
var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',
|
|
'Oct', 'Nov', 'Dec'];
|
|
|
|
// 26 Feb 16:19:34
|
|
function timestamp() {
|
|
var d = new Date();
|
|
var time = [pad(d.getHours()),
|
|
pad(d.getMinutes()),
|
|
pad(d.getSeconds())].join(':');
|
|
return [d.getDate(), months[d.getMonth()], time].join(' ');
|
|
}
|
|
|
|
|
|
// log is just a thin wrapper to console.log that prepends a timestamp
|
|
exports.log = function() {
|
|
console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));
|
|
};
|
|
|
|
|
|
/**
|
|
* Inherit the prototype methods from one constructor into another.
|
|
*
|
|
* The Function.prototype.inherits from lang.js rewritten as a standalone
|
|
* function (not on Function.prototype). NOTE: If this file is to be loaded
|
|
* during bootstrapping this function needs to be rewritten using some native
|
|
* functions as prototype setup using normal JavaScript does not work as
|
|
* expected during bootstrapping (see mirror.js in r114903).
|
|
*
|
|
* @param {function} ctor Constructor function which needs to inherit the
|
|
* prototype.
|
|
* @param {function} superCtor Constructor function to inherit prototype from.
|
|
*/
|
|
exports.inherits = require('inherits');
|
|
|
|
exports._extend = function(origin, add) {
|
|
// Don't do anything if add isn't an object
|
|
if (!add || !isObject(add)) return origin;
|
|
|
|
var keys = Object.keys(add);
|
|
var i = keys.length;
|
|
while (i--) {
|
|
origin[keys[i]] = add[keys[i]];
|
|
}
|
|
return origin;
|
|
};
|
|
|
|
function hasOwnProperty(obj, prop) {
|
|
return Object.prototype.hasOwnProperty.call(obj, prop);
|
|
}
|
|
|
|
}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
|
|
},{"./support/isBuffer":31,"_process":17,"inherits":15}]},{},[1]);
|