Comparing version 2.7.0 to 2.8.0
1302
bundle.js
@@ -1,1298 +0,4 @@ | ||
require=(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})({"./":[function(require,module,exports){ | ||
/*! | ||
* The buffer module from node.js, for the browser. | ||
* | ||
* @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org> | ||
* @license MIT | ||
*/ | ||
var base64 = require('base64-js') | ||
var ieee754 = require('ieee754') | ||
var isArray = require('is-array') | ||
exports.Buffer = Buffer | ||
exports.SlowBuffer = Buffer | ||
exports.INSPECT_MAX_BYTES = 50 | ||
Buffer.poolSize = 8192 // not used by this implementation | ||
var kMaxLength = 0x3fffffff | ||
/** | ||
* If `Buffer.TYPED_ARRAY_SUPPORT`: | ||
* === true Use Uint8Array implementation (fastest) | ||
* === false Use Object implementation (most compatible, even IE6) | ||
* | ||
* Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+, | ||
* Opera 11.6+, iOS 4.2+. | ||
* | ||
* Note: | ||
* | ||
* - Implementation must support adding new properties to `Uint8Array` instances. | ||
* Firefox 4-29 lacked support, fixed in Firefox 30+. | ||
* See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438. | ||
* | ||
* - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function. | ||
* | ||
* - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of | ||
* incorrect length in some situations. | ||
* | ||
* We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they will | ||
* get the Object implementation, which is slower but will work correctly. | ||
*/ | ||
Buffer.TYPED_ARRAY_SUPPORT = (function () { | ||
try { | ||
var buf = new ArrayBuffer(0) | ||
var arr = new Uint8Array(buf) | ||
arr.foo = function () { return 42 } | ||
return 42 === arr.foo() && // typed array instances can be augmented | ||
typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray` | ||
new Uint8Array(1).subarray(1, 1).byteLength === 0 // ie10 has broken `subarray` | ||
} catch (e) { | ||
return false | ||
} | ||
})() | ||
/** | ||
* Class: Buffer | ||
* ============= | ||
* | ||
* The Buffer constructor returns instances of `Uint8Array` that are augmented | ||
* with function properties for all the node `Buffer` API functions. We use | ||
* `Uint8Array` so that square bracket notation works as expected -- it returns | ||
* a single octet. | ||
* | ||
* By augmenting the instances, we can avoid modifying the `Uint8Array` | ||
* prototype. | ||
*/ | ||
function Buffer (subject, encoding, noZero) { | ||
if (!(this instanceof Buffer)) | ||
return new Buffer(subject, encoding, noZero) | ||
var type = typeof subject | ||
// Find the length | ||
var length | ||
if (type === 'number') | ||
length = subject > 0 ? subject >>> 0 : 0 | ||
else if (type === 'string') { | ||
if (encoding === 'base64') | ||
subject = base64clean(subject) | ||
length = Buffer.byteLength(subject, encoding) | ||
} else if (type === 'object' && subject !== null) { // assume object is array-like | ||
if (subject.type === 'Buffer' && isArray(subject.data)) | ||
subject = subject.data | ||
length = +subject.length > 0 ? Math.floor(+subject.length) : 0 | ||
} else | ||
throw new TypeError('must start with number, buffer, array or string') | ||
if (this.length > kMaxLength) | ||
throw new RangeError('Attempt to allocate Buffer larger than maximum ' + | ||
'size: 0x' + kMaxLength.toString(16) + ' bytes') | ||
var buf | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
// Preferred: Return an augmented `Uint8Array` instance for best performance | ||
buf = Buffer._augment(new Uint8Array(length)) | ||
} else { | ||
// Fallback: Return THIS instance of Buffer (created by `new`) | ||
buf = this | ||
buf.length = length | ||
buf._isBuffer = true | ||
} | ||
var i | ||
if (Buffer.TYPED_ARRAY_SUPPORT && typeof subject.byteLength === 'number') { | ||
// Speed optimization -- use set if we're copying from a typed array | ||
buf._set(subject) | ||
} else if (isArrayish(subject)) { | ||
// Treat array-ish objects as a byte array | ||
if (Buffer.isBuffer(subject)) { | ||
for (i = 0; i < length; i++) | ||
buf[i] = subject.readUInt8(i) | ||
} else { | ||
for (i = 0; i < length; i++) | ||
buf[i] = ((subject[i] % 256) + 256) % 256 | ||
} | ||
} else if (type === 'string') { | ||
buf.write(subject, 0, encoding) | ||
} else if (type === 'number' && !Buffer.TYPED_ARRAY_SUPPORT && !noZero) { | ||
for (i = 0; i < length; i++) { | ||
buf[i] = 0 | ||
} | ||
} | ||
return buf | ||
} | ||
Buffer.isBuffer = function (b) { | ||
return !!(b != null && b._isBuffer) | ||
} | ||
Buffer.compare = function (a, b) { | ||
if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) | ||
throw new TypeError('Arguments must be Buffers') | ||
var x = a.length | ||
var y = b.length | ||
for (var i = 0, len = Math.min(x, y); i < len && a[i] === b[i]; i++) {} | ||
if (i !== len) { | ||
x = a[i] | ||
y = b[i] | ||
} | ||
if (x < y) return -1 | ||
if (y < x) return 1 | ||
return 0 | ||
} | ||
Buffer.isEncoding = function (encoding) { | ||
switch (String(encoding).toLowerCase()) { | ||
case 'hex': | ||
case 'utf8': | ||
case 'utf-8': | ||
case 'ascii': | ||
case 'binary': | ||
case 'base64': | ||
case 'raw': | ||
case 'ucs2': | ||
case 'ucs-2': | ||
case 'utf16le': | ||
case 'utf-16le': | ||
return true | ||
default: | ||
return false | ||
} | ||
} | ||
Buffer.concat = function (list, totalLength) { | ||
if (!isArray(list)) throw new TypeError('Usage: Buffer.concat(list[, length])') | ||
if (list.length === 0) { | ||
return new Buffer(0) | ||
} else if (list.length === 1) { | ||
return list[0] | ||
} | ||
var i | ||
if (totalLength === undefined) { | ||
totalLength = 0 | ||
for (i = 0; i < list.length; i++) { | ||
totalLength += list[i].length | ||
} | ||
} | ||
var buf = new Buffer(totalLength) | ||
var pos = 0 | ||
for (i = 0; i < list.length; i++) { | ||
var item = list[i] | ||
item.copy(buf, pos) | ||
pos += item.length | ||
} | ||
return buf | ||
} | ||
Buffer.byteLength = function (str, encoding) { | ||
var ret | ||
str = str + '' | ||
switch (encoding || 'utf8') { | ||
case 'ascii': | ||
case 'binary': | ||
case 'raw': | ||
ret = str.length | ||
break | ||
case 'ucs2': | ||
case 'ucs-2': | ||
case 'utf16le': | ||
case 'utf-16le': | ||
ret = str.length * 2 | ||
break | ||
case 'hex': | ||
ret = str.length >>> 1 | ||
break | ||
case 'utf8': | ||
case 'utf-8': | ||
ret = utf8ToBytes(str).length | ||
break | ||
case 'base64': | ||
ret = base64ToBytes(str).length | ||
break | ||
default: | ||
ret = str.length | ||
} | ||
return ret | ||
} | ||
// pre-set for values that may exist in the future | ||
Buffer.prototype.length = undefined | ||
Buffer.prototype.parent = undefined | ||
// toString(encoding, start=0, end=buffer.length) | ||
Buffer.prototype.toString = function (encoding, start, end) { | ||
var loweredCase = false | ||
start = start >>> 0 | ||
end = end === undefined || end === Infinity ? this.length : end >>> 0 | ||
if (!encoding) encoding = 'utf8' | ||
if (start < 0) start = 0 | ||
if (end > this.length) end = this.length | ||
if (end <= start) return '' | ||
while (true) { | ||
switch (encoding) { | ||
case 'hex': | ||
return hexSlice(this, start, end) | ||
case 'utf8': | ||
case 'utf-8': | ||
return utf8Slice(this, start, end) | ||
case 'ascii': | ||
return asciiSlice(this, start, end) | ||
case 'binary': | ||
return binarySlice(this, start, end) | ||
case 'base64': | ||
return base64Slice(this, start, end) | ||
case 'ucs2': | ||
case 'ucs-2': | ||
case 'utf16le': | ||
case 'utf-16le': | ||
return utf16leSlice(this, start, end) | ||
default: | ||
if (loweredCase) | ||
throw new TypeError('Unknown encoding: ' + encoding) | ||
encoding = (encoding + '').toLowerCase() | ||
loweredCase = true | ||
} | ||
} | ||
} | ||
Buffer.prototype.equals = function (b) { | ||
if(!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') | ||
return Buffer.compare(this, b) === 0 | ||
} | ||
Buffer.prototype.inspect = function () { | ||
var str = '' | ||
var max = exports.INSPECT_MAX_BYTES | ||
if (this.length > 0) { | ||
str = this.toString('hex', 0, max).match(/.{2}/g).join(' ') | ||
if (this.length > max) | ||
str += ' ... ' | ||
} | ||
return '<Buffer ' + str + '>' | ||
} | ||
Buffer.prototype.compare = function (b) { | ||
if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') | ||
return Buffer.compare(this, b) | ||
} | ||
// `get` will be removed in Node 0.13+ | ||
Buffer.prototype.get = function (offset) { | ||
console.log('.get() is deprecated. Access using array indexes instead.') | ||
return this.readUInt8(offset) | ||
} | ||
// `set` will be removed in Node 0.13+ | ||
Buffer.prototype.set = function (v, offset) { | ||
console.log('.set() is deprecated. Access using array indexes instead.') | ||
return this.writeUInt8(v, offset) | ||
} | ||
function hexWrite (buf, string, offset, length) { | ||
offset = Number(offset) || 0 | ||
var remaining = buf.length - offset | ||
if (!length) { | ||
length = remaining | ||
} else { | ||
length = Number(length) | ||
if (length > remaining) { | ||
length = remaining | ||
} | ||
} | ||
// must be an even number of digits | ||
var strLen = string.length | ||
if (strLen % 2 !== 0) throw new Error('Invalid hex string') | ||
if (length > strLen / 2) { | ||
length = strLen / 2 | ||
} | ||
for (var i = 0; i < length; i++) { | ||
var byte = parseInt(string.substr(i * 2, 2), 16) | ||
if (isNaN(byte)) throw new Error('Invalid hex string') | ||
buf[offset + i] = byte | ||
} | ||
return i | ||
} | ||
function utf8Write (buf, string, offset, length) { | ||
var charsWritten = blitBuffer(utf8ToBytes(string), buf, offset, length) | ||
return charsWritten | ||
} | ||
function asciiWrite (buf, string, offset, length) { | ||
var charsWritten = blitBuffer(asciiToBytes(string), buf, offset, length) | ||
return charsWritten | ||
} | ||
function binaryWrite (buf, string, offset, length) { | ||
return asciiWrite(buf, string, offset, length) | ||
} | ||
function base64Write (buf, string, offset, length) { | ||
var charsWritten = blitBuffer(base64ToBytes(string), buf, offset, length) | ||
return charsWritten | ||
} | ||
function utf16leWrite (buf, string, offset, length) { | ||
var charsWritten = blitBuffer(utf16leToBytes(string), buf, offset, length) | ||
return charsWritten | ||
} | ||
Buffer.prototype.write = function (string, offset, length, encoding) { | ||
// Support both (string, offset, length, encoding) | ||
// and the legacy (string, encoding, offset, length) | ||
if (isFinite(offset)) { | ||
if (!isFinite(length)) { | ||
encoding = length | ||
length = undefined | ||
} | ||
} else { // legacy | ||
var swap = encoding | ||
encoding = offset | ||
offset = length | ||
length = swap | ||
} | ||
offset = Number(offset) || 0 | ||
var remaining = this.length - offset | ||
if (!length) { | ||
length = remaining | ||
} else { | ||
length = Number(length) | ||
if (length > remaining) { | ||
length = remaining | ||
} | ||
} | ||
encoding = String(encoding || 'utf8').toLowerCase() | ||
var ret | ||
switch (encoding) { | ||
case 'hex': | ||
ret = hexWrite(this, string, offset, length) | ||
break | ||
case 'utf8': | ||
case 'utf-8': | ||
ret = utf8Write(this, string, offset, length) | ||
break | ||
case 'ascii': | ||
ret = asciiWrite(this, string, offset, length) | ||
break | ||
case 'binary': | ||
ret = binaryWrite(this, string, offset, length) | ||
break | ||
case 'base64': | ||
ret = base64Write(this, string, offset, length) | ||
break | ||
case 'ucs2': | ||
case 'ucs-2': | ||
case 'utf16le': | ||
case 'utf-16le': | ||
ret = utf16leWrite(this, string, offset, length) | ||
break | ||
default: | ||
throw new TypeError('Unknown encoding: ' + encoding) | ||
} | ||
return ret | ||
} | ||
Buffer.prototype.toJSON = function () { | ||
return { | ||
type: 'Buffer', | ||
data: Array.prototype.slice.call(this._arr || this, 0) | ||
} | ||
} | ||
function base64Slice (buf, start, end) { | ||
if (start === 0 && end === buf.length) { | ||
return base64.fromByteArray(buf) | ||
} else { | ||
return base64.fromByteArray(buf.slice(start, end)) | ||
} | ||
} | ||
function utf8Slice (buf, start, end) { | ||
var res = '' | ||
var tmp = '' | ||
end = Math.min(buf.length, end) | ||
for (var i = start; i < end; i++) { | ||
if (buf[i] <= 0x7F) { | ||
res += decodeUtf8Char(tmp) + String.fromCharCode(buf[i]) | ||
tmp = '' | ||
} else { | ||
tmp += '%' + buf[i].toString(16) | ||
} | ||
} | ||
return res + decodeUtf8Char(tmp) | ||
} | ||
function asciiSlice (buf, start, end) { | ||
var ret = '' | ||
end = Math.min(buf.length, end) | ||
for (var i = start; i < end; i++) { | ||
ret += String.fromCharCode(buf[i]) | ||
} | ||
return ret | ||
} | ||
function binarySlice (buf, start, end) { | ||
return asciiSlice(buf, start, end) | ||
} | ||
function hexSlice (buf, start, end) { | ||
var len = buf.length | ||
if (!start || start < 0) start = 0 | ||
if (!end || end < 0 || end > len) end = len | ||
var out = '' | ||
for (var i = start; i < end; i++) { | ||
out += toHex(buf[i]) | ||
} | ||
return out | ||
} | ||
function utf16leSlice (buf, start, end) { | ||
var bytes = buf.slice(start, end) | ||
var res = '' | ||
for (var i = 0; i < bytes.length; i += 2) { | ||
res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256) | ||
} | ||
return res | ||
} | ||
Buffer.prototype.slice = function (start, end) { | ||
var len = this.length | ||
start = ~~start | ||
end = end === undefined ? len : ~~end | ||
if (start < 0) { | ||
start += len; | ||
if (start < 0) | ||
start = 0 | ||
} else if (start > len) { | ||
start = len | ||
} | ||
if (end < 0) { | ||
end += len | ||
if (end < 0) | ||
end = 0 | ||
} else if (end > len) { | ||
end = len | ||
} | ||
if (end < start) | ||
end = start | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
return Buffer._augment(this.subarray(start, end)) | ||
} else { | ||
var sliceLen = end - start | ||
var newBuf = new Buffer(sliceLen, undefined, true) | ||
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.readUInt8 = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 1, this.length) | ||
return this[offset] | ||
} | ||
Buffer.prototype.readUInt16LE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 2, this.length) | ||
return this[offset] | (this[offset + 1] << 8) | ||
} | ||
Buffer.prototype.readUInt16BE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 2, this.length) | ||
return (this[offset] << 8) | this[offset + 1] | ||
} | ||
Buffer.prototype.readUInt32LE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 4, this.length) | ||
return ((this[offset]) | | ||
(this[offset + 1] << 8) | | ||
(this[offset + 2] << 16)) + | ||
(this[offset + 3] * 0x1000000) | ||
} | ||
Buffer.prototype.readUInt32BE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 4, this.length) | ||
return (this[offset] * 0x1000000) + | ||
((this[offset + 1] << 16) | | ||
(this[offset + 2] << 8) | | ||
this[offset + 3]) | ||
} | ||
Buffer.prototype.readInt8 = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 1, this.length) | ||
if (!(this[offset] & 0x80)) | ||
return (this[offset]) | ||
return ((0xff - this[offset] + 1) * -1) | ||
} | ||
Buffer.prototype.readInt16LE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 2, this.length) | ||
var val = this[offset] | (this[offset + 1] << 8) | ||
return (val & 0x8000) ? val | 0xFFFF0000 : val | ||
} | ||
Buffer.prototype.readInt16BE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 2, this.length) | ||
var val = this[offset + 1] | (this[offset] << 8) | ||
return (val & 0x8000) ? val | 0xFFFF0000 : val | ||
} | ||
Buffer.prototype.readInt32LE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 4, this.length) | ||
return (this[offset]) | | ||
(this[offset + 1] << 8) | | ||
(this[offset + 2] << 16) | | ||
(this[offset + 3] << 24) | ||
} | ||
Buffer.prototype.readInt32BE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 4, this.length) | ||
return (this[offset] << 24) | | ||
(this[offset + 1] << 16) | | ||
(this[offset + 2] << 8) | | ||
(this[offset + 3]) | ||
} | ||
Buffer.prototype.readFloatLE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 4, this.length) | ||
return ieee754.read(this, offset, true, 23, 4) | ||
} | ||
Buffer.prototype.readFloatBE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 4, this.length) | ||
return ieee754.read(this, offset, false, 23, 4) | ||
} | ||
Buffer.prototype.readDoubleLE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 8, this.length) | ||
return ieee754.read(this, offset, true, 52, 8) | ||
} | ||
Buffer.prototype.readDoubleBE = function (offset, noAssert) { | ||
if (!noAssert) | ||
checkOffset(offset, 8, this.length) | ||
return ieee754.read(this, offset, false, 52, 8) | ||
} | ||
function checkInt (buf, value, offset, ext, max, min) { | ||
if (!Buffer.isBuffer(buf)) throw new TypeError('buffer must be a Buffer instance') | ||
if (value > max || value < min) throw new TypeError('value is out of bounds') | ||
if (offset + ext > buf.length) throw new TypeError('index out of range') | ||
} | ||
Buffer.prototype.writeUInt8 = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 1, 0xff, 0) | ||
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value) | ||
this[offset] = value | ||
return offset + 1 | ||
} | ||
function objectWriteUInt16 (buf, value, offset, littleEndian) { | ||
if (value < 0) value = 0xffff + value + 1 | ||
for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; i++) { | ||
buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>> | ||
(littleEndian ? i : 1 - i) * 8 | ||
} | ||
} | ||
Buffer.prototype.writeUInt16LE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 2, 0xffff, 0) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset] = value | ||
this[offset + 1] = (value >>> 8) | ||
} else objectWriteUInt16(this, value, offset, true) | ||
return offset + 2 | ||
} | ||
Buffer.prototype.writeUInt16BE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 2, 0xffff, 0) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset] = (value >>> 8) | ||
this[offset + 1] = value | ||
} else objectWriteUInt16(this, value, offset, false) | ||
return offset + 2 | ||
} | ||
function objectWriteUInt32 (buf, value, offset, littleEndian) { | ||
if (value < 0) value = 0xffffffff + value + 1 | ||
for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; i++) { | ||
buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff | ||
} | ||
} | ||
Buffer.prototype.writeUInt32LE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 4, 0xffffffff, 0) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset + 3] = (value >>> 24) | ||
this[offset + 2] = (value >>> 16) | ||
this[offset + 1] = (value >>> 8) | ||
this[offset] = value | ||
} else objectWriteUInt32(this, value, offset, true) | ||
return offset + 4 | ||
} | ||
Buffer.prototype.writeUInt32BE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 4, 0xffffffff, 0) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset] = (value >>> 24) | ||
this[offset + 1] = (value >>> 16) | ||
this[offset + 2] = (value >>> 8) | ||
this[offset + 3] = value | ||
} else objectWriteUInt32(this, value, offset, false) | ||
return offset + 4 | ||
} | ||
Buffer.prototype.writeInt8 = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 1, 0x7f, -0x80) | ||
if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value) | ||
if (value < 0) value = 0xff + value + 1 | ||
this[offset] = value | ||
return offset + 1 | ||
} | ||
Buffer.prototype.writeInt16LE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 2, 0x7fff, -0x8000) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset] = value | ||
this[offset + 1] = (value >>> 8) | ||
} else objectWriteUInt16(this, value, offset, true) | ||
return offset + 2 | ||
} | ||
Buffer.prototype.writeInt16BE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 2, 0x7fff, -0x8000) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset] = (value >>> 8) | ||
this[offset + 1] = value | ||
} else objectWriteUInt16(this, value, offset, false) | ||
return offset + 2 | ||
} | ||
Buffer.prototype.writeInt32LE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset] = value | ||
this[offset + 1] = (value >>> 8) | ||
this[offset + 2] = (value >>> 16) | ||
this[offset + 3] = (value >>> 24) | ||
} else objectWriteUInt32(this, value, offset, true) | ||
return offset + 4 | ||
} | ||
Buffer.prototype.writeInt32BE = function (value, offset, noAssert) { | ||
value = +value | ||
offset = offset >>> 0 | ||
if (!noAssert) | ||
checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) | ||
if (value < 0) value = 0xffffffff + value + 1 | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
this[offset] = (value >>> 24) | ||
this[offset + 1] = (value >>> 16) | ||
this[offset + 2] = (value >>> 8) | ||
this[offset + 3] = value | ||
} else objectWriteUInt32(this, value, offset, false) | ||
return offset + 4 | ||
} | ||
function checkIEEE754 (buf, value, offset, ext, max, min) { | ||
if (value > max || value < min) throw new TypeError('value is out of bounds') | ||
if (offset + ext > buf.length) throw new TypeError('index out of range') | ||
} | ||
function writeFloat (buf, value, offset, littleEndian, noAssert) { | ||
if (!noAssert) | ||
checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38) | ||
ieee754.write(buf, value, offset, littleEndian, 23, 4) | ||
return offset + 4 | ||
} | ||
Buffer.prototype.writeFloatLE = function (value, offset, noAssert) { | ||
return writeFloat(this, value, offset, true, noAssert) | ||
} | ||
Buffer.prototype.writeFloatBE = function (value, offset, noAssert) { | ||
return writeFloat(this, value, offset, false, noAssert) | ||
} | ||
function writeDouble (buf, value, offset, littleEndian, noAssert) { | ||
if (!noAssert) | ||
checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308) | ||
ieee754.write(buf, value, offset, littleEndian, 52, 8) | ||
return offset + 8 | ||
} | ||
Buffer.prototype.writeDoubleLE = function (value, offset, noAssert) { | ||
return writeDouble(this, value, offset, true, noAssert) | ||
} | ||
Buffer.prototype.writeDoubleBE = function (value, offset, noAssert) { | ||
return writeDouble(this, value, offset, false, noAssert) | ||
} | ||
// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) | ||
Buffer.prototype.copy = function (target, target_start, start, end) { | ||
var source = this | ||
if (!start) start = 0 | ||
if (!end && end !== 0) end = this.length | ||
if (!target_start) target_start = 0 | ||
// Copy 0 bytes; we're done | ||
if (end === start) return | ||
if (target.length === 0 || source.length === 0) return | ||
// Fatal error conditions | ||
if (end < start) throw new TypeError('sourceEnd < sourceStart') | ||
if (target_start < 0 || target_start >= target.length) | ||
throw new TypeError('targetStart out of bounds') | ||
if (start < 0 || start >= source.length) throw new TypeError('sourceStart out of bounds') | ||
if (end < 0 || end > source.length) throw new TypeError('sourceEnd out of bounds') | ||
// Are we oob? | ||
if (end > this.length) | ||
end = this.length | ||
if (target.length - target_start < end - start) | ||
end = target.length - target_start + start | ||
var len = end - start | ||
if (len < 100 || !Buffer.TYPED_ARRAY_SUPPORT) { | ||
for (var i = 0; i < len; i++) { | ||
target[i + target_start] = this[i + start] | ||
} | ||
} else { | ||
target._set(this.subarray(start, start + len), target_start) | ||
} | ||
} | ||
// fill(value, start=0, end=buffer.length) | ||
Buffer.prototype.fill = function (value, start, end) { | ||
if (!value) value = 0 | ||
if (!start) start = 0 | ||
if (!end) end = this.length | ||
if (end < start) throw new TypeError('end < start') | ||
// Fill 0 bytes; we're done | ||
if (end === start) return | ||
if (this.length === 0) return | ||
if (start < 0 || start >= this.length) throw new TypeError('start out of bounds') | ||
if (end < 0 || end > this.length) throw new TypeError('end out of bounds') | ||
var i | ||
if (typeof value === 'number') { | ||
for (i = start; i < end; i++) { | ||
this[i] = value | ||
} | ||
} else { | ||
var bytes = utf8ToBytes(value.toString()) | ||
var len = bytes.length | ||
for (i = start; i < end; i++) { | ||
this[i] = bytes[i % len] | ||
} | ||
} | ||
return this | ||
} | ||
/** | ||
* Creates a new `ArrayBuffer` with the *copied* memory of the buffer instance. | ||
* Added in Node 0.12. Only available in browsers that support ArrayBuffer. | ||
*/ | ||
Buffer.prototype.toArrayBuffer = function () { | ||
if (typeof Uint8Array !== 'undefined') { | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
return (new Buffer(this)).buffer | ||
} else { | ||
var buf = new Uint8Array(this.length) | ||
for (var i = 0, len = buf.length; i < len; i += 1) { | ||
buf[i] = this[i] | ||
} | ||
return buf.buffer | ||
} | ||
} else { | ||
throw new TypeError('Buffer.toArrayBuffer not supported in this browser') | ||
} | ||
} | ||
// HELPER FUNCTIONS | ||
// ================ | ||
var BP = Buffer.prototype | ||
/** | ||
* Augment a Uint8Array *instance* (not the Uint8Array class!) with Buffer methods | ||
*/ | ||
Buffer._augment = function (arr) { | ||
arr._isBuffer = true | ||
// save reference to original Uint8Array get/set methods before overwriting | ||
arr._get = arr.get | ||
arr._set = arr.set | ||
// deprecated, will be removed in node 0.13+ | ||
arr.get = BP.get | ||
arr.set = BP.set | ||
arr.write = BP.write | ||
arr.toString = BP.toString | ||
arr.toLocaleString = BP.toString | ||
arr.toJSON = BP.toJSON | ||
arr.equals = BP.equals | ||
arr.compare = BP.compare | ||
arr.copy = BP.copy | ||
arr.slice = BP.slice | ||
arr.readUInt8 = BP.readUInt8 | ||
arr.readUInt16LE = BP.readUInt16LE | ||
arr.readUInt16BE = BP.readUInt16BE | ||
arr.readUInt32LE = BP.readUInt32LE | ||
arr.readUInt32BE = BP.readUInt32BE | ||
arr.readInt8 = BP.readInt8 | ||
arr.readInt16LE = BP.readInt16LE | ||
arr.readInt16BE = BP.readInt16BE | ||
arr.readInt32LE = BP.readInt32LE | ||
arr.readInt32BE = BP.readInt32BE | ||
arr.readFloatLE = BP.readFloatLE | ||
arr.readFloatBE = BP.readFloatBE | ||
arr.readDoubleLE = BP.readDoubleLE | ||
arr.readDoubleBE = BP.readDoubleBE | ||
arr.writeUInt8 = BP.writeUInt8 | ||
arr.writeUInt16LE = BP.writeUInt16LE | ||
arr.writeUInt16BE = BP.writeUInt16BE | ||
arr.writeUInt32LE = BP.writeUInt32LE | ||
arr.writeUInt32BE = BP.writeUInt32BE | ||
arr.writeInt8 = BP.writeInt8 | ||
arr.writeInt16LE = BP.writeInt16LE | ||
arr.writeInt16BE = BP.writeInt16BE | ||
arr.writeInt32LE = BP.writeInt32LE | ||
arr.writeInt32BE = BP.writeInt32BE | ||
arr.writeFloatLE = BP.writeFloatLE | ||
arr.writeFloatBE = BP.writeFloatBE | ||
arr.writeDoubleLE = BP.writeDoubleLE | ||
arr.writeDoubleBE = BP.writeDoubleBE | ||
arr.fill = BP.fill | ||
arr.inspect = BP.inspect | ||
arr.toArrayBuffer = BP.toArrayBuffer | ||
return arr | ||
} | ||
var INVALID_BASE64_RE = /[^+\/0-9A-z]/g | ||
function base64clean (str) { | ||
// Node strips out invalid characters like \n and \t from the string, base64-js does not | ||
str = stringtrim(str).replace(INVALID_BASE64_RE, '') | ||
// Node allows for non-padded base64 strings (missing trailing ===), base64-js does not | ||
while (str.length % 4 !== 0) { | ||
str = str + '=' | ||
} | ||
return str | ||
} | ||
function stringtrim (str) { | ||
if (str.trim) return str.trim() | ||
return str.replace(/^\s+|\s+$/g, '') | ||
} | ||
function isArrayish (subject) { | ||
return isArray(subject) || Buffer.isBuffer(subject) || | ||
subject && typeof subject === 'object' && | ||
typeof subject.length === 'number' | ||
} | ||
function toHex (n) { | ||
if (n < 16) return '0' + n.toString(16) | ||
return n.toString(16) | ||
} | ||
function utf8ToBytes (str) { | ||
var byteArray = [] | ||
for (var i = 0; i < str.length; i++) { | ||
var b = str.charCodeAt(i) | ||
if (b <= 0x7F) { | ||
byteArray.push(b) | ||
} else { | ||
var start = i | ||
if (b >= 0xD800 && b <= 0xDFFF) i++ | ||
var h = encodeURIComponent(str.slice(start, i+1)).substr(1).split('%') | ||
for (var j = 0; j < h.length; j++) { | ||
byteArray.push(parseInt(h[j], 16)) | ||
} | ||
} | ||
} | ||
return byteArray | ||
} | ||
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) { | ||
var c, hi, lo | ||
var byteArray = [] | ||
for (var i = 0; i < str.length; i++) { | ||
c = str.charCodeAt(i) | ||
hi = c >> 8 | ||
lo = c % 256 | ||
byteArray.push(lo) | ||
byteArray.push(hi) | ||
} | ||
return byteArray | ||
} | ||
function base64ToBytes (str) { | ||
return base64.toByteArray(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 decodeUtf8Char (str) { | ||
try { | ||
return decodeURIComponent(str) | ||
} catch (err) { | ||
return String.fromCharCode(0xFFFD) // UTF 8 invalid char | ||
} | ||
} | ||
},{"base64-js":1,"ieee754":2,"is-array":3}],1:[function(require,module,exports){ | ||
var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'; | ||
;(function (exports) { | ||
'use strict'; | ||
var Arr = (typeof Uint8Array !== 'undefined') | ||
? Uint8Array | ||
: Array | ||
var ZERO = '0'.charCodeAt(0) | ||
var PLUS = '+'.charCodeAt(0) | ||
var SLASH = '/'.charCodeAt(0) | ||
var NUMBER = '0'.charCodeAt(0) | ||
var LOWER = 'a'.charCodeAt(0) | ||
var UPPER = 'A'.charCodeAt(0) | ||
function decode (elt) { | ||
var code = elt.charCodeAt(0) | ||
if (code === PLUS) | ||
return 62 // '+' | ||
if (code === SLASH) | ||
return 63 // '/' | ||
if (code < NUMBER) | ||
return -1 //no match | ||
if (code < NUMBER + 10) | ||
return code - NUMBER + 26 + 26 | ||
if (code < UPPER + 26) | ||
return code - UPPER | ||
if (code < LOWER + 26) | ||
return code - LOWER + 26 | ||
} | ||
function b64ToByteArray (b64) { | ||
var i, j, l, tmp, placeHolders, arr | ||
if (b64.length % 4 > 0) { | ||
throw new Error('Invalid string. Length must be a multiple of 4') | ||
} | ||
// the number of equal signs (place holders) | ||
// if there are two placeholders, than the two characters before it | ||
// represent one byte | ||
// if there is only one, then the three characters before it represent 2 bytes | ||
// this is just a cheap hack to not do indexOf twice | ||
var len = b64.length | ||
placeHolders = '=' === b64.charAt(len - 2) ? 2 : '=' === b64.charAt(len - 1) ? 1 : 0 | ||
// base64 is 4/3 + up to two characters of the original data | ||
arr = new Arr(b64.length * 3 / 4 - placeHolders) | ||
// if there are placeholders, only get up to the last complete 4 chars | ||
l = placeHolders > 0 ? b64.length - 4 : b64.length | ||
var L = 0 | ||
function push (v) { | ||
arr[L++] = v | ||
} | ||
for (i = 0, j = 0; i < l; i += 4, j += 3) { | ||
tmp = (decode(b64.charAt(i)) << 18) | (decode(b64.charAt(i + 1)) << 12) | (decode(b64.charAt(i + 2)) << 6) | decode(b64.charAt(i + 3)) | ||
push((tmp & 0xFF0000) >> 16) | ||
push((tmp & 0xFF00) >> 8) | ||
push(tmp & 0xFF) | ||
} | ||
if (placeHolders === 2) { | ||
tmp = (decode(b64.charAt(i)) << 2) | (decode(b64.charAt(i + 1)) >> 4) | ||
push(tmp & 0xFF) | ||
} else if (placeHolders === 1) { | ||
tmp = (decode(b64.charAt(i)) << 10) | (decode(b64.charAt(i + 1)) << 4) | (decode(b64.charAt(i + 2)) >> 2) | ||
push((tmp >> 8) & 0xFF) | ||
push(tmp & 0xFF) | ||
} | ||
return arr | ||
} | ||
function uint8ToBase64 (uint8) { | ||
var i, | ||
extraBytes = uint8.length % 3, // if we have 1 byte left, pad 2 bytes | ||
output = "", | ||
temp, length | ||
function encode (num) { | ||
return lookup.charAt(num) | ||
} | ||
function tripletToBase64 (num) { | ||
return encode(num >> 18 & 0x3F) + encode(num >> 12 & 0x3F) + encode(num >> 6 & 0x3F) + encode(num & 0x3F) | ||
} | ||
// go through the array every three bytes, we'll deal with trailing stuff later | ||
for (i = 0, length = uint8.length - extraBytes; i < length; i += 3) { | ||
temp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]) | ||
output += tripletToBase64(temp) | ||
} | ||
// pad the end with zeros, but make sure to not forget the extra bytes | ||
switch (extraBytes) { | ||
case 1: | ||
temp = uint8[uint8.length - 1] | ||
output += encode(temp >> 2) | ||
output += encode((temp << 4) & 0x3F) | ||
output += '==' | ||
break | ||
case 2: | ||
temp = (uint8[uint8.length - 2] << 8) + (uint8[uint8.length - 1]) | ||
output += encode(temp >> 10) | ||
output += encode((temp >> 4) & 0x3F) | ||
output += encode((temp << 2) & 0x3F) | ||
output += '=' | ||
break | ||
} | ||
return output | ||
} | ||
module.exports.toByteArray = b64ToByteArray | ||
module.exports.fromByteArray = uint8ToBase64 | ||
}()) | ||
},{}],2:[function(require,module,exports){ | ||
exports.read = function(buffer, offset, isLE, mLen, nBytes) { | ||
var e, m, | ||
eLen = nBytes * 8 - mLen - 1, | ||
eMax = (1 << eLen) - 1, | ||
eBias = eMax >> 1, | ||
nBits = -7, | ||
i = isLE ? (nBytes - 1) : 0, | ||
d = isLE ? -1 : 1, | ||
s = buffer[offset + i]; | ||
i += d; | ||
e = s & ((1 << (-nBits)) - 1); | ||
s >>= (-nBits); | ||
nBits += eLen; | ||
for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8); | ||
m = e & ((1 << (-nBits)) - 1); | ||
e >>= (-nBits); | ||
nBits += mLen; | ||
for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8); | ||
if (e === 0) { | ||
e = 1 - eBias; | ||
} else if (e === eMax) { | ||
return m ? NaN : ((s ? -1 : 1) * Infinity); | ||
} else { | ||
m = m + Math.pow(2, mLen); | ||
e = e - eBias; | ||
} | ||
return (s ? -1 : 1) * m * Math.pow(2, e - mLen); | ||
}; | ||
exports.write = function(buffer, value, offset, isLE, mLen, nBytes) { | ||
var e, m, c, | ||
eLen = nBytes * 8 - mLen - 1, | ||
eMax = (1 << eLen) - 1, | ||
eBias = eMax >> 1, | ||
rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0), | ||
i = isLE ? 0 : (nBytes - 1), | ||
d = isLE ? 1 : -1, | ||
s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0; | ||
value = Math.abs(value); | ||
if (isNaN(value) || value === Infinity) { | ||
m = isNaN(value) ? 1 : 0; | ||
e = eMax; | ||
} else { | ||
e = Math.floor(Math.log(value) / Math.LN2); | ||
if (value * (c = Math.pow(2, -e)) < 1) { | ||
e--; | ||
c *= 2; | ||
} | ||
if (e + eBias >= 1) { | ||
value += rt / c; | ||
} else { | ||
value += rt * Math.pow(2, 1 - eBias); | ||
} | ||
if (value * c >= 2) { | ||
e++; | ||
c /= 2; | ||
} | ||
if (e + eBias >= eMax) { | ||
m = 0; | ||
e = eMax; | ||
} else if (e + eBias >= 1) { | ||
m = (value * c - 1) * Math.pow(2, mLen); | ||
e = e + eBias; | ||
} else { | ||
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen); | ||
e = 0; | ||
} | ||
} | ||
for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8); | ||
e = (e << mLen) | m; | ||
eLen += mLen; | ||
for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8); | ||
buffer[offset + i - d] |= s * 128; | ||
}; | ||
},{}],3:[function(require,module,exports){ | ||
/** | ||
* isArray | ||
*/ | ||
var isArray = Array.isArray; | ||
/** | ||
* toString | ||
*/ | ||
var str = Object.prototype.toString; | ||
/** | ||
* Whether or not the given `val` | ||
* is an array. | ||
* | ||
* example: | ||
* | ||
* isArray([]); | ||
* // > true | ||
* isArray(arguments); | ||
* // > false | ||
* isArray(''); | ||
* // > false | ||
* | ||
* @param {mixed} val | ||
* @return {bool} | ||
*/ | ||
module.exports = isArray || function (val) { | ||
return !! val && '[object Array]' == str.call(val); | ||
}; | ||
},{}]},{},[]); | ||
;module.exports=require("./").Buffer; | ||
BrowserBuffer#concat x 429,348 ops/sec ±1.31% (87 runs sampled) | ||
Uint8Array#concat x 1,828,396 ops/sec ±1.22% (92 runs sampled) | ||
NodeBuffer#concat x 1,651,417 ops/sec ±1.95% (75 runs sampled) | ||
Fastest is Uint8Array#concat |
@@ -840,3 +840,3 @@ /*! | ||
if (len < 100 || !Buffer.TYPED_ARRAY_SUPPORT) { | ||
if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) { | ||
for (var i = 0; i < len; i++) { | ||
@@ -910,2 +910,3 @@ target[i + target_start] = this[i + start] | ||
Buffer._augment = function (arr) { | ||
arr.constructor = Buffer | ||
arr._isBuffer = true | ||
@@ -912,0 +913,0 @@ |
{ | ||
"name": "buffer", | ||
"description": "Node.js Buffer API, for the browser", | ||
"version": "2.7.0", | ||
"version": "2.8.0", | ||
"author": { | ||
@@ -46,5 +46,4 @@ "name": "Feross Aboukhadijeh", | ||
"test": "tape test/*.js && OBJECT_IMPL=true tape test/*.js", | ||
"prepublish": "./bundle.sh", | ||
"perf": "cd perf/solo && browserify --debug readUInt32BE.js > bundle.js && open index.html", | ||
"perf-node": "node perf/comparison/bracket-notation.js && node perf/comparison/concat.js && node perf/comparison/copy-big.js && node perf/comparison/copy.js && node perf/comparison/new.js && node perf/comparison/readDoubleBE.js && node perf/comparison/readFloatBE.js && node perf/comparison/readUInt32LE.js && node perf/comparison/slice.js && node perf/comparison/writeFloatBE.js", | ||
"perf": "browserify --debug perf/bracket-notation.js > perf/bundle.js && open perf/index.html", | ||
"perf-node": "node perf/bracket-notation.js && node perf/concat.js && node perf/copy-big.js && node perf/copy.js && node perf/new-big.js && node perf/new.js && node perf/readDoubleBE.js && node perf/readFloatBE.js && node perf/readUInt32LE.js && node perf/slice.js && node perf/writeFloatBE.js", | ||
"size": "browserify -r ./ | uglifyjs -c -m | gzip | wc -c" | ||
@@ -51,0 +50,0 @@ }, |
249
README.md
@@ -1,2 +0,2 @@ | ||
# buffer [![build](https://img.shields.io/travis/feross/buffer.svg)](https://travis-ci.org/feross/buffer) [![npm](https://img.shields.io/npm/v/buffer.svg)](https://npmjs.org/package/buffer) [![npm downloads](https://img.shields.io/npm/dm/buffer.svg)](https://npmjs.org/package/buffer) [![gittip](https://img.shields.io/gittip/feross.svg)](https://www.gittip.com/feross/) | ||
# buffer [![build](https://img.shields.io/travis/feross/buffer.svg?style=flat)](https://travis-ci.org/feross/buffer) [![npm](https://img.shields.io/npm/v/buffer.svg?style=flat)](https://npmjs.org/package/buffer) [![npm downloads](https://img.shields.io/npm/dm/buffer.svg?style=flat)](https://npmjs.org/package/buffer) [![gittip](https://img.shields.io/gittip/feross.svg?style=flat)](https://www.gittip.com/feross/) | ||
@@ -103,89 +103,202 @@ #### The buffer module from [node.js](http://nodejs.org/), for the browser. | ||
`BrowserBuffer` is the browser `buffer` module (this repo). `Uint8Array` is included as a | ||
sanity check (since `BrowserBuffer` uses `Uint8Array` under the hood, `Uint8Array` will | ||
always be at least a bit faster). Finally, `NodeBuffer` is the node.js buffer module, | ||
which is included to compare against. | ||
``` | ||
# Chrome 33 | ||
# Chrome 38 | ||
NewBuffer#bracket-notation x 11,194,815 ops/sec ±1.73% (64 runs sampled) | ||
OldBuffer#bracket-notation x 9,546,694 ops/sec ±0.76% (67 runs sampled) | ||
Fastest is NewBuffer#bracket-notation | ||
BrowserBuffer#bracket-notation x 11,457,464 ops/sec ±0.86% (66 runs sampled) bundle.js:5262 | ||
Uint8Array#bracket-notation x 10,824,332 ops/sec ±0.74% (65 runs sampled) bundle.js:5262 | ||
Fastest is BrowserBuffer#bracket-notation | ||
NewBuffer#concat x 949,714 ops/sec ±2.48% (63 runs sampled) | ||
OldBuffer#concat x 634,906 ops/sec ±0.42% (68 runs sampled) | ||
Fastest is NewBuffer#concat | ||
BrowserBuffer#concat x 450,532 ops/sec ±0.76% (68 runs sampled) bundle.js:5267 | ||
Uint8Array#concat x 1,368,911 ops/sec ±1.50% (62 runs sampled) bundle.js:5267 | ||
Fastest is Uint8Array#concat | ||
NewBuffer#copy x 15,436,458 ops/sec ±1.74% (67 runs sampled) | ||
OldBuffer#copy x 3,990,346 ops/sec ±0.42% (68 runs sampled) | ||
Fastest is NewBuffer#copy | ||
BrowserBuffer#copy(16000) x 903,001 ops/sec ±0.96% (67 runs sampled) bundle.js:5261 | ||
Uint8Array#copy(16000) x 1,422,441 ops/sec ±1.04% (66 runs sampled) bundle.js:5261 | ||
Fastest is Uint8Array#copy(16000) | ||
NewBuffer#readDoubleBE x 1,132,954 ops/sec ±2.36% (65 runs sampled) | ||
OldBuffer#readDoubleBE x 846,337 ops/sec ±0.58% (68 runs sampled) | ||
Fastest is NewBuffer#readDoubleBE | ||
BrowserBuffer#copy(16) x 11,431,358 ops/sec ±0.46% (69 runs sampled) bundle.js:5261 | ||
Uint8Array#copy(16) x 13,944,163 ops/sec ±1.12% (68 runs sampled) bundle.js:5261 | ||
Fastest is Uint8Array#copy(16) | ||
NewBuffer#new x 1,419,300 ops/sec ±3.50% (66 runs sampled) | ||
Uint8Array#new x 3,898,573 ops/sec ±0.88% (67 runs sampled) (used internally by NewBuffer) | ||
OldBuffer#new x 2,284,568 ops/sec ±0.57% (67 runs sampled) | ||
Fastest is Uint8Array#new | ||
BrowserBuffer#new(16000) x 106,329 ops/sec ±6.70% (44 runs sampled) bundle.js:5253 | ||
Uint8Array#new(16000) x 131,001 ops/sec ±2.85% (31 runs sampled) bundle.js:5253 | ||
Fastest is Uint8Array#new(16000) | ||
NewBuffer#readFloatBE x 1,203,763 ops/sec ±1.81% (68 runs sampled) | ||
OldBuffer#readFloatBE x 954,923 ops/sec ±0.66% (70 runs sampled) | ||
Fastest is NewBuffer#readFloatBE | ||
BrowserBuffer#new(16) x 1,554,491 ops/sec ±1.60% (65 runs sampled) bundle.js:5253 | ||
Uint8Array#new(16) x 6,623,930 ops/sec ±1.66% (65 runs sampled) bundle.js:5253 | ||
Fastest is Uint8Array#new(16) | ||
NewBuffer#readUInt32LE x 750,341 ops/sec ±1.70% (66 runs sampled) | ||
OldBuffer#readUInt32LE x 1,408,478 ops/sec ±0.60% (68 runs sampled) | ||
Fastest is OldBuffer#readUInt32LE | ||
BrowserBuffer#readDoubleBE x 112,830 ops/sec ±0.51% (69 runs sampled) bundle.js:5274 | ||
DataView#getFloat64 x 93,500 ops/sec ±0.57% (68 runs sampled) bundle.js:5274 | ||
Fastest is BrowserBuffer#readDoubleBE | ||
NewBuffer#slice x 1,802,870 ops/sec ±1.87% (64 runs sampled) | ||
OldBuffer#slice x 1,725,928 ops/sec ±0.74% (68 runs sampled) | ||
Fastest is NewBuffer#slice | ||
BrowserBuffer#readFloatBE x 146,678 ops/sec ±0.95% (68 runs sampled) bundle.js:5274 | ||
DataView#getFloat32 x 99,311 ops/sec ±0.41% (67 runs sampled) bundle.js:5274 | ||
Fastest is BrowserBuffer#readFloatBE | ||
NewBuffer#writeFloatBE x 830,407 ops/sec ±3.09% (66 runs sampled) | ||
OldBuffer#writeFloatBE x 508,446 ops/sec ±0.49% (69 runs sampled) | ||
Fastest is NewBuffer#writeFloatBE | ||
BrowserBuffer#readUInt32LE x 843,214 ops/sec ±0.70% (69 runs sampled) bundle.js:5274 | ||
DataView#getUint32 x 103,024 ops/sec ±0.64% (67 runs sampled) bundle.js:5274 | ||
Fastest is BrowserBuffer#readUInt32LE | ||
# Node 0.11 | ||
BrowserBuffer#slice x 1,013,941 ops/sec ±0.75% (67 runs sampled) bundle.js:5257 | ||
Uint8Array#subarray x 1,903,928 ops/sec ±0.53% (67 runs sampled) bundle.js:5257 | ||
Fastest is Uint8Array#subarray | ||
NewBuffer#bracket-notation x 10,912,085 ops/sec ±0.89% (92 runs sampled) | ||
OldBuffer#bracket-notation x 9,051,638 ops/sec ±0.84% (92 runs sampled) | ||
Buffer#bracket-notation x 10,721,608 ops/sec ±0.63% (91 runs sampled) | ||
Fastest is NewBuffer#bracket-notation | ||
BrowserBuffer#writeFloatBE x 61,387 ops/sec ±0.90% (67 runs sampled) bundle.js:5231 | ||
DataView#setFloat32 x 141,249 ops/sec ±0.40% (66 runs sampled) bundle.js:5231 | ||
Fastest is DataView#setFloat32 | ||
NewBuffer#concat x 1,438,825 ops/sec ±1.80% (91 runs sampled) | ||
OldBuffer#concat x 888,614 ops/sec ±2.09% (93 runs sampled) | ||
Buffer#concat x 1,832,307 ops/sec ±1.20% (90 runs sampled) | ||
Fastest is Buffer#concat | ||
# Firefox 33 | ||
NewBuffer#copy x 5,987,167 ops/sec ±0.85% (94 runs sampled) | ||
OldBuffer#copy x 3,892,165 ops/sec ±1.28% (93 runs sampled) | ||
Buffer#copy x 11,208,889 ops/sec ±0.76% (91 runs sampled) | ||
Fastest is Buffer#copy | ||
"BrowserBuffer#bracket-notation x 20,800,421 ops/sec ±1.84% (60 runs sampled)" bundle.js:5262 | ||
"Uint8Array#bracket-notation x 20,826,235 ops/sec ±2.02% (61 runs sampled)" bundle.js:5262 | ||
"Fastest is BrowserBuffer#bracket-notation,Uint8Array#bracket-notation" | ||
NewBuffer#readDoubleBE x 1,057,233 ops/sec ±1.28% (88 runs sampled) | ||
OldBuffer#readDoubleBE x 4,094 ops/sec ±1.09% (86 runs sampled) | ||
Buffer#readDoubleBE x 1,587,308 ops/sec ±0.87% (84 runs sampled) | ||
Fastest is Buffer#readDoubleBE | ||
"BrowserBuffer#concat x 153,076 ops/sec ±2.32% (61 runs sampled)" bundle.js:5267 | ||
"Uint8Array#concat x 1,255,674 ops/sec ±8.65% (52 runs sampled)" bundle.js:5267 | ||
"Fastest is Uint8Array#concat" | ||
NewBuffer#new x 739,791 ops/sec ±0.89% (89 runs sampled) | ||
Uint8Array#new x 2,745,243 ops/sec ±0.95% (91 runs sampled) | ||
OldBuffer#new x 2,604,537 ops/sec ±0.93% (88 runs sampled) | ||
Buffer#new x 1,836,218 ops/sec ±0.74% (92 runs sampled) | ||
Fastest is Uint8Array#new | ||
"BrowserBuffer#copy(16000) x 1,105,312 ops/sec ±1.16% (63 runs sampled)" bundle.js:5261 | ||
"Uint8Array#copy(16000) x 1,615,911 ops/sec ±0.55% (66 runs sampled)" bundle.js:5261 | ||
"Fastest is Uint8Array#copy(16000)" | ||
NewBuffer#readFloatBE x 1,111,263 ops/sec ±0.41% (97 runs sampled) | ||
OldBuffer#readFloatBE x 4,026 ops/sec ±1.24% (90 runs sampled) | ||
Buffer#readFloatBE x 1,611,800 ops/sec ±0.58% (96 runs sampled) | ||
Fastest is Buffer#readFloatBE | ||
"BrowserBuffer#copy(16) x 16,357,599 ops/sec ±0.73% (68 runs sampled)" bundle.js:5261 | ||
"Uint8Array#copy(16) x 31,436,281 ops/sec ±1.05% (68 runs sampled)" bundle.js:5261 | ||
"Fastest is Uint8Array#copy(16)" | ||
NewBuffer#readUInt32LE x 502,024 ops/sec ±0.59% (94 runs sampled) | ||
OldBuffer#readUInt32LE x 1,259,028 ops/sec ±0.79% (87 runs sampled) | ||
Buffer#readUInt32LE x 2,778,635 ops/sec ±0.46% (97 runs sampled) | ||
Fastest is Buffer#readUInt32LE | ||
"BrowserBuffer#new(16000) x 52,995 ops/sec ±6.01% (35 runs sampled)" bundle.js:5253 | ||
"Uint8Array#new(16000) x 87,686 ops/sec ±5.68% (45 runs sampled)" bundle.js:5253 | ||
"Fastest is Uint8Array#new(16000)" | ||
NewBuffer#slice x 1,174,908 ops/sec ±1.47% (89 runs sampled) | ||
OldBuffer#slice x 2,396,302 ops/sec ±4.36% (86 runs sampled) | ||
Buffer#slice x 2,994,029 ops/sec ±0.79% (89 runs sampled) | ||
Fastest is Buffer#slice | ||
"BrowserBuffer#new(16) x 252,031 ops/sec ±1.61% (66 runs sampled)" bundle.js:5253 | ||
"Uint8Array#new(16) x 8,477,026 ops/sec ±0.49% (68 runs sampled)" bundle.js:5253 | ||
"Fastest is Uint8Array#new(16)" | ||
NewBuffer#writeFloatBE x 721,081 ops/sec ±1.10% (86 runs sampled) | ||
OldBuffer#writeFloatBE x 4,020 ops/sec ±1.04% (92 runs sampled) | ||
Buffer#writeFloatBE x 1,811,134 ops/sec ±0.67% (91 runs sampled) | ||
Fastest is Buffer#writeFloatBE | ||
"BrowserBuffer#readDoubleBE x 99,871 ops/sec ±0.41% (69 runs sampled)" bundle.js:5274 | ||
"DataView#getFloat64 x 285,663 ops/sec ±0.70% (68 runs sampled)" bundle.js:5274 | ||
"Fastest is DataView#getFloat64" | ||
"BrowserBuffer#readFloatBE x 115,540 ops/sec ±0.42% (69 runs sampled)" bundle.js:5274 | ||
"DataView#getFloat32 x 288,722 ops/sec ±0.82% (68 runs sampled)" bundle.js:5274 | ||
"Fastest is DataView#getFloat32" | ||
"BrowserBuffer#readUInt32LE x 633,926 ops/sec ±1.08% (67 runs sampled)" bundle.js:5274 | ||
"DataView#getUint32 x 294,808 ops/sec ±0.79% (64 runs sampled)" bundle.js:5274 | ||
"Fastest is BrowserBuffer#readUInt32LE" | ||
"BrowserBuffer#slice x 349,425 ops/sec ±0.46% (69 runs sampled)" bundle.js:5257 | ||
"Uint8Array#subarray x 5,965,819 ops/sec ±0.60% (65 runs sampled)" bundle.js:5257 | ||
"Fastest is Uint8Array#subarray" | ||
"BrowserBuffer#writeFloatBE x 59,980 ops/sec ±0.41% (67 runs sampled)" bundle.js:5231 | ||
"DataView#setFloat32 x 317,634 ops/sec ±0.63% (68 runs sampled)" bundle.js:5231 | ||
"Fastest is DataView#setFloat32" | ||
# Safari 8 | ||
[Log] BrowserBuffer#bracket-notation x 10,279,729 ops/sec ±2.25% (56 runs sampled) (bundle.js, line 5262) | ||
[Log] Uint8Array#bracket-notation x 10,030,767 ops/sec ±2.23% (59 runs sampled) (bundle.js, line 5262) | ||
[Log] Fastest is BrowserBuffer#bracket-notation,Uint8Array#bracket-notation (bundle.js, line 5265) | ||
[Log] BrowserBuffer#concat x 144,138 ops/sec ±1.38% (65 runs sampled) (bundle.js, line 5267) | ||
[Log] Uint8Array#concat x 4,950,764 ops/sec ±1.70% (63 runs sampled) (bundle.js, line 5267) | ||
[Log] Fastest is Uint8Array#concat (bundle.js, line 5270) | ||
[Log] BrowserBuffer#copy(16000) x 1,058,548 ops/sec ±1.51% (64 runs sampled) (bundle.js, line 5261) | ||
[Log] Uint8Array#copy(16000) x 1,409,666 ops/sec ±1.17% (65 runs sampled) (bundle.js, line 5261) | ||
[Log] Fastest is Uint8Array#copy(16000) (bundle.js, line 5264) | ||
[Log] BrowserBuffer#copy(16) x 6,282,529 ops/sec ±1.88% (58 runs sampled) (bundle.js, line 5261) | ||
[Log] Uint8Array#copy(16) x 11,907,128 ops/sec ±2.87% (58 runs sampled) (bundle.js, line 5261) | ||
[Log] Fastest is Uint8Array#copy(16) (bundle.js, line 5264) | ||
[Log] BrowserBuffer#new(16000) x 101,663 ops/sec ±3.89% (57 runs sampled) (bundle.js, line 5253) | ||
[Log] Uint8Array#new(16000) x 22,050,818 ops/sec ±6.51% (46 runs sampled) (bundle.js, line 5253) | ||
[Log] Fastest is Uint8Array#new(16000) (bundle.js, line 5256) | ||
[Log] BrowserBuffer#new(16) x 176,072 ops/sec ±2.13% (64 runs sampled) (bundle.js, line 5253) | ||
[Log] Uint8Array#new(16) x 24,385,731 ops/sec ±5.01% (51 runs sampled) (bundle.js, line 5253) | ||
[Log] Fastest is Uint8Array#new(16) (bundle.js, line 5256) | ||
[Log] BrowserBuffer#readDoubleBE x 41,341 ops/sec ±1.06% (67 runs sampled) (bundle.js, line 5274) | ||
[Log] DataView#getFloat64 x 322,280 ops/sec ±0.84% (68 runs sampled) (bundle.js, line 5274) | ||
[Log] Fastest is DataView#getFloat64 (bundle.js, line 5277) | ||
[Log] BrowserBuffer#readFloatBE x 46,141 ops/sec ±1.06% (65 runs sampled) (bundle.js, line 5274) | ||
[Log] DataView#getFloat32 x 337,025 ops/sec ±0.43% (69 runs sampled) (bundle.js, line 5274) | ||
[Log] Fastest is DataView#getFloat32 (bundle.js, line 5277) | ||
[Log] BrowserBuffer#readUInt32LE x 151,551 ops/sec ±1.02% (66 runs sampled) (bundle.js, line 5274) | ||
[Log] DataView#getUint32 x 308,278 ops/sec ±0.94% (67 runs sampled) (bundle.js, line 5274) | ||
[Log] Fastest is DataView#getUint32 (bundle.js, line 5277) | ||
[Log] BrowserBuffer#slice x 197,365 ops/sec ±0.95% (66 runs sampled) (bundle.js, line 5257) | ||
[Log] Uint8Array#subarray x 9,558,024 ops/sec ±3.08% (58 runs sampled) (bundle.js, line 5257) | ||
[Log] Fastest is Uint8Array#subarray (bundle.js, line 5260) | ||
[Log] BrowserBuffer#writeFloatBE x 17,518 ops/sec ±1.03% (63 runs sampled) (bundle.js, line 5231) | ||
[Log] DataView#setFloat32 x 319,751 ops/sec ±0.48% (68 runs sampled) (bundle.js, line 5231) | ||
[Log] Fastest is DataView#setFloat32 (bundle.js, line 5234) | ||
# Node 0.11.14 | ||
BrowserBuffer#bracket-notation x 10,489,828 ops/sec ±3.25% (90 runs sampled) | ||
Uint8Array#bracket-notation x 10,534,884 ops/sec ±0.81% (92 runs sampled) | ||
NodeBuffer#bracket-notation x 10,389,910 ops/sec ±0.97% (87 runs sampled) | ||
Fastest is Uint8Array#bracket-notation,BrowserBuffer#bracket-notation | ||
BrowserBuffer#concat x 487,830 ops/sec ±2.58% (88 runs sampled) | ||
Uint8Array#concat x 1,814,327 ops/sec ±1.28% (88 runs sampled) | ||
NodeBuffer#concat x 1,636,523 ops/sec ±1.88% (73 runs sampled) | ||
Fastest is Uint8Array#concat | ||
BrowserBuffer#copy(16000) x 1,073,665 ops/sec ±0.77% (90 runs sampled) | ||
Uint8Array#copy(16000) x 1,348,517 ops/sec ±0.84% (89 runs sampled) | ||
NodeBuffer#copy(16000) x 1,289,533 ops/sec ±0.82% (93 runs sampled) | ||
Fastest is Uint8Array#copy(16000) | ||
BrowserBuffer#copy(16) x 12,782,706 ops/sec ±0.74% (85 runs sampled) | ||
Uint8Array#copy(16) x 14,180,427 ops/sec ±0.93% (92 runs sampled) | ||
NodeBuffer#copy(16) x 11,083,134 ops/sec ±1.06% (89 runs sampled) | ||
Fastest is Uint8Array#copy(16) | ||
BrowserBuffer#new(16000) x 141,678 ops/sec ±3.30% (67 runs sampled) | ||
Uint8Array#new(16000) x 161,491 ops/sec ±2.96% (60 runs sampled) | ||
NodeBuffer#new(16000) x 292,699 ops/sec ±3.20% (55 runs sampled) | ||
Fastest is NodeBuffer#new(16000) | ||
BrowserBuffer#new(16) x 1,655,466 ops/sec ±2.41% (82 runs sampled) | ||
Uint8Array#new(16) x 14,399,926 ops/sec ±0.91% (94 runs sampled) | ||
NodeBuffer#new(16) x 3,894,696 ops/sec ±0.88% (92 runs sampled) | ||
Fastest is Uint8Array#new(16) | ||
BrowserBuffer#readDoubleBE x 109,582 ops/sec ±0.75% (93 runs sampled) | ||
DataView#getFloat64 x 91,235 ops/sec ±0.81% (90 runs sampled) | ||
NodeBuffer#readDoubleBE x 88,593 ops/sec ±0.96% (81 runs sampled) | ||
Fastest is BrowserBuffer#readDoubleBE | ||
BrowserBuffer#readFloatBE x 139,854 ops/sec ±1.03% (85 runs sampled) | ||
DataView#getFloat32 x 98,744 ops/sec ±0.80% (89 runs sampled) | ||
NodeBuffer#readFloatBE x 92,769 ops/sec ±0.94% (93 runs sampled) | ||
Fastest is BrowserBuffer#readFloatBE | ||
BrowserBuffer#readUInt32LE x 710,861 ops/sec ±0.82% (92 runs sampled) | ||
DataView#getUint32 x 117,893 ops/sec ±0.84% (91 runs sampled) | ||
NodeBuffer#readUInt32LE x 851,412 ops/sec ±0.72% (93 runs sampled) | ||
Fastest is NodeBuffer#readUInt32LE | ||
BrowserBuffer#slice x 1,673,877 ops/sec ±0.73% (94 runs sampled) | ||
Uint8Array#subarray x 6,919,243 ops/sec ±0.67% (90 runs sampled) | ||
NodeBuffer#slice x 4,617,604 ops/sec ±0.79% (93 runs sampled) | ||
Fastest is Uint8Array#subarray | ||
BrowserBuffer#writeFloatBE x 66,011 ops/sec ±0.75% (93 runs sampled) | ||
DataView#setFloat32 x 127,760 ops/sec ±0.72% (93 runs sampled) | ||
NodeBuffer#writeFloatBE x 103,352 ops/sec ±0.83% (93 runs sampled) | ||
Fastest is DataView#setFloat32 | ||
``` | ||
@@ -192,0 +305,0 @@ |
@@ -5,4 +5,16 @@ var B = require('../').Buffer | ||
test('convert to Uint8Array in modern browsers', function (t) { | ||
if (B.TYPED_ARRAY_SUPPORT) { | ||
var buf = new B([1, 2]) | ||
var uint8array = new Uint8Array(buf.buffer) | ||
t.ok(uint8array instanceof Uint8Array) | ||
t.equal(uint8array[0], 1) | ||
t.equal(uint8array[1], 2) | ||
} else { | ||
t.pass('object impl: skipping test') | ||
} | ||
t.end() | ||
}) | ||
test('indexes from a string', function(t) { | ||
test('indexes from a string', function (t) { | ||
var buf = new B('abc') | ||
@@ -15,3 +27,3 @@ t.equal(buf[0], 97) | ||
test('indexes from an array', function(t) { | ||
test('indexes from an array', function (t) { | ||
var buf = new B([ 97, 98, 99 ]) | ||
@@ -24,3 +36,3 @@ t.equal(buf[0], 97) | ||
test('setting index value should modify buffer contents', function(t) { | ||
test('setting index value should modify buffer contents', function (t) { | ||
var buf = new B([ 97, 98, 99 ]) | ||
@@ -39,3 +51,3 @@ t.equal(buf[2], 99) | ||
if (Buffer.TYPED_ARRAY_SUPPORT) { | ||
if (B.TYPED_ARRAY_SUPPORT) { | ||
// This does not work with the object implementation -- nothing we can do! | ||
@@ -42,0 +54,0 @@ buf[0] = -3 |
@@ -69,3 +69,3 @@ var B = require('../').Buffer | ||
test('hex of write{Uint,Int}{8,16,32}{LE,BE} with overflow', function (t) { | ||
if (!Buffer.TYPED_ARRAY_SUPPORT) { | ||
if (!B.TYPED_ARRAY_SUPPORT) { | ||
t.pass('object impl: skipping overflow test') | ||
@@ -72,0 +72,0 @@ t.end() |
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Major refactor
Supply chain riskPackage has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
Uses eval
Supply chain riskPackage uses dynamic code execution (e.g., eval()), which is a dangerous practice. This can prevent the code from running in certain environments and increases the risk that the code may contain exploits or malicious behavior.
Found 1 instance in 1 package
Dynamic require
Supply chain riskDynamic require can indicate the package is performing dangerous or unsafe dynamic code execution.
Found 1 instance in 1 package
Environment variable access
Supply chain riskPackage accesses environment variables, which may be a sign of credential stuffing or data theft.
Found 1 instance in 1 package
314
11
1
66686
19
1631