zeed 1.2.4 → 1.3.1

package/dist/chunk-ZEQQVU3K.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk5RJ6XORDcjs = require('./chunk-5RJ6XORD.cjs');var _chunkP7XCQ7WVcjs = require('./chunk-P7XCQ7WV.cjs');var h={};_chunkP7XCQ7WVcjs.b.call(void 0, h,{any:()=>_chunk5RJ6XORDcjs.g,array:()=>_chunk5RJ6XORDcjs.q,boolean:()=>_chunk5RJ6XORDcjs.e,double:()=>_chunk5RJ6XORDcjs.i,enum:()=>_chunk5RJ6XORDcjs.o,float:()=>_chunk5RJ6XORDcjs.h,func:()=>_chunk5RJ6XORDcjs.r,int:()=>_chunk5RJ6XORDcjs.d,literal:()=>_chunk5RJ6XORDcjs.n,none:()=>_chunk5RJ6XORDcjs.f,number:()=>_chunk5RJ6XORDcjs.c,object:()=>_chunk5RJ6XORDcjs.k,real:()=>_chunk5RJ6XORDcjs.j,record:()=>_chunk5RJ6XORDcjs.l,rpc:()=>_chunk5RJ6XORDcjs.s,string:()=>_chunk5RJ6XORDcjs.b,tuple:()=>_chunk5RJ6XORDcjs.p,union:()=>_chunk5RJ6XORDcjs.m});exports.a = h;
-//# sourceMappingURL=chunk-ZEQQVU3K.cjs.map

package/dist/chunk-ZEQQVU3K.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/chunk-ZEQQVU3K.cjs","../src/common/schema/z-collection.ts"],"names":["z_collection_exports","__export","any","array","boolean","double","stringLiterals","float","func","int","literal","none","number","object","real","record","rpc","string","tuple","union"],"mappings":"AAAA,iIAA0J,wDAAyC,ICAnMA,CAAAA,CAAA,CAAA,CAAA,CAAAC,iCAAAA,CAAAD,CAAA,CAAA,GAAA,CAAA,CAAA,CAAA,EAAAE,mBAAAA,CAAA,KAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,OAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,MAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,IAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,KAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,IAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,GAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,OAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,IAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,MAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,MAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,IAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,MAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,GAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,MAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,KAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAA,KAAA,CAAA,CAAA,CAAA,EAAAC,mBAAAA,CAAAA,CAAAA,CAAAA,cAAAA","file":"/Users/dirk/work/github-zeed/dist/chunk-ZEQQVU3K.cjs","sourcesContent":[null,"export type { Infer as infer, Type as type } from './schema'\nexport { any, array, boolean, double, stringLiterals as enum, float, func, int, literal, none, number, object, real, record, rpc, string, tuple, union } from './schema'\n"]}

package/dist/chunk-ZGFQN2L7.js

@@ -1,2 +0,0 @@
-import{c as f}from"./chunk-A3GICSD3.js";import{b as u}from"./chunk-YAGYM2VT.js";import{a as t}from"./chunk-5NKC2EQJ.js";function i(e){return e.filter((r,n)=>e.indexOf(r)===n)}t(i,"arrayUnique");function y(e,r){return i(e.filter(n=>!r.includes(n)))}t(y,"arrayMinus");function l(...e){return i(e.reduce((r=[],n)=>r.concat(n),[]))}t(l,"arrayUnion");function o(...e){return e.flat(Number.POSITIVE_INFINITY)}t(o,"arrayFlatten");function p(e,r){return i(e).filter(n=>r.includes(n))}t(p,"arrayIntersection");function b(e,r){return y(l(e,r),p(e,r))}t(b,"arraySymmetricDifference");function h(e,r){if(e&&Array.isArray(e)){let n;for(;(n=e.indexOf(r))!==-1;)e.splice(n,1);return e}return[]}t(h,"arrayRemoveElement");function A(e,r){return e.includes(r)||e.push(r),e}t(A,"arraySetElement");function I(e,r){return e.splice(0,e.length,...e.filter(r)),e}t(I,"arrayFilterInPlace");function S(e,r){let n=e.findIndex(T=>T===r);return n>=0?e.splice(n,1):e.push(r),e}t(S,"arrayToggleInPlace");function g(e){return e.splice(0,e.length),e}t(g,"arrayEmptyInPlace");function N(e,r){return e.splice(0,e.length,...r),e}t(N,"arraySetArrayInPlace");function s(e,r=f){return Array.from(e).sort(r)}t(s,"arraySorted");function P(e){return s(e,(r,n)=>r-n)}t(P,"arraySortedNumbers");function m(e,r){return e.length===r.length&&e.every((n,T)=>n===r[T])}t(m,"arrayIsEqual");function a(e){return e.sort(()=>u()>.5?1:-1),e}t(a,"arrayShuffleInPlace");function E(e){return a(Array.from(e))}t(E,"arrayShuffle");function F(e){for(;e.length>1;){let r=Array.from(e);if(a(r),!m(e,r))return r}return e}t(F,"arrayShuffleForce");function M(e){return e[Math.floor(u()*e.length)]}t(M,"arrayRandomElement");function w(...e){return o(...e).reduce((r,n)=>r!=null?n>r?n:r:n,void 0)}t(w,"arrayMax");function O(...e){return o(...e).reduce((r,n)=>r!=null?n<r?n:r:n,void 0)}t(O,"arrayMin");function R(...e){return o(...e).reduce((r,n)=>r+n,0)}t(R,"arraySum");function k(...e){let r=o(...e);return r.reduce((n,T)=>n+T,0)/r.length}t(k,"arrayAvg");function q(e,r){let n=[],T=0,c=e.length;for(;T<c;)n.push(e.slice(T,T+=r));return n}t(q,"arrayBatches");function U(e=0,r){if(e<=0)return[];let n=Array.from({length:e});for(let T=0;T<e;T++)n[T]=r instanceof Function?r(T):r;return n}t(U,"createArray");export{i as a,y as b,l as c,o as d,p as e,b as f,h as g,A as h,I as i,S as j,g as k,N as l,s as m,P as n,m as o,a as p,E as q,F as r,M as s,w as t,O as u,R as v,k as w,q as x,U as y};
-//# sourceMappingURL=chunk-ZGFQN2L7.js.map

package/dist/chunk-ZGFQN2L7.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/common/data/array.ts"],"sourcesContent":["/* eslint-disable no-cond-assign */\n\nimport type { NestedArray } from '../types'\nimport { getSecureRandomIfPossible } from './math'\nimport { cmp } from './orderby'\n\n/**\n * Return a new array with duplicate values removed. Maintains first occurrence order.\n * @typeParam T - element type\n * @param arr - input array\n * @returns new array containing unique elements from `arr`\n */\nexport function arrayUnique<T>(arr: T[]): T[] {\n  return arr.filter((n: any, index: any) => arr.indexOf(n) === index)\n}\n\n/**\n * Return elements present in `x` but not in `y`.\n * @typeParam T - element type\n * @param left - left-hand array\n * @param right - array of elements to exclude\n * @returns new array with elements from `left` that are not included in `right`\n */\nexport function arrayMinus<T>(left: T[], right: T[]): T[] {\n  return arrayUnique(left.filter((n: any) => !right.includes(n)))\n}\n\n/**\n * Return the union of multiple arrays (unique elements across all inputs).\n * @typeParam T - element type\n * @param arrays - arrays to union\n * @returns new array with unique elements from all provided arrays\n */\nexport function arrayUnion<T>(...arrays: T[][]): T[] {\n  return arrayUnique(arrays.reduce((acc: T[] = [], value) => acc.concat(value), []))\n}\n\n/** `[1,[2,3]]` becomes `[1,2,3]` */\n/**\n * Flatten nested arrays to a single-level array.\n * Example: `[1, [2, 3]]` becomes `[1, 2, 3]`.\n * @typeParam T - element type\n * @param arrays - one or more nested arrays to flatten\n * @returns flattened array containing all elements\n */\nexport function arrayFlatten<T>(...arrays: NestedArray<T>[]): T[] {\n  return (arrays as any).flat(Number.POSITIVE_INFINITY)\n}\n\n/**\n * Return the intersection of two arrays (elements present in both).\n * @typeParam T - element type\n * @param left - first array\n * @param right - second array\n * @returns new array with elements present in both `left` and `right`\n */\nexport function arrayIntersection<T>(left: T[], right: T[]): T[] {\n  return arrayUnique<T>(left).filter((n: any) => right.includes(n))\n}\n\n/**\n * Return the symmetric difference between two arrays (elements in either array but not both).\n * @typeParam T - element type\n */\nexport function arraySymmetricDifference<T>(left: T[], right: T[]): T[] {\n  return arrayMinus(arrayUnion(left, right), arrayIntersection(left, right))\n  // return arrayUnique(x.filter(n => !y.includes(n)).concat(y.filter(n => !x.includes(n))))\n}\n\n// export function arrayApply<T>(fn:  any, a: T[]): T[] {\n//   return a.reduce(fn, [])\n// }\n\n/**\n * Remove all occurrences of `el` from `arr` in-place and return the mutated array.\n * If `arr` is not an array, returns an empty array.\n * @typeParam T - element type\n * @param arr - array to modify\n * @param el - element to remove\n * @returns the same array instance with `el` removed\n */\nexport function arrayRemoveElement<T>(arr: T[], el: T): T[] {\n  if (arr && Array.isArray(arr)) {\n    let index\n    while ((index = arr.indexOf(el)) !== -1)\n      arr.splice(index, 1)\n    return arr\n  }\n  return []\n}\n\n/** Only have it once in the set */\n/**\n * Ensure `el` exists in `arr`. If not present, push it and return the array.\n * @typeParam T - element type\n * @param arr - target array\n * @param el - element to ensure\n * @returns the same array instance (modified if `el` was added)\n */\nexport function arraySetElement<T>(arr: T[], el: T): T[] {\n  if (!arr.includes(el))\n    arr.push(el)\n  return arr\n}\n\n// via https://stackoverflow.com/a/49587869 and Erwin\n/**\n * Filter an array in-place using `fn` and return the same array instance.\n * This replaces the array contents with the filtered result.\n * @typeParam T - element type\n * @param arr - array to filter in-place\n * @param fn - predicate to determine which elements to keep\n * @returns the same array instance after filtering\n */\nexport function arrayFilterInPlace<T>(arr: T[], fn: (el: T) => boolean): T[] {\n  arr.splice(0, arr.length, ...arr.filter(fn))\n  return arr\n}\n\n// via https://stackoverflow.com/a/49587869 and Erwin\n/**\n * Toggle presence of `el` in `array` in-place: remove if present, add if missing.\n * @typeParam T - element type\n * @param arr - array to modify\n * @param el - element to toggle\n * @returns the same array instance after the toggle\n */\nexport function arrayToggleInPlace<T>(arr: T[], el: T): T[] {\n  const index = arr.findIndex(e => e === el)\n  if (index >= 0)\n    arr.splice(index, 1)\n  else arr.push(el)\n  return arr\n}\n\n/**\n * Empty an array in-place (remove all elements) and return it.\n * @typeParam T - element type\n */\nexport function arrayEmptyInPlace<T>(arr: T[]): T[] {\n  arr.splice(0, arr.length)\n  return arr\n}\n\n/**\n * Replace the contents of `array` in-place with `newContent` and return it.\n * @typeParam T - element type\n * @param arr - target array to overwrite\n * @param newContent - new contents to set\n * @returns the same array instance after replacement\n */\nexport function arraySetArrayInPlace<T>(arr: T[], newContent: T[]): T[] {\n  arr.splice(0, arr.length, ...newContent)\n  return arr\n}\n\n/**\n * Return a sorted copy of the provided iterable or array-like object.\n * @typeParam T - element type\n * @param arr - iterable or array-like input\n * @param compareFn - optional compare function (defaults to `cmp`)\n * @returns a new array sorted according to `compareFn`\n */\nexport function arraySorted<T>(\n  arr: Iterable<T> | ArrayLike<T>,\n  compareFn: ((a: T, b: T) => number) | undefined = cmp,\n): T[] {\n  return Array.from(arr).sort(compareFn)\n}\n\n/**\n * Return a new array with numbers sorted in ascending order.\n * @param arr - array of numbers\n * @returns sorted array of numbers\n */\nexport function arraySortedNumbers(arr: number[]): number[] {\n  return arraySorted(arr, (l: number, r: number) => l - r)\n}\n\n/**\n * Check strict equality of two arrays by length and element-wise === comparison.\n * @typeParam T - element type\n * @param array1 - first array\n * @param array2 - second array\n * @returns `true` if arrays are same length and all elements strictly equal\n */\nexport function arrayIsEqual<T>(array1: T[], array2: T[]): boolean {\n  return (\n    array1.length === array2.length\n    && array1.every((value, index) => value === array2[index])\n  )\n}\n\n/**\n * Shuffle an array in-place using a secure random source if available.\n * Note: uses Array.sort with random comparator which is sufficient for many cases but\n * not perfectly uniform. Returns the same mutated array.\n * @typeParam T - element type\n * @param array - array to shuffle in-place\n * @returns the shuffled array (same instance)\n */\nexport function arrayShuffleInPlace<T>(arr: T[]): T[] {\n  arr.sort(() => (getSecureRandomIfPossible() > 0.5 ? 1 : -1))\n\n  // Alternative https://github.com/sindresorhus/array-shuffle/blob/main/index.js#L8\n  // for (let index = array.length - 1; index > 0; index--) {\n  //   const newIndex = Math.floor(Math.random() * (index + 1));\n  //   [array[index], array[newIndex]] = [array[newIndex], array[index]];\n  // }\n\n  return arr\n}\n\n/**\n * Return a shuffled copy of `array` (original array is not modified).\n * @typeParam T - element type\n * @param array - input array\n * @returns a new shuffled array\n */\nexport function arrayShuffle<T>(arr: T[]): T[] {\n  return arrayShuffleInPlace(Array.from(arr))\n}\n\n/** Randomly shuffle the order of the array's elements. Force to have a different order if array has more than one element. */\n/**\n * Shuffle `array` and ensure the returned order differs from the original when possible.\n * If array length is 0 or 1 it is returned unchanged.\n * @typeParam T - element type\n * @param array - input array\n * @returns a shuffled array that's different from the input when feasible\n */\nexport function arrayShuffleForce<T>(arr: T[]): T[] {\n  while (arr.length > 1) {\n    const copy = Array.from(arr)\n    arrayShuffleInPlace(copy)\n    if (!arrayIsEqual(arr, copy))\n      return copy\n  }\n  return arr\n}\n\n/**\n * Return a random element from `array` using a secure random source if available.\n * @typeParam T - element type\n * @param array - input array (must be non-empty)\n * @returns a randomly selected element\n */\nexport function arrayRandomElement<T>(arr: T[]): T {\n  return arr[Math.floor(getSecureRandomIfPossible() * arr.length)]\n}\n\n/**\n * Return the maximum value from one or more nested arrays.\n * Uses the `>` operator for comparison.\n * @typeParam T - element type (should support `>` comparison)\n * @param arrays - nested arrays to search\n * @returns the maximum value or `undefined` if no elements present\n */\nexport function arrayMax<T>(...arrays: NestedArray<T>[]): T {\n  return arrayFlatten(...arrays).reduce(\n    (acc: T, value: T) => (acc != null ? (value > acc ? value : acc) : value),\n    undefined as T,\n  )\n}\n\n/**\n * Return the minimum value from one or more nested arrays.\n * Uses the `<` operator for comparison.\n * @typeParam T - element type (should support `<` comparison)\n * @param arrays - nested arrays to search\n * @returns the minimum value or `undefined` if no elements present\n */\nexport function arrayMin<T>(...arrays: NestedArray<T>[]): T {\n  return arrayFlatten(...arrays).reduce(\n    (acc: T, value: T) => (acc != null ? (value < acc ? value : acc) : value),\n    undefined as T,\n  )\n}\n\n/**\n * Sum all numbers in one or more nested arrays.\n * @param arrays - nested arrays of numbers\n * @returns the numeric sum (0 for empty input)\n */\nexport function arraySum(...arrays: NestedArray<number>[]): number {\n  return arrayFlatten(...arrays).reduce((acc, value) => acc + value, 0)\n}\n\n/**\n * Compute the average of numbers across one or more nested arrays.\n * @param arrays - nested arrays of numbers\n * @returns arithmetic mean (NaN if there are no elements)\n */\nexport function arrayAvg(...arrays: NestedArray<number>[]): number {\n  const flatArray = arrayFlatten(...arrays)\n  return flatArray.reduce((acc, value) => acc + value, 0) / flatArray.length\n}\n\n/**\n * Split an array into chunks of `chunkLength` (last chunk may be smaller).\n * @typeParam T - element type\n * @param arr - input array\n * @param chunkLength - chunk size (positive integer)\n * @returns array of chunk arrays\n */\nexport function arrayBatches<T>(arr: T[], chunkLength: number): T[][] {\n  const chunks = []\n  let i = 0\n  const n = arr.length\n  while (i < n)\n    chunks.push(arr.slice(i, (i += chunkLength)))\n  return chunks\n}\n\n/**\n * Create an array of given `length` filled with `item` or the result of `item(index)`.\n * If `length` is <= 0 an empty array is returned.\n * @typeParam T - element type\n * @param length - desired length of the array\n * @param item - value to fill or a function producing a value per index\n * @returns newly created array of length `length`\n */\nexport function createArray<T>(\n  length = 0,\n  item?: T | ((index: number) => T), // todo remove optional\n): T[] {\n  if (length <= 0)\n    return []\n  const arr: T[] = Array.from({ length })\n  for (let i = 0; i < length; i++)\n    // @ts-expect-error xxx\n    arr[i] = item instanceof Function ? item(i) : item\n  return arr\n}\n"],"mappings":"wHAYO,SAASA,EAAeC,EAAe,CAC5C,OAAOA,EAAI,OAAO,CAACC,EAAQC,IAAeF,EAAI,QAAQC,CAAC,IAAMC,CAAK,CACpE,CAFgBC,EAAAJ,EAAA,eAWT,SAASK,EAAcC,EAAWC,EAAiB,CACxD,OAAOP,EAAYM,EAAK,OAAQ,GAAW,CAACC,EAAM,SAAS,CAAC,CAAC,CAAC,CAChE,CAFgBH,EAAAC,EAAA,cAUT,SAASG,KAAiBC,EAAoB,CACnD,OAAOT,EAAYS,EAAO,OAAO,CAACC,EAAW,CAAC,EAAGC,IAAUD,EAAI,OAAOC,CAAK,EAAG,CAAC,CAAC,CAAC,CACnF,CAFgBP,EAAAI,EAAA,cAYT,SAASI,KAAmBH,EAA+B,CAChE,OAAQA,EAAe,KAAK,OAAO,iBAAiB,CACtD,CAFgBL,EAAAQ,EAAA,gBAWT,SAASC,EAAqBP,EAAWC,EAAiB,CAC/D,OAAOP,EAAeM,CAAI,EAAE,OAAQ,GAAWC,EAAM,SAAS,CAAC,CAAC,CAClE,CAFgBH,EAAAS,EAAA,qBAQT,SAASC,EAA4BR,EAAWC,EAAiB,CACtE,OAAOF,EAAWG,EAAWF,EAAMC,CAAK,EAAGM,EAAkBP,EAAMC,CAAK,CAAC,CAE3E,CAHgBH,EAAAU,EAAA,4BAiBT,SAASC,EAAsBd,EAAUe,EAAY,CAC1D,GAAIf,GAAO,MAAM,QAAQA,CAAG,EAAG,CAC7B,IAAIE,EACJ,MAAQA,EAAQF,EAAI,QAAQe,CAAE,KAAO,IACnCf,EAAI,OAAOE,EAAO,CAAC,EACrB,OAAOF,CACT,CACA,MAAO,CAAC,CACV,CARgBG,EAAAW,EAAA,sBAkBT,SAASE,EAAmBhB,EAAUe,EAAY,CACvD,OAAKf,EAAI,SAASe,CAAE,GAClBf,EAAI,KAAKe,CAAE,EACNf,CACT,CAJgBG,EAAAa,EAAA,mBAeT,SAASC,EAAsBjB,EAAUkB,EAA6B,CAC3E,OAAAlB,EAAI,OAAO,EAAGA,EAAI,OAAQ,GAAGA,EAAI,OAAOkB,CAAE,CAAC,EACpClB,CACT,CAHgBG,EAAAc,EAAA,sBAaT,SAASE,EAAsBnB,EAAUe,EAAY,CAC1D,IAAMb,EAAQF,EAAI,UAAUoB,GAAKA,IAAML,CAAE,EACzC,OAAIb,GAAS,EACXF,EAAI,OAAOE,EAAO,CAAC,EAChBF,EAAI,KAAKe,CAAE,EACTf,CACT,CANgBG,EAAAgB,EAAA,sBAYT,SAASE,EAAqBrB,EAAe,CAClD,OAAAA,EAAI,OAAO,EAAGA,EAAI,MAAM,EACjBA,CACT,CAHgBG,EAAAkB,EAAA,qBAYT,SAASC,EAAwBtB,EAAUuB,EAAsB,CACtE,OAAAvB,EAAI,OAAO,EAAGA,EAAI,OAAQ,GAAGuB,CAAU,EAChCvB,CACT,CAHgBG,EAAAmB,EAAA,wBAYT,SAASE,EACdxB,EACAyB,EAAkDC,EAC7C,CACL,OAAO,MAAM,KAAK1B,CAAG,EAAE,KAAKyB,CAAS,CACvC,CALgBtB,EAAAqB,EAAA,eAYT,SAASG,EAAmB3B,EAAyB,CAC1D,OAAOwB,EAAYxB,EAAK,CAAC4B,EAAWC,IAAcD,EAAIC,CAAC,CACzD,CAFgB1B,EAAAwB,EAAA,sBAWT,SAASG,EAAgBC,EAAaC,EAAsB,CACjE,OACED,EAAO,SAAWC,EAAO,QACtBD,EAAO,MAAM,CAACrB,EAAOR,IAAUQ,IAAUsB,EAAO9B,CAAK,CAAC,CAE7D,CALgBC,EAAA2B,EAAA,gBAeT,SAASG,EAAuBjC,EAAe,CACpD,OAAAA,EAAI,KAAK,IAAOkC,EAA0B,EAAI,GAAM,EAAI,EAAG,EAQpDlC,CACT,CAVgBG,EAAA8B,EAAA,uBAkBT,SAASE,EAAgBnC,EAAe,CAC7C,OAAOiC,EAAoB,MAAM,KAAKjC,CAAG,CAAC,CAC5C,CAFgBG,EAAAgC,EAAA,gBAYT,SAASC,EAAqBpC,EAAe,CAClD,KAAOA,EAAI,OAAS,GAAG,CACrB,IAAMqC,EAAO,MAAM,KAAKrC,CAAG,EAE3B,GADAiC,EAAoBI,CAAI,EACpB,CAACP,EAAa9B,EAAKqC,CAAI,EACzB,OAAOA,CACX,CACA,OAAOrC,CACT,CARgBG,EAAAiC,EAAA,qBAgBT,SAASE,EAAsBtC,EAAa,CACjD,OAAOA,EAAI,KAAK,MAAMkC,EAA0B,EAAIlC,EAAI,MAAM,CAAC,CACjE,CAFgBG,EAAAmC,EAAA,sBAWT,SAASC,KAAe/B,EAA6B,CAC1D,OAAOG,EAAa,GAAGH,CAAM,EAAE,OAC7B,CAACC,EAAQC,IAAcD,GAAO,KAAQC,EAAQD,EAAMC,EAAQD,EAAOC,EACnE,MACF,CACF,CALgBP,EAAAoC,EAAA,YAcT,SAASC,KAAehC,EAA6B,CAC1D,OAAOG,EAAa,GAAGH,CAAM,EAAE,OAC7B,CAACC,EAAQC,IAAcD,GAAO,KAAQC,EAAQD,EAAMC,EAAQD,EAAOC,EACnE,MACF,CACF,CALgBP,EAAAqC,EAAA,YAYT,SAASC,KAAYjC,EAAuC,CACjE,OAAOG,EAAa,GAAGH,CAAM,EAAE,OAAO,CAACC,EAAKC,IAAUD,EAAMC,EAAO,CAAC,CACtE,CAFgBP,EAAAsC,EAAA,YAST,SAASC,KAAYlC,EAAuC,CACjE,IAAMmC,EAAYhC,EAAa,GAAGH,CAAM,EACxC,OAAOmC,EAAU,OAAO,CAAClC,EAAKC,IAAUD,EAAMC,EAAO,CAAC,EAAIiC,EAAU,MACtE,CAHgBxC,EAAAuC,EAAA,YAYT,SAASE,EAAgB5C,EAAU6C,EAA4B,CACpE,IAAMC,EAAS,CAAC,EACZC,EAAI,EACF9C,EAAID,EAAI,OACd,KAAO+C,EAAI9C,GACT6C,EAAO,KAAK9C,EAAI,MAAM+C,EAAIA,GAAKF,CAAY,CAAC,EAC9C,OAAOC,CACT,CAPgB3C,EAAAyC,EAAA,gBAiBT,SAASI,EACdC,EAAS,EACTC,EACK,CACL,GAAID,GAAU,EACZ,MAAO,CAAC,EACV,IAAMjD,EAAW,MAAM,KAAK,CAAE,OAAAiD,CAAO,CAAC,EACtC,QAASF,EAAI,EAAGA,EAAIE,EAAQF,IAE1B/C,EAAI+C,CAAC,EAAIG,aAAgB,SAAWA,EAAKH,CAAC,EAAIG,EAChD,OAAOlD,CACT,CAXgBG,EAAA6C,EAAA","names":["arrayUnique","arr","n","index","__name","arrayMinus","left","right","arrayUnion","arrays","acc","value","arrayFlatten","arrayIntersection","arraySymmetricDifference","arrayRemoveElement","el","arraySetElement","arrayFilterInPlace","fn","arrayToggleInPlace","e","arrayEmptyInPlace","arraySetArrayInPlace","newContent","arraySorted","compareFn","cmp","arraySortedNumbers","l","r","arrayIsEqual","array1","array2","arrayShuffleInPlace","getSecureRandomIfPossible","arrayShuffle","arrayShuffleForce","copy","arrayRandomElement","arrayMax","arrayMin","arraySum","arrayAvg","flatArray","arrayBatches","chunkLength","chunks","i","createArray","length","item"]}

package/dist/chunk-ZJQITDTA.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkCWGNDC2Tcjs = require('./chunk-CWGNDC2T.cjs');var _chunkDLVWYIS2cjs = require('./chunk-DLVWYIS2.cjs');var _chunkSEQAFKIVcjs = require('./chunk-SEQAFKIV.cjs');var _chunkP7XCQ7WVcjs = require('./chunk-P7XCQ7WV.cjs');function b(i={}){let{level:L=void 0,filter:g=void 0}=i,c=_chunkDLVWYIS2cjs.b.call(void 0, g),f=_chunkDLVWYIS2cjs.d.call(void 0, L),o=_chunkCWGNDC2Tcjs.a.call(void 0, );return o?e=>{if(!f(e.level)||!c(e.name))return;let n=e.name?`[${e.name}]`:"";switch(e.level){case 1:o.info(..._chunkDLVWYIS2cjs.e.call(void 0, `I|*   ${n}`,...e.messages));break;case 2:o.warn(..._chunkDLVWYIS2cjs.e.call(void 0, `W|**  ${n}`,...e.messages));break;case 3:o.error(..._chunkDLVWYIS2cjs.e.call(void 0, `E|*** ${n}`,...e.messages));break;default:o.debug(..._chunkDLVWYIS2cjs.e.call(void 0, `D|    ${n}`,...e.messages));break}}:()=>{}}_chunkP7XCQ7WVcjs.a.call(void 0, b,"LoggerConsoleHandler");exports.a = b;
-//# sourceMappingURL=chunk-ZJQITDTA.cjs.map

package/dist/chunk-ZJQITDTA.cjs.map

@@ -1 +0,0 @@
-{"version":3,"sources":["/Users/dirk/work/github-zeed/dist/chunk-ZJQITDTA.cjs","../src/common/log/log-console.ts"],"names":["LoggerConsoleHandler","opt","level","filter","matchesNamespace","useNamespaceFilter","matchesLevel","useLevelFilter","originalConsole","getGlobalConsole","msg","name","joinLogStrings"],"mappings":"AAAA,iIAAwC,wDAAuD,wDAAkD,wDAAoC,SCSrKA,CAAAA,CAAqBC,CAAAA,CAAyB,CAAC,CAAA,CAAe,CAC5E,GAAM,CACJ,KAAA,CAAAC,CAAAA,CAAQ,KAAA,CAAA,CACR,MAAA,CAAAC,CAAAA,CAAS,KAAA,CAKX,CAAA,CAAIF,CAAAA,CACEG,CAAAA,CAAmBC,iCAAAA,CAAyB,CAAA,CAC5CC,CAAAA,CAAeC,iCAAAA,CAAoB,CAAA,CAGnCC,CAAAA,CAAkBC,iCAAAA,CAAiB,CAEzC,OAAKD,CAAAA,CAGGE,CAAAA,EAAoB,CAG1B,EAAA,CAFI,CAACJ,CAAAA,CAAaI,CAAAA,CAAI,KAAK,CAAA,EAEvB,CAACN,CAAAA,CAAiBM,CAAAA,CAAI,IAAI,CAAA,CAC5B,MAAA,CACF,IAAMC,CAAAA,CAAOD,CAAAA,CAAI,IAAA,CAAO,CAAA,CAAA,EAAIA,CAAAA,CAAI,IAAI,CAAA,CAAA,CAAA,CAAM,EAAA,CAC1C,MAAA,CAAQA,CAAAA,CAAI,KAAA,CAAO,CACjB,KAAK,CAAA,CACHF,CAAAA,CAAgB,IAAA,CAAK,GAAGI,iCAAAA,CAAe,MAAA,EAASD,CAAI,CAAA,CAAA","file":"/Users/dirk/work/github-zeed/dist/chunk-ZJQITDTA.cjs","sourcesContent":[null,"import type { LogHandler, LogHandlerOptions, LogMessage } from './log-base'\nimport { LogLevelError, LogLevelInfo, LogLevelWarn } from './log-base'\nimport { getGlobalConsole } from './log-console-original'\nimport { joinLogStrings, useLevelFilter, useNamespaceFilter } from './log-filter'\n\n/**\n * Very basic logger. Please take a look at the browser and node\n * optimized loggers. This one is just the absolute fallback option.\n */\nexport function LoggerConsoleHandler(opt: LogHandlerOptions = {}): LogHandler {\n  const {\n    level = undefined,\n    filter = undefined,\n    // colors = true,\n    // levelHelper = false,\n    // nameBrackets = true,\n    // padding = 16,\n  } = opt\n  const matchesNamespace = useNamespaceFilter(filter)\n  const matchesLevel = useLevelFilter(level)\n\n  // logCaptureConsole will override the console methods, so we need to get the original ones\n  const originalConsole = getGlobalConsole()\n\n  if (!originalConsole)\n    return () => {}\n\n  return (msg: LogMessage) => {\n    if (!matchesLevel(msg.level))\n      return\n    if (!matchesNamespace(msg.name))\n      return\n    const name = msg.name ? `[${msg.name}]` : ''\n    switch (msg.level) {\n      case LogLevelInfo:\n        originalConsole.info(...joinLogStrings(`I|*   ${name}`, ...msg.messages))\n        break\n      case LogLevelWarn:\n        originalConsole.warn(...joinLogStrings(`W|**  ${name}`, ...msg.messages))\n        break\n      case LogLevelError:\n        originalConsole.error(...joinLogStrings(`E|*** ${name}`, ...msg.messages))\n        break\n      default:\n        originalConsole.debug(...joinLogStrings(`D|    ${name}`, ...msg.messages))\n        break\n    }\n  }\n}\n"]}

package/dist/common/assert.d.ts

@@ -1,8 +0,0 @@
-/** Always throws. */
-declare function fatal(...messages: any[]): never;
-/** Throws if condition is not truthy. */
-declare function assert(condition: unknown, ...messages: any[]): asserts condition;
-/** Alias for `assert` for better differentiation to unit test's assert function. */
-declare function assertCondition(condition: unknown, ...messages: any[]): asserts condition;
-
-export { assert, assertCondition, fatal };

package/dist/common/assert.js

@@ -1,2 +0,0 @@
-import{a,b,c}from"../chunk-UVILAVID.js";import"../chunk-R3IUCVWM.js";import"../chunk-HMB2NUKL.js";import"../chunk-NG3WB2CM.js";import"../chunk-YW3IERPU.js";import"../chunk-D3NCJPFL.js";import"../chunk-RZR3ECDT.js";import"../chunk-6VFFIKPT.js";import"../chunk-OXCNH7BM.js";import"../chunk-GMRDD36O.js";import"../chunk-AA5MUTKR.js";import"../chunk-5NKC2EQJ.js";export{b as assert,c as assertCondition,a as fatal};
-//# sourceMappingURL=assert.js.map

package/dist/common/assert.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/common/bin/index.d.ts

@@ -1,52 +0,0 @@
-import { BinInput } from '../data/bin-types.js';
-import { Encoder } from '../msg/encoder.js';
-
-declare class BinaryEncoder implements Encoder {
-    encode(data: any): Promise<Uint8Array>;
-    decode(data: Uint8Array | ArrayBuffer): Promise<any>;
-}
-/** Encode any object, including Uint8Array data */
-declare function encodeJson(data: any): Uint8Array;
-/** Decode any object, including Uint8Array data */
-declare function decodeJson(data: Uint8Array | ArrayBuffer): any;
-/** Incrementally encode binary data */
-declare function createBinaryStreamEncoder(initialData?: BinInput): {
-    /** Just writes the bytes. Length is not stored! */
-    writeBytes: (data: BinInput, expectedLength: number) => void;
-    writeBytesVar: (data: BinInput) => void;
-    writeUintVar: (data: number) => void;
-    writeUint8: (data: number) => void;
-    writeUint16: (data: number) => void;
-    writeUint32: (data: number) => void;
-    writeIntVar: (data: number) => void;
-    writeFloat: (data: number) => void;
-    writeStringVar: (data: string) => void;
-    write: (data: any) => void;
-    getUint8Array: () => Uint8Array;
-    getLength: () => number;
-};
-/** Incrementally decode binary data */
-declare function createBinaryStreamDecoder(data: BinInput): {
-    readBytes: (len: number) => Uint8Array;
-    readBytesVar: () => Uint8Array;
-    readUintVar: () => number;
-    readUint8: () => number;
-    readUint16: () => number;
-    readUint32: () => number;
-    readIntVar: () => number;
-    readFloat: () => number;
-    readStringVar: () => string;
-    read: () => any;
-    getOffset: () => number;
-};
-declare function bitfield(bitfield?: number): {
-    setBit: (bit: number, value?: boolean) => number;
-    unsetBit: (bit: number) => number;
-    toggleBit: (bit: number) => number;
-    getBit: (bit: number) => boolean;
-    getValue: () => number;
-};
-declare function blobToArrayBuffer(blob: Blob | File): Promise<ArrayBuffer | undefined>;
-declare function blobToUint8Array(blob: Blob | File): Promise<Uint8Array | undefined>;
-
-export { BinaryEncoder, bitfield, blobToArrayBuffer, blobToUint8Array, createBinaryStreamDecoder, createBinaryStreamEncoder, decodeJson, encodeJson };

package/dist/common/bin/index.js

@@ -1,2 +0,0 @@
-import{a,b,c,d,e,f,g,h}from"../../chunk-IBGLNGGT.js";import"../../chunk-5WAO44ET.js";import"../../chunk-FGAKPO3O.js";import"../../chunk-ESODSJEY.js";import"../../chunk-6GMDX4A4.js";import"../../chunk-VF3ZWSJS.js";import"../../chunk-UVILAVID.js";import"../../chunk-R3IUCVWM.js";import"../../chunk-HMB2NUKL.js";import"../../chunk-NG3WB2CM.js";import"../../chunk-YW3IERPU.js";import"../../chunk-D3NCJPFL.js";import"../../chunk-RZR3ECDT.js";import"../../chunk-6VFFIKPT.js";import"../../chunk-OXCNH7BM.js";import"../../chunk-GMRDD36O.js";import"../../chunk-TXYP3UN6.js";import"../../chunk-AA5MUTKR.js";import"../../chunk-5NKC2EQJ.js";export{a as BinaryEncoder,f as bitfield,g as blobToArrayBuffer,h as blobToUint8Array,e as createBinaryStreamDecoder,d as createBinaryStreamEncoder,c as decodeJson,b as encodeJson};
-//# sourceMappingURL=index.js.map

package/dist/common/bin/index.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/common/bin/lib0/binary.d.ts

@@ -1,78 +0,0 @@
-/**
- * Original at https://github.com/dmonad/lib0
- *
- * Binary data constants.
- */
-/**
- * n-th bit activated.
- */
-declare const BIT1 = 1;
-declare const BIT2 = 2;
-declare const BIT3 = 4;
-declare const BIT4 = 8;
-declare const BIT5 = 16;
-declare const BIT6 = 32;
-declare const BIT7 = 64;
-declare const BIT8 = 128;
-declare const BIT9 = 256;
-declare const BIT10 = 512;
-declare const BIT11 = 1024;
-declare const BIT12 = 2048;
-declare const BIT13 = 4096;
-declare const BIT14 = 8192;
-declare const BIT15 = 16384;
-declare const BIT16 = 32768;
-declare const BIT17 = 65536;
-declare const BIT18 = 131072;
-declare const BIT19 = 262144;
-declare const BIT20 = 524288;
-declare const BIT21 = 1048576;
-declare const BIT22 = 2097152;
-declare const BIT23 = 4194304;
-declare const BIT24 = 8388608;
-declare const BIT25 = 16777216;
-declare const BIT26 = 33554432;
-declare const BIT27 = 67108864;
-declare const BIT28 = 134217728;
-declare const BIT29 = 268435456;
-declare const BIT30 = 536870912;
-declare const BIT31 = 1073741824;
-declare const BIT32 = 2147483648;
-/**
- * First n bits activated.
- */
-declare const BITS0 = 0;
-declare const BITS1 = 1;
-declare const BITS2 = 3;
-declare const BITS3 = 7;
-declare const BITS4 = 15;
-declare const BITS5 = 31;
-declare const BITS6 = 63;
-declare const BITS7 = 127;
-declare const BITS8 = 255;
-declare const BITS9 = 511;
-declare const BITS10 = 1023;
-declare const BITS11 = 2047;
-declare const BITS12 = 4095;
-declare const BITS13 = 8191;
-declare const BITS14 = 16383;
-declare const BITS15 = 32767;
-declare const BITS16 = 65535;
-declare const BITS17 = 131071;
-declare const BITS18 = 262143;
-declare const BITS19 = 524287;
-declare const BITS20 = 1048575;
-declare const BITS21 = 2097151;
-declare const BITS22 = 4194303;
-declare const BITS23 = 8388607;
-declare const BITS24 = 16777215;
-declare const BITS25 = 33554431;
-declare const BITS26 = 67108863;
-declare const BITS27 = 134217727;
-declare const BITS28 = 268435455;
-declare const BITS29 = 536870911;
-declare const BITS30 = 1073741823;
-declare const BITS31 = 2147483647;
-declare const BITS32 = 4294967295;
-
-export { BIT1, BIT10, BIT11, BIT12, BIT13, BIT14, BIT15, BIT16, BIT17, BIT18, BIT19, BIT2, BIT20, BIT21, BIT22, BIT23, BIT24, BIT25, BIT26, BIT27, BIT28, BIT29, BIT3, BIT30, BIT31, BIT32, BIT4, BIT5, BIT6, BIT7, BIT8, BIT9, BITS0, BITS1, BITS10, BITS11, BITS12, BITS13, BITS14, BITS15, BITS16, BITS17, BITS18, BITS19, BITS2, BITS20, BITS21, BITS22, BITS23, BITS24, BITS25, BITS26, BITS27, BITS28, BITS29, BITS3, BITS30, BITS31, BITS32, BITS4, BITS5, BITS6, BITS7, BITS8, BITS9 };

package/dist/common/bin/lib0/binary.js

@@ -1,2 +0,0 @@
-import{$,A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,_,a,aa,b,ba,c,ca,d,da,e,ea,f,fa,g,ga,h,ha,i,ia,j,ja,k,ka,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}from"../../../chunk-6GMDX4A4.js";import"../../../chunk-5NKC2EQJ.js";export{a as BIT1,j as BIT10,k as BIT11,l as BIT12,m as BIT13,n as BIT14,o as BIT15,p as BIT16,q as BIT17,r as BIT18,s as BIT19,b as BIT2,t as BIT20,u as BIT21,v as BIT22,w as BIT23,x as BIT24,y as BIT25,z as BIT26,A as BIT27,B as BIT28,C as BIT29,c as BIT3,D as BIT30,E as BIT31,F as BIT32,d as BIT4,e as BIT5,f as BIT6,g as BIT7,h as BIT8,i as BIT9,G as BITS0,H as BITS1,Q as BITS10,R as BITS11,S as BITS12,T as BITS13,U as BITS14,V as BITS15,W as BITS16,X as BITS17,Y as BITS18,Z as BITS19,I as BITS2,_ as BITS20,$ as BITS21,aa as BITS22,ba as BITS23,ca as BITS24,da as BITS25,ea as BITS26,fa as BITS27,ga as BITS28,ha as BITS29,J as BITS3,ia as BITS30,ja as BITS31,ka as BITS32,K as BITS4,L as BITS5,M as BITS6,N as BITS7,O as BITS8,P as BITS9};
-//# sourceMappingURL=binary.js.map

package/dist/common/bin/lib0/binary.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/common/bin/lib0/buffer.d.ts

@@ -1,21 +0,0 @@
-/**
- * Original at https://github.com/dmonad/lib0
- *
- * Utility functions to work with buffers (Uint8Array).
- */
-declare function createUint8ArrayFromLen(len: number): Uint8Array;
-/**
- * Copy the content of an Uint8Array view to a new ArrayBuffer.
- */
-declare function copyUint8Array(uint8Array: Uint8Array): Uint8Array;
-/**
- * Encode anything as a UInt8Array. It's a pun on typescripts's `any` type.
- * See encoding.writeAny for more information.
- */
-declare function encodeAny(data: any): Uint8Array;
-/**
- * Decode an any-encoded value.
- */
-declare function decodeAny(buf: Uint8Array): any;
-
-export { copyUint8Array, createUint8ArrayFromLen, decodeAny, encodeAny };

package/dist/common/bin/lib0/buffer.js

@@ -1,2 +0,0 @@
-import{A as o,b as t}from"../../../chunk-5WAO44ET.js";import{A as y,b as c,d as i}from"../../../chunk-FGAKPO3O.js";import"../../../chunk-ESODSJEY.js";import"../../../chunk-6GMDX4A4.js";import"../../../chunk-VF3ZWSJS.js";import{a as e}from"../../../chunk-5NKC2EQJ.js";function a(r){return new Uint8Array(r)}e(a,"createUint8ArrayFromLen");function U(r){let n=a(r.byteLength);return n.set(r),n}e(U,"copyUint8Array");function d(r){let n=c();return y(n,r),i(n)}e(d,"encodeAny");function f(r){return o(t(r))}e(f,"decodeAny");export{U as copyUint8Array,a as createUint8ArrayFromLen,f as decodeAny,d as encodeAny};
-//# sourceMappingURL=buffer.js.map

package/dist/common/bin/lib0/buffer.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../../../src/common/bin/lib0/buffer.ts"],"sourcesContent":["/**\n * Original at https://github.com/dmonad/lib0\n *\n * Utility functions to work with buffers (Uint8Array).\n */\n\nimport { createDecoder, readAny } from './decoding'\nimport { createBinEncoder, encodeToUint8Array, writeAny } from './encoding'\n\nexport function createUint8ArrayFromLen(len: number): Uint8Array {\n  return new Uint8Array(len)\n}\n\n/**\n * Copy the content of an Uint8Array view to a new ArrayBuffer.\n */\nexport function copyUint8Array(uint8Array: Uint8Array): Uint8Array {\n  const newBuf = createUint8ArrayFromLen(uint8Array.byteLength)\n  newBuf.set(uint8Array)\n  return newBuf\n}\n\n/**\n * Encode anything as a UInt8Array. It's a pun on typescripts's `any` type.\n * See encoding.writeAny for more information.\n */\nexport function encodeAny(data: any): Uint8Array {\n  const encoder = createBinEncoder()\n  writeAny(encoder, data)\n  return encodeToUint8Array(encoder)\n}\n\n/**\n * Decode an any-encoded value.\n */\nexport function decodeAny(buf: Uint8Array): any {\n  return readAny(createDecoder(buf))\n}\n"],"mappings":"2QASO,SAASA,EAAwBC,EAAyB,CAC/D,OAAO,IAAI,WAAWA,CAAG,CAC3B,CAFgBC,EAAAF,EAAA,2BAOT,SAASG,EAAeC,EAAoC,CACjE,IAAMC,EAASL,EAAwBI,EAAW,UAAU,EAC5D,OAAAC,EAAO,IAAID,CAAU,EACdC,CACT,CAJgBH,EAAAC,EAAA,kBAUT,SAASG,EAAUC,EAAuB,CAC/C,IAAMC,EAAUC,EAAiB,EACjC,OAAAC,EAASF,EAASD,CAAI,EACfI,EAAmBH,CAAO,CACnC,CAJgBN,EAAAI,EAAA,aAST,SAASM,EAAUC,EAAsB,CAC9C,OAAOC,EAAQC,EAAcF,CAAG,CAAC,CACnC,CAFgBX,EAAAU,EAAA","names":["createUint8ArrayFromLen","len","__name","copyUint8Array","uint8Array","newBuf","encodeAny","data","encoder","createBinEncoder","writeAny","encodeToUint8Array","decodeAny","buf","readAny","createDecoder"]}

package/dist/common/bin/lib0/create.d.ts

@@ -1,15 +0,0 @@
-/**
- * Original at https://github.com/dmonad/lib0
- *
- * Utility functions to work with buffers (Uint8Array).
- */
-/**
- * Create Uint8Array with initial content from buffer
- */
-declare function createUint8ArrayViewFromArrayBuffer(buffer: ArrayBufferLike, byteOffset: number, length: number): Uint8Array<ArrayBufferLike>;
-/**
- * Create Uint8Array with initial content from buffer
- */
-declare function createUint8ArrayFromArrayBuffer(buffer: ArrayBuffer): Uint8Array<ArrayBuffer>;
-
-export { createUint8ArrayFromArrayBuffer, createUint8ArrayViewFromArrayBuffer };

package/dist/common/bin/lib0/create.js

@@ -1,2 +0,0 @@
-import{a,b}from"../../../chunk-VF3ZWSJS.js";import"../../../chunk-5NKC2EQJ.js";export{b as createUint8ArrayFromArrayBuffer,a as createUint8ArrayViewFromArrayBuffer};
-//# sourceMappingURL=create.js.map

package/dist/common/bin/lib0/create.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/common/bin/lib0/decoding.d.ts

@@ -1,138 +0,0 @@
-/**
- * Original at https://github.com/dmonad/lib0
- *
- * Efficient schema-less binary decoding with support for variable length encoding.
- *
- * Use [lib0/decoding] with [lib0/encoding]. Every encoding function has a corresponding decoding function.
- *
- * Encodes numbers in little-endian order (least to most significant byte order)
- * and is compatible with Golang's binary encoding (https://golang.org/pkg/encoding/binary/)
- * which is also used in Protocol Buffers.
- *
- * ```js
- * // encoding step
- * const encoder = new encoding.createEncoder()
- * encoding.writeVarUint(encoder, 256)
- * encoding.writeVarString(encoder, 'Hello world!')
- * const buf = encoding.toUint8Array(encoder)
- * ```
- *
- * ```js
- * // decoding step
- * const decoder = new decoding.createDecoder(buf)
- * decoding.readVarUint(decoder) // => 256
- * decoding.readVarString(decoder) // => 'Hello world!'
- * decoding.hasContent(decoder) // => false - all data is read
- * ```
- */
-/**
- * A BinDecoder handles the decoding of an Uint8Array.
- */
-declare class BinDecoder {
-    /** Decoding target. */
-    arr: Uint8Array;
-    /** Current decoding position. */
-    pos: number;
-    constructor(uint8Array: Uint8Array);
-}
-declare function createDecoder(uint8Array: Uint8Array): BinDecoder;
-declare function hasContent(decoder: BinDecoder): boolean;
-/**
- * Clone a decoder instance.
- * Optionally set a new position parameter.
- */
-declare function clone(decoder: BinDecoder, newPos?: number): BinDecoder;
-/**
- * Create an Uint8Array view of the next `len` bytes and advance the position by `len`.
- *
- * Important: The Uint8Array still points to the underlying ArrayBuffer. Make sure to discard the result as soon as possible to prevent any memory leaks.
- *            Use `buffer.copyUint8Array` to copy the result into a new Uint8Array.
- */
-declare function readUint8Array(decoder: BinDecoder, len: number): Uint8Array;
-/**
- * Read unsigned integer (32bit) with variable length.
- * 1/8th of the storage is used as encoding overhead.
- * numbers < 2^7 is stored in one bytlength
- * numbers < 2^14 is stored in two bylength
- */
-declare function readVarUint(decoder: BinDecoder): number;
-/**
- * Read variable length Uint8Array.
- *
- * Important: The Uint8Array still points to the underlying ArrayBuffer. Make sure to discard the result as soon as possible to prevent any memory leaks.
- *            Use `buffer.copyUint8Array` to copy the result into a new Uint8Array.
- */
-declare function readVarUint8Array(decoder: BinDecoder): Uint8Array;
-/**
- * Read the rest of the content as an ArrayBuffer
- */
-declare function readTailAsUint8Array(decoder: BinDecoder): Uint8Array;
-/**
- * Skip one byte, jump to the next position.
- */
-declare function skip8(decoder: BinDecoder): number;
-/**
- * Read one byte as unsigned integer.
- */
-declare function readUint8(decoder: BinDecoder): number;
-/**
- * Read 2 bytes as unsigned integer.
- */
-declare function readUint16(decoder: BinDecoder): number;
-/**
- * Read 4 bytes as unsigned integer.
- */
-declare function readUint32(decoder: BinDecoder): number;
-/**
- * Read 4 bytes as unsigned integer in big endian order.
- * (most significant byte first)
- */
-declare function readUint32BigEndian(decoder: BinDecoder): number;
-/**
- * Look ahead without incrementing the position
- * to the next byte and read it as unsigned integer.
- */
-declare function peekUint8(decoder: BinDecoder): number;
-/**
- * Look ahead without incrementing the position
- * to the next byte and read it as unsigned integer.
- */
-declare function peekUint16(decoder: BinDecoder): number;
-/**
- * Look ahead without incrementing the position
- * to the next byte and read it as unsigned integer.
- */
-declare function peekUint32(decoder: BinDecoder): number;
-/**
- * Read signed integer (32bit) with variable length.
- * 1/8th of the storage is used as encoding overhead.
- * numbers < 2^7 is stored in one bytlength
- * numbers < 2^14 is stored in two bylength
- * @todo This should probably create the inverse ~num if number is negative - but this would be a breaking change.
- */
-declare function readVarInt(decoder: BinDecoder): number;
-/**
- * Look ahead and read varUint without incrementing position
- */
-declare function peekVarUint(decoder: BinDecoder): number;
-/**
- * Look ahead and read varUint without incrementing position
- */
-declare function peekVarInt(decoder: BinDecoder): number;
-/**
- * Read string of variable length
- * varUint is used to store the length of the string
- */
-declare function readVarString(decoder: BinDecoder): string;
-/**
- * Look ahead and read varString without incrementing position
- */
-declare function peekVarString(decoder: BinDecoder): string;
-declare function readFromDataView(decoder: BinDecoder, len: number): DataView;
-declare function readFloat32(decoder: BinDecoder): number;
-declare function readFloat64(decoder: BinDecoder): number;
-declare function readBigInt64(decoder: BinDecoder): bigint;
-declare function readBigUint64(decoder: BinDecoder): bigint;
-declare function readAny(decoder: BinDecoder): any;
-
-export { BinDecoder, clone, createDecoder, hasContent, peekUint16, peekUint32, peekUint8, peekVarInt, peekVarString, peekVarUint, readAny, readBigInt64, readBigUint64, readFloat32, readFloat64, readFromDataView, readTailAsUint8Array, readUint16, readUint32, readUint32BigEndian, readUint8, readUint8Array, readVarInt, readVarString, readVarUint, readVarUint8Array, skip8 };

package/dist/common/bin/lib0/decoding.js

@@ -1,2 +0,0 @@
-import{A,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}from"../../../chunk-5WAO44ET.js";import"../../../chunk-ESODSJEY.js";import"../../../chunk-6GMDX4A4.js";import"../../../chunk-VF3ZWSJS.js";import"../../../chunk-5NKC2EQJ.js";export{a as BinDecoder,d as clone,b as createDecoder,c as hasContent,o as peekUint16,p as peekUint32,n as peekUint8,s as peekVarInt,u as peekVarString,r as peekVarUint,A as readAny,y as readBigInt64,z as readBigUint64,w as readFloat32,x as readFloat64,v as readFromDataView,h as readTailAsUint8Array,k as readUint16,l as readUint32,m as readUint32BigEndian,j as readUint8,e as readUint8Array,q as readVarInt,t as readVarString,f as readVarUint,g as readVarUint8Array,i as skip8};
-//# sourceMappingURL=decoding.js.map

package/dist/common/bin/lib0/decoding.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/common/bin/lib0/encoding.d.ts

@@ -1,176 +0,0 @@
-/**
- * Original at https://github.com/dmonad/lib0
- *
- * Efficient schema-less binary encoding with support for variable length encoding.
- *
- * Use [lib0/encoding] with [lib0/decoding]. Every encoding function has a corresponding decoding function.
- *
- * Encodes numbers in little-endian order (least to most significant byte order)
- * and is compatible with Golang's binary encoding (https://golang.org/pkg/encoding/binary/)
- * which is also used in Protocol Buffers.
- *
- * ```js
- * // encoding step
- * const encoder = new encoding.createEncoder()
- * encoding.writeVarUint(encoder, 256)
- * encoding.writeVarString(encoder, 'Hello world!')
- * const buf = encoding.toUint8Array(encoder)
- * ```
- *
- * ```js
- * // decoding step
- * const decoder = new decoding.createDecoder(buf)
- * decoding.readVarUint(decoder) // => 256
- * decoding.readVarString(decoder) // => 'Hello world!'
- * decoding.hasContent(decoder) // => false - all data is read
- * ```
- */
-/**
- * A BinaryEncoder handles the encoding to an Uint8Array.
- */
-declare class BinEncoder {
-    cpos: number;
-    cbuf: Uint8Array;
-    bufs: Uint8Array[];
-    constructor();
-}
-declare function createBinEncoder(): BinEncoder;
-/**
- * The current length of the encoded data.
- */
-declare function length(encoder: BinEncoder): number;
-/**
- * Transform to Uint8Array.
- */
-declare function encodeToUint8Array(encoder: BinEncoder): Uint8Array;
-/**
- * Verify that it is possible to write `len` bytes wtihout checking. If
- * necessary, a new Buffer with the required length is attached.
- */
-declare function verifyLen(encoder: BinEncoder, len: number): void;
-/**
- * Write one byte to the encoder.
- */
-declare function write(encoder: BinEncoder, num: number): void;
-/**
- * Write one byte at a specific position.
- * Position must already be written (i.e. encoder.length > pos)
- */
-declare function set(encoder: BinEncoder, pos: number, num: number): void;
-/**
- * Write one byte as an unsigned integer.
- */
-declare const writeUint8: typeof write;
-/**
- * Write one byte as an unsigned Integer at a specific location.
- */
-declare const setUint8: typeof set;
-/**
- * Write two bytes as an unsigned integer.
- */
-declare function writeUint16(encoder: BinEncoder, num: number): void;
-/**
- * Write two bytes as an unsigned integer at a specific location.
- */
-declare function setUint16(encoder: BinEncoder, pos: number, num: number): void;
-/**
- * Write two bytes as an unsigned integer
- */
-declare function writeUint32(encoder: BinEncoder, num: number): void;
-/**
- * Write two bytes as an unsigned integer in big endian order.
- * (most significant byte first)
- */
-declare function writeUint32BigEndian(encoder: BinEncoder, num: number): void;
-/**
- * Write two bytes as an unsigned integer at a specific location.
- */
-declare function setUint32(encoder: BinEncoder, pos: number, num: number): void;
-/**
- * Write a variable length unsigned integer. Max encodable integer is 2^53.
- */
-declare function writeVarUint(encoder: BinEncoder, num: number): void;
-declare function isNegativeZero(n: number): boolean;
-/**
- * Write a variable length integer.
- *
- * We use the 7th bit instead for signaling that this is a negative number.
- */
-declare function writeVarInt(encoder: BinEncoder, num: number): void;
-/**
- * Append fixed-length Uint8Array to the encoder.
- */
-declare function writeUint8Array(encoder: BinEncoder, uint8Array: Uint8Array): void;
-/**
- * Append an Uint8Array to BinEncoder.
- */
-declare function writeVarUint8Array(encoder: BinEncoder, uint8Array: Uint8Array): void;
-/**
- * Write a variable length string.
- */
-declare function writeVarString(encoder: BinEncoder, str: string): void;
-/**
- * Write the content of another Encoder.
- *
- * @TODO: can be improved!
- *        - Note: Should consider that when appending a lot of small Encoders, we should rather clone than referencing the old structure.
- *                Encoders start with a rather big initial buffer.
- */
-declare function writeBinaryEncoder(encoder: BinEncoder, append: BinEncoder): void;
-/**
- * Create an DataView of the next `len` bytes. Use it to write data after
- * calling this function.
- *
- * ```js
- * // write float32 using DataView
- * const dv = writeOnDataView(encoder, 4)
- * dv.setFloat32(0, 1.1)
- * // read float32 using DataView
- * const dv = readFromDataView(encoder, 4)
- * dv.getFloat32(0) // => 1.100000023841858 (leaving it to the reader to find out why this is the correct result)
- * ```
- */
-declare function writeOnDataView(encoder: BinEncoder, len: number): DataView;
-declare function writeFloat32(encoder: BinEncoder, num: number): void;
-declare function writeFloat64(encoder: BinEncoder, num: number): void;
-declare function writeBigInt64(encoder: BinEncoder, num: bigint): void;
-declare function writeBigUint64(encoder: BinEncoder, num: bigint): void;
-/**
- * Encode data with efficient binary format.
- *
- * Differences to JSON:
- * • Transforms data to a binary format (not to a string)
- * • Encodes undefined, NaN, and ArrayBuffer (these can't be represented in JSON)
- * • Numbers are efficiently encoded either as a variable length integer, as a
- *   32 bit float, as a 64 bit float, or as a 64 bit bigint.
- *
- * Encoding table:
- *
- * | Data Type           | Prefix   | Encoding Method    | Comment |
- * | ------------------- | -------- | ------------------ | ------- |
- * | undefined           | 127      |                    | Functions, symbol, and everything that cannot be identified is encoded as undefined |
- * | null                | 126      |                    | |
- * | integer             | 125      | writeVarInt        | Only encodes 32 bit signed integers |
- * | float32             | 124      | writeFloat32       | |
- * | float64             | 123      | writeFloat64       | |
- * | bigint              | 122      | writeBigInt64      | |
- * | boolean (false)     | 121      |                    | True and false are different data types so we save the following byte |
- * | boolean (true)      | 120      |                    | - 0b01111000 so the last bit determines whether true or false |
- * | string              | 119      | writeVarString     | |
- * | object<string,any>  | 118      | custom             | Writes {length} then {length} key-value pairs |
- * | array<any>          | 117      | custom             | Writes {length} then {length} json values |
- * | Uint8Array          | 116      | writeVarUint8Array | We use Uint8Array for any kind of binary data |
- *
- * Reasons for the decreasing prefix:
- * We need the first bit for extendability (later we may want to encode the
- * prefix with writeVarUint). The remaining 7 bits are divided as follows:
- * [0-30]   the beginning of the data range is used for custom purposes
- *          (defined by the function that uses this library)
- * [31-127] the end of the data range is used for data encoding by
- *          lib0/encoding.js
- */
-declare function writeAny(encoder: BinEncoder, data: undefined | null | number | bigint | boolean | string | {
-    [s: string]: any;
-} | Array<any> | Uint8Array): void;
-
-export { BinEncoder, createBinEncoder, encodeToUint8Array, isNegativeZero, length, set, setUint16, setUint32, setUint8, verifyLen, write, writeAny, writeBigInt64, writeBigUint64, writeBinaryEncoder, writeFloat32, writeFloat64, writeOnDataView, writeUint16, writeUint32, writeUint32BigEndian, writeUint8, writeUint8Array, writeVarInt, writeVarString, writeVarUint, writeVarUint8Array };

package/dist/common/bin/lib0/encoding.js

@@ -1,2 +0,0 @@
-import{A,a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}from"../../../chunk-FGAKPO3O.js";import"../../../chunk-ESODSJEY.js";import"../../../chunk-6GMDX4A4.js";import"../../../chunk-VF3ZWSJS.js";import"../../../chunk-5NKC2EQJ.js";export{a as BinEncoder,b as createBinEncoder,d as encodeToUint8Array,p as isNegativeZero,c as length,g as set,k as setUint16,n as setUint32,i as setUint8,e as verifyLen,f as write,A as writeAny,y as writeBigInt64,z as writeBigUint64,u as writeBinaryEncoder,w as writeFloat32,x as writeFloat64,v as writeOnDataView,j as writeUint16,l as writeUint32,m as writeUint32BigEndian,h as writeUint8,r as writeUint8Array,q as writeVarInt,t as writeVarString,o as writeVarUint,s as writeVarUint8Array};
-//# sourceMappingURL=encoding.js.map

package/dist/common/bin/lib0/encoding.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}