lib0 0.2.116 → 1.0.0-0

package/dist/array-78849c95.cjs

@@ -1,260 +0,0 @@
-'use strict';
-
-var set = require('./set-5b47859e.cjs');
-
-/**
- * Utility module to work with Arrays.
- *
- * @module array
- */
-
-/**
- * Return the last element of an array. The element must exist
- *
- * @template L
- * @param {ArrayLike<L>} arr
- * @return {L}
- */
-const last = arr => arr[arr.length - 1];
-
-/**
- * @template C
- * @return {Array<C>}
- */
-const create = () => /** @type {Array<C>} */ ([]);
-
-/**
- * @template D
- * @param {Array<D>} a
- * @return {Array<D>}
- */
-const copy = a => /** @type {Array<D>} */ (a.slice());
-
-/**
- * Append elements from src to dest
- *
- * @template M
- * @param {Array<M>} dest
- * @param {Array<M>} src
- */
-const appendTo = (dest, src) => {
-  for (let i = 0; i < src.length; i++) {
-    dest.push(src[i]);
-  }
-};
-
-/**
- * Transforms something array-like to an actual Array.
- *
- * @function
- * @template T
- * @param {ArrayLike<T>|Iterable<T>} arraylike
- * @return {T}
- */
-const from = Array.from;
-
-/**
- * True iff condition holds on every element in the Array.
- *
- * @function
- * @template {ArrayLike<any>} ARR
- *
- * @param {ARR} arr
- * @param {ARR extends ArrayLike<infer S> ? ((value:S, index:number, arr:ARR) => boolean) : any} f
- * @return {boolean}
- */
-const every = (arr, f) => {
-  for (let i = 0; i < arr.length; i++) {
-    if (!f(arr[i], i, arr)) {
-      return false
-    }
-  }
-  return true
-};
-
-/**
- * True iff condition holds on some element in the Array.
- *
- * @function
- * @template {ArrayLike<any>} ARR
- *
- * @param {ARR} arr
- * @param {ARR extends ArrayLike<infer S> ? ((value:S, index:number, arr:ARR) => boolean) : never} f
- * @return {boolean}
- */
-const some = (arr, f) => {
-  for (let i = 0; i < arr.length; i++) {
-    if (f(arr[i], i, arr)) {
-      return true
-    }
-  }
-  return false
-};
-
-/**
- * @template ELEM
- *
- * @param {ArrayLike<ELEM>} a
- * @param {ArrayLike<ELEM>} b
- * @return {boolean}
- */
-const equalFlat = (a, b) => a.length === b.length && every(a, (item, index) => item === b[index]);
-
-/**
- * @template ELEM
- * @param {Array<Array<ELEM>>} arr
- * @return {Array<ELEM>}
- */
-const flatten = arr => fold(arr, /** @type {Array<ELEM>} */ ([]), (acc, val) => acc.concat(val));
-
-/**
- * @template T
- * @param {number} len
- * @param {function(number, Array<T>):T} f
- * @return {Array<T>}
- */
-const unfold = (len, f) => {
-  const array = new Array(len);
-  for (let i = 0; i < len; i++) {
-    array[i] = f(i, array);
-  }
-  return array
-};
-
-/**
- * @template T
- * @template RESULT
- * @param {Array<T>} arr
- * @param {RESULT} seed
- * @param {function(RESULT, T, number):RESULT} folder
- */
-const fold = (arr, seed, folder) => arr.reduce(folder, seed);
-
-const isArray = Array.isArray;
-
-/**
- * @template T
- * @param {Array<T>} arr
- * @return {Array<T>}
- */
-const unique = arr => from(set.from(arr));
-
-/**
- * @template T
- * @template M
- * @param {ArrayLike<T>} arr
- * @param {function(T):M} mapper
- * @return {Array<T>}
- */
-const uniqueBy = (arr, mapper) => {
-  /**
-   * @type {Set<M>}
-   */
-  const happened = set.create();
-  /**
-   * @type {Array<T>}
-   */
-  const result = [];
-  for (let i = 0; i < arr.length; i++) {
-    const el = arr[i];
-    const mapped = mapper(el);
-    if (!happened.has(mapped)) {
-      happened.add(mapped);
-      result.push(el);
-    }
-  }
-  return result
-};
-
-/**
- * @template {ArrayLike<any>} ARR
- * @template {function(ARR extends ArrayLike<infer T> ? T : never, number, ARR):any} MAPPER
- * @param {ARR} arr
- * @param {MAPPER} mapper
- * @return {Array<MAPPER extends function(...any): infer M ? M : never>}
- */
-const map = (arr, mapper) => {
-  /**
-   * @type {Array<any>}
-   */
-  const res = Array(arr.length);
-  for (let i = 0; i < arr.length; i++) {
-    res[i] = mapper(/** @type {any} */ (arr[i]), i, /** @type {any} */ (arr));
-  }
-  return /** @type {any} */ (res)
-};
-
-/**
- * This function bubble-sorts a single item to the correct position. The sort happens in-place and
- * might be useful to ensure that a single item is at the correct position in an otherwise sorted
- * array.
- *
- * @example
- *  const arr = [3, 2, 5]
- *  arr.sort((a, b) => a - b)
- *  arr // => [2, 3, 5]
- *  arr.splice(1, 0, 7)
- *  array.bubbleSortItem(arr, 1, (a, b) => a - b)
- *  arr // => [2, 3, 5, 7]
- *
- * @template T
- * @param {Array<T>} arr
- * @param {number} i
- * @param {(a:T,b:T) => number} compareFn
- */
-const bubblesortItem = (arr, i, compareFn) => {
-  const n = arr[i];
-  let j = i;
-  // try to sort to the right
-  while (j + 1 < arr.length && compareFn(n, arr[j + 1]) > 0) {
-    arr[j] = arr[j + 1];
-    arr[++j] = n;
-  }
-  if (i === j && j > 0) { // no change yet
-    // sort to the left
-    while (j > 0 && compareFn(arr[j - 1], n) > 0) {
-      arr[j] = arr[j - 1];
-      arr[--j] = n;
-    }
-  }
-  return j
-};
-
-var array = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  last: last,
-  create: create,
-  copy: copy,
-  appendTo: appendTo,
-  from: from,
-  every: every,
-  some: some,
-  equalFlat: equalFlat,
-  flatten: flatten,
-  unfold: unfold,
-  fold: fold,
-  isArray: isArray,
-  unique: unique,
-  uniqueBy: uniqueBy,
-  map: map,
-  bubblesortItem: bubblesortItem
-});
-
-exports.appendTo = appendTo;
-exports.array = array;
-exports.bubblesortItem = bubblesortItem;
-exports.copy = copy;
-exports.create = create;
-exports.equalFlat = equalFlat;
-exports.every = every;
-exports.flatten = flatten;
-exports.fold = fold;
-exports.from = from;
-exports.isArray = isArray;
-exports.last = last;
-exports.map = map;
-exports.some = some;
-exports.unfold = unfold;
-exports.unique = unique;
-exports.uniqueBy = uniqueBy;
-//# sourceMappingURL=array-78849c95.cjs.map

package/dist/array-78849c95.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"array-78849c95.cjs","sources":["../array.js"],"sourcesContent":["/**\n * Utility module to work with Arrays.\n *\n * @module array\n */\n\nimport * as set from './set.js'\n\n/**\n * Return the last element of an array. The element must exist\n *\n * @template L\n * @param {ArrayLike<L>} arr\n * @return {L}\n */\nexport const last = arr => arr[arr.length - 1]\n\n/**\n * @template C\n * @return {Array<C>}\n */\nexport const create = () => /** @type {Array<C>} */ ([])\n\n/**\n * @template D\n * @param {Array<D>} a\n * @return {Array<D>}\n */\nexport const copy = a => /** @type {Array<D>} */ (a.slice())\n\n/**\n * Append elements from src to dest\n *\n * @template M\n * @param {Array<M>} dest\n * @param {Array<M>} src\n */\nexport const appendTo = (dest, src) => {\n  for (let i = 0; i < src.length; i++) {\n    dest.push(src[i])\n  }\n}\n\n/**\n * Transforms something array-like to an actual Array.\n *\n * @function\n * @template T\n * @param {ArrayLike<T>|Iterable<T>} arraylike\n * @return {T}\n */\nexport const from = Array.from\n\n/**\n * True iff condition holds on every element in the Array.\n *\n * @function\n * @template {ArrayLike<any>} ARR\n *\n * @param {ARR} arr\n * @param {ARR extends ArrayLike<infer S> ? ((value:S, index:number, arr:ARR) => boolean) : any} f\n * @return {boolean}\n */\nexport const every = (arr, f) => {\n  for (let i = 0; i < arr.length; i++) {\n    if (!f(arr[i], i, arr)) {\n      return false\n    }\n  }\n  return true\n}\n\n/**\n * True iff condition holds on some element in the Array.\n *\n * @function\n * @template {ArrayLike<any>} ARR\n *\n * @param {ARR} arr\n * @param {ARR extends ArrayLike<infer S> ? ((value:S, index:number, arr:ARR) => boolean) : never} f\n * @return {boolean}\n */\nexport const some = (arr, f) => {\n  for (let i = 0; i < arr.length; i++) {\n    if (f(arr[i], i, arr)) {\n      return true\n    }\n  }\n  return false\n}\n\n/**\n * @template ELEM\n *\n * @param {ArrayLike<ELEM>} a\n * @param {ArrayLike<ELEM>} b\n * @return {boolean}\n */\nexport const equalFlat = (a, b) => a.length === b.length && every(a, (item, index) => item === b[index])\n\n/**\n * @template ELEM\n * @param {Array<Array<ELEM>>} arr\n * @return {Array<ELEM>}\n */\nexport const flatten = arr => fold(arr, /** @type {Array<ELEM>} */ ([]), (acc, val) => acc.concat(val))\n\n/**\n * @template T\n * @param {number} len\n * @param {function(number, Array<T>):T} f\n * @return {Array<T>}\n */\nexport const unfold = (len, f) => {\n  const array = new Array(len)\n  for (let i = 0; i < len; i++) {\n    array[i] = f(i, array)\n  }\n  return array\n}\n\n/**\n * @template T\n * @template RESULT\n * @param {Array<T>} arr\n * @param {RESULT} seed\n * @param {function(RESULT, T, number):RESULT} folder\n */\nexport const fold = (arr, seed, folder) => arr.reduce(folder, seed)\n\nexport const isArray = Array.isArray\n\n/**\n * @template T\n * @param {Array<T>} arr\n * @return {Array<T>}\n */\nexport const unique = arr => from(set.from(arr))\n\n/**\n * @template T\n * @template M\n * @param {ArrayLike<T>} arr\n * @param {function(T):M} mapper\n * @return {Array<T>}\n */\nexport const uniqueBy = (arr, mapper) => {\n  /**\n   * @type {Set<M>}\n   */\n  const happened = set.create()\n  /**\n   * @type {Array<T>}\n   */\n  const result = []\n  for (let i = 0; i < arr.length; i++) {\n    const el = arr[i]\n    const mapped = mapper(el)\n    if (!happened.has(mapped)) {\n      happened.add(mapped)\n      result.push(el)\n    }\n  }\n  return result\n}\n\n/**\n * @template {ArrayLike<any>} ARR\n * @template {function(ARR extends ArrayLike<infer T> ? T : never, number, ARR):any} MAPPER\n * @param {ARR} arr\n * @param {MAPPER} mapper\n * @return {Array<MAPPER extends function(...any): infer M ? M : never>}\n */\nexport const map = (arr, mapper) => {\n  /**\n   * @type {Array<any>}\n   */\n  const res = Array(arr.length)\n  for (let i = 0; i < arr.length; i++) {\n    res[i] = mapper(/** @type {any} */ (arr[i]), i, /** @type {any} */ (arr))\n  }\n  return /** @type {any} */ (res)\n}\n\n/**\n * This function bubble-sorts a single item to the correct position. The sort happens in-place and\n * might be useful to ensure that a single item is at the correct position in an otherwise sorted\n * array.\n *\n * @example\n *  const arr = [3, 2, 5]\n *  arr.sort((a, b) => a - b)\n *  arr // => [2, 3, 5]\n *  arr.splice(1, 0, 7)\n *  array.bubbleSortItem(arr, 1, (a, b) => a - b)\n *  arr // => [2, 3, 5, 7]\n *\n * @template T\n * @param {Array<T>} arr\n * @param {number} i\n * @param {(a:T,b:T) => number} compareFn\n */\nexport const bubblesortItem = (arr, i, compareFn) => {\n  const n = arr[i]\n  let j = i\n  // try to sort to the right\n  while (j + 1 < arr.length && compareFn(n, arr[j + 1]) > 0) {\n    arr[j] = arr[j + 1]\n    arr[++j] = n\n  }\n  if (i === j && j > 0) { // no change yet\n    // sort to the left\n    while (j > 0 && compareFn(arr[j - 1], n) > 0) {\n      arr[j] = arr[j - 1]\n      arr[--j] = n\n    }\n  }\n  return j\n}\n"],"names":["set.from","set.create"],"mappings":";;;;AAAA;AACA;AACA;AACA;AACA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAC;AAC9C;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,+BAA+B,EAAE,EAAC;AACxD;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,CAAC,6BAA6B,CAAC,CAAC,KAAK,EAAE,EAAC;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,QAAQ,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK;AACvC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAC;AACrB,GAAG;AACH,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,KAAK,CAAC,KAAI;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK;AACjC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;AAC5B,MAAM,OAAO,KAAK;AAClB,KAAK;AACL,GAAG;AACH,EAAE,OAAO,IAAI;AACb,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK;AAChC,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;AAC3B,MAAM,OAAO,IAAI;AACjB,KAAK;AACL,GAAG;AACH,EAAE,OAAO,KAAK;AACd,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,KAAK,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,EAAC;AACxG;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,OAAO,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,8BAA8B,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAC;AACvG;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK;AAClC,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,EAAC;AAC9B,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAChC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAC;AAC1B,GAAG;AACH,EAAE,OAAO,KAAK;AACd,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,EAAC;AACnE;AACY,MAAC,OAAO,GAAG,KAAK,CAAC,QAAO;AACpC;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,GAAG,IAAI,IAAI,CAACA,QAAQ,CAAC,GAAG,CAAC,EAAC;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,QAAQ,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK;AACzC;AACA;AACA;AACA,EAAE,MAAM,QAAQ,GAAGC,UAAU,GAAE;AAC/B;AACA;AACA;AACA,EAAE,MAAM,MAAM,GAAG,GAAE;AACnB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,EAAC;AACrB,IAAI,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAC;AAC7B,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AAC/B,MAAM,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAC;AAC1B,MAAM,MAAM,CAAC,IAAI,CAAC,EAAE,EAAC;AACrB,KAAK;AACL,GAAG;AACH,EAAE,OAAO,MAAM;AACf,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,GAAG,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK;AACpC;AACA;AACA;AACA,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,EAAC;AAC/B,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,qBAAqB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,sBAAsB,GAAG,GAAE;AAC7E,GAAG;AACH,EAAE,2BAA2B,GAAG,CAAC;AACjC,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,cAAc,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,KAAK;AACrD,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAC;AAClB,EAAE,IAAI,CAAC,GAAG,EAAC;AACX;AACA,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;AAC7D,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAC;AACvB,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAC;AAChB,GAAG;AACH,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;AACxB;AACA,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE;AAClD,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAC;AACzB,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAC;AAClB,KAAK;AACL,GAAG;AACH,EAAE,OAAO,CAAC;AACV;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/array.cjs

@@ -1,26 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-require('./set-5b47859e.cjs');
-var array = require('./array-78849c95.cjs');
-
-
-
-exports.appendTo = array.appendTo;
-exports.bubblesortItem = array.bubblesortItem;
-exports.copy = array.copy;
-exports.create = array.create;
-exports.equalFlat = array.equalFlat;
-exports.every = array.every;
-exports.flatten = array.flatten;
-exports.fold = array.fold;
-exports.from = array.from;
-exports.isArray = array.isArray;
-exports.last = array.last;
-exports.map = array.map;
-exports.some = array.some;
-exports.unfold = array.unfold;
-exports.unique = array.unique;
-exports.uniqueBy = array.uniqueBy;
-//# sourceMappingURL=array.cjs.map

package/dist/array.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"array.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/array.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../array.js"],"names":[],"mappings":"AAeO,qBAJM,CAAC,OACH,SAAS,CAAC,CAAC,CAAC,GACX,CAAC,CAEiC;AAMvC,uBAHM,CAAC,KACF,KAAK,CAAC,CAAC,CAAC,CAEoC;AAOjD,qBAJM,CAAC,KACH,KAAK,CAAC,CAAC,CAAC,GACP,KAAK,CAAC,CAAC,CAAC,CAEwC;AASrD,yBAJM,CAAC,QACH,KAAK,CAAC,CAAC,CAAC,OACR,KAAK,CAAC,CAAC,CAAC,QAMlB;AAED;;;;;;;GAOG;AACH;;;;;EAA8B;AAYvB,sBANuB,GAAG,SAAnB,SAAS,CAAC,GAAG,CAAE,OAElB,GAAG,KACH,GAAG,SAAS,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAC,CAAC,EAAE,KAAK,EAAC,MAAM,EAAE,GAAG,EAAC,GAAG,KAAK,OAAO,CAAC,GAAG,GAAG,GACnF,OAAO,CASlB;AAYM,qBANuB,GAAG,SAAnB,SAAS,CAAC,GAAG,CAAE,OAElB,GAAG,KACH,GAAG,SAAS,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAC,CAAC,EAAE,KAAK,EAAC,MAAM,EAAE,GAAG,EAAC,GAAG,KAAK,OAAO,CAAC,GAAG,KAAK,GACrF,OAAO,CASlB;AASM,0BANM,IAAI,KAEN,SAAS,CAAC,IAAI,CAAC,KACf,SAAS,CAAC,IAAI,CAAC,GACd,OAAO,CAEqF;AAOjG,wBAJM,IAAI,OACN,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GACjB,KAAK,CAAC,IAAI,CAAC,CAEgF;AAQhG,iCAJI,MAAM,KACN,CAAS,IAAM,EAAN,MAAM,EAAE,IAAQ,EAAR,KAAK,CAAC,GAAC,CAAC,KAAE,GAAC,GAC3B,KAAK,CAAC,GAAC,CAAC,CAQnB;AASM,0BALM,MAAM,OACR,KAAK,CAAC,GAAC,CAAC,QACR,MAAM,UACN,CAAS,IAAM,EAAN,MAAM,EAAE,IAAC,EAAD,GAAC,EAAE,IAAM,EAAN,MAAM,KAAE,MAAM,UAEsB;AAEnE,iDAAoC;AAO7B,iCAHI,KAAK,CAAC,GAAC,CAAC,GACP,KAAK,CAAC,GAAC,CAAC,CAE4B;AASzC,8BALM,CAAC,OACH,SAAS,CAAC,GAAC,CAAC,UACZ,CAAS,IAAC,EAAD,GAAC,KAAE,CAAC,GACZ,KAAK,CAAC,GAAC,CAAC,CAoBnB;AASM,oBANuB,GAAG,SAAnB,SAAS,CAAC,GAAG,CAAE,EACwD,MAAM,SAA9E,CAAU,IAA0C,EAA1C,GAAG,SAAS,SAAS,CAAC,MAAM,GAAC,CAAC,GAAG,GAAC,GAAG,KAAK,EAAE,IAAM,EAAN,MAAM,EAAE,IAAG,EAAH,GAAG,KAAE,GAAI,OACzE,GAAG,UACH,MAAM,GACL,KAAK,CAAC,MAAM,SAAS,IAAS,IAAM,EAAH,GAAG,EAAA,KAAG,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAWtE;AAoBM,yCAJI,KAAK,CAAC,GAAC,CAAC,KACR,MAAM,aACN,CAAC,CAAC,EAAC,GAAC,EAAC,CAAC,EAAC,GAAC,KAAK,MAAM,UAkB7B"}

package/dist/array.test.d.ts

@@ -1,13 +0,0 @@
-export function testIsarrayPerformance(_tc: t.TestCase): void;
-export function testAppend(_tc: t.TestCase): void;
-export function testBasic(_tc: t.TestCase): void;
-export function testflatten(_tc: t.TestCase): void;
-export function testFolding(_tc: t.TestCase): void;
-export function testEvery(_tc: t.TestCase): void;
-export function testIsArray(_tc: t.TestCase): void;
-export function testUnique(_tc: t.TestCase): void;
-export function testBubblesortItemEdgeCases(tc: t.TestCase): void;
-export function testRepeatBubblesortItem(tc: t.TestCase): void;
-export function testRepeatBubblesort(tc: t.TestCase): void;
-import * as t from './testing.js';
-//# sourceMappingURL=array.test.d.ts.map

package/dist/array.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"array.test.d.ts","sourceRoot":"","sources":["../array.test.js"],"names":[],"mappings":"AAOO,4CAFI,CAAC,CAAC,QAAQ,QAkCpB;AAKM,gCAFI,CAAC,CAAC,QAAQ,QAMpB;AAKM,+BAFI,CAAC,CAAC,QAAQ,QAMpB;AAKM,iCAFI,CAAC,CAAC,QAAQ,QAKpB;AAKM,iCAFI,CAAC,CAAC,QAAQ,QAkBpB;AAKM,+BAFI,CAAC,CAAC,QAAQ,QAQpB;AAKM,iCAFI,CAAC,CAAC,QAAQ,QASpB;AAKM,gCAFI,CAAC,CAAC,QAAQ,QAOpB;AAKM,gDAFI,CAAC,CAAC,QAAQ,QAOpB;AAKM,6CAFI,CAAC,CAAC,QAAQ,QAWpB;AAKM,yCAFI,CAAC,CAAC,QAAQ,QASpB;mBA1JkB,cAAc"}

package/dist/bin/0ecdsa-generate-keypair.d.ts

@@ -1,3 +0,0 @@
-#!/usr/bin/env node
-export {};
-//# sourceMappingURL=0ecdsa-generate-keypair.d.ts.map

package/dist/bin/0ecdsa-generate-keypair.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"0ecdsa-generate-keypair.d.ts","sourceRoot":"","sources":["../../bin/0ecdsa-generate-keypair.js"],"names":[],"mappings":""}

package/dist/bin/0serve.d.ts

@@ -1,3 +0,0 @@
-#!/usr/bin/env node
-export {};
-//# sourceMappingURL=0serve.d.ts.map

package/dist/bin/0serve.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"0serve.d.ts","sourceRoot":"","sources":["../../bin/0serve.js"],"names":[],"mappings":""}

package/dist/bin/gendocs.d.ts

@@ -1,3 +0,0 @@
-#!/usr/bin/env node
-export {};
-//# sourceMappingURL=gendocs.d.ts.map

package/dist/bin/gendocs.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"gendocs.d.ts","sourceRoot":"","sources":["../../bin/gendocs.js"],"names":[],"mappings":""}

package/dist/bin/gentesthtml.d.ts

@@ -1,3 +0,0 @@
-#!/usr/bin/env node
-export {};
-//# sourceMappingURL=gentesthtml.d.ts.map

package/dist/bin/gentesthtml.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"gentesthtml.d.ts","sourceRoot":"","sources":["../../bin/gentesthtml.js"],"names":[],"mappings":""}

package/dist/binary-ac8e39e2.cjs

@@ -1,229 +0,0 @@
-'use strict';
-
-/* eslint-env browser */
-
-/**
- * Binary data constants.
- *
- * @module binary
- */
-
-/**
- * n-th bit activated.
- *
- * @type {number}
- */
-const BIT1 = 1;
-const BIT2 = 2;
-const BIT3 = 4;
-const BIT4 = 8;
-const BIT5 = 16;
-const BIT6 = 32;
-const BIT7 = 64;
-const BIT8 = 128;
-const BIT9 = 256;
-const BIT10 = 512;
-const BIT11 = 1024;
-const BIT12 = 2048;
-const BIT13 = 4096;
-const BIT14 = 8192;
-const BIT15 = 16384;
-const BIT16 = 32768;
-const BIT17 = 65536;
-const BIT18 = 1 << 17;
-const BIT19 = 1 << 18;
-const BIT20 = 1 << 19;
-const BIT21 = 1 << 20;
-const BIT22 = 1 << 21;
-const BIT23 = 1 << 22;
-const BIT24 = 1 << 23;
-const BIT25 = 1 << 24;
-const BIT26 = 1 << 25;
-const BIT27 = 1 << 26;
-const BIT28 = 1 << 27;
-const BIT29 = 1 << 28;
-const BIT30 = 1 << 29;
-const BIT31 = 1 << 30;
-const BIT32 = 1 << 31;
-
-/**
- * First n bits activated.
- *
- * @type {number}
- */
-const BITS0 = 0;
-const BITS1 = 1;
-const BITS2 = 3;
-const BITS3 = 7;
-const BITS4 = 15;
-const BITS5 = 31;
-const BITS6 = 63;
-const BITS7 = 127;
-const BITS8 = 255;
-const BITS9 = 511;
-const BITS10 = 1023;
-const BITS11 = 2047;
-const BITS12 = 4095;
-const BITS13 = 8191;
-const BITS14 = 16383;
-const BITS15 = 32767;
-const BITS16 = 65535;
-const BITS17 = BIT18 - 1;
-const BITS18 = BIT19 - 1;
-const BITS19 = BIT20 - 1;
-const BITS20 = BIT21 - 1;
-const BITS21 = BIT22 - 1;
-const BITS22 = BIT23 - 1;
-const BITS23 = BIT24 - 1;
-const BITS24 = BIT25 - 1;
-const BITS25 = BIT26 - 1;
-const BITS26 = BIT27 - 1;
-const BITS27 = BIT28 - 1;
-const BITS28 = BIT29 - 1;
-const BITS29 = BIT30 - 1;
-const BITS30 = BIT31 - 1;
-/**
- * @type {number}
- */
-const BITS31 = 0x7FFFFFFF;
-/**
- * @type {number}
- */
-const BITS32 = 0xFFFFFFFF;
-
-var binary = /*#__PURE__*/Object.freeze({
-	__proto__: null,
-	BIT1: BIT1,
-	BIT2: BIT2,
-	BIT3: BIT3,
-	BIT4: BIT4,
-	BIT5: BIT5,
-	BIT6: BIT6,
-	BIT7: BIT7,
-	BIT8: BIT8,
-	BIT9: BIT9,
-	BIT10: BIT10,
-	BIT11: BIT11,
-	BIT12: BIT12,
-	BIT13: BIT13,
-	BIT14: BIT14,
-	BIT15: BIT15,
-	BIT16: BIT16,
-	BIT17: BIT17,
-	BIT18: BIT18,
-	BIT19: BIT19,
-	BIT20: BIT20,
-	BIT21: BIT21,
-	BIT22: BIT22,
-	BIT23: BIT23,
-	BIT24: BIT24,
-	BIT25: BIT25,
-	BIT26: BIT26,
-	BIT27: BIT27,
-	BIT28: BIT28,
-	BIT29: BIT29,
-	BIT30: BIT30,
-	BIT31: BIT31,
-	BIT32: BIT32,
-	BITS0: BITS0,
-	BITS1: BITS1,
-	BITS2: BITS2,
-	BITS3: BITS3,
-	BITS4: BITS4,
-	BITS5: BITS5,
-	BITS6: BITS6,
-	BITS7: BITS7,
-	BITS8: BITS8,
-	BITS9: BITS9,
-	BITS10: BITS10,
-	BITS11: BITS11,
-	BITS12: BITS12,
-	BITS13: BITS13,
-	BITS14: BITS14,
-	BITS15: BITS15,
-	BITS16: BITS16,
-	BITS17: BITS17,
-	BITS18: BITS18,
-	BITS19: BITS19,
-	BITS20: BITS20,
-	BITS21: BITS21,
-	BITS22: BITS22,
-	BITS23: BITS23,
-	BITS24: BITS24,
-	BITS25: BITS25,
-	BITS26: BITS26,
-	BITS27: BITS27,
-	BITS28: BITS28,
-	BITS29: BITS29,
-	BITS30: BITS30,
-	BITS31: BITS31,
-	BITS32: BITS32
-});
-
-exports.BIT1 = BIT1;
-exports.BIT10 = BIT10;
-exports.BIT11 = BIT11;
-exports.BIT12 = BIT12;
-exports.BIT13 = BIT13;
-exports.BIT14 = BIT14;
-exports.BIT15 = BIT15;
-exports.BIT16 = BIT16;
-exports.BIT17 = BIT17;
-exports.BIT18 = BIT18;
-exports.BIT19 = BIT19;
-exports.BIT2 = BIT2;
-exports.BIT20 = BIT20;
-exports.BIT21 = BIT21;
-exports.BIT22 = BIT22;
-exports.BIT23 = BIT23;
-exports.BIT24 = BIT24;
-exports.BIT25 = BIT25;
-exports.BIT26 = BIT26;
-exports.BIT27 = BIT27;
-exports.BIT28 = BIT28;
-exports.BIT29 = BIT29;
-exports.BIT3 = BIT3;
-exports.BIT30 = BIT30;
-exports.BIT31 = BIT31;
-exports.BIT32 = BIT32;
-exports.BIT4 = BIT4;
-exports.BIT5 = BIT5;
-exports.BIT6 = BIT6;
-exports.BIT7 = BIT7;
-exports.BIT8 = BIT8;
-exports.BIT9 = BIT9;
-exports.BITS0 = BITS0;
-exports.BITS1 = BITS1;
-exports.BITS10 = BITS10;
-exports.BITS11 = BITS11;
-exports.BITS12 = BITS12;
-exports.BITS13 = BITS13;
-exports.BITS14 = BITS14;
-exports.BITS15 = BITS15;
-exports.BITS16 = BITS16;
-exports.BITS17 = BITS17;
-exports.BITS18 = BITS18;
-exports.BITS19 = BITS19;
-exports.BITS2 = BITS2;
-exports.BITS20 = BITS20;
-exports.BITS21 = BITS21;
-exports.BITS22 = BITS22;
-exports.BITS23 = BITS23;
-exports.BITS24 = BITS24;
-exports.BITS25 = BITS25;
-exports.BITS26 = BITS26;
-exports.BITS27 = BITS27;
-exports.BITS28 = BITS28;
-exports.BITS29 = BITS29;
-exports.BITS3 = BITS3;
-exports.BITS30 = BITS30;
-exports.BITS31 = BITS31;
-exports.BITS32 = BITS32;
-exports.BITS4 = BITS4;
-exports.BITS5 = BITS5;
-exports.BITS6 = BITS6;
-exports.BITS7 = BITS7;
-exports.BITS8 = BITS8;
-exports.BITS9 = BITS9;
-exports.binary = binary;
-//# sourceMappingURL=binary-ac8e39e2.cjs.map

package/dist/binary-ac8e39e2.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary-ac8e39e2.cjs","sources":["../binary.js"],"sourcesContent":["/* eslint-env browser */\n\n/**\n * Binary data constants.\n *\n * @module binary\n */\n\n/**\n * n-th bit activated.\n *\n * @type {number}\n */\nexport const BIT1 = 1\nexport const BIT2 = 2\nexport const BIT3 = 4\nexport const BIT4 = 8\nexport const BIT5 = 16\nexport const BIT6 = 32\nexport const BIT7 = 64\nexport const BIT8 = 128\nexport const BIT9 = 256\nexport const BIT10 = 512\nexport const BIT11 = 1024\nexport const BIT12 = 2048\nexport const BIT13 = 4096\nexport const BIT14 = 8192\nexport const BIT15 = 16384\nexport const BIT16 = 32768\nexport const BIT17 = 65536\nexport const BIT18 = 1 << 17\nexport const BIT19 = 1 << 18\nexport const BIT20 = 1 << 19\nexport const BIT21 = 1 << 20\nexport const BIT22 = 1 << 21\nexport const BIT23 = 1 << 22\nexport const BIT24 = 1 << 23\nexport const BIT25 = 1 << 24\nexport const BIT26 = 1 << 25\nexport const BIT27 = 1 << 26\nexport const BIT28 = 1 << 27\nexport const BIT29 = 1 << 28\nexport const BIT30 = 1 << 29\nexport const BIT31 = 1 << 30\nexport const BIT32 = 1 << 31\n\n/**\n * First n bits activated.\n *\n * @type {number}\n */\nexport const BITS0 = 0\nexport const BITS1 = 1\nexport const BITS2 = 3\nexport const BITS3 = 7\nexport const BITS4 = 15\nexport const BITS5 = 31\nexport const BITS6 = 63\nexport const BITS7 = 127\nexport const BITS8 = 255\nexport const BITS9 = 511\nexport const BITS10 = 1023\nexport const BITS11 = 2047\nexport const BITS12 = 4095\nexport const BITS13 = 8191\nexport const BITS14 = 16383\nexport const BITS15 = 32767\nexport const BITS16 = 65535\nexport const BITS17 = BIT18 - 1\nexport const BITS18 = BIT19 - 1\nexport const BITS19 = BIT20 - 1\nexport const BITS20 = BIT21 - 1\nexport const BITS21 = BIT22 - 1\nexport const BITS22 = BIT23 - 1\nexport const BITS23 = BIT24 - 1\nexport const BITS24 = BIT25 - 1\nexport const BITS25 = BIT26 - 1\nexport const BITS26 = BIT27 - 1\nexport const BITS27 = BIT28 - 1\nexport const BITS28 = BIT29 - 1\nexport const BITS29 = BIT30 - 1\nexport const BITS30 = BIT31 - 1\n/**\n * @type {number}\n */\nexport const BITS31 = 0x7FFFFFFF\n/**\n * @type {number}\n */\nexport const BITS32 = 0xFFFFFFFF\n"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,EAAC;AACT,MAAC,IAAI,GAAG,EAAC;AACT,MAAC,IAAI,GAAG,EAAC;AACT,MAAC,IAAI,GAAG,EAAC;AACT,MAAC,IAAI,GAAG,GAAE;AACV,MAAC,IAAI,GAAG,GAAE;AACV,MAAC,IAAI,GAAG,GAAE;AACV,MAAC,IAAI,GAAG,IAAG;AACX,MAAC,IAAI,GAAG,IAAG;AACX,MAAC,KAAK,GAAG,IAAG;AACZ,MAAC,KAAK,GAAG,KAAI;AACb,MAAC,KAAK,GAAG,KAAI;AACb,MAAC,KAAK,GAAG,KAAI;AACb,MAAC,KAAK,GAAG,KAAI;AACb,MAAC,KAAK,GAAG,MAAK;AACd,MAAC,KAAK,GAAG,MAAK;AACd,MAAC,KAAK,GAAG,MAAK;AACd,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAChB,MAAC,KAAK,GAAG,CAAC,IAAI,GAAE;AAC5B;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,KAAK,GAAG,EAAC;AACV,MAAC,KAAK,GAAG,EAAC;AACV,MAAC,KAAK,GAAG,EAAC;AACV,MAAC,KAAK,GAAG,EAAC;AACV,MAAC,KAAK,GAAG,GAAE;AACX,MAAC,KAAK,GAAG,GAAE;AACX,MAAC,KAAK,GAAG,GAAE;AACX,MAAC,KAAK,GAAG,IAAG;AACZ,MAAC,KAAK,GAAG,IAAG;AACZ,MAAC,KAAK,GAAG,IAAG;AACZ,MAAC,MAAM,GAAG,KAAI;AACd,MAAC,MAAM,GAAG,KAAI;AACd,MAAC,MAAM,GAAG,KAAI;AACd,MAAC,MAAM,GAAG,KAAI;AACd,MAAC,MAAM,GAAG,MAAK;AACf,MAAC,MAAM,GAAG,MAAK;AACf,MAAC,MAAM,GAAG,MAAK;AACf,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AACnB,MAAC,MAAM,GAAG,KAAK,GAAG,EAAC;AAC/B;AACA;AACA;AACY,MAAC,MAAM,GAAG,WAAU;AAChC;AACA;AACA;AACY,MAAC,MAAM,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/binary.cjs

@@ -1,74 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-var binary = require('./binary-ac8e39e2.cjs');
-
-
-
-exports.BIT1 = binary.BIT1;
-exports.BIT10 = binary.BIT10;
-exports.BIT11 = binary.BIT11;
-exports.BIT12 = binary.BIT12;
-exports.BIT13 = binary.BIT13;
-exports.BIT14 = binary.BIT14;
-exports.BIT15 = binary.BIT15;
-exports.BIT16 = binary.BIT16;
-exports.BIT17 = binary.BIT17;
-exports.BIT18 = binary.BIT18;
-exports.BIT19 = binary.BIT19;
-exports.BIT2 = binary.BIT2;
-exports.BIT20 = binary.BIT20;
-exports.BIT21 = binary.BIT21;
-exports.BIT22 = binary.BIT22;
-exports.BIT23 = binary.BIT23;
-exports.BIT24 = binary.BIT24;
-exports.BIT25 = binary.BIT25;
-exports.BIT26 = binary.BIT26;
-exports.BIT27 = binary.BIT27;
-exports.BIT28 = binary.BIT28;
-exports.BIT29 = binary.BIT29;
-exports.BIT3 = binary.BIT3;
-exports.BIT30 = binary.BIT30;
-exports.BIT31 = binary.BIT31;
-exports.BIT32 = binary.BIT32;
-exports.BIT4 = binary.BIT4;
-exports.BIT5 = binary.BIT5;
-exports.BIT6 = binary.BIT6;
-exports.BIT7 = binary.BIT7;
-exports.BIT8 = binary.BIT8;
-exports.BIT9 = binary.BIT9;
-exports.BITS0 = binary.BITS0;
-exports.BITS1 = binary.BITS1;
-exports.BITS10 = binary.BITS10;
-exports.BITS11 = binary.BITS11;
-exports.BITS12 = binary.BITS12;
-exports.BITS13 = binary.BITS13;
-exports.BITS14 = binary.BITS14;
-exports.BITS15 = binary.BITS15;
-exports.BITS16 = binary.BITS16;
-exports.BITS17 = binary.BITS17;
-exports.BITS18 = binary.BITS18;
-exports.BITS19 = binary.BITS19;
-exports.BITS2 = binary.BITS2;
-exports.BITS20 = binary.BITS20;
-exports.BITS21 = binary.BITS21;
-exports.BITS22 = binary.BITS22;
-exports.BITS23 = binary.BITS23;
-exports.BITS24 = binary.BITS24;
-exports.BITS25 = binary.BITS25;
-exports.BITS26 = binary.BITS26;
-exports.BITS27 = binary.BITS27;
-exports.BITS28 = binary.BITS28;
-exports.BITS29 = binary.BITS29;
-exports.BITS3 = binary.BITS3;
-exports.BITS30 = binary.BITS30;
-exports.BITS31 = binary.BITS31;
-exports.BITS32 = binary.BITS32;
-exports.BITS4 = binary.BITS4;
-exports.BITS5 = binary.BITS5;
-exports.BITS6 = binary.BITS6;
-exports.BITS7 = binary.BITS7;
-exports.BITS8 = binary.BITS8;
-exports.BITS9 = binary.BITS9;
-//# sourceMappingURL=binary.cjs.map

package/dist/binary.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/binary.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary.d.ts","sourceRoot":"","sources":["../binary.js"],"names":[],"mappings":"AAEA;;;;GAIG;AAEH;;;;GAIG;AACH,mBAFU,MAAM,CAEK;AACrB,mBAAoB,CAAC,CAAA;AACrB,mBAAoB,CAAC,CAAA;AACrB,mBAAoB,CAAC,CAAA;AACrB,mBAAoB,EAAE,CAAA;AACtB,mBAAoB,EAAE,CAAA;AACtB,mBAAoB,EAAE,CAAA;AACtB,mBAAoB,GAAG,CAAA;AACvB,mBAAoB,GAAG,CAAA;AACvB,oBAAqB,GAAG,CAAA;AACxB,oBAAqB,IAAI,CAAA;AACzB,oBAAqB,IAAI,CAAA;AACzB,oBAAqB,IAAI,CAAA;AACzB,oBAAqB,IAAI,CAAA;AACzB,oBAAqB,KAAK,CAAA;AAC1B,oBAAqB,KAAK,CAAA;AAC1B,oBAAqB,KAAK,CAAA;AAC1B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAC5B,2BAA4B;AAE5B;;;;GAIG;AACH,oBAFU,MAAM,CAEM;AACtB,oBAAqB,CAAC,CAAA;AACtB,oBAAqB,CAAC,CAAA;AACtB,oBAAqB,CAAC,CAAA;AACtB,oBAAqB,EAAE,CAAA;AACvB,oBAAqB,EAAE,CAAA;AACvB,oBAAqB,EAAE,CAAA;AACvB,oBAAqB,GAAG,CAAA;AACxB,oBAAqB,GAAG,CAAA;AACxB,oBAAqB,GAAG,CAAA;AACxB,qBAAsB,IAAI,CAAA;AAC1B,qBAAsB,IAAI,CAAA;AAC1B,qBAAsB,IAAI,CAAA;AAC1B,qBAAsB,IAAI,CAAA;AAC1B,qBAAsB,KAAK,CAAA;AAC3B,qBAAsB,KAAK,CAAA;AAC3B,qBAAsB,KAAK,CAAA;AAC3B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B,4BAA+B;AAC/B;;GAEG;AACH,qBAFU,MAAM,CAEgB;AAChC;;GAEG;AACH,qBAFU,MAAM,CAEgB"}