@likec4/core 1.23.0 → 1.24.0

package/dist/shared/core.FFJhmauw.mjs

@@ -0,0 +1,2078 @@
+import { u as u$1, i as invariant } from './core.Btj1m6H6.mjs';
+
+var e={done:true,hasNext:false},s={done:false,hasNext:false},a=()=>e;
+
+function C(t,...o){let n=t,u=o.map(e=>"lazy"in e?A(e):void 0),p=0;for(;p<o.length;){if(u[p]===void 0||!B(n)){let i=o[p];n=i(n),p+=1;continue}let r=[];for(let i=p;i<o.length;i++){let l=u[i];if(l===void 0||(r.push(l),l.isSingle))break}let a=[];for(let i of n)if(y(i,a,r))break;let{isSingle:s}=r.at(-1);n=s?a[0]:a,p+=r.length;}return n}function y(t,o,n){if(n.length===0)return o.push(t),false;let u=t,p=s,e=false;for(let[r,a]of n.entries()){let{index:s,items:i}=a;if(i.push(u),p=a(u,s,i),a.index+=1,p.hasNext){if(p.hasMany??false){for(let l of p.next)if(y(l,o,n.slice(r+1)))return  true;return e}u=p.next;}if(!p.hasNext)break;p.done&&(e=true);}return p.hasNext&&o.push(u),e}function A(t){let{lazy:o,lazyArgs:n}=t,u=o(...n);return Object.assign(u,{isSingle:o.single??false,index:0,items:[]})}function B(t){return typeof t=="string"||typeof t=="object"&&t!==null&&Symbol.iterator in t}
+
+function d(...e){return u$1(i$2,e,o$1)}var i$2=(e,n)=>e.length<n.length?e.map((t,r)=>[t,n[r]]):n.map((t,r)=>[e[r],t]),o$1=e=>(n,t)=>({hasNext:true,next:[n,e[t]],done:t>=e.length-1});
+
+function i$1(...e){return u$1(r,e)}var r=(e,t)=>e.length>=t;
+
+function u(...e){return u$1(i,e)}function i(e,a){let n=[];for(let[o,r]of e.entries()){if(!a(r,o,e))break;n.push(r);}return n}
+
+function m(...a){return u$1(o,a,p)}var o=(a,e)=>a.map(e),p=a=>(e,t,r)=>({done:false,hasNext:true,next:a(e,t,r)});
+
+function t$1(r){return typeof r=="string"}
+
+function t(n){return typeof n=="function"}
+
+function l(n){return n!=null}
+
+function n(e){return e!==void 0}
+
+function getDefaultExportFromCjs (x) {
+	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+}
+
+/**
+ * Mnemonist DefaultMap
+ * =====================
+ *
+ * JavaScript implementation of a default map that will return a constructed
+ * value any time one tries to access an inexisting key. It's quite similar
+ * to python's defaultdict.
+ */
+
+var defaultMap;
+var hasRequiredDefaultMap;
+
+function requireDefaultMap () {
+	if (hasRequiredDefaultMap) return defaultMap;
+	hasRequiredDefaultMap = 1;
+	/**
+	 * DefaultMap.
+	 *
+	 * @constructor
+	 */
+	function DefaultMap(factory) {
+	  if (typeof factory !== 'function')
+	    throw new Error('mnemonist/DefaultMap.constructor: expecting a function.');
+
+	  this.items = new Map();
+	  this.factory = factory;
+	  this.size = 0;
+	}
+
+	/**
+	 * Method used to clear the structure.
+	 *
+	 * @return {undefined}
+	 */
+	DefaultMap.prototype.clear = function() {
+
+	  // Properties
+	  this.items.clear();
+	  this.size = 0;
+	};
+
+	/**
+	 * Method used to get the value set for given key. If the key does not exist,
+	 * the value will be created using the provided factory.
+	 *
+	 * @param  {any} key - Target key.
+	 * @return {any}
+	 */
+	DefaultMap.prototype.get = function(key) {
+	  var value = this.items.get(key);
+
+	  if (typeof value === 'undefined') {
+	    value = this.factory(key, this.size);
+	    this.items.set(key, value);
+	    this.size++;
+	  }
+
+	  return value;
+	};
+
+	/**
+	 * Method used to get the value set for given key. If the key does not exist,
+	 * a value won't be created.
+	 *
+	 * @param  {any} key - Target key.
+	 * @return {any}
+	 */
+	DefaultMap.prototype.peek = function(key) {
+	  return this.items.get(key);
+	};
+
+	/**
+	 * Method used to set a value for given key.
+	 *
+	 * @param  {any} key   - Target key.
+	 * @param  {any} value - Value.
+	 * @return {DefaultMap}
+	 */
+	DefaultMap.prototype.set = function(key, value) {
+	  this.items.set(key, value);
+	  this.size = this.items.size;
+
+	  return this;
+	};
+
+	/**
+	 * Method used to test the existence of a key in the map.
+	 *
+	 * @param  {any} key   - Target key.
+	 * @return {boolean}
+	 */
+	DefaultMap.prototype.has = function(key) {
+	  return this.items.has(key);
+	};
+
+	/**
+	 * Method used to delete target key.
+	 *
+	 * @param  {any} key   - Target key.
+	 * @return {boolean}
+	 */
+	DefaultMap.prototype.delete = function(key) {
+	  var deleted = this.items.delete(key);
+
+	  this.size = this.items.size;
+
+	  return deleted;
+	};
+
+	/**
+	 * Method used to iterate over each of the key/value pairs.
+	 *
+	 * @param  {function}  callback - Function to call for each item.
+	 * @param  {object}    scope    - Optional scope.
+	 * @return {undefined}
+	 */
+	DefaultMap.prototype.forEach = function(callback, scope) {
+	  scope = arguments.length > 1 ? scope : this;
+
+	  this.items.forEach(callback, scope);
+	};
+
+	/**
+	 * Iterators.
+	 */
+	DefaultMap.prototype.entries = function() {
+	  return this.items.entries();
+	};
+
+	DefaultMap.prototype.keys = function() {
+	  return this.items.keys();
+	};
+
+	DefaultMap.prototype.values = function() {
+	  return this.items.values();
+	};
+
+	/**
+	 * Attaching the #.entries method to Symbol.iterator if possible.
+	 */
+	if (typeof Symbol !== 'undefined')
+	  DefaultMap.prototype[Symbol.iterator] = DefaultMap.prototype.entries;
+
+	/**
+	 * Convenience known methods.
+	 */
+	DefaultMap.prototype.inspect = function() {
+	  return this.items;
+	};
+
+	if (typeof Symbol !== 'undefined')
+	  DefaultMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = DefaultMap.prototype.inspect;
+
+	/**
+	 * Typical factories.
+	 */
+	DefaultMap.autoIncrement = function() {
+	  var i = 0;
+
+	  return function() {
+	    return i++;
+	  };
+	};
+
+	/**
+	 * Exporting.
+	 */
+	defaultMap = DefaultMap;
+	return defaultMap;
+}
+
+var defaultMapExports = requireDefaultMap();
+const DefaultMap = /*@__PURE__*/getDefaultExportFromCjs(defaultMapExports);
+
+/**
+ * Mnemonist DefaultWeakMap
+ * =========================
+ *
+ * JavaScript implementation of a default weak map that will return a constructed
+ * value any time one tries to access an non-existing key. It is similar to
+ * DefaultMap but uses ES6 WeakMap that only holds weak reference to keys.
+ */
+
+var defaultWeakMap$1;
+var hasRequiredDefaultWeakMap;
+
+function requireDefaultWeakMap () {
+	if (hasRequiredDefaultWeakMap) return defaultWeakMap$1;
+	hasRequiredDefaultWeakMap = 1;
+	/**
+	 * DefaultWeakMap.
+	 *
+	 * @constructor
+	 */
+	function DefaultWeakMap(factory) {
+	  if (typeof factory !== 'function')
+	    throw new Error('mnemonist/DefaultWeakMap.constructor: expecting a function.');
+
+	  this.items = new WeakMap();
+	  this.factory = factory;
+	}
+
+	/**
+	 * Method used to clear the structure.
+	 *
+	 * @return {undefined}
+	 */
+	DefaultWeakMap.prototype.clear = function() {
+
+	  // Properties
+	  this.items = new WeakMap();
+	};
+
+	/**
+	 * Method used to get the value set for given key. If the key does not exist,
+	 * the value will be created using the provided factory.
+	 *
+	 * @param  {any} key - Target key.
+	 * @return {any}
+	 */
+	DefaultWeakMap.prototype.get = function(key) {
+	  var value = this.items.get(key);
+
+	  if (typeof value === 'undefined') {
+	    value = this.factory(key);
+	    this.items.set(key, value);
+	  }
+
+	  return value;
+	};
+
+	/**
+	 * Method used to get the value set for given key. If the key does not exist,
+	 * a value won't be created.
+	 *
+	 * @param  {any} key - Target key.
+	 * @return {any}
+	 */
+	DefaultWeakMap.prototype.peek = function(key) {
+	  return this.items.get(key);
+	};
+
+	/**
+	 * Method used to set a value for given key.
+	 *
+	 * @param  {any} key   - Target key.
+	 * @param  {any} value - Value.
+	 * @return {DefaultMap}
+	 */
+	DefaultWeakMap.prototype.set = function(key, value) {
+	  this.items.set(key, value);
+	  return this;
+	};
+
+	/**
+	 * Method used to test the existence of a key in the map.
+	 *
+	 * @param  {any} key   - Target key.
+	 * @return {boolean}
+	 */
+	DefaultWeakMap.prototype.has = function(key) {
+	  return this.items.has(key);
+	};
+
+	/**
+	 * Method used to delete target key.
+	 *
+	 * @param  {any} key   - Target key.
+	 * @return {boolean}
+	 */
+	DefaultWeakMap.prototype.delete = function(key) {
+	  return this.items.delete(key);
+	};
+
+	/**
+	 * Convenience known methods.
+	 */
+	DefaultWeakMap.prototype.inspect = function() {
+	  return this.items;
+	};
+
+	if (typeof Symbol !== 'undefined')
+	  DefaultWeakMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = DefaultWeakMap.prototype.inspect;
+
+	/**
+	 * Exporting.
+	 */
+	defaultWeakMap$1 = DefaultWeakMap;
+	return defaultWeakMap$1;
+}
+
+var defaultWeakMapExports = requireDefaultWeakMap();
+const defaultWeakMap = /*@__PURE__*/getDefaultExportFromCjs(defaultWeakMapExports);
+
+/**
+ * Obliterator Iterator Class
+ * ===========================
+ *
+ * Simple class representing the library's iterators.
+ */
+
+var iterator;
+var hasRequiredIterator;
+
+function requireIterator () {
+	if (hasRequiredIterator) return iterator;
+	hasRequiredIterator = 1;
+	/**
+	 * Iterator class.
+	 *
+	 * @constructor
+	 * @param {function} next - Next function.
+	 */
+	function Iterator(next) {
+	  if (typeof next !== 'function')
+	    throw new Error('obliterator/iterator: expecting a function!');
+
+	  this.next = next;
+	}
+
+	/**
+	 * If symbols are supported, we add `next` to `Symbol.iterator`.
+	 */
+	if (typeof Symbol !== 'undefined')
+	  Iterator.prototype[Symbol.iterator] = function () {
+	    return this;
+	  };
+
+	/**
+	 * Returning an iterator of the given values.
+	 *
+	 * @param  {any...} values - Values.
+	 * @return {Iterator}
+	 */
+	Iterator.of = function () {
+	  var args = arguments,
+	    l = args.length,
+	    i = 0;
+
+	  return new Iterator(function () {
+	    if (i >= l) return {done: true};
+
+	    return {done: false, value: args[i++]};
+	  });
+	};
+
+	/**
+	 * Returning an empty iterator.
+	 *
+	 * @return {Iterator}
+	 */
+	Iterator.empty = function () {
+	  var iterator = new Iterator(function () {
+	    return {done: true};
+	  });
+
+	  return iterator;
+	};
+
+	/**
+	 * Returning an iterator over the given indexed sequence.
+	 *
+	 * @param  {string|Array} sequence - Target sequence.
+	 * @return {Iterator}
+	 */
+	Iterator.fromSequence = function (sequence) {
+	  var i = 0,
+	    l = sequence.length;
+
+	  return new Iterator(function () {
+	    if (i >= l) return {done: true};
+
+	    return {done: false, value: sequence[i++]};
+	  });
+	};
+
+	/**
+	 * Returning whether the given value is an iterator.
+	 *
+	 * @param  {any} value - Value.
+	 * @return {boolean}
+	 */
+	Iterator.is = function (value) {
+	  if (value instanceof Iterator) return true;
+
+	  return (
+	    typeof value === 'object' &&
+	    value !== null &&
+	    typeof value.next === 'function'
+	  );
+	};
+
+	/**
+	 * Exporting.
+	 */
+	iterator = Iterator;
+	return iterator;
+}
+
+var support = {};
+
+var hasRequiredSupport;
+
+function requireSupport () {
+	if (hasRequiredSupport) return support;
+	hasRequiredSupport = 1;
+	support.ARRAY_BUFFER_SUPPORT = typeof ArrayBuffer !== 'undefined';
+	support.SYMBOL_SUPPORT = typeof Symbol !== 'undefined';
+	return support;
+}
+
+/**
+ * Obliterator ForEach Function
+ * =============================
+ *
+ * Helper function used to easily iterate over mixed values.
+ */
+
+var foreach;
+var hasRequiredForeach;
+
+function requireForeach () {
+	if (hasRequiredForeach) return foreach;
+	hasRequiredForeach = 1;
+	var support = requireSupport();
+
+	var ARRAY_BUFFER_SUPPORT = support.ARRAY_BUFFER_SUPPORT;
+	var SYMBOL_SUPPORT = support.SYMBOL_SUPPORT;
+
+	/**
+	 * Function able to iterate over almost any iterable JS value.
+	 *
+	 * @param  {any}      iterable - Iterable value.
+	 * @param  {function} callback - Callback function.
+	 */
+	foreach = function forEach(iterable, callback) {
+	  var iterator, k, i, l, s;
+
+	  if (!iterable) throw new Error('obliterator/forEach: invalid iterable.');
+
+	  if (typeof callback !== 'function')
+	    throw new Error('obliterator/forEach: expecting a callback.');
+
+	  // The target is an array or a string or function arguments
+	  if (
+	    Array.isArray(iterable) ||
+	    (ARRAY_BUFFER_SUPPORT && ArrayBuffer.isView(iterable)) ||
+	    typeof iterable === 'string' ||
+	    iterable.toString() === '[object Arguments]'
+	  ) {
+	    for (i = 0, l = iterable.length; i < l; i++) callback(iterable[i], i);
+	    return;
+	  }
+
+	  // The target has a #.forEach method
+	  if (typeof iterable.forEach === 'function') {
+	    iterable.forEach(callback);
+	    return;
+	  }
+
+	  // The target is iterable
+	  if (
+	    SYMBOL_SUPPORT &&
+	    Symbol.iterator in iterable &&
+	    typeof iterable.next !== 'function'
+	  ) {
+	    iterable = iterable[Symbol.iterator]();
+	  }
+
+	  // The target is an iterator
+	  if (typeof iterable.next === 'function') {
+	    iterator = iterable;
+	    i = 0;
+
+	    while (((s = iterator.next()), s.done !== true)) {
+	      callback(s.value, i);
+	      i++;
+	    }
+
+	    return;
+	  }
+
+	  // The target is a plain object
+	  for (k in iterable) {
+	    if (iterable.hasOwnProperty(k)) {
+	      callback(iterable[k], k);
+	    }
+	  }
+
+	  return;
+	};
+	return foreach;
+}
+
+/**
+ * Mnemonist Linked List
+ * ======================
+ *
+ * Singly linked list implementation. Uses raw JavaScript objects as nodes
+ * as benchmarks proved it was the fastest thing to do.
+ */
+
+var linkedList$1;
+var hasRequiredLinkedList;
+
+function requireLinkedList () {
+	if (hasRequiredLinkedList) return linkedList$1;
+	hasRequiredLinkedList = 1;
+	var Iterator = requireIterator(),
+	    forEach = requireForeach();
+
+	/**
+	 * Linked List.
+	 *
+	 * @constructor
+	 */
+	function LinkedList() {
+	  this.clear();
+	}
+
+	/**
+	 * Method used to clear the list.
+	 *
+	 * @return {undefined}
+	 */
+	LinkedList.prototype.clear = function() {
+
+	  // Properties
+	  this.head = null;
+	  this.tail = null;
+	  this.size = 0;
+	};
+
+	/**
+	 * Method used to get the first item of the list.
+	 *
+	 * @return {any}
+	 */
+	LinkedList.prototype.first = function() {
+	  return this.head ? this.head.item : undefined;
+	};
+	LinkedList.prototype.peek = LinkedList.prototype.first;
+
+	/**
+	 * Method used to get the last item of the list.
+	 *
+	 * @return {any}
+	 */
+	LinkedList.prototype.last = function() {
+	  return this.tail ? this.tail.item : undefined;
+	};
+
+	/**
+	 * Method used to add an item at the end of the list.
+	 *
+	 * @param  {any}    item - The item to add.
+	 * @return {number}
+	 */
+	LinkedList.prototype.push = function(item) {
+	  var node = {item: item, next: null};
+
+	  if (!this.head) {
+	    this.head = node;
+	    this.tail = node;
+	  }
+	  else {
+	    this.tail.next = node;
+	    this.tail = node;
+	  }
+
+	  this.size++;
+
+	  return this.size;
+	};
+
+	/**
+	 * Method used to add an item at the beginning of the list.
+	 *
+	 * @param  {any}    item - The item to add.
+	 * @return {number}
+	 */
+	LinkedList.prototype.unshift = function(item) {
+	  var node = {item: item, next: null};
+
+	  if (!this.head) {
+	    this.head = node;
+	    this.tail = node;
+	  }
+	  else {
+	    if (!this.head.next)
+	      this.tail = this.head;
+	    node.next = this.head;
+	    this.head = node;
+	  }
+
+	  this.size++;
+
+	  return this.size;
+	};
+
+	/**
+	 * Method used to retrieve & remove the first item of the list.
+	 *
+	 * @return {any}
+	 */
+	LinkedList.prototype.shift = function() {
+	  if (!this.size)
+	    return undefined;
+
+	  var node = this.head;
+
+	  this.head = node.next;
+	  this.size--;
+
+	  return node.item;
+	};
+
+	/**
+	 * Method used to iterate over the list.
+	 *
+	 * @param  {function}  callback - Function to call for each item.
+	 * @param  {object}    scope    - Optional scope.
+	 * @return {undefined}
+	 */
+	LinkedList.prototype.forEach = function(callback, scope) {
+	  if (!this.size)
+	    return;
+
+	  scope = arguments.length > 1 ? scope : this;
+
+	  var n = this.head,
+	      i = 0;
+
+	  while (n) {
+	    callback.call(scope, n.item, i, this);
+	    n = n.next;
+	    i++;
+	  }
+	};
+
+	/**
+	 * Method used to convert the list into an array.
+	 *
+	 * @return {array}
+	 */
+	LinkedList.prototype.toArray = function() {
+	  if (!this.size)
+	    return [];
+
+	  var array = new Array(this.size);
+
+	  for (var i = 0, l = this.size, n = this.head; i < l; i++) {
+	    array[i] = n.item;
+	    n = n.next;
+	  }
+
+	  return array;
+	};
+
+	/**
+	 * Method used to create an iterator over a list's values.
+	 *
+	 * @return {Iterator}
+	 */
+	LinkedList.prototype.values = function() {
+	  var n = this.head;
+
+	  return new Iterator(function() {
+	    if (!n)
+	      return {
+	        done: true
+	      };
+
+	    var value = n.item;
+	    n = n.next;
+
+	    return {
+	      value: value,
+	      done: false
+	    };
+	  });
+	};
+
+	/**
+	 * Method used to create an iterator over a list's entries.
+	 *
+	 * @return {Iterator}
+	 */
+	LinkedList.prototype.entries = function() {
+	  var n = this.head,
+	      i = 0;
+
+	  return new Iterator(function() {
+	    if (!n)
+	      return {
+	        done: true
+	      };
+
+	    var value = n.item;
+	    n = n.next;
+	    i++;
+
+	    return {
+	      value: [i - 1, value],
+	      done: false
+	    };
+	  });
+	};
+
+	/**
+	 * Attaching the #.values method to Symbol.iterator if possible.
+	 */
+	if (typeof Symbol !== 'undefined')
+	  LinkedList.prototype[Symbol.iterator] = LinkedList.prototype.values;
+
+	/**
+	 * Convenience known methods.
+	 */
+	LinkedList.prototype.toString = function() {
+	  return this.toArray().join(',');
+	};
+
+	LinkedList.prototype.toJSON = function() {
+	  return this.toArray();
+	};
+
+	LinkedList.prototype.inspect = function() {
+	  var array = this.toArray();
+
+	  // Trick so that node displays the name of the constructor
+	  Object.defineProperty(array, 'constructor', {
+	    value: LinkedList,
+	    enumerable: false
+	  });
+
+	  return array;
+	};
+
+	if (typeof Symbol !== 'undefined')
+	  LinkedList.prototype[Symbol.for('nodejs.util.inspect.custom')] = LinkedList.prototype.inspect;
+
+	/**
+	 * Static @.from function taking an arbitrary iterable & converting it into
+	 * a list.
+	 *
+	 * @param  {Iterable} iterable   - Target iterable.
+	 * @return {LinkedList}
+	 */
+	LinkedList.from = function(iterable) {
+	  var list = new LinkedList();
+
+	  forEach(iterable, function(value) {
+	    list.push(value);
+	  });
+
+	  return list;
+	};
+
+	/**
+	 * Exporting.
+	 */
+	linkedList$1 = LinkedList;
+	return linkedList$1;
+}
+
+var linkedListExports = requireLinkedList();
+const linkedList = /*@__PURE__*/getDefaultExportFromCjs(linkedListExports);
+
+/**
+ * Mnemonist Queue
+ * ================
+ *
+ * Queue implementation based on the ideas of Queue.js that seems to beat
+ * a LinkedList one in performance.
+ */
+
+var queue$1;
+var hasRequiredQueue;
+
+function requireQueue () {
+	if (hasRequiredQueue) return queue$1;
+	hasRequiredQueue = 1;
+	var Iterator = requireIterator(),
+	    forEach = requireForeach();
+
+	/**
+	 * Queue
+	 *
+	 * @constructor
+	 */
+	function Queue() {
+	  this.clear();
+	}
+
+	/**
+	 * Method used to clear the queue.
+	 *
+	 * @return {undefined}
+	 */
+	Queue.prototype.clear = function() {
+
+	  // Properties
+	  this.items = [];
+	  this.offset = 0;
+	  this.size = 0;
+	};
+
+	/**
+	 * Method used to add an item to the queue.
+	 *
+	 * @param  {any}    item - Item to enqueue.
+	 * @return {number}
+	 */
+	Queue.prototype.enqueue = function(item) {
+
+	  this.items.push(item);
+	  return ++this.size;
+	};
+
+	/**
+	 * Method used to retrieve & remove the first item of the queue.
+	 *
+	 * @return {any}
+	 */
+	Queue.prototype.dequeue = function() {
+	  if (!this.size)
+	    return;
+
+	  var item = this.items[this.offset];
+
+	  if (++this.offset * 2 >= this.items.length) {
+	    this.items = this.items.slice(this.offset);
+	    this.offset = 0;
+	  }
+
+	  this.size--;
+
+	  return item;
+	};
+
+	/**
+	 * Method used to retrieve the first item of the queue.
+	 *
+	 * @return {any}
+	 */
+	Queue.prototype.peek = function() {
+	  if (!this.size)
+	    return;
+
+	  return this.items[this.offset];
+	};
+
+	/**
+	 * Method used to iterate over the queue.
+	 *
+	 * @param  {function}  callback - Function to call for each item.
+	 * @param  {object}    scope    - Optional scope.
+	 * @return {undefined}
+	 */
+	Queue.prototype.forEach = function(callback, scope) {
+	  scope = arguments.length > 1 ? scope : this;
+
+	  for (var i = this.offset, j = 0, l = this.items.length; i < l; i++, j++)
+	    callback.call(scope, this.items[i], j, this);
+	};
+
+	/*
+	 * Method used to convert the queue to a JavaScript array.
+	 *
+	 * @return {array}
+	 */
+	Queue.prototype.toArray = function() {
+	  return this.items.slice(this.offset);
+	};
+
+	/**
+	 * Method used to create an iterator over a queue's values.
+	 *
+	 * @return {Iterator}
+	 */
+	Queue.prototype.values = function() {
+	  var items = this.items,
+	      i = this.offset;
+
+	  return new Iterator(function() {
+	    if (i >= items.length)
+	      return {
+	        done: true
+	      };
+
+	    var value = items[i];
+	    i++;
+
+	    return {
+	      value: value,
+	      done: false
+	    };
+	  });
+	};
+
+	/**
+	 * Method used to create an iterator over a queue's entries.
+	 *
+	 * @return {Iterator}
+	 */
+	Queue.prototype.entries = function() {
+	  var items = this.items,
+	      i = this.offset,
+	      j = 0;
+
+	  return new Iterator(function() {
+	    if (i >= items.length)
+	      return {
+	        done: true
+	      };
+
+	    var value = items[i];
+	    i++;
+
+	    return {
+	      value: [j++, value],
+	      done: false
+	    };
+	  });
+	};
+
+	/**
+	 * Attaching the #.values method to Symbol.iterator if possible.
+	 */
+	if (typeof Symbol !== 'undefined')
+	  Queue.prototype[Symbol.iterator] = Queue.prototype.values;
+
+	/**
+	 * Convenience known methods.
+	 */
+	Queue.prototype.toString = function() {
+	  return this.toArray().join(',');
+	};
+
+	Queue.prototype.toJSON = function() {
+	  return this.toArray();
+	};
+
+	Queue.prototype.inspect = function() {
+	  var array = this.toArray();
+
+	  // Trick so that node displays the name of the constructor
+	  Object.defineProperty(array, 'constructor', {
+	    value: Queue,
+	    enumerable: false
+	  });
+
+	  return array;
+	};
+
+	if (typeof Symbol !== 'undefined')
+	  Queue.prototype[Symbol.for('nodejs.util.inspect.custom')] = Queue.prototype.inspect;
+
+	/**
+	 * Static @.from function taking an arbitrary iterable & converting it into
+	 * a queue.
+	 *
+	 * @param  {Iterable} iterable   - Target iterable.
+	 * @return {Queue}
+	 */
+	Queue.from = function(iterable) {
+	  var queue = new Queue();
+
+	  forEach(iterable, function(value) {
+	    queue.enqueue(value);
+	  });
+
+	  return queue;
+	};
+
+	/**
+	 * Static @.of function taking an arbitrary number of arguments & converting it
+	 * into a queue.
+	 *
+	 * @param  {...any} args
+	 * @return {Queue}
+	 */
+	Queue.of = function() {
+	  return Queue.from(arguments);
+	};
+
+	/**
+	 * Exporting.
+	 */
+	queue$1 = Queue;
+	return queue$1;
+}
+
+var queueExports = requireQueue();
+const queue = /*@__PURE__*/getDefaultExportFromCjs(queueExports);
+
+var set = {};
+
+/**
+ * Mnemonist Set
+ * ==============
+ *
+ * Useful function related to sets such as union, intersection and so on...
+ */
+
+var hasRequiredSet;
+
+function requireSet () {
+	if (hasRequiredSet) return set;
+	hasRequiredSet = 1;
+	(function (exports) {
+		// TODO: optimize versions for less variadicities
+
+		/**
+		 * Variadic function computing the intersection of multiple sets.
+		 *
+		 * @param  {...Set} sets - Sets to intersect.
+		 * @return {Set}         - The intesection.
+		 */
+		exports.intersection = function() {
+		  if (arguments.length < 2)
+		    throw new Error('mnemonist/Set.intersection: needs at least two arguments.');
+
+		  var I = new Set();
+
+		  // First we need to find the smallest set
+		  var smallestSize = Infinity,
+		      smallestSet = null;
+
+		  var s, i, l = arguments.length;
+
+		  for (i = 0; i < l; i++) {
+		    s = arguments[i];
+
+		    // If one of the set has no items, we can stop right there
+		    if (s.size === 0)
+		      return I;
+
+		    if (s.size < smallestSize) {
+		      smallestSize = s.size;
+		      smallestSet = s;
+		    }
+		  }
+
+		  // Now we need to intersect this set with the others
+		  var iterator = smallestSet.values(),
+		      step,
+		      item,
+		      add,
+		      set;
+
+		  // TODO: we can optimize by iterating each next time over the current intersection
+		  // but this probably means more RAM to consume since we'll create n-1 sets rather than
+		  // only the one.
+		  while ((step = iterator.next(), !step.done)) {
+		    item = step.value;
+		    add = true;
+
+		    for (i = 0; i < l; i++) {
+		      set = arguments[i];
+
+		      if (set === smallestSet)
+		        continue;
+
+		      if (!set.has(item)) {
+		        add = false;
+		        break;
+		      }
+		    }
+
+		    if (add)
+		      I.add(item);
+		  }
+
+		  return I;
+		};
+
+		/**
+		 * Variadic function computing the union of multiple sets.
+		 *
+		 * @param  {...Set} sets - Sets to unite.
+		 * @return {Set}         - The union.
+		 */
+		exports.union = function() {
+		  if (arguments.length < 2)
+		    throw new Error('mnemonist/Set.union: needs at least two arguments.');
+
+		  var U = new Set();
+
+		  var i, l = arguments.length;
+
+		  var iterator,
+		      step;
+
+		  for (i = 0; i < l; i++) {
+		    iterator = arguments[i].values();
+
+		    while ((step = iterator.next(), !step.done))
+		      U.add(step.value);
+		  }
+
+		  return U;
+		};
+
+		/**
+		 * Function computing the difference between two sets.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {Set}   - The difference.
+		 */
+		exports.difference = function(A, B) {
+
+		  // If first set is empty
+		  if (!A.size)
+		    return new Set();
+
+		  if (!B.size)
+		    return new Set(A);
+
+		  var D = new Set();
+
+		  var iterator = A.values(),
+		      step;
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (!B.has(step.value))
+		      D.add(step.value);
+		  }
+
+		  return D;
+		};
+
+		/**
+		 * Function computing the symmetric difference between two sets.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {Set}   - The symmetric difference.
+		 */
+		exports.symmetricDifference = function(A, B) {
+		  var S = new Set();
+
+		  var iterator = A.values(),
+		      step;
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (!B.has(step.value))
+		      S.add(step.value);
+		  }
+
+		  iterator = B.values();
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (!A.has(step.value))
+		      S.add(step.value);
+		  }
+
+		  return S;
+		};
+
+		/**
+		 * Function returning whether A is a subset of B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {boolean}
+		 */
+		exports.isSubset = function(A, B) {
+		  var iterator = A.values(),
+		      step;
+
+		  // Shortcuts
+		  if (A === B)
+		    return true;
+
+		  if (A.size > B.size)
+		    return false;
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (!B.has(step.value))
+		      return false;
+		  }
+
+		  return true;
+		};
+
+		/**
+		 * Function returning whether A is a superset of B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {boolean}
+		 */
+		exports.isSuperset = function(A, B) {
+		  return exports.isSubset(B, A);
+		};
+
+		/**
+		 * Function adding the items of set B to the set A.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 */
+		exports.add = function(A, B) {
+		  var iterator = B.values(),
+		      step;
+
+		  while ((step = iterator.next(), !step.done))
+		    A.add(step.value);
+
+		  return;
+		};
+
+		/**
+		 * Function subtracting the items of set B from the set A.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 */
+		exports.subtract = function(A, B) {
+		  var iterator = B.values(),
+		      step;
+
+		  while ((step = iterator.next(), !step.done))
+		    A.delete(step.value);
+
+		  return;
+		};
+
+		/**
+		 * Function intersecting the items of A & B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 */
+		exports.intersect = function(A, B) {
+		  var iterator = A.values(),
+		      step;
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (!B.has(step.value))
+		      A.delete(step.value);
+		  }
+
+		  return;
+		};
+
+		/**
+		 * Function disjuncting the items of A & B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 */
+		exports.disjunct = function(A, B) {
+		  var iterator = A.values(),
+		      step;
+
+		  var toRemove = [];
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (B.has(step.value))
+		      toRemove.push(step.value);
+		  }
+
+		  iterator = B.values();
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (!A.has(step.value))
+		      A.add(step.value);
+		  }
+
+		  for (var i = 0, l = toRemove.length; i < l; i++)
+		    A.delete(toRemove[i]);
+
+		  return;
+		};
+
+		/**
+		 * Function returning the size of the intersection of A & B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {number}
+		 */
+		exports.intersectionSize = function(A, B) {
+		  var tmp;
+
+		  // We need to know the smallest set
+		  if (A.size > B.size) {
+		    tmp = A;
+		    A = B;
+		    B = tmp;
+		  }
+
+		  if (A.size === 0)
+		    return 0;
+
+		  if (A === B)
+		    return A.size;
+
+		  var iterator = A.values(),
+		      step;
+
+		  var I = 0;
+
+		  while ((step = iterator.next(), !step.done)) {
+		    if (B.has(step.value))
+		      I++;
+		  }
+
+		  return I;
+		};
+
+		/**
+		 * Function returning the size of the union of A & B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {number}
+		 */
+		exports.unionSize = function(A, B) {
+		  var I = exports.intersectionSize(A, B);
+
+		  return A.size + B.size - I;
+		};
+
+		/**
+		 * Function returning the Jaccard similarity between A & B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {number}
+		 */
+		exports.jaccard = function(A, B) {
+		  var I = exports.intersectionSize(A, B);
+
+		  if (I === 0)
+		    return 0;
+
+		  var U = A.size + B.size - I;
+
+		  return I / U;
+		};
+
+		/**
+		 * Function returning the overlap coefficient between A & B.
+		 *
+		 * @param  {Set} A - First set.
+		 * @param  {Set} B - Second set.
+		 * @return {number}
+		 */
+		exports.overlap = function(A, B) {
+		  var I = exports.intersectionSize(A, B);
+
+		  if (I === 0)
+		    return 0;
+
+		  return I / Math.min(A.size, B.size);
+		}; 
+	} (set));
+	return set;
+}
+
+var setExports = requireSet();
+
+/**
+ * Mnemonist Stack
+ * ================
+ *
+ * Stack implementation relying on JavaScript arrays, which are fast enough &
+ * correctly optimized for this kind of work.
+ */
+
+var stack;
+var hasRequiredStack;
+
+function requireStack () {
+	if (hasRequiredStack) return stack;
+	hasRequiredStack = 1;
+	var Iterator = requireIterator(),
+	    forEach = requireForeach();
+
+	/**
+	 * Stack
+	 *
+	 * @constructor
+	 */
+	function Stack() {
+	  this.clear();
+	}
+
+	/**
+	 * Method used to clear the stack.
+	 *
+	 * @return {undefined}
+	 */
+	Stack.prototype.clear = function() {
+
+	  // Properties
+	  this.items = [];
+	  this.size = 0;
+	};
+
+	/**
+	 * Method used to add an item to the stack.
+	 *
+	 * @param  {any}    item - Item to add.
+	 * @return {number}
+	 */
+	Stack.prototype.push = function(item) {
+	  this.items.push(item);
+	  return ++this.size;
+	};
+
+	/**
+	 * Method used to retrieve & remove the last item of the stack.
+	 *
+	 * @return {any}
+	 */
+	Stack.prototype.pop = function() {
+	  if (this.size === 0)
+	    return;
+
+	  this.size--;
+	  return this.items.pop();
+	};
+
+	/**
+	 * Method used to get the last item of the stack.
+	 *
+	 * @return {any}
+	 */
+	Stack.prototype.peek = function() {
+	  return this.items[this.size - 1];
+	};
+
+	/**
+	 * Method used to iterate over the stack.
+	 *
+	 * @param  {function}  callback - Function to call for each item.
+	 * @param  {object}    scope    - Optional scope.
+	 * @return {undefined}
+	 */
+	Stack.prototype.forEach = function(callback, scope) {
+	  scope = arguments.length > 1 ? scope : this;
+
+	  for (var i = 0, l = this.items.length; i < l; i++)
+	    callback.call(scope, this.items[l - i - 1], i, this);
+	};
+
+	/**
+	 * Method used to convert the stack to a JavaScript array.
+	 *
+	 * @return {array}
+	 */
+	Stack.prototype.toArray = function() {
+	  var array = new Array(this.size),
+	      l = this.size - 1,
+	      i = this.size;
+
+	  while (i--)
+	    array[i] = this.items[l - i];
+
+	  return array;
+	};
+
+	/**
+	 * Method used to create an iterator over a stack's values.
+	 *
+	 * @return {Iterator}
+	 */
+	Stack.prototype.values = function() {
+	  var items = this.items,
+	      l = items.length,
+	      i = 0;
+
+	  return new Iterator(function() {
+	    if (i >= l)
+	      return {
+	        done: true
+	      };
+
+	    var value = items[l - i - 1];
+	    i++;
+
+	    return {
+	      value: value,
+	      done: false
+	    };
+	  });
+	};
+
+	/**
+	 * Method used to create an iterator over a stack's entries.
+	 *
+	 * @return {Iterator}
+	 */
+	Stack.prototype.entries = function() {
+	  var items = this.items,
+	      l = items.length,
+	      i = 0;
+
+	  return new Iterator(function() {
+	    if (i >= l)
+	      return {
+	        done: true
+	      };
+
+	    var value = items[l - i - 1];
+
+	    return {
+	      value: [i++, value],
+	      done: false
+	    };
+	  });
+	};
+
+	/**
+	 * Attaching the #.values method to Symbol.iterator if possible.
+	 */
+	if (typeof Symbol !== 'undefined')
+	  Stack.prototype[Symbol.iterator] = Stack.prototype.values;
+
+
+	/**
+	 * Convenience known methods.
+	 */
+	Stack.prototype.toString = function() {
+	  return this.toArray().join(',');
+	};
+
+	Stack.prototype.toJSON = function() {
+	  return this.toArray();
+	};
+
+	Stack.prototype.inspect = function() {
+	  var array = this.toArray();
+
+	  // Trick so that node displays the name of the constructor
+	  Object.defineProperty(array, 'constructor', {
+	    value: Stack,
+	    enumerable: false
+	  });
+
+	  return array;
+	};
+
+	if (typeof Symbol !== 'undefined')
+	  Stack.prototype[Symbol.for('nodejs.util.inspect.custom')] = Stack.prototype.inspect;
+
+	/**
+	 * Static @.from function taking an arbitrary iterable & converting it into
+	 * a stack.
+	 *
+	 * @param  {Iterable} iterable   - Target iterable.
+	 * @return {Stack}
+	 */
+	Stack.from = function(iterable) {
+	  var stack = new Stack();
+
+	  forEach(iterable, function(value) {
+	    stack.push(value);
+	  });
+
+	  return stack;
+	};
+
+	/**
+	 * Static @.of function taking an arbitrary number of arguments & converting it
+	 * into a stack.
+	 *
+	 * @param  {...any} args
+	 * @return {Stack}
+	 */
+	Stack.of = function() {
+	  return Stack.from(arguments);
+	};
+
+	/**
+	 * Exporting.
+	 */
+	stack = Stack;
+	return stack;
+}
+
+var stackExports = requireStack();
+const Stack = /*@__PURE__*/getDefaultExportFromCjs(stackExports);
+
+function commonHead(sources, targets, equals) {
+  if (sources.length === 0 || targets.length === 0) {
+    return [];
+  }
+  equals ??= Object.is;
+  return C(
+    d(sources, targets),
+    u(([source, target]) => equals(source, target)),
+    m(([source, _]) => source)
+  );
+}
+
+var naturalCompareLite = {exports: {}};
+
+var hasRequiredNaturalCompareLite;
+
+function requireNaturalCompareLite () {
+	if (hasRequiredNaturalCompareLite) return naturalCompareLite.exports;
+	hasRequiredNaturalCompareLite = 1;
+	/*
+	 * @version    1.4.0
+	 * @date       2015-10-26
+	 * @stability  3 - Stable
+	 * @author     Lauri Rooden (https://github.com/litejs/natural-compare-lite)
+	 * @license    MIT License
+	 */
+
+
+	var naturalCompare = function(a, b) {
+		var i, codeA
+		, codeB = 1
+		, posA = 0
+		, posB = 0
+		, alphabet = String.alphabet;
+
+		function getCode(str, pos, code) {
+			if (code) {
+				for (i = pos; code = getCode(str, i), code < 76 && code > 65;) ++i;
+				return +str.slice(pos - 1, i)
+			}
+			code = alphabet && alphabet.indexOf(str.charAt(pos));
+			return code > -1 ? code + 76 : ((code = str.charCodeAt(pos) || 0), code < 45 || code > 127) ? code
+				: code < 46 ? 65               // -
+				: code < 48 ? code - 1
+				: code < 58 ? code + 18        // 0-9
+				: code < 65 ? code - 11
+				: code < 91 ? code + 11        // A-Z
+				: code < 97 ? code - 37
+				: code < 123 ? code + 5        // a-z
+				: code - 63
+		}
+
+
+		if ((a+="") != (b+="")) for (;codeB;) {
+			codeA = getCode(a, posA++);
+			codeB = getCode(b, posB++);
+
+			if (codeA < 76 && codeB < 76 && codeA > 66 && codeB > 66) {
+				codeA = getCode(a, posA, posA);
+				codeB = getCode(b, posB, posA = i);
+				posB = i;
+			}
+
+			if (codeA != codeB) return (codeA < codeB) ? -1 : 1
+		}
+		return 0
+	};
+
+	try {
+		naturalCompareLite.exports = naturalCompare;
+	} catch (e) {
+		String.naturalCompare = naturalCompare;
+	}
+	return naturalCompareLite.exports;
+}
+
+var naturalCompareLiteExports = requireNaturalCompareLite();
+const compare = /*@__PURE__*/getDefaultExportFromCjs(naturalCompareLiteExports);
+
+function compareNatural(a, b) {
+  if (a === b) return 0;
+  if (t$1(a)) {
+    if (t$1(b)) {
+      return compare(a, b);
+    }
+    return 1;
+  }
+  return t$1(b) ? -1 : 0;
+}
+
+function isString(value) {
+  return value != null && typeof value === "string";
+}
+function isNonEmptyArray(arr) {
+  return !!arr && Array.isArray(arr) && arr.length > 0;
+}
+
+function parentFqn(fqn) {
+  const lastDot = fqn.lastIndexOf(".");
+  if (lastDot > 0) {
+    return fqn.slice(0, lastDot);
+  }
+  return null;
+}
+function nameFromFqn(fqn) {
+  const lastDot = fqn.lastIndexOf(".");
+  if (lastDot > 0) {
+    return fqn.slice(lastDot + 1);
+  } else {
+    return fqn;
+  }
+}
+const asString = (e) => isString(e) ? e : e.id;
+function isAncestor(arg1, arg2) {
+  const arg1Id = asString(arg1);
+  if (arg2) {
+    const arg2Id = asString(arg2);
+    return arg2Id.startsWith(arg1Id + ".");
+  }
+  return (ancestor) => {
+    const ancestorId = asString(ancestor);
+    return arg1Id.startsWith(ancestorId + ".");
+  };
+}
+function isSameHierarchy(one, another) {
+  if (!another) {
+    return (b) => isSameHierarchy(one, b);
+  }
+  const first = asString(one);
+  const second = asString(another);
+  return first === second || second.startsWith(first + ".") || first.startsWith(second + ".");
+}
+function isDescendantOf(descedant, ancestor) {
+  if (!ancestor) {
+    return (d) => isAncestor(descedant, d);
+  }
+  return isAncestor(ancestor, descedant);
+}
+function hierarchyLevel(elementOfFqn) {
+  const first = isString(elementOfFqn) ? elementOfFqn : elementOfFqn.id;
+  return first.split(".").length;
+}
+function hierarchyDistance(one, another) {
+  const first = isString(one) ? one : one.id;
+  const second = isString(another) ? another : another.id;
+  if (first === second) {
+    return 0;
+  }
+  const firstDepth = hierarchyLevel(first);
+  const secondDepth = hierarchyLevel(second);
+  if (isSameHierarchy(first, second)) {
+    return Math.abs(firstDepth - secondDepth);
+  }
+  const ancestor = commonAncestor(first, second);
+  const ancestorDepth = ancestor ? hierarchyLevel(ancestor) : 0;
+  return firstDepth + secondDepth - (2 * ancestorDepth + 1);
+}
+function commonAncestor(first, second) {
+  const a = first.split(".");
+  if (a.length < 2) {
+    return null;
+  }
+  const b = second.split(".");
+  if (b.length < 2) {
+    return null;
+  }
+  let ancestor = [];
+  for (let i = 0; i < Math.min(a.length, b.length) - 1 && a[i] === b[i]; i++) {
+    ancestor.push(a[i]);
+  }
+  if (ancestor.length === 0) {
+    return null;
+  }
+  return ancestor.join(".");
+}
+function ancestorsFqn(fqn) {
+  const path = fqn.split(".");
+  path.pop();
+  if (path.length === 0) {
+    return [];
+  }
+  return path.reduce((acc, part, idx) => {
+    if (idx === 0) {
+      acc.push(part);
+      return acc;
+    }
+    acc.unshift(`${acc[0]}.${part}`);
+    return acc;
+  }, []);
+}
+function compareFqnHierarchically(a, b) {
+  const depthA = a.split(".").length;
+  const depthB = b.split(".").length;
+  switch (true) {
+    case depthA > depthB: {
+      return 1;
+    }
+    case depthA < depthB: {
+      return -1;
+    }
+    default: {
+      return 0;
+    }
+  }
+}
+function compareByFqnHierarchically(a, b) {
+  return compareFqnHierarchically(a.id, b.id);
+}
+function sortByFqnHierarchically(array) {
+  return array.map((item) => ({ item, fqn: item.id.split(".") })).sort((a, b) => {
+    return a.fqn.length - b.fqn.length;
+  }).map(({ item }) => item);
+}
+function findTopAncestor(items, item) {
+  let parent = item;
+  for (const e of items) {
+    if (isAncestor(e, parent)) {
+      parent = e;
+    }
+  }
+  return parent !== item ? parent : null;
+}
+function sortParentsFirst(array) {
+  const result = [];
+  const items = [...array];
+  let item;
+  while (item = items.shift()) {
+    let parent;
+    while (parent = findTopAncestor(items, item)) {
+      result.push(items.splice(items.indexOf(parent), 1)[0]);
+    }
+    result.push(item);
+  }
+  return result;
+}
+function sortNaturalByFqn(array, sort) {
+  if (!array || isString(array)) {
+    const dir2 = array ?? "asc";
+    return (arr) => sortNaturalByFqn(arr, dir2);
+  }
+  const dir = sort === "desc" ? -1 : 1;
+  return array.map((item) => ({ item, fqn: item.id.split(".") })).sort((a, b) => {
+    if (a.fqn.length !== b.fqn.length) {
+      return (a.fqn.length - b.fqn.length) * dir;
+    }
+    for (let i = 0; i < a.fqn.length; i++) {
+      const compare = compareNatural(a.fqn[i], b.fqn[i]);
+      if (compare !== 0) {
+        return compare;
+      }
+    }
+    return 0;
+  }).map(({ item }) => item);
+}
+
+function getOrCreate(map, key, create) {
+  let entry = map.get(key);
+  if (!entry) {
+    entry = create(key);
+    map.set(key, entry);
+  }
+  return entry;
+}
+
+function isIterable(something) {
+  return l(something) && typeof something === "object" && Symbol.iterator in something;
+}
+
+function ifilter(arg1, arg2) {
+  const pred = arg2 ?? arg1;
+  invariant(t(pred));
+  function* _filter(iter) {
+    for (const value of iter) {
+      if (pred(value)) {
+        yield value;
+      }
+    }
+    return;
+  }
+  if (!arg2) {
+    return _filter;
+  }
+  return _filter(arg1);
+}
+
+function ifind(arg1, arg2) {
+  const pred = arg2 ?? arg1;
+  invariant(t(pred));
+  function _find(iter) {
+    for (const value of iter) {
+      if (pred(value)) {
+        return value;
+      }
+    }
+    return;
+  }
+  if (!arg2) {
+    return _find;
+  }
+  return _find(arg1);
+}
+
+function iflat(iterable) {
+  return iterable ? _iflat(iterable) : _iflat;
+}
+function* _iflat(iterable) {
+  for (const inner of iterable) {
+    yield* inner;
+  }
+  return;
+}
+
+function imap(arg1, arg2) {
+  const mapper = arg2 ?? arg1;
+  invariant(t(mapper));
+  function* _map(iter) {
+    for (const value of iter) {
+      yield mapper(value);
+    }
+    return;
+  }
+  if (!arg2) {
+    return _map;
+  }
+  return _map(arg1);
+}
+
+function isome(arg1, arg2) {
+  const pred = arg2 ?? arg1;
+  invariant(t(pred));
+  function _some(iter) {
+    for (const value of iter) {
+      if (pred(value)) {
+        return true;
+      }
+    }
+    return false;
+  }
+  if (!arg2) {
+    return _some;
+  }
+  return _some(arg1);
+}
+
+function toArray(iterable) {
+  if (iterable) {
+    return Array.from(iterable);
+  }
+  return (it) => Array.from(it);
+}
+function toSet(iterable) {
+  if (iterable) {
+    return new Set(iterable);
+  }
+  return (it) => new Set(it);
+}
+
+function iunique(iterable) {
+  return iterable ? _iunique(iterable) : _iunique;
+}
+function* _iunique(iterable) {
+  const seen = /* @__PURE__ */ new Set();
+  for (const item of iterable) {
+    if (!seen.has(item)) {
+      seen.add(item);
+      yield item;
+    }
+  }
+  return;
+}
+
+function union(...sets) {
+  let result = /* @__PURE__ */ new Set();
+  for (const set of sets) {
+    for (const value of set) {
+      result.add(value);
+    }
+  }
+  return result;
+}
+function intersection(first, ...sets) {
+  let result = /* @__PURE__ */ new Set();
+  if (first.size === 0) {
+    return result;
+  }
+  let other = i$1(sets, 2) ? setExports.intersection(...sets) : sets[0];
+  if (other.size === 0) {
+    return result;
+  }
+  for (const value of first) {
+    if (other.has(value)) {
+      result.add(value);
+    }
+  }
+  return result;
+}
+function difference(a, b) {
+  if (a.size === 0) {
+    return /* @__PURE__ */ new Set();
+  }
+  if (b.size === 0) {
+    return new Set(a);
+  }
+  let result = /* @__PURE__ */ new Set();
+  for (const value of a) {
+    if (!b.has(value)) {
+      result.add(value);
+    }
+  }
+  return result;
+}
+function equals(a, b) {
+  return a.size === b.size && [...a].every((value) => b.has(value));
+}
+function symmetricDifference(a, b) {
+  return setExports.symmetricDifference(a, b);
+}
+function hasIntersection(a, b) {
+  if (a.size === 0 || b.size === 0) {
+    return false;
+  }
+  if (b.size < a.size) {
+    [a, b] = [b, a];
+  }
+  for (const value of a) {
+    if (b.has(value)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+function stringHash(str) {
+  let hash = 5381;
+  const len = str.length;
+  invariant(len > 0, "stringHash: empty string");
+  for (let i = 0; i < len; i++) {
+    hash = hash * 33 ^ str.charCodeAt(i);
+  }
+  return (hash >>> 0).toString(36);
+}
+
+function commonjsRequire(path) {
+	throw new Error('Could not dynamically require "' + path + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+}
+
+var object_hash = {exports: {}};
+
+var hasRequiredObject_hash;
+
+function requireObject_hash () {
+	if (hasRequiredObject_hash) return object_hash.exports;
+	hasRequiredObject_hash = 1;
+	(function (module, exports) {
+		!function(e){module.exports=e();}(function(){return function r(o,i,u){function s(n,e){if(!i[n]){if(!o[n]){var t="function"==typeof commonjsRequire&&commonjsRequire;if(!e&&t)return t(n,true);if(a)return a(n,true);throw new Error("Cannot find module '"+n+"'")}e=i[n]={exports:{}};o[n][0].call(e.exports,function(e){var t=o[n][1][e];return s(t||e)},e,e.exports,r,o,i,u);}return i[n].exports}for(var a="function"==typeof commonjsRequire&&commonjsRequire,e=0;e<u.length;e++)s(u[e]);return s}({1:[function(w,b,m){!function(e,n,s,c,d,h,p,g,y){var r=w("crypto");function t(e,t){t=u(e,t);var n;return void 0===(n="passthrough"!==t.algorithm?r.createHash(t.algorithm):new l).write&&(n.write=n.update,n.end=n.update),f(t,n).dispatch(e),n.update||n.end(""),n.digest?n.digest("buffer"===t.encoding?void 0:t.encoding):(e=n.read(),"buffer"!==t.encoding?e.toString(t.encoding):e)}(m=b.exports=t).sha1=function(e){return t(e)},m.keys=function(e){return t(e,{excludeValues:true,algorithm:"sha1",encoding:"hex"})},m.MD5=function(e){return t(e,{algorithm:"md5",encoding:"hex"})},m.keysMD5=function(e){return t(e,{algorithm:"md5",encoding:"hex",excludeValues:true})};var o=r.getHashes?r.getHashes().slice():["sha1","md5"],i=(o.push("passthrough"),["buffer","hex","binary","base64"]);function u(e,t){var n={};if(n.algorithm=(t=t||{}).algorithm||"sha1",n.encoding=t.encoding||"hex",n.excludeValues=!!t.excludeValues,n.algorithm=n.algorithm.toLowerCase(),n.encoding=n.encoding.toLowerCase(),n.ignoreUnknown=true===t.ignoreUnknown,n.respectType=false!==t.respectType,n.respectFunctionNames=false!==t.respectFunctionNames,n.respectFunctionProperties=false!==t.respectFunctionProperties,n.unorderedArrays=true===t.unorderedArrays,n.unorderedSets=false!==t.unorderedSets,n.unorderedObjects=false!==t.unorderedObjects,n.replacer=t.replacer||void 0,n.excludeKeys=t.excludeKeys||void 0,void 0===e)throw new Error("Object argument required.");for(var r=0;r<o.length;++r)o[r].toLowerCase()===n.algorithm.toLowerCase()&&(n.algorithm=o[r]);if(-1===o.indexOf(n.algorithm))throw new Error('Algorithm "'+n.algorithm+'"  not supported. supported values: '+o.join(", "));if(-1===i.indexOf(n.encoding)&&"passthrough"!==n.algorithm)throw new Error('Encoding "'+n.encoding+'"  not supported. supported values: '+i.join(", "));return n}function a(e){if("function"==typeof e)return null!=/^function\s+\w*\s*\(\s*\)\s*{\s+\[native code\]\s+}$/i.exec(Function.prototype.toString.call(e))}function f(o,t,i){i=i||[];function u(e){return t.update?t.update(e,"utf8"):t.write(e,"utf8")}return {dispatch:function(e){return this["_"+(null===(e=o.replacer?o.replacer(e):e)?"null":typeof e)](e)},_object:function(t){var n,e=Object.prototype.toString.call(t),r=/\[object (.*)\]/i.exec(e);r=(r=r?r[1]:"unknown:["+e+"]").toLowerCase();if(0<=(e=i.indexOf(t)))return this.dispatch("[CIRCULAR:"+e+"]");if(i.push(t),void 0!==s&&s.isBuffer&&s.isBuffer(t))return u("buffer:"),u(t);if("object"===r||"function"===r||"asyncfunction"===r)return e=Object.keys(t),o.unorderedObjects&&(e=e.sort()),false===o.respectType||a(t)||e.splice(0,0,"prototype","__proto__","constructor"),o.excludeKeys&&(e=e.filter(function(e){return !o.excludeKeys(e)})),u("object:"+e.length+":"),n=this,e.forEach(function(e){n.dispatch(e),u(":"),o.excludeValues||n.dispatch(t[e]),u(",");});if(!this["_"+r]){if(o.ignoreUnknown)return u("["+r+"]");throw new Error('Unknown object type "'+r+'"')}this["_"+r](t);},_array:function(e,t){t=void 0!==t?t:false!==o.unorderedArrays;var n=this;if(u("array:"+e.length+":"),!t||e.length<=1)return e.forEach(function(e){return n.dispatch(e)});var r=[],t=e.map(function(e){var t=new l,n=i.slice();return f(o,t,n).dispatch(e),r=r.concat(n.slice(i.length)),t.read().toString()});return i=i.concat(r),t.sort(),this._array(t,false)},_date:function(e){return u("date:"+e.toJSON())},_symbol:function(e){return u("symbol:"+e.toString())},_error:function(e){return u("error:"+e.toString())},_boolean:function(e){return u("bool:"+e.toString())},_string:function(e){u("string:"+e.length+":"),u(e.toString());},_function:function(e){u("fn:"),a(e)?this.dispatch("[native]"):this.dispatch(e.toString()),false!==o.respectFunctionNames&&this.dispatch("function-name:"+String(e.name)),o.respectFunctionProperties&&this._object(e);},_number:function(e){return u("number:"+e.toString())},_xml:function(e){return u("xml:"+e.toString())},_null:function(){return u("Null")},_undefined:function(){return u("Undefined")},_regexp:function(e){return u("regex:"+e.toString())},_uint8array:function(e){return u("uint8array:"),this.dispatch(Array.prototype.slice.call(e))},_uint8clampedarray:function(e){return u("uint8clampedarray:"),this.dispatch(Array.prototype.slice.call(e))},_int8array:function(e){return u("int8array:"),this.dispatch(Array.prototype.slice.call(e))},_uint16array:function(e){return u("uint16array:"),this.dispatch(Array.prototype.slice.call(e))},_int16array:function(e){return u("int16array:"),this.dispatch(Array.prototype.slice.call(e))},_uint32array:function(e){return u("uint32array:"),this.dispatch(Array.prototype.slice.call(e))},_int32array:function(e){return u("int32array:"),this.dispatch(Array.prototype.slice.call(e))},_float32array:function(e){return u("float32array:"),this.dispatch(Array.prototype.slice.call(e))},_float64array:function(e){return u("float64array:"),this.dispatch(Array.prototype.slice.call(e))},_arraybuffer:function(e){return u("arraybuffer:"),this.dispatch(new Uint8Array(e))},_url:function(e){return u("url:"+e.toString())},_map:function(e){u("map:");e=Array.from(e);return this._array(e,false!==o.unorderedSets)},_set:function(e){u("set:");e=Array.from(e);return this._array(e,false!==o.unorderedSets)},_file:function(e){return u("file:"),this.dispatch([e.name,e.size,e.type,e.lastModfied])},_blob:function(){if(o.ignoreUnknown)return u("[blob]");throw Error('Hashing Blob objects is currently not supported\n(see https://github.com/puleos/object-hash/issues/26)\nUse "options.replacer" or "options.ignoreUnknown"\n')},_domwindow:function(){return u("domwindow")},_bigint:function(e){return u("bigint:"+e.toString())},_process:function(){return u("process")},_timer:function(){return u("timer")},_pipe:function(){return u("pipe")},_tcp:function(){return u("tcp")},_udp:function(){return u("udp")},_tty:function(){return u("tty")},_statwatcher:function(){return u("statwatcher")},_securecontext:function(){return u("securecontext")},_connection:function(){return u("connection")},_zlib:function(){return u("zlib")},_context:function(){return u("context")},_nodescript:function(){return u("nodescript")},_httpparser:function(){return u("httpparser")},_dataview:function(){return u("dataview")},_signal:function(){return u("signal")},_fsevent:function(){return u("fsevent")},_tlswrap:function(){return u("tlswrap")}}}function l(){return {buf:"",write:function(e){this.buf+=e;},end:function(e){this.buf+=e;},read:function(){return this.buf}}}m.writeToStream=function(e,t,n){return void 0===n&&(n=t,t={}),f(t=u(e,t),n).dispatch(e)};}.call(this,w("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},w("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/fake_9a5aa49d.js","/");},{buffer:3,crypto:5,lYpoI2:11}],2:[function(e,t,f){!function(e,t,n,r,o,i,u,s,a){!function(e){var a="undefined"!=typeof Uint8Array?Uint8Array:Array,t="+".charCodeAt(0),n="/".charCodeAt(0),r="0".charCodeAt(0),o="a".charCodeAt(0),i="A".charCodeAt(0),u="-".charCodeAt(0),s="_".charCodeAt(0);function f(e){e=e.charCodeAt(0);return e===t||e===u?62:e===n||e===s?63:e<r?-1:e<r+10?e-r+26+26:e<i+26?e-i:e<o+26?e-o+26:void 0}e.toByteArray=function(e){var t,n;if(0<e.length%4)throw new Error("Invalid string. Length must be a multiple of 4");var r=e.length,r="="===e.charAt(r-2)?2:"="===e.charAt(r-1)?1:0,o=new a(3*e.length/4-r),i=0<r?e.length-4:e.length,u=0;function s(e){o[u++]=e;}for(t=0;t<i;t+=4,0)s((16711680&(n=f(e.charAt(t))<<18|f(e.charAt(t+1))<<12|f(e.charAt(t+2))<<6|f(e.charAt(t+3))))>>16),s((65280&n)>>8),s(255&n);return 2==r?s(255&(n=f(e.charAt(t))<<2|f(e.charAt(t+1))>>4)):1==r&&(s((n=f(e.charAt(t))<<10|f(e.charAt(t+1))<<4|f(e.charAt(t+2))>>2)>>8&255),s(255&n)),o},e.fromByteArray=function(e){var t,n,r,o,i=e.length%3,u="";function s(e){return "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(e)}for(t=0,r=e.length-i;t<r;t+=3)n=(e[t]<<16)+(e[t+1]<<8)+e[t+2],u+=s((o=n)>>18&63)+s(o>>12&63)+s(o>>6&63)+s(63&o);switch(i){case 1:u=(u+=s((n=e[e.length-1])>>2))+s(n<<4&63)+"==";break;case 2:u=(u=(u+=s((n=(e[e.length-2]<<8)+e[e.length-1])>>10))+s(n>>4&63))+s(n<<2&63)+"=";}return u};}(void 0===f?this.base64js={}:f);}.call(this,e("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},e("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/base64-js/lib/b64.js","/node_modules/gulp-browserify/node_modules/base64-js/lib");},{buffer:3,lYpoI2:11}],3:[function(O,e,H){!function(e,n,f,r,h,p,g,y,w){var a=O("base64-js"),i=O("ieee754");function f(e,t,n){if(!(this instanceof f))return new f(e,t,n);var r,o,i,u,s=typeof e;if("base64"===t&&"string"==s)for(e=(u=e).trim?u.trim():u.replace(/^\s+|\s+$/g,"");e.length%4!=0;)e+="=";if("number"==s)r=j(e);else if("string"==s)r=f.byteLength(e,t);else {if("object"!=s)throw new Error("First argument needs to be a number, array or string.");r=j(e.length);}if(f._useTypedArrays?o=f._augment(new Uint8Array(r)):((o=this).length=r,o._isBuffer=true),f._useTypedArrays&&"number"==typeof e.byteLength)o._set(e);else if(C(u=e)||f.isBuffer(u)||u&&"object"==typeof u&&"number"==typeof u.length)for(i=0;i<r;i++)f.isBuffer(e)?o[i]=e.readUInt8(i):o[i]=e[i];else if("string"==s)o.write(e,0,t);else if("number"==s&&!f._useTypedArrays&&!n)for(i=0;i<r;i++)o[i]=0;return o}function b(e,t,n,r){return f._charsWritten=c(function(e){for(var t=[],n=0;n<e.length;n++)t.push(255&e.charCodeAt(n));return t}(t),e,n,r)}function m(e,t,n,r){return f._charsWritten=c(function(e){for(var t,n,r=[],o=0;o<e.length;o++)n=e.charCodeAt(o),t=n>>8,n=n%256,r.push(n),r.push(t);return r}(t),e,n,r)}function v(e,t,n){var r="";n=Math.min(e.length,n);for(var o=t;o<n;o++)r+=String.fromCharCode(e[o]);return r}function o(e,t,n,r){r||(d("boolean"==typeof n,"missing or invalid endian"),d(null!=t,"missing offset"),d(t+1<e.length,"Trying to read beyond buffer length"));var o,r=e.length;if(!(r<=t))return n?(o=e[t],t+1<r&&(o|=e[t+1]<<8)):(o=e[t]<<8,t+1<r&&(o|=e[t+1])),o}function u(e,t,n,r){r||(d("boolean"==typeof n,"missing or invalid endian"),d(null!=t,"missing offset"),d(t+3<e.length,"Trying to read beyond buffer length"));var o,r=e.length;if(!(r<=t))return n?(t+2<r&&(o=e[t+2]<<16),t+1<r&&(o|=e[t+1]<<8),o|=e[t],t+3<r&&(o+=e[t+3]<<24>>>0)):(t+1<r&&(o=e[t+1]<<16),t+2<r&&(o|=e[t+2]<<8),t+3<r&&(o|=e[t+3]),o+=e[t]<<24>>>0),o}function _(e,t,n,r){if(r||(d("boolean"==typeof n,"missing or invalid endian"),d(null!=t,"missing offset"),d(t+1<e.length,"Trying to read beyond buffer length")),!(e.length<=t))return r=o(e,t,n,true),32768&r?-1*(65535-r+1):r}function E(e,t,n,r){if(r||(d("boolean"==typeof n,"missing or invalid endian"),d(null!=t,"missing offset"),d(t+3<e.length,"Trying to read beyond buffer length")),!(e.length<=t))return r=u(e,t,n,true),2147483648&r?-1*(4294967295-r+1):r}function I(e,t,n,r){return r||(d("boolean"==typeof n,"missing or invalid endian"),d(t+3<e.length,"Trying to read beyond buffer length")),i.read(e,t,n,23,4)}function A(e,t,n,r){return r||(d("boolean"==typeof n,"missing or invalid endian"),d(t+7<e.length,"Trying to read beyond buffer length")),i.read(e,t,n,52,8)}function s(e,t,n,r,o){o||(d(null!=t,"missing value"),d("boolean"==typeof r,"missing or invalid endian"),d(null!=n,"missing offset"),d(n+1<e.length,"trying to write beyond buffer length"),Y(t,65535));o=e.length;if(!(o<=n))for(var i=0,u=Math.min(o-n,2);i<u;i++)e[n+i]=(t&255<<8*(r?i:1-i))>>>8*(r?i:1-i);}function l(e,t,n,r,o){o||(d(null!=t,"missing value"),d("boolean"==typeof r,"missing or invalid endian"),d(null!=n,"missing offset"),d(n+3<e.length,"trying to write beyond buffer length"),Y(t,4294967295));o=e.length;if(!(o<=n))for(var i=0,u=Math.min(o-n,4);i<u;i++)e[n+i]=t>>>8*(r?i:3-i)&255;}function B(e,t,n,r,o){o||(d(null!=t,"missing value"),d("boolean"==typeof r,"missing or invalid endian"),d(null!=n,"missing offset"),d(n+1<e.length,"Trying to write beyond buffer length"),F(t,32767,-32768)),e.length<=n||s(e,0<=t?t:65535+t+1,n,r,o);}function L(e,t,n,r,o){o||(d(null!=t,"missing value"),d("boolean"==typeof r,"missing or invalid endian"),d(null!=n,"missing offset"),d(n+3<e.length,"Trying to write beyond buffer length"),F(t,2147483647,-2147483648)),e.length<=n||l(e,0<=t?t:4294967295+t+1,n,r,o);}function U(e,t,n,r,o){o||(d(null!=t,"missing value"),d("boolean"==typeof r,"missing or invalid endian"),d(null!=n,"missing offset"),d(n+3<e.length,"Trying to write beyond buffer length"),D(t,34028234663852886e22,-34028234663852886e22)),e.length<=n||i.write(e,t,n,r,23,4);}function x(e,t,n,r,o){o||(d(null!=t,"missing value"),d("boolean"==typeof r,"missing or invalid endian"),d(null!=n,"missing offset"),d(n+7<e.length,"Trying to write beyond buffer length"),D(t,17976931348623157e292,-17976931348623157e292)),e.length<=n||i.write(e,t,n,r,52,8);}H.Buffer=f,H.SlowBuffer=f,H.INSPECT_MAX_BYTES=50,f.poolSize=8192,f._useTypedArrays=function(){try{var e=new ArrayBuffer(0),t=new Uint8Array(e);return t.foo=function(){return 42},42===t.foo()&&"function"==typeof t.subarray}catch(e){return  false}}(),f.isEncoding=function(e){switch(String(e).toLowerCase()){case "hex":case "utf8":case "utf-8":case "ascii":case "binary":case "base64":case "raw":case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":return  true;default:return  false}},f.isBuffer=function(e){return !(null==e||!e._isBuffer)},f.byteLength=function(e,t){var n;switch(e+="",t||"utf8"){case "hex":n=e.length/2;break;case "utf8":case "utf-8":n=T(e).length;break;case "ascii":case "binary":case "raw":n=e.length;break;case "base64":n=M(e).length;break;case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":n=2*e.length;break;default:throw new Error("Unknown encoding")}return n},f.concat=function(e,t){if(d(C(e),"Usage: Buffer.concat(list, [totalLength])\nlist should be an Array."),0===e.length)return new f(0);if(1===e.length)return e[0];if("number"!=typeof t)for(o=t=0;o<e.length;o++)t+=e[o].length;for(var n=new f(t),r=0,o=0;o<e.length;o++){var i=e[o];i.copy(n,r),r+=i.length;}return n},f.prototype.write=function(e,t,n,r){isFinite(t)?isFinite(n)||(r=n,n=void 0):(a=r,r=t,t=n,n=a),t=Number(t)||0;var o,i,u,s,a=this.length-t;switch((!n||a<(n=Number(n)))&&(n=a),r=String(r||"utf8").toLowerCase()){case "hex":o=function(e,t,n,r){n=Number(n)||0;var o=e.length-n;(!r||o<(r=Number(r)))&&(r=o),d((o=t.length)%2==0,"Invalid hex string"),o/2<r&&(r=o/2);for(var i=0;i<r;i++){var u=parseInt(t.substr(2*i,2),16);d(!isNaN(u),"Invalid hex string"),e[n+i]=u;}return f._charsWritten=2*i,i}(this,e,t,n);break;case "utf8":case "utf-8":i=this,u=t,s=n,o=f._charsWritten=c(T(e),i,u,s);break;case "ascii":case "binary":o=b(this,e,t,n);break;case "base64":i=this,u=t,s=n,o=f._charsWritten=c(M(e),i,u,s);break;case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":o=m(this,e,t,n);break;default:throw new Error("Unknown encoding")}return o},f.prototype.toString=function(e,t,n){var r,o,i,u,s=this;if(e=String(e||"utf8").toLowerCase(),t=Number(t)||0,(n=void 0!==n?Number(n):s.length)===t)return "";switch(e){case "hex":r=function(e,t,n){var r=e.length;(!t||t<0)&&(t=0);(!n||n<0||r<n)&&(n=r);for(var o="",i=t;i<n;i++)o+=k(e[i]);return o}(s,t,n);break;case "utf8":case "utf-8":r=function(e,t,n){var r="",o="";n=Math.min(e.length,n);for(var i=t;i<n;i++)e[i]<=127?(r+=N(o)+String.fromCharCode(e[i]),o=""):o+="%"+e[i].toString(16);return r+N(o)}(s,t,n);break;case "ascii":case "binary":r=v(s,t,n);break;case "base64":o=s,u=n,r=0===(i=t)&&u===o.length?a.fromByteArray(o):a.fromByteArray(o.slice(i,u));break;case "ucs2":case "ucs-2":case "utf16le":case "utf-16le":r=function(e,t,n){for(var r=e.slice(t,n),o="",i=0;i<r.length;i+=2)o+=String.fromCharCode(r[i]+256*r[i+1]);return o}(s,t,n);break;default:throw new Error("Unknown encoding")}return r},f.prototype.toJSON=function(){return {type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}},f.prototype.copy=function(e,t,n,r){if(t=t||0,(r=r||0===r?r:this.length)!==(n=n||0)&&0!==e.length&&0!==this.length){d(n<=r,"sourceEnd < sourceStart"),d(0<=t&&t<e.length,"targetStart out of bounds"),d(0<=n&&n<this.length,"sourceStart out of bounds"),d(0<=r&&r<=this.length,"sourceEnd out of bounds"),r>this.length&&(r=this.length);var o=(r=e.length-t<r-n?e.length-t+n:r)-n;if(o<100||!f._useTypedArrays)for(var i=0;i<o;i++)e[i+t]=this[i+n];else e._set(this.subarray(n,n+o),t);}},f.prototype.slice=function(e,t){var n=this.length;if(e=S(e,n,0),t=S(t,n,n),f._useTypedArrays)return f._augment(this.subarray(e,t));for(var r=t-e,o=new f(r,void 0,true),i=0;i<r;i++)o[i]=this[i+e];return o},f.prototype.get=function(e){return console.log(".get() is deprecated. Access using array indexes instead."),this.readUInt8(e)},f.prototype.set=function(e,t){return console.log(".set() is deprecated. Access using array indexes instead."),this.writeUInt8(e,t)},f.prototype.readUInt8=function(e,t){if(t||(d(null!=e,"missing offset"),d(e<this.length,"Trying to read beyond buffer length")),!(e>=this.length))return this[e]},f.prototype.readUInt16LE=function(e,t){return o(this,e,true,t)},f.prototype.readUInt16BE=function(e,t){return o(this,e,false,t)},f.prototype.readUInt32LE=function(e,t){return u(this,e,true,t)},f.prototype.readUInt32BE=function(e,t){return u(this,e,false,t)},f.prototype.readInt8=function(e,t){if(t||(d(null!=e,"missing offset"),d(e<this.length,"Trying to read beyond buffer length")),!(e>=this.length))return 128&this[e]?-1*(255-this[e]+1):this[e]},f.prototype.readInt16LE=function(e,t){return _(this,e,true,t)},f.prototype.readInt16BE=function(e,t){return _(this,e,false,t)},f.prototype.readInt32LE=function(e,t){return E(this,e,true,t)},f.prototype.readInt32BE=function(e,t){return E(this,e,false,t)},f.prototype.readFloatLE=function(e,t){return I(this,e,true,t)},f.prototype.readFloatBE=function(e,t){return I(this,e,false,t)},f.prototype.readDoubleLE=function(e,t){return A(this,e,true,t)},f.prototype.readDoubleBE=function(e,t){return A(this,e,false,t)},f.prototype.writeUInt8=function(e,t,n){n||(d(null!=e,"missing value"),d(null!=t,"missing offset"),d(t<this.length,"trying to write beyond buffer length"),Y(e,255)),t>=this.length||(this[t]=e);},f.prototype.writeUInt16LE=function(e,t,n){s(this,e,t,true,n);},f.prototype.writeUInt16BE=function(e,t,n){s(this,e,t,false,n);},f.prototype.writeUInt32LE=function(e,t,n){l(this,e,t,true,n);},f.prototype.writeUInt32BE=function(e,t,n){l(this,e,t,false,n);},f.prototype.writeInt8=function(e,t,n){n||(d(null!=e,"missing value"),d(null!=t,"missing offset"),d(t<this.length,"Trying to write beyond buffer length"),F(e,127,-128)),t>=this.length||(0<=e?this.writeUInt8(e,t,n):this.writeUInt8(255+e+1,t,n));},f.prototype.writeInt16LE=function(e,t,n){B(this,e,t,true,n);},f.prototype.writeInt16BE=function(e,t,n){B(this,e,t,false,n);},f.prototype.writeInt32LE=function(e,t,n){L(this,e,t,true,n);},f.prototype.writeInt32BE=function(e,t,n){L(this,e,t,false,n);},f.prototype.writeFloatLE=function(e,t,n){U(this,e,t,true,n);},f.prototype.writeFloatBE=function(e,t,n){U(this,e,t,false,n);},f.prototype.writeDoubleLE=function(e,t,n){x(this,e,t,true,n);},f.prototype.writeDoubleBE=function(e,t,n){x(this,e,t,false,n);},f.prototype.fill=function(e,t,n){if(t=t||0,n=n||this.length,d("number"==typeof(e="string"==typeof(e=e||0)?e.charCodeAt(0):e)&&!isNaN(e),"value is not a number"),d(t<=n,"end < start"),n!==t&&0!==this.length){d(0<=t&&t<this.length,"start out of bounds"),d(0<=n&&n<=this.length,"end out of bounds");for(var r=t;r<n;r++)this[r]=e;}},f.prototype.inspect=function(){for(var e=[],t=this.length,n=0;n<t;n++)if(e[n]=k(this[n]),n===H.INSPECT_MAX_BYTES){e[n+1]="...";break}return "<Buffer "+e.join(" ")+">"},f.prototype.toArrayBuffer=function(){if("undefined"==typeof Uint8Array)throw new Error("Buffer.toArrayBuffer not supported in this browser");if(f._useTypedArrays)return new f(this).buffer;for(var e=new Uint8Array(this.length),t=0,n=e.length;t<n;t+=1)e[t]=this[t];return e.buffer};var t=f.prototype;function S(e,t,n){return "number"!=typeof e?n:t<=(e=~~e)?t:0<=e||0<=(e+=t)?e:0}function j(e){return (e=~~Math.ceil(+e))<0?0:e}function C(e){return (Array.isArray||function(e){return "[object Array]"===Object.prototype.toString.call(e)})(e)}function k(e){return e<16?"0"+e.toString(16):e.toString(16)}function T(e){for(var t=[],n=0;n<e.length;n++){var r=e.charCodeAt(n);if(r<=127)t.push(e.charCodeAt(n));else for(var o=n,i=(55296<=r&&r<=57343&&n++,encodeURIComponent(e.slice(o,n+1)).substr(1).split("%")),u=0;u<i.length;u++)t.push(parseInt(i[u],16));}return t}function M(e){return a.toByteArray(e)}function c(e,t,n,r){for(var o=0;o<r&&!(o+n>=t.length||o>=e.length);o++)t[o+n]=e[o];return o}function N(e){try{return decodeURIComponent(e)}catch(e){return String.fromCharCode(65533)}}function Y(e,t){d("number"==typeof e,"cannot write a non-number as a number"),d(0<=e,"specified a negative value for writing an unsigned value"),d(e<=t,"value is larger than maximum value for type"),d(Math.floor(e)===e,"value has a fractional component");}function F(e,t,n){d("number"==typeof e,"cannot write a non-number as a number"),d(e<=t,"value larger than maximum allowed value"),d(n<=e,"value smaller than minimum allowed value"),d(Math.floor(e)===e,"value has a fractional component");}function D(e,t,n){d("number"==typeof e,"cannot write a non-number as a number"),d(e<=t,"value larger than maximum allowed value"),d(n<=e,"value smaller than minimum allowed value");}function d(e,t){if(!e)throw new Error(t||"Failed assertion")}f._augment=function(e){return e._isBuffer=true,e._get=e.get,e._set=e.set,e.get=t.get,e.set=t.set,e.write=t.write,e.toString=t.toString,e.toLocaleString=t.toString,e.toJSON=t.toJSON,e.copy=t.copy,e.slice=t.slice,e.readUInt8=t.readUInt8,e.readUInt16LE=t.readUInt16LE,e.readUInt16BE=t.readUInt16BE,e.readUInt32LE=t.readUInt32LE,e.readUInt32BE=t.readUInt32BE,e.readInt8=t.readInt8,e.readInt16LE=t.readInt16LE,e.readInt16BE=t.readInt16BE,e.readInt32LE=t.readInt32LE,e.readInt32BE=t.readInt32BE,e.readFloatLE=t.readFloatLE,e.readFloatBE=t.readFloatBE,e.readDoubleLE=t.readDoubleLE,e.readDoubleBE=t.readDoubleBE,e.writeUInt8=t.writeUInt8,e.writeUInt16LE=t.writeUInt16LE,e.writeUInt16BE=t.writeUInt16BE,e.writeUInt32LE=t.writeUInt32LE,e.writeUInt32BE=t.writeUInt32BE,e.writeInt8=t.writeInt8,e.writeInt16LE=t.writeInt16LE,e.writeInt16BE=t.writeInt16BE,e.writeInt32LE=t.writeInt32LE,e.writeInt32BE=t.writeInt32BE,e.writeFloatLE=t.writeFloatLE,e.writeFloatBE=t.writeFloatBE,e.writeDoubleLE=t.writeDoubleLE,e.writeDoubleBE=t.writeDoubleBE,e.fill=t.fill,e.inspect=t.inspect,e.toArrayBuffer=t.toArrayBuffer,e};}.call(this,O("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},O("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/buffer/index.js","/node_modules/gulp-browserify/node_modules/buffer");},{"base64-js":2,buffer:3,ieee754:10,lYpoI2:11}],4:[function(c,d,e){!function(e,t,a,n,r,o,i,u,s){var a=c("buffer").Buffer,f=4,l=new a(f);l.fill(0);d.exports={hash:function(e,t,n,r){for(var o=t(function(e,t){e.length%f!=0&&(n=e.length+(f-e.length%f),e=a.concat([e,l],n));for(var n,r=[],o=t?e.readInt32BE:e.readInt32LE,i=0;i<e.length;i+=f)r.push(o.call(e,i));return r}(e=a.isBuffer(e)?e:new a(e),r),8*e.length),t=r,i=new a(n),u=t?i.writeInt32BE:i.writeInt32LE,s=0;s<o.length;s++)u.call(i,o[s],4*s,true);return i}};}.call(this,c("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},c("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/crypto-browserify/helpers.js","/node_modules/gulp-browserify/node_modules/crypto-browserify");},{buffer:3,lYpoI2:11}],5:[function(v,e,_){!function(l,c,u,d,h,p,g,y,w){var u=v("buffer").Buffer,e=v("./sha"),t=v("./sha256"),n=v("./rng"),b={sha1:e,sha256:t,md5:v("./md5")},s=64,a=new u(s);function r(e,n){var r=b[e=e||"sha1"],o=[];return r||i("algorithm:",e,"is not yet supported"),{update:function(e){return u.isBuffer(e)||(e=new u(e)),o.push(e),e.length,this},digest:function(e){var t=u.concat(o),t=n?function(e,t,n){u.isBuffer(t)||(t=new u(t)),u.isBuffer(n)||(n=new u(n)),t.length>s?t=e(t):t.length<s&&(t=u.concat([t,a],s));for(var r=new u(s),o=new u(s),i=0;i<s;i++)r[i]=54^t[i],o[i]=92^t[i];return n=e(u.concat([r,n])),e(u.concat([o,n]))}(r,n,t):r(t);return o=null,e?t.toString(e):t}}}function i(){var e=[].slice.call(arguments).join(" ");throw new Error([e,"we accept pull requests","http://github.com/dominictarr/crypto-browserify"].join("\n"))}a.fill(0),_.createHash=function(e){return r(e)},_.createHmac=r,_.randomBytes=function(e,t){if(!t||!t.call)return new u(n(e));try{t.call(this,void 0,new u(n(e)));}catch(e){t(e);}};var o,f=["createCredentials","createCipher","createCipheriv","createDecipher","createDecipheriv","createSign","createVerify","createDiffieHellman","pbkdf2"],m=function(e){_[e]=function(){i("sorry,",e,"is not implemented yet");};};for(o in f)m(f[o]);}.call(this,v("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},v("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/crypto-browserify/index.js","/node_modules/gulp-browserify/node_modules/crypto-browserify");},{"./md5":6,"./rng":7,"./sha":8,"./sha256":9,buffer:3,lYpoI2:11}],6:[function(w,b,e){!function(e,r,o,i,u,a,f,l,y){var t=w("./helpers");function n(e,t){e[t>>5]|=128<<t%32,e[14+(t+64>>>9<<4)]=t;for(var n=1732584193,r=-271733879,o=-1732584194,i=271733878,u=0;u<e.length;u+=16){var s=n,a=r,f=o,l=i,n=c(n,r,o,i,e[u+0],7,-680876936),i=c(i,n,r,o,e[u+1],12,-389564586),o=c(o,i,n,r,e[u+2],17,606105819),r=c(r,o,i,n,e[u+3],22,-1044525330);n=c(n,r,o,i,e[u+4],7,-176418897),i=c(i,n,r,o,e[u+5],12,1200080426),o=c(o,i,n,r,e[u+6],17,-1473231341),r=c(r,o,i,n,e[u+7],22,-45705983),n=c(n,r,o,i,e[u+8],7,1770035416),i=c(i,n,r,o,e[u+9],12,-1958414417),o=c(o,i,n,r,e[u+10],17,-42063),r=c(r,o,i,n,e[u+11],22,-1990404162),n=c(n,r,o,i,e[u+12],7,1804603682),i=c(i,n,r,o,e[u+13],12,-40341101),o=c(o,i,n,r,e[u+14],17,-1502002290),n=d(n,r=c(r,o,i,n,e[u+15],22,1236535329),o,i,e[u+1],5,-165796510),i=d(i,n,r,o,e[u+6],9,-1069501632),o=d(o,i,n,r,e[u+11],14,643717713),r=d(r,o,i,n,e[u+0],20,-373897302),n=d(n,r,o,i,e[u+5],5,-701558691),i=d(i,n,r,o,e[u+10],9,38016083),o=d(o,i,n,r,e[u+15],14,-660478335),r=d(r,o,i,n,e[u+4],20,-405537848),n=d(n,r,o,i,e[u+9],5,568446438),i=d(i,n,r,o,e[u+14],9,-1019803690),o=d(o,i,n,r,e[u+3],14,-187363961),r=d(r,o,i,n,e[u+8],20,1163531501),n=d(n,r,o,i,e[u+13],5,-1444681467),i=d(i,n,r,o,e[u+2],9,-51403784),o=d(o,i,n,r,e[u+7],14,1735328473),n=h(n,r=d(r,o,i,n,e[u+12],20,-1926607734),o,i,e[u+5],4,-378558),i=h(i,n,r,o,e[u+8],11,-2022574463),o=h(o,i,n,r,e[u+11],16,1839030562),r=h(r,o,i,n,e[u+14],23,-35309556),n=h(n,r,o,i,e[u+1],4,-1530992060),i=h(i,n,r,o,e[u+4],11,1272893353),o=h(o,i,n,r,e[u+7],16,-155497632),r=h(r,o,i,n,e[u+10],23,-1094730640),n=h(n,r,o,i,e[u+13],4,681279174),i=h(i,n,r,o,e[u+0],11,-358537222),o=h(o,i,n,r,e[u+3],16,-722521979),r=h(r,o,i,n,e[u+6],23,76029189),n=h(n,r,o,i,e[u+9],4,-640364487),i=h(i,n,r,o,e[u+12],11,-421815835),o=h(o,i,n,r,e[u+15],16,530742520),n=p(n,r=h(r,o,i,n,e[u+2],23,-995338651),o,i,e[u+0],6,-198630844),i=p(i,n,r,o,e[u+7],10,1126891415),o=p(o,i,n,r,e[u+14],15,-1416354905),r=p(r,o,i,n,e[u+5],21,-57434055),n=p(n,r,o,i,e[u+12],6,1700485571),i=p(i,n,r,o,e[u+3],10,-1894986606),o=p(o,i,n,r,e[u+10],15,-1051523),r=p(r,o,i,n,e[u+1],21,-2054922799),n=p(n,r,o,i,e[u+8],6,1873313359),i=p(i,n,r,o,e[u+15],10,-30611744),o=p(o,i,n,r,e[u+6],15,-1560198380),r=p(r,o,i,n,e[u+13],21,1309151649),n=p(n,r,o,i,e[u+4],6,-145523070),i=p(i,n,r,o,e[u+11],10,-1120210379),o=p(o,i,n,r,e[u+2],15,718787259),r=p(r,o,i,n,e[u+9],21,-343485551),n=g(n,s),r=g(r,a),o=g(o,f),i=g(i,l);}return Array(n,r,o,i)}function s(e,t,n,r,o,i){return g((t=g(g(t,e),g(r,i)))<<o|t>>>32-o,n)}function c(e,t,n,r,o,i,u){return s(t&n|~t&r,e,t,o,i,u)}function d(e,t,n,r,o,i,u){return s(t&r|n&~r,e,t,o,i,u)}function h(e,t,n,r,o,i,u){return s(t^n^r,e,t,o,i,u)}function p(e,t,n,r,o,i,u){return s(n^(t|~r),e,t,o,i,u)}function g(e,t){var n=(65535&e)+(65535&t);return (e>>16)+(t>>16)+(n>>16)<<16|65535&n}b.exports=function(e){return t.hash(e,n,16)};}.call(this,w("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},w("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/crypto-browserify/md5.js","/node_modules/gulp-browserify/node_modules/crypto-browserify");},{"./helpers":4,buffer:3,lYpoI2:11}],7:[function(e,l,t){!function(e,t,n,r,o,i,u,s,f){l.exports=function(e){for(var t,n=new Array(e),r=0;r<e;r++)0==(3&r)&&(t=4294967296*Math.random()),n[r]=t>>>((3&r)<<3)&255;return n};}.call(this,e("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},e("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/crypto-browserify/rng.js","/node_modules/gulp-browserify/node_modules/crypto-browserify");},{buffer:3,lYpoI2:11}],8:[function(c,d,e){!function(e,t,n,r,o,s,a,f,l){var i=c("./helpers");function u(l,c){l[c>>5]|=128<<24-c%32,l[15+(c+64>>9<<4)]=c;for(var e,t,n,r=Array(80),o=1732584193,i=-271733879,u=-1732584194,s=271733878,d=-1009589776,h=0;h<l.length;h+=16){for(var p=o,g=i,y=u,w=s,b=d,a=0;a<80;a++){r[a]=a<16?l[h+a]:v(r[a-3]^r[a-8]^r[a-14]^r[a-16],1);var f=m(m(v(o,5),(f=i,t=u,n=s,(e=a)<20?f&t|~f&n:!(e<40)&&e<60?f&t|f&n|t&n:f^t^n)),m(m(d,r[a]),(e=a)<20?1518500249:e<40?1859775393:e<60?-1894007588:-899497514)),d=s,s=u,u=v(i,30),i=o,o=f;}o=m(o,p),i=m(i,g),u=m(u,y),s=m(s,w),d=m(d,b);}return Array(o,i,u,s,d)}function m(e,t){var n=(65535&e)+(65535&t);return (e>>16)+(t>>16)+(n>>16)<<16|65535&n}function v(e,t){return e<<t|e>>>32-t}d.exports=function(e){return i.hash(e,u,20,true)};}.call(this,c("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},c("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/crypto-browserify/sha.js","/node_modules/gulp-browserify/node_modules/crypto-browserify");},{"./helpers":4,buffer:3,lYpoI2:11}],9:[function(c,d,e){!function(e,t,n,r,u,s,a,f,l){function b(e,t){var n=(65535&e)+(65535&t);return (e>>16)+(t>>16)+(n>>16)<<16|65535&n}function o(e,l){var c,d=new Array(1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298),t=new Array(1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225),n=new Array(64);e[l>>5]|=128<<24-l%32,e[15+(l+64>>9<<4)]=l;for(var r,o,h=0;h<e.length;h+=16){for(var i=t[0],u=t[1],s=t[2],p=t[3],a=t[4],g=t[5],y=t[6],w=t[7],f=0;f<64;f++)n[f]=f<16?e[f+h]:b(b(b((o=n[f-2],m(o,17)^m(o,19)^v(o,10)),n[f-7]),(o=n[f-15],m(o,7)^m(o,18)^v(o,3))),n[f-16]),c=b(b(b(b(w,m(o=a,6)^m(o,11)^m(o,25)),a&g^~a&y),d[f]),n[f]),r=b(m(r=i,2)^m(r,13)^m(r,22),i&u^i&s^u&s),w=y,y=g,g=a,a=b(p,c),p=s,s=u,u=i,i=b(c,r);t[0]=b(i,t[0]),t[1]=b(u,t[1]),t[2]=b(s,t[2]),t[3]=b(p,t[3]),t[4]=b(a,t[4]),t[5]=b(g,t[5]),t[6]=b(y,t[6]),t[7]=b(w,t[7]);}return t}var i=c("./helpers"),m=function(e,t){return e>>>t|e<<32-t},v=function(e,t){return e>>>t};d.exports=function(e){return i.hash(e,o,32,true)};}.call(this,c("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},c("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/crypto-browserify/sha256.js","/node_modules/gulp-browserify/node_modules/crypto-browserify");},{"./helpers":4,buffer:3,lYpoI2:11}],10:[function(e,t,f){!function(e,t,n,r,o,i,u,s,a){f.read=function(e,t,n,r,o){var i,u,l=8*o-r-1,c=(1<<l)-1,d=c>>1,s=-7,a=n?o-1:0,f=n?-1:1,o=e[t+a];for(a+=f,i=o&(1<<-s)-1,o>>=-s,s+=l;0<s;i=256*i+e[t+a],a+=f,s-=8);for(u=i&(1<<-s)-1,i>>=-s,s+=r;0<s;u=256*u+e[t+a],a+=f,s-=8);if(0===i)i=1-d;else {if(i===c)return u?NaN:1/0*(o?-1:1);u+=Math.pow(2,r),i-=d;}return (o?-1:1)*u*Math.pow(2,i-r)},f.write=function(e,t,l,n,r,c){var o,i,u=8*c-r-1,s=(1<<u)-1,a=s>>1,d=23===r?Math.pow(2,-24)-Math.pow(2,-77):0,f=n?0:c-1,h=n?1:-1,c=t<0||0===t&&1/t<0?1:0;for(t=Math.abs(t),isNaN(t)||t===1/0?(i=isNaN(t)?1:0,o=s):(o=Math.floor(Math.log(t)/Math.LN2),t*(n=Math.pow(2,-o))<1&&(o--,n*=2),2<=(t+=1<=o+a?d/n:d*Math.pow(2,1-a))*n&&(o++,n/=2),s<=o+a?(i=0,o=s):1<=o+a?(i=(t*n-1)*Math.pow(2,r),o+=a):(i=t*Math.pow(2,a-1)*Math.pow(2,r),o=0));8<=r;e[l+f]=255&i,f+=h,i/=256,r-=8);for(o=o<<r|i,u+=r;0<u;e[l+f]=255&o,f+=h,o/=256,u-=8);e[l+f-h]|=128*c;};}.call(this,e("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},e("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/ieee754/index.js","/node_modules/gulp-browserify/node_modules/ieee754");},{buffer:3,lYpoI2:11}],11:[function(e,h,t){!function(e,t,n,r,o,f,l,c,d){var i,u,s;function a(){}(e=h.exports={}).nextTick=(u="undefined"!=typeof window&&window.setImmediate,s="undefined"!=typeof window&&window.postMessage&&window.addEventListener,u?function(e){return window.setImmediate(e)}:s?(i=[],window.addEventListener("message",function(e){var t=e.source;t!==window&&null!==t||"process-tick"!==e.data||(e.stopPropagation(),0<i.length&&i.shift()());},true),function(e){i.push(e),window.postMessage("process-tick","*");}):function(e){setTimeout(e,0);}),e.title="browser",e.browser=true,e.env={},e.argv=[],e.on=a,e.addListener=a,e.once=a,e.off=a,e.removeListener=a,e.removeAllListeners=a,e.emit=a,e.binding=function(e){throw new Error("process.binding is not supported")},e.cwd=function(){return "/"},e.chdir=function(e){throw new Error("process.chdir is not supported")};}.call(this,e("lYpoI2"),"undefined"!=typeof self?self:"undefined"!=typeof window?window:{},e("buffer").Buffer,arguments[3],arguments[4],arguments[5],arguments[6],"/node_modules/gulp-browserify/node_modules/process/browser.js","/node_modules/gulp-browserify/node_modules/process");},{buffer:3,lYpoI2:11}]},{},[1])(1)}); 
+	} (object_hash));
+	return object_hash.exports;
+}
+
+var object_hashExports = requireObject_hash();
+const objectHash = /*@__PURE__*/getDefaultExportFromCjs(object_hashExports);
+
+export { n as $, getOrCreate as A, isNonEmptyArray as B, isString as C, DefaultMap as D, ifilter as E, iflat as F, imap as G, isIterable as H, isome as I, iunique as J, toArray as K, difference as L, equals as M, intersection as N, symmetricDifference as O, union as P, stringHash as Q, objectHash as R, Stack as S, C as T, s as U, a as V, getDefaultExportFromCjs as W, requireForeach as X, requireIterator as Y, u as Z, d as _, i$1 as a, hasIntersection as a0, t$1 as b, isSameHierarchy as c, t as d, defaultWeakMap as e, linkedList as f, commonHead as g, compareNatural as h, ifind as i, ancestorsFqn as j, commonAncestor as k, l, m, nameFromFqn as n, compareByFqnHierarchically as o, parentFqn as p, queue as q, compareFqnHierarchically as r, hierarchyDistance as s, toSet as t, hierarchyLevel as u, isAncestor as v, isDescendantOf as w, sortByFqnHierarchically as x, sortNaturalByFqn as y, sortParentsFirst as z };