Created
April 10, 2017 19:34
-
-
Save omniscient/59b95ea8b6cb8648fc2d34d2c976450d to your computer and use it in GitHub Desktop.
Custom config for tape
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module.exports = function (config) { | |
config.set({ | |
// base path that will be used to resolve all patterns (eg. files, exclude) | |
basePath: "", | |
// frameworks to use | |
// available frameworks: https://npmjs.org/browse/keyword/karma-adapter | |
frameworks: ["requirejs"], | |
// list of files / patterns to load in the browser | |
files: [ | |
{ pattern: "dist/**/*.js", included: false, watched: true }, | |
{ pattern: "dist/**/*.html", included: false, watched: true }, | |
{ pattern: "dist/**/*.css", included: false, watched: true }, | |
{ pattern: "node_modules/**/*.js", included: false, watched: false }, | |
"config.js", | |
"dist/_test/_setup/main.js", | |
], | |
// list of files to exclude | |
exclude: [], | |
// preprocess matching files before serving them to the browser | |
// available preprocessors: https://npmjs.org/browse/keyword/karma-preprocessor | |
preprocessors: {}, | |
// test results reporter to use | |
// possible values: 'dots', 'progress' | |
// available reporters: https://npmjs.org/browse/keyword/karma-reporter | |
reporters: ["progress"], | |
// web server port | |
port: 9876, | |
// enable / disable colors in the output (reporters and logs) | |
colors: true, | |
// level of logging | |
// possible values: config.LOG_DISABLE || config.LOG_ERROR || config.LOG_WARN || config.LOG_INFO || config.LOG_DEBUG | |
logLevel: config.LOG_INFO, | |
// enable / disable watching file and executing tests whenever any file changes | |
autoWatch: true, | |
// start these browsers | |
// available browser launchers: https://npmjs.org/browse/keyword/karma-launcher | |
browsers: ["Chrome", "Chrome_Beta_Headless"], | |
customLaunchers: { | |
Chrome_Beta_Headless: { | |
base: 'Chrome', | |
flags: ['--headless', '--disable-gpu', '--remote-debugging-port=9222'] | |
} | |
}, | |
// Continuous Integration mode | |
// if true, Karma captures browsers, runs the tests and exits | |
singleRun: false, | |
// Concurrency level | |
// how many browser should be started simultaneous | |
concurrency: Infinity, | |
}); | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const allTestFiles: string[] = []; | |
// include all files under the "_test" folder. | |
const TEST_REGEXP = /^\/base\/dist\/_test\/.+\.js$/i; | |
// exclude files under the "_test/_setup" folder. | |
const IGNORE_REGEXP = /^\/base\/dist\/_test\/_setup\/.+\.js$/i; | |
window.__tapeTests__ = []; | |
// Get a list of all the test files to include | |
Object.keys(window.__karma__.files).forEach(file => { | |
if (TEST_REGEXP.test(file) && !IGNORE_REGEXP.test(file)) { | |
// Normalize paths to RequireJS module names. | |
const normalizedTestModule = file.replace(/^\/base\/dist\/|\.js$/g, ''); | |
allTestFiles.push(normalizedTestModule); | |
} | |
}); | |
let started = false; | |
let tape: any; | |
require.config({ | |
baseUrl: '/base/dist', | |
paths: { | |
'tape': `_test/_setup/tape`, | |
'real-tape': `../node_modules/tape-browser-bundle/index` | |
}, | |
packages: [ | |
{ | |
name: 'aurelia-testing', | |
location: `../node_modules/aurelia-testing/dist/amd`, | |
main: 'aurelia-testing', | |
} | |
], | |
deps: (window as any).Promise && window.fetch && Element.prototype.closest ? [] : ['./polyfills/index'], | |
callback: () => { | |
if (started) { | |
return; | |
} | |
started = true; | |
require(['aurelia-pal-browser', 'real-tape', 'aurelia-polyfills'], (pal: any, realTape: any) => { | |
tape = realTape; | |
pal.initialize(); | |
require(allTestFiles, () => window.__karma__.start()); | |
}); | |
}, | |
}); | |
window.__karma__.start = function () { | |
function formatError(data: any) { | |
const err = [ | |
'operator: ' + data.operator | |
]; | |
if (data.expected) { | |
err.push('expected: ' + data.expected); | |
} | |
if (data.actual) { | |
err.push('actual: ' + data.actual); | |
} | |
return err; | |
} | |
const tc = window.__karma__; | |
let assertStartTime: number; | |
const suites: { [id: number]: string; } = {}; | |
tape.createStream({ objectMode: true }) | |
.on('close', () => tc.complete({ coverage: window.__coverage__ })) | |
.on('data', (data: any) => { | |
switch (data.type) { | |
case 'test': | |
assertStartTime = new Date().getTime(); | |
suites[data.id] = data.name; | |
break; | |
case 'assert': | |
const currentTime = new Date().getTime(); | |
tc.result({ | |
id: data.id, | |
description: data.name, | |
success: data.ok, | |
log: data.ok ? [] : formatError(data), | |
suite: [suites[data.test]], | |
time: currentTime - assertStartTime | |
}); | |
assertStartTime = currentTime; | |
break; | |
default: | |
break; | |
} | |
}); | |
window.__tapeTests__.forEach(t => t()); | |
// This should be called on start to inform karma of how many | |
// tests we are going to run (useful for progress indication). | |
// Unfortuately tape will not provide this info until the end of the tests. | |
// It's not very useful in this case...let's keep it here just to avoid a warning msg | |
tc.info({ total: 0 }); | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.test = f()}})(function(){var define,module,exports;return (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){ | |
'use strict' | |
exports.byteLength = byteLength | |
exports.toByteArray = toByteArray | |
exports.fromByteArray = fromByteArray | |
var lookup = [] | |
var revLookup = [] | |
var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array | |
var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/' | |
for (var i = 0, len = code.length; i < len; ++i) { | |
lookup[i] = code[i] | |
revLookup[code.charCodeAt(i)] = i | |
} | |
revLookup['-'.charCodeAt(0)] = 62 | |
revLookup['_'.charCodeAt(0)] = 63 | |
function placeHoldersCount (b64) { | |
var len = b64.length | |
if (len % 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 | |
return b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0 | |
} | |
function byteLength (b64) { | |
// base64 is 4/3 + up to two characters of the original data | |
return b64.length * 3 / 4 - placeHoldersCount(b64) | |
} | |
function toByteArray (b64) { | |
var i, j, l, tmp, placeHolders, arr | |
var len = b64.length | |
placeHolders = placeHoldersCount(b64) | |
arr = new Arr(len * 3 / 4 - placeHolders) | |
// if there are placeholders, only get up to the last complete 4 chars | |
l = placeHolders > 0 ? len - 4 : len | |
var L = 0 | |
for (i = 0, j = 0; i < l; i += 4, j += 3) { | |
tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)] | |
arr[L++] = (tmp >> 16) & 0xFF | |
arr[L++] = (tmp >> 8) & 0xFF | |
arr[L++] = tmp & 0xFF | |
} | |
if (placeHolders === 2) { | |
tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4) | |
arr[L++] = tmp & 0xFF | |
} else if (placeHolders === 1) { | |
tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2) | |
arr[L++] = (tmp >> 8) & 0xFF | |
arr[L++] = tmp & 0xFF | |
} | |
return arr | |
} | |
function tripletToBase64 (num) { | |
return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F] | |
} | |
function encodeChunk (uint8, start, end) { | |
var tmp | |
var output = [] | |
for (var i = start; i < end; i += 3) { | |
tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]) | |
output.push(tripletToBase64(tmp)) | |
} | |
return output.join('') | |
} | |
function fromByteArray (uint8) { | |
var tmp | |
var len = uint8.length | |
var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes | |
var output = '' | |
var parts = [] | |
var maxChunkLength = 16383 // must be multiple of 3 | |
// go through the array every three bytes, we'll deal with trailing stuff later | |
for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) { | |
parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength))) | |
} | |
// pad the end with zeros, but make sure to not forget the extra bytes | |
if (extraBytes === 1) { | |
tmp = uint8[len - 1] | |
output += lookup[tmp >> 2] | |
output += lookup[(tmp << 4) & 0x3F] | |
output += '==' | |
} else if (extraBytes === 2) { | |
tmp = (uint8[len - 2] << 8) + (uint8[len - 1]) | |
output += lookup[tmp >> 10] | |
output += lookup[(tmp >> 4) & 0x3F] | |
output += lookup[(tmp << 2) & 0x3F] | |
output += '=' | |
} | |
parts.push(output) | |
return parts.join('') | |
} | |
},{}],2:[function(require,module,exports){ | |
},{}],3:[function(require,module,exports){ | |
arguments[4][2][0].apply(exports,arguments) | |
},{"dup":2}],4:[function(require,module,exports){ | |
(function (global){ | |
'use strict'; | |
var buffer = require('buffer'); | |
var Buffer = buffer.Buffer; | |
var SlowBuffer = buffer.SlowBuffer; | |
var MAX_LEN = buffer.kMaxLength || 2147483647; | |
exports.alloc = function alloc(size, fill, encoding) { | |
if (typeof Buffer.alloc === 'function') { | |
return Buffer.alloc(size, fill, encoding); | |
} | |
if (typeof encoding === 'number') { | |
throw new TypeError('encoding must not be number'); | |
} | |
if (typeof size !== 'number') { | |
throw new TypeError('size must be a number'); | |
} | |
if (size > MAX_LEN) { | |
throw new RangeError('size is too large'); | |
} | |
var enc = encoding; | |
var _fill = fill; | |
if (_fill === undefined) { | |
enc = undefined; | |
_fill = 0; | |
} | |
var buf = new Buffer(size); | |
if (typeof _fill === 'string') { | |
var fillBuf = new Buffer(_fill, enc); | |
var flen = fillBuf.length; | |
var i = -1; | |
while (++i < size) { | |
buf[i] = fillBuf[i % flen]; | |
} | |
} else { | |
buf.fill(_fill); | |
} | |
return buf; | |
} | |
exports.allocUnsafe = function allocUnsafe(size) { | |
if (typeof Buffer.allocUnsafe === 'function') { | |
return Buffer.allocUnsafe(size); | |
} | |
if (typeof size !== 'number') { | |
throw new TypeError('size must be a number'); | |
} | |
if (size > MAX_LEN) { | |
throw new RangeError('size is too large'); | |
} | |
return new Buffer(size); | |
} | |
exports.from = function from(value, encodingOrOffset, length) { | |
if (typeof Buffer.from === 'function' && (!global.Uint8Array || Uint8Array.from !== Buffer.from)) { | |
return Buffer.from(value, encodingOrOffset, length); | |
} | |
if (typeof value === 'number') { | |
throw new TypeError('"value" argument must not be a number'); | |
} | |
if (typeof value === 'string') { | |
return new Buffer(value, encodingOrOffset); | |
} | |
if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) { | |
var offset = encodingOrOffset; | |
if (arguments.length === 1) { | |
return new Buffer(value); | |
} | |
if (typeof offset === 'undefined') { | |
offset = 0; | |
} | |
var len = length; | |
if (typeof len === 'undefined') { | |
len = value.byteLength - offset; | |
} | |
if (offset >= value.byteLength) { | |
throw new RangeError('\'offset\' is out of bounds'); | |
} | |
if (len > value.byteLength - offset) { | |
throw new RangeError('\'length\' is out of bounds'); | |
} | |
return new Buffer(value.slice(offset, offset + len)); | |
} | |
if (Buffer.isBuffer(value)) { | |
var out = new Buffer(value.length); | |
value.copy(out, 0, 0, value.length); | |
return out; | |
} | |
if (value) { | |
if (Array.isArray(value) || (typeof ArrayBuffer !== 'undefined' && value.buffer instanceof ArrayBuffer) || 'length' in value) { | |
return new Buffer(value); | |
} | |
if (value.type === 'Buffer' && Array.isArray(value.data)) { | |
return new Buffer(value.data); | |
} | |
} | |
throw new TypeError('First argument must be a string, Buffer, ' + 'ArrayBuffer, Array, or array-like object.'); | |
} | |
exports.allocUnsafeSlow = function allocUnsafeSlow(size) { | |
if (typeof Buffer.allocUnsafeSlow === 'function') { | |
return Buffer.allocUnsafeSlow(size); | |
} | |
if (typeof size !== 'number') { | |
throw new TypeError('size must be a number'); | |
} | |
if (size >= MAX_LEN) { | |
throw new RangeError('size is too large'); | |
} | |
return new SlowBuffer(size); | |
} | |
}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) | |
},{"buffer":5}],5:[function(require,module,exports){ | |
(function (global){ | |
/*! | |
* The buffer module from node.js, for the browser. | |
* | |
* @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org> | |
* @license MIT | |
*/ | |
/* eslint-disable no-proto */ | |
'use strict' | |
var base64 = require('base64-js') | |
var ieee754 = require('ieee754') | |
var isArray = require('isarray') | |
exports.Buffer = Buffer | |
exports.SlowBuffer = SlowBuffer | |
exports.INSPECT_MAX_BYTES = 50 | |
/** | |
* 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+. | |
* | |
* Due to various browser bugs, sometimes the Object implementation will be used even | |
* when the browser supports typed arrays. | |
* | |
* Note: | |
* | |
* - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances, | |
* 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 | |
* get the Object implementation, which is slower but behaves correctly. | |
*/ | |
Buffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined | |
? global.TYPED_ARRAY_SUPPORT | |
: typedArraySupport() | |
/* | |
* Export kMaxLength after typed array support is determined. | |
*/ | |
exports.kMaxLength = kMaxLength() | |
function typedArraySupport () { | |
try { | |
var arr = new Uint8Array(1) | |
arr.__proto__ = {__proto__: Uint8Array.prototype, foo: function () { return 42 }} | |
return arr.foo() === 42 && // typed array instances can be augmented | |
typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray` | |
arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray` | |
} catch (e) { | |
return false | |
} | |
} | |
function kMaxLength () { | |
return Buffer.TYPED_ARRAY_SUPPORT | |
? 0x7fffffff | |
: 0x3fffffff | |
} | |
function createBuffer (that, length) { | |
if (kMaxLength() < length) { | |
throw new RangeError('Invalid typed array length') | |
} | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
// Return an augmented `Uint8Array` instance, for best performance | |
that = new Uint8Array(length) | |
that.__proto__ = Buffer.prototype | |
} else { | |
// Fallback: Return an object instance of the Buffer class | |
if (that === null) { | |
that = new Buffer(length) | |
} | |
that.length = length | |
} | |
return that | |
} | |
/** | |
* The Buffer constructor returns instances of `Uint8Array` that have their | |
* prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of | |
* `Uint8Array`, so the returned instances will have all the node `Buffer` methods | |
* and the `Uint8Array` methods. Square bracket notation works as expected -- it | |
* returns a single octet. | |
* | |
* The `Uint8Array` prototype remains unmodified. | |
*/ | |
function Buffer (arg, encodingOrOffset, length) { | |
if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) { | |
return new Buffer(arg, encodingOrOffset, length) | |
} | |
// Common case. | |
if (typeof arg === 'number') { | |
if (typeof encodingOrOffset === 'string') { | |
throw new Error( | |
'If encoding is specified then the first argument must be a string' | |
) | |
} | |
return allocUnsafe(this, arg) | |
} | |
return from(this, arg, encodingOrOffset, length) | |
} | |
Buffer.poolSize = 8192 // not used by this implementation | |
// TODO: Legacy, not needed anymore. Remove in next major version. | |
Buffer._augment = function (arr) { | |
arr.__proto__ = Buffer.prototype | |
return arr | |
} | |
function from (that, value, encodingOrOffset, length) { | |
if (typeof value === 'number') { | |
throw new TypeError('"value" argument must not be a number') | |
} | |
if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) { | |
return fromArrayBuffer(that, value, encodingOrOffset, length) | |
} | |
if (typeof value === 'string') { | |
return fromString(that, value, encodingOrOffset) | |
} | |
return fromObject(that, value) | |
} | |
/** | |
* Functionally equivalent to Buffer(arg, encoding) but throws a TypeError | |
* if value is a number. | |
* Buffer.from(str[, encoding]) | |
* Buffer.from(array) | |
* Buffer.from(buffer) | |
* Buffer.from(arrayBuffer[, byteOffset[, length]]) | |
**/ | |
Buffer.from = function (value, encodingOrOffset, length) { | |
return from(null, value, encodingOrOffset, length) | |
} | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
Buffer.prototype.__proto__ = Uint8Array.prototype | |
Buffer.__proto__ = Uint8Array | |
if (typeof Symbol !== 'undefined' && Symbol.species && | |
Buffer[Symbol.species] === Buffer) { | |
// Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97 | |
Object.defineProperty(Buffer, Symbol.species, { | |
value: null, | |
configurable: true | |
}) | |
} | |
} | |
function assertSize (size) { | |
if (typeof size !== 'number') { | |
throw new TypeError('"size" argument must be a number') | |
} else if (size < 0) { | |
throw new RangeError('"size" argument must not be negative') | |
} | |
} | |
function alloc (that, size, fill, encoding) { | |
assertSize(size) | |
if (size <= 0) { | |
return createBuffer(that, size) | |
} | |
if (fill !== undefined) { | |
// Only pay attention to encoding if it's a string. This | |
// prevents accidentally sending in a number that would | |
// be interpretted as a start offset. | |
return typeof encoding === 'string' | |
? createBuffer(that, size).fill(fill, encoding) | |
: createBuffer(that, size).fill(fill) | |
} | |
return createBuffer(that, size) | |
} | |
/** | |
* Creates a new filled Buffer instance. | |
* alloc(size[, fill[, encoding]]) | |
**/ | |
Buffer.alloc = function (size, fill, encoding) { | |
return alloc(null, size, fill, encoding) | |
} | |
function allocUnsafe (that, size) { | |
assertSize(size) | |
that = createBuffer(that, size < 0 ? 0 : checked(size) | 0) | |
if (!Buffer.TYPED_ARRAY_SUPPORT) { | |
for (var i = 0; i < size; ++i) { | |
that[i] = 0 | |
} | |
} | |
return that | |
} | |
/** | |
* Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance. | |
* */ | |
Buffer.allocUnsafe = function (size) { | |
return allocUnsafe(null, size) | |
} | |
/** | |
* Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance. | |
*/ | |
Buffer.allocUnsafeSlow = function (size) { | |
return allocUnsafe(null, size) | |
} | |
function fromString (that, string, encoding) { | |
if (typeof encoding !== 'string' || encoding === '') { | |
encoding = 'utf8' | |
} | |
if (!Buffer.isEncoding(encoding)) { | |
throw new TypeError('"encoding" must be a valid string encoding') | |
} | |
var length = byteLength(string, encoding) | 0 | |
that = createBuffer(that, length) | |
var actual = that.write(string, encoding) | |
if (actual !== length) { | |
// Writing a hex string, for example, that contains invalid characters will | |
// cause everything after the first invalid character to be ignored. (e.g. | |
// 'abxxcd' will be treated as 'ab') | |
that = that.slice(0, actual) | |
} | |
return that | |
} | |
function fromArrayLike (that, array) { | |
var length = array.length < 0 ? 0 : checked(array.length) | 0 | |
that = createBuffer(that, length) | |
for (var i = 0; i < length; i += 1) { | |
that[i] = array[i] & 255 | |
} | |
return that | |
} | |
function fromArrayBuffer (that, array, byteOffset, length) { | |
array.byteLength // this throws if `array` is not a valid ArrayBuffer | |
if (byteOffset < 0 || array.byteLength < byteOffset) { | |
throw new RangeError('\'offset\' is out of bounds') | |
} | |
if (array.byteLength < byteOffset + (length || 0)) { | |
throw new RangeError('\'length\' is out of bounds') | |
} | |
if (byteOffset === undefined && length === undefined) { | |
array = new Uint8Array(array) | |
} else if (length === undefined) { | |
array = new Uint8Array(array, byteOffset) | |
} else { | |
array = new Uint8Array(array, byteOffset, length) | |
} | |
if (Buffer.TYPED_ARRAY_SUPPORT) { | |
// Return an augmented `Uint8Array` instance, for best performance | |
that = array | |
that.__proto__ = Buffer.prototype | |
} else { | |
// Fallback: Return an object instance of the Buffer class | |
that = fromArrayLike(that, array) | |
} | |
return that | |
} | |
function fromObject (that, obj) { | |
if (Buffer.isBuffer(obj)) { | |
var len = checked(obj.length) | 0 | |
that = createBuffer(that, len) | |
if (that.length === 0) { | |
return that | |
} | |
obj.copy(that, 0, 0, len) | |
return that | |
} | |
if (obj) { | |
if ((typeof ArrayBuffer !== 'undefined' && | |
obj.buffer instanceof ArrayBuffer) || 'length' in obj) { | |
if (typeof obj.length !== 'number' || isnan(obj.length)) { | |
return createBuffer(that, 0) | |
} | |
return fromArrayLike(that, obj) | |
} | |
if (obj.type === 'Buffer' && isArray(obj.data)) { | |
return fromArrayLike(that, obj.data) | |
} | |
} | |
throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.') | |
} | |
function checked (length) { | |
// Note: cannot use `length < kMaxLength()` here because that fails when | |
// length is NaN (which is otherwise coerced to zero.) | |
if (length >= kMaxLength()) { | |
throw new RangeError('Attempt to allocate Buffer larger than maximum ' + | |
'size: 0x' + kMaxLength().toString(16) + ' bytes') | |
} | |
return length | 0 | |
} | |
function SlowBuffer (length) { | |
if (+length != length) { // eslint-disable-line eqeqeq | |
length = 0 | |
} | |
return Buffer.alloc(+length) | |
} | |
Buffer.isBuffer = function isBuffer (b) { | |
return !!(b != null && b._isBuffer) | |
} | |
Buffer.compare = function compare (a, b) { | |
if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) { | |
throw new TypeError('Arguments must be Buffers') | |
} | |
if (a === b) return 0 | |
var x = a.length | |
var y = b.length | |
for (var i = 0, len = Math.min(x, y); i < len; ++i) { | |
if (a[i] !== b[i]) { | |
x = a[i] | |
y = b[i] | |
break | |
} | |
} | |
if (x < y) return -1 | |
if (y < x) return 1 | |
return 0 | |
} | |
Buffer.isEncoding = function isEncoding (encoding) { | |
switch (String(encoding).toLowerCase()) { | |
case 'hex': | |
case 'utf8': | |
case 'utf-8': | |
case 'ascii': | |
case 'latin1': | |
case 'binary': | |
case 'base64': | |
case 'ucs2': | |
case 'ucs-2': | |
case 'utf16le': | |
case 'utf-16le': | |
return true | |
default: | |
return false | |
} | |
} | |
Buffer.concat = function concat (list, length) { | |
if (!isArray(list)) { | |
throw new TypeError('"list" argument must be an Array of Buffers') | |
} | |
if (list.length === 0) { | |
return Buffer.alloc(0) | |
} | |
var i | |
if (length === undefined) { | |
length = 0 | |
for (i = 0; i < list.length; ++i) { | |
length += list[i].length | |
} | |
} | |
var buffer = Buffer.allocUnsafe(length) | |
var pos = 0 | |
for (i = 0; i < list.length; ++i) { | |
var buf = list[i] | |
if (!Buffer.isBuffer(buf)) { | |
throw new TypeError('"list" argument must be an Array of Buffers') | |
} | |
buf.copy(buffer, pos) | |
pos += buf.length | |
} | |
return buffer | |
} | |
function byteLength (string, encoding) { | |
if (Buffer.isBuffer(string)) { | |
return string.length | |
} | |
if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' && | |
(ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) { | |
return string.byteLength | |
} | |
if (typeof string !== 'string') { | |
string = '' + string | |
} | |
var len = string.length | |
if (len === 0) return 0 | |
// Use a for loop to avoid recursion | |
var loweredCase = false | |
for (;;) { | |
switch (encoding) { | |
case 'ascii': | |
case 'latin1': | |
case 'binary': | |
return len | |
case 'utf8': | |
case 'utf-8': | |
case undefined: | |
return utf8ToBytes(string).length | |
case 'ucs2': | |
case 'ucs-2': | |
case 'utf16le': | |
case 'utf-16le': | |
return len * 2 | |
case 'hex': | |
return len >>> 1 | |
case 'base64': | |
return base64ToBytes(string).length | |
default: | |
if (loweredCase) return utf8ToBytes(string).length // assume utf8 | |
encoding = ('' + encoding).toLowerCase() | |
loweredCase = true | |
} | |
} | |
} | |
Buffer.byteLength = byteLength | |
function slowToString (encoding, start, end) { | |
var loweredCase = false | |
// No need to verify that "this.length <= MAX_UINT32" since it's a read-only | |
// property of a typed array. | |
// This behaves neither like String nor Uint8Array in that we set start/end | |
// to their upper/lower bounds if the value passed is out of range. | |
// undefined is handled specially as per ECMA-262 6th Edition, | |
// Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization. | |
if (start === undefined || start < 0) { | |
start = 0 | |
} | |
// Return early if start > this.length. Done here to prevent potential uint32 | |
// coercion fail below. | |
if (start > this.length) { | |
return '' | |
} | |
if (end === undefined || end > this.length) { | |
end = this.length | |
} | |
if (end <= 0) { | |
return '' | |
} | |
// Force coersion to uint32. This will also coerce falsey/NaN values to 0. | |
end >>>= 0 | |
start >>>= 0 | |
if (end <= start) { | |
return '' | |
} | |
if (!encoding) encoding = 'utf8' | |
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 'latin1': | |
case 'binary': | |
return latin1Slice(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 | |
} | |
} | |
} | |
// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect | |
// Buffer instances. | |
Buffer.prototype._isBuffer = true | |
function swap (b, n, m) { | |
var i = b[n] | |
b[n] = b[m] | |
b[m] = i | |
} | |
Buffer.prototype.swap16 = function swap16 () { | |
var len = this.length | |
if (len % 2 !== 0) { | |
throw new RangeError('Buffer size must be a multiple of 16-bits') | |
} | |
for (var i = 0; i < len; i += 2) { | |
swap(this, i, i + 1) | |
} | |
return this | |
} | |
Buffer.prototype.swap32 = function swap32 () { | |
var len = this.length | |
if (len % 4 !== 0) { | |
throw new RangeError('Buffer size must be a multiple of 32-bits') | |
} | |
for (var i = 0; i < len; i += 4) { | |
swap(this, i, i + 3) | |
swap(this, i + 1, i + 2) | |
} | |
return this | |
} | |
Buffer.prototype.swap64 = function swap64 () { | |
var len = this.length | |
if (len % 8 !== 0) { | |
throw new RangeError('Buffer size must be a multiple of 64-bits') | |
} | |
for (var i = 0; i < len; i += 8) { | |
swap(this, i, i + 7) | |
swap(this, i + 1, i + 6) | |
swap(this, i + 2, i + 5) | |
swap(this, i + 3, i + 4) | |
} | |
return this | |
} | |
Buffer.prototype.toString = function toString () { | |
var length = this.length | 0 | |
if (length === 0) return '' | |
if (arguments.length === 0) return utf8Slice(this, 0, length) | |
return slowToString.apply(this, arguments) | |
} | |
Buffer.prototype.equals = function equals (b) { | |
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') | |
if (this === b) return true | |
return Buffer.compare(this, b) === 0 | |
} | |
Buffer.prototype.inspect = function inspect () { | |
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 compare (target, start, end, thisStart, thisEnd) { | |
if (!Buffer.isBuffer(target)) { | |
throw new TypeError('Argument must be a Buffer') | |
} | |
if (start === undefined) { | |
start = 0 | |
} | |
if (end === undefined) { | |
end = target ? target.length : 0 | |
} | |
if (thisStart === undefined) { | |
thisStart = 0 | |
} | |
if (thisEnd === undefined) { | |
thisEnd = this.length | |
} | |
if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) { | |
throw new RangeError('out of range index') | |
} | |
if (thisStart >= thisEnd && start >= end) { | |
return 0 | |
} | |
if (thisStart >= thisEnd) { | |
return -1 | |
} | |
if (start >= end) { | |
return 1 | |
} | |
start >>>= 0 | |
end >>>= 0 | |
thisStart >>>= 0 | |
thisEnd >>>= 0 | |
if (this === target) return 0 | |
var x = thisEnd - thisStart | |
var y = end - start | |
var len = Math.min(x, y) | |
var thisCopy = this.slice(thisStart, thisEnd) | |
var targetCopy = target.slice(start, end) | |
for (var i = 0; i < len; ++i) { | |
if (thisCopy[i] !== targetCopy[i]) { | |
x = thisCopy[i] | |
y = targetCopy[i] | |
break | |
} | |
} | |
if (x < y) return -1 | |
if (y < x) return 1 | |
return 0 | |
} | |
// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`, | |
// OR the last index of `val` in `buffer` at offset <= `byteOffset`. | |
// | |
// Arguments: | |
// - buffer - a Buffer to search | |
// - val - a string, Buffer, or number | |
// - byteOffset - an index into `buffer`; will be clamped to an int32 | |
// - encoding - an optional encoding, relevant is val is a string | |
// - dir - true for indexOf, false for lastIndexOf | |
function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) { | |
// Empty buffer means no match | |
if (buffer.length === 0) return -1 | |
// Normalize byteOffset | |
if (typeof byteOffset === 'string') { | |
encoding = byteOffset | |
byteOffset = 0 | |
} else if (byteOffset > 0x7fffffff) { | |
byteOffset = 0x7fffffff | |
} else if (byteOffset < -0x80000000) { | |
byteOffset = -0x80000000 | |
} | |
byteOffset = +byteOffset // Coerce to Number. | |
if (isNaN(byteOffset)) { | |
// byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer | |
byteOffset = dir ? 0 : (buffer.length - 1) | |
} | |
// Normalize byteOffset: negative offsets start from the end of the buffer | |
if (byteOffset < 0) byteOffset = buffer.length + byteOffset | |
if (byteOffset >= buffer.length) { | |
if (dir) return -1 | |
else byteOffset = buffer.length - 1 | |
} else if (byteOffset < 0) { | |
if (dir) byteOffset = 0 | |
else return -1 | |
} | |
// Normalize val | |
if (typeof val === 'string') { | |
val = Buffer.from(val, encoding) | |
} | |
// Finally, search either indexOf (if dir is true) or lastIndexOf | |
if (Buffer.isBuffer(val)) { | |
// Special case: looking for empty string/buffer always fails | |
if (val.length === 0) { | |
return -1 | |
} | |
return arrayIndexOf(buffer, val, byteOffset, encoding, dir) | |
} else if (typeof val === 'number') { | |
val = val & 0xFF // Search for a byte value [0-255] | |
if (Buffer.TYPED_ARRAY_SUPPORT && | |
typeof Uint8Array.prototype.indexOf === 'function') { | |
if (dir) { | |
return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset) | |
} else { | |
return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset) | |
} | |
} | |
return arrayIndexOf(buffer, [ val ], byteOffset, encoding, dir) | |
} | |
throw new TypeError('val must be string, number or Buffer') | |
} | |
function arrayIndexOf (arr, val, byteOffset, encoding, dir) { | |
var indexSize = 1 | |
var arrLength = arr.length | |
var valLength = val.length | |
if (encoding !== undefined) { | |
encoding = String(encoding).toLowerCase() | |
if (encoding === 'ucs2' || encoding === 'ucs-2' || | |
encoding === 'utf16le' || encoding === 'utf-16le') { | |
if (arr.length < 2 || val.length < 2) { | |
return -1 | |
} | |
indexSize = 2 | |
arrLength /= 2 | |
valLength /= 2 | |
byteOffset /= 2 | |
} | |
} | |
function read (buf, i) { | |
if (indexSize === 1) { | |
return buf[i] | |
} else { | |
return buf.readUInt16BE(i * indexSize) | |
} | |
} | |
var i | |
if (dir) { | |
var foundIndex = -1 | |
for (i = byteOffset; i < arrLength; i++) { | |
if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) { | |
if (foundIndex === -1) foundIndex = i | |
if (i - foundIndex + 1 === valLength) return foundIndex * indexSize | |
} else { | |
if (foundIndex !== -1) i -= i - foundIndex | |
foundIndex = -1 | |
} | |
} | |
} else { | |
if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength | |
for (i = byteOffset; i >= 0; i--) { | |
var found = true | |
for (var j = 0; j < valLength; j++) { | |
if (read(arr, i + j) !== read(val, j)) { | |
found = false | |
break | |
} | |
} | |
if (found) return i | |
} | |
} | |
return -1 | |
} | |
Buffer.prototype.includes = function includes (val, byteOffset, encoding) { | |
return this.indexOf(val, byteOffset, encoding) !== -1 | |
} | |
Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) { | |
return bidirectionalIndexOf(this, val, byteOffset, encoding, true) | |
} | |
Buffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) { | |
return bidirectionalIndexOf(this, val, byteOffset, encoding, false) | |
} | |
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 TypeError('Invalid hex string') | |
if (length > strLen / 2) { | |
length = strLen / 2 | |
} | |
for (var i = 0; i < length; ++i) { | |
var parsed = parseInt(string.substr(i * 2, 2), 16) | |
if (isNaN(parsed)) return i | |
buf[offset + i] = parsed | |
} | |
return i | |
} | |
function utf8Write (buf, string, offset, length) { | |
return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length) | |
} | |
function asciiWrite (buf, string, offset, length) { | |
return blitBuffer(asciiToBytes(string), buf, offset, length) | |
} | |
function latin1Write (buf, string, offset, length) { | |
return asciiWrite(buf, string, offset, length) | |
} | |
function base64Write (buf, string, offset, length) { | |
return blitBuffer(base64ToBytes(string), buf, offset, length) | |
} | |
function ucs2Write (buf, string, offset, length) { | |
return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length) | |
} | |
Buffer.prototype.write = function write (string, offset, length, encoding) { | |
// Buffer#write(string) | |
if (offset === undefined) { | |
encoding = 'utf8' | |
length = this.length | |
offset = 0 | |
// Buffer#write(string, encoding) | |
} else if (length === undefined && typeof offset === 'string') { | |
encoding = offset | |
length = this.length | |
offset = 0 | |
// Buffer#write(string, offset[, length][, encoding]) | |
} else if (isFinite(offset)) { | |
offset = offset | 0 | |
if (isFinite(length)) { | |
length = length | 0 | |
if (encoding === undefined) encoding = 'utf8' | |
} else { | |
encoding = length | |
length = undefined | |
} | |
// legacy write(string, encoding, offset, length) - remove in v0.13 | |
} else { | |
throw new Error( | |
'Buffer.write(string, encoding, offset[, length]) is no longer supported' | |
) | |
} | |
var remaining = this.length - offset | |
if (length === undefined || length > remaining) length = remaining | |
if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) { | |
throw new RangeError('Attempt to write outside buffer bounds') | |
} | |
if (!encoding) encoding = 'utf8' | |
var loweredCase = false | |
for (;;) { | |
switch (encoding) { | |
case 'hex': | |
return hexWrite(this, string, offset, length) | |
case 'utf8': | |
case 'utf-8': | |
return utf8Write(this, string, offset, length) | |
case 'ascii': | |
return asciiWrite(this, string, offset, length) | |
case 'latin1': | |
case 'binary': | |
return latin1Write(this, string, offset, length) | |
case 'base64': | |
// Warning: maxLength not taken into account in base64Write | |
return base64Write(this, string, offset, length) | |
case 'ucs2': | |
case 'ucs-2': | |
case 'utf16le': | |
case 'utf-16le': | |
return ucs2Write(this, string, offset, length) | |
default: | |
if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) | |
encoding = ('' + encoding).toLowerCase() | |
loweredCase = true | |
} | |
} | |
} | |
Buffer.prototype.toJSON = function toJSON () { | |
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) { | |
end = Math.min(buf.length, end) | |
var res = [] | |
var i = start | |
while (i < end) { | |
var firstByte = buf[i] | |
var codePoint = null | |
var bytesPerSequence = (firstByte > 0xEF) ? 4 | |
: (firstByte > 0xDF) ? 3 | |
: (firstByte > 0xBF) ? 2 | |
: 1 | |
if (i + bytesPerSequence <= end) { | |
var secondByte, thirdByte, fourthByte, tempCodePoint | |
switch (bytesPerSequence) { | |
case 1: | |
if (firstByte < 0x80) { | |
codePoint = firstByte | |
} | |
break | |
case 2: | |
secondByte = buf[i + 1] | |
if ((secondByte & 0xC0) === 0x80) { | |
tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F) | |
if (tempCodePoint > 0x7F) { | |
codePoint = tempCodePoint | |
} | |
} | |
break | |
case 3: | |
secondByte = buf[i + 1] | |
thirdByte = buf[i + 2] | |
if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) { | |
tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F) | |
if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) { | |
codePoint = tempCodePoint | |
} | |
} | |
break | |
case 4: | |
secondByte = buf[i + 1] | |
thirdByte = buf[i + 2] | |
fourthByte = buf[i + 3] | |
if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) { | |
tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F) | |
if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) { | |
codePoint = tempCodePoint | |
} | |
} | |
} | |
} | |
if (codePoint === null) { | |
// we did not generate a valid codePoint so insert a | |
// replacement char (U+FFFD) and advance only 1 byte | |
codePoint = 0xFFFD | |
bytesPerSequence = 1 | |
} else if (codePoint > 0xFFFF) { | |
// encode to utf16 (surrogate pair dance) | |
codePoint -= 0x10000 | |
res.push(codePoint >>> 10 & 0x3FF | 0xD800) | |
codePoint = 0xDC00 | codePoint & 0x3FF | |
} | |
res.push(codePoint) | |
i += bytesPerSequence | |
} | |
return decodeCodePointsArray(res) | |
} | |
// Based on http://stackoverflow.com/a/22747272/680742, the browser with | |
// the lowest limit is Chrome, with 0x10000 args. | |
// We go 1 magnitude less, for safety | |
var MAX_ARGUMENTS_LENGTH = 0x1000 | |
function decodeCodePointsArray (codePoints) { | |
var len = codePoints.length | |
if (len <= MAX_ARGUMENTS_LENGTH) { | |
return String.fromCharCode.apply(String, codePoints) // avoid extra slice() | |
} | |
// Decode in chunks to avoid "call stack size exceeded". | |
var res = '' | |
var i = 0 | |
while (i < len) { | |
res += String.fromCharCode.apply( | |
String, | |
codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH) | |
) | |
} | |
return res | |
} | |
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 latin1Slice (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 slice (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 = this.subarray(start, end) | |
newBuf.__proto__ = Buffer.prototype | |
} else { | |
var sliceLen = end - start | |
newBuf = new Buffer(sliceLen, undefined) | |
for (var i = 0; i < sliceLen; ++i) { | |
newBuf[i] = this[i + start] | |
} | |
} | |
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 readUIntLE (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 readUIntBE (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 readUInt8 (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 1, this.length) | |
return this[offset] | |
} | |
Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 2, this.length) | |
return this[offset] | (this[offset + 1] << 8) | |
} | |
Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 2, this.length) | |
return (this[offset] << 8) | this[offset + 1] | |
} | |
Buffer.prototype.readUInt32LE = function readUInt32LE (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 readUInt32BE (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 readIntLE (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 readIntBE (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 readInt8 (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 readInt16LE (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 readInt16BE (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 readInt32LE (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 readInt32BE (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 readFloatLE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return ieee754.read(this, offset, true, 23, 4) | |
} | |
Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 4, this.length) | |
return ieee754.read(this, offset, false, 23, 4) | |
} | |
Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) { | |
if (!noAssert) checkOffset(offset, 8, this.length) | |
return ieee754.read(this, offset, true, 52, 8) | |
} | |
Buffer.prototype.readDoubleBE = function readDoubleBE (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" argument must be a Buffer instance') | |
if (value > max || value < min) throw new RangeError('"value" argument is out of bounds') | |
if (offset + ext > buf.length) throw new RangeError('Index out of range') | |
} | |
Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) { | |
var maxBytes = Math.pow(2, 8 * byteLength) - 1 | |
checkInt(this, value, offset, byteLength, maxBytes, 0) | |
} | |
var mul = 1 | |
var i = 0 | |
this[offset] = value & 0xFF | |
while (++i < byteLength && (mul *= 0x100)) { | |
this[offset + i] = (value / mul) & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
byteLength = byteLength | 0 | |
if (!noAssert) { | |
var maxBytes = Math.pow(2, 8 * byteLength) - 1 | |
checkInt(this, value, offset, byteLength, maxBytes, 0) | |
} | |
var i = byteLength - 1 | |
var mul = 1 | |
this[offset + i] = value & 0xFF | |
while (--i >= 0 && (mul *= 0x100)) { | |
this[offset + i] = (value / mul) & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeUInt8 = function writeUInt8 (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 & 0xff) | |
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 writeUInt16LE (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 & 0xff) | |
this[offset + 1] = (value >>> 8) | |
} else { | |
objectWriteUInt16(this, value, offset, true) | |
} | |
return offset + 2 | |
} | |
Buffer.prototype.writeUInt16BE = function writeUInt16BE (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 & 0xff) | |
} 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 writeUInt32LE (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 & 0xff) | |
} else { | |
objectWriteUInt32(this, value, offset, true) | |
} | |
return offset + 4 | |
} | |
Buffer.prototype.writeUInt32BE = function writeUInt32BE (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 & 0xff) | |
} else { | |
objectWriteUInt32(this, value, offset, false) | |
} | |
return offset + 4 | |
} | |
Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) { | |
var limit = Math.pow(2, 8 * byteLength - 1) | |
checkInt(this, value, offset, byteLength, limit - 1, -limit) | |
} | |
var i = 0 | |
var mul = 1 | |
var sub = 0 | |
this[offset] = value & 0xFF | |
while (++i < byteLength && (mul *= 0x100)) { | |
if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) { | |
sub = 1 | |
} | |
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) { | |
value = +value | |
offset = offset | 0 | |
if (!noAssert) { | |
var limit = Math.pow(2, 8 * byteLength - 1) | |
checkInt(this, value, offset, byteLength, limit - 1, -limit) | |
} | |
var i = byteLength - 1 | |
var mul = 1 | |
var sub = 0 | |
this[offset + i] = value & 0xFF | |
while (--i >= 0 && (mul *= 0x100)) { | |
if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) { | |
sub = 1 | |
} | |
this[offset + i] = ((value / mul) >> 0) - sub & 0xFF | |
} | |
return offset + byteLength | |
} | |
Buffer.prototype.writeInt8 = function writeInt8 (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 & 0xff) | |
return offset + 1 | |
} | |
Buffer.prototype.writeInt16LE = function writeInt16LE (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 & 0xff) | |
this[offset + 1] = (value >>> 8) | |
} else { | |
objectWriteUInt16(this, value, offset, true) | |
} | |
return offset + 2 | |
} | |
Buffer.prototype.writeInt16BE = function writeInt16BE (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 & 0xff) | |
} else { | |
objectWriteUInt16(this, value, offset, false) | |
} | |
return offset + 2 | |
} | |
Buffer.prototype.writeInt32LE = function writeInt32LE (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 & 0xff) | |
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 writeInt32BE (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 & 0xff) | |
} else { | |
objectWriteUInt32(this, value, offset, false) | |
} | |
return offset + 4 | |
} | |
function checkIEEE754 (buf, value, offset, ext, max, min) { | |
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 writeFloatLE (value, offset, noAssert) { | |
return writeFloat(this, value, offset, true, noAssert) | |
} | |
Buffer.prototype.writeFloatBE = function writeFloatBE (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 writeDoubleLE (value, offset, noAssert) { | |
return writeDouble(this, value, offset, true, noAssert) | |
} | |
Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) { | |
return writeDouble(this, value, offset, false, noAssert) | |
} | |
// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) | |
Buffer.prototype.copy = function copy (target, targetStart, start, end) { | |
if (!start) start = 0 | |
if (!end && end !== 0) end = this.length | |
if (targetStart >= target.length) targetStart = target.length | |
if (!targetStart) targetStart = 0 | |
if (end > 0 && end < start) end = start | |
// Copy 0 bytes; we're done | |
if (end === start) return 0 | |
if (target.length === 0 || this.length === 0) return 0 | |
// Fatal error conditions | |
if (targetStart < 0) { | |
throw new RangeError('targetStart out of bounds') | |
} | |
if (start < 0 || start >= this.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 - targetStart < end - start) { | |
end = target.length - targetStart + start | |
} | |
var len = end - start | |
var i | |
if (this === target && start < targetStart && targetStart < end) { | |
// descending copy from end | |
for (i = len - 1; i >= 0; --i) { | |
target[i + targetStart] = this[i + start] | |
} | |
} else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) { | |
// ascending copy from start | |
for (i = 0; i < len; ++i) { | |
target[i + targetStart] = this[i + start] | |
} | |
} else { | |
Uint8Array.prototype.set.call( | |
target, | |
this.subarray(start, start + len), | |
targetStart | |
) | |
} | |
return len | |
} | |
// Usage: | |
// buffer.fill(number[, offset[, end]]) | |
// buffer.fill(buffer[, offset[, end]]) | |
// buffer.fill(string[, offset[, end]][, encoding]) | |
Buffer.prototype.fill = function fill (val, start, end, encoding) { | |
// Handle string cases: | |
if (typeof val === 'string') { | |
if (typeof start === 'string') { | |
encoding = start | |
start = 0 | |
end = this.length | |
} else if (typeof end === 'string') { | |
encoding = end | |
end = this.length | |
} | |
if (val.length === 1) { | |
var code = val.charCodeAt(0) | |
if (code < 256) { | |
val = code | |
} | |
} | |
if (encoding !== undefined && typeof encoding !== 'string') { | |
throw new TypeError('encoding must be a string') | |
} | |
if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) { | |
throw new TypeError('Unknown encoding: ' + encoding) | |
} | |
} else if (typeof val === 'number') { | |
val = val & 255 | |
} | |
// Invalid ranges are not set to a default, so can range check early. | |
if (start < 0 || this.length < start || this.length < end) { | |
throw new RangeError('Out of range index') | |
} | |
if (end <= start) { | |
return this | |
} | |
start = start >>> 0 | |
end = end === undefined ? this.length : end >>> 0 | |
if (!val) val = 0 | |
var i | |
if (typeof val === 'number') { | |
for (i = start; i < end; ++i) { | |
this[i] = val | |
} | |
} else { | |
var bytes = Buffer.isBuffer(val) | |
? val | |
: utf8ToBytes(new Buffer(val, encoding).toString()) | |
var len = bytes.length | |
for (i = 0; i < end - start; ++i) { | |
this[i + start] = bytes[i % len] | |
} | |
} | |
return this | |
} | |
// HELPER FUNCTIONS | |
// ================ | |
var INVALID_BASE64_RE = /[^+\/0-9A-Za-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 toHex (n) { | |
if (n < 16) return '0' + n.toString(16) | |
return n.toString(16) | |
} | |
function utf8ToBytes (string, units) { | |
units = units || Infinity | |
var codePoint | |
var length = string.length | |
var leadSurrogate = null | |
var bytes = [] | |
for (var i = 0; i < length; ++i) { | |
codePoint = string.charCodeAt(i) | |
// is surrogate component | |
if (codePoint > 0xD7FF && codePoint < 0xE000) { | |
// last char was a lead | |
if (!leadSurrogate) { | |
// no lead yet | |
if (codePoint > 0xDBFF) { | |
// unexpected trail | |
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) | |
continue | |
} else if (i + 1 === length) { | |
// unpaired lead | |
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) | |
continue | |
} | |
// valid lead | |
leadSurrogate = codePoint | |
continue | |
} | |
// 2 leads in a row | |
if (codePoint < 0xDC00) { | |
if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) | |
leadSurrogate = codePoint | |
continue | |
} | |
// valid surrogate pair | |
codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000 | |
} else if (leadSurrogate) { | |
// valid bmp char, but last char was a lead | |
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 < 0x110000) { | |
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) { | |
for (var i = 0; i < length; ++i) { | |
if ((i + offset >= dst.length) || (i >= src.length)) break | |
dst[i + offset] = src[i] | |
} | |
return i | |
} | |
function isnan (val) { | |
return val !== val // eslint-disable-line no-self-compare | |
} | |
}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) | |
},{"base64-js":1,"ieee754":25,"isarray":30}],6:[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(arg) { | |
if (Array.isArray) { | |
return Array.isArray(arg); | |
} | |
return objectToString(arg) === '[object Array]'; | |
} | |
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 objectToString(re) === '[object RegExp]'; | |
} | |
exports.isRegExp = isRegExp; | |
function isObject(arg) { | |
return typeof arg === 'object' && arg !== null; | |
} | |
exports.isObject = isObject; | |
function isDate(d) { | |
return objectToString(d) === '[object Date]'; | |
} | |
exports.isDate = isDate; | |
function isError(e) { | |
return (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 = Buffer.isBuffer; | |
function objectToString(o) { | |
return Object.prototype.toString.call(o); | |
} | |
}).call(this,{"isBuffer":require("../../is-buffer/index.js")}) | |
},{"../../is-buffer/index.js":27}],7:[function(require,module,exports){ | |
var pSlice = Array.prototype.slice; | |
var objectKeys = require('./lib/keys.js'); | |
var isArguments = require('./lib/is_arguments.js'); | |
var deepEqual = module.exports = function (actual, expected, opts) { | |
if (!opts) opts = {}; | |
// 7.1. All identical values are equivalent, as determined by ===. | |
if (actual === expected) { | |
return true; | |
} else if (actual instanceof Date && expected instanceof Date) { | |
return actual.getTime() === expected.getTime(); | |
// 7.3. Other pairs that do not both pass typeof value == 'object', | |
// equivalence is determined by ==. | |
} else if (!actual || !expected || typeof actual != 'object' && typeof expected != 'object') { | |
return opts.strict ? actual === expected : actual == expected; | |
// 7.4. For all other Object pairs, including Array objects, equivalence is | |
// determined by having the same number of owned properties (as verified | |
// with Object.prototype.hasOwnProperty.call), the same set of keys | |
// (although not necessarily the same order), equivalent values for every | |
// corresponding key, and an identical 'prototype' property. Note: this | |
// accounts for both named and indexed properties on Arrays. | |
} else { | |
return objEquiv(actual, expected, opts); | |
} | |
} | |
function isUndefinedOrNull(value) { | |
return value === null || value === undefined; | |
} | |
function isBuffer (x) { | |
if (!x || typeof x !== 'object' || typeof x.length !== 'number') return false; | |
if (typeof x.copy !== 'function' || typeof x.slice !== 'function') { | |
return false; | |
} | |
if (x.length > 0 && typeof x[0] !== 'number') return false; | |
return true; | |
} | |
function objEquiv(a, b, opts) { | |
var i, key; | |
if (isUndefinedOrNull(a) || isUndefinedOrNull(b)) | |
return false; | |
// an identical 'prototype' property. | |
if (a.prototype !== b.prototype) return false; | |
//~~~I've managed to break Object.keys through screwy arguments passing. | |
// Converting to array solves the problem. | |
if (isArguments(a)) { | |
if (!isArguments(b)) { | |
return false; | |
} | |
a = pSlice.call(a); | |
b = pSlice.call(b); | |
return deepEqual(a, b, opts); | |
} | |
if (isBuffer(a)) { | |
if (!isBuffer(b)) { | |
return false; | |
} | |
if (a.length !== b.length) return false; | |
for (i = 0; i < a.length; i++) { | |
if (a[i] !== b[i]) return false; | |
} | |
return true; | |
} | |
try { | |
var ka = objectKeys(a), | |
kb = objectKeys(b); | |
} catch (e) {//happens when one is a string literal and the other isn't | |
return false; | |
} | |
// having the same number of owned properties (keys incorporates | |
// hasOwnProperty) | |
if (ka.length != kb.length) | |
return false; | |
//the same set of keys (although not necessarily the same order), | |
ka.sort(); | |
kb.sort(); | |
//~~~cheap key test | |
for (i = ka.length - 1; i >= 0; i--) { | |
if (ka[i] != kb[i]) | |
return false; | |
} | |
//equivalent values for every corresponding key, and | |
//~~~possibly expensive deep test | |
for (i = ka.length - 1; i >= 0; i--) { | |
key = ka[i]; | |
if (!deepEqual(a[key], b[key], opts)) return false; | |
} | |
return typeof a === typeof b; | |
} | |
},{"./lib/is_arguments.js":8,"./lib/keys.js":9}],8:[function(require,module,exports){ | |
var supportsArgumentsClass = (function(){ | |
return Object.prototype.toString.call(arguments) | |
})() == '[object Arguments]'; | |
exports = module.exports = supportsArgumentsClass ? supported : unsupported; | |
exports.supported = supported; | |
function supported(object) { | |
return Object.prototype.toString.call(object) == '[object Arguments]'; | |
}; | |
exports.unsupported = unsupported; | |
function unsupported(object){ | |
return object && | |
typeof object == 'object' && | |
typeof object.length == 'number' && | |
Object.prototype.hasOwnProperty.call(object, 'callee') && | |
!Object.prototype.propertyIsEnumerable.call(object, 'callee') || | |
false; | |
}; | |
},{}],9:[function(require,module,exports){ | |
exports = module.exports = typeof Object.keys === 'function' | |
? Object.keys : shim; | |
exports.shim = shim; | |
function shim (obj) { | |
var keys = []; | |
for (var key in obj) keys.push(key); | |
return keys; | |
} | |
},{}],10:[function(require,module,exports){ | |
'use strict'; | |
var keys = require('object-keys'); | |
var foreach = require('foreach'); | |
var hasSymbols = typeof Symbol === 'function' && typeof Symbol() === 'symbol'; | |
var toStr = Object.prototype.toString; | |
var isFunction = function (fn) { | |
return typeof fn === 'function' && toStr.call(fn) === '[object Function]'; | |
}; | |
var arePropertyDescriptorsSupported = function () { | |
var obj = {}; | |
try { | |
Object.defineProperty(obj, 'x', { enumerable: false, value: obj }); | |
/* eslint-disable no-unused-vars, no-restricted-syntax */ | |
for (var _ in obj) { return false; } | |
/* eslint-enable no-unused-vars, no-restricted-syntax */ | |
return obj.x === obj; | |
} catch (e) { /* this is IE 8. */ | |
return false; | |
} | |
}; | |
var supportsDescriptors = Object.defineProperty && arePropertyDescriptorsSupported(); | |
var defineProperty = function (object, name, value, predicate) { | |
if (name in object && (!isFunction(predicate) || !predicate())) { | |
return; | |
} | |
if (supportsDescriptors) { | |
Object.defineProperty(object, name, { | |
configurable: true, | |
enumerable: false, | |
value: value, | |
writable: true | |
}); | |
} else { | |
object[name] = value; | |
} | |
}; | |
var defineProperties = function (object, map) { | |
var predicates = arguments.length > 2 ? arguments[2] : {}; | |
var props = keys(map); | |
if (hasSymbols) { | |
props = props.concat(Object.getOwnPropertySymbols(map)); | |
} | |
foreach(props, function (name) { | |
defineProperty(object, name, map[name], predicates[name]); | |
}); | |
}; | |
defineProperties.supportsDescriptors = !!supportsDescriptors; | |
module.exports = defineProperties; | |
},{"foreach":21,"object-keys":32}],11:[function(require,module,exports){ | |
module.exports = function () { | |
for (var i = 0; i < arguments.length; i++) { | |
if (arguments[i] !== undefined) return arguments[i]; | |
} | |
}; | |
},{}],12:[function(require,module,exports){ | |
'use strict'; | |
var $isNaN = require('./helpers/isNaN'); | |
var $isFinite = require('./helpers/isFinite'); | |
var sign = require('./helpers/sign'); | |
var mod = require('./helpers/mod'); | |
var IsCallable = require('is-callable'); | |
var toPrimitive = require('es-to-primitive/es5'); | |
// https://es5.github.io/#x9 | |
var ES5 = { | |
ToPrimitive: toPrimitive, | |
ToBoolean: function ToBoolean(value) { | |
return Boolean(value); | |
}, | |
ToNumber: function ToNumber(value) { | |
return Number(value); | |
}, | |
ToInteger: function ToInteger(value) { | |
var number = this.ToNumber(value); | |
if ($isNaN(number)) { return 0; } | |
if (number === 0 || !$isFinite(number)) { return number; } | |
return sign(number) * Math.floor(Math.abs(number)); | |
}, | |
ToInt32: function ToInt32(x) { | |
return this.ToNumber(x) >> 0; | |
}, | |
ToUint32: function ToUint32(x) { | |
return this.ToNumber(x) >>> 0; | |
}, | |
ToUint16: function ToUint16(value) { | |
var number = this.ToNumber(value); | |
if ($isNaN(number) || number === 0 || !$isFinite(number)) { return 0; } | |
var posInt = sign(number) * Math.floor(Math.abs(number)); | |
return mod(posInt, 0x10000); | |
}, | |
ToString: function ToString(value) { | |
return String(value); | |
}, | |
ToObject: function ToObject(value) { | |
this.CheckObjectCoercible(value); | |
return Object(value); | |
}, | |
CheckObjectCoercible: function CheckObjectCoercible(value, optMessage) { | |
/* jshint eqnull:true */ | |
if (value == null) { | |
throw new TypeError(optMessage || 'Cannot call method on ' + value); | |
} | |
return value; | |
}, | |
IsCallable: IsCallable, | |
SameValue: function SameValue(x, y) { | |
if (x === y) { // 0 === -0, but they are not identical. | |
if (x === 0) { return 1 / x === 1 / y; } | |
return true; | |
} | |
return $isNaN(x) && $isNaN(y); | |
}, | |
// http://www.ecma-international.org/ecma-262/5.1/#sec-8 | |
Type: function Type(x) { | |
if (x === null) { | |
return 'Null'; | |
} | |
if (typeof x === 'undefined') { | |
return 'Undefined'; | |
} | |
if (typeof x === 'function' || typeof x === 'object') { | |
return 'Object'; | |
} | |
if (typeof x === 'number') { | |
return 'Number'; | |
} | |
if (typeof x === 'boolean') { | |
return 'Boolean'; | |
} | |
if (typeof x === 'string') { | |
return 'String'; | |
} | |
} | |
}; | |
module.exports = ES5; | |
},{"./helpers/isFinite":13,"./helpers/isNaN":14,"./helpers/mod":15,"./helpers/sign":16,"es-to-primitive/es5":17,"is-callable":28}],13:[function(require,module,exports){ | |
var $isNaN = Number.isNaN || function (a) { return a !== a; }; | |
module.exports = Number.isFinite || function (x) { return typeof x === 'number' && !$isNaN(x) && x !== Infinity && x !== -Infinity; }; | |
},{}],14:[function(require,module,exports){ | |
module.exports = Number.isNaN || function isNaN(a) { | |
return a !== a; | |
}; | |
},{}],15:[function(require,module,exports){ | |
module.exports = function mod(number, modulo) { | |
var remain = number % modulo; | |
return Math.floor(remain >= 0 ? remain : remain + modulo); | |
}; | |
},{}],16:[function(require,module,exports){ | |
module.exports = function sign(number) { | |
return number >= 0 ? 1 : -1; | |
}; | |
},{}],17:[function(require,module,exports){ | |
'use strict'; | |
var toStr = Object.prototype.toString; | |
var isPrimitive = require('./helpers/isPrimitive'); | |
var isCallable = require('is-callable'); | |
// https://es5.github.io/#x8.12 | |
var ES5internalSlots = { | |
'[[DefaultValue]]': function (O, hint) { | |
var actualHint = hint || (toStr.call(O) === '[object Date]' ? String : Number); | |
if (actualHint === String || actualHint === Number) { | |
var methods = actualHint === String ? ['toString', 'valueOf'] : ['valueOf', 'toString']; | |
var value, i; | |
for (i = 0; i < methods.length; ++i) { | |
if (isCallable(O[methods[i]])) { | |
value = O[methods[i]](); | |
if (isPrimitive(value)) { | |
return value; | |
} | |
} | |
} | |
throw new TypeError('No default value'); | |
} | |
throw new TypeError('invalid [[DefaultValue]] hint supplied'); | |
} | |
}; | |
// https://es5.github.io/#x9 | |
module.exports = function ToPrimitive(input, PreferredType) { | |
if (isPrimitive(input)) { | |
return input; | |
} | |
return ES5internalSlots['[[DefaultValue]]'](input, PreferredType); | |
}; | |
},{"./helpers/isPrimitive":18,"is-callable":28}],18:[function(require,module,exports){ | |
module.exports = function isPrimitive(value) { | |
return value === null || (typeof value !== 'function' && typeof value !== 'object'); | |
}; | |
},{}],19:[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 | |
} else { | |
// At least give some kind of context to the user | |
var err = new Error('Uncaught, unspecified "error" event. (' + er + ')'); | |
err.context = er; | |
throw err; | |
} | |
} | |
} | |
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: | |
args = Array.prototype.slice.call(arguments, 1); | |
handler.apply(this, args); | |
} | |
} else if (isObject(handler)) { | |
args = Array.prototype.slice.call(arguments, 1); | |
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) { | |
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 if (listeners) { | |
// 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.prototype.listenerCount = function(type) { | |
if (this._events) { | |
var evlistener = this._events[type]; | |
if (isFunction(evlistener)) | |
return 1; | |
else if (evlistener) | |
return evlistener.length; | |
} | |
return 0; | |
}; | |
EventEmitter.listenerCount = function(emitter, type) { | |
return emitter.listenerCount(type); | |
}; | |
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; | |
} | |
},{}],20:[function(require,module,exports){ | |
var isFunction = require('is-function') | |
module.exports = forEach | |
var toString = Object.prototype.toString | |
var hasOwnProperty = Object.prototype.hasOwnProperty | |
function forEach(list, iterator, context) { | |
if (!isFunction(iterator)) { | |
throw new TypeError('iterator must be a function') | |
} | |
if (arguments.length < 3) { | |
context = this | |
} | |
if (toString.call(list) === '[object Array]') | |
forEachArray(list, iterator, context) | |
else if (typeof list === 'string') | |
forEachString(list, iterator, context) | |
else | |
forEachObject(list, iterator, context) | |
} | |
function forEachArray(array, iterator, context) { | |
for (var i = 0, len = array.length; i < len; i++) { | |
if (hasOwnProperty.call(array, i)) { | |
iterator.call(context, array[i], i, array) | |
} | |
} | |
} | |
function forEachString(string, iterator, context) { | |
for (var i = 0, len = string.length; i < len; i++) { | |
// no such thing as a sparse string. | |
iterator.call(context, string.charAt(i), i, string) | |
} | |
} | |
function forEachObject(object, iterator, context) { | |
for (var k in object) { | |
if (hasOwnProperty.call(object, k)) { | |
iterator.call(context, object[k], k, object) | |
} | |
} | |
} | |
},{"is-function":29}],21:[function(require,module,exports){ | |
var hasOwn = Object.prototype.hasOwnProperty; | |
var toString = Object.prototype.toString; | |
module.exports = function forEach (obj, fn, ctx) { | |
if (toString.call(fn) !== '[object Function]') { | |
throw new TypeError('iterator must be a function'); | |
} | |
var l = obj.length; | |
if (l === +l) { | |
for (var i = 0; i < l; i++) { | |
fn.call(ctx, obj[i], i, obj); | |
} | |
} else { | |
for (var k in obj) { | |
if (hasOwn.call(obj, k)) { | |
fn.call(ctx, obj[k], k, obj); | |
} | |
} | |
} | |
}; | |
},{}],22:[function(require,module,exports){ | |
var ERROR_MESSAGE = 'Function.prototype.bind called on incompatible '; | |
var slice = Array.prototype.slice; | |
var toStr = Object.prototype.toString; | |
var funcType = '[object Function]'; | |
module.exports = function bind(that) { | |
var target = this; | |
if (typeof target !== 'function' || toStr.call(target) !== funcType) { | |
throw new TypeError(ERROR_MESSAGE + target); | |
} | |
var args = slice.call(arguments, 1); | |
var bound; | |
var binder = function () { | |
if (this instanceof bound) { | |
var result = target.apply( | |
this, | |
args.concat(slice.call(arguments)) | |
); | |
if (Object(result) === result) { | |
return result; | |
} | |
return this; | |
} else { | |
return target.apply( | |
that, | |
args.concat(slice.call(arguments)) | |
); | |
} | |
}; | |
var boundLength = Math.max(0, target.length - args.length); | |
var boundArgs = []; | |
for (var i = 0; i < boundLength; i++) { | |
boundArgs.push('$' + i); | |
} | |
bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder); | |
if (target.prototype) { | |
var Empty = function Empty() {}; | |
Empty.prototype = target.prototype; | |
bound.prototype = new Empty(); | |
Empty.prototype = null; | |
} | |
return bound; | |
}; | |
},{}],23:[function(require,module,exports){ | |
var implementation = require('./implementation'); | |
module.exports = Function.prototype.bind || implementation; | |
},{"./implementation":22}],24:[function(require,module,exports){ | |
var bind = require('function-bind'); | |
module.exports = bind.call(Function.call, Object.prototype.hasOwnProperty); | |
},{"function-bind":23}],25:[function(require,module,exports){ | |
exports.read = function (buffer, offset, isLE, mLen, nBytes) { | |
var e, m | |
var eLen = nBytes * 8 - mLen - 1 | |
var eMax = (1 << eLen) - 1 | |
var eBias = eMax >> 1 | |
var nBits = -7 | |
var i = isLE ? (nBytes - 1) : 0 | |
var d = isLE ? -1 : 1 | |
var 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 | |
var eLen = nBytes * 8 - mLen - 1 | |
var eMax = (1 << eLen) - 1 | |
var eBias = eMax >> 1 | |
var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0) | |
var i = isLE ? 0 : (nBytes - 1) | |
var d = isLE ? 1 : -1 | |
var 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 | |
} | |
},{}],26:[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 | |
} | |
} | |
},{}],27:[function(require,module,exports){ | |
/*! | |
* Determine if an object is a Buffer | |
* | |
* @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org> | |
* @license MIT | |
*/ | |
// The _isBuffer check is for Safari 5-7 support, because it's missing | |
// Object.prototype.constructor. Remove this eventually | |
module.exports = function (obj) { | |
return obj != null && (isBuffer(obj) || isSlowBuffer(obj) || !!obj._isBuffer) | |
} | |
function isBuffer (obj) { | |
return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj) | |
} | |
// For Node v0.10 support. Remove this eventually. | |
function isSlowBuffer (obj) { | |
return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isBuffer(obj.slice(0, 0)) | |
} | |
},{}],28:[function(require,module,exports){ | |
'use strict'; | |
var fnToStr = Function.prototype.toString; | |
var constructorRegex = /^\s*class /; | |
var isES6ClassFn = function isES6ClassFn(value) { | |
try { | |
var fnStr = fnToStr.call(value); | |
var singleStripped = fnStr.replace(/\/\/.*\n/g, ''); | |
var multiStripped = singleStripped.replace(/\/\*[.\s\S]*\*\//g, ''); | |
var spaceStripped = multiStripped.replace(/\n/mg, ' ').replace(/ {2}/g, ' '); | |
return constructorRegex.test(spaceStripped); | |
} catch (e) { | |
return false; // not a function | |
} | |
}; | |
var tryFunctionObject = function tryFunctionObject(value) { | |
try { | |
if (isES6ClassFn(value)) { return false; } | |
fnToStr.call(value); | |
return true; | |
} catch (e) { | |
return false; | |
} | |
}; | |
var toStr = Object.prototype.toString; | |
var fnClass = '[object Function]'; | |
var genClass = '[object GeneratorFunction]'; | |
var hasToStringTag = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol'; | |
module.exports = function isCallable(value) { | |
if (!value) { return false; } | |
if (typeof value !== 'function' && typeof value !== 'object') { return false; } | |
if (hasToStringTag) { return tryFunctionObject(value); } | |
if (isES6ClassFn(value)) { return false; } | |
var strClass = toStr.call(value); | |
return strClass === fnClass || strClass === genClass; | |
}; | |
},{}],29:[function(require,module,exports){ | |
module.exports = isFunction | |
var toString = Object.prototype.toString | |
function isFunction (fn) { | |
var string = toString.call(fn) | |
return string === '[object Function]' || | |
(typeof fn === 'function' && string !== '[object RegExp]') || | |
(typeof window !== 'undefined' && | |
// IE8 and below | |
(fn === window.setTimeout || | |
fn === window.alert || | |
fn === window.confirm || | |
fn === window.prompt)) | |
}; | |
},{}],30:[function(require,module,exports){ | |
var toString = {}.toString; | |
module.exports = Array.isArray || function (arr) { | |
return toString.call(arr) == '[object Array]'; | |
}; | |
},{}],31:[function(require,module,exports){ | |
var hasMap = typeof Map === 'function' && Map.prototype; | |
var mapSizeDescriptor = Object.getOwnPropertyDescriptor && hasMap ? Object.getOwnPropertyDescriptor(Map.prototype, 'size') : null; | |
var mapSize = hasMap && mapSizeDescriptor && typeof mapSizeDescriptor.get === 'function' ? mapSizeDescriptor.get : null; | |
var mapForEach = hasMap && Map.prototype.forEach; | |
var hasSet = typeof Set === 'function' && Set.prototype; | |
var setSizeDescriptor = Object.getOwnPropertyDescriptor && hasSet ? Object.getOwnPropertyDescriptor(Set.prototype, 'size') : null; | |
var setSize = hasSet && setSizeDescriptor && typeof setSizeDescriptor.get === 'function' ? setSizeDescriptor.get : null; | |
var setForEach = hasSet && Set.prototype.forEach; | |
var booleanValueOf = Boolean.prototype.valueOf; | |
module.exports = function inspect_ (obj, opts, depth, seen) { | |
if (!opts) opts = {}; | |
var maxDepth = opts.depth === undefined ? 5 : opts.depth; | |
if (depth === undefined) depth = 0; | |
if (depth >= maxDepth && maxDepth > 0 && obj && typeof obj === 'object') { | |
return '[Object]'; | |
} | |
if (seen === undefined) seen = []; | |
else if (indexOf(seen, obj) >= 0) { | |
return '[Circular]'; | |
} | |
function inspect (value, from) { | |
if (from) { | |
seen = seen.slice(); | |
seen.push(from); | |
} | |
return inspect_(value, opts, depth + 1, seen); | |
} | |
if (typeof obj === 'string') { | |
return inspectString(obj); | |
} | |
else if (typeof obj === 'function') { | |
var name = nameOf(obj); | |
return '[Function' + (name ? ': ' + name : '') + ']'; | |
} | |
else if (obj === null) { | |
return 'null'; | |
} | |
else if (isSymbol(obj)) { | |
var symString = Symbol.prototype.toString.call(obj); | |
return typeof obj === 'object' ? 'Object(' + symString + ')' : symString; | |
} | |
else if (isElement(obj)) { | |
var s = '<' + String(obj.nodeName).toLowerCase(); | |
var attrs = obj.attributes || []; | |
for (var i = 0; i < attrs.length; i++) { | |
s += ' ' + attrs[i].name + '="' + quote(attrs[i].value) + '"'; | |
} | |
s += '>'; | |
if (obj.childNodes && obj.childNodes.length) s += '...'; | |
s += '</' + String(obj.nodeName).toLowerCase() + '>'; | |
return s; | |
} | |
else if (isArray(obj)) { | |
if (obj.length === 0) return '[]'; | |
var xs = Array(obj.length); | |
for (var i = 0; i < obj.length; i++) { | |
xs[i] = has(obj, i) ? inspect(obj[i], obj) : ''; | |
} | |
return '[ ' + xs.join(', ') + ' ]'; | |
} | |
else if (isError(obj)) { | |
var parts = []; | |
for (var key in obj) { | |
if (!has(obj, key)) continue; | |
if (/[^\w$]/.test(key)) { | |
parts.push(inspect(key) + ': ' + inspect(obj[key])); | |
} | |
else { | |
parts.push(key + ': ' + inspect(obj[key])); | |
} | |
} | |
if (parts.length === 0) return '[' + obj + ']'; | |
return '{ [' + obj + '] ' + parts.join(', ') + ' }'; | |
} | |
else if (typeof obj === 'object' && typeof obj.inspect === 'function') { | |
return obj.inspect(); | |
} | |
else if (isMap(obj)) { | |
var parts = []; | |
mapForEach.call(obj, function (value, key) { | |
parts.push(inspect(key, obj) + ' => ' + inspect(value, obj)); | |
}); | |
return 'Map (' + mapSize.call(obj) + ') {' + parts.join(', ') + '}'; | |
} | |
else if (isSet(obj)) { | |
var parts = []; | |
setForEach.call(obj, function (value ) { | |
parts.push(inspect(value, obj)); | |
}); | |
return 'Set (' + setSize.call(obj) + ') {' + parts.join(', ') + '}'; | |
} | |
else if (typeof obj !== 'object') { | |
return String(obj); | |
} | |
else if (isNumber(obj)) { | |
return 'Object(' + Number(obj) + ')'; | |
} | |
else if (isBoolean(obj)) { | |
return 'Object(' + booleanValueOf.call(obj) + ')'; | |
} | |
else if (isString(obj)) { | |
return 'Object(' + inspect(String(obj)) + ')'; | |
} | |
else if (!isDate(obj) && !isRegExp(obj)) { | |
var xs = [], keys = []; | |
for (var key in obj) { | |
if (has(obj, key)) keys.push(key); | |
} | |
keys.sort(); | |
for (var i = 0; i < keys.length; i++) { | |
var key = keys[i]; | |
if (/[^\w$]/.test(key)) { | |
xs.push(inspect(key) + ': ' + inspect(obj[key], obj)); | |
} | |
else xs.push(key + ': ' + inspect(obj[key], obj)); | |
} | |
if (xs.length === 0) return '{}'; | |
return '{ ' + xs.join(', ') + ' }'; | |
} | |
else return String(obj); | |
}; | |
function quote (s) { | |
return String(s).replace(/"/g, '"'); | |
} | |
function isArray (obj) { return toStr(obj) === '[object Array]' } | |
function isDate (obj) { return toStr(obj) === '[object Date]' } | |
function isRegExp (obj) { return toStr(obj) === '[object RegExp]' } | |
function isError (obj) { return toStr(obj) === '[object Error]' } | |
function isSymbol (obj) { return toStr(obj) === '[object Symbol]' } | |
function isString (obj) { return toStr(obj) === '[object String]' } | |
function isNumber (obj) { return toStr(obj) === '[object Number]' } | |
function isBoolean (obj) { return toStr(obj) === '[object Boolean]' } | |
var hasOwn = Object.prototype.hasOwnProperty || function (key) { return key in this; }; | |
function has (obj, key) { | |
return hasOwn.call(obj, key); | |
} | |
function toStr (obj) { | |
return Object.prototype.toString.call(obj); | |
} | |
function nameOf (f) { | |
if (f.name) return f.name; | |
var m = f.toString().match(/^function\s*([\w$]+)/); | |
if (m) return m[1]; | |
} | |
function indexOf (xs, x) { | |
if (xs.indexOf) return xs.indexOf(x); | |
for (var i = 0, l = xs.length; i < l; i++) { | |
if (xs[i] === x) return i; | |
} | |
return -1; | |
} | |
function isMap (x) { | |
if (!mapSize) { | |
return false; | |
} | |
try { | |
mapSize.call(x); | |
return true; | |
} catch (e) {} | |
return false; | |
} | |
function isSet (x) { | |
if (!setSize) { | |
return false; | |
} | |
try { | |
setSize.call(x); | |
return true; | |
} catch (e) {} | |
return false; | |
} | |
function isElement (x) { | |
if (!x || typeof x !== 'object') return false; | |
if (typeof HTMLElement !== 'undefined' && x instanceof HTMLElement) { | |
return true; | |
} | |
return typeof x.nodeName === 'string' | |
&& typeof x.getAttribute === 'function' | |
; | |
} | |
function inspectString (str) { | |
var s = str.replace(/(['\\])/g, '\\$1').replace(/[\x00-\x1f]/g, lowbyte); | |
return "'" + s + "'"; | |
function lowbyte (c) { | |
var n = c.charCodeAt(0); | |
var x = { 8: 'b', 9: 't', 10: 'n', 12: 'f', 13: 'r' }[n]; | |
if (x) return '\\' + x; | |
return '\\x' + (n < 0x10 ? '0' : '') + n.toString(16); | |
} | |
} | |
},{}],32:[function(require,module,exports){ | |
'use strict'; | |
// modified from https://github.com/es-shims/es5-shim | |
var has = Object.prototype.hasOwnProperty; | |
var toStr = Object.prototype.toString; | |
var slice = Array.prototype.slice; | |
var isArgs = require('./isArguments'); | |
var isEnumerable = Object.prototype.propertyIsEnumerable; | |
var hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString'); | |
var hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype'); | |
var dontEnums = [ | |
'toString', | |
'toLocaleString', | |
'valueOf', | |
'hasOwnProperty', | |
'isPrototypeOf', | |
'propertyIsEnumerable', | |
'constructor' | |
]; | |
var equalsConstructorPrototype = function (o) { | |
var ctor = o.constructor; | |
return ctor && ctor.prototype === o; | |
}; | |
var excludedKeys = { | |
$console: true, | |
$external: true, | |
$frame: true, | |
$frameElement: true, | |
$frames: true, | |
$innerHeight: true, | |
$innerWidth: true, | |
$outerHeight: true, | |
$outerWidth: true, | |
$pageXOffset: true, | |
$pageYOffset: true, | |
$parent: true, | |
$scrollLeft: true, | |
$scrollTop: true, | |
$scrollX: true, | |
$scrollY: true, | |
$self: true, | |
$webkitIndexedDB: true, | |
$webkitStorageInfo: true, | |
$window: true | |
}; | |
var hasAutomationEqualityBug = (function () { | |
/* global window */ | |
if (typeof window === 'undefined') { return false; } | |
for (var k in window) { | |
try { | |
if (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') { | |
try { | |
equalsConstructorPrototype(window[k]); | |
} catch (e) { | |
return true; | |
} | |
} | |
} catch (e) { | |
return true; | |
} | |
} | |
return false; | |
}()); | |
var equalsConstructorPrototypeIfNotBuggy = function (o) { | |
/* global window */ | |
if (typeof window === 'undefined' || !hasAutomationEqualityBug) { | |
return equalsConstructorPrototype(o); | |
} | |
try { | |
return equalsConstructorPrototype(o); | |
} catch (e) { | |
return false; | |
} | |
}; | |
var keysShim = function keys(object) { | |
var isObject = object !== null && typeof object === 'object'; | |
var isFunction = toStr.call(object) === '[object Function]'; | |
var isArguments = isArgs(object); | |
var isString = isObject && toStr.call(object) === '[object String]'; | |
var theKeys = []; | |
if (!isObject && !isFunction && !isArguments) { | |
throw new TypeError('Object.keys called on a non-object'); | |
} | |
var skipProto = hasProtoEnumBug && isFunction; | |
if (isString && object.length > 0 && !has.call(object, 0)) { | |
for (var i = 0; i < object.length; ++i) { | |
theKeys.push(String(i)); | |
} | |
} | |
if (isArguments && object.length > 0) { | |
for (var j = 0; j < object.length; ++j) { | |
theKeys.push(String(j)); | |
} | |
} else { | |
for (var name in object) { | |
if (!(skipProto && name === 'prototype') && has.call(object, name)) { | |
theKeys.push(String(name)); | |
} | |
} | |
} | |
if (hasDontEnumBug) { | |
var skipConstructor = equalsConstructorPrototypeIfNotBuggy(object); | |
for (var k = 0; k < dontEnums.length; ++k) { | |
if (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) { | |
theKeys.push(dontEnums[k]); | |
} | |
} | |
} | |
return theKeys; | |
}; | |
keysShim.shim = function shimObjectKeys() { | |
if (Object.keys) { | |
var keysWorksWithArguments = (function () { | |
// Safari 5.0 bug | |
return (Object.keys(arguments) || '').length === 2; | |
}(1, 2)); | |
if (!keysWorksWithArguments) { | |
var originalKeys = Object.keys; | |
Object.keys = function keys(object) { | |
if (isArgs(object)) { | |
return originalKeys(slice.call(object)); | |
} else { | |
return originalKeys(object); | |
} | |
}; | |
} | |
} else { | |
Object.keys = keysShim; | |
} | |
return Object.keys || keysShim; | |
}; | |
module.exports = keysShim; | |
},{"./isArguments":33}],33:[function(require,module,exports){ | |
'use strict'; | |
var toStr = Object.prototype.toString; | |
module.exports = function isArguments(value) { | |
var str = toStr.call(value); | |
var isArgs = str === '[object Arguments]'; | |
if (!isArgs) { | |
isArgs = str !== '[object Array]' && | |
value !== null && | |
typeof value === 'object' && | |
typeof value.length === 'number' && | |
value.length >= 0 && | |
toStr.call(value.callee) === '[object Function]'; | |
} | |
return isArgs; | |
}; | |
},{}],34:[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. | |
// resolves . and .. elements in a path array with directory names there | |
// must be no slashes, empty elements, or device names (c:\) in the array | |
// (so also no leading and trailing slashes - it does not distinguish | |
// relative and absolute paths) | |
function normalizeArray(parts, allowAboveRoot) { | |
// if the path tries to go above the root, `up` ends up > 0 | |
var up = 0; | |
for (var i = parts.length - 1; i >= 0; i--) { | |
var last = parts[i]; | |
if (last === '.') { | |
parts.splice(i, 1); | |
} else if (last === '..') { | |
parts.splice(i, 1); | |
up++; | |
} else if (up) { | |
parts.splice(i, 1); | |
up--; | |
} | |
} | |
// if the path is allowed to go above the root, restore leading ..s | |
if (allowAboveRoot) { | |
for (; up--; up) { | |
parts.unshift('..'); | |
} | |
} | |
return parts; | |
} | |
// Split a filename into [root, dir, basename, ext], unix version | |
// 'root' is just a slash, or nothing. | |
var splitPathRe = | |
/^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/; | |
var splitPath = function(filename) { | |
return splitPathRe.exec(filename).slice(1); | |
}; | |
// path.resolve([from ...], to) | |
// posix version | |
exports.resolve = function() { | |
var resolvedPath = '', | |
resolvedAbsolute = false; | |
for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) { | |
var path = (i >= 0) ? arguments[i] : process.cwd(); | |
// Skip empty and invalid entries | |
if (typeof path !== 'string') { | |
throw new TypeError('Arguments to path.resolve must be strings'); | |
} else if (!path) { | |
continue; | |
} | |
resolvedPath = path + '/' + resolvedPath; | |
resolvedAbsolute = path.charAt(0) === '/'; | |
} | |
// At this point the path should be resolved to a full absolute path, but | |
// handle relative paths to be safe (might happen when process.cwd() fails) | |
// Normalize the path | |
resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) { | |
return !!p; | |
}), !resolvedAbsolute).join('/'); | |
return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.'; | |
}; | |
// path.normalize(path) | |
// posix version | |
exports.normalize = function(path) { | |
var isAbsolute = exports.isAbsolute(path), | |
trailingSlash = substr(path, -1) === '/'; | |
// Normalize the path | |
path = normalizeArray(filter(path.split('/'), function(p) { | |
return !!p; | |
}), !isAbsolute).join('/'); | |
if (!path && !isAbsolute) { | |
path = '.'; | |
} | |
if (path && trailingSlash) { | |
path += '/'; | |
} | |
return (isAbsolute ? '/' : '') + path; | |
}; | |
// posix version | |
exports.isAbsolute = function(path) { | |
return path.charAt(0) === '/'; | |
}; | |
// posix version | |
exports.join = function() { | |
var paths = Array.prototype.slice.call(arguments, 0); | |
return exports.normalize(filter(paths, function(p, index) { | |
if (typeof p !== 'string') { | |
throw new TypeError('Arguments to path.join must be strings'); | |
} | |
return p; | |
}).join('/')); | |
}; | |
// path.relative(from, to) | |
// posix version | |
exports.relative = function(from, to) { | |
from = exports.resolve(from).substr(1); | |
to = exports.resolve(to).substr(1); | |
function trim(arr) { | |
var start = 0; | |
for (; start < arr.length; start++) { | |
if (arr[start] !== '') break; | |
} | |
var end = arr.length - 1; | |
for (; end >= 0; end--) { | |
if (arr[end] !== '') break; | |
} | |
if (start > end) return []; | |
return arr.slice(start, end - start + 1); | |
} | |
var fromParts = trim(from.split('/')); | |
var toParts = trim(to.split('/')); | |
var length = Math.min(fromParts.length, toParts.length); | |
var samePartsLength = length; | |
for (var i = 0; i < length; i++) { | |
if (fromParts[i] !== toParts[i]) { | |
samePartsLength = i; | |
break; | |
} | |
} | |
var outputParts = []; | |
for (var i = samePartsLength; i < fromParts.length; i++) { | |
outputParts.push('..'); | |
} | |
outputParts = outputParts.concat(toParts.slice(samePartsLength)); | |
return outputParts.join('/'); | |
}; | |
exports.sep = '/'; | |
exports.delimiter = ':'; | |
exports.dirname = function(path) { | |
var result = splitPath(path), | |
root = result[0], | |
dir = result[1]; | |
if (!root && !dir) { | |
// No dirname whatsoever | |
return '.'; | |
} | |
if (dir) { | |
// It has a dirname, strip trailing slash | |
dir = dir.substr(0, dir.length - 1); | |
} | |
return root + dir; | |
}; | |
exports.basename = function(path, ext) { | |
var f = splitPath(path)[2]; | |
// TODO: make this comparison case-insensitive on windows? | |
if (ext && f.substr(-1 * ext.length) === ext) { | |
f = f.substr(0, f.length - ext.length); | |
} | |
return f; | |
}; | |
exports.extname = function(path) { | |
return splitPath(path)[3]; | |
}; | |
function filter (xs, f) { | |
if (xs.filter) return xs.filter(f); | |
var res = []; | |
for (var i = 0; i < xs.length; i++) { | |
if (f(xs[i], i, xs)) res.push(xs[i]); | |
} | |
return res; | |
} | |
// String.prototype.substr - negative index don't work in IE8 | |
var substr = 'ab'.substr(-1) === 'b' | |
? function (str, start, len) { return str.substr(start, len) } | |
: function (str, start, len) { | |
if (start < 0) start = str.length + start; | |
return str.substr(start, len); | |
} | |
; | |
}).call(this,require('_process')) | |
},{"_process":36}],35:[function(require,module,exports){ | |
(function (process){ | |
'use strict'; | |
if (!process.version || | |
process.version.indexOf('v0.') === 0 || | |
process.version.indexOf('v1.') === 0 && process.version.indexOf('v1.8.') !== 0) { | |
module.exports = nextTick; | |
} else { | |
module.exports = process.nextTick; | |
} | |
function nextTick(fn, arg1, arg2, arg3) { | |
if (typeof fn !== 'function') { | |
throw new TypeError('"callback" argument must be a function'); | |
} | |
var len = arguments.length; | |
var args, i; | |
switch (len) { | |
case 0: | |
case 1: | |
return process.nextTick(fn); | |
case 2: | |
return process.nextTick(function afterTickOne() { | |
fn.call(null, arg1); | |
}); | |
case 3: | |
return process.nextTick(function afterTickTwo() { | |
fn.call(null, arg1, arg2); | |
}); | |
case 4: | |
return process.nextTick(function afterTickThree() { | |
fn.call(null, arg1, arg2, arg3); | |
}); | |
default: | |
args = new Array(len - 1); | |
i = 0; | |
while (i < args.length) { | |
args[i++] = arguments[i]; | |
} | |
return process.nextTick(function afterTick() { | |
fn.apply(null, args); | |
}); | |
} | |
} | |
}).call(this,require('_process')) | |
},{"_process":36}],36:[function(require,module,exports){ | |
// shim for using process in browser | |
var process = module.exports = {}; | |
// cached from whatever global is present so that test runners that stub it | |
// don't break things. But we need to wrap it in a try catch in case it is | |
// wrapped in strict mode code which doesn't define any globals. It's inside a | |
// function because try/catches deoptimize in certain engines. | |
var cachedSetTimeout; | |
var cachedClearTimeout; | |
function defaultSetTimout() { | |
throw new Error('setTimeout has not been defined'); | |
} | |
function defaultClearTimeout () { | |
throw new Error('clearTimeout has not been defined'); | |
} | |
(function () { | |
try { | |
if (typeof setTimeout === 'function') { | |
cachedSetTimeout = setTimeout; | |
} else { | |
cachedSetTimeout = defaultSetTimout; | |
} | |
} catch (e) { | |
cachedSetTimeout = defaultSetTimout; | |
} | |
try { | |
if (typeof clearTimeout === 'function') { | |
cachedClearTimeout = clearTimeout; | |
} else { | |
cachedClearTimeout = defaultClearTimeout; | |
} | |
} catch (e) { | |
cachedClearTimeout = defaultClearTimeout; | |
} | |
} ()) | |
function runTimeout(fun) { | |
if (cachedSetTimeout === setTimeout) { | |
//normal enviroments in sane situations | |
return setTimeout(fun, 0); | |
} | |
// if setTimeout wasn't available but was latter defined | |
if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) { | |
cachedSetTimeout = setTimeout; | |
return setTimeout(fun, 0); | |
} | |
try { | |
// when when somebody has screwed with setTimeout but no I.E. maddness | |
return cachedSetTimeout(fun, 0); | |
} catch(e){ | |
try { | |
// When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally | |
return cachedSetTimeout.call(null, fun, 0); | |
} catch(e){ | |
// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error | |
return cachedSetTimeout.call(this, fun, 0); | |
} | |
} | |
} | |
function runClearTimeout(marker) { | |
if (cachedClearTimeout === clearTimeout) { | |
//normal enviroments in sane situations | |
return clearTimeout(marker); | |
} | |
// if clearTimeout wasn't available but was latter defined | |
if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) { | |
cachedClearTimeout = clearTimeout; | |
return clearTimeout(marker); | |
} | |
try { | |
// when when somebody has screwed with setTimeout but no I.E. maddness | |
return cachedClearTimeout(marker); | |
} catch (e){ | |
try { | |
// When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally | |
return cachedClearTimeout.call(null, marker); | |
} catch (e){ | |
// same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error. | |
// Some versions of I.E. have different rules for clearTimeout vs setTimeout | |
return cachedClearTimeout.call(this, marker); | |
} | |
} | |
} | |
var queue = []; | |
var draining = false; | |
var currentQueue; | |
var queueIndex = -1; | |
function cleanUpNextTick() { | |
if (!draining || !currentQueue) { | |
return; | |
} | |
draining = false; | |
if (currentQueue.length) { | |
queue = currentQueue.concat(queue); | |
} else { | |
queueIndex = -1; | |
} | |
if (queue.length) { | |
drainQueue(); | |
} | |
} | |
function drainQueue() { | |
if (draining) { | |
return; | |
} | |
var timeout = runTimeout(cleanUpNextTick); | |
draining = true; | |
var len = queue.length; | |
while(len) { | |
currentQueue = queue; | |
queue = []; | |
while (++queueIndex < len) { | |
if (currentQueue) { | |
currentQueue[queueIndex].run(); | |
} | |
} | |
queueIndex = -1; | |
len = queue.length; | |
} | |
currentQueue = null; | |
draining = false; | |
runClearTimeout(timeout); | |
} | |
process.nextTick = function (fun) { | |
var args = new Array(arguments.length - 1); | |
if (arguments.length > 1) { | |
for (var i = 1; i < arguments.length; i++) { | |
args[i - 1] = arguments[i]; | |
} | |
} | |
queue.push(new Item(fun, args)); | |
if (queue.length === 1 && !draining) { | |
runTimeout(drainQueue); | |
} | |
}; | |
// v8 likes predictible objects | |
function Item(fun, array) { | |
this.fun = fun; | |
this.array = array; | |
} | |
Item.prototype.run = function () { | |
this.fun.apply(null, this.array); | |
}; | |
process.title = 'browser'; | |
process.browser = true; | |
process.env = {}; | |
process.argv = []; | |
process.version = ''; // empty string to avoid regexp issues | |
process.versions = {}; | |
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'); | |
}; | |
process.cwd = function () { return '/' }; | |
process.chdir = function (dir) { | |
throw new Error('process.chdir is not supported'); | |
}; | |
process.umask = function() { return 0; }; | |
},{}],37:[function(require,module,exports){ | |
module.exports = require("./lib/_stream_duplex.js") | |
},{"./lib/_stream_duplex.js":38}],38:[function(require,module,exports){ | |
// 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. | |
'use strict'; | |
/*<replacement>*/ | |
var objectKeys = Object.keys || function (obj) { | |
var keys = []; | |
for (var key in obj) { | |
keys.push(key); | |
}return keys; | |
}; | |
/*</replacement>*/ | |
module.exports = Duplex; | |
/*<replacement>*/ | |
var processNextTick = require('process-nextick-args'); | |
/*</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); | |
var keys = objectKeys(Writable.prototype); | |
for (var v = 0; v < keys.length; v++) { | |
var method = keys[v]; | |
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. | |
processNextTick(onEndNT, this); | |
} | |
function onEndNT(self) { | |
self.end(); | |
} | |
function forEach(xs, f) { | |
for (var i = 0, l = xs.length; i < l; i++) { | |
f(xs[i], i); | |
} | |
} | |
},{"./_stream_readable":40,"./_stream_writable":42,"core-util-is":6,"inherits":26,"process-nextick-args":35}],39:[function(require,module,exports){ | |
// a passthrough stream. | |
// basically just the most minimal sort of Transform stream. | |
// Every written chunk gets output as-is. | |
'use strict'; | |
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":41,"core-util-is":6,"inherits":26}],40:[function(require,module,exports){ | |
(function (process){ | |
'use strict'; | |
module.exports = Readable; | |
/*<replacement>*/ | |
var processNextTick = require('process-nextick-args'); | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var isArray = require('isarray'); | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var Duplex; | |
/*</replacement>*/ | |
Readable.ReadableState = ReadableState; | |
/*<replacement>*/ | |
var EE = require('events').EventEmitter; | |
var EElistenerCount = function (emitter, type) { | |
return emitter.listeners(type).length; | |
}; | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var Stream; | |
(function () { | |
try { | |
Stream = require('st' + 'ream'); | |
} catch (_) {} finally { | |
if (!Stream) Stream = require('events').EventEmitter; | |
} | |
})(); | |
/*</replacement>*/ | |
var Buffer = require('buffer').Buffer; | |
/*<replacement>*/ | |
var bufferShim = require('buffer-shims'); | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var util = require('core-util-is'); | |
util.inherits = require('inherits'); | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var debugUtil = require('util'); | |
var debug = void 0; | |
if (debugUtil && debugUtil.debuglog) { | |
debug = debugUtil.debuglog('stream'); | |
} else { | |
debug = function () {}; | |
} | |
/*</replacement>*/ | |
var BufferList = require('./internal/streams/BufferList'); | |
var StringDecoder; | |
util.inherits(Readable, Stream); | |
function prependListener(emitter, event, fn) { | |
// Sadly this is not cacheable as some libraries bundle their own | |
// event emitter implementation with them. | |
if (typeof emitter.prependListener === 'function') { | |
return emitter.prependListener(event, fn); | |
} else { | |
// This is a hack to make sure that our error handler is attached before any | |
// userland ones. NEVER DO THIS. This is here only because this code needs | |
// to continue to work with older versions of Node.js that do not include | |
// the prependListener() method. The goal is to eventually remove this hack. | |
if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]]; | |
} | |
} | |
function ReadableState(options, stream) { | |
Duplex = Duplex || require('./_stream_duplex'); | |
options = options || {}; | |
// 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; | |
if (stream instanceof Duplex) this.objectMode = this.objectMode || !!options.readableObjectMode; | |
// 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; | |
var defaultHwm = this.objectMode ? 16 : 16 * 1024; | |
this.highWaterMark = hwm || hwm === 0 ? hwm : defaultHwm; | |
// cast to ints. | |
this.highWaterMark = ~ ~this.highWaterMark; | |
// A linked list is used to store data chunks instead of an array because the | |
// linked list can remove elements from the beginning faster than | |
// array.shift() | |
this.buffer = new BufferList(); | |
this.length = 0; | |
this.pipes = null; | |
this.pipesCount = 0; | |
this.flowing = null; | |
this.ended = false; | |
this.endEmitted = false; | |
this.reading = 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, because 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; | |
this.resumeScheduled = false; | |
// 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) { | |
Duplex = Duplex || require('./_stream_duplex'); | |
if (!(this instanceof Readable)) return new Readable(options); | |
this._readableState = new ReadableState(options, this); | |
// legacy | |
this.readable = true; | |
if (options && typeof options.read === 'function') this._read = options.read; | |
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 (!state.objectMode && typeof chunk === 'string') { | |
encoding = encoding || state.defaultEncoding; | |
if (encoding !== state.encoding) { | |
chunk = bufferShim.from(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); | |
}; | |
Readable.prototype.isPaused = function () { | |
return this._readableState.flowing === false; | |
}; | |
function readableAddChunk(stream, state, chunk, encoding, addToFront) { | |
var er = chunkInvalid(state, chunk); | |
if (er) { | |
stream.emit('error', er); | |
} else if (chunk === null) { | |
state.reading = false; | |
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 { | |
var skipAdd; | |
if (state.decoder && !addToFront && !encoding) { | |
chunk = state.decoder.write(chunk); | |
skipAdd = !state.objectMode && chunk.length === 0; | |
} | |
if (!addToFront) state.reading = false; | |
// Don't add to the buffer if we've decoded to an empty string chunk and | |
// we're not in object mode | |
if (!skipAdd) { | |
// if we want the data now, just emit it. | |
if (state.flowing && state.length === 0 && !state.sync) { | |
stream.emit('data', chunk); | |
stream.read(0); | |
} else { | |
// update the buffer info. | |
state.length += state.objectMode ? 1 : chunk.length; | |
if (addToFront) state.buffer.unshift(chunk);else 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; | |
return this; | |
}; | |
// Don't raise the hwm > 8MB | |
var MAX_HWM = 0x800000; | |
function computeNewHighWaterMark(n) { | |
if (n >= MAX_HWM) { | |
n = MAX_HWM; | |
} else { | |
// Get the next highest power of 2 to prevent increasing hwm excessively in | |
// tiny amounts | |
n--; | |
n |= n >>> 1; | |
n |= n >>> 2; | |
n |= n >>> 4; | |
n |= n >>> 8; | |
n |= n >>> 16; | |
n++; | |
} | |
return n; | |
} | |
// This function is designed to be inlinable, so please take care when making | |
// changes to the function body. | |
function howMuchToRead(n, state) { | |
if (n <= 0 || state.length === 0 && state.ended) return 0; | |
if (state.objectMode) return 1; | |
if (n !== n) { | |
// Only flow one buffer at a time | |
if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length; | |
} | |
// If we're asking for more than the current hwm, then raise the hwm. | |
if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n); | |
if (n <= state.length) return n; | |
// Don't have enough | |
if (!state.ended) { | |
state.needReadable = true; | |
return 0; | |
} | |
return state.length; | |
} | |
// you can override either this method, or the async _read(n) below. | |
Readable.prototype.read = function (n) { | |
debug('read', n); | |
n = parseInt(n, 10); | |
var state = this._readableState; | |
var nOrig = n; | |
if (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)) { | |
debug('read: emitReadable', state.length, state.ended); | |
if (state.length === 0 && state.ended) endReadable(this);else 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) { | |
if (state.length === 0) endReadable(this); | |
return null; | |
} | |
// 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; | |
debug('need readable', doRead); | |
// if we currently have less than the highWaterMark, then also read some | |
if (state.length === 0 || state.length - n < state.highWaterMark) { | |
doRead = true; | |
debug('length less than watermark', doRead); | |
} | |
// 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; | |
debug('reading or ended', doRead); | |
} else if (doRead) { | |
debug('do read'); | |
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 pushed data synchronously, then `reading` will be false, | |
// and we need to re-evaluate how much data we can return to the user. | |
if (!state.reading) n = howMuchToRead(nOrig, state); | |
} | |
var ret; | |
if (n > 0) ret = fromList(n, state);else ret = null; | |
if (ret === null) { | |
state.needReadable = true; | |
n = 0; | |
} else { | |
state.length -= n; | |
} | |
if (state.length === 0) { | |
// If we have nothing in the buffer, then we want to know | |
// as soon as we *do* get something into the buffer. | |
if (!state.ended) state.needReadable = true; | |
// If we tried to read() past the EOF, then emit end on the next tick. | |
if (nOrig !== n && state.ended) endReadable(this); | |
} | |
if (ret !== null) this.emit('data', ret); | |
return ret; | |
}; | |
function chunkInvalid(state, chunk) { | |
var er = null; | |
if (!Buffer.isBuffer(chunk) && typeof chunk !== 'string' && chunk !== null && chunk !== undefined && !state.objectMode) { | |
er = new TypeError('Invalid non-string/buffer chunk'); | |
} | |
return er; | |
} | |
function onEofChunk(stream, state) { | |
if (state.ended) return; | |
if (state.decoder) { | |
var chunk = state.decoder.end(); | |
if (chunk && chunk.length) { | |
state.buffer.push(chunk); | |
state.length += state.objectMode ? 1 : chunk.length; | |
} | |
} | |
state.ended = true; | |
// emit 'readable' now to make sure it gets picked up. | |
emitReadable(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) { | |
debug('emitReadable', state.flowing); | |
state.emittedReadable = true; | |
if (state.sync) processNextTick(emitReadable_, stream);else emitReadable_(stream); | |
} | |
} | |
function emitReadable_(stream) { | |
debug('emit readable'); | |
stream.emit('readable'); | |
flow(stream); | |
} | |
// 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; | |
processNextTick(maybeReadMore_, stream, state); | |
} | |
} | |
function maybeReadMore_(stream, state) { | |
var len = state.length; | |
while (!state.reading && !state.flowing && !state.ended && state.length < state.highWaterMark) { | |
debug('maybeReadMore read 0'); | |
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('_read() is 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; | |
debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts); | |
var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr; | |
var endFn = doEnd ? onend : cleanup; | |
if (state.endEmitted) processNextTick(endFn);else src.once('end', endFn); | |
dest.on('unpipe', onunpipe); | |
function onunpipe(readable) { | |
debug('onunpipe'); | |
if (readable === src) { | |
cleanup(); | |
} | |
} | |
function onend() { | |
debug('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); | |
var cleanedUp = false; | |
function cleanup() { | |
debug('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); | |
src.removeListener('data', ondata); | |
cleanedUp = true; | |
// 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 (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain(); | |
} | |
// If the user pushes more data while we're writing to dest then we'll end up | |
// in ondata again. However, we only want to increase awaitDrain once because | |
// dest will only emit one 'drain' event for the multiple writes. | |
// => Introduce a guard on increasing awaitDrain. | |
var increasedAwaitDrain = false; | |
src.on('data', ondata); | |
function ondata(chunk) { | |
debug('ondata'); | |
increasedAwaitDrain = false; | |
var ret = dest.write(chunk); | |
if (false === ret && !increasedAwaitDrain) { | |
// If the user unpiped during `dest.write()`, it is possible | |
// to get stuck in a permanently paused state if that write | |
// also returned false. | |
// => Check whether `dest` is still a piping destination. | |
if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) { | |
debug('false write response, pause', src._readableState.awaitDrain); | |
src._readableState.awaitDrain++; | |
increasedAwaitDrain = true; | |
} | |
src.pause(); | |
} | |
} | |
// if the dest has an error, then stop piping into it. | |
// however, don't suppress the throwing behavior for this. | |
function onerror(er) { | |
debug('onerror', er); | |
unpipe(); | |
dest.removeListener('error', onerror); | |
if (EElistenerCount(dest, 'error') === 0) dest.emit('error', er); | |
} | |
// Make sure our error handler is attached before userland ones. | |
prependListener(dest, 'error', onerror); | |
// Both close and finish should trigger unpipe, but only once. | |
function onclose() { | |
dest.removeListener('finish', onfinish); | |
unpipe(); | |
} | |
dest.once('close', onclose); | |
function onfinish() { | |
debug('onfinish'); | |
dest.removeListener('close', onclose); | |
unpipe(); | |
} | |
dest.once('finish', onfinish); | |
function unpipe() { | |
debug('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) { | |
debug('pipe resume'); | |
src.resume(); | |
} | |
return dest; | |
}; | |
function pipeOnDrain(src) { | |
return function () { | |
var state = src._readableState; | |
debug('pipeOnDrain', state.awaitDrain); | |
if (state.awaitDrain) state.awaitDrain--; | |
if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) { | |
state.flowing = true; | |
flow(src); | |
} | |
}; | |
} | |
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; | |
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; | |
state.flowing = false; | |
for (var i = 0; i < len; i++) { | |
dests[i].emit('unpipe', this); | |
}return this; | |
} | |
// try to find the right one. | |
var index = indexOf(state.pipes, dest); | |
if (index === -1) return this; | |
state.pipes.splice(index, 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') { | |
// Start flowing on next tick if stream isn't explicitly paused | |
if (this._readableState.flowing !== false) this.resume(); | |
} else if (ev === 'readable') { | |
var state = this._readableState; | |
if (!state.endEmitted && !state.readableListening) { | |
state.readableListening = state.needReadable = true; | |
state.emittedReadable = false; | |
if (!state.reading) { | |
processNextTick(nReadingNextTick, this); | |
} else if (state.length) { | |
emitReadable(this, state); | |
} | |
} | |
} | |
return res; | |
}; | |
Readable.prototype.addListener = Readable.prototype.on; | |
function nReadingNextTick(self) { | |
debug('readable nexttick read 0'); | |
self.read(0); | |
} | |
// 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 () { | |
var state = this._readableState; | |
if (!state.flowing) { | |
debug('resume'); | |
state.flowing = true; | |
resume(this, state); | |
} | |
return this; | |
}; | |
function resume(stream, state) { | |
if (!state.resumeScheduled) { | |
state.resumeScheduled = true; | |
processNextTick(resume_, stream, state); | |
} | |
} | |
function resume_(stream, state) { | |
if (!state.reading) { | |
debug('resume read 0'); | |
stream.read(0); | |
} | |
state.resumeScheduled = false; | |
state.awaitDrain = 0; | |
stream.emit('resume'); | |
flow(stream); | |
if (state.flowing && !state.reading) stream.read(0); | |
} | |
Readable.prototype.pause = function () { | |
debug('call pause flowing=%j', this._readableState.flowing); | |
if (false !== this._readableState.flowing) { | |
debug('pause'); | |
this._readableState.flowing = false; | |
this.emit('pause'); | |
} | |
return this; | |
}; | |
function flow(stream) { | |
var state = stream._readableState; | |
debug('flow', state.flowing); | |
while (state.flowing && stream.read() !== null) {} | |
} | |
// 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 () { | |
debug('wrapped end'); | |
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) { | |
debug('wrapped data'); | |
if (state.decoder) chunk = state.decoder.write(chunk); | |
// don't skip over falsy values in objectMode | |
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 (this[i] === undefined && typeof stream[i] === 'function') { | |
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) { | |
debug('wrapped _read', 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. | |
// This function is designed to be inlinable, so please take care when making | |
// changes to the function body. | |
function fromList(n, state) { | |
// nothing buffered | |
if (state.length === 0) return null; | |
var ret; | |
if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) { | |
// read it all, truncate the list | |
if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.head.data;else ret = state.buffer.concat(state.length); | |
state.buffer.clear(); | |
} else { | |
// read part of list | |
ret = fromListPartial(n, state.buffer, state.decoder); | |
} | |
return ret; | |
} | |
// Extracts only enough buffered data to satisfy the amount requested. | |
// This function is designed to be inlinable, so please take care when making | |
// changes to the function body. | |
function fromListPartial(n, list, hasStrings) { | |
var ret; | |
if (n < list.head.data.length) { | |
// slice is the same for buffers and strings | |
ret = list.head.data.slice(0, n); | |
list.head.data = list.head.data.slice(n); | |
} else if (n === list.head.data.length) { | |
// first chunk is a perfect match | |
ret = list.shift(); | |
} else { | |
// result spans more than one buffer | |
ret = hasStrings ? copyFromBufferString(n, list) : copyFromBuffer(n, list); | |
} | |
return ret; | |
} | |
// Copies a specified amount of characters from the list of buffered data | |
// chunks. | |
// This function is designed to be inlinable, so please take care when making | |
// changes to the function body. | |
function copyFromBufferString(n, list) { | |
var p = list.head; | |
var c = 1; | |
var ret = p.data; | |
n -= ret.length; | |
while (p = p.next) { | |
var str = p.data; | |
var nb = n > str.length ? str.length : n; | |
if (nb === str.length) ret += str;else ret += str.slice(0, n); | |
n -= nb; | |
if (n === 0) { | |
if (nb === str.length) { | |
++c; | |
if (p.next) list.head = p.next;else list.head = list.tail = null; | |
} else { | |
list.head = p; | |
p.data = str.slice(nb); | |
} | |
break; | |
} | |
++c; | |
} | |
list.length -= c; | |
return ret; | |
} | |
// Copies a specified amount of bytes from the list of buffered data chunks. | |
// This function is designed to be inlinable, so please take care when making | |
// changes to the function body. | |
function copyFromBuffer(n, list) { | |
var ret = bufferShim.allocUnsafe(n); | |
var p = list.head; | |
var c = 1; | |
p.data.copy(ret); | |
n -= p.data.length; | |
while (p = p.next) { | |
var buf = p.data; | |
var nb = n > buf.length ? buf.length : n; | |
buf.copy(ret, ret.length - n, 0, nb); | |
n -= nb; | |
if (n === 0) { | |
if (nb === buf.length) { | |
++c; | |
if (p.next) list.head = p.next;else list.head = list.tail = null; | |
} else { | |
list.head = p; | |
p.data = buf.slice(nb); | |
} | |
break; | |
} | |
++c; | |
} | |
list.length -= c; | |
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.ended = true; | |
processNextTick(endReadableNT, state, stream); | |
} | |
} | |
function endReadableNT(state, stream) { | |
// 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')) | |
},{"./_stream_duplex":38,"./internal/streams/BufferList":43,"_process":36,"buffer":5,"buffer-shims":4,"core-util-is":6,"events":19,"inherits":26,"isarray":30,"process-nextick-args":35,"string_decoder/":54,"util":2}],41:[function(require,module,exports){ | |
// 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. | |
'use strict'; | |
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(stream) { | |
this.afterTransform = function (er, data) { | |
return afterTransform(stream, er, data); | |
}; | |
this.needTransform = false; | |
this.transforming = false; | |
this.writecb = null; | |
this.writechunk = null; | |
this.writeencoding = 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); | |
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); | |
this._transformState = new TransformState(this); | |
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; | |
if (options) { | |
if (typeof options.transform === 'function') this._transform = options.transform; | |
if (typeof options.flush === 'function') this._flush = options.flush; | |
} | |
// When the writable side finishes, then flush out anything remaining. | |
this.once('prefinish', function () { | |
if (typeof this._flush === 'function') this._flush(function (er, data) { | |
done(stream, er, data); | |
});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('_transform() is 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, data) { | |
if (er) return stream.emit('error', er); | |
if (data !== null && data !== undefined) stream.push(data); | |
// if there's nothing in the write buffer, then that means | |
// that nothing more will ever be provided | |
var ws = stream._writableState; | |
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":38,"core-util-is":6,"inherits":26}],42:[function(require,module,exports){ | |
(function (process){ | |
// A bit simpler than readable streams. | |
// Implement an async ._write(chunk, encoding, cb), and it'll handle all | |
// the drain event emission and buffering. | |
'use strict'; | |
module.exports = Writable; | |
/*<replacement>*/ | |
var processNextTick = require('process-nextick-args'); | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var asyncWrite = !process.browser && ['v0.10', 'v0.9.'].indexOf(process.version.slice(0, 5)) > -1 ? setImmediate : processNextTick; | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var Duplex; | |
/*</replacement>*/ | |
Writable.WritableState = WritableState; | |
/*<replacement>*/ | |
var util = require('core-util-is'); | |
util.inherits = require('inherits'); | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var internalUtil = { | |
deprecate: require('util-deprecate') | |
}; | |
/*</replacement>*/ | |
/*<replacement>*/ | |
var Stream; | |
(function () { | |
try { | |
Stream = require('st' + 'ream'); | |
} catch (_) {} finally { | |
if (!Stream) Stream = require('events').EventEmitter; | |
} | |
})(); | |
/*</replacement>*/ | |
var Buffer = require('buffer').Buffer; | |
/*<replacement>*/ | |
var bufferShim = require('buffer-shims'); | |
/*</replacement>*/ | |
util.inherits(Writable, Stream); | |
function nop() {} | |
function WriteReq(chunk, encoding, cb) { | |
this.chunk = chunk; | |
this.encoding = encoding; | |
this.callback = cb; | |
this.next = null; | |
} | |
function WritableState(options, stream) { | |
Duplex = Duplex || require('./_stream_duplex'); | |
options = options || {}; | |
// object stream flag to indicate whether or not this stream | |
// contains buffers or objects. | |
this.objectMode = !!options.objectMode; | |
if (stream instanceof Duplex) this.objectMode = this.objectMode || !!options.writableObjectMode; | |
// 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; | |
var defaultHwm = this.objectMode ? 16 : 16 * 1024; | |
this.highWaterMark = hwm || hwm === 0 ? hwm : defaultHwm; | |
// cast to ints. | |
this.highWaterMark = ~ ~this.highWaterMark; | |
// drain event flag. | |
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; | |
// when true all writes will be buffered until .uncork() call | |
this.corked = 0; | |
// 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, because 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.bufferedRequest = null; | |
this.lastBufferedRequest = null; | |
// number of pending user-supplied write callbacks | |
// this must be 0 before 'finish' can be emitted | |
this.pendingcb = 0; | |
// emit prefinish if the only thing we're waiting for is _write cbs | |
// This is relevant for synchronous Transform streams | |
this.prefinished = false; | |
// True if the error was already emitted and should not be thrown again | |
this.errorEmitted = false; | |
// count buffered requests | |
this.bufferedRequestCount = 0; | |
// allocate the first CorkedRequest, there is always | |
// one allocated and free to use, and we maintain at most two | |
this.corkedRequestsFree = new CorkedRequest(this); | |
} | |
WritableState.prototype.getBuffer = function getBuffer() { | |
var current = this.bufferedRequest; | |
var out = []; | |
while (current) { | |
out.push(current); | |
current = current.next; | |
} | |
return out; | |
}; | |
(function () { | |
try { | |
Object.defineProperty(WritableState.prototype, 'buffer', { | |
get: internalUtil.deprecate(function () { | |
return this.getBuffer(); | |
}, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.') | |
}); | |
} catch (_) {} | |
})(); | |
// Test _writableState for inheritance to account for Duplex streams, | |
// whose prototype chain only points to Readable. | |
var realHasInstance; | |
if (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') { | |
realHasInstance = Function.prototype[Symbol.hasInstance]; | |
Object.defineProperty(Writable, Symbol.hasInstance, { | |
value: function (object) { | |
if (realHasInstance.call(this, object)) return true; | |
return object && object._writableState instanceof WritableState; | |
} | |
}); | |
} else { | |
realHasInstance = function (object) { | |
return object instanceof this; | |
}; | |
} | |
function Writable(options) { | |
Duplex = Duplex || require('./_stream_duplex'); | |
// Writable ctor is applied to Duplexes, too. | |
// `realHasInstance` is necessary because using plain `instanceof` | |
// would return false, as no `_writableState` property is attached. | |
// Trying to use the custom `instanceof` for Writable here will also break the | |
// Node.js LazyTransform implementation, which has a non-trivial getter for | |
// `_writableState` that would lead to infinite recursion. | |
if (!realHasInstance.call(Writable, this) && !(this instanceof Duplex)) { | |
return new Writable(options); | |
} | |
this._writableState = new WritableState(options, this); | |
// legacy. | |
this.writable = true; | |
if (options) { | |
if (typeof options.write === 'function') this._write = options.write; | |
if (typeof options.writev === 'function') this._writev = options.writev; | |
} | |
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, cb) { | |
var er = new Error('write after end'); | |
// TODO: defer error events consistently everywhere, not just the cb | |
stream.emit('error', er); | |
processNextTick(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; | |
var er = false; | |
// Always throw error if a null is written | |
// if we are not in object mode then throw | |
// if it is not a buffer, string, or undefined. | |
if (chunk === null) { | |
er = new TypeError('May not write null values to stream'); | |
} else if (!Buffer.isBuffer(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) { | |
er = new TypeError('Invalid non-string/buffer chunk'); | |
} | |
if (er) { | |
stream.emit('error', er); | |
processNextTick(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 = nop; | |
if (state.ended) writeAfterEnd(this, cb);else if (validChunk(this, state, chunk, cb)) { | |
state.pendingcb++; | |
ret = writeOrBuffer(this, state, chunk, encoding, cb); | |
} | |
return ret; | |
}; | |
Writable.prototype.cork = function () { | |
var state = this._writableState; | |
state.corked++; | |
}; | |
Writable.prototype.uncork = function () { | |
var state = this._writableState; | |
if (state.corked) { | |
state.corked--; | |
if (!state.writing && !state.corked && !state.finished && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state); | |
} | |
}; | |
Writable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) { | |
// node::ParseEncoding() requires lower case. | |
if (typeof encoding === 'string') encoding = encoding.toLowerCase(); | |
if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new TypeError('Unknown encoding: ' + encoding); | |
this._writableState.defaultEncoding = encoding; | |
return this; | |
}; | |
function decodeChunk(state, chunk, encoding) { | |
if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') { | |
chunk = bufferShim.from(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.corked) { | |
var last = state.lastBufferedRequest; | |
state.lastBufferedRequest = new WriteReq(chunk, encoding, cb); | |
if (last) { | |
last.next = state.lastBufferedRequest; | |
} else { | |
state.bufferedRequest = state.lastBufferedRequest; | |
} | |
state.bufferedRequestCount += 1; | |
} else { | |
doWrite(stream, state, false, len, chunk, encoding, cb); | |
} | |
return ret; | |
} | |
function doWrite(stream, state, writev, len, chunk, encoding, cb) { | |
state.writelen = len; | |
state.writecb = cb; | |
state.writing = true; | |
state.sync = true; | |
if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite); | |
state.sync = false; | |
} | |
function onwriteError(stream, state, sync, er, cb) { | |
--state.pendingcb; | |
if (sync) processNextTick(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(state); | |
if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) { | |
clearBuffer(stream, state); | |
} | |
if (sync) { | |
/*<replacement>*/ | |
asyncWrite(afterWrite, stream, state, finished, cb); | |
/*</replacement>*/ | |
} else { | |
afterWrite(stream, state, finished, cb); | |
} | |
} | |
} | |
function afterWrite(stream, state, finished, cb) { | |
if (!finished) onwriteDrain(stream, state); | |
state.pendingcb--; | |
cb(); | |
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; | |
var entry = state.bufferedRequest; | |
if (stream._writev && entry && entry.next) { | |
// Fast case, write everything using _writev() | |
var l = state.bufferedRequestCount; | |
var buffer = new Array(l); | |
var holder = state.corkedRequestsFree; | |
holder.entry = entry; | |
var count = 0; | |
while (entry) { | |
buffer[count] = entry; | |
entry = entry.next; | |
count += 1; | |
} | |
doWrite(stream, state, true, state.length, buffer, '', holder.finish); | |
// doWrite is almost always async, defer these to save a bit of time | |
// as the hot path ends with doWrite | |
state.pendingcb++; | |
state.lastBufferedRequest = null; | |
if (holder.next) { | |
state.corkedRequestsFree = holder.next; | |
holder.next = null; | |
} else { | |
state.corkedRequestsFree = new CorkedRequest(state); | |
} | |
} else { | |
// Slow case, write chunks one-by-one | |
while (entry) { | |
var chunk = entry.chunk; | |
var encoding = entry.encoding; | |
var cb = entry.callback; | |
var len = state.objectMode ? 1 : chunk.length; | |
doWrite(stream, state, false, len, chunk, encoding, cb); | |
entry = entry.next; | |
// 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) { | |
break; | |
} | |
} | |
if (entry === null) state.lastBufferedRequest = null; | |
} | |
state.bufferedRequestCount = 0; | |
state.bufferedRequest = entry; | |
state.bufferProcessing = false; | |
} | |
Writable.prototype._write = function (chunk, encoding, cb) { | |
cb(new Error('_write() is not implemented')); | |
}; | |
Writable.prototype._writev = null; | |
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 (chunk !== null && chunk !== undefined) this.write(chunk, encoding); | |
// .end() fully uncorks | |
if (state.corked) { | |
state.corked = 1; | |
this.uncork(); | |
} | |
// ignore unnecessary end() calls. | |
if (!state.ending && !state.finished) endWritable(this, state, cb); | |
}; | |
function needFinish(state) { | |
return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing; | |
} | |
function prefinish(stream, state) { | |
if (!state.prefinished) { | |
state.prefinished = true; | |
stream.emit('prefinish'); | |
} | |
} | |
function finishMaybe(stream, state) { | |
var need = needFinish(state); | |
if (need) { | |
if (state.pendingcb === 0) { | |
prefinish(stream, state); | |
state.finished = true; | |
stream.emit('finish'); | |
} else { | |
prefinish(stream, state); | |
} | |
} | |
return need; | |
} | |
function endWritable(stream, state, cb) { | |
state.ending = true; | |
finishMaybe(stream, state); | |
if (cb) { | |
if (state.finished) processNextTick(cb);else stream.once('finish', cb); | |
} | |
state.ended = true; | |
stream.writable = false; | |
} | |
// It seems a linked list but it is not | |
// there will be only 2 of these for each stream | |
function CorkedRequest(state) { | |
var _this = this; | |
this.next = null; | |
this.entry = null; | |
this.finish = function (err) { | |
var entry = _this.entry; | |
_this.entry = null; | |
while (entry) { | |
var cb = entry.callback; | |
state.pendingcb--; | |
cb(err); | |
entry = entry.next; | |
} | |
if (state.corkedRequestsFree) { | |
state.corkedRequestsFree.next = _this; | |
} else { | |
state.corkedRequestsFree = _this; | |
} | |
}; | |
} | |
}).call(this,require('_process')) | |
},{"./_stream_duplex":38,"_process":36,"buffer":5,"buffer-shims":4,"core-util-is":6,"events":19,"inherits":26,"process-nextick-args":35,"util-deprecate":59}],43:[function(require,module,exports){ | |
'use strict'; | |
var Buffer = require('buffer').Buffer; | |
/*<replacement>*/ | |
var bufferShim = require('buffer-shims'); | |
/*</replacement>*/ | |
module.exports = BufferList; | |
function BufferList() { | |
this.head = null; | |
this.tail = null; | |
this.length = 0; | |
} | |
BufferList.prototype.push = function (v) { | |
var entry = { data: v, next: null }; | |
if (this.length > 0) this.tail.next = entry;else this.head = entry; | |
this.tail = entry; | |
++this.length; | |
}; | |
BufferList.prototype.unshift = function (v) { | |
var entry = { data: v, next: this.head }; | |
if (this.length === 0) this.tail = entry; | |
this.head = entry; | |
++this.length; | |
}; | |
BufferList.prototype.shift = function () { | |
if (this.length === 0) return; | |
var ret = this.head.data; | |
if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next; | |
--this.length; | |
return ret; | |
}; | |
BufferList.prototype.clear = function () { | |
this.head = this.tail = null; | |
this.length = 0; | |
}; | |
BufferList.prototype.join = function (s) { | |
if (this.length === 0) return ''; | |
var p = this.head; | |
var ret = '' + p.data; | |
while (p = p.next) { | |
ret += s + p.data; | |
}return ret; | |
}; | |
BufferList.prototype.concat = function (n) { | |
if (this.length === 0) return bufferShim.alloc(0); | |
if (this.length === 1) return this.head.data; | |
var ret = bufferShim.allocUnsafe(n >>> 0); | |
var p = this.head; | |
var i = 0; | |
while (p) { | |
p.data.copy(ret, i); | |
i += p.data.length; | |
p = p.next; | |
} | |
return ret; | |
}; | |
},{"buffer":5,"buffer-shims":4}],44:[function(require,module,exports){ | |
module.exports = require("./lib/_stream_passthrough.js") | |
},{"./lib/_stream_passthrough.js":39}],45:[function(require,module,exports){ | |
(function (process){ | |
var Stream = (function (){ | |
try { | |
return require('st' + 'ream'); // hack to fix a circular dependency issue when used with browserify | |
} catch(_){} | |
}()); | |
exports = module.exports = require('./lib/_stream_readable.js'); | |
exports.Stream = Stream || exports; | |
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'); | |
if (!process.browser && process.env.READABLE_STREAM === 'disable' && Stream) { | |
module.exports = Stream; | |
} | |
}).call(this,require('_process')) | |
},{"./lib/_stream_duplex.js":38,"./lib/_stream_passthrough.js":39,"./lib/_stream_readable.js":40,"./lib/_stream_transform.js":41,"./lib/_stream_writable.js":42,"_process":36}],46:[function(require,module,exports){ | |
module.exports = require("./lib/_stream_transform.js") | |
},{"./lib/_stream_transform.js":41}],47:[function(require,module,exports){ | |
module.exports = require("./lib/_stream_writable.js") | |
},{"./lib/_stream_writable.js":42}],48:[function(require,module,exports){ | |
(function (process){ | |
var through = require('through'); | |
var nextTick = typeof setImmediate !== 'undefined' | |
? setImmediate | |
: process.nextTick | |
; | |
module.exports = function (write, end) { | |
var tr = through(write, end); | |
tr.pause(); | |
var resume = tr.resume; | |
var pause = tr.pause; | |
var paused = false; | |
tr.pause = function () { | |
paused = true; | |
return pause.apply(this, arguments); | |
}; | |
tr.resume = function () { | |
paused = false; | |
return resume.apply(this, arguments); | |
}; | |
nextTick(function () { | |
if (!paused) tr.resume(); | |
}); | |
return tr; | |
}; | |
}).call(this,require('_process')) | |
},{"_process":36,"through":58}],49:[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":19,"inherits":26,"readable-stream/duplex.js":37,"readable-stream/passthrough.js":44,"readable-stream/readable.js":45,"readable-stream/transform.js":46,"readable-stream/writable.js":47}],50:[function(require,module,exports){ | |
'use strict'; | |
var bind = require('function-bind'); | |
var ES = require('es-abstract/es5'); | |
var replace = bind.call(Function.call, String.prototype.replace); | |
var leftWhitespace = /^[\x09\x0A\x0B\x0C\x0D\x20\xA0\u1680\u180E\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200A\u202F\u205F\u3000\u2028\u2029\uFEFF]+/; | |
var rightWhitespace = /[\x09\x0A\x0B\x0C\x0D\x20\xA0\u1680\u180E\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200A\u202F\u205F\u3000\u2028\u2029\uFEFF]+$/; | |
module.exports = function trim() { | |
var S = ES.ToString(ES.CheckObjectCoercible(this)); | |
return replace(replace(S, leftWhitespace, ''), rightWhitespace, ''); | |
}; | |
},{"es-abstract/es5":12,"function-bind":23}],51:[function(require,module,exports){ | |
'use strict'; | |
var bind = require('function-bind'); | |
var define = require('define-properties'); | |
var implementation = require('./implementation'); | |
var getPolyfill = require('./polyfill'); | |
var shim = require('./shim'); | |
var boundTrim = bind.call(Function.call, getPolyfill()); | |
define(boundTrim, { | |
getPolyfill: getPolyfill, | |
implementation: implementation, | |
shim: shim | |
}); | |
module.exports = boundTrim; | |
},{"./implementation":50,"./polyfill":52,"./shim":53,"define-properties":10,"function-bind":23}],52:[function(require,module,exports){ | |
'use strict'; | |
var implementation = require('./implementation'); | |
var zeroWidthSpace = '\u200b'; | |
module.exports = function getPolyfill() { | |
if (String.prototype.trim && zeroWidthSpace.trim() === zeroWidthSpace) { | |
return String.prototype.trim; | |
} | |
return implementation; | |
}; | |
},{"./implementation":50}],53:[function(require,module,exports){ | |
'use strict'; | |
var define = require('define-properties'); | |
var getPolyfill = require('./polyfill'); | |
module.exports = function shimStringTrim() { | |
var polyfill = getPolyfill(); | |
define(String.prototype, { trim: polyfill }, { trim: function () { return String.prototype.trim !== polyfill; } }); | |
return polyfill; | |
}; | |
},{"./polyfill":52,"define-properties":10}],54:[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":5}],55:[function(require,module,exports){ | |
(function (process){ | |
var through = require('through'); | |
var fs = require('fs'); | |
module.exports = function () { | |
var line = ''; | |
var stream = through(write, flush); | |
return stream; | |
function write (buf) { | |
for (var i = 0; i < buf.length; i++) { | |
var c = typeof buf === 'string' | |
? buf.charAt(i) | |
: String.fromCharCode(buf[i]) | |
; | |
if (c === '\n') flush(); | |
else line += c; | |
} | |
} | |
function flush () { | |
if (fs.writeSync && /^win/.test(process.platform)) { | |
try { fs.writeSync(1, line + '\n'); } | |
catch (e) { stream.emit('error', e) } | |
} | |
else { | |
try { console.log(line) } | |
catch (e) { stream.emit('error', e) } | |
} | |
line = ''; | |
} | |
}; | |
}).call(this,require('_process')) | |
},{"_process":36,"fs":3,"through":58}],56:[function(require,module,exports){ | |
(function (process){ | |
var EventEmitter = require('events').EventEmitter; | |
var inherits = require('inherits'); | |
var through = require('through'); | |
var resumer = require('resumer'); | |
var inspect = require('object-inspect'); | |
var bind = require('function-bind'); | |
var has = require('has'); | |
var regexpTest = bind.call(Function.call, RegExp.prototype.test); | |
var yamlIndicators = /\:|\-|\?/; | |
var nextTick = typeof setImmediate !== 'undefined' | |
? setImmediate | |
: process.nextTick | |
; | |
module.exports = Results; | |
inherits(Results, EventEmitter); | |
function Results () { | |
if (!(this instanceof Results)) return new Results; | |
this.count = 0; | |
this.fail = 0; | |
this.pass = 0; | |
this._stream = through(); | |
this.tests = []; | |
this._only = null; | |
} | |
Results.prototype.createStream = function (opts) { | |
if (!opts) opts = {}; | |
var self = this; | |
var output, testId = 0; | |
if (opts.objectMode) { | |
output = through(); | |
self.on('_push', function ontest (t, extra) { | |
if (!extra) extra = {}; | |
var id = testId++; | |
t.once('prerun', function () { | |
var row = { | |
type: 'test', | |
name: t.name, | |
id: id | |
}; | |
if (has(extra, 'parent')) { | |
row.parent = extra.parent; | |
} | |
output.queue(row); | |
}); | |
t.on('test', function (st) { | |
ontest(st, { parent: id }); | |
}); | |
t.on('result', function (res) { | |
res.test = id; | |
res.type = 'assert'; | |
output.queue(res); | |
}); | |
t.on('end', function () { | |
output.queue({ type: 'end', test: id }); | |
}); | |
}); | |
self.on('done', function () { output.queue(null) }); | |
} | |
else { | |
output = resumer(); | |
output.queue('TAP version 13\n'); | |
self._stream.pipe(output); | |
} | |
nextTick(function next() { | |
var t; | |
while (t = getNextTest(self)) { | |
t.run(); | |
if (!t.ended) return t.once('end', function(){ nextTick(next); }); | |
} | |
self.emit('done'); | |
}); | |
return output; | |
}; | |
Results.prototype.push = function (t) { | |
var self = this; | |
self.tests.push(t); | |
self._watch(t); | |
self.emit('_push', t); | |
}; | |
Results.prototype.only = function (t) { | |
this._only = t; | |
}; | |
Results.prototype._watch = function (t) { | |
var self = this; | |
var write = function (s) { self._stream.queue(s) }; | |
t.once('prerun', function () { | |
write('# ' + t.name + '\n'); | |
}); | |
t.on('result', function (res) { | |
if (typeof res === 'string') { | |
write('# ' + res + '\n'); | |
return; | |
} | |
write(encodeResult(res, self.count + 1)); | |
self.count ++; | |
if (res.ok) self.pass ++ | |
else self.fail ++ | |
}); | |
t.on('test', function (st) { self._watch(st) }); | |
}; | |
Results.prototype.close = function () { | |
var self = this; | |
if (self.closed) self._stream.emit('error', new Error('ALREADY CLOSED')); | |
self.closed = true; | |
var write = function (s) { self._stream.queue(s) }; | |
write('\n1..' + self.count + '\n'); | |
write('# tests ' + self.count + '\n'); | |
write('# pass ' + self.pass + '\n'); | |
if (self.fail) write('# fail ' + self.fail + '\n') | |
else write('\n# ok\n') | |
self._stream.queue(null); | |
}; | |
function encodeResult (res, count) { | |
var output = ''; | |
output += (res.ok ? 'ok ' : 'not ok ') + count; | |
output += res.name ? ' ' + res.name.toString().replace(/\s+/g, ' ') : ''; | |
if (res.skip) output += ' # SKIP'; | |
else if (res.todo) output += ' # TODO'; | |
output += '\n'; | |
if (res.ok) return output; | |
var outer = ' '; | |
var inner = outer + ' '; | |
output += outer + '---\n'; | |
output += inner + 'operator: ' + res.operator + '\n'; | |
if (has(res, 'expected') || has(res, 'actual')) { | |
var ex = inspect(res.expected, {depth: res.objectPrintDepth}); | |
var ac = inspect(res.actual, {depth: res.objectPrintDepth}); | |
if (Math.max(ex.length, ac.length) > 65 || invalidYaml(ex) || invalidYaml(ac)) { | |
output += inner + 'expected: |-\n' + inner + ' ' + ex + '\n'; | |
output += inner + 'actual: |-\n' + inner + ' ' + ac + '\n'; | |
} | |
else { | |
output += inner + 'expected: ' + ex + '\n'; | |
output += inner + 'actual: ' + ac + '\n'; | |
} | |
} | |
if (res.at) { | |
output += inner + 'at: ' + res.at + '\n'; | |
} | |
if (res.operator === 'error' && res.actual && res.actual.stack) { | |
var lines = String(res.actual.stack).split('\n'); | |
output += inner + 'stack: |-\n'; | |
for (var i = 0; i < lines.length; i++) { | |
output += inner + ' ' + lines[i] + '\n'; | |
} | |
} | |
output += outer + '...\n'; | |
return output; | |
} | |
function getNextTest (results) { | |
if (!results._only) { | |
return results.tests.shift(); | |
} | |
do { | |
var t = results.tests.shift(); | |
if (!t) continue; | |
if (results._only === t) { | |
return t; | |
} | |
} while (results.tests.length !== 0) | |
} | |
function invalidYaml (str) { | |
return regexpTest(yamlIndicators, str); | |
} | |
}).call(this,require('_process')) | |
},{"_process":36,"events":19,"function-bind":23,"has":24,"inherits":26,"object-inspect":31,"resumer":48,"through":58}],57:[function(require,module,exports){ | |
(function (process,__dirname){ | |
var deepEqual = require('deep-equal'); | |
var defined = require('defined'); | |
var path = require('path'); | |
var inherits = require('inherits'); | |
var EventEmitter = require('events').EventEmitter; | |
var has = require('has'); | |
var trim = require('string.prototype.trim'); | |
var bind = require('function-bind'); | |
var forEach = require('for-each'); | |
var isEnumerable = bind.call(Function.call, Object.prototype.propertyIsEnumerable); | |
module.exports = Test; | |
var nextTick = typeof setImmediate !== 'undefined' | |
? setImmediate | |
: process.nextTick | |
; | |
var safeSetTimeout = setTimeout; | |
inherits(Test, EventEmitter); | |
var getTestArgs = function (name_, opts_, cb_) { | |
var name = '(anonymous)'; | |
var opts = {}; | |
var cb; | |
for (var i = 0; i < arguments.length; i++) { | |
var arg = arguments[i]; | |
var t = typeof arg; | |
if (t === 'string') { | |
name = arg; | |
} | |
else if (t === 'object') { | |
opts = arg || opts; | |
} | |
else if (t === 'function') { | |
cb = arg; | |
} | |
} | |
return { name: name, opts: opts, cb: cb }; | |
}; | |
function Test (name_, opts_, cb_) { | |
if (! (this instanceof Test)) { | |
return new Test(name_, opts_, cb_); | |
} | |
var args = getTestArgs(name_, opts_, cb_); | |
this.readable = true; | |
this.name = args.name || '(anonymous)'; | |
this.assertCount = 0; | |
this.pendingCount = 0; | |
this._skip = args.opts.skip || false; | |
this._timeout = args.opts.timeout; | |
this._objectPrintDepth = args.opts.objectPrintDepth || 5; | |
this._plan = undefined; | |
this._cb = args.cb; | |
this._progeny = []; | |
this._ok = true; | |
for (var prop in this) { | |
this[prop] = (function bind(self, val) { | |
if (typeof val === 'function') { | |
return function bound() { | |
return val.apply(self, arguments); | |
}; | |
} | |
else return val; | |
})(this, this[prop]); | |
} | |
} | |
Test.prototype.run = function () { | |
if (this._skip) { | |
this.comment('SKIP ' + this.name); | |
} | |
if (!this._cb || this._skip) { | |
return this._end(); | |
} | |
if (this._timeout != null) { | |
this.timeoutAfter(this._timeout); | |
} | |
this.emit('prerun'); | |
this._cb(this); | |
this.emit('run'); | |
}; | |
Test.prototype.test = function (name, opts, cb) { | |
var self = this; | |
var t = new Test(name, opts, cb); | |
this._progeny.push(t); | |
this.pendingCount++; | |
this.emit('test', t); | |
t.on('prerun', function () { | |
self.assertCount++; | |
}) | |
if (!self._pendingAsserts()) { | |
nextTick(function () { | |
self._end(); | |
}); | |
} | |
nextTick(function() { | |
if (!self._plan && self.pendingCount == self._progeny.length) { | |
self._end(); | |
} | |
}); | |
}; | |
Test.prototype.comment = function (msg) { | |
var that = this; | |
forEach(trim(msg).split('\n'), function (aMsg) { | |
that.emit('result', trim(aMsg).replace(/^#\s*/, '')); | |
}); | |
}; | |
Test.prototype.plan = function (n) { | |
this._plan = n; | |
this.emit('plan', n); | |
}; | |
Test.prototype.timeoutAfter = function(ms) { | |
if (!ms) throw new Error('timeoutAfter requires a timespan'); | |
var self = this; | |
var timeout = safeSetTimeout(function() { | |
self.fail('test timed out after ' + ms + 'ms'); | |
self.end(); | |
}, ms); | |
this.once('end', function() { | |
clearTimeout(timeout); | |
}); | |
} | |
Test.prototype.end = function (err) { | |
var self = this; | |
if (arguments.length >= 1 && !!err) { | |
this.ifError(err); | |
} | |
if (this.calledEnd) { | |
this.fail('.end() called twice'); | |
} | |
this.calledEnd = true; | |
this._end(); | |
}; | |
Test.prototype._end = function (err) { | |
var self = this; | |
if (this._progeny.length) { | |
var t = this._progeny.shift(); | |
t.on('end', function () { self._end() }); | |
t.run(); | |
return; | |
} | |
if (!this.ended) this.emit('end'); | |
var pendingAsserts = this._pendingAsserts(); | |
if (!this._planError && this._plan !== undefined && pendingAsserts) { | |
this._planError = true; | |
this.fail('plan != count', { | |
expected : this._plan, | |
actual : this.assertCount | |
}); | |
} | |
this.ended = true; | |
}; | |
Test.prototype._exit = function () { | |
if (this._plan !== undefined && | |
!this._planError && this.assertCount !== this._plan) { | |
this._planError = true; | |
this.fail('plan != count', { | |
expected : this._plan, | |
actual : this.assertCount, | |
exiting : true | |
}); | |
} | |
else if (!this.ended) { | |
this.fail('test exited without ending', { | |
exiting: true | |
}); | |
} | |
}; | |
Test.prototype._pendingAsserts = function () { | |
if (this._plan === undefined) { | |
return 1; | |
} | |
else { | |
return this._plan - (this._progeny.length + this.assertCount); | |
} | |
}; | |
Test.prototype._assert = function assert (ok, opts) { | |
var self = this; | |
var extra = opts.extra || {}; | |
var res = { | |
id : self.assertCount ++, | |
ok : Boolean(ok), | |
skip : defined(extra.skip, opts.skip), | |
name : defined(extra.message, opts.message, '(unnamed assert)'), | |
operator : defined(extra.operator, opts.operator), | |
objectPrintDepth : self._objectPrintDepth | |
}; | |
if (has(opts, 'actual') || has(extra, 'actual')) { | |
res.actual = defined(extra.actual, opts.actual); | |
} | |
if (has(opts, 'expected') || has(extra, 'expected')) { | |
res.expected = defined(extra.expected, opts.expected); | |
} | |
this._ok = Boolean(this._ok && ok); | |
if (!ok) { | |
res.error = defined(extra.error, opts.error, new Error(res.name)); | |
} | |
if (!ok) { | |
var e = new Error('exception'); | |
var err = (e.stack || '').split('\n'); | |
var dir = path.dirname(__dirname) + path.sep; | |
for (var i = 0; i < err.length; i++) { | |
var m = /^[^\s]*\s*\bat\s+(.+)/.exec(err[i]); | |
if (!m) { | |
continue; | |
} | |
var s = m[1].split(/\s+/); | |
var filem = /((?:\/|[A-Z]:\\)[^:\s]+:(\d+)(?::(\d+))?)/.exec(s[1]); | |
if (!filem) { | |
filem = /((?:\/|[A-Z]:\\)[^:\s]+:(\d+)(?::(\d+))?)/.exec(s[2]); | |
if (!filem) { | |
filem = /((?:\/|[A-Z]:\\)[^:\s]+:(\d+)(?::(\d+))?)/.exec(s[3]); | |
if (!filem) { | |
continue; | |
} | |
} | |
} | |
if (filem[1].slice(0, dir.length) === dir) { | |
continue; | |
} | |
res.functionName = s[0]; | |
res.file = filem[1]; | |
res.line = Number(filem[2]); | |
if (filem[3]) res.column = filem[3]; | |
res.at = m[1]; | |
break; | |
} | |
} | |
self.emit('result', res); | |
var pendingAsserts = self._pendingAsserts(); | |
if (!pendingAsserts) { | |
if (extra.exiting) { | |
self._end(); | |
} else { | |
nextTick(function () { | |
self._end(); | |
}); | |
} | |
} | |
if (!self._planError && pendingAsserts < 0) { | |
self._planError = true; | |
self.fail('plan != count', { | |
expected : self._plan, | |
actual : self._plan - pendingAsserts | |
}); | |
} | |
}; | |
Test.prototype.fail = function (msg, extra) { | |
this._assert(false, { | |
message : msg, | |
operator : 'fail', | |
extra : extra | |
}); | |
}; | |
Test.prototype.pass = function (msg, extra) { | |
this._assert(true, { | |
message : msg, | |
operator : 'pass', | |
extra : extra | |
}); | |
}; | |
Test.prototype.skip = function (msg, extra) { | |
this._assert(true, { | |
message : msg, | |
operator : 'skip', | |
skip : true, | |
extra : extra | |
}); | |
}; | |
Test.prototype.ok | |
= Test.prototype['true'] | |
= Test.prototype.assert | |
= function (value, msg, extra) { | |
this._assert(value, { | |
message : defined(msg, 'should be truthy'), | |
operator : 'ok', | |
expected : true, | |
actual : value, | |
extra : extra | |
}); | |
}; | |
Test.prototype.notOk | |
= Test.prototype['false'] | |
= Test.prototype.notok | |
= function (value, msg, extra) { | |
this._assert(!value, { | |
message : defined(msg, 'should be falsy'), | |
operator : 'notOk', | |
expected : false, | |
actual : value, | |
extra : extra | |
}); | |
}; | |
Test.prototype.error | |
= Test.prototype.ifError | |
= Test.prototype.ifErr | |
= Test.prototype.iferror | |
= function (err, msg, extra) { | |
this._assert(!err, { | |
message : defined(msg, String(err)), | |
operator : 'error', | |
actual : err, | |
extra : extra | |
}); | |
}; | |
Test.prototype.equal | |
= Test.prototype.equals | |
= Test.prototype.isEqual | |
= Test.prototype.is | |
= Test.prototype.strictEqual | |
= Test.prototype.strictEquals | |
= function (a, b, msg, extra) { | |
this._assert(a === b, { | |
message : defined(msg, 'should be equal'), | |
operator : 'equal', | |
actual : a, | |
expected : b, | |
extra : extra | |
}); | |
}; | |
Test.prototype.notEqual | |
= Test.prototype.notEquals | |
= Test.prototype.notStrictEqual | |
= Test.prototype.notStrictEquals | |
= Test.prototype.isNotEqual | |
= Test.prototype.isNot | |
= Test.prototype.not | |
= Test.prototype.doesNotEqual | |
= Test.prototype.isInequal | |
= function (a, b, msg, extra) { | |
this._assert(a !== b, { | |
message : defined(msg, 'should not be equal'), | |
operator : 'notEqual', | |
actual : a, | |
notExpected : b, | |
extra : extra | |
}); | |
}; | |
Test.prototype.deepEqual | |
= Test.prototype.deepEquals | |
= Test.prototype.isEquivalent | |
= Test.prototype.same | |
= function (a, b, msg, extra) { | |
this._assert(deepEqual(a, b, { strict: true }), { | |
message : defined(msg, 'should be equivalent'), | |
operator : 'deepEqual', | |
actual : a, | |
expected : b, | |
extra : extra | |
}); | |
}; | |
Test.prototype.deepLooseEqual | |
= Test.prototype.looseEqual | |
= Test.prototype.looseEquals | |
= function (a, b, msg, extra) { | |
this._assert(deepEqual(a, b), { | |
message : defined(msg, 'should be equivalent'), | |
operator : 'deepLooseEqual', | |
actual : a, | |
expected : b, | |
extra : extra | |
}); | |
}; | |
Test.prototype.notDeepEqual | |
= Test.prototype.notEquivalent | |
= Test.prototype.notDeeply | |
= Test.prototype.notSame | |
= Test.prototype.isNotDeepEqual | |
= Test.prototype.isNotDeeply | |
= Test.prototype.isNotEquivalent | |
= Test.prototype.isInequivalent | |
= function (a, b, msg, extra) { | |
this._assert(!deepEqual(a, b, { strict: true }), { | |
message : defined(msg, 'should not be equivalent'), | |
operator : 'notDeepEqual', | |
actual : a, | |
notExpected : b, | |
extra : extra | |
}); | |
}; | |
Test.prototype.notDeepLooseEqual | |
= Test.prototype.notLooseEqual | |
= Test.prototype.notLooseEquals | |
= function (a, b, msg, extra) { | |
this._assert(!deepEqual(a, b), { | |
message : defined(msg, 'should be equivalent'), | |
operator : 'notDeepLooseEqual', | |
actual : a, | |
expected : b, | |
extra : extra | |
}); | |
}; | |
Test.prototype['throws'] = function (fn, expected, msg, extra) { | |
if (typeof expected === 'string') { | |
msg = expected; | |
expected = undefined; | |
} | |
var caught = undefined; | |
try { | |
fn(); | |
} catch (err) { | |
caught = { error : err }; | |
if ((err != null) && (!isEnumerable(err, 'message') || !has(err, 'message'))) { | |
var message = err.message; | |
delete err.message; | |
err.message = message; | |
} | |
} | |
var passed = caught; | |
if (expected instanceof RegExp) { | |
passed = expected.test(caught && caught.error); | |
expected = String(expected); | |
} | |
if (typeof expected === 'function' && caught) { | |
passed = caught.error instanceof expected; | |
caught.error = caught.error.constructor; | |
} | |
this._assert(typeof fn === 'function' && passed, { | |
message : defined(msg, 'should throw'), | |
operator : 'throws', | |
actual : caught && caught.error, | |
expected : expected, | |
error: !passed && caught && caught.error, | |
extra : extra | |
}); | |
}; | |
Test.prototype.doesNotThrow = function (fn, expected, msg, extra) { | |
if (typeof expected === 'string') { | |
msg = expected; | |
expected = undefined; | |
} | |
var caught = undefined; | |
try { | |
fn(); | |
} | |
catch (err) { | |
caught = { error : err }; | |
} | |
this._assert(!caught, { | |
message : defined(msg, 'should not throw'), | |
operator : 'throws', | |
actual : caught && caught.error, | |
expected : expected, | |
error : caught && caught.error, | |
extra : extra | |
}); | |
}; | |
Test.skip = function (name_, _opts, _cb) { | |
var args = getTestArgs.apply(null, arguments); | |
args.opts.skip = true; | |
return Test(args.name, args.opts, args.cb); | |
}; | |
// vim: set softtabstop=4 shiftwidth=4: | |
}).call(this,require('_process'),"/node_modules\\tape\\lib") | |
},{"_process":36,"deep-equal":7,"defined":11,"events":19,"for-each":20,"function-bind":23,"has":24,"inherits":26,"path":34,"string.prototype.trim":51}],58:[function(require,module,exports){ | |
(function (process){ | |
var Stream = require('stream') | |
// through | |
// | |
// a stream that does nothing but re-emit the input. | |
// useful for aggregating a series of changing but not ending streams into one stream) | |
exports = module.exports = through | |
through.through = through | |
//create a readable writable stream. | |
function through (write, end, opts) { | |
write = write || function (data) { this.queue(data) } | |
end = end || function () { this.queue(null) } | |
var ended = false, destroyed = false, buffer = [], _ended = false | |
var stream = new Stream() | |
stream.readable = stream.writable = true | |
stream.paused = false | |
// stream.autoPause = !(opts && opts.autoPause === false) | |
stream.autoDestroy = !(opts && opts.autoDestroy === false) | |
stream.write = function (data) { | |
write.call(this, data) | |
return !stream.paused | |
} | |
function drain() { | |
while(buffer.length && !stream.paused) { | |
var data = buffer.shift() | |
if(null === data) | |
return stream.emit('end') | |
else | |
stream.emit('data', data) | |
} | |
} | |
stream.queue = stream.push = function (data) { | |
// console.error(ended) | |
if(_ended) return stream | |
if(data === null) _ended = true | |
buffer.push(data) | |
drain() | |
return stream | |
} | |
//this will be registered as the first 'end' listener | |
//must call destroy next tick, to make sure we're after any | |
//stream piped from here. | |
//this is only a problem if end is not emitted synchronously. | |
//a nicer way to do this is to make sure this is the last listener for 'end' | |
stream.on('end', function () { | |
stream.readable = false | |
if(!stream.writable && stream.autoDestroy) | |
process.nextTick(function () { | |
stream.destroy() | |
}) | |
}) | |
function _end () { | |
stream.writable = false | |
end.call(stream) | |
if(!stream.readable && stream.autoDestroy) | |
stream.destroy() | |
} | |
stream.end = function (data) { | |
if(ended) return | |
ended = true | |
if(arguments.length) stream.write(data) | |
_end() // will emit or queue | |
return stream | |
} | |
stream.destroy = function () { | |
if(destroyed) return | |
destroyed = true | |
ended = true | |
buffer.length = 0 | |
stream.writable = stream.readable = false | |
stream.emit('close') | |
return stream | |
} | |
stream.pause = function () { | |
if(stream.paused) return | |
stream.paused = true | |
return stream | |
} | |
stream.resume = function () { | |
if(stream.paused) { | |
stream.paused = false | |
stream.emit('resume') | |
} | |
drain() | |
//may have become paused again, | |
//as drain emits 'data'. | |
if(!stream.paused) | |
stream.emit('drain') | |
return stream | |
} | |
return stream | |
} | |
}).call(this,require('_process')) | |
},{"_process":36,"stream":49}],59:[function(require,module,exports){ | |
(function (global){ | |
/** | |
* Module exports. | |
*/ | |
module.exports = deprecate; | |
/** | |
* Mark that a method should not be used. | |
* Returns a modified function which warns once by default. | |
* | |
* If `localStorage.noDeprecation = true` is set, then it is a no-op. | |
* | |
* If `localStorage.throwDeprecation = true` is set, then deprecated functions | |
* will throw an Error when invoked. | |
* | |
* If `localStorage.traceDeprecation = true` is set, then deprecated functions | |
* will invoke `console.trace()` instead of `console.error()`. | |
* | |
* @param {Function} fn - the function to deprecate | |
* @param {String} msg - the string to print to the console when `fn` is invoked | |
* @returns {Function} a new "deprecated" version of `fn` | |
* @api public | |
*/ | |
function deprecate (fn, msg) { | |
if (config('noDeprecation')) { | |
return fn; | |
} | |
var warned = false; | |
function deprecated() { | |
if (!warned) { | |
if (config('throwDeprecation')) { | |
throw new Error(msg); | |
} else if (config('traceDeprecation')) { | |
console.trace(msg); | |
} else { | |
console.warn(msg); | |
} | |
warned = true; | |
} | |
return fn.apply(this, arguments); | |
} | |
return deprecated; | |
} | |
/** | |
* Checks `localStorage` for boolean values for the given `name`. | |
* | |
* @param {String} name | |
* @returns {Boolean} | |
* @api private | |
*/ | |
function config (name) { | |
// accessing global.localStorage can trigger a DOMException in sandboxed iframes | |
try { | |
if (!global.localStorage) return false; | |
} catch (_) { | |
return false; | |
} | |
var val = global.localStorage[name]; | |
if (null == val) return false; | |
return String(val).toLowerCase() === 'true'; | |
} | |
}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) | |
},{}],"tape":[function(require,module,exports){ | |
(function (process){ | |
var defined = require('defined'); | |
var createDefaultStream = require('./lib/default_stream'); | |
var Test = require('./lib/test'); | |
var createResult = require('./lib/results'); | |
var through = require('through'); | |
var canEmitExit = typeof process !== 'undefined' && process | |
&& typeof process.on === 'function' && process.browser !== true | |
; | |
var canExit = typeof process !== 'undefined' && process | |
&& typeof process.exit === 'function' | |
; | |
var nextTick = typeof setImmediate !== 'undefined' | |
? setImmediate | |
: process.nextTick | |
; | |
exports = module.exports = (function () { | |
var harness; | |
var lazyLoad = function () { | |
return getHarness().apply(this, arguments); | |
}; | |
lazyLoad.only = function () { | |
return getHarness().only.apply(this, arguments); | |
}; | |
lazyLoad.createStream = function (opts) { | |
if (!opts) opts = {}; | |
if (!harness) { | |
var output = through(); | |
getHarness({ stream: output, objectMode: opts.objectMode }); | |
return output; | |
} | |
return harness.createStream(opts); | |
}; | |
lazyLoad.onFinish = function () { | |
return getHarness().onFinish.apply(this, arguments); | |
}; | |
lazyLoad.getHarness = getHarness | |
return lazyLoad | |
function getHarness (opts) { | |
if (!opts) opts = {}; | |
opts.autoclose = !canEmitExit; | |
if (!harness) harness = createExitHarness(opts); | |
return harness; | |
} | |
})(); | |
function createExitHarness (conf) { | |
if (!conf) conf = {}; | |
var harness = createHarness({ | |
autoclose: defined(conf.autoclose, false) | |
}); | |
var stream = harness.createStream({ objectMode: conf.objectMode }); | |
var es = stream.pipe(conf.stream || createDefaultStream()); | |
if (canEmitExit) { | |
es.on('error', function (err) { harness._exitCode = 1 }); | |
} | |
var ended = false; | |
stream.on('end', function () { ended = true }); | |
if (conf.exit === false) return harness; | |
if (!canEmitExit || !canExit) return harness; | |
var inErrorState = false; | |
process.on('exit', function (code) { | |
// let the process exit cleanly. | |
if (code !== 0) { | |
return | |
} | |
if (!ended) { | |
var only = harness._results._only; | |
for (var i = 0; i < harness._tests.length; i++) { | |
var t = harness._tests[i]; | |
if (only && t !== only) continue; | |
t._exit(); | |
} | |
} | |
harness.close(); | |
process.exit(code || harness._exitCode); | |
}); | |
return harness; | |
} | |
exports.createHarness = createHarness; | |
exports.Test = Test; | |
exports.test = exports; // tap compat | |
exports.test.skip = Test.skip; | |
var exitInterval; | |
function createHarness (conf_) { | |
if (!conf_) conf_ = {}; | |
var results = createResult(); | |
if (conf_.autoclose !== false) { | |
results.once('done', function () { results.close() }); | |
} | |
var test = function (name, conf, cb) { | |
var t = new Test(name, conf, cb); | |
test._tests.push(t); | |
(function inspectCode (st) { | |
st.on('test', function sub (st_) { | |
inspectCode(st_); | |
}); | |
st.on('result', function (r) { | |
if (!r.ok && typeof r !== 'string') test._exitCode = 1 | |
}); | |
})(t); | |
results.push(t); | |
return t; | |
}; | |
test._results = results; | |
test._tests = []; | |
test.createStream = function (opts) { | |
return results.createStream(opts); | |
}; | |
test.onFinish = function (cb) { | |
results.on('done', cb); | |
}; | |
var only = false; | |
test.only = function () { | |
if (only) throw new Error('there can only be one only test'); | |
only = true; | |
var t = test.apply(null, arguments); | |
results.only(t); | |
return t; | |
}; | |
test._exitCode = 0; | |
test.close = function () { results.close() }; | |
return test; | |
} | |
}).call(this,require('_process')) | |
},{"./lib/default_stream":55,"./lib/results":56,"./lib/test":57,"_process":36,"defined":11,"through":58}]},{},[])("tape") | |
}); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{ | |
"name": "tape-browser-bundle", | |
"version": "1.0.0", | |
"description": "browserified tape bundle for front-end testing", | |
"main": "index.js", | |
"scripts": { | |
"test": "echo \"Error: no test specified\" && exit 1", | |
"build": "browserify --require tape --standalone test --outfile index.js" | |
}, | |
"author": "Jeremy Danyow <jdanyow@gmail.com> (https://danyow.net)", | |
"license": "ISC", | |
"devDependencies": { | |
"browserify": "^13.1.1", | |
"tape": "^4.6.3" | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment