@mtes-mct/monitor-ui 10.5.0 → 10.7.0

package/index.js

@@ -12,6 +12,34 @@ function getDefaultExportFromCjs (x) {
 	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
 }
 
+function getAugmentedNamespace(n) {
+  if (n.__esModule) return n;
+  var f = n.default;
+	if (typeof f == "function") {
+		var a = function a () {
+			if (this instanceof a) {
+				var args = [null];
+				args.push.apply(args, arguments);
+				var Ctor = Function.bind.apply(f, args);
+				return new Ctor();
+			}
+			return f.apply(this, arguments);
+		};
+		a.prototype = f.prototype;
+  } else a = {};
+  Object.defineProperty(a, '__esModule', {value: true});
+	Object.keys(n).forEach(function (k) {
+		var d = Object.getOwnPropertyDescriptor(n, k);
+		Object.defineProperty(a, k, d.get ? d : {
+			enumerable: true,
+			get: function () {
+				return n[k];
+			}
+		});
+	});
+	return a;
+}
+
 var isSameOrAfter$1 = {exports: {}};
 
 (function (module, exports) {
@@ -718,13 +746,13 @@ function _objectIs(a, b) {
 
 var _objectIs$1 = typeof Object.is === 'function' ? Object.is : _objectIs;
 
-var toString$2 = Object.prototype.toString;
+var toString$3 = Object.prototype.toString;
 
 var _isArguments =
 /*#__PURE__*/
 function () {
-  return toString$2.call(arguments) === '[object Arguments]' ? function _isArguments(x) {
-    return toString$2.call(x) === '[object Arguments]';
+  return toString$3.call(arguments) === '[object Arguments]' ? function _isArguments(x) {
+    return toString$3.call(x) === '[object Arguments]';
   } : function _isArguments(x) {
     return _has('callee', x);
   };
@@ -1913,7 +1941,7 @@ function _isTypedArray(val) {
  *      R.empty(Uint8Array.from('123')); //=> Uint8Array []
  */
 
-var empty =
+var empty$2 =
 /*#__PURE__*/
 _curry1(function empty(x) {
   return x != null && typeof x['fantasy-land/empty'] === 'function' ? x['fantasy-land/empty']() : x != null && x.constructor != null && typeof x.constructor['fantasy-land/empty'] === 'function' ? x.constructor['fantasy-land/empty']() : x != null && typeof x.empty === 'function' ? x.empty() : x != null && x.constructor != null && typeof x.constructor.empty === 'function' ? x.constructor.empty() : _isArray(x) ? [] : _isString(x) ? '' : _isObject(x) ? {} : _isArguments(x) ? function () {
@@ -2010,7 +2038,7 @@ var includes$1 = includes;
 var isEmpty =
 /*#__PURE__*/
 _curry1(function isEmpty(x) {
-  return x != null && equals$2(x, empty(x));
+  return x != null && equals$2(x, empty$2(x));
 });
 
 var isEmpty$1 = isEmpty;
@@ -2345,7 +2373,7 @@ const Dialog = Object.assign(RawDialog, {
     Title: Title$1
 });
 
-function Item({ accent, Icon, ...originalProps }) {
+function Item$1({ accent, Icon, ...originalProps }) {
     const icon = useMemo(() => (Icon ? jsx(Icon, { size: 20 }) : undefined), [Icon]);
     const hasIcon = useMemo(() => Boolean(Icon), [Icon]);
     switch (accent) {
@@ -2473,9 +2501,237 @@ const SecondaryDropdown = styled(Dropdown$1) `
 `;
 RawDropdown.displayName = 'Dropdown';
 const Dropdown = Object.assign(RawDropdown, {
-    Item
+    Item: Item$1
 });
 
+var global$1 = (typeof global !== "undefined" ? global :
+  typeof self !== "undefined" ? self :
+  typeof window !== "undefined" ? window : {});
+
+// shim for using process in browser
+// based off https://github.com/defunctzombie/node-process/blob/master/browser.js
+
+function defaultSetTimout() {
+    throw new Error('setTimeout has not been defined');
+}
+function defaultClearTimeout () {
+    throw new Error('clearTimeout has not been defined');
+}
+var cachedSetTimeout = defaultSetTimout;
+var cachedClearTimeout = defaultClearTimeout;
+if (typeof global$1.setTimeout === 'function') {
+    cachedSetTimeout = setTimeout;
+}
+if (typeof global$1.clearTimeout === 'function') {
+    cachedClearTimeout = clearTimeout;
+}
+
+function runTimeout(fun) {
+    if (cachedSetTimeout === setTimeout) {
+        //normal enviroments in sane situations
+        return setTimeout(fun, 0);
+    }
+    // if setTimeout wasn't available but was latter defined
+    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {
+        cachedSetTimeout = setTimeout;
+        return setTimeout(fun, 0);
+    }
+    try {
+        // when when somebody has screwed with setTimeout but no I.E. maddness
+        return cachedSetTimeout(fun, 0);
+    } catch(e){
+        try {
+            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
+            return cachedSetTimeout.call(null, fun, 0);
+        } catch(e){
+            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error
+            return cachedSetTimeout.call(this, fun, 0);
+        }
+    }
+
+
+}
+function runClearTimeout(marker) {
+    if (cachedClearTimeout === clearTimeout) {
+        //normal enviroments in sane situations
+        return clearTimeout(marker);
+    }
+    // if clearTimeout wasn't available but was latter defined
+    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {
+        cachedClearTimeout = clearTimeout;
+        return clearTimeout(marker);
+    }
+    try {
+        // when when somebody has screwed with setTimeout but no I.E. maddness
+        return cachedClearTimeout(marker);
+    } catch (e){
+        try {
+            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally
+            return cachedClearTimeout.call(null, marker);
+        } catch (e){
+            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.
+            // Some versions of I.E. have different rules for clearTimeout vs setTimeout
+            return cachedClearTimeout.call(this, marker);
+        }
+    }
+
+
+
+}
+var queue = [];
+var draining = false;
+var currentQueue;
+var queueIndex = -1;
+
+function cleanUpNextTick() {
+    if (!draining || !currentQueue) {
+        return;
+    }
+    draining = false;
+    if (currentQueue.length) {
+        queue = currentQueue.concat(queue);
+    } else {
+        queueIndex = -1;
+    }
+    if (queue.length) {
+        drainQueue();
+    }
+}
+
+function drainQueue() {
+    if (draining) {
+        return;
+    }
+    var timeout = runTimeout(cleanUpNextTick);
+    draining = true;
+
+    var len = queue.length;
+    while(len) {
+        currentQueue = queue;
+        queue = [];
+        while (++queueIndex < len) {
+            if (currentQueue) {
+                currentQueue[queueIndex].run();
+            }
+        }
+        queueIndex = -1;
+        len = queue.length;
+    }
+    currentQueue = null;
+    draining = false;
+    runClearTimeout(timeout);
+}
+function nextTick(fun) {
+    var args = new Array(arguments.length - 1);
+    if (arguments.length > 1) {
+        for (var i = 1; i < arguments.length; i++) {
+            args[i - 1] = arguments[i];
+        }
+    }
+    queue.push(new Item(fun, args));
+    if (queue.length === 1 && !draining) {
+        runTimeout(drainQueue);
+    }
+}
+// v8 likes predictible objects
+function Item(fun, array) {
+    this.fun = fun;
+    this.array = array;
+}
+Item.prototype.run = function () {
+    this.fun.apply(null, this.array);
+};
+var title = 'browser';
+var platform = 'browser';
+var browser = true;
+var env = {};
+var argv = [];
+var version = ''; // empty string to avoid regexp issues
+var versions = {};
+var release = {};
+var config = {};
+
+function noop() {}
+
+var on = noop;
+var addListener = noop;
+var once = noop;
+var off = noop;
+var removeListener = noop;
+var removeAllListeners = noop;
+var emit = noop;
+
+function binding(name) {
+    throw new Error('process.binding is not supported');
+}
+
+function cwd () { return '/' }
+function chdir (dir) {
+    throw new Error('process.chdir is not supported');
+}function umask() { return 0; }
+
+// from https://github.com/kumavis/browser-process-hrtime/blob/master/index.js
+var performance$1 = global$1.performance || {};
+var performanceNow =
+  performance$1.now        ||
+  performance$1.mozNow     ||
+  performance$1.msNow      ||
+  performance$1.oNow       ||
+  performance$1.webkitNow  ||
+  function(){ return (new Date()).getTime() };
+
+// generate timestamp or delta
+// see http://nodejs.org/api/process.html#process_process_hrtime
+function hrtime(previousTimestamp){
+  var clocktime = performanceNow.call(performance$1)*1e-3;
+  var seconds = Math.floor(clocktime);
+  var nanoseconds = Math.floor((clocktime%1)*1e9);
+  if (previousTimestamp) {
+    seconds = seconds - previousTimestamp[0];
+    nanoseconds = nanoseconds - previousTimestamp[1];
+    if (nanoseconds<0) {
+      seconds--;
+      nanoseconds += 1e9;
+    }
+  }
+  return [seconds,nanoseconds]
+}
+
+var startTime = new Date();
+function uptime() {
+  var currentTime = new Date();
+  var dif = currentTime - startTime;
+  return dif / 1000;
+}
+
+var browser$1 = {
+  nextTick: nextTick,
+  title: title,
+  browser: browser,
+  env: env,
+  argv: argv,
+  version: version,
+  versions: versions,
+  on: on,
+  addListener: addListener,
+  once: once,
+  off: off,
+  removeListener: removeListener,
+  removeAllListeners: removeAllListeners,
+  emit: emit,
+  binding: binding,
+  cwd: cwd,
+  chdir: chdir,
+  umask: umask,
+  hrtime: hrtime,
+  platform: platform,
+  release: release,
+  config: config,
+  uptime: uptime
+};
+
+var process$1 = browser$1;
+
 var reactDom = {exports: {}};
 
 var reactDom_production_min = {};
@@ -2516,16 +2772,6 @@ function f(a,b){var c=a.length;a.push(b);a:for(;0<c;){var d=c-1>>>1,e=a[d];if(0<
 
 var scheduler_development = {};
 
-/**
- * @license React
- * scheduler.development.js
- *
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
 var hasRequiredScheduler_development;
 
 function requireScheduler_development () {
@@ -2533,7 +2779,7 @@ function requireScheduler_development () {
 	hasRequiredScheduler_development = 1;
 	(function (exports) {
 
-		if (process.env.NODE_ENV !== "production") {
+		if (process$1.env.NODE_ENV !== "production") {
 		  (function() {
 
 		/* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */
@@ -3151,7 +3397,7 @@ function requireScheduler () {
 	if (hasRequiredScheduler) return scheduler.exports;
 	hasRequiredScheduler = 1;
 
-	if (process.env.NODE_ENV === 'production') {
+	if (process$1.env.NODE_ENV === 'production') {
 	  scheduler.exports = requireScheduler_production_min();
 	} else {
 	  scheduler.exports = requireScheduler_development();
@@ -3489,23 +3735,13 @@ var aa=t__default,ca=requireScheduler();function p(a){for(var b="https://reactjs
 
 var reactDom_development = {};
 
-/**
- * @license React
- * react-dom.development.js
- *
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
 var hasRequiredReactDom_development;
 
 function requireReactDom_development () {
 	if (hasRequiredReactDom_development) return reactDom_development;
 	hasRequiredReactDom_development = 1;
 
-	if (process.env.NODE_ENV !== "production") {
+	if (process$1.env.NODE_ENV !== "production") {
 	  (function() {
 
 	/* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */
@@ -33346,7 +33582,7 @@ function checkDCE() {
   ) {
     return;
   }
-  if (process.env.NODE_ENV !== 'production') {
+  if (process$1.env.NODE_ENV !== 'production') {
     // This branch is unreachable because this function is only called
     // in production, but the condition is true only in development.
     // Therefore if the branch is still here, dead code elimination wasn't
@@ -33366,7 +33602,7 @@ function checkDCE() {
   }
 }
 
-if (process.env.NODE_ENV === 'production') {
+if (process$1.env.NODE_ENV === 'production') {
   // DCE check should happen before ReactDOM bundle executes so that
   // DevTools can report bad minification during injection.
   checkDCE();
@@ -34047,6 +34283,10 @@ function Calendar({ color, size, ...nativeProps }) {
     return (jsx(IconBox, { "$color": color, "$size": size, children: jsx("svg", { height: "20", viewBox: "0 0 20 20", width: "20", ...nativeProps, children: jsxs("g", { transform: "translate(280 -41)", children: [jsxs("g", { children: [jsxs("g", { fill: "none", strokeMiterlimit: "10", children: [jsx("path", { d: "M-266,44V42h-2v2h-4V42h-2v2h-4V59h16V44Zm2,13h-12V50h12Zm0-9h-12V46h12Z", stroke: "none" }), jsx("path", { d: "M -274 42 L -272 42 L -272 44 L -268 44 L -268 42 L -266 42 L -266 44 L -262 44 L -262 59 L -278 59 L -278 44 L -274 44 L -274 42 Z M -264 48 L -264 46 L -276 46 L -276 48 L -264 48 Z M -264 57 L -264 50 L -276 50 L -276 57 L -264 57 Z", fill: "currentColor", stroke: "none" })] }), jsxs("g", { fill: "none", stroke: "currentColor", strokeMiterlimit: "10", strokeWidth: "2", transform: "translate(-274 52)", children: [jsx("rect", { height: "3", stroke: "none", width: "4" }), jsx("rect", { fill: "none", height: "1", width: "2", x: "1", y: "1" })] })] }), jsx("rect", { fill: "none", height: "20", transform: "translate(-280 41)", width: "20" })] }) }) }));
 }
 
+function Car({ color, size, ...nativeProps }) {
+    return (jsx(IconBox, { "$color": color, "$size": size, children: jsxs("svg", { height: "20", viewBox: "0 0 20 20", width: "20", ...nativeProps, children: [jsxs("g", { transform: "translate(-200 -164)", children: [jsx("path", { d: "M205.238,174.247h-.006a1.515,1.515,0,0,0-1.515,1.516,1.4,1.4,0,0,0,.445,1.056v0a1.5,1.5,0,0,0,1.069.423h.039a1.455,1.455,0,0,0,1.44-1.472,1.5,1.5,0,0,0-.428-1.075A1.405,1.405,0,0,0,205.238,174.247Z", fill: "currentColor" }), jsx("path", { d: "M214.789,174.247a1.409,1.409,0,0,0-1.057.446,1.5,1.5,0,0,0-.421,1.07,1.424,1.424,0,0,0,.432,1.056v0a1.438,1.438,0,0,0,1.039.429,1.5,1.5,0,0,0,1.075-.427,1.407,1.407,0,0,0,.446-1.045,1.478,1.478,0,0,0-.442-1.08A1.46,1.46,0,0,0,214.789,174.247Z", fill: "currentColor" }), jsx("path", { d: "M219,179.862v-6.721l-2.1-6.307a1.222,1.222,0,0,0-.46-.611A1.265,1.265,0,0,0,215.7,166H204.295a1.262,1.262,0,0,0-.736.223,1.23,1.23,0,0,0-.461.614l-2.1,6.3v6.721h0V182h2.261v-2.061h13.477V182H219v-2.138Zm-14.342-12.1h10.685l1.25,3.782H203.406Zm-1.873,10.4v-4.859h14.429v4.859Z", fill: "currentColor" })] }), jsx("rect", { fill: "none", height: "20", width: "20" })] }) }));
+}
+
 function Check({ color, size, ...nativeProps }) {
     return (jsx(IconBox, { "$color": color, "$size": size, children: jsx("svg", { height: "20", viewBox: "0 0 20 20", width: "20", ...nativeProps, children: jsxs("g", { transform: "translate(40 -82)", children: [jsxs("g", { fill: "none", strokeMiterlimit: "10", children: [jsx("path", { d: "M-23.99,86.7l-7.778,7.778-4.243-4.243-1.414,1.414,4.243,4.243,1.414,1.414,9.192-9.192Z", stroke: "none" }), jsx("path", { d: "M -23.98955917358398 86.69669342041016 L -22.57537841796875 88.11093139648438 L -31.76775932312012 97.30330657958984 L -37.42462158203125 91.64644622802734 L -36.01044082641602 90.23220825195313 L -31.76775932312012 94.47487640380859 L -23.98955917358398 86.69669342041016 Z", fill: "currentColor", stroke: "none" })] }), jsx("rect", { fill: "none", height: "20", transform: "translate(-40 82)", width: "20" })] }) }) }));
 }
@@ -34359,6 +34599,7 @@ var index = /*#__PURE__*/Object.freeze({
 	Archive: Archive,
 	Attention: Attention,
 	Calendar: Calendar,
+	Car: Car,
 	Check: Check,
 	Chevron: Chevron,
 	Clock: Clock,
@@ -54094,7 +54335,7 @@ diacritics.diacriticsMap = diacriticsMap;
  * http://www.apache.org/licenses/LICENSE-2.0
  */
 
-function isArray$1(value) {
+function isArray$2(value) {
   return !Array.isArray
     ? getTag(value) === '[object Array]'
     : Array.isArray(value)
@@ -54111,7 +54352,7 @@ function baseToString(value) {
   return result == '0' && 1 / value == -INFINITY ? '-0' : result
 }
 
-function toString$1(value) {
+function toString$2(value) {
   return value == null ? '' : baseToString(value)
 }
 
@@ -54217,7 +54458,7 @@ function createKey(key) {
   let weight = 1;
   let getFn = null;
 
-  if (isString$2(key) || isArray$1(key)) {
+  if (isString$2(key) || isArray$2(key)) {
     src = key;
     path = createKeyPath(key);
     id = createKeyId(key);
@@ -54246,11 +54487,11 @@ function createKey(key) {
 }
 
 function createKeyPath(key) {
-  return isArray$1(key) ? key : key.split('.')
+  return isArray$2(key) ? key : key.split('.')
 }
 
 function createKeyId(key) {
-  return isArray$1(key) ? key.join('.') : key
+  return isArray$2(key) ? key.join('.') : key
 }
 
 function get$3(obj, path) {
@@ -54279,8 +54520,8 @@ function get$3(obj, path) {
         index === path.length - 1 &&
         (isString$2(value) || isNumber(value) || isBoolean(value))
       ) {
-        list.push(toString$1(value));
-      } else if (isArray$1(value)) {
+        list.push(toString$2(value));
+      } else if (isArray$2(value)) {
         arr = true;
         // Search each item in the array.
         for (let i = 0, len = value.length; i < len; i += 1) {
@@ -54491,7 +54732,7 @@ class FuseIndex {
         return
       }
 
-      if (isArray$1(value)) {
+      if (isArray$2(value)) {
         let subRecords = [];
         const stack = [{ nestedArrIndex: -1, value }];
 
@@ -54510,7 +54751,7 @@ class FuseIndex {
             };
 
             subRecords.push(subRecord);
-          } else if (isArray$1(value)) {
+          } else if (isArray$2(value)) {
             value.forEach((item, k) => {
               stack.push({
                 nestedArrIndex: k,
@@ -55436,7 +55677,7 @@ const isExpression = (query) =>
 const isPath = (query) => !!query[KeyType.PATH];
 
 const isLeaf = (query) =>
-  !isArray$1(query) && isObject$2(query) && !isExpression(query);
+  !isArray$2(query) && isObject$2(query) && !isExpression(query);
 
 const convertToExplicit = (query) => ({
   [LogicalOperator.AND]: Object.keys(query).map((key) => ({
@@ -55485,7 +55726,7 @@ function parse(query, options, { auto = true } = {}) {
     keys.forEach((key) => {
       const value = query[key];
 
-      if (isArray$1(value)) {
+      if (isArray$2(value)) {
         value.forEach((item) => {
           node.children.push(next(item));
         });
@@ -55818,7 +56059,7 @@ class Fuse {
 
     let matches = [];
 
-    if (isArray$1(value)) {
+    if (isArray$2(value)) {
       value.forEach(({ v: text, i: idx, n: norm }) => {
         if (!isDefined$1(text)) {
           return
@@ -55864,6 +56105,2491 @@ Fuse.config = Config;
   register(ExtendedSearch);
 }
 
+var lookup = [];
+var revLookup = [];
+var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array;
+var inited = false;
+function init () {
+  inited = true;
+  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 toByteArray (b64) {
+  if (!inited) {
+    init();
+  }
+  var i, j, l, tmp, placeHolders, arr;
+  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
+  placeHolders = b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0;
+
+  // base64 is 4/3 + up to two characters of the original data
+  arr = new Arr(len * 3 / 4 - placeHolders);
+
+  // if there are placeholders, only get up to the last complete 4 chars
+  l = placeHolders > 0 ? len - 4 : len;
+
+  var L = 0;
+
+  for (i = 0, j = 0; i < l; i += 4, j += 3) {
+    tmp = (revLookup[b64.charCodeAt(i)] << 18) | (revLookup[b64.charCodeAt(i + 1)] << 12) | (revLookup[b64.charCodeAt(i + 2)] << 6) | revLookup[b64.charCodeAt(i + 3)];
+    arr[L++] = (tmp >> 16) & 0xFF;
+    arr[L++] = (tmp >> 8) & 0xFF;
+    arr[L++] = tmp & 0xFF;
+  }
+
+  if (placeHolders === 2) {
+    tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4);
+    arr[L++] = tmp & 0xFF;
+  } else if (placeHolders === 1) {
+    tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2);
+    arr[L++] = (tmp >> 8) & 0xFF;
+    arr[L++] = tmp & 0xFF;
+  }
+
+  return arr
+}
+
+function tripletToBase64 (num) {
+  return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F]
+}
+
+function encodeChunk (uint8, start, end) {
+  var tmp;
+  var output = [];
+  for (var i = start; i < end; i += 3) {
+    tmp = (uint8[i] << 16) + (uint8[i + 1] << 8) + (uint8[i + 2]);
+    output.push(tripletToBase64(tmp));
+  }
+  return output.join('')
+}
+
+function fromByteArray (uint8) {
+  if (!inited) {
+    init();
+  }
+  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('')
+}
+
+function read (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)
+}
+
+function write (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;
+}
+
+var toString$1 = {}.toString;
+
+var isArray$1 = Array.isArray || function (arr) {
+  return toString$1.call(arr) == '[object Array]';
+};
+
+/*!
+ * The buffer module from node.js, for the browser.
+ *
+ * @author   Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
+ * @license  MIT
+ */
+
+var 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$1.TYPED_ARRAY_SUPPORT !== undefined
+  ? global$1.TYPED_ARRAY_SUPPORT
+  : true;
+
+/*
+ * Export kMaxLength after typed array support is determined.
+ */
+kMaxLength();
+
+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;
+}
+
+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 (internalIsBuffer(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$1(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
+}
+Buffer.isBuffer = isBuffer;
+function internalIsBuffer (b) {
+  return !!(b != null && b._isBuffer)
+}
+
+Buffer.compare = function compare (a, b) {
+  if (!internalIsBuffer(a) || !internalIsBuffer(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$1(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 (!internalIsBuffer(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 (internalIsBuffer(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 (!internalIsBuffer(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 = 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 (!internalIsBuffer(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 (internalIsBuffer(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 fromByteArray(buf)
+  } else {
+    return 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 read(this, offset, true, 23, 4)
+};
+
+Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
+  if (!noAssert) checkOffset(offset, 4, this.length);
+  return read(this, offset, false, 23, 4)
+};
+
+Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
+  if (!noAssert) checkOffset(offset, 8, this.length);
+  return read(this, offset, true, 52, 8)
+};
+
+Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
+  if (!noAssert) checkOffset(offset, 8, this.length);
+  return read(this, offset, false, 52, 8)
+};
+
+function checkInt (buf, value, offset, ext, max, min) {
+  if (!internalIsBuffer(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);
+  }
+  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);
+  }
+  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 = internalIsBuffer(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 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
+}
+
+
+// the following is from is-buffer, also by Feross Aboukhadijeh and with same lisence
+// The _isBuffer check is for Safari 5-7 support, because it's missing
+// Object.prototype.constructor. Remove this eventually
+function isBuffer(obj) {
+  return obj != null && (!!obj._isBuffer || isFastBuffer(obj) || isSlowBuffer(obj))
+}
+
+function isFastBuffer (obj) {
+  return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)
+}
+
+// For Node v0.10 support. Remove this eventually.
+function isSlowBuffer (obj) {
+  return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isFastBuffer(obj.slice(0, 0))
+}
+
+var objectHash$1 = {exports: {}};
+
+var empty = {};
+
+var empty$1 = /*#__PURE__*/Object.freeze({
+	__proto__: null,
+	default: empty
+});
+
+var require$$0 = /*@__PURE__*/getAugmentedNamespace(empty$1);
+
+(function (module, exports) {
+
+	var crypto = require$$0;
+
+	/**
+	 * Exported function
+	 *
+	 * Options:
+	 *
+	 *  - `algorithm` hash algo to be used by this instance: *'sha1', 'md5'
+	 *  - `excludeValues` {true|*false} hash object keys, values ignored
+	 *  - `encoding` hash encoding, supports 'buffer', '*hex', 'binary', 'base64'
+	 *  - `ignoreUnknown` {true|*false} ignore unknown object types
+	 *  - `replacer` optional function that replaces values before hashing
+	 *  - `respectFunctionProperties` {*true|false} consider function properties when hashing
+	 *  - `respectFunctionNames` {*true|false} consider 'name' property of functions for hashing
+	 *  - `respectType` {*true|false} Respect special properties (prototype, constructor)
+	 *    when hashing to distinguish between types
+	 *  - `unorderedArrays` {true|*false} Sort all arrays before hashing
+	 *  - `unorderedSets` {*true|false} Sort `Set` and `Map` instances before hashing
+	 *  * = default
+	 *
+	 * @param {object} object value to hash
+	 * @param {object} options hashing options
+	 * @return {string} hash value
+	 * @api public
+	 */
+	exports = module.exports = objectHash;
+
+	function objectHash(object, options){
+	  options = applyDefaults(object, options);
+
+	  return hash(object, options);
+	}
+
+	/**
+	 * Exported sugar methods
+	 *
+	 * @param {object} object value to hash
+	 * @return {string} hash value
+	 * @api public
+	 */
+	exports.sha1 = function(object){
+	  return objectHash(object);
+	};
+	exports.keys = function(object){
+	  return objectHash(object, {excludeValues: true, algorithm: 'sha1', encoding: 'hex'});
+	};
+	exports.MD5 = function(object){
+	  return objectHash(object, {algorithm: 'md5', encoding: 'hex'});
+	};
+	exports.keysMD5 = function(object){
+	  return objectHash(object, {algorithm: 'md5', encoding: 'hex', excludeValues: true});
+	};
+
+	// Internals
+	var hashes = crypto.getHashes ? crypto.getHashes().slice() : ['sha1', 'md5'];
+	hashes.push('passthrough');
+	var encodings = ['buffer', 'hex', 'binary', 'base64'];
+
+	function applyDefaults(object, sourceOptions){
+	  sourceOptions = sourceOptions || {};
+
+	  // create a copy rather than mutating
+	  var options = {};
+	  options.algorithm = sourceOptions.algorithm || 'sha1';
+	  options.encoding = sourceOptions.encoding || 'hex';
+	  options.excludeValues = sourceOptions.excludeValues ? true : false;
+	  options.algorithm = options.algorithm.toLowerCase();
+	  options.encoding = options.encoding.toLowerCase();
+	  options.ignoreUnknown = sourceOptions.ignoreUnknown !== true ? false : true; // default to false
+	  options.respectType = sourceOptions.respectType === false ? false : true; // default to true
+	  options.respectFunctionNames = sourceOptions.respectFunctionNames === false ? false : true;
+	  options.respectFunctionProperties = sourceOptions.respectFunctionProperties === false ? false : true;
+	  options.unorderedArrays = sourceOptions.unorderedArrays !== true ? false : true; // default to false
+	  options.unorderedSets = sourceOptions.unorderedSets === false ? false : true; // default to false
+	  options.unorderedObjects = sourceOptions.unorderedObjects === false ? false : true; // default to true
+	  options.replacer = sourceOptions.replacer || undefined;
+	  options.excludeKeys = sourceOptions.excludeKeys || undefined;
+
+	  if(typeof object === 'undefined') {
+	    throw new Error('Object argument required.');
+	  }
+
+	  // if there is a case-insensitive match in the hashes list, accept it
+	  // (i.e. SHA256 for sha256)
+	  for (var i = 0; i < hashes.length; ++i) {
+	    if (hashes[i].toLowerCase() === options.algorithm.toLowerCase()) {
+	      options.algorithm = hashes[i];
+	    }
+	  }
+
+	  if(hashes.indexOf(options.algorithm) === -1){
+	    throw new Error('Algorithm "' + options.algorithm + '"  not supported. ' +
+	      'supported values: ' + hashes.join(', '));
+	  }
+
+	  if(encodings.indexOf(options.encoding) === -1 &&
+	     options.algorithm !== 'passthrough'){
+	    throw new Error('Encoding "' + options.encoding + '"  not supported. ' +
+	      'supported values: ' + encodings.join(', '));
+	  }
+
+	  return options;
+	}
+
+	/** Check if the given function is a native function */
+	function isNativeFunction(f) {
+	  if ((typeof f) !== 'function') {
+	    return false;
+	  }
+	  var exp = /^function\s+\w*\s*\(\s*\)\s*{\s+\[native code\]\s+}$/i;
+	  return exp.exec(Function.prototype.toString.call(f)) != null;
+	}
+
+	function hash(object, options) {
+	  var hashingStream;
+
+	  if (options.algorithm !== 'passthrough') {
+	    hashingStream = crypto.createHash(options.algorithm);
+	  } else {
+	    hashingStream = new PassThrough();
+	  }
+
+	  if (typeof hashingStream.write === 'undefined') {
+	    hashingStream.write = hashingStream.update;
+	    hashingStream.end   = hashingStream.update;
+	  }
+
+	  var hasher = typeHasher(options, hashingStream);
+	  hasher.dispatch(object);
+	  if (!hashingStream.update) {
+	    hashingStream.end('');
+	  }
+
+	  if (hashingStream.digest) {
+	    return hashingStream.digest(options.encoding === 'buffer' ? undefined : options.encoding);
+	  }
+
+	  var buf = hashingStream.read();
+	  if (options.encoding === 'buffer') {
+	    return buf;
+	  }
+
+	  return buf.toString(options.encoding);
+	}
+
+	/**
+	 * Expose streaming API
+	 *
+	 * @param {object} object  Value to serialize
+	 * @param {object} options  Options, as for hash()
+	 * @param {object} stream  A stream to write the serializiation to
+	 * @api public
+	 */
+	exports.writeToStream = function(object, options, stream) {
+	  if (typeof stream === 'undefined') {
+	    stream = options;
+	    options = {};
+	  }
+
+	  options = applyDefaults(object, options);
+
+	  return typeHasher(options, stream).dispatch(object);
+	};
+
+	function typeHasher(options, writeTo, context){
+	  context = context || [];
+	  var write = function(str) {
+	    if (writeTo.update) {
+	      return writeTo.update(str, 'utf8');
+	    } else {
+	      return writeTo.write(str, 'utf8');
+	    }
+	  };
+
+	  return {
+	    dispatch: function(value){
+	      if (options.replacer) {
+	        value = options.replacer(value);
+	      }
+
+	      var type = typeof value;
+	      if (value === null) {
+	        type = 'null';
+	      }
+
+	      //console.log("[DEBUG] Dispatch: ", value, "->", type, " -> ", "_" + type);
+
+	      return this['_' + type](value);
+	    },
+	    _object: function(object) {
+	      var pattern = (/\[object (.*)\]/i);
+	      var objString = Object.prototype.toString.call(object);
+	      var objType = pattern.exec(objString);
+	      if (!objType) { // object type did not match [object ...]
+	        objType = 'unknown:[' + objString + ']';
+	      } else {
+	        objType = objType[1]; // take only the class name
+	      }
+
+	      objType = objType.toLowerCase();
+
+	      var objectNumber = null;
+
+	      if ((objectNumber = context.indexOf(object)) >= 0) {
+	        return this.dispatch('[CIRCULAR:' + objectNumber + ']');
+	      } else {
+	        context.push(object);
+	      }
+
+	      if (typeof Buffer !== 'undefined' && Buffer.isBuffer && Buffer.isBuffer(object)) {
+	        write('buffer:');
+	        return write(object);
+	      }
+
+	      if(objType !== 'object' && objType !== 'function' && objType !== 'asyncfunction') {
+	        if(this['_' + objType]) {
+	          this['_' + objType](object);
+	        } else if (options.ignoreUnknown) {
+	          return write('[' + objType + ']');
+	        } else {
+	          throw new Error('Unknown object type "' + objType + '"');
+	        }
+	      }else {
+	        var keys = Object.keys(object);
+	        if (options.unorderedObjects) {
+	          keys = keys.sort();
+	        }
+	        // Make sure to incorporate special properties, so
+	        // Types with different prototypes will produce
+	        // a different hash and objects derived from
+	        // different functions (`new Foo`, `new Bar`) will
+	        // produce different hashes.
+	        // We never do this for native functions since some
+	        // seem to break because of that.
+	        if (options.respectType !== false && !isNativeFunction(object)) {
+	          keys.splice(0, 0, 'prototype', '__proto__', 'constructor');
+	        }
+
+	        if (options.excludeKeys) {
+	          keys = keys.filter(function(key) { return !options.excludeKeys(key); });
+	        }
+
+	        write('object:' + keys.length + ':');
+	        var self = this;
+	        return keys.forEach(function(key){
+	          self.dispatch(key);
+	          write(':');
+	          if(!options.excludeValues) {
+	            self.dispatch(object[key]);
+	          }
+	          write(',');
+	        });
+	      }
+	    },
+	    _array: function(arr, unordered){
+	      unordered = typeof unordered !== 'undefined' ? unordered :
+	        options.unorderedArrays !== false; // default to options.unorderedArrays
+
+	      var self = this;
+	      write('array:' + arr.length + ':');
+	      if (!unordered || arr.length <= 1) {
+	        return arr.forEach(function(entry) {
+	          return self.dispatch(entry);
+	        });
+	      }
+
+	      // the unordered case is a little more complicated:
+	      // since there is no canonical ordering on objects,
+	      // i.e. {a:1} < {a:2} and {a:1} > {a:2} are both false,
+	      // we first serialize each entry using a PassThrough stream
+	      // before sorting.
+	      // also: we can’t use the same context array for all entries
+	      // since the order of hashing should *not* matter. instead,
+	      // we keep track of the additions to a copy of the context array
+	      // and add all of them to the global context array when we’re done
+	      var contextAdditions = [];
+	      var entries = arr.map(function(entry) {
+	        var strm = new PassThrough();
+	        var localContext = context.slice(); // make copy
+	        var hasher = typeHasher(options, strm, localContext);
+	        hasher.dispatch(entry);
+	        // take only what was added to localContext and append it to contextAdditions
+	        contextAdditions = contextAdditions.concat(localContext.slice(context.length));
+	        return strm.read().toString();
+	      });
+	      context = context.concat(contextAdditions);
+	      entries.sort();
+	      return this._array(entries, false);
+	    },
+	    _date: function(date){
+	      return write('date:' + date.toJSON());
+	    },
+	    _symbol: function(sym){
+	      return write('symbol:' + sym.toString());
+	    },
+	    _error: function(err){
+	      return write('error:' + err.toString());
+	    },
+	    _boolean: function(bool){
+	      return write('bool:' + bool.toString());
+	    },
+	    _string: function(string){
+	      write('string:' + string.length + ':');
+	      write(string.toString());
+	    },
+	    _function: function(fn){
+	      write('fn:');
+	      if (isNativeFunction(fn)) {
+	        this.dispatch('[native]');
+	      } else {
+	        this.dispatch(fn.toString());
+	      }
+
+	      if (options.respectFunctionNames !== false) {
+	        // Make sure we can still distinguish native functions
+	        // by their name, otherwise String and Function will
+	        // have the same hash
+	        this.dispatch("function-name:" + String(fn.name));
+	      }
+
+	      if (options.respectFunctionProperties) {
+	        this._object(fn);
+	      }
+	    },
+	    _number: function(number){
+	      return write('number:' + number.toString());
+	    },
+	    _xml: function(xml){
+	      return write('xml:' + xml.toString());
+	    },
+	    _null: function() {
+	      return write('Null');
+	    },
+	    _undefined: function() {
+	      return write('Undefined');
+	    },
+	    _regexp: function(regex){
+	      return write('regex:' + regex.toString());
+	    },
+	    _uint8array: function(arr){
+	      write('uint8array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _uint8clampedarray: function(arr){
+	      write('uint8clampedarray:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _int8array: function(arr){
+	      write('int8array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _uint16array: function(arr){
+	      write('uint16array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _int16array: function(arr){
+	      write('int16array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _uint32array: function(arr){
+	      write('uint32array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _int32array: function(arr){
+	      write('int32array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _float32array: function(arr){
+	      write('float32array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _float64array: function(arr){
+	      write('float64array:');
+	      return this.dispatch(Array.prototype.slice.call(arr));
+	    },
+	    _arraybuffer: function(arr){
+	      write('arraybuffer:');
+	      return this.dispatch(new Uint8Array(arr));
+	    },
+	    _url: function(url) {
+	      return write('url:' + url.toString());
+	    },
+	    _map: function(map) {
+	      write('map:');
+	      var arr = Array.from(map);
+	      return this._array(arr, options.unorderedSets !== false);
+	    },
+	    _set: function(set) {
+	      write('set:');
+	      var arr = Array.from(set);
+	      return this._array(arr, options.unorderedSets !== false);
+	    },
+	    _file: function(file) {
+	      write('file:');
+	      return this.dispatch([file.name, file.size, file.type, file.lastModfied]);
+	    },
+	    _blob: function() {
+	      if (options.ignoreUnknown) {
+	        return write('[blob]');
+	      }
+
+	      throw Error('Hashing Blob objects is currently not supported\n' +
+	        '(see https://github.com/puleos/object-hash/issues/26)\n' +
+	        'Use "options.replacer" or "options.ignoreUnknown"\n');
+	    },
+	    _domwindow: function() { return write('domwindow'); },
+	    _bigint: function(number){
+	      return write('bigint:' + number.toString());
+	    },
+	    /* Node.js standard native objects */
+	    _process: function() { return write('process'); },
+	    _timer: function() { return write('timer'); },
+	    _pipe: function() { return write('pipe'); },
+	    _tcp: function() { return write('tcp'); },
+	    _udp: function() { return write('udp'); },
+	    _tty: function() { return write('tty'); },
+	    _statwatcher: function() { return write('statwatcher'); },
+	    _securecontext: function() { return write('securecontext'); },
+	    _connection: function() { return write('connection'); },
+	    _zlib: function() { return write('zlib'); },
+	    _context: function() { return write('context'); },
+	    _nodescript: function() { return write('nodescript'); },
+	    _httpparser: function() { return write('httpparser'); },
+	    _dataview: function() { return write('dataview'); },
+	    _signal: function() { return write('signal'); },
+	    _fsevent: function() { return write('fsevent'); },
+	    _tlswrap: function() { return write('tlswrap'); },
+	  };
+	}
+
+	// Mini-implementation of stream.PassThrough
+	// We are far from having need for the full implementation, and we can
+	// make assumptions like "many writes, then only one final read"
+	// and we can ignore encoding specifics
+	function PassThrough() {
+	  return {
+	    buf: '',
+
+	    write: function(b) {
+	      this.buf += b;
+	    },
+
+	    end: function(b) {
+	      this.buf += b;
+	    },
+
+	    read: function() {
+	      return this.buf;
+	    }
+	  };
+	} 
+} (objectHash$1, objectHash$1.exports));
+
+var objectHashExports = objectHash$1.exports;
+var objectHash = /*@__PURE__*/getDefaultExportFromCjs(objectHashExports);
+
+/**
+ * Generates a simple hash from a collection regardless of order.
+ *
+ * @param   collection  An array of objects
+ * @returns             A hash string representation of the collection
+ */
+function getHashFromCollection(collection) {
+    return objectHash(collection, {
+        // The name of this option is misleading:
+        // `true` ensures that the same hash is returned regardless of collection order
+        // https://github.com/puleos/object-hash#hashvalue-options
+        // eslint-disable-next-line @typescript-eslint/naming-convention
+        unorderedArrays: true
+    });
+}
+
+/**
+ * We take advantage of the global JS scope to use this constant as a "singleton" cache
+ * to avoid re-normalizing and re-search-indexing each time `CustomSearch` is instanciated.
+ *
+ * This cache will only be used if the `cacheKey` option is set while instanciating `CustomSearch`.
+ */
+const FUSE_SEARCH_CACHE = {};
+function findCacheRecord(currentCollection, cacheKey, withCacheInvalidation) {
+    if (!cacheKey) {
+        return undefined;
+    }
+    const cacheRecord = FUSE_SEARCH_CACHE[cacheKey];
+    if (!cacheRecord) {
+        return undefined;
+    }
+    if (withCacheInvalidation) {
+        const currentCollectionHash = getHashFromCollection(currentCollection);
+        if (currentCollectionHash !== cacheRecord.originalCollectionHash) {
+            return undefined;
+        }
+    }
+    return cacheRecord;
+}
+function storeCacheRecord(cacheKey, cacheRecord) {
+    FUSE_SEARCH_CACHE[cacheKey] = cacheRecord;
+}
+
 var lodash_min = {exports: {}};
 
 /**
@@ -56959,12 +59685,51 @@ var _ = lodash_minExports.runInContext();
 var fp = _baseConvert(_, _);
 
 /**
- * We take advantage of the global JS scope to use this constant as a "singleton" cache
- * to avoid re-normalizing and re-search-indexing each time `CustomSearch` is instanciated.
+ * Replace all the diacritics with unaccented letters in a collection, targetting the provided keys.
  *
- * This cache will only be used if the `cacheKey` option is set while instanciating `CustomSearch`.
+ * @param   collection  An array of objects
+ * @param   keys        List of item prop path to clean, either a using strings
+ *                      or [Fuse.js weighted objects](https://fusejs.io/api/options.html#keys)
+ * @returns             The same collection with its specified keys normalized without diacritics
+ *
+ * @example
+ * ```ts
+ * const collection = [
+ *   { name: 'aérosol', description: 'Un aérosol.', author: { name: 'Camille Hervé' } },
+ *   { name: 'martèlement', description: 'Un martèlement.', author: { name: 'Athénée Perreault' } }
+ * ]
+ *
+ * const normalizedCollection = cleanCollectionDiacritics(collection, ['name', 'author.name'])
+ * console.log(normalizedCollection[0])
+ * // => `{ "name": "aerosol", "description": "Un aérosol.", author: { name: 'Camille Herve' } }`
+ *
+ * const normalizedCollection = cleanCollectionDiacritics(collection, [{ name: 'name', weight: 1 }])
+ * console.log(normalizedCollection[0])
+ * // => `{ "name": "aerosol", "description": "Un aérosol.", author: { name: 'Camille Hervé' }`
+ * ```
  */
-const FUSE_SEARCH_CACHE = {};
+function cleanCollectionDiacritics(collection, keys) {
+    // These are the prop paths that needs to be normalized,
+    // represented as an array dot-seperated strings (i.e.: `['aProperty', 'a.nested.property']`)
+    const collectionKeysAsPaths = keys.map(key => (typeof key === 'string' ? key : key.name));
+    // Now that we have a list of prop paths, we want to generate a list of transformers
+    // able for remove diacritics of a collection item, one transformer per collection item prop path.
+    const collectionItemTransformers = collectionKeysAsPaths.map(collectionKeyAsPath => (collectionItem) => {
+        const collectionItemPropValue = fp.get(collectionKeyAsPath, collectionItem);
+        // This type check is a safeguard against unexpected values (a non-string value would otherwise throw an error)
+        if (typeof fp.get(collectionKeyAsPath, collectionItem) !== 'string') {
+            console.warn(`"${collectionKeyAsPath}" is not a string (value: \`${collectionItemPropValue}\`).`);
+            return collectionItem;
+        }
+        return fp.update(collectionKeyAsPath, diacritics.remove, collectionItem);
+    });
+    // We can then generate a single function piping all these collection item transformers...
+    const cleanCollectionItemDiacritics = fp.flow(collectionItemTransformers);
+    // ...and apply them to each collection item via a mapper
+    return collection.map(cleanCollectionItemDiacritics);
+}
+
+/* eslint-disable @typescript-eslint/naming-convention */
 class CustomSearch {
     #originalCollection;
     #fuse;
@@ -56972,42 +59737,45 @@ class CustomSearch {
     #isDiacriticSensitive;
     /** See {@link CustomSearchOptions.isStrict}. */
     #isStrict;
-    constructor(collection, keys, { cacheKey, isCaseSensitive = false, isDiacriticSensitive = false, isStrict = false, shouldIgnoreLocation = true, threshold = 0.4 } = {}) {
-        const maybeCache = cacheKey ? FUSE_SEARCH_CACHE[cacheKey] : undefined;
-        // eslint-disable-next-line no-nested-ternary
-        const normalizedCollection = maybeCache
-            ? maybeCache.normalizedCollection
-            : isDiacriticSensitive
-                ? collection
-                : CustomSearch.cleanCollectionDiacritics(collection, keys);
-        this.#fuse = new Fuse(normalizedCollection, 
-        /* eslint-disable @typescript-eslint/naming-convention */
-        {
+    constructor(collection, keys, { cacheKey, isCaseSensitive = false, isDiacriticSensitive = false, isStrict = false, shouldIgnoreLocation = true, threshold = 0.4, withCacheInvalidation = false } = {}) {
+        // Will be `undefined` in any of those cases:
+        // - no cache key was provided
+        // - the cache record doesn't exist
+        // - the cache record is invalidated because the collection hash has changed IF `withCacheInvalidation` is `true`
+        const maybeCacheRecord = findCacheRecord(collection, cacheKey, withCacheInvalidation);
+        const normalizedCollection = maybeCacheRecord?.normalizedCollection ?? isDiacriticSensitive
+            ? collection
+            : cleanCollectionDiacritics(collection, keys);
+        this.#fuse = new Fuse(normalizedCollection, {
             ignoreLocation: shouldIgnoreLocation,
             isCaseSensitive,
             keys,
             threshold,
             useExtendedSearch: isStrict
-        }, 
-        /* eslint-enable @typescript-eslint/naming-convention */
-        maybeCache ? Fuse.parseIndex(maybeCache.fuseSearchIndex) : undefined);
+        }, maybeCacheRecord ? Fuse.parseIndex(maybeCacheRecord.fuseSearchIndex) : undefined);
         this.#isDiacriticSensitive = isDiacriticSensitive;
         this.#isStrict = isStrict;
-        this.#originalCollection = maybeCache ? maybeCache.originalCollection : collection;
-        if (cacheKey && !maybeCache) {
-            FUSE_SEARCH_CACHE[cacheKey] = {
+        this.#originalCollection = collection;
+        // If a cache key was provided
+        // and the cache record was either nonexistent or invalidated,
+        if (cacheKey && !maybeCacheRecord) {
+            // we create a new cache record
+            const newCacheRecord = {
                 fuseSearchIndex: this.#fuse.getIndex(),
                 normalizedCollection,
-                originalCollection: collection
+                originalCollection: collection,
+                originalCollectionHash: getHashFromCollection(collection)
             };
+            // and store it
+            storeCacheRecord(cacheKey, newCacheRecord);
         }
     }
     /**
      * Searches the entire collection, and returns a list of items matching this query.
      *
-     * @param query The keywords to look for
-     * @param limit Denotes the max number of returned search results
-     * @returns     A list of matching items
+     * @param   query The keywords to look for
+     * @param   limit Denotes the max number of returned search results
+     * @returns       A list of matching items
      */
     find(query, limit) {
         const normalizedQuery = (this.#isDiacriticSensitive ? query : diacritics.remove(query)).trim();
@@ -57026,53 +59794,9 @@ class CustomSearch {
         return (this.#fuse
             .search(extendedQuery, limit ? { limit } : undefined)
             // We remap to the original collection since the normalized collection can have some accents removed
-            // (because of the internal diacritic-less normalization)
+            // (because of the internal `CustomSearch` diacritic-less normalization)
             .map(({ refIndex }) => this.#originalCollection[refIndex]));
     }
-    /**
-     * Replace all the diacritics with unaccented letters in a collection, targetting the provided keys.
-     *
-     * @param collection  An array of objects
-     * @param keys        List of item prop path to clean, either a using strings
-     *                    or [Fuse.js weighted objects](https://fusejs.io/api/options.html#keys)
-     * @returns           The same collection with its specified keys normalized without diacritics
-     *
-     * @example
-     * ```ts
-     * const collection = [
-     *   { name: 'aérosol', description: 'Un aérosol.', author: { name: 'Camille Hervé' } },
-     *   { name: 'martèlement', description: 'Un martèlement.', author: { name: 'Athénée Perreault' } }
-     * ]
-     *
-     * const normalizedCollection = CustomSearch.cleanCollectionDiacritics(collection, ['name', 'author.name'])
-     * console.log(normalizedCollection[0])
-     * // => `{ "name": "aerosol", "description": "Un aérosol.", author: { name: 'Camille Herve' } }`
-     *
-     * const normalizedCollection = CustomSearch.cleanCollectionDiacritics(collection, [{ name: 'name', weight: 1 }])
-     * console.log(normalizedCollection[0])
-     * // => `{ "name": "aerosol", "description": "Un aérosol.", author: { name: 'Camille Hervé' }`
-     * ```
-     */
-    static cleanCollectionDiacritics(collection, keys) {
-        // These are the prop paths that needs to be normalized,
-        // represented as an array dot-seperated strings (i.e.: `['aProperty', 'a.nested.property']`)
-        const collectionKeysAsPaths = keys.map(key => (typeof key === 'string' ? key : key.name));
-        // Now that we have a list of prop paths, we want to generate a list of transformers
-        // able for remove diacritics of a collection item, one transformer per collection item prop path.
-        const collectionItemTransformers = collectionKeysAsPaths.map(collectionKeyAsPath => (collectionItem) => {
-            const collectionItemPropValue = fp.get(collectionKeyAsPath, collectionItem);
-            // This type check is a safeguard against unexpected values (a non-string value would otherwise throw an error)
-            if (typeof fp.get(collectionKeyAsPath, collectionItem) !== 'string') {
-                console.warn(`"${collectionKeyAsPath}" is not a string (value: \`${collectionItemPropValue}\`).`);
-                return collectionItem;
-            }
-            return fp.update(collectionKeyAsPath, diacritics.remove, collectionItem);
-        });
-        // We can then generate a single function piping all these collection item transformers...
-        const cleanCollectionItemDiacritics = fp.flow(collectionItemTransformers);
-        // ...and apply them to each collection item via a mapper
-        return collection.map(cleanCollectionItemDiacritics);
-    }
 }
 
 function MultiSelect({ baseContainer, className, customSearch, customSearchMinQueryLength = 1, disabled = false, error, isErrorMessageHidden = false, isLabelHidden = false, isLight = false, isUndefinedWhenDisabled = false, label, onChange, options, optionValueKey, searchable = false, style, value, ...originalProps }) {
@@ -57576,15 +60300,6 @@ var b="function"===typeof Symbol&&Symbol.for,c=b?Symbol.for("react.element"):601
 
 var reactIs_development = {};
 
-/** @license React v16.13.1
- * react-is.development.js
- *
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
 var hasRequiredReactIs_development;
 
 function requireReactIs_development () {
@@ -57593,7 +60308,7 @@ function requireReactIs_development () {
 
 
 
-	if (process.env.NODE_ENV !== "production") {
+	if (process$1.env.NODE_ENV !== "production") {
 	  (function() {
 
 	// The Symbol used to tag the ReactElement-like types. If there is no native Symbol
@@ -57769,7 +60484,7 @@ function requireReactIs () {
 	if (hasRequiredReactIs) return reactIs.exports;
 	hasRequiredReactIs = 1;
 
-	if (process.env.NODE_ENV === 'production') {
+	if (process$1.env.NODE_ENV === 'production') {
 	  reactIs.exports = requireReactIs_production_min();
 	} else {
 	  reactIs.exports = requireReactIs_development();
@@ -57905,13 +60620,6 @@ function requireHas () {
 	return has;
 }
 
-/**
- * Copyright (c) 2013-present, Facebook, Inc.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
 var checkPropTypes_1;
 var hasRequiredCheckPropTypes;
 
@@ -57921,7 +60629,7 @@ function requireCheckPropTypes () {
 
 	var printWarning = function() {};
 
-	if (process.env.NODE_ENV !== 'production') {
+	if (process$1.env.NODE_ENV !== 'production') {
 	  var ReactPropTypesSecret = requireReactPropTypesSecret();
 	  var loggedTypeFailures = {};
 	  var has = requireHas();
@@ -57952,7 +60660,7 @@ function requireCheckPropTypes () {
 	 * @private
 	 */
 	function checkPropTypes(typeSpecs, values, location, componentName, getStack) {
-	  if (process.env.NODE_ENV !== 'production') {
+	  if (process$1.env.NODE_ENV !== 'production') {
 	    for (var typeSpecName in typeSpecs) {
 	      if (has(typeSpecs, typeSpecName)) {
 	        var error;
@@ -58007,7 +60715,7 @@ function requireCheckPropTypes () {
 	 * @private
 	 */
 	checkPropTypes.resetWarningCache = function() {
-	  if (process.env.NODE_ENV !== 'production') {
+	  if (process$1.env.NODE_ENV !== 'production') {
 	    loggedTypeFailures = {};
 	  }
 	};
@@ -58016,13 +60724,6 @@ function requireCheckPropTypes () {
 	return checkPropTypes_1;
 }
 
-/**
- * Copyright (c) 2013-present, Facebook, Inc.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
 var factoryWithTypeCheckers;
 var hasRequiredFactoryWithTypeCheckers;
 
@@ -58039,7 +60740,7 @@ function requireFactoryWithTypeCheckers () {
 
 	var printWarning = function() {};
 
-	if (process.env.NODE_ENV !== 'production') {
+	if (process$1.env.NODE_ENV !== 'production') {
 	  printWarning = function(text) {
 	    var message = 'Warning: ' + text;
 	    if (typeof console !== 'undefined') {
@@ -58192,7 +60893,7 @@ function requireFactoryWithTypeCheckers () {
 	  PropTypeError.prototype = Error.prototype;
 
 	  function createChainableTypeChecker(validate) {
-	    if (process.env.NODE_ENV !== 'production') {
+	    if (process$1.env.NODE_ENV !== 'production') {
 	      var manualPropTypeCallCache = {};
 	      var manualPropTypeWarningCount = 0;
 	    }
@@ -58210,7 +60911,7 @@ function requireFactoryWithTypeCheckers () {
 	          );
 	          err.name = 'Invariant Violation';
 	          throw err;
-	        } else if (process.env.NODE_ENV !== 'production' && typeof console !== 'undefined') {
+	        } else if (process$1.env.NODE_ENV !== 'production' && typeof console !== 'undefined') {
 	          // Old behavior for people using React.PropTypes
 	          var cacheKey = componentName + ':' + propName;
 	          if (
@@ -58332,7 +61033,7 @@ function requireFactoryWithTypeCheckers () {
 
 	  function createEnumTypeChecker(expectedValues) {
 	    if (!Array.isArray(expectedValues)) {
-	      if (process.env.NODE_ENV !== 'production') {
+	      if (process$1.env.NODE_ENV !== 'production') {
 	        if (arguments.length > 1) {
 	          printWarning(
 	            'Invalid arguments supplied to oneOf, expected an array, got ' + arguments.length + ' arguments. ' +
@@ -58390,7 +61091,7 @@ function requireFactoryWithTypeCheckers () {
 
 	  function createUnionTypeChecker(arrayOfTypeCheckers) {
 	    if (!Array.isArray(arrayOfTypeCheckers)) {
-	      process.env.NODE_ENV !== 'production' ? printWarning('Invalid argument supplied to oneOfType, expected an instance of array.') : void 0;
+	      process$1.env.NODE_ENV !== 'production' ? printWarning('Invalid argument supplied to oneOfType, expected an instance of array.') : void 0;
 	      return emptyFunctionThatReturnsNull;
 	    }
 
@@ -58705,14 +61406,7 @@ function requireFactoryWithThrowingShims () {
 	return factoryWithThrowingShims;
 }
 
-/**
- * Copyright (c) 2013-present, Facebook, Inc.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
-if (process.env.NODE_ENV !== 'production') {
+if (process$1.env.NODE_ENV !== 'production') {
   var ReactIs = requireReactIs();
 
   // By explicitly using `prop-types` you are opting into new development behavior.
@@ -71002,5 +73696,5 @@ function undefine(value) {
     return value;
 }
 
-export { Accent, Button$1 as Button, Checkbox, CoordinatesFormat, CoordinatesInput, CustomSearch, DataTable, DatePicker, DateRangePicker, Dialog, Dropdown, ExclamationPoint, Field$2 as Field, FieldError, Fieldset, FormikCheckbox, FormikCoordinatesInput, FormikDatePicker, FormikDateRangePicker, FormikEffect, FormikMultiCheckbox, FormikMultiRadio, FormikMultiSelect, FormikNumberInput, FormikSearch, FormikSelect, FormikTextInput, FormikTextarea, GlobalStyle, index as Icon, IconButton, Label, Legend, Level, MapMenuDialog, Message, MultiCheckbox, MultiRadio, MultiSelect, MultiZoneEditor, NewWindow, NewWindowContext, NotificationEvent, Notifier, NumberInput, OPENLAYERS_PROJECTION, OnlyFontGlobalStyle, Search, Select, SideMenu, SimpleTable, SingleTag, Size, THEME, TableWithSelectableRows, Tag, TagBullet, TagGroup, TextInput, Textarea, ThemeProvider, WSG84_PROJECTION, cleanString, coordinatesAreDistinct, customDayjs, getCoordinates, getLocalizedDayjs, getOptionsFromIdAndName, getOptionsFromLabelledEnum, getPseudoRandomString, getUtcizedDayjs, isArray, isDefined, isNumeric, isObject, logSoftError, normalizeString, nullify, pluralize, stopMouseEventPropagation, undefine, useClickOutsideEffect, useFieldControl, useForceUpdate, useKey, useNewWindow, usePrevious };
+export { Accent, Button$1 as Button, Checkbox, CoordinatesFormat, CoordinatesInput, CustomSearch, DataTable, DatePicker, DateRangePicker, Dialog, Dropdown, ExclamationPoint, Field$2 as Field, FieldError, Fieldset, FormikCheckbox, FormikCoordinatesInput, FormikDatePicker, FormikDateRangePicker, FormikEffect, FormikMultiCheckbox, FormikMultiRadio, FormikMultiSelect, FormikNumberInput, FormikSearch, FormikSelect, FormikTextInput, FormikTextarea, GlobalStyle, index as Icon, IconButton, Label, Legend, Level, MapMenuDialog, Message, MultiCheckbox, MultiRadio, MultiSelect, MultiZoneEditor, NewWindow, NewWindowContext, NotificationEvent, Notifier, NumberInput, OPENLAYERS_PROJECTION, OnlyFontGlobalStyle, Search, Select, SideMenu, SimpleTable, SingleTag, Size, THEME, TableWithSelectableRows, Tag, TagBullet, TagGroup, TextInput, Textarea, ThemeProvider, WSG84_PROJECTION, cleanString, coordinatesAreDistinct, customDayjs, getCoordinates, getHashFromCollection, getLocalizedDayjs, getOptionsFromIdAndName, getOptionsFromLabelledEnum, getPseudoRandomString, getUtcizedDayjs, isArray, isDefined, isNumeric, isObject, logSoftError, normalizeString, nullify, pluralize, stopMouseEventPropagation, undefine, useClickOutsideEffect, useFieldControl, useForceUpdate, useKey, useNewWindow, usePrevious };
 //# sourceMappingURL=index.js.map