Update

16 files changed, 5370 insertions, 0 deletions

diff --git a/alarm/node_modules/xxhashjs/History.md b/alarm/node_modules/xxhashjs/History.md
new file mode 100644
index 0000000..e377614
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/History.md
@@ -0,0 +1,35 @@
+0.1.0 / 2015-03-12
+==================
+
+* Fix for issue #5: convert all strings to utf-8
+
+0.0.5 / 2014-05-19
+==================
+
+* Added ArrayBuffer support
+
+0.0.4 / 2014-04-25
+==================
+
+* Fixed undefined Buffer in browsers
+
+0.0.3 / 2014-03-21
+==================
+
+* fixed update() on values < 16
+
+0.0.2 / 2014-01-19
+==================
+
+* added tests
+* updated README
+
+0.0.1 / 2014-01-01
+==================
+
+* Improved performance on large inputs (112Mb sample file in 4s instead of 4.6s)
+
+0.0.0 / 2013-12-31
+==================
+
+* Initial release
diff --git a/alarm/node_modules/xxhashjs/LICENSE b/alarm/node_modules/xxhashjs/LICENSE
new file mode 100644
index 0000000..969d061
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/LICENSE
@@ -0,0 +1,17 @@
+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.
diff --git a/alarm/node_modules/xxhashjs/README.md b/alarm/node_modules/xxhashjs/README.md
new file mode 100644
index 0000000..16c8267
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/README.md
@@ -0,0 +1,90 @@
+# Javascript implementation of xxHash
+
+## Synopsis
+
+xxHash is a very fast hashing algorithm (see the details [here](https://code.google.com/p/xxhash/)). xxhashjs is a Javascript implementation of it, written in 100% Javascript. Although not as fast as the C version, it does perform pretty well given the current Javascript limitations in handling unsigned 32 bits integers.
+
+
+## Installation
+
+In nodejs:
+
+    npm install xxhashjs
+
+In the browser, include the following, and access the constructor with _XXH_:
+
+```javascript
+<script src="/your/path/to/xxhash.js"></script>
+```
+
+
+## Examples
+
+* In one step:
+```javascript
+var h = XXH.h32( 'abcd', 0xABCD ).toString(16)	// seed = 0xABCD
+```
+> 0xCDA8FAE4
+
+* In several steps (useful in conjunction of NodeJS streams):
+```javascript
+var H = XXH.h32( 0xABCD )	// seed = 0xABCD
+var h = H.update( 'abcd' ).digest().toString(16)
+```
+> 0xCDA8FAE4
+
+* More examples in the examples directory:
+	* Compute xxHash from a file data
+	* Use xxHashjs in the browser
+
+
+## Usage
+
+* XXH makes 2 functions available for 32 bits XXH and 64 bits XXH respectively, with the same signature:
+
+	* XXH.h32
+	* XXH.h64
+
+* In one step:
+`XXH.h32(<data>, <seed>)`
+The data can either be a string, an ArrayBuffer or a NodeJS Buffer object.
+The seed can either be a number or a UINT32 object.
+
+* In several steps:
+	* instantiate a new XXH object H:
+`XXH.h32(<seed>)` or `XXH.h32()`
+The seed can be set later on with the `init` method
+
+	* add data to the hash calculation:
+`H.update(<data>)`
+
+	* finish the calculations:
+`H.digest()`
+
+The object returned can be converted to a string with `toString(<radix>)` or a number `toNumber()`.
+Once `digest()` has been called, the object can be reused. The same seed will be used or it can be changed with `init(<seed>)`.
+
+
+## Methods
+
+* `XXH.h32()`
+	* `.init(<seed>)`
+	Initialize the XXH object with the given seed. The seed can either be a number or a UINT32 object.
+	* `.update(<data>)`
+	Add data for hashing. The data can either be a string, an ArrayBuffer or a NodeJS Buffer object.
+
+* `digest()` (_UINT32_)
+	Finalize the hash calculations and returns an UINT32 object. The hash value can be retrieved with toString(<radix>).
+
+* `XXH.h64()`
+	* `.init(<seed>)`
+	Initialize the XXH object with the given seed. The seed can either be a number or a UINT64 object.
+	* `.update(<data>)`
+	Add data for hashing. The data can either be a string, an ArrayBuffer or a NodeJS Buffer object.
+	* `.digest()` (_UINT64_)
+	Finalize the hash calculations and returns an UINT64 object. The hash value can be retrieved with toString(<radix>).
+
+
+## License
+
+MIT
\ No newline at end of file
diff --git a/alarm/node_modules/xxhashjs/bower.json b/alarm/node_modules/xxhashjs/bower.json
new file mode 100644
index 0000000..66e5235
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/bower.json
@@ -0,0 +1,27 @@
+{
+  "name": "xxhash",
+  "version": "0.2.1",
+  "homepage": "https://github.com/pierrec/js-xxhash",
+  "authors": [
+    "Pierre Curto <pierre.curto@gmail.com>"
+  ],
+  "description": "xxHash - fast 32 and 64 bits hashing algorithm",
+  "main": "build/xxhash.js",
+  "moduleType": [
+    "amd"
+  , "globals"
+  , "node"
+  ],
+  "keywords": [
+    "hash"
+  , "xxhash"
+  ],
+  "license": "MIT",
+  "ignore": [
+    "**/.*"
+  , "node_modules"
+  , "bower_components"
+  , "test"
+  , "tests"
+  ]
+}
diff --git a/alarm/node_modules/xxhashjs/build/xxhash.js b/alarm/node_modules/xxhashjs/build/xxhash.js
new file mode 100644
index 0000000..a46c0e0
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/build/xxhash.js
@@ -0,0 +1,4101 @@
+(function webpackUniversalModuleDefinition(root, factory) {
+	if(typeof exports === 'object' && typeof module === 'object')
+		module.exports = factory();
+	else if(typeof define === 'function' && define.amd)
+		define([], factory);
+	else if(typeof exports === 'object')
+		exports["XXH"] = factory();
+	else
+		root["XXH"] = factory();
+})(typeof self !== 'undefined' ? self : this, function() {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ 	// The module cache
+/******/ 	var installedModules = {};
+/******/
+/******/ 	// The require function
+/******/ 	function __webpack_require__(moduleId) {
+/******/
+/******/ 		// Check if module is in cache
+/******/ 		if(installedModules[moduleId]) {
+/******/ 			return installedModules[moduleId].exports;
+/******/ 		}
+/******/ 		// Create a new module (and put it into the cache)
+/******/ 		var module = installedModules[moduleId] = {
+/******/ 			i: moduleId,
+/******/ 			l: false,
+/******/ 			exports: {}
+/******/ 		};
+/******/
+/******/ 		// Execute the module function
+/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
+/******/
+/******/ 		// Flag the module as loaded
+/******/ 		module.l = true;
+/******/
+/******/ 		// Return the exports of the module
+/******/ 		return module.exports;
+/******/ 	}
+/******/
+/******/
+/******/ 	// expose the modules object (__webpack_modules__)
+/******/ 	__webpack_require__.m = modules;
+/******/
+/******/ 	// expose the module cache
+/******/ 	__webpack_require__.c = installedModules;
+/******/
+/******/ 	// define getter function for harmony exports
+/******/ 	__webpack_require__.d = function(exports, name, getter) {
+/******/ 		if(!__webpack_require__.o(exports, name)) {
+/******/ 			Object.defineProperty(exports, name, {
+/******/ 				configurable: false,
+/******/ 				enumerable: true,
+/******/ 				get: getter
+/******/ 			});
+/******/ 		}
+/******/ 	};
+/******/
+/******/ 	// getDefaultExport function for compatibility with non-harmony modules
+/******/ 	__webpack_require__.n = function(module) {
+/******/ 		var getter = module && module.__esModule ?
+/******/ 			function getDefault() { return module['default']; } :
+/******/ 			function getModuleExports() { return module; };
+/******/ 		__webpack_require__.d(getter, 'a', getter);
+/******/ 		return getter;
+/******/ 	};
+/******/
+/******/ 	// Object.prototype.hasOwnProperty.call
+/******/ 	__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
+/******/
+/******/ 	// __webpack_public_path__
+/******/ 	__webpack_require__.p = "";
+/******/
+/******/ 	// Load entry module and return exports
+/******/ 	return __webpack_require__(__webpack_require__.s = 2);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+/* WEBPACK VAR INJECTION */(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 */
+
+
+
+var base64 = __webpack_require__(5)
+var ieee754 = __webpack_require__(6)
+var isArray = __webpack_require__(7)
+
+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
+}
+
+/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(4)))
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __webpack_require__) {
+
+exports.UINT32 = __webpack_require__(8)
+exports.UINT64 = __webpack_require__(9)
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+module.exports = {
+	h32: __webpack_require__(3)
+,	h64: __webpack_require__(10)
+}
+
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* WEBPACK VAR INJECTION */(function(Buffer) {/**
+xxHash implementation in pure Javascript
+
+Copyright (C) 2013, Pierre Curto
+MIT license
+*/
+var UINT32 = __webpack_require__(1).UINT32
+
+/*
+	Merged this sequence of method calls as it speeds up
+	the calculations by a factor of 2
+ */
+// this.v1.add( other.multiply(PRIME32_2) ).rotl(13).multiply(PRIME32_1);
+UINT32.prototype.xxh_update = function (low, high) {
+	var b00 = PRIME32_2._low
+	var b16 = PRIME32_2._high
+
+	var c16, c00
+	c00 = low * b00
+	c16 = c00 >>> 16
+
+	c16 += high * b00
+	c16 &= 0xFFFF		// Not required but improves performance
+	c16 += low * b16
+
+	var a00 = this._low + (c00 & 0xFFFF)
+	var a16 = a00 >>> 16
+
+	a16 += this._high + (c16 & 0xFFFF)
+
+	var v = (a16 << 16) | (a00 & 0xFFFF)
+	v = (v << 13) | (v >>> 19)
+
+	a00 = v & 0xFFFF
+	a16 = v >>> 16
+
+	b00 = PRIME32_1._low
+	b16 = PRIME32_1._high
+
+	c00 = a00 * b00
+	c16 = c00 >>> 16
+
+	c16 += a16 * b00
+	c16 &= 0xFFFF		// Not required but improves performance
+	c16 += a00 * b16
+
+	this._low = c00 & 0xFFFF
+	this._high = c16 & 0xFFFF
+}
+
+/*
+ * Constants
+ */
+var PRIME32_1 = UINT32( '2654435761' )
+var PRIME32_2 = UINT32( '2246822519' )
+var PRIME32_3 = UINT32( '3266489917' )
+var PRIME32_4 = UINT32(  '668265263' )
+var PRIME32_5 = UINT32(  '374761393' )
+
+/**
+* Convert string to proper UTF-8 array
+* @param str Input string
+* @returns {Uint8Array} UTF8 array is returned as uint8 array
+*/
+function toUTF8Array (str) {
+	var utf8 = []
+	for (var i=0, n=str.length; i < n; i++) {
+		var charcode = str.charCodeAt(i)
+		if (charcode < 0x80) utf8.push(charcode)
+		else if (charcode < 0x800) {
+			utf8.push(0xc0 | (charcode >> 6),
+			0x80 | (charcode & 0x3f))
+		}
+		else if (charcode < 0xd800 || charcode >= 0xe000) {
+			utf8.push(0xe0 | (charcode >> 12),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+		// surrogate pair
+		else {
+			i++;
+			// UTF-16 encodes 0x10000-0x10FFFF by
+			// subtracting 0x10000 and splitting the
+			// 20 bits of 0x0-0xFFFFF into two halves
+			charcode = 0x10000 + (((charcode & 0x3ff)<<10)
+			| (str.charCodeAt(i) & 0x3ff))
+			utf8.push(0xf0 | (charcode >>18),
+			0x80 | ((charcode>>12) & 0x3f),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+	}
+
+	return new Uint8Array(utf8)
+}
+
+/**
+ * XXH object used as a constructor or a function
+ * @constructor
+ * or
+ * @param {Object|String} input data
+ * @param {Number|UINT32} seed
+ * @return ThisExpression
+ * or
+ * @return {UINT32} xxHash
+ */
+function XXH () {
+	if (arguments.length == 2)
+		return new XXH( arguments[1] ).update( arguments[0] ).digest()
+
+	if (!(this instanceof XXH))
+		return new XXH( arguments[0] )
+
+	init.call(this, arguments[0])
+}
+
+/**
+ * Initialize the XXH instance with the given seed
+ * @method init
+ * @param {Number|Object} seed as a number or an unsigned 32 bits integer
+ * @return ThisExpression
+ */
+ function init (seed) {
+	this.seed = seed instanceof UINT32 ? seed.clone() : UINT32(seed)
+	this.v1 = this.seed.clone().add(PRIME32_1).add(PRIME32_2)
+	this.v2 = this.seed.clone().add(PRIME32_2)
+	this.v3 = this.seed.clone()
+	this.v4 = this.seed.clone().subtract(PRIME32_1)
+	this.total_len = 0
+	this.memsize = 0
+	this.memory = null
+
+	return this
+}
+XXH.prototype.init = init
+
+/**
+ * Add data to be computed for the XXH hash
+ * @method update
+ * @param {String|Buffer|ArrayBuffer} input as a string or nodejs Buffer or ArrayBuffer
+ * @return ThisExpression
+ */
+XXH.prototype.update = function (input) {
+	var isString = typeof input == 'string'
+	var isArrayBuffer
+
+	// Convert all strings to utf-8 first (issue #5)
+	if (isString) {
+		input = toUTF8Array(input)
+		isString = false
+		isArrayBuffer = true
+	}
+
+	if (typeof ArrayBuffer !== "undefined" && input instanceof ArrayBuffer)
+	{
+		isArrayBuffer = true
+		input = new Uint8Array(input);
+	}
+
+	var p = 0
+	var len = input.length
+	var bEnd = p + len
+
+	if (len == 0) return this
+
+	this.total_len += len
+
+	if (this.memsize == 0)
+	{
+		if (isString) {
+			this.memory = ''
+		} else if (isArrayBuffer) {
+			this.memory = new Uint8Array(16)
+		} else {
+			this.memory = new Buffer(16)
+		}
+	}
+
+	if (this.memsize + len < 16)   // fill in tmp buffer
+	{
+		// XXH_memcpy(this.memory + this.memsize, input, len)
+		if (isString) {
+			this.memory += input
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, len), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, len )
+		}
+
+		this.memsize += len
+		return this
+	}
+
+	if (this.memsize > 0)   // some data left from previous update
+	{
+		// XXH_memcpy(this.memory + this.memsize, input, 16-this.memsize);
+		if (isString) {
+			this.memory += input.slice(0, 16 - this.memsize)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, 16 - this.memsize), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, 16 - this.memsize )
+		}
+
+		var p32 = 0
+		if (isString) {
+			this.v1.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+			p32 += 4
+			this.v2.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+			p32 += 4
+			this.v3.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+			p32 += 4
+			this.v4.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+		} else {
+			this.v1.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+			p32 += 4
+			this.v2.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+			p32 += 4
+			this.v3.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+			p32 += 4
+			this.v4.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+		}
+
+		p += 16 - this.memsize
+		this.memsize = 0
+		if (isString) this.memory = ''
+	}
+
+	if (p <= bEnd - 16)
+	{
+		var limit = bEnd - 16
+
+		do
+		{
+			if (isString) {
+				this.v1.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+				p += 4
+				this.v2.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+				p += 4
+				this.v3.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+				p += 4
+				this.v4.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+			} else {
+				this.v1.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+				p += 4
+				this.v2.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+				p += 4
+				this.v3.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+				p += 4
+				this.v4.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+			}
+			p += 4
+		} while (p <= limit)
+	}
+
+	if (p < bEnd)
+	{
+		// XXH_memcpy(this.memory, p, bEnd-p);
+		if (isString) {
+			this.memory += input.slice(p)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(p, bEnd), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, p, bEnd )
+		}
+
+		this.memsize = bEnd - p
+	}
+
+	return this
+}
+
+/**
+ * Finalize the XXH computation. The XXH instance is ready for reuse for the given seed
+ * @method digest
+ * @return {UINT32} xxHash
+ */
+XXH.prototype.digest = function () {
+	var input = this.memory
+	var isString = typeof input == 'string'
+	var p = 0
+	var bEnd = this.memsize
+	var h32, h
+	var u = new UINT32
+
+	if (this.total_len >= 16)
+	{
+		h32 = this.v1.rotl(1).add( this.v2.rotl(7).add( this.v3.rotl(12).add( this.v4.rotl(18) ) ) )
+	}
+	else
+	{
+		h32  = this.seed.clone().add( PRIME32_5 )
+	}
+
+	h32.add( u.fromNumber(this.total_len) )
+
+	while (p <= bEnd - 4)
+	{
+		if (isString) {
+			u.fromBits(
+				(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+			,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+			)
+		} else {
+			u.fromBits(
+				(input[p+1] << 8) | input[p]
+			,	(input[p+3] << 8) | input[p+2]
+			)
+		}
+		h32
+			.add( u.multiply(PRIME32_3) )
+			.rotl(17)
+			.multiply( PRIME32_4 )
+		p += 4
+	}
+
+	while (p < bEnd)
+	{
+		u.fromBits( isString ? input.charCodeAt(p++) : input[p++], 0 )
+		h32
+			.add( u.multiply(PRIME32_5) )
+			.rotl(11)
+			.multiply(PRIME32_1)
+	}
+
+	h = h32.clone().shiftRight(15)
+	h32.xor(h).multiply(PRIME32_2)
+
+	h = h32.clone().shiftRight(13)
+	h32.xor(h).multiply(PRIME32_3)
+
+	h = h32.clone().shiftRight(16)
+	h32.xor(h)
+
+	// Reset the state
+	this.init( this.seed )
+
+	return h32
+}
+
+module.exports = XXH
+
+/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))
+
+/***/ }),
+/* 4 */
+/***/ (function(module, exports) {
+
+var g;

+

+// This works in non-strict mode

+g = (function() {

+	return this;

+})();

+

+try {

+	// This works if eval is allowed (see CSP)

+	g = g || Function("return this")() || (1,eval)("this");

+} catch(e) {

+	// This works if the window reference is available

+	if(typeof window === "object")

+		g = window;

+}

+

+// g can still be undefined, but nothing to do about it...

+// We return undefined, instead of nothing here, so it's

+// easier to handle this case. if(!global) { ...}

+

+module.exports = g;

+
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"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, 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; i < l; i += 4) {
+    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('')
+}
+
+
+/***/ }),
+/* 6 */
+/***/ (function(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
+}
+
+
+/***/ }),
+/* 7 */
+/***/ (function(module, exports) {
+
+var toString = {}.toString;
+
+module.exports = Array.isArray || function (arr) {
+  return toString.call(arr) == '[object Array]';
+};
+
+
+/***/ }),
+/* 8 */
+/***/ (function(module, exports, __webpack_require__) {
+
+var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/**
+	C-like unsigned 32 bits integers in Javascript
+	Copyright (C) 2013, Pierre Curto
+	MIT license
+ */
+;(function (root) {
+
+	// Local cache for typical radices
+	var radixPowerCache = {
+		36: UINT32( Math.pow(36, 5) )
+	,	16: UINT32( Math.pow(16, 7) )
+	,	10: UINT32( Math.pow(10, 9) )
+	,	2:  UINT32( Math.pow(2, 30) )
+	}
+	var radixCache = {
+		36: UINT32(36)
+	,	16: UINT32(16)
+	,	10: UINT32(10)
+	,	2:  UINT32(2)
+	}
+
+	/**
+	 *	Represents an unsigned 32 bits integer
+	 * @constructor
+	 * @param {Number|String|Number} low bits     | integer as a string 		 | integer as a number
+	 * @param {Number|Number|Undefined} high bits | radix (optional, default=10)
+	 * @return 
+	 */
+	function UINT32 (l, h) {
+		if ( !(this instanceof UINT32) )
+			return new UINT32(l, h)
+
+		this._low = 0
+		this._high = 0
+		this.remainder = null
+		if (typeof h == 'undefined')
+			return fromNumber.call(this, l)
+
+		if (typeof l == 'string')
+			return fromString.call(this, l, h)
+
+		fromBits.call(this, l, h)
+	}
+
+	/**
+	 * Set the current _UINT32_ object with its low and high bits
+	 * @method fromBits
+	 * @param {Number} low bits
+	 * @param {Number} high bits
+	 * @return ThisExpression
+	 */
+	function fromBits (l, h) {
+		this._low = l | 0
+		this._high = h | 0
+
+		return this
+	}
+	UINT32.prototype.fromBits = fromBits
+
+	/**
+	 * Set the current _UINT32_ object from a number
+	 * @method fromNumber
+	 * @param {Number} number
+	 * @return ThisExpression
+	 */
+	function fromNumber (value) {
+		this._low = value & 0xFFFF
+		this._high = value >>> 16
+
+		return this
+	}
+	UINT32.prototype.fromNumber = fromNumber
+
+	/**
+	 * Set the current _UINT32_ object from a string
+	 * @method fromString
+	 * @param {String} integer as a string
+	 * @param {Number} radix (optional, default=10)
+	 * @return ThisExpression
+	 */
+	function fromString (s, radix) {
+		var value = parseInt(s, radix || 10)
+
+		this._low = value & 0xFFFF
+		this._high = value >>> 16
+
+		return this
+	}
+	UINT32.prototype.fromString = fromString
+
+	/**
+	 * Convert this _UINT32_ to a number
+	 * @method toNumber
+	 * @return {Number} the converted UINT32
+	 */
+	UINT32.prototype.toNumber = function () {
+		return (this._high * 65536) + this._low
+	}
+
+	/**
+	 * Convert this _UINT32_ to a string
+	 * @method toString
+	 * @param {Number} radix (optional, default=10)
+	 * @return {String} the converted UINT32
+	 */
+	UINT32.prototype.toString = function (radix) {
+		return this.toNumber().toString(radix || 10)
+	}
+
+	/**
+	 * Add two _UINT32_. The current _UINT32_ stores the result
+	 * @method add
+	 * @param {Object} other UINT32
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.add = function (other) {
+		var a00 = this._low + other._low
+		var a16 = a00 >>> 16
+
+		a16 += this._high + other._high
+
+		this._low = a00 & 0xFFFF
+		this._high = a16 & 0xFFFF
+
+		return this
+	}
+
+	/**
+	 * Subtract two _UINT32_. The current _UINT32_ stores the result
+	 * @method subtract
+	 * @param {Object} other UINT32
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.subtract = function (other) {
+		//TODO inline
+		return this.add( other.clone().negate() )
+	}
+
+	/**
+	 * Multiply two _UINT32_. The current _UINT32_ stores the result
+	 * @method multiply
+	 * @param {Object} other UINT32
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.multiply = function (other) {
+		/*
+			a = a00 + a16
+			b = b00 + b16
+			a*b = (a00 + a16)(b00 + b16)
+				= a00b00 + a00b16 + a16b00 + a16b16
+
+			a16b16 overflows the 32bits
+		 */
+		var a16 = this._high
+		var a00 = this._low
+		var b16 = other._high
+		var b00 = other._low
+
+/* Removed to increase speed under normal circumstances (i.e. not multiplying by 0 or 1)
+		// this == 0 or other == 1: nothing to do
+		if ((a00 == 0 && a16 == 0) || (b00 == 1 && b16 == 0)) return this
+
+		// other == 0 or this == 1: this = other
+		if ((b00 == 0 && b16 == 0) || (a00 == 1 && a16 == 0)) {
+			this._low = other._low
+			this._high = other._high
+			return this
+		}
+*/
+
+		var c16, c00
+		c00 = a00 * b00
+		c16 = c00 >>> 16
+
+		c16 += a16 * b00
+		c16 &= 0xFFFF		// Not required but improves performance
+		c16 += a00 * b16
+
+		this._low = c00 & 0xFFFF
+		this._high = c16 & 0xFFFF
+
+		return this
+	}
+
+	/**
+	 * Divide two _UINT32_. The current _UINT32_ stores the result.
+	 * The remainder is made available as the _remainder_ property on
+	 * the _UINT32_ object. It can be null, meaning there are no remainder.
+	 * @method div
+	 * @param {Object} other UINT32
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.div = function (other) {
+		if ( (other._low == 0) && (other._high == 0) ) throw Error('division by zero')
+
+		// other == 1
+		if (other._high == 0 && other._low == 1) {
+			this.remainder = new UINT32(0)
+			return this
+		}
+
+		// other > this: 0
+		if ( other.gt(this) ) {
+			this.remainder = this.clone()
+			this._low = 0
+			this._high = 0
+			return this
+		}
+		// other == this: 1
+		if ( this.eq(other) ) {
+			this.remainder = new UINT32(0)
+			this._low = 1
+			this._high = 0
+			return this
+		}
+
+		// Shift the divisor left until it is higher than the dividend
+		var _other = other.clone()
+		var i = -1
+		while ( !this.lt(_other) ) {
+			// High bit can overflow the default 16bits
+			// Its ok since we right shift after this loop
+			// The overflown bit must be kept though
+			_other.shiftLeft(1, true)
+			i++
+		}
+
+		// Set the remainder
+		this.remainder = this.clone()
+		// Initialize the current result to 0
+		this._low = 0
+		this._high = 0
+		for (; i >= 0; i--) {
+			_other.shiftRight(1)
+			// If shifted divisor is smaller than the dividend
+			// then subtract it from the dividend
+			if ( !this.remainder.lt(_other) ) {
+				this.remainder.subtract(_other)
+				// Update the current result
+				if (i >= 16) {
+					this._high |= 1 << (i - 16)
+				} else {
+					this._low |= 1 << i
+				}
+			}
+		}
+
+		return this
+	}
+
+	/**
+	 * Negate the current _UINT32_
+	 * @method negate
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.negate = function () {
+		var v = ( ~this._low & 0xFFFF ) + 1
+		this._low = v & 0xFFFF
+		this._high = (~this._high + (v >>> 16)) & 0xFFFF
+
+		return this
+	}
+
+	/**
+	 * Equals
+	 * @method eq
+	 * @param {Object} other UINT32
+	 * @return {Boolean}
+	 */
+	UINT32.prototype.equals = UINT32.prototype.eq = function (other) {
+		return (this._low == other._low) && (this._high == other._high)
+	}
+
+	/**
+	 * Greater than (strict)
+	 * @method gt
+	 * @param {Object} other UINT32
+	 * @return {Boolean}
+	 */
+	UINT32.prototype.greaterThan = UINT32.prototype.gt = function (other) {
+		if (this._high > other._high) return true
+		if (this._high < other._high) return false
+		return this._low > other._low
+	}
+
+	/**
+	 * Less than (strict)
+	 * @method lt
+	 * @param {Object} other UINT32
+	 * @return {Boolean}
+	 */
+	UINT32.prototype.lessThan = UINT32.prototype.lt = function (other) {
+		if (this._high < other._high) return true
+		if (this._high > other._high) return false
+		return this._low < other._low
+	}
+
+	/**
+	 * Bitwise OR
+	 * @method or
+	 * @param {Object} other UINT32
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.or = function (other) {
+		this._low |= other._low
+		this._high |= other._high
+
+		return this
+	}
+
+	/**
+	 * Bitwise AND
+	 * @method and
+	 * @param {Object} other UINT32
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.and = function (other) {
+		this._low &= other._low
+		this._high &= other._high
+
+		return this
+	}
+
+	/**
+	 * Bitwise NOT
+	 * @method not
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.not = function() {
+		this._low = ~this._low & 0xFFFF
+		this._high = ~this._high & 0xFFFF
+
+		return this
+	}
+
+	/**
+	 * Bitwise XOR
+	 * @method xor
+	 * @param {Object} other UINT32
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.xor = function (other) {
+		this._low ^= other._low
+		this._high ^= other._high
+
+		return this
+	}
+
+	/**
+	 * Bitwise shift right
+	 * @method shiftRight
+	 * @param {Number} number of bits to shift
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.shiftRight = UINT32.prototype.shiftr = function (n) {
+		if (n > 16) {
+			this._low = this._high >> (n - 16)
+			this._high = 0
+		} else if (n == 16) {
+			this._low = this._high
+			this._high = 0
+		} else {
+			this._low = (this._low >> n) | ( (this._high << (16-n)) & 0xFFFF )
+			this._high >>= n
+		}
+
+		return this
+	}
+
+	/**
+	 * Bitwise shift left
+	 * @method shiftLeft
+	 * @param {Number} number of bits to shift
+	 * @param {Boolean} allow overflow
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.shiftLeft = UINT32.prototype.shiftl = function (n, allowOverflow) {
+		if (n > 16) {
+			this._high = this._low << (n - 16)
+			this._low = 0
+			if (!allowOverflow) {
+				this._high &= 0xFFFF
+			}
+		} else if (n == 16) {
+			this._high = this._low
+			this._low = 0
+		} else {
+			this._high = (this._high << n) | (this._low >> (16-n))
+			this._low = (this._low << n) & 0xFFFF
+			if (!allowOverflow) {
+				// Overflow only allowed on the high bits...
+				this._high &= 0xFFFF
+			}
+		}
+
+		return this
+	}
+
+	/**
+	 * Bitwise rotate left
+	 * @method rotl
+	 * @param {Number} number of bits to rotate
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.rotateLeft = UINT32.prototype.rotl = function (n) {
+		var v = (this._high << 16) | this._low
+		v = (v << n) | (v >>> (32 - n))
+		this._low = v & 0xFFFF
+		this._high = v >>> 16
+
+		return this
+	}
+
+	/**
+	 * Bitwise rotate right
+	 * @method rotr
+	 * @param {Number} number of bits to rotate
+	 * @return ThisExpression
+	 */
+	UINT32.prototype.rotateRight = UINT32.prototype.rotr = function (n) {
+		var v = (this._high << 16) | this._low
+		v = (v >>> n) | (v << (32 - n))
+		this._low = v & 0xFFFF
+		this._high = v >>> 16
+
+		return this
+	}
+
+	/**
+	 * Clone the current _UINT32_
+	 * @method clone
+	 * @return {Object} cloned UINT32
+	 */
+	UINT32.prototype.clone = function () {
+		return new UINT32(this._low, this._high)
+	}
+
+	if (true) {
+		// AMD / RequireJS
+		!(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = (function () {
+			return UINT32
+		}).apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__),
+				__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__))
+	} else if (typeof module != 'undefined' && module.exports) {
+		// Node.js
+		module.exports = UINT32
+	} else {
+		// Browser
+		root['UINT32'] = UINT32
+	}
+
+})(this)
+
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports, __webpack_require__) {
+
+var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/**
+	C-like unsigned 64 bits integers in Javascript
+	Copyright (C) 2013, Pierre Curto
+	MIT license
+ */
+;(function (root) {
+
+	// Local cache for typical radices
+	var radixPowerCache = {
+		16: UINT64( Math.pow(16, 5) )
+	,	10: UINT64( Math.pow(10, 5) )
+	,	2:  UINT64( Math.pow(2, 5) )
+	}
+	var radixCache = {
+		16: UINT64(16)
+	,	10: UINT64(10)
+	,	2:  UINT64(2)
+	}
+
+	/**
+	 *	Represents an unsigned 64 bits integer
+	 * @constructor
+	 * @param {Number} first low bits (8)
+	 * @param {Number} second low bits (8)
+	 * @param {Number} first high bits (8)
+	 * @param {Number} second high bits (8)
+	 * or
+	 * @param {Number} low bits (32)
+	 * @param {Number} high bits (32)
+	 * or
+	 * @param {String|Number} integer as a string 		 | integer as a number
+	 * @param {Number|Undefined} radix (optional, default=10)
+	 * @return 
+	 */
+	function UINT64 (a00, a16, a32, a48) {
+		if ( !(this instanceof UINT64) )
+			return new UINT64(a00, a16, a32, a48)
+
+		this.remainder = null
+		if (typeof a00 == 'string')
+			return fromString.call(this, a00, a16)
+
+		if (typeof a16 == 'undefined')
+			return fromNumber.call(this, a00)
+
+		fromBits.apply(this, arguments)
+	}
+
+	/**
+	 * Set the current _UINT64_ object with its low and high bits
+	 * @method fromBits
+	 * @param {Number} first low bits (8)
+	 * @param {Number} second low bits (8)
+	 * @param {Number} first high bits (8)
+	 * @param {Number} second high bits (8)
+	 * or
+	 * @param {Number} low bits (32)
+	 * @param {Number} high bits (32)
+	 * @return ThisExpression
+	 */
+	function fromBits (a00, a16, a32, a48) {
+		if (typeof a32 == 'undefined') {
+			this._a00 = a00 & 0xFFFF
+			this._a16 = a00 >>> 16
+			this._a32 = a16 & 0xFFFF
+			this._a48 = a16 >>> 16
+			return this
+		}
+
+		this._a00 = a00 | 0
+		this._a16 = a16 | 0
+		this._a32 = a32 | 0
+		this._a48 = a48 | 0
+
+		return this
+	}
+	UINT64.prototype.fromBits = fromBits
+
+	/**
+	 * Set the current _UINT64_ object from a number
+	 * @method fromNumber
+	 * @param {Number} number
+	 * @return ThisExpression
+	 */
+	function fromNumber (value) {
+		this._a00 = value & 0xFFFF
+		this._a16 = value >>> 16
+		this._a32 = 0
+		this._a48 = 0
+
+		return this
+	}
+	UINT64.prototype.fromNumber = fromNumber
+
+	/**
+	 * Set the current _UINT64_ object from a string
+	 * @method fromString
+	 * @param {String} integer as a string
+	 * @param {Number} radix (optional, default=10)
+	 * @return ThisExpression
+	 */
+	function fromString (s, radix) {
+		radix = radix || 10
+
+		this._a00 = 0
+		this._a16 = 0
+		this._a32 = 0
+		this._a48 = 0
+
+		/*
+			In Javascript, bitwise operators only operate on the first 32 bits 
+			of a number, even though parseInt() encodes numbers with a 53 bits 
+			mantissa.
+			Therefore UINT64(<Number>) can only work on 32 bits.
+			The radix maximum value is 36 (as per ECMA specs) (26 letters + 10 digits)
+			maximum input value is m = 32bits as 1 = 2^32 - 1
+			So the maximum substring length n is:
+			36^(n+1) - 1 = 2^32 - 1
+			36^(n+1) = 2^32
+			(n+1)ln(36) = 32ln(2)
+			n = 32ln(2)/ln(36) - 1
+			n = 5.189644915687692
+			n = 5
+		 */
+		var radixUint = radixPowerCache[radix] || new UINT64( Math.pow(radix, 5) )
+
+		for (var i = 0, len = s.length; i < len; i += 5) {
+			var size = Math.min(5, len - i)
+			var value = parseInt( s.slice(i, i + size), radix )
+			this.multiply(
+					size < 5
+						? new UINT64( Math.pow(radix, size) )
+						: radixUint
+				)
+				.add( new UINT64(value) )
+		}
+
+		return this
+	}
+	UINT64.prototype.fromString = fromString
+
+	/**
+	 * Convert this _UINT64_ to a number (last 32 bits are dropped)
+	 * @method toNumber
+	 * @return {Number} the converted UINT64
+	 */
+	UINT64.prototype.toNumber = function () {
+		return (this._a16 * 65536) + this._a00
+	}
+
+	/**
+	 * Convert this _UINT64_ to a string
+	 * @method toString
+	 * @param {Number} radix (optional, default=10)
+	 * @return {String} the converted UINT64
+	 */
+	UINT64.prototype.toString = function (radix) {
+		radix = radix || 10
+		var radixUint = radixCache[radix] || new UINT64(radix)
+
+		if ( !this.gt(radixUint) ) return this.toNumber().toString(radix)
+
+		var self = this.clone()
+		var res = new Array(64)
+		for (var i = 63; i >= 0; i--) {
+			self.div(radixUint)
+			res[i] = self.remainder.toNumber().toString(radix)
+			if ( !self.gt(radixUint) ) break
+		}
+		res[i-1] = self.toNumber().toString(radix)
+
+		return res.join('')
+	}
+
+	/**
+	 * Add two _UINT64_. The current _UINT64_ stores the result
+	 * @method add
+	 * @param {Object} other UINT64
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.add = function (other) {
+		var a00 = this._a00 + other._a00
+
+		var a16 = a00 >>> 16
+		a16 += this._a16 + other._a16
+
+		var a32 = a16 >>> 16
+		a32 += this._a32 + other._a32
+
+		var a48 = a32 >>> 16
+		a48 += this._a48 + other._a48
+
+		this._a00 = a00 & 0xFFFF
+		this._a16 = a16 & 0xFFFF
+		this._a32 = a32 & 0xFFFF
+		this._a48 = a48 & 0xFFFF
+
+		return this
+	}
+
+	/**
+	 * Subtract two _UINT64_. The current _UINT64_ stores the result
+	 * @method subtract
+	 * @param {Object} other UINT64
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.subtract = function (other) {
+		return this.add( other.clone().negate() )
+	}
+
+	/**
+	 * Multiply two _UINT64_. The current _UINT64_ stores the result
+	 * @method multiply
+	 * @param {Object} other UINT64
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.multiply = function (other) {
+		/*
+			a = a00 + a16 + a32 + a48
+			b = b00 + b16 + b32 + b48
+			a*b = (a00 + a16 + a32 + a48)(b00 + b16 + b32 + b48)
+				= a00b00 + a00b16 + a00b32 + a00b48
+				+ a16b00 + a16b16 + a16b32 + a16b48
+				+ a32b00 + a32b16 + a32b32 + a32b48
+				+ a48b00 + a48b16 + a48b32 + a48b48
+
+			a16b48, a32b32, a48b16, a48b32 and a48b48 overflow the 64 bits
+			so it comes down to:
+			a*b	= a00b00 + a00b16 + a00b32 + a00b48
+				+ a16b00 + a16b16 + a16b32
+				+ a32b00 + a32b16
+				+ a48b00
+				= a00b00
+				+ a00b16 + a16b00
+				+ a00b32 + a16b16 + a32b00
+				+ a00b48 + a16b32 + a32b16 + a48b00
+		 */
+		var a00 = this._a00
+		var a16 = this._a16
+		var a32 = this._a32
+		var a48 = this._a48
+		var b00 = other._a00
+		var b16 = other._a16
+		var b32 = other._a32
+		var b48 = other._a48
+
+		var c00 = a00 * b00
+
+		var c16 = c00 >>> 16
+		c16 += a00 * b16
+		var c32 = c16 >>> 16
+		c16 &= 0xFFFF
+		c16 += a16 * b00
+
+		c32 += c16 >>> 16
+		c32 += a00 * b32
+		var c48 = c32 >>> 16
+		c32 &= 0xFFFF
+		c32 += a16 * b16
+		c48 += c32 >>> 16
+		c32 &= 0xFFFF
+		c32 += a32 * b00
+
+		c48 += c32 >>> 16
+		c48 += a00 * b48
+		c48 &= 0xFFFF
+		c48 += a16 * b32
+		c48 &= 0xFFFF
+		c48 += a32 * b16
+		c48 &= 0xFFFF
+		c48 += a48 * b00
+
+		this._a00 = c00 & 0xFFFF
+		this._a16 = c16 & 0xFFFF
+		this._a32 = c32 & 0xFFFF
+		this._a48 = c48 & 0xFFFF
+
+		return this
+	}
+
+	/**
+	 * Divide two _UINT64_. The current _UINT64_ stores the result.
+	 * The remainder is made available as the _remainder_ property on
+	 * the _UINT64_ object. It can be null, meaning there are no remainder.
+	 * @method div
+	 * @param {Object} other UINT64
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.div = function (other) {
+		if ( (other._a16 == 0) && (other._a32 == 0) && (other._a48 == 0) ) {
+			if (other._a00 == 0) throw Error('division by zero')
+
+			// other == 1: this
+			if (other._a00 == 1) {
+				this.remainder = new UINT64(0)
+				return this
+			}
+		}
+
+		// other > this: 0
+		if ( other.gt(this) ) {
+			this.remainder = this.clone()
+			this._a00 = 0
+			this._a16 = 0
+			this._a32 = 0
+			this._a48 = 0
+			return this
+		}
+		// other == this: 1
+		if ( this.eq(other) ) {
+			this.remainder = new UINT64(0)
+			this._a00 = 1
+			this._a16 = 0
+			this._a32 = 0
+			this._a48 = 0
+			return this
+		}
+
+		// Shift the divisor left until it is higher than the dividend
+		var _other = other.clone()
+		var i = -1
+		while ( !this.lt(_other) ) {
+			// High bit can overflow the default 16bits
+			// Its ok since we right shift after this loop
+			// The overflown bit must be kept though
+			_other.shiftLeft(1, true)
+			i++
+		}
+
+		// Set the remainder
+		this.remainder = this.clone()
+		// Initialize the current result to 0
+		this._a00 = 0
+		this._a16 = 0
+		this._a32 = 0
+		this._a48 = 0
+		for (; i >= 0; i--) {
+			_other.shiftRight(1)
+			// If shifted divisor is smaller than the dividend
+			// then subtract it from the dividend
+			if ( !this.remainder.lt(_other) ) {
+				this.remainder.subtract(_other)
+				// Update the current result
+				if (i >= 48) {
+					this._a48 |= 1 << (i - 48)
+				} else if (i >= 32) {
+					this._a32 |= 1 << (i - 32)
+				} else if (i >= 16) {
+					this._a16 |= 1 << (i - 16)
+				} else {
+					this._a00 |= 1 << i
+				}
+			}
+		}
+
+		return this
+	}
+
+	/**
+	 * Negate the current _UINT64_
+	 * @method negate
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.negate = function () {
+		var v = ( ~this._a00 & 0xFFFF ) + 1
+		this._a00 = v & 0xFFFF
+		v = (~this._a16 & 0xFFFF) + (v >>> 16)
+		this._a16 = v & 0xFFFF
+		v = (~this._a32 & 0xFFFF) + (v >>> 16)
+		this._a32 = v & 0xFFFF
+		this._a48 = (~this._a48 + (v >>> 16)) & 0xFFFF
+
+		return this
+	}
+
+	/**
+
+	 * @method eq
+	 * @param {Object} other UINT64
+	 * @return {Boolean}
+	 */
+	UINT64.prototype.equals = UINT64.prototype.eq = function (other) {
+		return (this._a48 == other._a48) && (this._a00 == other._a00)
+			 && (this._a32 == other._a32) && (this._a16 == other._a16)
+	}
+
+	/**
+	 * Greater than (strict)
+	 * @method gt
+	 * @param {Object} other UINT64
+	 * @return {Boolean}
+	 */
+	UINT64.prototype.greaterThan = UINT64.prototype.gt = function (other) {
+		if (this._a48 > other._a48) return true
+		if (this._a48 < other._a48) return false
+		if (this._a32 > other._a32) return true
+		if (this._a32 < other._a32) return false
+		if (this._a16 > other._a16) return true
+		if (this._a16 < other._a16) return false
+		return this._a00 > other._a00
+	}
+
+	/**
+	 * Less than (strict)
+	 * @method lt
+	 * @param {Object} other UINT64
+	 * @return {Boolean}
+	 */
+	UINT64.prototype.lessThan = UINT64.prototype.lt = function (other) {
+		if (this._a48 < other._a48) return true
+		if (this._a48 > other._a48) return false
+		if (this._a32 < other._a32) return true
+		if (this._a32 > other._a32) return false
+		if (this._a16 < other._a16) return true
+		if (this._a16 > other._a16) return false
+		return this._a00 < other._a00
+	}
+
+	/**
+	 * Bitwise OR
+	 * @method or
+	 * @param {Object} other UINT64
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.or = function (other) {
+		this._a00 |= other._a00
+		this._a16 |= other._a16
+		this._a32 |= other._a32
+		this._a48 |= other._a48
+
+		return this
+	}
+
+	/**
+	 * Bitwise AND
+	 * @method and
+	 * @param {Object} other UINT64
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.and = function (other) {
+		this._a00 &= other._a00
+		this._a16 &= other._a16
+		this._a32 &= other._a32
+		this._a48 &= other._a48
+
+		return this
+	}
+
+	/**
+	 * Bitwise XOR
+	 * @method xor
+	 * @param {Object} other UINT64
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.xor = function (other) {
+		this._a00 ^= other._a00
+		this._a16 ^= other._a16
+		this._a32 ^= other._a32
+		this._a48 ^= other._a48
+
+		return this
+	}
+
+	/**
+	 * Bitwise NOT
+	 * @method not
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.not = function() {
+		this._a00 = ~this._a00 & 0xFFFF
+		this._a16 = ~this._a16 & 0xFFFF
+		this._a32 = ~this._a32 & 0xFFFF
+		this._a48 = ~this._a48 & 0xFFFF
+
+		return this
+	}
+
+	/**
+	 * Bitwise shift right
+	 * @method shiftRight
+	 * @param {Number} number of bits to shift
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.shiftRight = UINT64.prototype.shiftr = function (n) {
+		n %= 64
+		if (n >= 48) {
+			this._a00 = this._a48 >> (n - 48)
+			this._a16 = 0
+			this._a32 = 0
+			this._a48 = 0
+		} else if (n >= 32) {
+			n -= 32
+			this._a00 = ( (this._a32 >> n) | (this._a48 << (16-n)) ) & 0xFFFF
+			this._a16 = (this._a48 >> n) & 0xFFFF
+			this._a32 = 0
+			this._a48 = 0
+		} else if (n >= 16) {
+			n -= 16
+			this._a00 = ( (this._a16 >> n) | (this._a32 << (16-n)) ) & 0xFFFF
+			this._a16 = ( (this._a32 >> n) | (this._a48 << (16-n)) ) & 0xFFFF
+			this._a32 = (this._a48 >> n) & 0xFFFF
+			this._a48 = 0
+		} else {
+			this._a00 = ( (this._a00 >> n) | (this._a16 << (16-n)) ) & 0xFFFF
+			this._a16 = ( (this._a16 >> n) | (this._a32 << (16-n)) ) & 0xFFFF
+			this._a32 = ( (this._a32 >> n) | (this._a48 << (16-n)) ) & 0xFFFF
+			this._a48 = (this._a48 >> n) & 0xFFFF
+		}
+
+		return this
+	}
+
+	/**
+	 * Bitwise shift left
+	 * @method shiftLeft
+	 * @param {Number} number of bits to shift
+	 * @param {Boolean} allow overflow
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.shiftLeft = UINT64.prototype.shiftl = function (n, allowOverflow) {
+		n %= 64
+		if (n >= 48) {
+			this._a48 = this._a00 << (n - 48)
+			this._a32 = 0
+			this._a16 = 0
+			this._a00 = 0
+		} else if (n >= 32) {
+			n -= 32
+			this._a48 = (this._a16 << n) | (this._a00 >> (16-n))
+			this._a32 = (this._a00 << n) & 0xFFFF
+			this._a16 = 0
+			this._a00 = 0
+		} else if (n >= 16) {
+			n -= 16
+			this._a48 = (this._a32 << n) | (this._a16 >> (16-n))
+			this._a32 = ( (this._a16 << n) | (this._a00 >> (16-n)) ) & 0xFFFF
+			this._a16 = (this._a00 << n) & 0xFFFF
+			this._a00 = 0
+		} else {
+			this._a48 = (this._a48 << n) | (this._a32 >> (16-n))
+			this._a32 = ( (this._a32 << n) | (this._a16 >> (16-n)) ) & 0xFFFF
+			this._a16 = ( (this._a16 << n) | (this._a00 >> (16-n)) ) & 0xFFFF
+			this._a00 = (this._a00 << n) & 0xFFFF
+		}
+		if (!allowOverflow) {
+			this._a48 &= 0xFFFF
+		}
+
+		return this
+	}
+
+	/**
+	 * Bitwise rotate left
+	 * @method rotl
+	 * @param {Number} number of bits to rotate
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.rotateLeft = UINT64.prototype.rotl = function (n) {
+		n %= 64
+		if (n == 0) return this
+		if (n >= 32) {
+			// A.B.C.D
+			// B.C.D.A rotl(16)
+			// C.D.A.B rotl(32)
+			var v = this._a00
+			this._a00 = this._a32
+			this._a32 = v
+			v = this._a48
+			this._a48 = this._a16
+			this._a16 = v
+			if (n == 32) return this
+			n -= 32
+		}
+
+		var high = (this._a48 << 16) | this._a32
+		var low = (this._a16 << 16) | this._a00
+
+		var _high = (high << n) | (low >>> (32 - n))
+		var _low = (low << n) | (high >>> (32 - n))
+
+		this._a00 = _low & 0xFFFF
+		this._a16 = _low >>> 16
+		this._a32 = _high & 0xFFFF
+		this._a48 = _high >>> 16
+
+		return this
+	}
+
+	/**
+	 * Bitwise rotate right
+	 * @method rotr
+	 * @param {Number} number of bits to rotate
+	 * @return ThisExpression
+	 */
+	UINT64.prototype.rotateRight = UINT64.prototype.rotr = function (n) {
+		n %= 64
+		if (n == 0) return this
+		if (n >= 32) {
+			// A.B.C.D
+			// D.A.B.C rotr(16)
+			// C.D.A.B rotr(32)
+			var v = this._a00
+			this._a00 = this._a32
+			this._a32 = v
+			v = this._a48
+			this._a48 = this._a16
+			this._a16 = v
+			if (n == 32) return this
+			n -= 32
+		}
+
+		var high = (this._a48 << 16) | this._a32
+		var low = (this._a16 << 16) | this._a00
+
+		var _high = (high >>> n) | (low << (32 - n))
+		var _low = (low >>> n) | (high << (32 - n))
+
+		this._a00 = _low & 0xFFFF
+		this._a16 = _low >>> 16
+		this._a32 = _high & 0xFFFF
+		this._a48 = _high >>> 16
+
+		return this
+	}
+
+	/**
+	 * Clone the current _UINT64_
+	 * @method clone
+	 * @return {Object} cloned UINT64
+	 */
+	UINT64.prototype.clone = function () {
+		return new UINT64(this._a00, this._a16, this._a32, this._a48)
+	}
+
+	if (true) {
+		// AMD / RequireJS
+		!(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = (function () {
+			return UINT64
+		}).apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__),
+				__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__))
+	} else if (typeof module != 'undefined' && module.exports) {
+		// Node.js
+		module.exports = UINT64
+	} else {
+		// Browser
+		root['UINT64'] = UINT64
+	}
+
+})(this)
+
+
+/***/ }),
+/* 10 */
+/***/ (function(module, exports, __webpack_require__) {
+
+/* WEBPACK VAR INJECTION */(function(Buffer) {/**
+xxHash64 implementation in pure Javascript
+
+Copyright (C) 2016, Pierre Curto
+MIT license
+*/
+var UINT64 = __webpack_require__(1).UINT64
+
+/*
+ * Constants
+ */
+var PRIME64_1 = UINT64( '11400714785074694791' )
+var PRIME64_2 = UINT64( '14029467366897019727' )
+var PRIME64_3 = UINT64(  '1609587929392839161' )
+var PRIME64_4 = UINT64(  '9650029242287828579' )
+var PRIME64_5 = UINT64(  '2870177450012600261' )
+
+/**
+* Convert string to proper UTF-8 array
+* @param str Input string
+* @returns {Uint8Array} UTF8 array is returned as uint8 array
+*/
+function toUTF8Array (str) {
+	var utf8 = []
+	for (var i=0, n=str.length; i < n; i++) {
+		var charcode = str.charCodeAt(i)
+		if (charcode < 0x80) utf8.push(charcode)
+		else if (charcode < 0x800) {
+			utf8.push(0xc0 | (charcode >> 6),
+			0x80 | (charcode & 0x3f))
+		}
+		else if (charcode < 0xd800 || charcode >= 0xe000) {
+			utf8.push(0xe0 | (charcode >> 12),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+		// surrogate pair
+		else {
+			i++;
+			// UTF-16 encodes 0x10000-0x10FFFF by
+			// subtracting 0x10000 and splitting the
+			// 20 bits of 0x0-0xFFFFF into two halves
+			charcode = 0x10000 + (((charcode & 0x3ff)<<10)
+			| (str.charCodeAt(i) & 0x3ff))
+			utf8.push(0xf0 | (charcode >>18),
+			0x80 | ((charcode>>12) & 0x3f),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+	}
+
+	return new Uint8Array(utf8)
+}
+
+/**
+ * XXH64 object used as a constructor or a function
+ * @constructor
+ * or
+ * @param {Object|String} input data
+ * @param {Number|UINT64} seed
+ * @return ThisExpression
+ * or
+ * @return {UINT64} xxHash
+ */
+function XXH64 () {
+	if (arguments.length == 2)
+		return new XXH64( arguments[1] ).update( arguments[0] ).digest()
+
+	if (!(this instanceof XXH64))
+		return new XXH64( arguments[0] )
+
+	init.call(this, arguments[0])
+}
+
+/**
+ * Initialize the XXH64 instance with the given seed
+ * @method init
+ * @param {Number|Object} seed as a number or an unsigned 32 bits integer
+ * @return ThisExpression
+ */
+ function init (seed) {
+	this.seed = seed instanceof UINT64 ? seed.clone() : UINT64(seed)
+	this.v1 = this.seed.clone().add(PRIME64_1).add(PRIME64_2)
+	this.v2 = this.seed.clone().add(PRIME64_2)
+	this.v3 = this.seed.clone()
+	this.v4 = this.seed.clone().subtract(PRIME64_1)
+	this.total_len = 0
+	this.memsize = 0
+	this.memory = null
+
+	return this
+}
+XXH64.prototype.init = init
+
+/**
+ * Add data to be computed for the XXH64 hash
+ * @method update
+ * @param {String|Buffer|ArrayBuffer} input as a string or nodejs Buffer or ArrayBuffer
+ * @return ThisExpression
+ */
+XXH64.prototype.update = function (input) {
+	var isString = typeof input == 'string'
+	var isArrayBuffer
+
+	// Convert all strings to utf-8 first (issue #5)
+	if (isString) {
+		input = toUTF8Array(input)
+		isString = false
+		isArrayBuffer = true
+	}
+
+	if (typeof ArrayBuffer !== "undefined" && input instanceof ArrayBuffer)
+	{
+		isArrayBuffer = true
+		input = new Uint8Array(input);
+	}
+
+	var p = 0
+	var len = input.length
+	var bEnd = p + len
+
+	if (len == 0) return this
+
+	this.total_len += len
+
+	if (this.memsize == 0)
+	{
+		if (isString) {
+			this.memory = ''
+		} else if (isArrayBuffer) {
+			this.memory = new Uint8Array(32)
+		} else {
+			this.memory = new Buffer(32)
+		}
+	}
+
+	if (this.memsize + len < 32)   // fill in tmp buffer
+	{
+		// XXH64_memcpy(this.memory + this.memsize, input, len)
+		if (isString) {
+			this.memory += input
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, len), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, len )
+		}
+
+		this.memsize += len
+		return this
+	}
+
+	if (this.memsize > 0)   // some data left from previous update
+	{
+		// XXH64_memcpy(this.memory + this.memsize, input, 16-this.memsize);
+		if (isString) {
+			this.memory += input.slice(0, 32 - this.memsize)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, 32 - this.memsize), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, 32 - this.memsize )
+		}
+
+		var p64 = 0
+		if (isString) {
+			var other
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+		} else {
+			var other
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+		}
+
+		p += 32 - this.memsize
+		this.memsize = 0
+		if (isString) this.memory = ''
+	}
+
+	if (p <= bEnd - 32)
+	{
+		var limit = bEnd - 32
+
+		do
+		{
+			if (isString) {
+				var other
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			} else {
+				var other
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			}
+			p += 8
+		} while (p <= limit)
+	}
+
+	if (p < bEnd)
+	{
+		// XXH64_memcpy(this.memory, p, bEnd-p);
+		if (isString) {
+			this.memory += input.slice(p)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(p, bEnd), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, p, bEnd )
+		}
+
+		this.memsize = bEnd - p
+	}
+
+	return this
+}
+
+/**
+ * Finalize the XXH64 computation. The XXH64 instance is ready for reuse for the given seed
+ * @method digest
+ * @return {UINT64} xxHash
+ */
+XXH64.prototype.digest = function () {
+	var input = this.memory
+	var isString = typeof input == 'string'
+	var p = 0
+	var bEnd = this.memsize
+	var h64, h
+	var u = new UINT64
+
+	if (this.total_len >= 32)
+	{
+		h64 = this.v1.clone().rotl(1)
+		h64.add( this.v2.clone().rotl(7) )
+		h64.add( this.v3.clone().rotl(12) )
+		h64.add( this.v4.clone().rotl(18) )
+
+		h64.xor( this.v1.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+
+		h64.xor( this.v2.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+
+		h64.xor( this.v3.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+
+		h64.xor( this.v4.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+	}
+	else
+	{
+		h64  = this.seed.clone().add( PRIME64_5 )
+	}
+
+	h64.add( u.fromNumber(this.total_len) )
+
+	while (p <= bEnd - 8)
+	{
+		if (isString) {
+			u.fromBits(
+				(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+			,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+			,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+			,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+			)
+		} else {
+			u.fromBits(
+				(input[p+1] << 8) | input[p]
+			,	(input[p+3] << 8) | input[p+2]
+			,	(input[p+5] << 8) | input[p+4]
+			,	(input[p+7] << 8) | input[p+6]
+			)
+		}
+		u.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1)
+		h64
+			.xor(u)
+			.rotl(27)
+			.multiply( PRIME64_1 )
+			.add( PRIME64_4 )
+		p += 8
+	}
+
+	if (p + 4 <= bEnd) {
+		if (isString) {
+			u.fromBits(
+				(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+			,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+			,	0
+			,	0
+			)
+		} else {
+			u.fromBits(
+				(input[p+1] << 8) | input[p]
+			,	(input[p+3] << 8) | input[p+2]
+			,	0
+			,	0
+			)
+		}
+		h64
+			.xor( u.multiply(PRIME64_1) )
+			.rotl(23)
+			.multiply( PRIME64_2 )
+			.add( PRIME64_3 )
+		p += 4
+	}
+
+	while (p < bEnd)
+	{
+		u.fromBits( isString ? input.charCodeAt(p++) : input[p++], 0, 0, 0 )
+		h64
+			.xor( u.multiply(PRIME64_5) )
+			.rotl(11)
+			.multiply(PRIME64_1)
+	}
+
+	h = h64.clone().shiftRight(33)
+	h64.xor(h).multiply(PRIME64_2)
+
+	h = h64.clone().shiftRight(29)
+	h64.xor(h).multiply(PRIME64_3)
+
+	h = h64.clone().shiftRight(32)
+	h64.xor(h)
+
+	// Reset the state
+	this.init( this.seed )
+
+	return h64
+}
+
+module.exports = XXH64
+
+/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(0).Buffer))
+
+/***/ })
+/******/ ]);
+});
\ No newline at end of file
diff --git a/alarm/node_modules/xxhashjs/build/xxhash.min.js b/alarm/node_modules/xxhashjs/build/xxhash.min.js
new file mode 100644
index 0000000..b64e5a5
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/build/xxhash.min.js
@@ -0,0 +1,2 @@
+!function(t,r){"object"==typeof exports&&"object"==typeof module?module.exports=r():"function"==typeof define&&define.amd?define([],r):"object"==typeof exports?exports.XXH=r():t.XXH=r()}("undefined"!=typeof self?self:this,function(){return function(t){function r(e){if(i[e])return i[e].exports;var o=i[e]={i:e,l:!1,exports:{}};return t[e].call(o.exports,o,o.exports,r),o.l=!0,o.exports}var i={};return r.m=t,r.c=i,r.d=function(t,i,e){r.o(t,i)||Object.defineProperty(t,i,{configurable:!1,enumerable:!0,get:e})},r.n=function(t){var i=t&&t.__esModule?function(){return t.default}:function(){return t};return r.d(i,"a",i),i},r.o=function(t,r){return Object.prototype.hasOwnProperty.call(t,r)},r.p="",r(r.s=2)}([function(t,r,i){"use strict";(function(t){function e(){return h.TYPED_ARRAY_SUPPORT?2147483647:1073741823}function o(t,r){if(e()<r)throw new RangeError("Invalid typed array length");return h.TYPED_ARRAY_SUPPORT?(t=new Uint8Array(r),t.__proto__=h.prototype):(null===t&&(t=new h(r)),t.length=r),t}function h(t,r,i){if(!(h.TYPED_ARRAY_SUPPORT||this instanceof h))return new h(t,r,i);if("number"==typeof t){if("string"==typeof r)throw new Error("If encoding is specified then the first argument must be a string");return u(this,t)}return n(this,t,r,i)}function n(t,r,i,e){if("number"==typeof r)throw new TypeError('"value" argument must not be a number');return"undefined"!=typeof ArrayBuffer&&r instanceof ArrayBuffer?c(t,r,i,e):"string"==typeof r?f(t,r,i):p(t,r)}function s(t){if("number"!=typeof t)throw new TypeError('"size" argument must be a number');if(t<0)throw new RangeError('"size" argument must not be negative')}function a(t,r,i,e){return s(r),r<=0?o(t,r):void 0!==i?"string"==typeof e?o(t,r).fill(i,e):o(t,r).fill(i):o(t,r)}function u(t,r){if(s(r),t=o(t,r<0?0:0|m(r)),!h.TYPED_ARRAY_SUPPORT)for(var i=0;i<r;++i)t[i]=0;return t}function f(t,r,i){if("string"==typeof i&&""!==i||(i="utf8"),!h.isEncoding(i))throw new TypeError('"encoding" must be a valid string encoding');var e=0|_(r,i);t=o(t,e);var n=t.write(r,i);return n!==e&&(t=t.slice(0,n)),t}function l(t,r){var i=r.length<0?0:0|m(r.length);t=o(t,i);for(var e=0;e<i;e+=1)t[e]=255&r[e];return t}function c(t,r,i,e){if(r.byteLength,i<0||r.byteLength<i)throw new RangeError("'offset' is out of bounds");if(r.byteLength<i+(e||0))throw new RangeError("'length' is out of bounds");return r=void 0===i&&void 0===e?new Uint8Array(r):void 0===e?new Uint8Array(r,i):new Uint8Array(r,i,e),h.TYPED_ARRAY_SUPPORT?(t=r,t.__proto__=h.prototype):t=l(t,r),t}function p(t,r){if(h.isBuffer(r)){var i=0|m(r.length);return t=o(t,i),0===t.length?t:(r.copy(t,0,0,i),t)}if(r){if("undefined"!=typeof ArrayBuffer&&r.buffer instanceof ArrayBuffer||"length"in r)return"number"!=typeof r.length||G(r.length)?o(t,0):l(t,r);if("Buffer"===r.type&&W(r.data))return l(t,r.data)}throw new TypeError("First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.")}function m(t){if(t>=e())throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+e().toString(16)+" bytes");return 0|t}function y(t){return+t!=t&&(t=0),h.alloc(+t)}function _(t,r){if(h.isBuffer(t))return t.length;if("undefined"!=typeof ArrayBuffer&&"function"==typeof ArrayBuffer.isView&&(ArrayBuffer.isView(t)||t instanceof ArrayBuffer))return t.byteLength;"string"!=typeof t&&(t=""+t);var i=t.length;if(0===i)return 0;for(var e=!1;;)switch(r){case"ascii":case"latin1":case"binary":return i;case"utf8":case"utf-8":case void 0:return X(t).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*i;case"hex":return i>>>1;case"base64":return J(t).length;default:if(e)return X(t).length;r=(""+r).toLowerCase(),e=!0}}function d(t,r,i){var e=!1;if((void 0===r||r<0)&&(r=0),r>this.length)return"";if((void 0===i||i>this.length)&&(i=this.length),i<=0)return"";if(i>>>=0,r>>>=0,i<=r)return"";for(t||(t="utf8");;)switch(t){case"hex":return I(this,r,i);case"utf8":case"utf-8":return T(this,r,i);case"ascii":return U(this,r,i);case"latin1":case"binary":return S(this,r,i);case"base64":return B(this,r,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return z(this,r,i);default:if(e)throw new TypeError("Unknown encoding: "+t);t=(t+"").toLowerCase(),e=!0}}function g(t,r,i){var e=t[r];t[r]=t[i],t[i]=e}function w(t,r,i,e,o){if(0===t.length)return-1;if("string"==typeof i?(e=i,i=0):i>2147483647?i=2147483647:i<-2147483648&&(i=-2147483648),i=+i,isNaN(i)&&(i=o?0:t.length-1),i<0&&(i=t.length+i),i>=t.length){if(o)return-1;i=t.length-1}else if(i<0){if(!o)return-1;i=0}if("string"==typeof r&&(r=h.from(r,e)),h.isBuffer(r))return 0===r.length?-1:v(t,r,i,e,o);if("number"==typeof r)return r&=255,h.TYPED_ARRAY_SUPPORT&&"function"==typeof Uint8Array.prototype.indexOf?o?Uint8Array.prototype.indexOf.call(t,r,i):Uint8Array.prototype.lastIndexOf.call(t,r,i):v(t,[r],i,e,o);throw new TypeError("val must be string, number or Buffer")}function v(t,r,i,e,o){function h(t,r){return 1===n?t[r]:t.readUInt16BE(r*n)}var n=1,s=t.length,a=r.length;if(void 0!==e&&("ucs2"===(e=String(e).toLowerCase())||"ucs-2"===e||"utf16le"===e||"utf-16le"===e)){if(t.length<2||r.length<2)return-1;n=2,s/=2,a/=2,i/=2}var u;if(o){var f=-1;for(u=i;u<s;u++)if(h(t,u)===h(r,-1===f?0:u-f)){if(-1===f&&(f=u),u-f+1===a)return f*n}else-1!==f&&(u-=u-f),f=-1}else for(i+a>s&&(i=s-a),u=i;u>=0;u--){for(var l=!0,c=0;c<a;c++)if(h(t,u+c)!==h(r,c)){l=!1;break}if(l)return u}return-1}function A(t,r,i,e){i=Number(i)||0;var o=t.length-i;e?(e=Number(e))>o&&(e=o):e=o;var h=r.length;if(h%2!=0)throw new TypeError("Invalid hex string");e>h/2&&(e=h/2);for(var n=0;n<e;++n){var s=parseInt(r.substr(2*n,2),16);if(isNaN(s))return n;t[i+n]=s}return n}function C(t,r,i,e){return Z(X(r,t.length-i),t,i,e)}function b(t,r,i,e){return Z(H(r),t,i,e)}function E(t,r,i,e){return b(t,r,i,e)}function R(t,r,i,e){return Z(J(r),t,i,e)}function x(t,r,i,e){return Z(V(r,t.length-i),t,i,e)}function B(t,r,i){return 0===r&&i===t.length?K.fromByteArray(t):K.fromByteArray(t.slice(r,i))}function T(t,r,i){i=Math.min(t.length,i);for(var e=[],o=r;o<i;){var h=t[o],n=null,s=h>239?4:h>223?3:h>191?2:1;if(o+s<=i){var a,u,f,l;switch(s){case 1:h<128&&(n=h);break;case 2:a=t[o+1],128==(192&a)&&(l=(31&h)<<6|63&a)>127&&(n=l);break;case 3:a=t[o+1],u=t[o+2],128==(192&a)&&128==(192&u)&&(l=(15&h)<<12|(63&a)<<6|63&u)>2047&&(l<55296||l>57343)&&(n=l);break;case 4:a=t[o+1],u=t[o+2],f=t[o+3],128==(192&a)&&128==(192&u)&&128==(192&f)&&(l=(15&h)<<18|(63&a)<<12|(63&u)<<6|63&f)>65535&&l<1114112&&(n=l)}}null===n?(n=65533,s=1):n>65535&&(n-=65536,e.push(n>>>10&1023|55296),n=56320|1023&n),e.push(n),o+=s}return P(e)}function P(t){var r=t.length;if(r<=$)return String.fromCharCode.apply(String,t);for(var i="",e=0;e<r;)i+=String.fromCharCode.apply(String,t.slice(e,e+=$));return i}function U(t,r,i){var e="";i=Math.min(t.length,i);for(var o=r;o<i;++o)e+=String.fromCharCode(127&t[o]);return e}function S(t,r,i){var e="";i=Math.min(t.length,i);for(var o=r;o<i;++o)e+=String.fromCharCode(t[o]);return e}function I(t,r,i){var e=t.length;(!r||r<0)&&(r=0),(!i||i<0||i>e)&&(i=e);for(var o="",h=r;h<i;++h)o+=q(t[h]);return o}function z(t,r,i){for(var e=t.slice(r,i),o="",h=0;h<e.length;h+=2)o+=String.fromCharCode(e[h]+256*e[h+1]);return o}function Y(t,r,i){if(t%1!=0||t<0)throw new RangeError("offset is not uint");if(t+r>i)throw new RangeError("Trying to access beyond buffer length")}function M(t,r,i,e,o,n){if(!h.isBuffer(t))throw new TypeError('"buffer" argument must be a Buffer instance');if(r>o||r<n)throw new RangeError('"value" argument is out of bounds');if(i+e>t.length)throw new RangeError("Index out of range")}function L(t,r,i,e){r<0&&(r=65535+r+1);for(var o=0,h=Math.min(t.length-i,2);o<h;++o)t[i+o]=(r&255<<8*(e?o:1-o))>>>8*(e?o:1-o)}function O(t,r,i,e){r<0&&(r=4294967295+r+1);for(var o=0,h=Math.min(t.length-i,4);o<h;++o)t[i+o]=r>>>8*(e?o:3-o)&255}function N(t,r,i,e,o,h){if(i+e>t.length)throw new RangeError("Index out of range");if(i<0)throw new RangeError("Index out of range")}function D(t,r,i,e,o){return o||N(t,r,i,4,3.4028234663852886e38,-3.4028234663852886e38),Q.write(t,r,i,e,23,4),i+4}function k(t,r,i,e,o){return o||N(t,r,i,8,1.7976931348623157e308,-1.7976931348623157e308),Q.write(t,r,i,e,52,8),i+8}function j(t){if(t=F(t).replace(tt,""),t.length<2)return"";for(;t.length%4!=0;)t+="=";return t}function F(t){return t.trim?t.trim():t.replace(/^\s+|\s+$/g,"")}function q(t){return t<16?"0"+t.toString(16):t.toString(16)}function X(t,r){r=r||1/0;for(var i,e=t.length,o=null,h=[],n=0;n<e;++n){if((i=t.charCodeAt(n))>55295&&i<57344){if(!o){if(i>56319){(r-=3)>-1&&h.push(239,191,189);continue}if(n+1===e){(r-=3)>-1&&h.push(239,191,189);continue}o=i;continue}if(i<56320){(r-=3)>-1&&h.push(239,191,189),o=i;continue}i=65536+(o-55296<<10|i-56320)}else o&&(r-=3)>-1&&h.push(239,191,189);if(o=null,i<128){if((r-=1)<0)break;h.push(i)}else if(i<2048){if((r-=2)<0)break;h.push(i>>6|192,63&i|128)}else if(i<65536){if((r-=3)<0)break;h.push(i>>12|224,i>>6&63|128,63&i|128)}else{if(!(i<1114112))throw new Error("Invalid code point");if((r-=4)<0)break;h.push(i>>18|240,i>>12&63|128,i>>6&63|128,63&i|128)}}return h}function H(t){for(var r=[],i=0;i<t.length;++i)r.push(255&t.charCodeAt(i));return r}function V(t,r){for(var i,e,o,h=[],n=0;n<t.length&&!((r-=2)<0);++n)i=t.charCodeAt(n),e=i>>8,o=i%256,h.push(o),h.push(e);return h}function J(t){return K.toByteArray(j(t))}function Z(t,r,i,e){for(var o=0;o<e&&!(o+i>=r.length||o>=t.length);++o)r[o+i]=t[o];return o}function G(t){return t!==t}var K=i(5),Q=i(6),W=i(7);r.Buffer=h,r.SlowBuffer=y,r.INSPECT_MAX_BYTES=50,h.TYPED_ARRAY_SUPPORT=void 0!==t.TYPED_ARRAY_SUPPORT?t.TYPED_ARRAY_SUPPORT:function(){try{var t=new Uint8Array(1);return t.__proto__={__proto__:Uint8Array.prototype,foo:function(){return 42}},42===t.foo()&&"function"==typeof t.subarray&&0===t.subarray(1,1).byteLength}catch(t){return!1}}(),r.kMaxLength=e(),h.poolSize=8192,h._augment=function(t){return t.__proto__=h.prototype,t},h.from=function(t,r,i){return n(null,t,r,i)},h.TYPED_ARRAY_SUPPORT&&(h.prototype.__proto__=Uint8Array.prototype,h.__proto__=Uint8Array,"undefined"!=typeof Symbol&&Symbol.species&&h[Symbol.species]===h&&Object.defineProperty(h,Symbol.species,{value:null,configurable:!0})),h.alloc=function(t,r,i){return a(null,t,r,i)},h.allocUnsafe=function(t){return u(null,t)},h.allocUnsafeSlow=function(t){return u(null,t)},h.isBuffer=function(t){return!(null==t||!t._isBuffer)},h.compare=function(t,r){if(!h.isBuffer(t)||!h.isBuffer(r))throw new TypeError("Arguments must be Buffers");if(t===r)return 0;for(var i=t.length,e=r.length,o=0,n=Math.min(i,e);o<n;++o)if(t[o]!==r[o]){i=t[o],e=r[o];break}return i<e?-1:e<i?1:0},h.isEncoding=function(t){switch(String(t).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!0;default:return!1}},h.concat=function(t,r){if(!W(t))throw new TypeError('"list" argument must be an Array of Buffers');if(0===t.length)return h.alloc(0);var i;if(void 0===r)for(r=0,i=0;i<t.length;++i)r+=t[i].length;var e=h.allocUnsafe(r),o=0;for(i=0;i<t.length;++i){var n=t[i];if(!h.isBuffer(n))throw new TypeError('"list" argument must be an Array of Buffers');n.copy(e,o),o+=n.length}return e},h.byteLength=_,h.prototype._isBuffer=!0,h.prototype.swap16=function(){var t=this.length;if(t%2!=0)throw new RangeError("Buffer size must be a multiple of 16-bits");for(var r=0;r<t;r+=2)g(this,r,r+1);return this},h.prototype.swap32=function(){var t=this.length;if(t%4!=0)throw new RangeError("Buffer size must be a multiple of 32-bits");for(var r=0;r<t;r+=4)g(this,r,r+3),g(this,r+1,r+2);return this},h.prototype.swap64=function(){var t=this.length;if(t%8!=0)throw new RangeError("Buffer size must be a multiple of 64-bits");for(var r=0;r<t;r+=8)g(this,r,r+7),g(this,r+1,r+6),g(this,r+2,r+5),g(this,r+3,r+4);return this},h.prototype.toString=function(){var t=0|this.length;return 0===t?"":0===arguments.length?T(this,0,t):d.apply(this,arguments)},h.prototype.equals=function(t){if(!h.isBuffer(t))throw new TypeError("Argument must be a Buffer");return this===t||0===h.compare(this,t)},h.prototype.inspect=function(){var t="",i=r.INSPECT_MAX_BYTES;return this.length>0&&(t=this.toString("hex",0,i).match(/.{2}/g).join(" "),this.length>i&&(t+=" ... ")),"<Buffer "+t+">"},h.prototype.compare=function(t,r,i,e,o){if(!h.isBuffer(t))throw new TypeError("Argument must be a Buffer");if(void 0===r&&(r=0),void 0===i&&(i=t?t.length:0),void 0===e&&(e=0),void 0===o&&(o=this.length),r<0||i>t.length||e<0||o>this.length)throw new RangeError("out of range index");if(e>=o&&r>=i)return 0;if(e>=o)return-1;if(r>=i)return 1;if(r>>>=0,i>>>=0,e>>>=0,o>>>=0,this===t)return 0;for(var n=o-e,s=i-r,a=Math.min(n,s),u=this.slice(e,o),f=t.slice(r,i),l=0;l<a;++l)if(u[l]!==f[l]){n=u[l],s=f[l];break}return n<s?-1:s<n?1:0},h.prototype.includes=function(t,r,i){return-1!==this.indexOf(t,r,i)},h.prototype.indexOf=function(t,r,i){return w(this,t,r,i,!0)},h.prototype.lastIndexOf=function(t,r,i){return w(this,t,r,i,!1)},h.prototype.write=function(t,r,i,e){if(void 0===r)e="utf8",i=this.length,r=0;else if(void 0===i&&"string"==typeof r)e=r,i=this.length,r=0;else{if(!isFinite(r))throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported");r|=0,isFinite(i)?(i|=0,void 0===e&&(e="utf8")):(e=i,i=void 0)}var o=this.length-r;if((void 0===i||i>o)&&(i=o),t.length>0&&(i<0||r<0)||r>this.length)throw new RangeError("Attempt to write outside buffer bounds");e||(e="utf8");for(var h=!1;;)switch(e){case"hex":return A(this,t,r,i);case"utf8":case"utf-8":return C(this,t,r,i);case"ascii":return b(this,t,r,i);case"latin1":case"binary":return E(this,t,r,i);case"base64":return R(this,t,r,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return x(this,t,r,i);default:if(h)throw new TypeError("Unknown encoding: "+e);e=(""+e).toLowerCase(),h=!0}},h.prototype.toJSON=function(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};var $=4096;h.prototype.slice=function(t,r){var i=this.length;t=~~t,r=void 0===r?i:~~r,t<0?(t+=i)<0&&(t=0):t>i&&(t=i),r<0?(r+=i)<0&&(r=0):r>i&&(r=i),r<t&&(r=t);var e;if(h.TYPED_ARRAY_SUPPORT)e=this.subarray(t,r),e.__proto__=h.prototype;else{var o=r-t;e=new h(o,void 0);for(var n=0;n<o;++n)e[n]=this[n+t]}return e},h.prototype.readUIntLE=function(t,r,i){t|=0,r|=0,i||Y(t,r,this.length);for(var e=this[t],o=1,h=0;++h<r&&(o*=256);)e+=this[t+h]*o;return e},h.prototype.readUIntBE=function(t,r,i){t|=0,r|=0,i||Y(t,r,this.length);for(var e=this[t+--r],o=1;r>0&&(o*=256);)e+=this[t+--r]*o;return e},h.prototype.readUInt8=function(t,r){return r||Y(t,1,this.length),this[t]},h.prototype.readUInt16LE=function(t,r){return r||Y(t,2,this.length),this[t]|this[t+1]<<8},h.prototype.readUInt16BE=function(t,r){return r||Y(t,2,this.length),this[t]<<8|this[t+1]},h.prototype.readUInt32LE=function(t,r){return r||Y(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},h.prototype.readUInt32BE=function(t,r){return r||Y(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},h.prototype.readIntLE=function(t,r,i){t|=0,r|=0,i||Y(t,r,this.length);for(var e=this[t],o=1,h=0;++h<r&&(o*=256);)e+=this[t+h]*o;return o*=128,e>=o&&(e-=Math.pow(2,8*r)),e},h.prototype.readIntBE=function(t,r,i){t|=0,r|=0,i||Y(t,r,this.length);for(var e=r,o=1,h=this[t+--e];e>0&&(o*=256);)h+=this[t+--e]*o;return o*=128,h>=o&&(h-=Math.pow(2,8*r)),h},h.prototype.readInt8=function(t,r){return r||Y(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},h.prototype.readInt16LE=function(t,r){r||Y(t,2,this.length);var i=this[t]|this[t+1]<<8;return 32768&i?4294901760|i:i},h.prototype.readInt16BE=function(t,r){r||Y(t,2,this.length);var i=this[t+1]|this[t]<<8;return 32768&i?4294901760|i:i},h.prototype.readInt32LE=function(t,r){return r||Y(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},h.prototype.readInt32BE=function(t,r){return r||Y(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},h.prototype.readFloatLE=function(t,r){return r||Y(t,4,this.length),Q.read(this,t,!0,23,4)},h.prototype.readFloatBE=function(t,r){return r||Y(t,4,this.length),Q.read(this,t,!1,23,4)},h.prototype.readDoubleLE=function(t,r){return r||Y(t,8,this.length),Q.read(this,t,!0,52,8)},h.prototype.readDoubleBE=function(t,r){return r||Y(t,8,this.length),Q.read(this,t,!1,52,8)},h.prototype.writeUIntLE=function(t,r,i,e){if(t=+t,r|=0,i|=0,!e){M(this,t,r,i,Math.pow(2,8*i)-1,0)}var o=1,h=0;for(this[r]=255&t;++h<i&&(o*=256);)this[r+h]=t/o&255;return r+i},h.prototype.writeUIntBE=function(t,r,i,e){if(t=+t,r|=0,i|=0,!e){M(this,t,r,i,Math.pow(2,8*i)-1,0)}var o=i-1,h=1;for(this[r+o]=255&t;--o>=0&&(h*=256);)this[r+o]=t/h&255;return r+i},h.prototype.writeUInt8=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,1,255,0),h.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),this[r]=255&t,r+1},h.prototype.writeUInt16LE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,2,65535,0),h.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8):L(this,t,r,!0),r+2},h.prototype.writeUInt16BE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,2,65535,0),h.TYPED_ARRAY_SUPPORT?(this[r]=t>>>8,this[r+1]=255&t):L(this,t,r,!1),r+2},h.prototype.writeUInt32LE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,4,4294967295,0),h.TYPED_ARRAY_SUPPORT?(this[r+3]=t>>>24,this[r+2]=t>>>16,this[r+1]=t>>>8,this[r]=255&t):O(this,t,r,!0),r+4},h.prototype.writeUInt32BE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,4,4294967295,0),h.TYPED_ARRAY_SUPPORT?(this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t):O(this,t,r,!1),r+4},h.prototype.writeIntLE=function(t,r,i,e){if(t=+t,r|=0,!e){var o=Math.pow(2,8*i-1);M(this,t,r,i,o-1,-o)}var h=0,n=1,s=0;for(this[r]=255&t;++h<i&&(n*=256);)t<0&&0===s&&0!==this[r+h-1]&&(s=1),this[r+h]=(t/n>>0)-s&255;return r+i},h.prototype.writeIntBE=function(t,r,i,e){if(t=+t,r|=0,!e){var o=Math.pow(2,8*i-1);M(this,t,r,i,o-1,-o)}var h=i-1,n=1,s=0;for(this[r+h]=255&t;--h>=0&&(n*=256);)t<0&&0===s&&0!==this[r+h+1]&&(s=1),this[r+h]=(t/n>>0)-s&255;return r+i},h.prototype.writeInt8=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,1,127,-128),h.TYPED_ARRAY_SUPPORT||(t=Math.floor(t)),t<0&&(t=255+t+1),this[r]=255&t,r+1},h.prototype.writeInt16LE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,2,32767,-32768),h.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8):L(this,t,r,!0),r+2},h.prototype.writeInt16BE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,2,32767,-32768),h.TYPED_ARRAY_SUPPORT?(this[r]=t>>>8,this[r+1]=255&t):L(this,t,r,!1),r+2},h.prototype.writeInt32LE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,4,2147483647,-2147483648),h.TYPED_ARRAY_SUPPORT?(this[r]=255&t,this[r+1]=t>>>8,this[r+2]=t>>>16,this[r+3]=t>>>24):O(this,t,r,!0),r+4},h.prototype.writeInt32BE=function(t,r,i){return t=+t,r|=0,i||M(this,t,r,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),h.TYPED_ARRAY_SUPPORT?(this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t):O(this,t,r,!1),r+4},h.prototype.writeFloatLE=function(t,r,i){return D(this,t,r,!0,i)},h.prototype.writeFloatBE=function(t,r,i){return D(this,t,r,!1,i)},h.prototype.writeDoubleLE=function(t,r,i){return k(this,t,r,!0,i)},h.prototype.writeDoubleBE=function(t,r,i){return k(this,t,r,!1,i)},h.prototype.copy=function(t,r,i,e){if(i||(i=0),e||0===e||(e=this.length),r>=t.length&&(r=t.length),r||(r=0),e>0&&e<i&&(e=i),e===i)return 0;if(0===t.length||0===this.length)return 0;if(r<0)throw new RangeError("targetStart out of bounds");if(i<0||i>=this.length)throw new RangeError("sourceStart out of bounds");if(e<0)throw new RangeError("sourceEnd out of bounds");e>this.length&&(e=this.length),t.length-r<e-i&&(e=t.length-r+i);var o,n=e-i;if(this===t&&i<r&&r<e)for(o=n-1;o>=0;--o)t[o+r]=this[o+i];else if(n<1e3||!h.TYPED_ARRAY_SUPPORT)for(o=0;o<n;++o)t[o+r]=this[o+i];else Uint8Array.prototype.set.call(t,this.subarray(i,i+n),r);return n},h.prototype.fill=function(t,r,i,e){if("string"==typeof t){if("string"==typeof r?(e=r,r=0,i=this.length):"string"==typeof i&&(e=i,i=this.length),1===t.length){var o=t.charCodeAt(0);o<256&&(t=o)}if(void 0!==e&&"string"!=typeof e)throw new TypeError("encoding must be a string");if("string"==typeof e&&!h.isEncoding(e))throw new TypeError("Unknown encoding: "+e)}else"number"==typeof t&&(t&=255);if(r<0||this.length<r||this.length<i)throw new RangeError("Out of range index");if(i<=r)return this;r>>>=0,i=void 0===i?this.length:i>>>0,t||(t=0);var n;if("number"==typeof t)for(n=r;n<i;++n)this[n]=t;else{var s=h.isBuffer(t)?t:X(new h(t,e).toString()),a=s.length;for(n=0;n<i-r;++n)this[n+r]=s[n%a]}return this};var tt=/[^+\/0-9A-Za-z-_]/g}).call(r,i(4))},function(t,r,i){r.UINT32=i(8),r.UINT64=i(9)},function(t,r,i){t.exports={h32:i(3),h64:i(10)}},function(t,r,i){(function(r){function e(t){for(var r=[],i=0,e=t.length;i<e;i++){var o=t.charCodeAt(i);o<128?r.push(o):o<2048?r.push(192|o>>6,128|63&o):o<55296||o>=57344?r.push(224|o>>12,128|o>>6&63,128|63&o):(i++,o=65536+((1023&o)<<10|1023&t.charCodeAt(i)),r.push(240|o>>18,128|o>>12&63,128|o>>6&63,128|63&o))}return new Uint8Array(r)}function o(){return 2==arguments.length?new o(arguments[1]).update(arguments[0]).digest():this instanceof o?void h.call(this,arguments[0]):new o(arguments[0])}function h(t){return this.seed=t instanceof n?t.clone():n(t),this.v1=this.seed.clone().add(s).add(a),this.v2=this.seed.clone().add(a),this.v3=this.seed.clone(),this.v4=this.seed.clone().subtract(s),this.total_len=0,this.memsize=0,this.memory=null,this}var n=i(1).UINT32;n.prototype.xxh_update=function(t,r){var i,e,o=a._low,h=a._high;e=t*o,i=e>>>16,i+=r*o,i&=65535,i+=t*h;var n=this._low+(65535&e),u=n>>>16;u+=this._high+(65535&i);var f=u<<16|65535&n;f=f<<13|f>>>19,n=65535&f,u=f>>>16,o=s._low,h=s._high,e=n*o,i=e>>>16,i+=u*o,i&=65535,i+=n*h,this._low=65535&e,this._high=65535&i};var s=n("2654435761"),a=n("2246822519"),u=n("3266489917"),f=n("668265263"),l=n("374761393");o.prototype.init=h,o.prototype.update=function(t){var i,o="string"==typeof t;o&&(t=e(t),o=!1,i=!0),"undefined"!=typeof ArrayBuffer&&t instanceof ArrayBuffer&&(i=!0,t=new Uint8Array(t));var h=0,n=t.length,s=h+n;if(0==n)return this;if(this.total_len+=n,0==this.memsize&&(this.memory=o?"":i?new Uint8Array(16):new r(16)),this.memsize+n<16)return o?this.memory+=t:i?this.memory.set(t.subarray(0,n),this.memsize):t.copy(this.memory,this.memsize,0,n),this.memsize+=n,this;if(this.memsize>0){o?this.memory+=t.slice(0,16-this.memsize):i?this.memory.set(t.subarray(0,16-this.memsize),this.memsize):t.copy(this.memory,this.memsize,0,16-this.memsize);var a=0;o?(this.v1.xxh_update(this.memory.charCodeAt(a+1)<<8|this.memory.charCodeAt(a),this.memory.charCodeAt(a+3)<<8|this.memory.charCodeAt(a+2)),a+=4,this.v2.xxh_update(this.memory.charCodeAt(a+1)<<8|this.memory.charCodeAt(a),this.memory.charCodeAt(a+3)<<8|this.memory.charCodeAt(a+2)),a+=4,this.v3.xxh_update(this.memory.charCodeAt(a+1)<<8|this.memory.charCodeAt(a),this.memory.charCodeAt(a+3)<<8|this.memory.charCodeAt(a+2)),a+=4,this.v4.xxh_update(this.memory.charCodeAt(a+1)<<8|this.memory.charCodeAt(a),this.memory.charCodeAt(a+3)<<8|this.memory.charCodeAt(a+2))):(this.v1.xxh_update(this.memory[a+1]<<8|this.memory[a],this.memory[a+3]<<8|this.memory[a+2]),a+=4,this.v2.xxh_update(this.memory[a+1]<<8|this.memory[a],this.memory[a+3]<<8|this.memory[a+2]),a+=4,this.v3.xxh_update(this.memory[a+1]<<8|this.memory[a],this.memory[a+3]<<8|this.memory[a+2]),a+=4,this.v4.xxh_update(this.memory[a+1]<<8|this.memory[a],this.memory[a+3]<<8|this.memory[a+2])),h+=16-this.memsize,this.memsize=0,o&&(this.memory="")}if(h<=s-16){var u=s-16;do{o?(this.v1.xxh_update(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2)),h+=4,this.v2.xxh_update(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2)),h+=4,this.v3.xxh_update(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2)),h+=4,this.v4.xxh_update(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2))):(this.v1.xxh_update(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2]),h+=4,this.v2.xxh_update(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2]),h+=4,this.v3.xxh_update(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2]),h+=4,this.v4.xxh_update(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2])),h+=4}while(h<=u)}return h<s&&(o?this.memory+=t.slice(h):i?this.memory.set(t.subarray(h,s),this.memsize):t.copy(this.memory,this.memsize,h,s),this.memsize=s-h),this},o.prototype.digest=function(){var t,r,i=this.memory,e="string"==typeof i,o=0,h=this.memsize,c=new n;for(t=this.total_len>=16?this.v1.rotl(1).add(this.v2.rotl(7).add(this.v3.rotl(12).add(this.v4.rotl(18)))):this.seed.clone().add(l),t.add(c.fromNumber(this.total_len));o<=h-4;)e?c.fromBits(i.charCodeAt(o+1)<<8|i.charCodeAt(o),i.charCodeAt(o+3)<<8|i.charCodeAt(o+2)):c.fromBits(i[o+1]<<8|i[o],i[o+3]<<8|i[o+2]),t.add(c.multiply(u)).rotl(17).multiply(f),o+=4;for(;o<h;)c.fromBits(e?i.charCodeAt(o++):i[o++],0),t.add(c.multiply(l)).rotl(11).multiply(s);return r=t.clone().shiftRight(15),t.xor(r).multiply(a),r=t.clone().shiftRight(13),t.xor(r).multiply(u),r=t.clone().shiftRight(16),t.xor(r),this.init(this.seed),t},t.exports=o}).call(r,i(0).Buffer)},function(t,r){var i;i=function(){return this}();try{i=i||Function("return this")()||(0,eval)("this")}catch(t){"object"==typeof window&&(i=window)}t.exports=i},function(t,r,i){"use strict";function e(t){var r=t.length;if(r%4>0)throw new Error("Invalid string. Length must be a multiple of 4");return"="===t[r-2]?2:"="===t[r-1]?1:0}function o(t){return 3*t.length/4-e(t)}function h(t){var r,i,o,h,n,s=t.length;h=e(t),n=new l(3*s/4-h),i=h>0?s-4:s;var a=0;for(r=0;r<i;r+=4)o=f[t.charCodeAt(r)]<<18|f[t.charCodeAt(r+1)]<<12|f[t.charCodeAt(r+2)]<<6|f[t.charCodeAt(r+3)],n[a++]=o>>16&255,n[a++]=o>>8&255,n[a++]=255&o;return 2===h?(o=f[t.charCodeAt(r)]<<2|f[t.charCodeAt(r+1)]>>4,n[a++]=255&o):1===h&&(o=f[t.charCodeAt(r)]<<10|f[t.charCodeAt(r+1)]<<4|f[t.charCodeAt(r+2)]>>2,n[a++]=o>>8&255,n[a++]=255&o),n}function n(t){return u[t>>18&63]+u[t>>12&63]+u[t>>6&63]+u[63&t]}function s(t,r,i){for(var e,o=[],h=r;h<i;h+=3)e=(t[h]<<16)+(t[h+1]<<8)+t[h+2],o.push(n(e));return o.join("")}function a(t){for(var r,i=t.length,e=i%3,o="",h=[],n=0,a=i-e;n<a;n+=16383)h.push(s(t,n,n+16383>a?a:n+16383));return 1===e?(r=t[i-1],o+=u[r>>2],o+=u[r<<4&63],o+="=="):2===e&&(r=(t[i-2]<<8)+t[i-1],o+=u[r>>10],o+=u[r>>4&63],o+=u[r<<2&63],o+="="),h.push(o),h.join("")}r.byteLength=o,r.toByteArray=h,r.fromByteArray=a;for(var u=[],f=[],l="undefined"!=typeof Uint8Array?Uint8Array:Array,c="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",p=0,m=c.length;p<m;++p)u[p]=c[p],f[c.charCodeAt(p)]=p;f["-".charCodeAt(0)]=62,f["_".charCodeAt(0)]=63},function(t,r){r.read=function(t,r,i,e,o){var h,n,s=8*o-e-1,a=(1<<s)-1,u=a>>1,f=-7,l=i?o-1:0,c=i?-1:1,p=t[r+l];for(l+=c,h=p&(1<<-f)-1,p>>=-f,f+=s;f>0;h=256*h+t[r+l],l+=c,f-=8);for(n=h&(1<<-f)-1,h>>=-f,f+=e;f>0;n=256*n+t[r+l],l+=c,f-=8);if(0===h)h=1-u;else{if(h===a)return n?NaN:1/0*(p?-1:1);n+=Math.pow(2,e),h-=u}return(p?-1:1)*n*Math.pow(2,h-e)},r.write=function(t,r,i,e,o,h){var n,s,a,u=8*h-o-1,f=(1<<u)-1,l=f>>1,c=23===o?Math.pow(2,-24)-Math.pow(2,-77):0,p=e?0:h-1,m=e?1:-1,y=r<0||0===r&&1/r<0?1:0;for(r=Math.abs(r),isNaN(r)||r===1/0?(s=isNaN(r)?1:0,n=f):(n=Math.floor(Math.log(r)/Math.LN2),r*(a=Math.pow(2,-n))<1&&(n--,a*=2),r+=n+l>=1?c/a:c*Math.pow(2,1-l),r*a>=2&&(n++,a/=2),n+l>=f?(s=0,n=f):n+l>=1?(s=(r*a-1)*Math.pow(2,o),n+=l):(s=r*Math.pow(2,l-1)*Math.pow(2,o),n=0));o>=8;t[i+p]=255&s,p+=m,s/=256,o-=8);for(n=n<<o|s,u+=o;u>0;t[i+p]=255&n,p+=m,n/=256,u-=8);t[i+p-m]|=128*y}},function(t,r){var i={}.toString;t.exports=Array.isArray||function(t){return"[object Array]"==i.call(t)}},function(t,r,i){var e,o;!function(i){function h(t,r){return this instanceof h?(this._low=0,this._high=0,this.remainder=null,void 0===r?s.call(this,t):"string"==typeof t?a.call(this,t,r):void n.call(this,t,r)):new h(t,r)}function n(t,r){return this._low=0|t,this._high=0|r,this}function s(t){return this._low=65535&t,this._high=t>>>16,this}function a(t,r){var i=parseInt(t,r||10);return this._low=65535&i,this._high=i>>>16,this}h(Math.pow(36,5)),h(Math.pow(16,7)),h(Math.pow(10,9)),h(Math.pow(2,30)),h(36),h(16),h(10),h(2);h.prototype.fromBits=n,h.prototype.fromNumber=s,h.prototype.fromString=a,h.prototype.toNumber=function(){return 65536*this._high+this._low},h.prototype.toString=function(t){return this.toNumber().toString(t||10)},h.prototype.add=function(t){var r=this._low+t._low,i=r>>>16;return i+=this._high+t._high,this._low=65535&r,this._high=65535&i,this},h.prototype.subtract=function(t){return this.add(t.clone().negate())},h.prototype.multiply=function(t){var r,i,e=this._high,o=this._low,h=t._high,n=t._low;return i=o*n,r=i>>>16,r+=e*n,r&=65535,r+=o*h,this._low=65535&i,this._high=65535&r,this},h.prototype.div=function(t){if(0==t._low&&0==t._high)throw Error("division by zero");if(0==t._high&&1==t._low)return this.remainder=new h(0),this;if(t.gt(this))return this.remainder=this.clone(),this._low=0,this._high=0,this;if(this.eq(t))return this.remainder=new h(0),this._low=1,this._high=0,this;for(var r=t.clone(),i=-1;!this.lt(r);)r.shiftLeft(1,!0),i++;for(this.remainder=this.clone(),this._low=0,this._high=0;i>=0;i--)r.shiftRight(1),this.remainder.lt(r)||(this.remainder.subtract(r),i>=16?this._high|=1<<i-16:this._low|=1<<i);return this},h.prototype.negate=function(){var t=1+(65535&~this._low);return this._low=65535&t,this._high=~this._high+(t>>>16)&65535,this},h.prototype.equals=h.prototype.eq=function(t){return this._low==t._low&&this._high==t._high},h.prototype.greaterThan=h.prototype.gt=function(t){return this._high>t._high||!(this._high<t._high)&&this._low>t._low},h.prototype.lessThan=h.prototype.lt=function(t){return this._high<t._high||!(this._high>t._high)&&this._low<t._low},h.prototype.or=function(t){return this._low|=t._low,this._high|=t._high,this},h.prototype.and=function(t){return this._low&=t._low,this._high&=t._high,this},h.prototype.not=function(){return this._low=65535&~this._low,this._high=65535&~this._high,this},h.prototype.xor=function(t){return this._low^=t._low,this._high^=t._high,this},h.prototype.shiftRight=h.prototype.shiftr=function(t){return t>16?(this._low=this._high>>t-16,this._high=0):16==t?(this._low=this._high,this._high=0):(this._low=this._low>>t|this._high<<16-t&65535,this._high>>=t),this},h.prototype.shiftLeft=h.prototype.shiftl=function(t,r){return t>16?(this._high=this._low<<t-16,this._low=0,r||(this._high&=65535)):16==t?(this._high=this._low,this._low=0):(this._high=this._high<<t|this._low>>16-t,this._low=this._low<<t&65535,r||(this._high&=65535)),this},h.prototype.rotateLeft=h.prototype.rotl=function(t){var r=this._high<<16|this._low;return r=r<<t|r>>>32-t,this._low=65535&r,this._high=r>>>16,this},h.prototype.rotateRight=h.prototype.rotr=function(t){var r=this._high<<16|this._low;return r=r>>>t|r<<32-t,this._low=65535&r,this._high=r>>>16,this},h.prototype.clone=function(){return new h(this._low,this._high)},e=[],void 0!==(o=function(){return h}.apply(r,e))&&(t.exports=o)}()},function(t,r,i){var e,o;!function(i){function h(t,r,i,e){return this instanceof h?(this.remainder=null,"string"==typeof t?a.call(this,t,r):void 0===r?s.call(this,t):void n.apply(this,arguments)):new h(t,r,i,e)}function n(t,r,i,e){return void 0===i?(this._a00=65535&t,this._a16=t>>>16,this._a32=65535&r,this._a48=r>>>16,this):(this._a00=0|t,this._a16=0|r,this._a32=0|i,this._a48=0|e,this)}function s(t){return this._a00=65535&t,this._a16=t>>>16,this._a32=0,this._a48=0,this}function a(t,r){r=r||10,this._a00=0,this._a16=0,this._a32=0,this._a48=0;for(var i=u[r]||new h(Math.pow(r,5)),e=0,o=t.length;e<o;e+=5){var n=Math.min(5,o-e),s=parseInt(t.slice(e,e+n),r);this.multiply(n<5?new h(Math.pow(r,n)):i).add(new h(s))}return this}var u={16:h(Math.pow(16,5)),10:h(Math.pow(10,5)),2:h(Math.pow(2,5))},f={16:h(16),10:h(10),2:h(2)};h.prototype.fromBits=n,h.prototype.fromNumber=s,h.prototype.fromString=a,h.prototype.toNumber=function(){return 65536*this._a16+this._a00},h.prototype.toString=function(t){t=t||10;var r=f[t]||new h(t);if(!this.gt(r))return this.toNumber().toString(t)
+;for(var i=this.clone(),e=new Array(64),o=63;o>=0&&(i.div(r),e[o]=i.remainder.toNumber().toString(t),i.gt(r));o--);return e[o-1]=i.toNumber().toString(t),e.join("")},h.prototype.add=function(t){var r=this._a00+t._a00,i=r>>>16;i+=this._a16+t._a16;var e=i>>>16;e+=this._a32+t._a32;var o=e>>>16;return o+=this._a48+t._a48,this._a00=65535&r,this._a16=65535&i,this._a32=65535&e,this._a48=65535&o,this},h.prototype.subtract=function(t){return this.add(t.clone().negate())},h.prototype.multiply=function(t){var r=this._a00,i=this._a16,e=this._a32,o=this._a48,h=t._a00,n=t._a16,s=t._a32,a=t._a48,u=r*h,f=u>>>16;f+=r*n;var l=f>>>16;f&=65535,f+=i*h,l+=f>>>16,l+=r*s;var c=l>>>16;return l&=65535,l+=i*n,c+=l>>>16,l&=65535,l+=e*h,c+=l>>>16,c+=r*a,c&=65535,c+=i*s,c&=65535,c+=e*n,c&=65535,c+=o*h,this._a00=65535&u,this._a16=65535&f,this._a32=65535&l,this._a48=65535&c,this},h.prototype.div=function(t){if(0==t._a16&&0==t._a32&&0==t._a48){if(0==t._a00)throw Error("division by zero");if(1==t._a00)return this.remainder=new h(0),this}if(t.gt(this))return this.remainder=this.clone(),this._a00=0,this._a16=0,this._a32=0,this._a48=0,this;if(this.eq(t))return this.remainder=new h(0),this._a00=1,this._a16=0,this._a32=0,this._a48=0,this;for(var r=t.clone(),i=-1;!this.lt(r);)r.shiftLeft(1,!0),i++;for(this.remainder=this.clone(),this._a00=0,this._a16=0,this._a32=0,this._a48=0;i>=0;i--)r.shiftRight(1),this.remainder.lt(r)||(this.remainder.subtract(r),i>=48?this._a48|=1<<i-48:i>=32?this._a32|=1<<i-32:i>=16?this._a16|=1<<i-16:this._a00|=1<<i);return this},h.prototype.negate=function(){var t=1+(65535&~this._a00);return this._a00=65535&t,t=(65535&~this._a16)+(t>>>16),this._a16=65535&t,t=(65535&~this._a32)+(t>>>16),this._a32=65535&t,this._a48=~this._a48+(t>>>16)&65535,this},h.prototype.equals=h.prototype.eq=function(t){return this._a48==t._a48&&this._a00==t._a00&&this._a32==t._a32&&this._a16==t._a16},h.prototype.greaterThan=h.prototype.gt=function(t){return this._a48>t._a48||!(this._a48<t._a48)&&(this._a32>t._a32||!(this._a32<t._a32)&&(this._a16>t._a16||!(this._a16<t._a16)&&this._a00>t._a00))},h.prototype.lessThan=h.prototype.lt=function(t){return this._a48<t._a48||!(this._a48>t._a48)&&(this._a32<t._a32||!(this._a32>t._a32)&&(this._a16<t._a16||!(this._a16>t._a16)&&this._a00<t._a00))},h.prototype.or=function(t){return this._a00|=t._a00,this._a16|=t._a16,this._a32|=t._a32,this._a48|=t._a48,this},h.prototype.and=function(t){return this._a00&=t._a00,this._a16&=t._a16,this._a32&=t._a32,this._a48&=t._a48,this},h.prototype.xor=function(t){return this._a00^=t._a00,this._a16^=t._a16,this._a32^=t._a32,this._a48^=t._a48,this},h.prototype.not=function(){return this._a00=65535&~this._a00,this._a16=65535&~this._a16,this._a32=65535&~this._a32,this._a48=65535&~this._a48,this},h.prototype.shiftRight=h.prototype.shiftr=function(t){return t%=64,t>=48?(this._a00=this._a48>>t-48,this._a16=0,this._a32=0,this._a48=0):t>=32?(t-=32,this._a00=65535&(this._a32>>t|this._a48<<16-t),this._a16=this._a48>>t&65535,this._a32=0,this._a48=0):t>=16?(t-=16,this._a00=65535&(this._a16>>t|this._a32<<16-t),this._a16=65535&(this._a32>>t|this._a48<<16-t),this._a32=this._a48>>t&65535,this._a48=0):(this._a00=65535&(this._a00>>t|this._a16<<16-t),this._a16=65535&(this._a16>>t|this._a32<<16-t),this._a32=65535&(this._a32>>t|this._a48<<16-t),this._a48=this._a48>>t&65535),this},h.prototype.shiftLeft=h.prototype.shiftl=function(t,r){return t%=64,t>=48?(this._a48=this._a00<<t-48,this._a32=0,this._a16=0,this._a00=0):t>=32?(t-=32,this._a48=this._a16<<t|this._a00>>16-t,this._a32=this._a00<<t&65535,this._a16=0,this._a00=0):t>=16?(t-=16,this._a48=this._a32<<t|this._a16>>16-t,this._a32=65535&(this._a16<<t|this._a00>>16-t),this._a16=this._a00<<t&65535,this._a00=0):(this._a48=this._a48<<t|this._a32>>16-t,this._a32=65535&(this._a32<<t|this._a16>>16-t),this._a16=65535&(this._a16<<t|this._a00>>16-t),this._a00=this._a00<<t&65535),r||(this._a48&=65535),this},h.prototype.rotateLeft=h.prototype.rotl=function(t){if(0==(t%=64))return this;if(t>=32){var r=this._a00;if(this._a00=this._a32,this._a32=r,r=this._a48,this._a48=this._a16,this._a16=r,32==t)return this;t-=32}var i=this._a48<<16|this._a32,e=this._a16<<16|this._a00,o=i<<t|e>>>32-t,h=e<<t|i>>>32-t;return this._a00=65535&h,this._a16=h>>>16,this._a32=65535&o,this._a48=o>>>16,this},h.prototype.rotateRight=h.prototype.rotr=function(t){if(0==(t%=64))return this;if(t>=32){var r=this._a00;if(this._a00=this._a32,this._a32=r,r=this._a48,this._a48=this._a16,this._a16=r,32==t)return this;t-=32}var i=this._a48<<16|this._a32,e=this._a16<<16|this._a00,o=i>>>t|e<<32-t,h=e>>>t|i<<32-t;return this._a00=65535&h,this._a16=h>>>16,this._a32=65535&o,this._a48=o>>>16,this},h.prototype.clone=function(){return new h(this._a00,this._a16,this._a32,this._a48)},e=[],void 0!==(o=function(){return h}.apply(r,e))&&(t.exports=o)}()},function(t,r,i){(function(r){function e(t){for(var r=[],i=0,e=t.length;i<e;i++){var o=t.charCodeAt(i);o<128?r.push(o):o<2048?r.push(192|o>>6,128|63&o):o<55296||o>=57344?r.push(224|o>>12,128|o>>6&63,128|63&o):(i++,o=65536+((1023&o)<<10|1023&t.charCodeAt(i)),r.push(240|o>>18,128|o>>12&63,128|o>>6&63,128|63&o))}return new Uint8Array(r)}function o(){return 2==arguments.length?new o(arguments[1]).update(arguments[0]).digest():this instanceof o?void h.call(this,arguments[0]):new o(arguments[0])}function h(t){return this.seed=t instanceof n?t.clone():n(t),this.v1=this.seed.clone().add(s).add(a),this.v2=this.seed.clone().add(a),this.v3=this.seed.clone(),this.v4=this.seed.clone().subtract(s),this.total_len=0,this.memsize=0,this.memory=null,this}var n=i(1).UINT64,s=n("11400714785074694791"),a=n("14029467366897019727"),u=n("1609587929392839161"),f=n("9650029242287828579"),l=n("2870177450012600261");o.prototype.init=h,o.prototype.update=function(t){var i,o="string"==typeof t;o&&(t=e(t),o=!1,i=!0),"undefined"!=typeof ArrayBuffer&&t instanceof ArrayBuffer&&(i=!0,t=new Uint8Array(t));var h=0,u=t.length,f=h+u;if(0==u)return this;if(this.total_len+=u,0==this.memsize&&(this.memory=o?"":i?new Uint8Array(32):new r(32)),this.memsize+u<32)return o?this.memory+=t:i?this.memory.set(t.subarray(0,u),this.memsize):t.copy(this.memory,this.memsize,0,u),this.memsize+=u,this;if(this.memsize>0){o?this.memory+=t.slice(0,32-this.memsize):i?this.memory.set(t.subarray(0,32-this.memsize),this.memsize):t.copy(this.memory,this.memsize,0,32-this.memsize);var l=0;if(o){var c;c=n(this.memory.charCodeAt(l+1)<<8|this.memory.charCodeAt(l),this.memory.charCodeAt(l+3)<<8|this.memory.charCodeAt(l+2),this.memory.charCodeAt(l+5)<<8|this.memory.charCodeAt(l+4),this.memory.charCodeAt(l+7)<<8|this.memory.charCodeAt(l+6)),this.v1.add(c.multiply(a)).rotl(31).multiply(s),l+=8,c=n(this.memory.charCodeAt(l+1)<<8|this.memory.charCodeAt(l),this.memory.charCodeAt(l+3)<<8|this.memory.charCodeAt(l+2),this.memory.charCodeAt(l+5)<<8|this.memory.charCodeAt(l+4),this.memory.charCodeAt(l+7)<<8|this.memory.charCodeAt(l+6)),this.v2.add(c.multiply(a)).rotl(31).multiply(s),l+=8,c=n(this.memory.charCodeAt(l+1)<<8|this.memory.charCodeAt(l),this.memory.charCodeAt(l+3)<<8|this.memory.charCodeAt(l+2),this.memory.charCodeAt(l+5)<<8|this.memory.charCodeAt(l+4),this.memory.charCodeAt(l+7)<<8|this.memory.charCodeAt(l+6)),this.v3.add(c.multiply(a)).rotl(31).multiply(s),l+=8,c=n(this.memory.charCodeAt(l+1)<<8|this.memory.charCodeAt(l),this.memory.charCodeAt(l+3)<<8|this.memory.charCodeAt(l+2),this.memory.charCodeAt(l+5)<<8|this.memory.charCodeAt(l+4),this.memory.charCodeAt(l+7)<<8|this.memory.charCodeAt(l+6)),this.v4.add(c.multiply(a)).rotl(31).multiply(s)}else{var c;c=n(this.memory[l+1]<<8|this.memory[l],this.memory[l+3]<<8|this.memory[l+2],this.memory[l+5]<<8|this.memory[l+4],this.memory[l+7]<<8|this.memory[l+6]),this.v1.add(c.multiply(a)).rotl(31).multiply(s),l+=8,c=n(this.memory[l+1]<<8|this.memory[l],this.memory[l+3]<<8|this.memory[l+2],this.memory[l+5]<<8|this.memory[l+4],this.memory[l+7]<<8|this.memory[l+6]),this.v2.add(c.multiply(a)).rotl(31).multiply(s),l+=8,c=n(this.memory[l+1]<<8|this.memory[l],this.memory[l+3]<<8|this.memory[l+2],this.memory[l+5]<<8|this.memory[l+4],this.memory[l+7]<<8|this.memory[l+6]),this.v3.add(c.multiply(a)).rotl(31).multiply(s),l+=8,c=n(this.memory[l+1]<<8|this.memory[l],this.memory[l+3]<<8|this.memory[l+2],this.memory[l+5]<<8|this.memory[l+4],this.memory[l+7]<<8|this.memory[l+6]),this.v4.add(c.multiply(a)).rotl(31).multiply(s)}h+=32-this.memsize,this.memsize=0,o&&(this.memory="")}if(h<=f-32){var p=f-32;do{if(o){var c;c=n(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2),t.charCodeAt(h+5)<<8|t.charCodeAt(h+4),t.charCodeAt(h+7)<<8|t.charCodeAt(h+6)),this.v1.add(c.multiply(a)).rotl(31).multiply(s),h+=8,c=n(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2),t.charCodeAt(h+5)<<8|t.charCodeAt(h+4),t.charCodeAt(h+7)<<8|t.charCodeAt(h+6)),this.v2.add(c.multiply(a)).rotl(31).multiply(s),h+=8,c=n(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2),t.charCodeAt(h+5)<<8|t.charCodeAt(h+4),t.charCodeAt(h+7)<<8|t.charCodeAt(h+6)),this.v3.add(c.multiply(a)).rotl(31).multiply(s),h+=8,c=n(t.charCodeAt(h+1)<<8|t.charCodeAt(h),t.charCodeAt(h+3)<<8|t.charCodeAt(h+2),t.charCodeAt(h+5)<<8|t.charCodeAt(h+4),t.charCodeAt(h+7)<<8|t.charCodeAt(h+6)),this.v4.add(c.multiply(a)).rotl(31).multiply(s)}else{var c;c=n(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2],t[h+5]<<8|t[h+4],t[h+7]<<8|t[h+6]),this.v1.add(c.multiply(a)).rotl(31).multiply(s),h+=8,c=n(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2],t[h+5]<<8|t[h+4],t[h+7]<<8|t[h+6]),this.v2.add(c.multiply(a)).rotl(31).multiply(s),h+=8,c=n(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2],t[h+5]<<8|t[h+4],t[h+7]<<8|t[h+6]),this.v3.add(c.multiply(a)).rotl(31).multiply(s),h+=8,c=n(t[h+1]<<8|t[h],t[h+3]<<8|t[h+2],t[h+5]<<8|t[h+4],t[h+7]<<8|t[h+6]),this.v4.add(c.multiply(a)).rotl(31).multiply(s)}h+=8}while(h<=p)}return h<f&&(o?this.memory+=t.slice(h):i?this.memory.set(t.subarray(h,f),this.memsize):t.copy(this.memory,this.memsize,h,f),this.memsize=f-h),this},o.prototype.digest=function(){var t,r,i=this.memory,e="string"==typeof i,o=0,h=this.memsize,c=new n;for(this.total_len>=32?(t=this.v1.clone().rotl(1),t.add(this.v2.clone().rotl(7)),t.add(this.v3.clone().rotl(12)),t.add(this.v4.clone().rotl(18)),t.xor(this.v1.multiply(a).rotl(31).multiply(s)),t.multiply(s).add(f),t.xor(this.v2.multiply(a).rotl(31).multiply(s)),t.multiply(s).add(f),t.xor(this.v3.multiply(a).rotl(31).multiply(s)),t.multiply(s).add(f),t.xor(this.v4.multiply(a).rotl(31).multiply(s)),t.multiply(s).add(f)):t=this.seed.clone().add(l),t.add(c.fromNumber(this.total_len));o<=h-8;)e?c.fromBits(i.charCodeAt(o+1)<<8|i.charCodeAt(o),i.charCodeAt(o+3)<<8|i.charCodeAt(o+2),i.charCodeAt(o+5)<<8|i.charCodeAt(o+4),i.charCodeAt(o+7)<<8|i.charCodeAt(o+6)):c.fromBits(i[o+1]<<8|i[o],i[o+3]<<8|i[o+2],i[o+5]<<8|i[o+4],i[o+7]<<8|i[o+6]),c.multiply(a).rotl(31).multiply(s),t.xor(c).rotl(27).multiply(s).add(f),o+=8;for(o+4<=h&&(e?c.fromBits(i.charCodeAt(o+1)<<8|i.charCodeAt(o),i.charCodeAt(o+3)<<8|i.charCodeAt(o+2),0,0):c.fromBits(i[o+1]<<8|i[o],i[o+3]<<8|i[o+2],0,0),t.xor(c.multiply(s)).rotl(23).multiply(a).add(u),o+=4);o<h;)c.fromBits(e?i.charCodeAt(o++):i[o++],0,0,0),t.xor(c.multiply(l)).rotl(11).multiply(s);return r=t.clone().shiftRight(33),t.xor(r).multiply(a),r=t.clone().shiftRight(29),t.xor(r).multiply(u),r=t.clone().shiftRight(32),t.xor(r),this.init(this.seed),t},t.exports=o}).call(r,i(0).Buffer)}])});
\ No newline at end of file
diff --git a/alarm/node_modules/xxhashjs/examples/from_file.js b/alarm/node_modules/xxhashjs/examples/from_file.js
new file mode 100644
index 0000000..51a3863
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/examples/from_file.js
@@ -0,0 +1,9 @@
+var XXH = require('..')
+var buf = require('fs').readFileSync( process.argv[2] )
+
+// var buf = buf.toString()
+console.log('data loaded:', buf.length, 'bytes')
+var startTime = Date.now()
+var h = XXH.h32(0).update(buf).digest()
+var delta = Date.now() - startTime
+console.log( '0x' + h.toString(16).toUpperCase(), 'in', delta, 'ms' )
diff --git a/alarm/node_modules/xxhashjs/examples/from_file64.js b/alarm/node_modules/xxhashjs/examples/from_file64.js
new file mode 100644
index 0000000..3523d7e
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/examples/from_file64.js
@@ -0,0 +1,9 @@
+var XXH = require('..')
+var buf = require('fs').readFileSync( process.argv[2] )
+
+// var buf = buf.toString()
+console.log('data loaded:', buf.length, 'bytes')
+var startTime = Date.now()
+var h = XXH.h64(0).update(buf).digest()
+var delta = Date.now() - startTime
+console.log( '0x' + h.toString(16).toUpperCase(), 'in', delta, 'ms' )
diff --git a/alarm/node_modules/xxhashjs/examples/one_step.js b/alarm/node_modules/xxhashjs/examples/one_step.js
new file mode 100644
index 0000000..d70bf0f
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/examples/one_step.js
@@ -0,0 +1,5 @@
+var XXH = require('..')
+
+var h = XXH.h32( 'abcd', 0xABCD ).toString(16)
+
+console.log( '0x' + h.toUpperCase() )
diff --git a/alarm/node_modules/xxhashjs/examples/xxhash.html b/alarm/node_modules/xxhashjs/examples/xxhash.html
new file mode 100644
index 0000000..88cdcea
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/examples/xxhash.html
@@ -0,0 +1,23 @@
+<html>
+<head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head>
+<body>
+	<div>
+		Result:
+		<div id='input'></div>
+		<div id='seed'></div>
+		<div id='xxhash'></div>
+		<div id='xxhash64'></div>
+	</div>
+	<script type="text/javascript" src="../build/xxhash.min.js"></script>
+	<script type="text/javascript">
+		var input='heiå'
+		var seed = '0'
+		var h = XXH.h32( input, seed ).toString(16)
+		var h64 = XXH.h64( input, seed ).toString(16)
+		document.getElementById('input').innerHTML = "input ='" + input + "'"
+		document.getElementById('seed').innerHTML = "seed='" + seed + "'"
+		document.getElementById('xxhash').innerHTML = "xxHash='" + h + "'"
+		document.getElementById('xxhash64').innerHTML = "xxHash64='" + h64 + "'"
+	</script>
+</body>
+</html>
diff --git a/alarm/node_modules/xxhashjs/lib/index.js b/alarm/node_modules/xxhashjs/lib/index.js
new file mode 100644
index 0000000..9868ca4
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/lib/index.js
@@ -0,0 +1,4 @@
+module.exports = {
+	h32: require("./xxhash")
+,	h64: require("./xxhash64")
+}
diff --git a/alarm/node_modules/xxhashjs/lib/xxhash.js b/alarm/node_modules/xxhashjs/lib/xxhash.js
new file mode 100644
index 0000000..8189b85
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/lib/xxhash.js
@@ -0,0 +1,389 @@
+/**
+xxHash implementation in pure Javascript
+
+Copyright (C) 2013, Pierre Curto
+MIT license
+*/
+var UINT32 = require('cuint').UINT32
+
+/*
+	Merged this sequence of method calls as it speeds up
+	the calculations by a factor of 2
+ */
+// this.v1.add( other.multiply(PRIME32_2) ).rotl(13).multiply(PRIME32_1);
+UINT32.prototype.xxh_update = function (low, high) {
+	var b00 = PRIME32_2._low
+	var b16 = PRIME32_2._high
+
+	var c16, c00
+	c00 = low * b00
+	c16 = c00 >>> 16
+
+	c16 += high * b00
+	c16 &= 0xFFFF		// Not required but improves performance
+	c16 += low * b16
+
+	var a00 = this._low + (c00 & 0xFFFF)
+	var a16 = a00 >>> 16
+
+	a16 += this._high + (c16 & 0xFFFF)
+
+	var v = (a16 << 16) | (a00 & 0xFFFF)
+	v = (v << 13) | (v >>> 19)
+
+	a00 = v & 0xFFFF
+	a16 = v >>> 16
+
+	b00 = PRIME32_1._low
+	b16 = PRIME32_1._high
+
+	c00 = a00 * b00
+	c16 = c00 >>> 16
+
+	c16 += a16 * b00
+	c16 &= 0xFFFF		// Not required but improves performance
+	c16 += a00 * b16
+
+	this._low = c00 & 0xFFFF
+	this._high = c16 & 0xFFFF
+}
+
+/*
+ * Constants
+ */
+var PRIME32_1 = UINT32( '2654435761' )
+var PRIME32_2 = UINT32( '2246822519' )
+var PRIME32_3 = UINT32( '3266489917' )
+var PRIME32_4 = UINT32(  '668265263' )
+var PRIME32_5 = UINT32(  '374761393' )
+
+/**
+* Convert string to proper UTF-8 array
+* @param str Input string
+* @returns {Uint8Array} UTF8 array is returned as uint8 array
+*/
+function toUTF8Array (str) {
+	var utf8 = []
+	for (var i=0, n=str.length; i < n; i++) {
+		var charcode = str.charCodeAt(i)
+		if (charcode < 0x80) utf8.push(charcode)
+		else if (charcode < 0x800) {
+			utf8.push(0xc0 | (charcode >> 6),
+			0x80 | (charcode & 0x3f))
+		}
+		else if (charcode < 0xd800 || charcode >= 0xe000) {
+			utf8.push(0xe0 | (charcode >> 12),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+		// surrogate pair
+		else {
+			i++;
+			// UTF-16 encodes 0x10000-0x10FFFF by
+			// subtracting 0x10000 and splitting the
+			// 20 bits of 0x0-0xFFFFF into two halves
+			charcode = 0x10000 + (((charcode & 0x3ff)<<10)
+			| (str.charCodeAt(i) & 0x3ff))
+			utf8.push(0xf0 | (charcode >>18),
+			0x80 | ((charcode>>12) & 0x3f),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+	}
+
+	return new Uint8Array(utf8)
+}
+
+/**
+ * XXH object used as a constructor or a function
+ * @constructor
+ * or
+ * @param {Object|String} input data
+ * @param {Number|UINT32} seed
+ * @return ThisExpression
+ * or
+ * @return {UINT32} xxHash
+ */
+function XXH () {
+	if (arguments.length == 2)
+		return new XXH( arguments[1] ).update( arguments[0] ).digest()
+
+	if (!(this instanceof XXH))
+		return new XXH( arguments[0] )
+
+	init.call(this, arguments[0])
+}
+
+/**
+ * Initialize the XXH instance with the given seed
+ * @method init
+ * @param {Number|Object} seed as a number or an unsigned 32 bits integer
+ * @return ThisExpression
+ */
+ function init (seed) {
+	this.seed = seed instanceof UINT32 ? seed.clone() : UINT32(seed)
+	this.v1 = this.seed.clone().add(PRIME32_1).add(PRIME32_2)
+	this.v2 = this.seed.clone().add(PRIME32_2)
+	this.v3 = this.seed.clone()
+	this.v4 = this.seed.clone().subtract(PRIME32_1)
+	this.total_len = 0
+	this.memsize = 0
+	this.memory = null
+
+	return this
+}
+XXH.prototype.init = init
+
+/**
+ * Add data to be computed for the XXH hash
+ * @method update
+ * @param {String|Buffer|ArrayBuffer} input as a string or nodejs Buffer or ArrayBuffer
+ * @return ThisExpression
+ */
+XXH.prototype.update = function (input) {
+	var isString = typeof input == 'string'
+	var isArrayBuffer
+
+	// Convert all strings to utf-8 first (issue #5)
+	if (isString) {
+		input = toUTF8Array(input)
+		isString = false
+		isArrayBuffer = true
+	}
+
+	if (typeof ArrayBuffer !== "undefined" && input instanceof ArrayBuffer)
+	{
+		isArrayBuffer = true
+		input = new Uint8Array(input);
+	}
+
+	var p = 0
+	var len = input.length
+	var bEnd = p + len
+
+	if (len == 0) return this
+
+	this.total_len += len
+
+	if (this.memsize == 0)
+	{
+		if (isString) {
+			this.memory = ''
+		} else if (isArrayBuffer) {
+			this.memory = new Uint8Array(16)
+		} else {
+			this.memory = new Buffer(16)
+		}
+	}
+
+	if (this.memsize + len < 16)   // fill in tmp buffer
+	{
+		// XXH_memcpy(this.memory + this.memsize, input, len)
+		if (isString) {
+			this.memory += input
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, len), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, len )
+		}
+
+		this.memsize += len
+		return this
+	}
+
+	if (this.memsize > 0)   // some data left from previous update
+	{
+		// XXH_memcpy(this.memory + this.memsize, input, 16-this.memsize);
+		if (isString) {
+			this.memory += input.slice(0, 16 - this.memsize)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, 16 - this.memsize), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, 16 - this.memsize )
+		}
+
+		var p32 = 0
+		if (isString) {
+			this.v1.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+			p32 += 4
+			this.v2.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+			p32 += 4
+			this.v3.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+			p32 += 4
+			this.v4.xxh_update(
+				(this.memory.charCodeAt(p32+1) << 8) | this.memory.charCodeAt(p32)
+			,	(this.memory.charCodeAt(p32+3) << 8) | this.memory.charCodeAt(p32+2)
+			)
+		} else {
+			this.v1.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+			p32 += 4
+			this.v2.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+			p32 += 4
+			this.v3.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+			p32 += 4
+			this.v4.xxh_update(
+				(this.memory[p32+1] << 8) | this.memory[p32]
+			,	(this.memory[p32+3] << 8) | this.memory[p32+2]
+			)
+		}
+
+		p += 16 - this.memsize
+		this.memsize = 0
+		if (isString) this.memory = ''
+	}
+
+	if (p <= bEnd - 16)
+	{
+		var limit = bEnd - 16
+
+		do
+		{
+			if (isString) {
+				this.v1.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+				p += 4
+				this.v2.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+				p += 4
+				this.v3.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+				p += 4
+				this.v4.xxh_update(
+					(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+				,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+				)
+			} else {
+				this.v1.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+				p += 4
+				this.v2.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+				p += 4
+				this.v3.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+				p += 4
+				this.v4.xxh_update(
+					(input[p+1] << 8) | input[p]
+				,	(input[p+3] << 8) | input[p+2]
+				)
+			}
+			p += 4
+		} while (p <= limit)
+	}
+
+	if (p < bEnd)
+	{
+		// XXH_memcpy(this.memory, p, bEnd-p);
+		if (isString) {
+			this.memory += input.slice(p)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(p, bEnd), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, p, bEnd )
+		}
+
+		this.memsize = bEnd - p
+	}
+
+	return this
+}
+
+/**
+ * Finalize the XXH computation. The XXH instance is ready for reuse for the given seed
+ * @method digest
+ * @return {UINT32} xxHash
+ */
+XXH.prototype.digest = function () {
+	var input = this.memory
+	var isString = typeof input == 'string'
+	var p = 0
+	var bEnd = this.memsize
+	var h32, h
+	var u = new UINT32
+
+	if (this.total_len >= 16)
+	{
+		h32 = this.v1.rotl(1).add( this.v2.rotl(7).add( this.v3.rotl(12).add( this.v4.rotl(18) ) ) )
+	}
+	else
+	{
+		h32  = this.seed.clone().add( PRIME32_5 )
+	}
+
+	h32.add( u.fromNumber(this.total_len) )
+
+	while (p <= bEnd - 4)
+	{
+		if (isString) {
+			u.fromBits(
+				(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+			,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+			)
+		} else {
+			u.fromBits(
+				(input[p+1] << 8) | input[p]
+			,	(input[p+3] << 8) | input[p+2]
+			)
+		}
+		h32
+			.add( u.multiply(PRIME32_3) )
+			.rotl(17)
+			.multiply( PRIME32_4 )
+		p += 4
+	}
+
+	while (p < bEnd)
+	{
+		u.fromBits( isString ? input.charCodeAt(p++) : input[p++], 0 )
+		h32
+			.add( u.multiply(PRIME32_5) )
+			.rotl(11)
+			.multiply(PRIME32_1)
+	}
+
+	h = h32.clone().shiftRight(15)
+	h32.xor(h).multiply(PRIME32_2)
+
+	h = h32.clone().shiftRight(13)
+	h32.xor(h).multiply(PRIME32_3)
+
+	h = h32.clone().shiftRight(16)
+	h32.xor(h)
+
+	// Reset the state
+	this.init( this.seed )
+
+	return h32
+}
+
+module.exports = XXH
diff --git a/alarm/node_modules/xxhashjs/lib/xxhash64.js b/alarm/node_modules/xxhashjs/lib/xxhash64.js
new file mode 100644
index 0000000..2956470
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/lib/xxhash64.js
@@ -0,0 +1,444 @@
+/**
+xxHash64 implementation in pure Javascript
+
+Copyright (C) 2016, Pierre Curto
+MIT license
+*/
+var UINT64 = require('cuint').UINT64
+
+/*
+ * Constants
+ */
+var PRIME64_1 = UINT64( '11400714785074694791' )
+var PRIME64_2 = UINT64( '14029467366897019727' )
+var PRIME64_3 = UINT64(  '1609587929392839161' )
+var PRIME64_4 = UINT64(  '9650029242287828579' )
+var PRIME64_5 = UINT64(  '2870177450012600261' )
+
+/**
+* Convert string to proper UTF-8 array
+* @param str Input string
+* @returns {Uint8Array} UTF8 array is returned as uint8 array
+*/
+function toUTF8Array (str) {
+	var utf8 = []
+	for (var i=0, n=str.length; i < n; i++) {
+		var charcode = str.charCodeAt(i)
+		if (charcode < 0x80) utf8.push(charcode)
+		else if (charcode < 0x800) {
+			utf8.push(0xc0 | (charcode >> 6),
+			0x80 | (charcode & 0x3f))
+		}
+		else if (charcode < 0xd800 || charcode >= 0xe000) {
+			utf8.push(0xe0 | (charcode >> 12),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+		// surrogate pair
+		else {
+			i++;
+			// UTF-16 encodes 0x10000-0x10FFFF by
+			// subtracting 0x10000 and splitting the
+			// 20 bits of 0x0-0xFFFFF into two halves
+			charcode = 0x10000 + (((charcode & 0x3ff)<<10)
+			| (str.charCodeAt(i) & 0x3ff))
+			utf8.push(0xf0 | (charcode >>18),
+			0x80 | ((charcode>>12) & 0x3f),
+			0x80 | ((charcode>>6) & 0x3f),
+			0x80 | (charcode & 0x3f))
+		}
+	}
+
+	return new Uint8Array(utf8)
+}
+
+/**
+ * XXH64 object used as a constructor or a function
+ * @constructor
+ * or
+ * @param {Object|String} input data
+ * @param {Number|UINT64} seed
+ * @return ThisExpression
+ * or
+ * @return {UINT64} xxHash
+ */
+function XXH64 () {
+	if (arguments.length == 2)
+		return new XXH64( arguments[1] ).update( arguments[0] ).digest()
+
+	if (!(this instanceof XXH64))
+		return new XXH64( arguments[0] )
+
+	init.call(this, arguments[0])
+}
+
+/**
+ * Initialize the XXH64 instance with the given seed
+ * @method init
+ * @param {Number|Object} seed as a number or an unsigned 32 bits integer
+ * @return ThisExpression
+ */
+ function init (seed) {
+	this.seed = seed instanceof UINT64 ? seed.clone() : UINT64(seed)
+	this.v1 = this.seed.clone().add(PRIME64_1).add(PRIME64_2)
+	this.v2 = this.seed.clone().add(PRIME64_2)
+	this.v3 = this.seed.clone()
+	this.v4 = this.seed.clone().subtract(PRIME64_1)
+	this.total_len = 0
+	this.memsize = 0
+	this.memory = null
+
+	return this
+}
+XXH64.prototype.init = init
+
+/**
+ * Add data to be computed for the XXH64 hash
+ * @method update
+ * @param {String|Buffer|ArrayBuffer} input as a string or nodejs Buffer or ArrayBuffer
+ * @return ThisExpression
+ */
+XXH64.prototype.update = function (input) {
+	var isString = typeof input == 'string'
+	var isArrayBuffer
+
+	// Convert all strings to utf-8 first (issue #5)
+	if (isString) {
+		input = toUTF8Array(input)
+		isString = false
+		isArrayBuffer = true
+	}
+
+	if (typeof ArrayBuffer !== "undefined" && input instanceof ArrayBuffer)
+	{
+		isArrayBuffer = true
+		input = new Uint8Array(input);
+	}
+
+	var p = 0
+	var len = input.length
+	var bEnd = p + len
+
+	if (len == 0) return this
+
+	this.total_len += len
+
+	if (this.memsize == 0)
+	{
+		if (isString) {
+			this.memory = ''
+		} else if (isArrayBuffer) {
+			this.memory = new Uint8Array(32)
+		} else {
+			this.memory = new Buffer(32)
+		}
+	}
+
+	if (this.memsize + len < 32)   // fill in tmp buffer
+	{
+		// XXH64_memcpy(this.memory + this.memsize, input, len)
+		if (isString) {
+			this.memory += input
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, len), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, len )
+		}
+
+		this.memsize += len
+		return this
+	}
+
+	if (this.memsize > 0)   // some data left from previous update
+	{
+		// XXH64_memcpy(this.memory + this.memsize, input, 16-this.memsize);
+		if (isString) {
+			this.memory += input.slice(0, 32 - this.memsize)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(0, 32 - this.memsize), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, 0, 32 - this.memsize )
+		}
+
+		var p64 = 0
+		if (isString) {
+			var other
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory.charCodeAt(p64+1) << 8) | this.memory.charCodeAt(p64)
+				,	(this.memory.charCodeAt(p64+3) << 8) | this.memory.charCodeAt(p64+2)
+				,	(this.memory.charCodeAt(p64+5) << 8) | this.memory.charCodeAt(p64+4)
+				,	(this.memory.charCodeAt(p64+7) << 8) | this.memory.charCodeAt(p64+6)
+				)
+			this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+		} else {
+			var other
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			p64 += 8
+			other = UINT64(
+					(this.memory[p64+1] << 8) | this.memory[p64]
+				,	(this.memory[p64+3] << 8) | this.memory[p64+2]
+				,	(this.memory[p64+5] << 8) | this.memory[p64+4]
+				,	(this.memory[p64+7] << 8) | this.memory[p64+6]
+				)
+			this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+		}
+
+		p += 32 - this.memsize
+		this.memsize = 0
+		if (isString) this.memory = ''
+	}
+
+	if (p <= bEnd - 32)
+	{
+		var limit = bEnd - 32
+
+		do
+		{
+			if (isString) {
+				var other
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+					,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+					,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+					,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+					)
+				this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			} else {
+				var other
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v1.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v2.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v3.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+				p += 8
+				other = UINT64(
+						(input[p+1] << 8) | input[p]
+					,	(input[p+3] << 8) | input[p+2]
+					,	(input[p+5] << 8) | input[p+4]
+					,	(input[p+7] << 8) | input[p+6]
+					)
+				this.v4.add( other.multiply(PRIME64_2) ).rotl(31).multiply(PRIME64_1);
+			}
+			p += 8
+		} while (p <= limit)
+	}
+
+	if (p < bEnd)
+	{
+		// XXH64_memcpy(this.memory, p, bEnd-p);
+		if (isString) {
+			this.memory += input.slice(p)
+		} else if (isArrayBuffer) {
+			this.memory.set( input.subarray(p, bEnd), this.memsize )
+		} else {
+			input.copy( this.memory, this.memsize, p, bEnd )
+		}
+
+		this.memsize = bEnd - p
+	}
+
+	return this
+}
+
+/**
+ * Finalize the XXH64 computation. The XXH64 instance is ready for reuse for the given seed
+ * @method digest
+ * @return {UINT64} xxHash
+ */
+XXH64.prototype.digest = function () {
+	var input = this.memory
+	var isString = typeof input == 'string'
+	var p = 0
+	var bEnd = this.memsize
+	var h64, h
+	var u = new UINT64
+
+	if (this.total_len >= 32)
+	{
+		h64 = this.v1.clone().rotl(1)
+		h64.add( this.v2.clone().rotl(7) )
+		h64.add( this.v3.clone().rotl(12) )
+		h64.add( this.v4.clone().rotl(18) )
+
+		h64.xor( this.v1.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+
+		h64.xor( this.v2.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+
+		h64.xor( this.v3.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+
+		h64.xor( this.v4.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1) )
+		h64.multiply(PRIME64_1).add(PRIME64_4)
+	}
+	else
+	{
+		h64  = this.seed.clone().add( PRIME64_5 )
+	}
+
+	h64.add( u.fromNumber(this.total_len) )
+
+	while (p <= bEnd - 8)
+	{
+		if (isString) {
+			u.fromBits(
+				(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+			,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+			,	(input.charCodeAt(p+5) << 8) | input.charCodeAt(p+4)
+			,	(input.charCodeAt(p+7) << 8) | input.charCodeAt(p+6)
+			)
+		} else {
+			u.fromBits(
+				(input[p+1] << 8) | input[p]
+			,	(input[p+3] << 8) | input[p+2]
+			,	(input[p+5] << 8) | input[p+4]
+			,	(input[p+7] << 8) | input[p+6]
+			)
+		}
+		u.multiply(PRIME64_2).rotl(31).multiply(PRIME64_1)
+		h64
+			.xor(u)
+			.rotl(27)
+			.multiply( PRIME64_1 )
+			.add( PRIME64_4 )
+		p += 8
+	}
+
+	if (p + 4 <= bEnd) {
+		if (isString) {
+			u.fromBits(
+				(input.charCodeAt(p+1) << 8) | input.charCodeAt(p)
+			,	(input.charCodeAt(p+3) << 8) | input.charCodeAt(p+2)
+			,	0
+			,	0
+			)
+		} else {
+			u.fromBits(
+				(input[p+1] << 8) | input[p]
+			,	(input[p+3] << 8) | input[p+2]
+			,	0
+			,	0
+			)
+		}
+		h64
+			.xor( u.multiply(PRIME64_1) )
+			.rotl(23)
+			.multiply( PRIME64_2 )
+			.add( PRIME64_3 )
+		p += 4
+	}
+
+	while (p < bEnd)
+	{
+		u.fromBits( isString ? input.charCodeAt(p++) : input[p++], 0, 0, 0 )
+		h64
+			.xor( u.multiply(PRIME64_5) )
+			.rotl(11)
+			.multiply(PRIME64_1)
+	}
+
+	h = h64.clone().shiftRight(33)
+	h64.xor(h).multiply(PRIME64_2)
+
+	h = h64.clone().shiftRight(29)
+	h64.xor(h).multiply(PRIME64_3)
+
+	h = h64.clone().shiftRight(32)
+	h64.xor(h)
+
+	// Reset the state
+	this.init( this.seed )
+
+	return h64
+}
+
+module.exports = XXH64
diff --git a/alarm/node_modules/xxhashjs/package.json b/alarm/node_modules/xxhashjs/package.json
new file mode 100644
index 0000000..baa7fb4
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/package.json
@@ -0,0 +1,32 @@
+{
+  "name": "xxhashjs",
+  "version": "0.2.2",
+  "description": "xxHash in Javascript",
+  "main": "./lib/index.js",
+  "scripts": {
+    "test": "mocha",
+    "prepublish": "webpack && uglifyjs -m -c -o build/xxhash.min.js build/xxhash.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/pierrec/js-xxhash"
+  },
+  "keywords": [
+    "xxhash",
+    "xxh"
+  ],
+  "author": "Pierre Curto",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/pierrec/js-xxhash/issues"
+  },
+  "homepage": "https://github.com/pierrec/js-xxhash",
+  "dependencies": {
+    "cuint": "^0.2.2"
+  },
+  "devDependencies": {
+    "benchmark": "*",
+    "uglifyjs": "^2.4.11",
+    "webpack": "^3.10.0"
+  }
+}
diff --git a/alarm/node_modules/xxhashjs/test/XXH-test.js b/alarm/node_modules/xxhashjs/test/XXH-test.js
new file mode 100644
index 0000000..a2765c0
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/test/XXH-test.js
@@ -0,0 +1,172 @@
+var assert = require('assert')
+var XXH = require('..')
+
+describe('XXH', function () {
+	var seed = 0
+
+	describe('with small input multiple of 4', function () {
+		var input = 'abcd'
+		var expected = 'A3643705' // Computed with xxHash C version
+
+		it('should return hash in a single step', function (done) {
+			var h = XXH.h32( input, seed ).toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash in many steps', function (done) {
+			var H = XXH.h32( seed )
+			var h = H.update( input ).digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+	})
+
+	describe('with medium input multiple of 4', function () {
+		var input = Array(1001).join('abcd')
+		var expected = 'E18CBEA'
+
+		it('should return hash in a single step', function (done) {
+			var h = XXH.h32( input, seed ).toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash in many steps', function (done) {
+			var H = XXH.h32( seed )
+			var h = H.update( input ).digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+	})
+
+	describe('with small input', function () {
+		var input = 'abc'
+		var expected = '32D153FF' // Computed with xxHash C version
+
+		it('should return hash in a single step', function (done) {
+			var h = XXH.h32( input, seed ).toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash in many steps', function (done) {
+			var H = XXH.h32( seed )
+			var h = H.update( input ).digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+	})
+
+	describe('with medium input', function () {
+		var input = Array(1000).join('abc')
+		var expected = '89DA9B6E'
+
+		it('should return hash in a single step', function (done) {
+			var h = XXH.h32( input, seed ).toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash in many steps', function (done) {
+			var H = XXH.h32( seed )
+			var h = H.update( input ).digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+	})
+
+	describe('with split medium input', function () {
+		var input = Array(1000).join('abc')
+		var expected = '89DA9B6E'
+
+		it('should return hash with split input < 16', function (done) {
+			var H = XXH.h32( seed )
+			var h = H
+				.update( input.slice(0, 10) )
+				.update( input.slice(10) )
+				.digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash with split input = 16', function (done) {
+			var H = XXH.h32( seed )
+			var h = H
+				.update( input.slice(0, 16) )
+				.update( input.slice(16) )
+				.digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash with split input > 16', function (done) {
+			var H = XXH.h32( seed )
+			var h = H
+				.update( input.slice(0, 20) )
+				.update( input.slice(20) )
+				.digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+	})
+
+	describe('with utf-8 strings', function () {
+		var input = 'heiå'
+		var expected = 'DB5ABCCC' // Computed with xxHash C version
+
+		it('should return hash', function (done) {
+			var h = XXH.h32( input, seed ).toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash in many steps', function (done) {
+			var H = XXH.h32( seed )
+			var h = H.update( input ).digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+	})
+
+	describe('with utf-8 strings', function () {
+		var input = 'κόσμε'
+		var expected = 'D855F606' // Computed with xxHash C version
+
+		it('should return hash', function (done) {
+			var h = XXH.h32( input, seed ).toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+		it('should return hash in many steps', function (done) {
+			var H = XXH.h32( seed )
+			var h = H.update( input ).digest().toString(16).toUpperCase()
+
+			assert.equal( h, expected )
+			done()
+		})
+
+	})
+
+})
diff --git a/alarm/node_modules/xxhashjs/webpack.config.js b/alarm/node_modules/xxhashjs/webpack.config.js
new file mode 100644
index 0000000..fa8c5c9
--- /dev/null
+++ b/alarm/node_modules/xxhashjs/webpack.config.js
@@ -0,0 +1,11 @@
+var path = require("path")
+
+module.exports = {
+	"entry": "./lib/index.js"
+,	"output": {
+		"path": __dirname + "/build"
+	,	"filename": "xxhash.js"
+	,	"library": "XXH"
+	,	"libraryTarget": "umd"
+	}
+}