npm - @rocicorp/zero - Versions diffs - 1.12.0-canary.0 → 1.12.0-canary.10 - Mend

@rocicorp/zero 1.12.0-canary.0 → 1.12.0-canary.10

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1387) hide show

package/out/replicache/src/types.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../replicache/src/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAChE,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,2BAA2B,CAAC;AAC5D,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,WAAW,CAAC;AACpC,OAAO,KAAK,EAAC,cAAc,EAAE,sBAAsB,EAAC,MAAM,aAAa,CAAC;AACxE,OAAO,KAAK,EAAC,mBAAmB,EAAE,gBAAgB,EAAC,MAAM,mBAAmB,CAAC;AAE7E,MAAM,MAAM,eAAe,GAAG;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,IAAI,CAAC;IACf,EAAE,EAAE,OAAO,CAAC;CACb,CAAC;AACF,MAAM,MAAM,IAAI,GAAG;IACjB,UAAU,EAAE,iBAAiB,CAAC;IAC9B,YAAY,EAAE,cAAc,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,YAAY,GAAG;IACzB,UAAU,EAAE,iBAAiB,CAAC;IAC9B,YAAY,EAAE,sBAAsB,CAAC;CACtC,CAAC;AAEF,MAAM,MAAM,aAAa,CAAC,CAAC,SAAS,iBAAiB,GAAG,iBAAiB,IACvE,YAAY,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;;;;;;EAMvB;AAEH,MAAM,MAAM,WAAW,GAAG;IACxB,CAAC,GAAG,EAAE,MAAM,GAAG,CACb,EAAE,EAAE,gBAAgB,EAGpB,IAAI,CAAC,EAAE,GAAG,KACP,aAAa,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,WAAW,CACrB,CAAC,SAAS,CACR,EAAE,EAAE,gBAAgB,EACpB,GAAG,IAAI,EAAE,EAAE,GAAG,CAAC,iBAAiB,CAAC,KAC9B,aAAa,IAChB,CAAC,SAAS,CAAC,EAAE,EAAE,gBAAgB,EAAE,GAAG,IAAI,EAAE,MAAM,IAAI,KAAK,MAAM,GAAG,GAClE,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,SAAS,CAAC,GAAG,CAAC,GACjC,KAAK,CAAC,CAAC;;EAER;AAEH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,WAAW,IAAI;IAChD,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3C,CAAC;AAEF,~~MAAM~~,~~MAAM,~~SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;~~AAEvE~~,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,EAC5B,IAAI,EAAE,CAAC,EAAE,EAAE,mBAAmB,KAAK,YAAY,CAAC,CAAC,CAAC,KAC/C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;;GAEd;AAEH,MAAM,MAAM,kBAAkB,GAC1B;IAKE,IAAI,EAAE,gBAAgB,CAAC;CACxB,GACD;IACE,IAAI,EAAE,qBAAqB,CAAC;IAC5B,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC;CACtD,CAAC"}
1	+ {"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../replicache/src/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,0BAA0B,CAAC;AAChE,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,2BAA2B,CAAC;AAC5D,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,WAAW,CAAC;AACpC,OAAO,KAAK,EAAC,cAAc,EAAE,sBAAsB,EAAC,MAAM,aAAa,CAAC;AACxE,OAAO,KAAK,EAAC,mBAAmB,EAAE,gBAAgB,EAAC,MAAM,mBAAmB,CAAC;AAE7E,MAAM,MAAM,eAAe,GAAG;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,IAAI,CAAC;IACf,EAAE,EAAE,OAAO,CAAC;CACb,CAAC;AACF,MAAM,MAAM,IAAI,GAAG;IACjB,UAAU,EAAE,iBAAiB,CAAC;IAC9B,YAAY,EAAE,cAAc,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,YAAY,GAAG;IACzB,UAAU,EAAE,iBAAiB,CAAC;IAC9B,YAAY,EAAE,sBAAsB,CAAC;CACtC,CAAC;AAEF,MAAM,MAAM,aAAa,CAAC,CAAC,SAAS,iBAAiB,GAAG,iBAAiB,IACvE,YAAY,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;;;;;;EAMvB;AAEH,MAAM,MAAM,WAAW,GAAG;IACxB,CAAC,GAAG,EAAE,MAAM,GAAG,CACb,EAAE,EAAE,gBAAgB,EAGpB,IAAI,CAAC,EAAE,GAAG,KACP,aAAa,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,WAAW,CACrB,CAAC,SAAS,CACR,EAAE,EAAE,gBAAgB,EACpB,GAAG,IAAI,EAAE,EAAE,GAAG,CAAC,iBAAiB,CAAC,KAC9B,aAAa,IAChB,CAAC,SAAS,CAAC,EAAE,EAAE,gBAAgB,EAAE,GAAG,IAAI,EAAE,MAAM,IAAI,KAAK,MAAM,GAAG,GAClE,CAAC,GAAG,IAAI,EAAE,IAAI,KAAK,SAAS,CAAC,GAAG,CAAC,GACjC,KAAK,CAAC,CAAC;;EAER;AAEH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,WAAW,IAAI;IAChD,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3C,CAAC;AAEF,KAAK,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAEhE,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,EAC5B,IAAI,EAAE,CAAC,EAAE,EAAE,mBAAmB,KAAK,YAAY,CAAC,CAAC,CAAC,KAC/C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;;GAEd;AAEH,MAAM,MAAM,kBAAkB,GAC1B;IAKE,IAAI,EAAE,gBAAgB,CAAC;CACxB,GACD;IACE,IAAI,EAAE,qBAAqB,CAAC;IAC5B,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,GAAG,SAAS,CAAC;CACtD,CAAC"}

package/out/shared/src/arrays.js CHANGED Viewed

@@ -20,7 +20,10 @@ function last(arr) {
 var newArray = () => [];
 function groupBy(arr, keyFn) {
 	const groups = /* @__PURE__ */ new Map();
-	for (const el of arr) getOrInsertComputed(groups, keyFn(el), newArray).push(el);
+	for (const el of arr) {
+		const key = keyFn(el);
+		getOrInsertComputed(groups, key, newArray).push(el);
+	}
 	return groups;
 }
 //#endregion

package/out/shared/src/arrays.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"arrays.js","names":[],"sources":["../../../../shared/src/arrays.ts"],"sourcesContent":["import {assert} from './asserts.ts';\nimport {getOrInsertComputed} from './map.ts';\n\n/*\n Returns `arr` as is if none of the elements are `undefined`.\n * Otherwise returns a new array with only defined elements in `arr`.\n /\nexport function defined<T>(arr: (T \| undefined)[]): T[] {\n // avoid an array copy if possible\n let i = arr.findIndex(x => x === undefined);\n if (i < 0) {\n return arr as T[];\n }\n const defined: T[] = arr.slice(0, i) as T[];\n for (i++; i < arr.length; i++) {\n const x = arr[i];\n if (x !== undefined) {\n defined.push(x);\n }\n }\n return defined;\n}\n\nexport function areEqual<T>(arr1: readonly T[], arr2: readonly T[]): boolean {\n return arr1.length === arr2.length && arr1.every((e, i) => e === arr2[i]);\n}\n\nexport function zip<T1, T2>(a1: readonly T1[], a2: readonly T2[]): [T1, T2][] {\n assert(a1.length === a2.length, 'zip: arrays must have equal length');\n const result: [T1, T2][] = [];\n for (let i = 0; i < a1.length; i++) {\n result.push([a1[i], a2[i]]);\n }\n return result;\n}\n\nexport function last<T>(arr: T[]): T \| undefined {\n return arr.at(-1);\n}\n\n/\n Creates an empty array. Pass this to `getOrInsertComputed` instead of an\n * inline `() => []` so that a hit does not allocate a closure.\n */\nexport const newArray = <T>(): T[] => [];\n\nexport function groupBy<T, K>(\n arr: readonly T[],\n keyFn: (el: T) => K,\n): Map<K, T[]> {\n const groups = new Map<K, T[]>();\n for (const el of arr) {\n const key = keyFn(el);\n getOrInsertComputed(groups, key, newArray).push(el);\n }\n return groups;\n}\n"],"mappings":";;;AAuBA,SAAgB,SAAY,MAAoB,MAA6B;CAC3E,OAAO,KAAK,WAAW,KAAK,UAAU,KAAK,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE;AAC1E;AAEA,SAAgB,IAAY,IAAmB,IAA+B;CAC5E,OAAO,GAAG,WAAW,GAAG,QAAQ,oCAAoC;CACpE,MAAM,SAAqB,CAAC;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAC7B,OAAO,KAAK,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;CAE5B,OAAO;AACT;AAEA,SAAgB,KAAQ,KAAyB;CAC/C,OAAO,IAAI,GAAG,EAAE;AAClB;;;;;AAMA,IAAa,iBAAyB,CAAC;AAEvC,SAAgB,QACd,KACA,OACa;CACb,MAAM,yBAAS,IAAI,IAAY;CAC/B,KAAK,MAAM,MAAM,~~KAEf~~,~~oBAAoB~~,~~QADR~~,MAAM,~~EACU~~,~~GAAK~~,QAAQ,~~EAAE~~,KAAK,EAAE;~~CAEpD~~,OAAO;AACT"}
1	+ {"version":3,"file":"arrays.js","names":[],"sources":["../../../../shared/src/arrays.ts"],"sourcesContent":["import {assert} from './asserts.ts';\nimport {getOrInsertComputed} from './map.ts';\n\n/*\n Returns `arr` as is if none of the elements are `undefined`.\n * Otherwise returns a new array with only defined elements in `arr`.\n /\nexport function defined<T>(arr: (T \| undefined)[]): T[] {\n // avoid an array copy if possible\n let i = arr.findIndex(x => x === undefined);\n if (i < 0) {\n return arr as T[];\n }\n const defined: T[] = arr.slice(0, i) as T[];\n for (i++; i < arr.length; i++) {\n const x = arr[i];\n if (x !== undefined) {\n defined.push(x);\n }\n }\n return defined;\n}\n\nexport function areEqual<T>(arr1: readonly T[], arr2: readonly T[]): boolean {\n return arr1.length === arr2.length && arr1.every((e, i) => e === arr2[i]);\n}\n\nexport function zip<T1, T2>(a1: readonly T1[], a2: readonly T2[]): [T1, T2][] {\n assert(a1.length === a2.length, 'zip: arrays must have equal length');\n const result: [T1, T2][] = [];\n for (let i = 0; i < a1.length; i++) {\n result.push([a1[i], a2[i]]);\n }\n return result;\n}\n\nexport function last<T>(arr: T[]): T \| undefined {\n return arr.at(-1);\n}\n\n/\n Creates an empty array. Pass this to `getOrInsertComputed` instead of an\n * inline `() => []` so that a hit does not allocate a closure.\n */\nexport const newArray = <T>(): T[] => [];\n\nexport function groupBy<T, K>(\n arr: readonly T[],\n keyFn: (el: T) => K,\n): Map<K, T[]> {\n const groups = new Map<K, T[]>();\n for (const el of arr) {\n const key = keyFn(el);\n getOrInsertComputed(groups, key, newArray).push(el);\n }\n return groups;\n}\n"],"mappings":";;;AAuBA,SAAgB,SAAY,MAAoB,MAA6B;CAC3E,OAAO,KAAK,WAAW,KAAK,UAAU,KAAK,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE;AAC1E;AAEA,SAAgB,IAAY,IAAmB,IAA+B;CAC5E,OAAO,GAAG,WAAW,GAAG,QAAQ,oCAAoC;CACpE,MAAM,SAAqB,CAAC;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAC7B,OAAO,KAAK,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC;CAE5B,OAAO;AACT;AAEA,SAAgB,KAAQ,KAAyB;CAC/C,OAAO,IAAI,GAAG,EAAE;AAClB;;;;;AAMA,IAAa,iBAAyB,CAAC;AAEvC,SAAgB,QACd,KACA,OACa;CACb,MAAM,yBAAS,IAAI,IAAY;CAC/B,KAAK,MAAM,MAAM,KAAK;EACpB,MAAM,MAAM,MAAM,EAAE;EACpB,oBAAoB,QAAQ,KAAK,QAAQ,CAAC,CAAC,KAAK,EAAE;CACpD;CACA,OAAO;AACT"}

package/out/shared/src/asserts.d.ts CHANGED Viewed

@@ -4,14 +4,9 @@ export declare function assertNumber(v: unknown): asserts v is number;
 export declare function assertBoolean(v: unknown): asserts v is boolean;
 export declare function assertObject(v: unknown): asserts v is Record<string, unknown>;
 export declare function assertArray(v: unknown): asserts v is unknown[];
-export declare function invalidType(v: unknown, t: string): string;
 export declare function throwInvalidType(v: unknown, t: string): never;
 export declare function assertNotNull<T>(v: T | null): asserts v is T;
-export declare function assertUndefined<T>(v: T | undefined, msg?: string): asserts v is T;
 export declare function assertNotUndefined<T>(v: T | undefined, msg?: string): asserts v is T;
-export declare function assertInstanceof<T>(v: unknown, t: new (...args: unknown[]) => T): asserts v is T;
-export declare function assertUint8Array(v: unknown): asserts v is Uint8Array;
 export declare function unreachable(): never;
 export declare function unreachable(v: never): never;
-export declare function notImplemented(): never;
 //# sourceMappingURL=asserts.d.ts.map

package/out/shared/src/asserts.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"asserts.d.ts","sourceRoot":"","sources":["../../../../shared/src/asserts.ts"],"names":[],"mappings":"AAAA,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAI1E;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAE5D;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAE5D;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,CAE9D;AAQD,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAK7E;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,EAAE,CAI9D;~~AAED~~,wBAAgB,~~WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAQzD;AAED,wBAAgB,~~gBAAgB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,KAAK,CAE7D;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAI5D;AAED,wBAAgB,~~eAAe,CAAC,CAAC,EAC/B,CAAC,EAAE,CAAC,GAAG,SAAS,EAChB,GAAG,SAA6B,GAC/B,OAAO,CAAC,CAAC,IAAI,CAAC,CAIhB;AAED,wBAAgB,~~kBAAkB,CAAC,CAAC,EAClC,CAAC,EAAE,CAAC,GAAG,SAAS,EAChB,GAAG,SAAiC,GACnC,OAAO,CAAC,CAAC,IAAI,CAAC,CAIhB;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,CAAC,EAAE,OAAO,EACV,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,GAC/B,OAAO,CAAC,CAAC,IAAI,CAAC,CAIhB;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,UAAU,CAEpE;AAED,wBAAgB,WAAW,IAAI,KAAK,CAAC;AACrC,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC~~;AAK7C,wBAAgB,cAAc,IAAI,KAAK,CAEtC~~"}
1	+ {"version":3,"file":"asserts.d.ts","sourceRoot":"","sources":["../../../../shared/src/asserts.ts"],"names":[],"mappings":"AAAA,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,MAAM,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAI1E;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAE5D;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAE5D;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,CAE9D;AAQD,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAK7E;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,EAAE,CAI9D;AAYD,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,KAAK,CAE7D;AAED,wBAAgB,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAI5D;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,CAAC,EAAE,CAAC,GAAG,SAAS,EAChB,GAAG,SAAiC,GACnC,OAAO,CAAC,CAAC,IAAI,CAAC,CAIhB;AAED,wBAAgB,WAAW,IAAI,KAAK,CAAC;AACrC,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC"}

package/out/shared/src/asserts.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"asserts.js","names":[],"sources":["../../../../shared/src/asserts.ts"],"sourcesContent":["export function assert(b: unknown, msg: string \| (() => string)): asserts b {\n if (!b) {\n throw new Error(typeof msg === 'string' ? msg : msg());\n }\n}\n\nexport function assertString(v: unknown): asserts v is string {\n assertType(v, 'string');\n}\n\nexport function assertNumber(v: unknown): asserts v is number {\n assertType(v, 'number');\n}\n\nexport function assertBoolean(v: unknown): asserts v is boolean {\n assertType(v, 'boolean');\n}\n\nfunction assertType(v: unknown, t: string) {\n if (typeof v !== t) {\n throwInvalidType(v, t);\n }\n}\n\nexport function assertObject(v: unknown): asserts v is Record<string, unknown> {\n if (v === null) {\n throwInvalidType(v, 'object');\n }\n assertType(v, 'object');\n}\n\nexport function assertArray(v: unknown): asserts v is unknown[] {\n if (!Array.isArray(v)) {\n throwInvalidType(v, 'array');\n }\n}\n\~~nexport~~ ~~function~~ invalidType(v: unknown, t: string): string {\n let s = 'Invalid type: ';\n if (v === null \|\| v === undefined) {\n s += v;\n } else {\n s += `${typeof v} \\`${v}\\``;\n }\n return s + `, expected ${t}`;\n}\n\nexport function throwInvalidType(v: unknown, t: string): never {\n throw new Error(invalidType(v, t));\n}\n\nexport function assertNotNull<T>(v: T \| null): asserts v is T {\n if (v === null) {\n throw new Error('Expected non-null value');\n }\n}\n\nexport function ~~assertUndefined<T>(\n v: T \| undefined,\n msg = 'Expected undefined value',\n): asserts v is T {\n if (v !== undefined) {\n throw new Error(msg);\n }\n}\n\nexport function~~ assertNotUndefined<T>(\n v: T \| undefined,\n msg = 'Expected non undefined value',\n): asserts v is T {\n if (v === undefined) {\n throw new Error(msg);\n }\n}\n\nexport function assertInstanceof<T>(\n v: unknown,\n t: new (...args: unknown[]) => T,\n): asserts v is T {\n if (!(v instanceof t)) {\n throw new Error(`Expected instanceof ${t.name}`);\n }\n}\n\nexport function assertUint8Array(v: unknown): asserts v is Uint8Array {\n assertInstanceof(v, Uint8Array);\n}\n\nexport function unreachable(): never;\nexport function unreachable(v: never): never;\nexport function unreachable(_?: never): never {\n throw new Error('Unreachable');\n}\n~~\nexport function notImplemented(): never {\n throw new Error('Not implemented');\n}\n~~"],"mappings":";AAAA,SAAgB,OAAO,GAAY,KAAyC;CAC1E,IAAI,CAAC,GACH,MAAM,IAAI,MAAM,OAAO,QAAQ,WAAW,MAAM,IAAI,CAAC;AAEzD;AAEA,SAAgB,aAAa,GAAiC;CAC5D,WAAW,GAAG,QAAQ;AACxB;AAEA,SAAgB,aAAa,GAAiC;CAC5D,WAAW,GAAG,QAAQ;AACxB;AAEA,SAAgB,cAAc,GAAkC;CAC9D,WAAW,GAAG,SAAS;AACzB;AAEA,SAAS,WAAW,GAAY,GAAW;CACzC,IAAI,OAAO,MAAM,GACf,iBAAiB,GAAG,CAAC;AAEzB;AAEA,SAAgB,aAAa,GAAkD;CAC7E,IAAI,MAAM,MACR,iBAAiB,GAAG,QAAQ;CAE9B,WAAW,GAAG,QAAQ;AACxB;AAEA,SAAgB,YAAY,GAAoC;CAC9D,IAAI,CAAC,MAAM,QAAQ,CAAC,GAClB,iBAAiB,GAAG,OAAO;AAE/B;AAEA,~~SAAgB~~,YAAY,GAAY,GAAmB;~~CACzD~~,IAAI,IAAI;CACR,IAAI,MAAM,QAAQ,MAAM,KAAA,GACtB,KAAK;MAEL,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE;CAE1B,OAAO,IAAI,cAAc;AAC3B;AAEA,SAAgB,iBAAiB,GAAY,GAAkB;CAC7D,MAAM,IAAI,MAAM,YAAY,GAAG,CAAC,CAAC;AACnC;AAEA,SAAgB,cAAiB,GAA6B;CAC5D,IAAI,MAAM,MACR,MAAM,IAAI,MAAM,yBAAyB;AAE7C;~~AAWA~~,SAAgB,mBACd,GACA,MAAM,gCACU;CAChB,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MAAM,GAAG;AAEvB;~~AAiBA~~,SAAgB,YAAY,GAAkB;CAC5C,MAAM,IAAI,MAAM,aAAa;AAC/B"}
1	+ {"version":3,"file":"asserts.js","names":[],"sources":["../../../../shared/src/asserts.ts"],"sourcesContent":["export function assert(b: unknown, msg: string \| (() => string)): asserts b {\n if (!b) {\n throw new Error(typeof msg === 'string' ? msg : msg());\n }\n}\n\nexport function assertString(v: unknown): asserts v is string {\n assertType(v, 'string');\n}\n\nexport function assertNumber(v: unknown): asserts v is number {\n assertType(v, 'number');\n}\n\nexport function assertBoolean(v: unknown): asserts v is boolean {\n assertType(v, 'boolean');\n}\n\nfunction assertType(v: unknown, t: string) {\n if (typeof v !== t) {\n throwInvalidType(v, t);\n }\n}\n\nexport function assertObject(v: unknown): asserts v is Record<string, unknown> {\n if (v === null) {\n throwInvalidType(v, 'object');\n }\n assertType(v, 'object');\n}\n\nexport function assertArray(v: unknown): asserts v is unknown[] {\n if (!Array.isArray(v)) {\n throwInvalidType(v, 'array');\n }\n}\n\nfunction invalidType(v: unknown, t: string): string {\n let s = 'Invalid type: ';\n if (v === null \|\| v === undefined) {\n s += v;\n } else {\n s += `${typeof v} \\`${v}\\``;\n }\n return s + `, expected ${t}`;\n}\n\nexport function throwInvalidType(v: unknown, t: string): never {\n throw new Error(invalidType(v, t));\n}\n\nexport function assertNotNull<T>(v: T \| null): asserts v is T {\n if (v === null) {\n throw new Error('Expected non-null value');\n }\n}\n\nexport function assertNotUndefined<T>(\n v: T \| undefined,\n msg = 'Expected non undefined value',\n): asserts v is T {\n if (v === undefined) {\n throw new Error(msg);\n }\n}\n\nexport function unreachable(): never;\nexport function unreachable(v: never): never;\nexport function unreachable(_?: never): never {\n throw new Error('Unreachable');\n}\n"],"mappings":";AAAA,SAAgB,OAAO,GAAY,KAAyC;CAC1E,IAAI,CAAC,GACH,MAAM,IAAI,MAAM,OAAO,QAAQ,WAAW,MAAM,IAAI,CAAC;AAEzD;AAEA,SAAgB,aAAa,GAAiC;CAC5D,WAAW,GAAG,QAAQ;AACxB;AAEA,SAAgB,aAAa,GAAiC;CAC5D,WAAW,GAAG,QAAQ;AACxB;AAEA,SAAgB,cAAc,GAAkC;CAC9D,WAAW,GAAG,SAAS;AACzB;AAEA,SAAS,WAAW,GAAY,GAAW;CACzC,IAAI,OAAO,MAAM,GACf,iBAAiB,GAAG,CAAC;AAEzB;AAEA,SAAgB,aAAa,GAAkD;CAC7E,IAAI,MAAM,MACR,iBAAiB,GAAG,QAAQ;CAE9B,WAAW,GAAG,QAAQ;AACxB;AAEA,SAAgB,YAAY,GAAoC;CAC9D,IAAI,CAAC,MAAM,QAAQ,CAAC,GAClB,iBAAiB,GAAG,OAAO;AAE/B;AAEA,SAAS,YAAY,GAAY,GAAmB;CAClD,IAAI,IAAI;CACR,IAAI,MAAM,QAAQ,MAAM,KAAA,GACtB,KAAK;MAEL,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE;CAE1B,OAAO,IAAI,cAAc;AAC3B;AAEA,SAAgB,iBAAiB,GAAY,GAAkB;CAC7D,MAAM,IAAI,MAAM,YAAY,GAAG,CAAC,CAAC;AACnC;AAEA,SAAgB,cAAiB,GAA6B;CAC5D,IAAI,MAAM,MACR,MAAM,IAAI,MAAM,yBAAyB;AAE7C;AAEA,SAAgB,mBACd,GACA,MAAM,gCACU;CAChB,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MAAM,GAAG;AAEvB;AAIA,SAAgB,YAAY,GAAkB;CAC5C,MAAM,IAAI,MAAM,aAAa;AAC/B"}

package/out/shared/src/bigint-json.d.ts CHANGED Viewed

@@ -5,6 +5,15 @@ export type JSONObject = {
 };
 export declare const jsonValueSchema: v.Type<JSONValue>;
 export declare const jsonObjectSchema: v.Type<Readonly<Record<string, JSONValue>>>;
+/**
+ * Whether `str` has a run of 16 or more digits. Every such run covers one of
+ * every 16 consecutive indices, so only every 16th char needs to be checked and
+ * a digit there is expanded to its full run. This is several times faster than
+ * `/\d{16}/`, which restarts at every digit of a shorter run.
+ *
+ * A run inside a JSON string also matches; that merely takes the slow path.
+ */
+export declare function hasUnsafeIntegerDigits(str: string): boolean;
 /**
  * Parses JSON strings that may contain arbitrarily large integers. Integers
  * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.

package/out/shared/src/bigint-json.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"bigint-json.d.ts","sourceRoot":"","sources":["../../../../shared/src/bigint-json.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAYjC,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,SAAS,EAAE,GACpB,UAAU,CAAC;AAEf,MAAM,MAAM,UAAU,GAAG;IAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAE1E,eAAO,MAAM,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAY5C,CAAC;AAEH,eAAO,MAAM,gBAAgB,6CAAwC,CAAC;~~AAEtE~~;;;GAGG;AACH,wBAAgB,KAAK,CACnB,GAAG,EAAE,MAAM,EACX,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,KAAK,OAAO,GAC3C,SAAS,~~CAEX~~;AAOD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,OAAO,EACZ,QAAQ,CAAC,EACL,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GACnB,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAC1C,IAAI,EACR,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,UAGzB;AAED,eAAO,MAAM,UAAU;;;CAGb,CAAC"}
1	+ {"version":3,"file":"bigint-json.d.ts","sourceRoot":"","sources":["../../../../shared/src/bigint-json.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,CAAC,MAAM,aAAa,CAAC;AAYjC,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,MAAM,GACN,MAAM,GACN,MAAM,GACN,OAAO,GACP,SAAS,SAAS,EAAE,GACpB,UAAU,CAAC;AAEf,MAAM,MAAM,UAAU,GAAG;IAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;CAAC,CAAC;AAE1E,eAAO,MAAM,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAY5C,CAAC;AAEH,eAAO,MAAM,gBAAgB,6CAAwC,CAAC;AAUtE;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAsB3D;AAED;;;GAGG;AACH,wBAAgB,KAAK,CACnB,GAAG,EAAE,MAAM,EACX,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,KAAK,OAAO,GAC3C,SAAS,CAIX;AAOD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,OAAO,EACZ,QAAQ,CAAC,EACL,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,GACnB,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAC1C,IAAI,EACR,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,UAGzB;AAED,eAAO,MAAM,UAAU;;;CAGb,CAAC"}

package/out/shared/src/bigint-json.js CHANGED Viewed

@@ -17,12 +17,37 @@ var jsonValueSchema = valita_exports.lazy(() => {
 	return valita_exports.union(valita_exports.null(), valita_exports.string(), valita_exports.number(), valita_exports.bigint(), valita_exports.boolean(), readonly(valita_exports.array(jsonValueSchema)), jsonObjectSchema);
 });
 var jsonObjectSchema = readonly(valita_exports.record(jsonValueSchema));
+var UNSAFE_INTEGER_DIGITS = 16;
+function isDigit(c) {
+	return c >= 48 && c <= 57;
+}
+/**
+* Whether `str` has a run of 16 or more digits. Every such run covers one of
+* every 16 consecutive indices, so only every 16th char needs to be checked and
+* a digit there is expanded to its full run. This is several times faster than
+* `/\d{16}/`, which restarts at every digit of a shorter run.
+*
+* A run inside a JSON string also matches; that merely takes the slow path.
+*/
+function hasUnsafeIntegerDigits(str) {
+	const n = str.length;
+	for (let i = 15; i < n; i += UNSAFE_INTEGER_DIGITS) {
+		if (!isDigit(str.charCodeAt(i))) continue;
+		let start = i;
+		while (start > 0 && isDigit(str.charCodeAt(start - 1))) start--;
+		let end = i + 1;
+		while (end < n && isDigit(str.charCodeAt(end))) end++;
+		if (end - start >= UNSAFE_INTEGER_DIGITS) return true;
+		i = end - 1;
+	}
+	return false;
+}
 /**
 * Parses JSON strings that may contain arbitrarily large integers. Integers
 * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.
 */
 function parse$1(str, reviver) {
-	return parse(str, reviver, numberParser);
+	return hasUnsafeIntegerDigits(str) ? parse(str, reviver, numberParser) : JSON.parse(str, reviver);
 }
 function customSerializer(_, v, type) {
 	if (type === "bigint") return v.toString();
@@ -43,6 +68,6 @@ var BigIntJSON = {
 	stringify: stringify$1
 };
 //#endregion
-export { BigIntJSON, jsonObjectSchema, jsonValueSchema, parse$1 as parse, stringify$1 as stringify };
+export { BigIntJSON, hasUnsafeIntegerDigits, jsonObjectSchema, jsonValueSchema, parse$1 as parse, stringify$1 as stringify };
 //# sourceMappingURL=bigint-json.js.map

package/out/shared/src/bigint-json.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"bigint-json.js","names":[],"sources":["../../../../shared/src/bigint-json.ts"],"sourcesContent":["/*\n Background for using `json-custom-numbers`:\n \n https://neon.tech/blog/parsing-json-from-postgres-in-js\n /\nimport {\n parse as customParse,\n stringify as customStringify,\n} from 'json-custom-numbers';\nimport as v from './valita.ts';\n\nfunction numberParser(_: unknown, v: string) {\n const n = +v;\n if (n >= Number.MIN_SAFE_INTEGER && n <= Number.MAX_SAFE_INTEGER) return n;\n if (v.includes('.') \|\| v.includes('e') \|\| v.includes('E')) {\n return n;\n }\n return BigInt(v);\n}\n\n// Variant of postgres.JSONValue adapted to include bigints\nexport type JSONValue =\n \| null\n \| string\n \| number\n \| bigint\n \| boolean\n \| readonly JSONValue[]\n \| JSONObject;\n\nexport type JSONObject = {readonly [prop: string]: JSONValue \| undefined};\n\nexport const jsonValueSchema: v.Type<JSONValue> = v.lazy(() => {\n const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n return v.union(\n v.null(),\n v.string(),\n v.number(),\n v.bigint(),\n v.boolean(),\n v.readonly(v.array(jsonValueSchema)),\n jsonObjectSchema,\n );\n});\n\nexport const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n/*\n Parses JSON strings that may contain arbitrarily large integers. Integers\n * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.\n /\nexport function parse(\n str: string,\n reviver?: (k: string, v: unknown) => unknown,\n): JSONValue {\n return customParse(str, reviver, numberParser);\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nfunction customSerializer(_: string, v: any, type: string) {\n if (type === 'bigint') return v.toString();\n}\n\n/\n Stringifies objects to JSON, supporting objects containing bigint values.\n * Note that the resulting JSON string may not be deserializable by\n * all environments, but it is supported by Postgres. The string should be\n * deserialized with the corresponding {@link parse} method that will represent\n * large numbers as bigints. From there it is up to the application to suitably\n * handle bigints passed to downstream logic.\n */\nexport function stringify(\n obj: unknown,\n replacer?:\n \| (string \| number)[]\n \| ((key: string, value: unknown) => unknown)\n \| null,\n indent?: string \| number,\n) {\n return customStringify(obj, replacer, indent, customSerializer);\n}\n\nexport const BigIntJSON = {\n parse,\n stringify,\n} as const;\n"],"mappings":";;;;;;;;AAWA,SAAS,aAAa,GAAY,GAAW;CAC3C,MAAM,IAAI,CAAC;CACX,IAAI,KAAK,OAAO,oBAAoB,KAAK,OAAO,kBAAkB,OAAO;CACzE,IAAI,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,GACtD,OAAO;CAET,OAAO,OAAO,CAAC;AACjB;AAcA,IAAa,~~kBAAqC~~,eAAE,WAAW;CAC7D,MAAM,~~mBAAmB~~,~~SAAW~~,eAAE,OAAO,eAAe,CAAC;CAE7D,~~OAAO~~,eAAE,~~MACP~~,eAAE,KAAK,~~GACP~~,eAAE,OAAO,~~GACT~~,eAAE,OAAO,~~GACT~~,eAAE,OAAO,~~GACT~~,eAAE,QAAQ,~~GACV~~,~~SAAW~~,eAAE,MAAM,eAAe,CAAC,GACnC,gBACF;AACF,CAAC;AAED,IAAa,~~mBAAmB~~,~~SAAW~~,eAAE,OAAO,eAAe,CAAC~~;;;;;AAMpE~~,SAAgB,QACd,KACA,SACW;CACX,OAAO,MAAY,KAAK,SAAS,YAAY;~~AAC/C~~;AAGA,SAAS,iBAAiB,GAAW,GAAQ,MAAc;CACzD,IAAI,SAAS,UAAU,OAAO,EAAE,SAAS;AAC3C;;;;;;;;;AAUA,~~SAAgB~~,YACd,KACA,UAIA,QACA;CACA,~~OAAO~~,UAAgB,KAAK,UAAU,QAAQ,gBAAgB;AAChE;AAEA,IAAa,aAAa;CACxB,OAAA;CACA,WAAA;AACF"}
1	+ {"version":3,"file":"bigint-json.js","names":["v","v.readonly","parse","customParse","stringify","customStringify"],"sources":["../../../../shared/src/bigint-json.ts"],"sourcesContent":["/*\n Background for using `json-custom-numbers`:\n \n https://neon.tech/blog/parsing-json-from-postgres-in-js\n /\nimport {\n parse as customParse,\n stringify as customStringify,\n} from 'json-custom-numbers';\nimport as v from './valita.ts';\n\nfunction numberParser(_: unknown, v: string) {\n const n = +v;\n if (n >= Number.MIN_SAFE_INTEGER && n <= Number.MAX_SAFE_INTEGER) return n;\n if (v.includes('.') \|\| v.includes('e') \|\| v.includes('E')) {\n return n;\n }\n return BigInt(v);\n}\n\n// Variant of postgres.JSONValue adapted to include bigints\nexport type JSONValue =\n \| null\n \| string\n \| number\n \| bigint\n \| boolean\n \| readonly JSONValue[]\n \| JSONObject;\n\nexport type JSONObject = {readonly [prop: string]: JSONValue \| undefined};\n\nexport const jsonValueSchema: v.Type<JSONValue> = v.lazy(() => {\n const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n return v.union(\n v.null(),\n v.string(),\n v.number(),\n v.bigint(),\n v.boolean(),\n v.readonly(v.array(jsonValueSchema)),\n jsonObjectSchema,\n );\n});\n\nexport const jsonObjectSchema = v.readonly(v.record(jsonValueSchema));\n\n// Integers of up to 15 digits are safe, so only a run of 16 or more digits can\n// be an integer that needs the (much slower) custom number parsing.\nconst UNSAFE_INTEGER_DIGITS = 16;\n\nfunction isDigit(c: number): boolean {\n return c >= 48 && c <= 57;\n}\n\n/*\n Whether `str` has a run of 16 or more digits. Every such run covers one of\n * every 16 consecutive indices, so only every 16th char needs to be checked and\n * a digit there is expanded to its full run. This is several times faster than\n * `/\\d{16}/`, which restarts at every digit of a shorter run.\n \n A run inside a JSON string also matches; that merely takes the slow path.\n /\nexport function hasUnsafeIntegerDigits(str: string): boolean {\n const n = str.length;\n for (let i = UNSAFE_INTEGER_DIGITS - 1; i < n; i += UNSAFE_INTEGER_DIGITS) {\n if (!isDigit(str.charCodeAt(i))) {\n continue;\n }\n let start = i;\n while (start > 0 && isDigit(str.charCodeAt(start - 1))) {\n start--;\n }\n let end = i + 1;\n while (end < n && isDigit(str.charCodeAt(end))) {\n end++;\n }\n if (end - start >= UNSAFE_INTEGER_DIGITS) {\n return true;\n }\n // The next run starts after `end`, and covers one of every 16 indices from\n // there on.\n i = end - 1;\n }\n return false;\n}\n\n/\n Parses JSON strings that may contain arbitrarily large integers. Integers\n * larger than {@link Number.MAX_SAFE_INTEGER} are deserialized as a `bigint`.\n /\nexport function parse(\n str: string,\n reviver?: (k: string, v: unknown) => unknown,\n): JSONValue {\n return hasUnsafeIntegerDigits(str)\n ? customParse(str, reviver, numberParser)\n : JSON.parse(str, reviver);\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nfunction customSerializer(_: string, v: any, type: string) {\n if (type === 'bigint') return v.toString();\n}\n\n/\n Stringifies objects to JSON, supporting objects containing bigint values.\n * Note that the resulting JSON string may not be deserializable by\n * all environments, but it is supported by Postgres. The string should be\n * deserialized with the corresponding {@link parse} method that will represent\n * large numbers as bigints. From there it is up to the application to suitably\n * handle bigints passed to downstream logic.\n */\nexport function stringify(\n obj: unknown,\n replacer?:\n \| (string \| number)[]\n \| ((key: string, value: unknown) => unknown)\n \| null,\n indent?: string \| number,\n) {\n return customStringify(obj, replacer, indent, customSerializer);\n}\n\nexport const BigIntJSON = {\n parse,\n stringify,\n} as const;\n"],"mappings":";;;;;;;;AAWA,SAAS,aAAa,GAAY,GAAW;CAC3C,MAAM,IAAI,CAAC;CACX,IAAI,KAAK,OAAO,oBAAoB,KAAK,OAAO,kBAAkB,OAAO;CACzE,IAAI,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,KAAK,EAAE,SAAS,GAAG,GACtD,OAAO;CAET,OAAO,OAAO,CAAC;AACjB;AAcA,IAAa,kBAAqCA,eAAE,WAAW;CAC7D,MAAM,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;CAE7D,OAAOA,eAAE,MACPA,eAAE,KAAK,GACPA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,OAAO,GACTA,eAAE,QAAQ,GACVC,SAAWD,eAAE,MAAM,eAAe,CAAC,GACnC,gBACF;AACF,CAAC;AAED,IAAa,mBAAmBC,SAAWD,eAAE,OAAO,eAAe,CAAC;AAIpE,IAAM,wBAAwB;AAE9B,SAAS,QAAQ,GAAoB;CACnC,OAAO,KAAK,MAAM,KAAK;AACzB;;;;;;;;;AAUA,SAAgB,uBAAuB,KAAsB;CAC3D,MAAM,IAAI,IAAI;CACd,KAAK,IAAI,IAAI,IAA2B,IAAI,GAAG,KAAK,uBAAuB;EACzE,IAAI,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC,GAC5B;EAEF,IAAI,QAAQ;EACZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,WAAW,QAAQ,CAAC,CAAC,GACnD;EAEF,IAAI,MAAM,IAAI;EACd,OAAO,MAAM,KAAK,QAAQ,IAAI,WAAW,GAAG,CAAC,GAC3C;EAEF,IAAI,MAAM,SAAS,uBACjB,OAAO;EAIT,IAAI,MAAM;CACZ;CACA,OAAO;AACT;;;;;AAMA,SAAgBE,QACd,KACA,SACW;CACX,OAAO,uBAAuB,GAAG,IAC7BC,MAAY,KAAK,SAAS,YAAY,IACtC,KAAK,MAAM,KAAK,OAAO;AAC7B;AAGA,SAAS,iBAAiB,GAAW,GAAQ,MAAc;CACzD,IAAI,SAAS,UAAU,OAAO,EAAE,SAAS;AAC3C;;;;;;;;;AAUA,SAAgBC,YACd,KACA,UAIA,QACA;CACA,OAAOC,UAAgB,KAAK,UAAU,QAAQ,gBAAgB;AAChE;AAEA,IAAa,aAAa;CACxB,OAAA;CACA,WAAA;AACF"}

package/out/shared/src/broadcast-channel.js CHANGED Viewed

@@ -16,6 +16,6 @@ var NoopBroadcastChannel = class {
 };
 var bc = typeof BroadcastChannel === "undefined" ? NoopBroadcastChannel : BroadcastChannel;
 //#endregion
-export { bc };
+export { bc as BroadcastChannel };
 //# sourceMappingURL=broadcast-channel.js.map

package/out/shared/src/browser-env.d.ts CHANGED Viewed

@@ -2,23 +2,6 @@ type GlobalThis = typeof globalThis;
 export declare function overrideBrowserGlobal<T extends keyof GlobalThis>(name: T, value: GlobalThis[T]): void;
 export declare function clearBrowserOverrides(): void;
 export declare function getBrowserGlobal<T extends keyof GlobalThis>(name: T): GlobalThis[T] | undefined;
-/**
- * Returns the global method with the given name, bound to the global object.
- * This is important because some methods (e.g. `requestAnimationFrame`) are not
- * bound to the global object by default.
- *
- * If you end up using {@link getBrowserGlobal} instead in a case like this:
- *
- * ```js
- * this.#raf = getBrowserGlobal('requestAnimationFrame') ?? rafFallback;
- * ...
- * this.#raf(() => ...);
- * ```
- *
- * You will end up with `Uncaught TypeError: Illegal invocation` because `this`
- * is not bound to the global object
- */
-export declare function getBrowserGlobalMethod<T extends keyof GlobalThis>(name: T): GlobalThis[T] | undefined;
 export declare function mustGetBrowserGlobal<T extends keyof GlobalThis>(name: T): GlobalThis[T];
 export {};
 //# sourceMappingURL=browser-env.d.ts.map

package/out/shared/src/browser-env.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"browser-env.d.ts","sourceRoot":"","sources":["../../../../shared/src/browser-env.ts"],"names":[],"mappings":"AAIA,KAAK,UAAU,GAAG,OAAO,UAAU,CAAC;AAIpC,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,MAAM,UAAU,EAC9D,IAAI,EAAE,CAAC,EACP,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,QAGrB;AAED,wBAAgB,qBAAqB,SAEpC;AAED,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,MAAM,UAAU,EACzD,IAAI,EAAE,CAAC,GACN,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAK3B;AAED~~;;;;;;;;;;;;;;;GAeG;AACH~~,wBAAgB,~~sBAAsB,CAAC,CAAC,SAAS,MAAM,UAAU,EAC/D,IAAI,EAAE,CAAC,GACN,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAE3B;AAED,wBAAgB,~~oBAAoB,CAAC,CAAC,SAAS,MAAM,UAAU,EAC7D,IAAI,EAAE,CAAC,GACN,UAAU,CAAC,CAAC,CAAC,CAQf"}
1	+ {"version":3,"file":"browser-env.d.ts","sourceRoot":"","sources":["../../../../shared/src/browser-env.ts"],"names":[],"mappings":"AAIA,KAAK,UAAU,GAAG,OAAO,UAAU,CAAC;AAIpC,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,MAAM,UAAU,EAC9D,IAAI,EAAE,CAAC,EACP,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,QAGrB;AAED,wBAAgB,qBAAqB,SAEpC;AAED,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,MAAM,UAAU,EACzD,IAAI,EAAE,CAAC,GACN,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAK3B;AAED,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,MAAM,UAAU,EAC7D,IAAI,EAAE,CAAC,GACN,UAAU,CAAC,CAAC,CAAC,CAQf"}

package/out/shared/src/browser-env.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"browser-env.js","names":[],"sources":["../../../../shared/src/browser-env.ts"],"sourcesContent":["// Helpers for some objects from the browser environment. These are wrapped in\n// functions because Replicache runs in environments that do not have these\n// objects (such as Web Workers, Deno etc).\n\ntype GlobalThis = typeof globalThis;\n\nconst overrides = new Map<keyof GlobalThis, GlobalThis[keyof GlobalThis]>();\n\nexport function overrideBrowserGlobal<T extends keyof GlobalThis>(\n name: T,\n value: GlobalThis[T],\n) {\n overrides.set(name, value);\n}\n\nexport function clearBrowserOverrides() {\n overrides.clear();\n}\n\nexport function getBrowserGlobal<T extends keyof GlobalThis>(\n name: T,\n): GlobalThis[T] \| undefined {\n if (overrides.has(name)) {\n return overrides.get(name);\n }\n return globalThis[name];\n}\n\n/*\n Returns the global method with the given name, bound to the global object.\n * This is important because some methods (e.g. `requestAnimationFrame`) are not\n * bound to the global object by default.\n \n If you end up using {@link getBrowserGlobal} instead in a case like this:\n \n ```js\n * this.#raf = getBrowserGlobal('requestAnimationFrame') ?? rafFallback;\n * ...\n * this.#raf(() => ...);\n * ```\n \n You will end up with `Uncaught TypeError: Illegal invocation` because `this`\n * is not bound to the global object\n */\nexport function ~~getBrowserGlobalMethod<T extends keyof GlobalThis>(\n name: T,\n): GlobalThis[T] \| undefined {\n return getBrowserGlobal(name)?.bind(globalThis);\n}\n\nexport function~~ mustGetBrowserGlobal<T extends keyof GlobalThis>(\n name: T,\n): GlobalThis[T] {\n const r = getBrowserGlobal(name);\n if (r === undefined) {\n throw new Error(\n `Unsupported JavaScript environment: Could not find ${name}.`,\n );\n }\n return r;\n}\n"],"mappings":";AAMA,IAAM,4BAAY,IAAI,IAAoD;AAa1E,SAAgB,iBACd,MAC2B;CAC3B,IAAI,UAAU,IAAI,IAAI,GACpB,OAAO,UAAU,IAAI,IAAI;CAE3B,OAAO,WAAW;AACpB;~~AAwBA~~,SAAgB,qBACd,MACe;CACf,MAAM,IAAI,iBAAiB,IAAI;CAC/B,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MACR,sDAAsD,KAAK,EAC7D;CAEF,OAAO;AACT"}
1	+ {"version":3,"file":"browser-env.js","names":[],"sources":["../../../../shared/src/browser-env.ts"],"sourcesContent":["// Helpers for some objects from the browser environment. These are wrapped in\n// functions because Replicache runs in environments that do not have these\n// objects (such as Web Workers, Deno etc).\n\ntype GlobalThis = typeof globalThis;\n\nconst overrides = new Map<keyof GlobalThis, GlobalThis[keyof GlobalThis]>();\n\nexport function overrideBrowserGlobal<T extends keyof GlobalThis>(\n name: T,\n value: GlobalThis[T],\n) {\n overrides.set(name, value);\n}\n\nexport function clearBrowserOverrides() {\n overrides.clear();\n}\n\nexport function getBrowserGlobal<T extends keyof GlobalThis>(\n name: T,\n): GlobalThis[T] \| undefined {\n if (overrides.has(name)) {\n return overrides.get(name);\n }\n return globalThis[name];\n}\n\nexport function mustGetBrowserGlobal<T extends keyof GlobalThis>(\n name: T,\n): GlobalThis[T] {\n const r = getBrowserGlobal(name);\n if (r === undefined) {\n throw new Error(\n `Unsupported JavaScript environment: Could not find ${name}.`,\n );\n }\n return r;\n}\n"],"mappings":";AAMA,IAAM,4BAAY,IAAI,IAAoD;AAa1E,SAAgB,iBACd,MAC2B;CAC3B,IAAI,UAAU,IAAI,IAAI,GACpB,OAAO,UAAU,IAAI,IAAI;CAE3B,OAAO,WAAW;AACpB;AAEA,SAAgB,qBACd,MACe;CACf,MAAM,IAAI,iBAAiB,IAAI;CAC/B,IAAI,MAAM,KAAA,GACR,MAAM,IAAI,MACR,sDAAsD,KAAK,EAC7D;CAEF,OAAO;AACT"}

package/out/shared/src/btree-set.js CHANGED Viewed

@@ -175,8 +175,8 @@ var BTreeReverseIterator = class {
 				done: false,
 				value: this.#leaf.keys[this.#i]
 			};
-			let level;
-			for (level = -1;;) {
+			let level = -1;
+			for (;;) {
 				if (++level >= this.#nodeQueue.length) return {
 					done: true,
 					value: void 0
@@ -305,7 +305,8 @@ var BNode = class BNode {
 	}
 	splitOffRightSide() {
 		const half = this.keys.length >> 1;
-		return new BNode(this.keys.splice(half));
+		const keys = this.keys.splice(half);
+		return new BNode(keys);
 	}
 	delete(key, tree) {
 		const cmp = tree.comparator;
@@ -433,12 +434,14 @@ var BNodeInternal = class BNodeInternal extends BNode {
 			keys[i] = children[i].maxKey();
 			return result;
 		} finally {
-			const half = MAX_NODE_SIZE >> 1;
+			const half = 16;
 			if (iLow > 0) iLow--;
-			for (i = iHigh; i >= iLow; i--) if (children[i].keys.length <= half) if (children[i].keys.length !== 0) this.tryMerge(i, MAX_NODE_SIZE);
-			else {
-				keys.splice(i, 1);
-				children.splice(i, 1);
+			for (i = iHigh; i >= iLow; i--) if (children[i].keys.length <= half) {
+				if (children[i].keys.length !== 0) this.tryMerge(i, MAX_NODE_SIZE);
+				else {
+					keys.splice(i, 1);
+					children.splice(i, 1);
+				}
 			}
 		}
 		return false;

package/out/shared/src/btree-set.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"btree-set.js","names":["#root","#delete","#maxKey","#nodeQueue","#nodeIndex","#leaf","#i"],"sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\ntype Comparator<K> = (a: K, b: K) => number;\n\nexport class BTreeSet<K> {\n #root: BNode<K> = emptyLeaf as BNode<K>;\n size: number = 0;\n\n readonly comparator: Comparator<K>;\n\n constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n this.comparator = comparator;\n if (entries) {\n for (const key of entries) {\n this.add(key);\n }\n }\n }\n\n /** Releases the tree so that its size is 0. /\n clear() {\n this.#root = emptyLeaf as BNode<K>;\n this.size = 0;\n }\n\n clone() {\n this.#root.isShared = true;\n const ret = new BTreeSet<K>(this.comparator);\n ret.#root = this.#root;\n ret.size = this.size;\n return ret;\n }\n\n get(key: K): K \| undefined {\n return this.#root.get(key, this);\n }\n\n add(key: K): this {\n if (this.#root.isShared) this.#root = this.#root.clone();\n const result = this.#root.set(key, this);\n if (result === null) return this;\n // Root node has split, so create a new root node.\n this.#root = new BNodeInternal<K>([this.#root, result]);\n return this;\n }\n\n /\n Returns true if the key exists in the B+ tree, false if not.\n * Use get() for best performance; use has() if you need to\n * distinguish between \"undefined value\" and \"key not present\".\n * @param key Key to detect\n * @description Computational complexity: O(log size)\n /\n has(key: K): boolean {\n return this.#root.has(key, this);\n }\n\n /\n Removes a single key-value pair from the B+ tree.\n * @param key Key to find\n * @returns true if a pair was found and removed, false otherwise.\n * @description Computational complexity: O(log size)\n /\n delete(key: K): boolean {\n return this.#delete(key);\n }\n\n #delete(key: K): boolean {\n let root = this.#root;\n if (root.isShared) {\n this.#root = root = root.clone();\n }\n try {\n return root.delete(key, this);\n } finally {\n let isShared;\n while (root.keys.length <= 1 && root.isInternal()) {\n isShared \|\|= root.isShared;\n this.#root = root =\n root.keys.length === 0 ? emptyLeaf : root.children[0];\n }\n // If any ancestor of the new root was shared, the new root must also be shared\n if (isShared) {\n root.isShared = true;\n }\n }\n }\n\n keys(): IterableIterator<K> {\n return valuesFrom(this.#root, this.comparator, undefined, true);\n }\n\n values(): IterableIterator<K> {\n return valuesFrom(this.#root, this.comparator, undefined, true);\n }\n\n valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n }\n\n valuesReversed(): IterableIterator<K> {\n return valuesFromReversed(\n this.#maxKey(),\n this.#root,\n this.comparator,\n undefined,\n true,\n );\n }\n\n valuesFromReversed(\n highestKey?: K,\n inclusive: boolean = true,\n ): IterableIterator<K> {\n return valuesFromReversed(\n this.#maxKey(),\n this.#root,\n this.comparator,\n highestKey,\n inclusive,\n );\n }\n\n /* Gets the highest key in the tree. Complexity: O(1) /\n #maxKey(): K \| undefined {\n return this.#root.maxKey();\n }\n\n [Symbol.iterator](): IterableIterator<K> {\n return this.keys();\n }\n\n /\n Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing\n * the tree bottom-up. The caller must ensure entries are sorted by\n * `comparator`; violating this produces an invalid tree.\n /\n static fromSorted<K>(\n comparator: Comparator<K>,\n sortedEntries: Iterable<K>,\n ): BTreeSet<K> {\n const tree = new BTreeSet<K>(comparator);\n\n // Stream through entries, flushing a leaf node each time we fill MAX_NODE_SIZE keys.\n const leaves: BNode<K>[] = [];\n let currentKeys: K[] = [];\n let size = 0;\n\n for (const key of sortedEntries) {\n currentKeys.push(key);\n if (currentKeys.length === MAX_NODE_SIZE) {\n leaves.push(new BNode<K>(currentKeys));\n currentKeys = [];\n }\n size++;\n }\n\n if (currentKeys.length > 0) {\n leaves.push(new BNode<K>(currentKeys));\n }\n\n if (leaves.length === 0) return tree;\n\n tree.size = size;\n\n if (leaves.length === 1) {\n tree.#root = leaves[0];\n return tree;\n }\n\n // Build internal nodes bottom-up until a single root remains.\n let currentLevel: BNode<K>[] = leaves;\n while (currentLevel.length > 1) {\n const nextLevel: BNodeInternal<K>[] = [];\n for (let i = 0; i < currentLevel.length; i += MAX_NODE_SIZE) {\n nextLevel.push(\n new BNodeInternal<K>(currentLevel.slice(i, i + MAX_NODE_SIZE)),\n );\n }\n currentLevel = nextLevel;\n }\n\n tree.#root = currentLevel[0];\n return tree;\n }\n}\n\nclass BTreeForwardIterator<K> implements IterableIterator<K> {\n readonly #nodeQueue: BNode<K>[][];\n readonly #nodeIndex: number[];\n #leaf: BNode<K>;\n #i: number;\n\n constructor(\n nodeQueue: BNode<K>[][],\n nodeIndex: number[],\n leaf: BNode<K>,\n startI: number,\n ) {\n this.#nodeQueue = nodeQueue;\n this.#nodeIndex = nodeIndex;\n this.#leaf = leaf;\n this.#i = startI;\n }\n\n next(): IteratorResult<K> {\n for (;;) {\n if (++this.#i < this.#leaf.keys.length) {\n return {done: false, value: this.#leaf.keys[this.#i]};\n }\n\n let level = -1;\n for (;;) {\n if (++level >= this.#nodeQueue.length) {\n return {done: true, value: undefined as unknown as K};\n }\n if (++this.#nodeIndex[level] < this.#nodeQueue[level].length) {\n break;\n }\n }\n for (; level > 0; level--) {\n this.#nodeQueue[level - 1] = (\n this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n ).children;\n this.#nodeIndex[level - 1] = 0;\n }\n this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n this.#i = -1;\n }\n }\n\n [Symbol.iterator]() {\n return this;\n }\n}\n\nclass BTreeReverseIterator<K> implements IterableIterator<K> {\n readonly #nodeQueue: BNode<K>[][];\n readonly #nodeIndex: number[];\n #leaf: BNode<K>;\n #i: number;\n\n constructor(\n nodeQueue: BNode<K>[][],\n nodeIndex: number[],\n leaf: BNode<K>,\n startI: number,\n ) {\n this.#nodeQueue = nodeQueue;\n this.#nodeIndex = nodeIndex;\n this.#leaf = leaf;\n this.#i = startI;\n }\n\n next(): IteratorResult<K> {\n for (;;) {\n if (--this.#i >= 0) {\n return {done: false, value: this.#leaf.keys[this.#i]};\n }\n\n let level;\n // Advance to the next leaf node\n for (level = -1; ;) {\n if (++level >= this.#nodeQueue.length) {\n return {done: true, value: undefined as unknown as K};\n }\n if (--this.#nodeIndex[level] >= 0) {\n break;\n }\n }\n for (; level > 0; level--) {\n this.#nodeQueue[level - 1] = (\n this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n ).children;\n this.#nodeIndex[level - 1] = this.#nodeQueue[level - 1].length - 1;\n }\n this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n this.#i = this.#leaf.keys.length;\n }\n }\n\n [Symbol.iterator]() {\n return this;\n }\n}\n\nfunction valuesFrom<K>(\n root: BNode<K>,\n comparator: Comparator<K>,\n lowestKey: K \| undefined,\n inclusive: boolean,\n): IterableIterator<K> {\n const info = findPath(lowestKey, root, comparator);\n if (info === undefined) {\n return iterator<K>(() => ({done: true, value: undefined}));\n }\n\n let [nodeQueue, nodeIndex, leaf] = info;\n let i =\n lowestKey === undefined\n ? -1\n : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n if (\n !inclusive &&\n lowestKey !== undefined &&\n // +1 because we did -1 above.\n i + 1 < leaf.keys.length &&\n comparator(leaf.keys[i + 1], lowestKey) === 0\n ) {\n i++;\n }\n\n return new BTreeForwardIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction valuesFromReversed<K>(\n maxKey: K \| undefined,\n root: BNode<K>,\n comparator: Comparator<K>,\n highestKey: K \| undefined,\n inclusive: boolean,\n): IterableIterator<K> {\n if (highestKey === undefined) {\n highestKey = maxKey;\n if (highestKey === undefined) {\n return iterator<K>(() => ({done: true, value: undefined}));\n } // collection is empty\n }\n let [nodeQueue, nodeIndex, leaf] =\n findPath(highestKey, root, comparator) \|\|\n findPath(maxKey, root, comparator)!;\n assert(\n !nodeQueue[0] \|\| leaf === nodeQueue[0][nodeIndex[0]],\n 'BTreeSet: leaf node mismatch in iteration',\n );\n let i = indexOf(highestKey, leaf.keys, 0, comparator);\n if (\n inclusive &&\n i < leaf.keys.length &&\n comparator(leaf.keys[i], highestKey) <= 0\n ) {\n i++;\n }\n\n return new BTreeReverseIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction findPath<K>(\n key: K \| undefined,\n root: BNode<K>,\n comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] \| undefined {\n let nextNode = root;\n const nodeQueue: BNode<K>[][] = [];\n const nodeIndex: number[] = [];\n\n if (nextNode.isInternal()) {\n for (let d = 0; nextNode.isInternal(); d++) {\n nodeQueue[d] = nextNode.children;\n nodeIndex[d] =\n key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n nextNode = nodeQueue[d][nodeIndex[d]];\n }\n nodeQueue.reverse();\n nodeIndex.reverse();\n }\n return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n return {\n next,\n [Symbol.iterator]() {\n return this;\n },\n };\n}\n\n/* Leaf node / base class. ************************************************/\nclass BNode<K> {\n // If this is an internal node, _keys[i] is the highest key in children[i].\n keys: K[];\n // True if this node might be within multiple `BTree`s (or have multiple parents).\n // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n // This is transitive: if it's true, children are also shared even if `isShared!=true`\n // in those children. (Certain operations will propagate isShared=true to children.)\n isShared: true \| undefined;\n\n constructor(keys: K[]) {\n this.keys = keys;\n this.isShared = undefined;\n }\n\n isInternal(): this is BNodeInternal<K> {\n return false;\n }\n\n maxKey() {\n // oxlint-disable-next-line typescript/no-non-null-assertion\n return this.keys.at(-1)!;\n }\n\n minKey(): K \| undefined {\n return this.keys[0];\n }\n\n clone(): BNode<K> {\n return new BNode<K>(this.keys.slice(0));\n }\n\n get(key: K, tree: BTreeSet<K>): K \| undefined {\n const i = indexOf(key, this.keys, -1, tree.comparator);\n return i < 0 ? undefined : this.keys[i];\n }\n\n has(key: K, tree: BTreeSet<K>): boolean {\n const i = indexOf(key, this.keys, -1, tree.comparator);\n return i >= 0 && i < this.keys.length;\n }\n\n set(key: K, tree: BTreeSet<K>): null \| BNode<K> {\n let i = indexOf(key, this.keys, -1, tree.comparator);\n if (i < 0) {\n // key does not exist yet\n i = ~i;\n tree.size++;\n\n if (this.keys.length < MAX_NODE_SIZE) {\n this.keys.splice(i, 0, key);\n return null;\n }\n // This leaf node is full and must split\n const newRightSibling = this.splitOffRightSide();\n // oxlint-disable-next-line @typescript-eslint/no-this-alias\n let target: BNode<K> = this;\n if (i > this.keys.length) {\n i -= this.keys.length;\n target = newRightSibling;\n }\n // target.#insertInLeaf(i, key);\n target.keys.splice(i, 0, key);\n\n return newRightSibling;\n }\n\n // usually this is a no-op, but some users may wish to edit the key\n this.keys[i] = key;\n return null;\n }\n\n takeFromRight(rhs: BNode<K>) {\n this.keys.push(rhs.keys.shift()!);\n }\n\n takeFromLeft(lhs: BNode<K>) {\n this.keys.unshift(lhs.keys.pop()!);\n }\n\n splitOffRightSide(): BNode<K> {\n const half = this.keys.length >> 1;\n const keys = this.keys.splice(half);\n return new BNode<K>(keys);\n }\n\n delete(key: K, tree: BTreeSet<K>): boolean {\n const cmp = tree.comparator;\n const iLow = indexOf(key, this.keys, -1, cmp);\n const iHigh = iLow + 1;\n\n if (iLow < 0) {\n return false;\n }\n\n const {keys} = this;\n for (let i = iLow; i < iHigh; i++) {\n const key = keys[i];\n\n if (key !== keys[i] \|\| this.isShared === true) {\n throw new Error('BTree illegally changed or cloned in delete');\n }\n\n this.keys.splice(i, 1);\n tree.size--;\n return true;\n }\n\n return false;\n }\n\n mergeSibling(rhs: BNode<K>, _: number) {\n this.keys.push(...rhs.keys);\n }\n}\n\n/ Internal node (non-leaf node) ******************************************/\nclass BNodeInternal<K> extends BNode<K> {\n // Note: conventionally B+ trees have one fewer key than the number of\n // children, but I find it easier to keep the array lengths equal: each\n // keys[i] caches the value of children[i].maxKey().\n children: BNode<K>[];\n\n /\n * This does not mark `children` as shared, so it is the responsibility of the caller\n * to ensure children are either marked shared, or aren't included in another tree.\n /\n constructor(children: BNode<K>[], keys?: K[]) {\n if (!keys) {\n keys = [];\n for (let i = 0; i < children.length; i++) {\n keys[i] = children[i].maxKey();\n }\n }\n super(keys);\n this.children = children;\n }\n\n isInternal(): this is BNodeInternal<K> {\n return true;\n }\n\n clone(): BNode<K> {\n const children = this.children.slice(0);\n for (let i = 0; i < children.length; i++) {\n children[i].isShared = true;\n }\n return new BNodeInternal<K>(children, this.keys.slice(0));\n }\n\n minKey() {\n return this.children[0].minKey();\n }\n\n get(key: K, tree: BTreeSet<K>): K \| undefined {\n const i = indexOf(key, this.keys, 0, tree.comparator);\n const {children} = this;\n return i < children.length ? children[i].get(key, tree) : undefined;\n }\n\n has(key: K, tree: BTreeSet<K>): boolean {\n const i = indexOf(key, this.keys, 0, tree.comparator);\n const {children} = this;\n return i < children.length ? children[i].has(key, tree) : false;\n }\n\n set(key: K, tree: BTreeSet<K>): null \| BNode<K> {\n const c = this.children;\n const cmp = tree.comparator;\n let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n let child = c[i];\n\n if (child.isShared) {\n c[i] = child = child.clone();\n }\n if (child.keys.length >= MAX_NODE_SIZE) {\n // child is full; inserting anything else will cause a split.\n // Shifting an item to the left or right sibling may avoid a split.\n // We can do a shift if the adjacent node is not full and if the\n // current key can still be placed in the same node after the shift.\n let other: BNode<K>;\n if (\n i > 0 &&\n (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n cmp(child.keys[0], key) < 0\n ) {\n if (other.isShared) {\n c[i - 1] = other = other.clone();\n }\n other.takeFromRight(child);\n this.keys[i - 1] = other.maxKey();\n } else if (\n (other = c[i + 1]) !== undefined &&\n other.keys.length < MAX_NODE_SIZE &&\n cmp(child.maxKey(), key) < 0\n ) {\n if (other.isShared) c[i + 1] = other = other.clone();\n other.takeFromLeft(child);\n this.keys[i] = c[i].maxKey();\n }\n }\n\n const result = child.set(key, tree);\n this.keys[i] = child.maxKey();\n if (result === null) return null;\n\n // The child has split and `result` is a new right child... does it fit?\n if (this.keys.length < MAX_NODE_SIZE) {\n // yes\n this.insert(i + 1, result);\n return null;\n }\n // no, we must split also\n const newRightSibling = this.splitOffRightSide();\n // oxlint-disable-next-line @typescript-eslint/no-this-alias\n let target: BNodeInternal<K> = this;\n if (cmp(result.maxKey(), this.maxKey()) > 0) {\n target = newRightSibling;\n i -= this.keys.length;\n }\n target.insert(i + 1, result);\n return newRightSibling;\n }\n\n /\n Inserts `child` at index `i`.\n * This does not mark `child` as shared, so it is the responsibility of the caller\n * to ensure that either child is marked shared, or it is not included in another tree.\n /\n insert(i: number, child: BNode<K>) {\n this.children.splice(i, 0, child);\n this.keys.splice(i, 0, child.maxKey());\n }\n\n /\n Split this node.\n * Modifies this to remove the second half of the items, returning a separate node containing them.\n /\n splitOffRightSide() {\n const half = this.children.length >> 1;\n return new BNodeInternal<K>(\n this.children.splice(half),\n this.keys.splice(half),\n );\n }\n\n takeFromRight(rhs: BNode<K>) {\n this.keys.push(rhs.keys.shift()!);\n this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n }\n\n takeFromLeft(lhs: BNode<K>) {\n this.keys.unshift(lhs.keys.pop()!);\n this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n }\n\n delete(key: K, tree: BTreeSet<K>): boolean {\n const cmp = tree.comparator;\n const {keys} = this;\n const {children} = this;\n let iLow = indexOf(key, this.keys, 0, cmp);\n let i = iLow;\n const iHigh = Math.min(iLow, keys.length - 1);\n if (i <= iHigh) {\n try {\n if (children[i].isShared) {\n children[i] = children[i].clone();\n }\n const result = children[i].delete(key, tree);\n // Note: if children[i] is empty then keys[i]=undefined.\n // This is an invalid state, but it is fixed below.\n keys[i] = children[i].maxKey();\n return result;\n } finally {\n // Deletions may have occurred, so look for opportunities to merge nodes.\n const half = MAX_NODE_SIZE >> 1;\n if (iLow > 0) iLow--;\n for (i = iHigh; i >= iLow; i--) {\n if (children[i].keys.length <= half) {\n if (children[i].keys.length !== 0) {\n this.tryMerge(i, MAX_NODE_SIZE);\n } else {\n // child is empty! delete it!\n keys.splice(i, 1);\n children.splice(i, 1);\n }\n }\n }\n }\n }\n return false;\n }\n\n /* Merges child i with child i+1 if their combined size is not too large /\n tryMerge(i: number, maxSize: number): boolean {\n const {children} = this;\n if (i >= 0 && i + 1 < children.length) {\n if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n if (\n children[i].isShared\n ) // cloned already UNLESS i is outside scan range\n {\n children[i] = children[i].clone();\n }\n children[i].mergeSibling(children[i + 1], maxSize);\n children.splice(i + 1, 1);\n this.keys.splice(i + 1, 1);\n this.keys[i] = children[i].maxKey();\n return true;\n }\n }\n return false;\n }\n\n /\n Move children from `rhs` into this.\n * `rhs` must be part of this tree, and be removed from it after this call\n * (otherwise isShared for its children could be incorrect).\n */\n mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n // assert !this.isShared;\n const oldLength = this.keys.length;\n this.keys.push(...rhs.keys);\n const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n this.children.push(...rhsChildren);\n\n if (rhs.isShared && !this.isShared) {\n // All children of a shared node are implicitly shared, and since their new\n // parent is not shared, they must now be explicitly marked as shared.\n for (let i = 0; i < rhsChildren.length; i++) {\n rhsChildren[i].isShared = true;\n }\n }\n\n // If our children are themselves almost empty due to a mass-delete,\n // they may need to be merged too (but only the oldLength-1 and its\n // right sibling should need this).\n this.tryMerge(oldLength - 1, maxNodeSize);\n }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n key: K,\n keys: K[],\n failXor: number,\n comparator: Comparator<K>,\n): number {\n let lo = 0;\n let hi = keys.length;\n let mid = hi >> 1;\n while (lo < hi) {\n const c = comparator(keys[mid], key);\n if (c < 0) {\n lo = mid + 1;\n } else if (c > 0) {\n // key < keys[mid]\n hi = mid;\n } else if (c === 0) {\n return mid;\n } else {\n // c is NaN or otherwise invalid\n if (key === key) {\n // at least the search key is not NaN\n return keys.length;\n }\n throw new Error('NaN was used as a key');\n }\n mid = (lo + hi) >> 1;\n }\n return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"mappings":";;AAEA,IAAM,gBAAgB;AAItB,IAAa,WAAb,MAAa,SAAY;CACvB,QAAkB;CAClB,OAAe;CAEf;CAEA,YAAY,YAA2B,SAA+B;EACpE,KAAK,aAAa;EAClB,IAAI,SACF,KAAK,MAAM,OAAO,SAChB,KAAK,IAAI,GAAG;CAGlB;;CAGA,QAAQ;EACN,KAAKA,QAAQ;EACb,KAAK,OAAO;CACd;CAEA,QAAQ;EACN,KAAKA,MAAM,WAAW;EACtB,MAAM,MAAM,IAAI,SAAY,KAAK,UAAU;EAC3C,IAAIA,QAAQ,KAAKA;EACjB,IAAI,OAAO,KAAK;EAChB,OAAO;CACT;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAKA,MAAM,IAAI,KAAK,IAAI;CACjC;CAEA,IAAI,KAAc;EAChB,IAAI,KAAKA,MAAM,UAAU,KAAKA,QAAQ,KAAKA,MAAM,MAAM;EACvD,MAAM,SAAS,KAAKA,MAAM,IAAI,KAAK,IAAI;EACvC,IAAI,WAAW,MAAM,OAAO;EAE5B,KAAKA,QAAQ,IAAI,cAAiB,CAAC,KAAKA,OAAO,MAAM,CAAC;EACtD,OAAO;CACT;;;;;;;;CASA,IAAI,KAAiB;EACnB,OAAO,KAAKA,MAAM,IAAI,KAAK,IAAI;CACjC;;;;;;;CAQA,OAAO,KAAiB;EACtB,OAAO,KAAKC,QAAQ,GAAG;CACzB;CAEA,QAAQ,KAAiB;EACvB,IAAI,OAAO,KAAKD;EAChB,IAAI,KAAK,UACP,KAAKA,QAAQ,OAAO,KAAK,MAAM;EAEjC,IAAI;GACF,OAAO,KAAK,OAAO,KAAK,IAAI;EAC9B,UAAU;GACR,IAAI;GACJ,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,WAAW,GAAG;IACjD,aAAa,KAAK;IAClB,KAAKA,QAAQ,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS;GACvD;GAEA,IAAI,UACF,KAAK,WAAW;EAEpB;CACF;CAEA,OAA4B;EAC1B,OAAO,WAAW,KAAKA,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,SAA8B;EAC5B,OAAO,WAAW,KAAKA,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,WAAW,WAAe,YAAqB,MAA2B;EACxE,OAAO,WAAW,KAAKA,OAAO,KAAK,YAAY,WAAW,SAAS;CACrE;CAEA,iBAAsC;EACpC,OAAO,mBACL,KAAKE,QAAQ,GACb,KAAKF,OACL,KAAK,YACL,KAAA,GACA,IACF;CACF;CAEA,mBACE,YACA,YAAqB,MACA;EACrB,OAAO,mBACL,KAAKE,QAAQ,GACb,KAAKF,OACL,KAAK,YACL,YACA,SACF;CACF;;CAGA,UAAyB;EACvB,OAAO,KAAKA,MAAM,OAAO;CAC3B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK;CACnB;;;;;;CAOA,OAAO,WACL,YACA,eACa;EACb,MAAM,OAAO,IAAI,SAAY,UAAU;EAGvC,MAAM,SAAqB,CAAC;EAC5B,IAAI,cAAmB,CAAC;EACxB,IAAI,OAAO;EAEX,KAAK,MAAM,OAAO,eAAe;GAC/B,YAAY,KAAK,GAAG;GACpB,IAAI,YAAY,WAAW,eAAe;IACxC,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;IACrC,cAAc,CAAC;GACjB;GACA;EACF;EAEA,IAAI,YAAY,SAAS,GACvB,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;EAGvC,IAAI,OAAO,WAAW,GAAG,OAAO;EAEhC,KAAK,OAAO;EAEZ,IAAI,OAAO,WAAW,GAAG;GACvB,KAAKA,QAAQ,OAAO;GACpB,OAAO;EACT;EAGA,IAAI,eAA2B;EAC/B,OAAO,aAAa,SAAS,GAAG;GAC9B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,eAC5C,UAAU,KACR,IAAI,cAAiB,aAAa,MAAM,GAAG,IAAI,aAAa,CAAC,CAC/D;GAEF,eAAe;EACjB;EAEA,KAAKA,QAAQ,aAAa;EAC1B,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAKG,aAAa;EAClB,KAAKC,aAAa;EAClB,KAAKC,QAAQ;EACb,KAAKC,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAKA,KAAK,KAAKD,MAAM,KAAK,QAC9B,OAAO;IAAC,MAAM;IAAO,OAAO,KAAKA,MAAM,KAAK,KAAKC;GAAG;GAGtD,IAAI,QAAQ;GACZ,SAAS;IACP,IAAI,EAAE,SAAS,KAAKH,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAKC,WAAW,SAAS,KAAKD,WAAW,OAAO,QACpD;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAKA,WAAW,QAAQ,KACtB,KAAKA,WAAW,OAAO,KAAKC,WAAW,QACvC;IACF,KAAKA,WAAW,QAAQ,KAAK;GAC/B;GACA,KAAKC,QAAQ,KAAKF,WAAW,GAAG,KAAKC,WAAW;GAChD,KAAKE,KAAK;EACZ;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAKH,aAAa;EAClB,KAAKC,aAAa;EAClB,KAAKC,QAAQ;EACb,KAAKC,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAKA,MAAM,GACf,OAAO;IAAC,MAAM;IAAO,OAAO,KAAKD,MAAM,KAAK,KAAKC;GAAG;GAGtD,IAAI;GAEJ,KAAK,QAAQ,MAAO;IAClB,IAAI,EAAE,SAAS,KAAKH,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAKC,WAAW,UAAU,GAC9B;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAKD,WAAW,QAAQ,KACtB,KAAKA,WAAW,OAAO,KAAKC,WAAW,QACvC;IACF,KAAKA,WAAW,QAAQ,KAAK,KAAKD,WAAW,QAAQ,GAAG,SAAS;GACnE;GACA,KAAKE,QAAQ,KAAKF,WAAW,GAAG,KAAKC,WAAW;GAChD,KAAKE,KAAK,KAAKD,MAAM,KAAK;EAC5B;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,SAAS,WACP,MACA,YACA,WACA,WACqB;CACrB,MAAM,OAAO,SAAS,WAAW,MAAM,UAAU;CACjD,IAAI,SAAS,KAAA,GACX,OAAO,gBAAmB;EAAC,MAAM;EAAM,OAAO,KAAA;CAAS,EAAE;CAG3D,IAAI,CAAC,WAAW,WAAW,QAAQ;CACnC,IAAI,IACF,cAAc,KAAA,IACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,UAAU,IAAI;CAErD,IACE,CAAC,aACD,cAAc,KAAA,KAEd,IAAI,IAAI,KAAK,KAAK,UAClB,WAAW,KAAK,KAAK,IAAI,IAAI,SAAS,MAAM,GAE5C;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;CACrB,IAAI,eAAe,KAAA,GAAW;EAC5B,aAAa;EACb,IAAI,eAAe,KAAA,GACjB,OAAO,gBAAmB;GAAC,MAAM;GAAM,OAAO,KAAA;EAAS,EAAE;CAE7D;CACA,IAAI,CAAC,WAAW,WAAW,QACzB,SAAS,YAAY,MAAM,UAAU,KACrC,SAAS,QAAQ,MAAM,UAAU;CACnC,OACE,CAAC,UAAU,MAAM,SAAS,UAAU,GAAG,UAAU,KACjD,2CACF;CACA,IAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,UAAU;CACpD,IACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,IAAI,UAAU,KAAK,GAExC;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,SACP,KACA,MACA,YAC4E;CAC5E,IAAI,WAAW;CACf,MAAM,YAA0B,CAAC;CACjC,MAAM,YAAsB,CAAC;CAE7B,IAAI,SAAS,WAAW,GAAG;EACzB,KAAK,IAAI,IAAI,GAAG,SAAS,WAAW,GAAG,KAAK;GAC1C,UAAU,KAAK,SAAS;GACxB,UAAU,KACR,QAAQ,KAAA,IAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,UAAU;GACnE,IAAI,UAAU,MAAM,UAAU,GAAG,QAAQ;GACzC,WAAW,UAAU,GAAG,UAAU;EACpC;EACA,UAAU,QAAQ;EAClB,UAAU,QAAQ;CACpB;CACA,OAAO;EAAC;EAAW;EAAW;CAAQ;AACxC;AAEA,SAAS,SAAY,MAAoD;CACvE,OAAO;EACL;EACA,CAAC,OAAO,YAAY;GAClB,OAAO;EACT;CACF;AACF;;AAGA,IAAM,QAAN,MAAM,MAAS;CAEb;CAKA;CAEA,YAAY,MAAW;EACrB,KAAK,OAAO;EACZ,KAAK,WAAW,KAAA;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,SAAS;EAEP,OAAO,KAAK,KAAK,GAAG,EAAE;CACxB;CAEA,SAAwB;EACtB,OAAO,KAAK,KAAK;CACnB;CAEA,QAAkB;EAChB,OAAO,IAAI,MAAS,KAAK,KAAK,MAAM,CAAC,CAAC;CACxC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,KAAK;CACvC;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,KAAK,KAAK,IAAI,KAAK,KAAK;CACjC;CAEA,IAAI,KAAQ,MAAoC;EAC9C,IAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACnD,IAAI,IAAI,GAAG;GAET,IAAI,CAAC;GACL,KAAK;GAEL,IAAI,KAAK,KAAK,SAAS,eAAe;IACpC,KAAK,KAAK,OAAO,GAAG,GAAG,GAAG;IAC1B,OAAO;GACT;GAEA,MAAM,kBAAkB,KAAK,kBAAkB;GAE/C,IAAI,SAAmB;GACvB,IAAI,IAAI,KAAK,KAAK,QAAQ;IACxB,KAAK,KAAK,KAAK;IACf,SAAS;GACX;GAEA,OAAO,KAAK,OAAO,GAAG,GAAG,GAAG;GAE5B,OAAO;EACT;EAGA,KAAK,KAAK,KAAK;EACf,OAAO;CACT;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;CAClC;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;CACnC;CAEA,oBAA8B;EAC5B,MAAM,OAAO,KAAK,KAAK,UAAU;EAEjC,OAAO,IAAI,MADE,KAAK,KAAK,OAAO,IACV,CAAI;CAC1B;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG;EAC5C,MAAM,QAAQ,OAAO;EAErB,IAAI,OAAO,GACT,OAAO;EAGT,MAAM,EAAC,SAAQ;EACf,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK;GAGjC,IAFY,KAAK,OAEL,KAAK,MAAM,KAAK,aAAa,MACvC,MAAM,IAAI,MAAM,6CAA6C;GAG/D,KAAK,KAAK,OAAO,GAAG,CAAC;GACrB,KAAK;GACL,OAAO;EACT;EAEA,OAAO;CACT;CAEA,aAAa,KAAe,GAAW;EACrC,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;CAC5B;AACF;;AAGA,IAAM,gBAAN,MAAM,sBAAyB,MAAS;CAItC;;;;;CAMA,YAAY,UAAsB,MAAY;EAC5C,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,KAAK,SAAS,GAAG,OAAO;EAEjC;EACA,MAAM,IAAI;EACV,KAAK,WAAW;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,QAAkB;EAChB,MAAM,WAAW,KAAK,SAAS,MAAM,CAAC;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,SAAS,GAAG,WAAW;EAEzB,OAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC;CAC1D;CAEA,SAAS;EACP,OAAO,KAAK,SAAS,GAAG,OAAO;CACjC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,GAAG,IAAI,KAAK,IAAI,IAAI,KAAA;CAC5D;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,GAAG,IAAI,KAAK,IAAI,IAAI;CAC5D;CAEA,IAAI,KAAQ,MAAoC;EAC9C,MAAM,IAAI,KAAK;EACf,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE,SAAS,CAAC;EAC9D,IAAI,QAAQ,EAAE;EAEd,IAAI,MAAM,UACR,EAAE,KAAK,QAAQ,MAAM,MAAM;EAE7B,IAAI,MAAM,KAAK,UAAU,eAAe;GAKtC,IAAI;GACJ,IACE,IAAI,MACH,QAAQ,EAAE,IAAI,IAAI,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,GAC1B;IACA,IAAI,MAAM,UACR,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IAEjC,MAAM,cAAc,KAAK;IACzB,KAAK,KAAK,IAAI,KAAK,MAAM,OAAO;GAClC,OAAO,KACJ,QAAQ,EAAE,IAAI,QAAQ,KAAA,KACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,OAAO,GAAG,GAAG,IAAI,GAC3B;IACA,IAAI,MAAM,UAAU,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IACnD,MAAM,aAAa,KAAK;IACxB,KAAK,KAAK,KAAK,EAAE,GAAG,OAAO;GAC7B;EACF;EAEA,MAAM,SAAS,MAAM,IAAI,KAAK,IAAI;EAClC,KAAK,KAAK,KAAK,MAAM,OAAO;EAC5B,IAAI,WAAW,MAAM,OAAO;EAG5B,IAAI,KAAK,KAAK,SAAS,eAAe;GAEpC,KAAK,OAAO,IAAI,GAAG,MAAM;GACzB,OAAO;EACT;EAEA,MAAM,kBAAkB,KAAK,kBAAkB;EAE/C,IAAI,SAA2B;EAC/B,IAAI,IAAI,OAAO,OAAO,GAAG,KAAK,OAAO,CAAC,IAAI,GAAG;GAC3C,SAAS;GACT,KAAK,KAAK,KAAK;EACjB;EACA,OAAO,OAAO,IAAI,GAAG,MAAM;EAC3B,OAAO;CACT;;;;;;CAOA,OAAO,GAAW,OAAiB;EACjC,KAAK,SAAS,OAAO,GAAG,GAAG,KAAK;EAChC,KAAK,KAAK,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;CACvC;;;;;CAMA,oBAAoB;EAClB,MAAM,OAAO,KAAK,SAAS,UAAU;EACrC,OAAO,IAAI,cACT,KAAK,SAAS,OAAO,IAAI,GACzB,KAAK,KAAK,OAAO,IAAI,CACvB;CACF;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;EAChC,KAAK,SAAS,KAAM,IAAyB,SAAS,MAAM,CAAE;CAChE;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;EACjC,KAAK,SAAS,QAAS,IAAyB,SAAS,IAAI,CAAE;CACjE;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,EAAC,SAAQ;EACf,MAAM,EAAC,aAAY;EACnB,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG;EACzC,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;EAC5C,IAAI,KAAK,OACP,IAAI;GACF,IAAI,SAAS,GAAG,UACd,SAAS,KAAK,SAAS,GAAG,MAAM;GAElC,MAAM,SAAS,SAAS,GAAG,OAAO,KAAK,IAAI;GAG3C,KAAK,KAAK,SAAS,GAAG,OAAO;GAC7B,OAAO;EACT,UAAU;GAER,MAAM,OAAO,iBAAiB;GAC9B,IAAI,OAAO,GAAG;GACd,KAAK,IAAI,OAAO,KAAK,MAAM,KACzB,IAAI,SAAS,GAAG,KAAK,UAAU,MAC7B,IAAI,SAAS,GAAG,KAAK,WAAW,GAC9B,KAAK,SAAS,GAAG,aAAa;QACzB;IAEL,KAAK,OAAO,GAAG,CAAC;IAChB,SAAS,OAAO,GAAG,CAAC;GACtB;EAGN;EAEF,OAAO;CACT;;CAGA,SAAS,GAAW,SAA0B;EAC5C,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS;OACzB,SAAS,GAAG,KAAK,SAAS,SAAS,IAAI,GAAG,KAAK,UAAU,SAAS;IACpE,IACE,SAAS,GAAG,UAGZ,SAAS,KAAK,SAAS,GAAG,MAAM;IAElC,SAAS,GAAG,aAAa,SAAS,IAAI,IAAI,OAAO;IACjD,SAAS,OAAO,IAAI,GAAG,CAAC;IACxB,KAAK,KAAK,OAAO,IAAI,GAAG,CAAC;IACzB,KAAK,KAAK,KAAK,SAAS,GAAG,OAAO;IAClC,OAAO;GACT;;EAEF,OAAO;CACT;;;;;;CAOA,aAAa,KAAe,aAAqB;EAE/C,MAAM,YAAY,KAAK,KAAK;EAC5B,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;EAC1B,MAAM,cAAe,IAAoC;EACzD,KAAK,SAAS,KAAK,GAAG,WAAW;EAEjC,IAAI,IAAI,YAAY,CAAC,KAAK,UAGxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,YAAY,GAAG,WAAW;EAO9B,KAAK,SAAS,YAAY,GAAG,WAAW;CAC1C;AACF;AAIA,SAAS,QACP,KACA,MACA,SACA,YACQ;CACR,IAAI,KAAK;CACT,IAAI,KAAK,KAAK;CACd,IAAI,MAAM,MAAM;CAChB,OAAO,KAAK,IAAI;EACd,MAAM,IAAI,WAAW,KAAK,MAAM,GAAG;EACnC,IAAI,IAAI,GACN,KAAK,MAAM;OACN,IAAI,IAAI,GAEb,KAAK;OACA,IAAI,MAAM,GACf,OAAO;OACF;GAEL,IAAI,QAAQ,KAEV,OAAO,KAAK;GAEd,MAAM,IAAI,MAAM,uBAAuB;EACzC;EACA,MAAO,KAAK,MAAO;CACrB;CACA,OAAO,MAAM;AACf;AAGA,IAAM,YAAY,IAAI,MAAW,CAAC,CAAC;AACnC,UAAU,WAAW"}
1	+ {"version":3,"file":"btree-set.js","names":[],"sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\ntype Comparator<K> = (a: K, b: K) => number;\n\nexport class BTreeSet<K> {\n #root: BNode<K> = emptyLeaf as BNode<K>;\n size: number = 0;\n\n readonly comparator: Comparator<K>;\n\n constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n this.comparator = comparator;\n if (entries) {\n for (const key of entries) {\n this.add(key);\n }\n }\n }\n\n /** Releases the tree so that its size is 0. /\n clear() {\n this.#root = emptyLeaf as BNode<K>;\n this.size = 0;\n }\n\n clone() {\n this.#root.isShared = true;\n const ret = new BTreeSet<K>(this.comparator);\n ret.#root = this.#root;\n ret.size = this.size;\n return ret;\n }\n\n get(key: K): K \| undefined {\n return this.#root.get(key, this);\n }\n\n add(key: K): this {\n if (this.#root.isShared) this.#root = this.#root.clone();\n const result = this.#root.set(key, this);\n if (result === null) return this;\n // Root node has split, so create a new root node.\n this.#root = new BNodeInternal<K>([this.#root, result]);\n return this;\n }\n\n /\n Returns true if the key exists in the B+ tree, false if not.\n * Use get() for best performance; use has() if you need to\n * distinguish between \"undefined value\" and \"key not present\".\n * @param key Key to detect\n * @description Computational complexity: O(log size)\n /\n has(key: K): boolean {\n return this.#root.has(key, this);\n }\n\n /\n Removes a single key-value pair from the B+ tree.\n * @param key Key to find\n * @returns true if a pair was found and removed, false otherwise.\n * @description Computational complexity: O(log size)\n /\n delete(key: K): boolean {\n return this.#delete(key);\n }\n\n #delete(key: K): boolean {\n let root = this.#root;\n if (root.isShared) {\n this.#root = root = root.clone();\n }\n try {\n return root.delete(key, this);\n } finally {\n let isShared;\n while (root.keys.length <= 1 && root.isInternal()) {\n isShared \|\|= root.isShared;\n this.#root = root =\n root.keys.length === 0 ? emptyLeaf : root.children[0];\n }\n // If any ancestor of the new root was shared, the new root must also be shared\n if (isShared) {\n root.isShared = true;\n }\n }\n }\n\n keys(): IterableIterator<K> {\n return valuesFrom(this.#root, this.comparator, undefined, true);\n }\n\n values(): IterableIterator<K> {\n return valuesFrom(this.#root, this.comparator, undefined, true);\n }\n\n valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n }\n\n valuesReversed(): IterableIterator<K> {\n return valuesFromReversed(\n this.#maxKey(),\n this.#root,\n this.comparator,\n undefined,\n true,\n );\n }\n\n valuesFromReversed(\n highestKey?: K,\n inclusive: boolean = true,\n ): IterableIterator<K> {\n return valuesFromReversed(\n this.#maxKey(),\n this.#root,\n this.comparator,\n highestKey,\n inclusive,\n );\n }\n\n /* Gets the highest key in the tree. Complexity: O(1) /\n #maxKey(): K \| undefined {\n return this.#root.maxKey();\n }\n\n [Symbol.iterator](): IterableIterator<K> {\n return this.keys();\n }\n\n /\n Builds a BTreeSet from a pre-sorted iterable in O(N) by constructing\n * the tree bottom-up. The caller must ensure entries are sorted by\n * `comparator`; violating this produces an invalid tree.\n /\n static fromSorted<K>(\n comparator: Comparator<K>,\n sortedEntries: Iterable<K>,\n ): BTreeSet<K> {\n const tree = new BTreeSet<K>(comparator);\n\n // Stream through entries, flushing a leaf node each time we fill MAX_NODE_SIZE keys.\n const leaves: BNode<K>[] = [];\n let currentKeys: K[] = [];\n let size = 0;\n\n for (const key of sortedEntries) {\n currentKeys.push(key);\n if (currentKeys.length === MAX_NODE_SIZE) {\n leaves.push(new BNode<K>(currentKeys));\n currentKeys = [];\n }\n size++;\n }\n\n if (currentKeys.length > 0) {\n leaves.push(new BNode<K>(currentKeys));\n }\n\n if (leaves.length === 0) return tree;\n\n tree.size = size;\n\n if (leaves.length === 1) {\n tree.#root = leaves[0];\n return tree;\n }\n\n // Build internal nodes bottom-up until a single root remains.\n let currentLevel: BNode<K>[] = leaves;\n while (currentLevel.length > 1) {\n const nextLevel: BNodeInternal<K>[] = [];\n for (let i = 0; i < currentLevel.length; i += MAX_NODE_SIZE) {\n nextLevel.push(\n new BNodeInternal<K>(currentLevel.slice(i, i + MAX_NODE_SIZE)),\n );\n }\n currentLevel = nextLevel;\n }\n\n tree.#root = currentLevel[0];\n return tree;\n }\n}\n\nclass BTreeForwardIterator<K> implements IterableIterator<K> {\n readonly #nodeQueue: BNode<K>[][];\n readonly #nodeIndex: number[];\n #leaf: BNode<K>;\n #i: number;\n\n constructor(\n nodeQueue: BNode<K>[][],\n nodeIndex: number[],\n leaf: BNode<K>,\n startI: number,\n ) {\n this.#nodeQueue = nodeQueue;\n this.#nodeIndex = nodeIndex;\n this.#leaf = leaf;\n this.#i = startI;\n }\n\n next(): IteratorResult<K> {\n for (;;) {\n if (++this.#i < this.#leaf.keys.length) {\n return {done: false, value: this.#leaf.keys[this.#i]};\n }\n\n let level = -1;\n for (;;) {\n if (++level >= this.#nodeQueue.length) {\n return {done: true, value: undefined as unknown as K};\n }\n if (++this.#nodeIndex[level] < this.#nodeQueue[level].length) {\n break;\n }\n }\n for (; level > 0; level--) {\n this.#nodeQueue[level - 1] = (\n this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n ).children;\n this.#nodeIndex[level - 1] = 0;\n }\n this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n this.#i = -1;\n }\n }\n\n [Symbol.iterator]() {\n return this;\n }\n}\n\nclass BTreeReverseIterator<K> implements IterableIterator<K> {\n readonly #nodeQueue: BNode<K>[][];\n readonly #nodeIndex: number[];\n #leaf: BNode<K>;\n #i: number;\n\n constructor(\n nodeQueue: BNode<K>[][],\n nodeIndex: number[],\n leaf: BNode<K>,\n startI: number,\n ) {\n this.#nodeQueue = nodeQueue;\n this.#nodeIndex = nodeIndex;\n this.#leaf = leaf;\n this.#i = startI;\n }\n\n next(): IteratorResult<K> {\n for (;;) {\n if (--this.#i >= 0) {\n return {done: false, value: this.#leaf.keys[this.#i]};\n }\n\n let level;\n // Advance to the next leaf node\n for (level = -1; ;) {\n if (++level >= this.#nodeQueue.length) {\n return {done: true, value: undefined as unknown as K};\n }\n if (--this.#nodeIndex[level] >= 0) {\n break;\n }\n }\n for (; level > 0; level--) {\n this.#nodeQueue[level - 1] = (\n this.#nodeQueue[level][this.#nodeIndex[level]] as BNodeInternal<K>\n ).children;\n this.#nodeIndex[level - 1] = this.#nodeQueue[level - 1].length - 1;\n }\n this.#leaf = this.#nodeQueue[0][this.#nodeIndex[0]];\n this.#i = this.#leaf.keys.length;\n }\n }\n\n [Symbol.iterator]() {\n return this;\n }\n}\n\nfunction valuesFrom<K>(\n root: BNode<K>,\n comparator: Comparator<K>,\n lowestKey: K \| undefined,\n inclusive: boolean,\n): IterableIterator<K> {\n const info = findPath(lowestKey, root, comparator);\n if (info === undefined) {\n return iterator<K>(() => ({done: true, value: undefined}));\n }\n\n let [nodeQueue, nodeIndex, leaf] = info;\n let i =\n lowestKey === undefined\n ? -1\n : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n if (\n !inclusive &&\n lowestKey !== undefined &&\n // +1 because we did -1 above.\n i + 1 < leaf.keys.length &&\n comparator(leaf.keys[i + 1], lowestKey) === 0\n ) {\n i++;\n }\n\n return new BTreeForwardIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction valuesFromReversed<K>(\n maxKey: K \| undefined,\n root: BNode<K>,\n comparator: Comparator<K>,\n highestKey: K \| undefined,\n inclusive: boolean,\n): IterableIterator<K> {\n if (highestKey === undefined) {\n highestKey = maxKey;\n if (highestKey === undefined) {\n return iterator<K>(() => ({done: true, value: undefined}));\n } // collection is empty\n }\n let [nodeQueue, nodeIndex, leaf] =\n findPath(highestKey, root, comparator) \|\|\n findPath(maxKey, root, comparator)!;\n assert(\n !nodeQueue[0] \|\| leaf === nodeQueue[0][nodeIndex[0]],\n 'BTreeSet: leaf node mismatch in iteration',\n );\n let i = indexOf(highestKey, leaf.keys, 0, comparator);\n if (\n inclusive &&\n i < leaf.keys.length &&\n comparator(leaf.keys[i], highestKey) <= 0\n ) {\n i++;\n }\n\n return new BTreeReverseIterator(nodeQueue, nodeIndex, leaf, i);\n}\n\nfunction findPath<K>(\n key: K \| undefined,\n root: BNode<K>,\n comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] \| undefined {\n let nextNode = root;\n const nodeQueue: BNode<K>[][] = [];\n const nodeIndex: number[] = [];\n\n if (nextNode.isInternal()) {\n for (let d = 0; nextNode.isInternal(); d++) {\n nodeQueue[d] = nextNode.children;\n nodeIndex[d] =\n key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n nextNode = nodeQueue[d][nodeIndex[d]];\n }\n nodeQueue.reverse();\n nodeIndex.reverse();\n }\n return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n return {\n next,\n [Symbol.iterator]() {\n return this;\n },\n };\n}\n\n/* Leaf node / base class. ************************************************/\nclass BNode<K> {\n // If this is an internal node, _keys[i] is the highest key in children[i].\n keys: K[];\n // True if this node might be within multiple `BTree`s (or have multiple parents).\n // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n // This is transitive: if it's true, children are also shared even if `isShared!=true`\n // in those children. (Certain operations will propagate isShared=true to children.)\n isShared: true \| undefined;\n\n constructor(keys: K[]) {\n this.keys = keys;\n this.isShared = undefined;\n }\n\n isInternal(): this is BNodeInternal<K> {\n return false;\n }\n\n maxKey() {\n // oxlint-disable-next-line typescript/no-non-null-assertion\n return this.keys.at(-1)!;\n }\n\n minKey(): K \| undefined {\n return this.keys[0];\n }\n\n clone(): BNode<K> {\n return new BNode<K>(this.keys.slice(0));\n }\n\n get(key: K, tree: BTreeSet<K>): K \| undefined {\n const i = indexOf(key, this.keys, -1, tree.comparator);\n return i < 0 ? undefined : this.keys[i];\n }\n\n has(key: K, tree: BTreeSet<K>): boolean {\n const i = indexOf(key, this.keys, -1, tree.comparator);\n return i >= 0 && i < this.keys.length;\n }\n\n set(key: K, tree: BTreeSet<K>): null \| BNode<K> {\n let i = indexOf(key, this.keys, -1, tree.comparator);\n if (i < 0) {\n // key does not exist yet\n i = ~i;\n tree.size++;\n\n if (this.keys.length < MAX_NODE_SIZE) {\n this.keys.splice(i, 0, key);\n return null;\n }\n // This leaf node is full and must split\n const newRightSibling = this.splitOffRightSide();\n // oxlint-disable-next-line @typescript-eslint/no-this-alias\n let target: BNode<K> = this;\n if (i > this.keys.length) {\n i -= this.keys.length;\n target = newRightSibling;\n }\n // target.#insertInLeaf(i, key);\n target.keys.splice(i, 0, key);\n\n return newRightSibling;\n }\n\n // usually this is a no-op, but some users may wish to edit the key\n this.keys[i] = key;\n return null;\n }\n\n takeFromRight(rhs: BNode<K>) {\n this.keys.push(rhs.keys.shift()!);\n }\n\n takeFromLeft(lhs: BNode<K>) {\n this.keys.unshift(lhs.keys.pop()!);\n }\n\n splitOffRightSide(): BNode<K> {\n const half = this.keys.length >> 1;\n const keys = this.keys.splice(half);\n return new BNode<K>(keys);\n }\n\n delete(key: K, tree: BTreeSet<K>): boolean {\n const cmp = tree.comparator;\n const iLow = indexOf(key, this.keys, -1, cmp);\n const iHigh = iLow + 1;\n\n if (iLow < 0) {\n return false;\n }\n\n const {keys} = this;\n for (let i = iLow; i < iHigh; i++) {\n const key = keys[i];\n\n if (key !== keys[i] \|\| this.isShared === true) {\n throw new Error('BTree illegally changed or cloned in delete');\n }\n\n this.keys.splice(i, 1);\n tree.size--;\n return true;\n }\n\n return false;\n }\n\n mergeSibling(rhs: BNode<K>, _: number) {\n this.keys.push(...rhs.keys);\n }\n}\n\n/ Internal node (non-leaf node) ******************************************/\nclass BNodeInternal<K> extends BNode<K> {\n // Note: conventionally B+ trees have one fewer key than the number of\n // children, but I find it easier to keep the array lengths equal: each\n // keys[i] caches the value of children[i].maxKey().\n children: BNode<K>[];\n\n /\n * This does not mark `children` as shared, so it is the responsibility of the caller\n * to ensure children are either marked shared, or aren't included in another tree.\n /\n constructor(children: BNode<K>[], keys?: K[]) {\n if (!keys) {\n keys = [];\n for (let i = 0; i < children.length; i++) {\n keys[i] = children[i].maxKey();\n }\n }\n super(keys);\n this.children = children;\n }\n\n isInternal(): this is BNodeInternal<K> {\n return true;\n }\n\n clone(): BNode<K> {\n const children = this.children.slice(0);\n for (let i = 0; i < children.length; i++) {\n children[i].isShared = true;\n }\n return new BNodeInternal<K>(children, this.keys.slice(0));\n }\n\n minKey() {\n return this.children[0].minKey();\n }\n\n get(key: K, tree: BTreeSet<K>): K \| undefined {\n const i = indexOf(key, this.keys, 0, tree.comparator);\n const {children} = this;\n return i < children.length ? children[i].get(key, tree) : undefined;\n }\n\n has(key: K, tree: BTreeSet<K>): boolean {\n const i = indexOf(key, this.keys, 0, tree.comparator);\n const {children} = this;\n return i < children.length ? children[i].has(key, tree) : false;\n }\n\n set(key: K, tree: BTreeSet<K>): null \| BNode<K> {\n const c = this.children;\n const cmp = tree.comparator;\n let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n let child = c[i];\n\n if (child.isShared) {\n c[i] = child = child.clone();\n }\n if (child.keys.length >= MAX_NODE_SIZE) {\n // child is full; inserting anything else will cause a split.\n // Shifting an item to the left or right sibling may avoid a split.\n // We can do a shift if the adjacent node is not full and if the\n // current key can still be placed in the same node after the shift.\n let other: BNode<K>;\n if (\n i > 0 &&\n (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n cmp(child.keys[0], key) < 0\n ) {\n if (other.isShared) {\n c[i - 1] = other = other.clone();\n }\n other.takeFromRight(child);\n this.keys[i - 1] = other.maxKey();\n } else if (\n (other = c[i + 1]) !== undefined &&\n other.keys.length < MAX_NODE_SIZE &&\n cmp(child.maxKey(), key) < 0\n ) {\n if (other.isShared) c[i + 1] = other = other.clone();\n other.takeFromLeft(child);\n this.keys[i] = c[i].maxKey();\n }\n }\n\n const result = child.set(key, tree);\n this.keys[i] = child.maxKey();\n if (result === null) return null;\n\n // The child has split and `result` is a new right child... does it fit?\n if (this.keys.length < MAX_NODE_SIZE) {\n // yes\n this.insert(i + 1, result);\n return null;\n }\n // no, we must split also\n const newRightSibling = this.splitOffRightSide();\n // oxlint-disable-next-line @typescript-eslint/no-this-alias\n let target: BNodeInternal<K> = this;\n if (cmp(result.maxKey(), this.maxKey()) > 0) {\n target = newRightSibling;\n i -= this.keys.length;\n }\n target.insert(i + 1, result);\n return newRightSibling;\n }\n\n /\n Inserts `child` at index `i`.\n * This does not mark `child` as shared, so it is the responsibility of the caller\n * to ensure that either child is marked shared, or it is not included in another tree.\n /\n insert(i: number, child: BNode<K>) {\n this.children.splice(i, 0, child);\n this.keys.splice(i, 0, child.maxKey());\n }\n\n /\n Split this node.\n * Modifies this to remove the second half of the items, returning a separate node containing them.\n /\n splitOffRightSide() {\n const half = this.children.length >> 1;\n return new BNodeInternal<K>(\n this.children.splice(half),\n this.keys.splice(half),\n );\n }\n\n takeFromRight(rhs: BNode<K>) {\n this.keys.push(rhs.keys.shift()!);\n this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n }\n\n takeFromLeft(lhs: BNode<K>) {\n this.keys.unshift(lhs.keys.pop()!);\n this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n }\n\n delete(key: K, tree: BTreeSet<K>): boolean {\n const cmp = tree.comparator;\n const {keys} = this;\n const {children} = this;\n let iLow = indexOf(key, this.keys, 0, cmp);\n let i = iLow;\n const iHigh = Math.min(iLow, keys.length - 1);\n if (i <= iHigh) {\n try {\n if (children[i].isShared) {\n children[i] = children[i].clone();\n }\n const result = children[i].delete(key, tree);\n // Note: if children[i] is empty then keys[i]=undefined.\n // This is an invalid state, but it is fixed below.\n keys[i] = children[i].maxKey();\n return result;\n } finally {\n // Deletions may have occurred, so look for opportunities to merge nodes.\n const half = MAX_NODE_SIZE >> 1;\n if (iLow > 0) iLow--;\n for (i = iHigh; i >= iLow; i--) {\n if (children[i].keys.length <= half) {\n if (children[i].keys.length !== 0) {\n this.tryMerge(i, MAX_NODE_SIZE);\n } else {\n // child is empty! delete it!\n keys.splice(i, 1);\n children.splice(i, 1);\n }\n }\n }\n }\n }\n return false;\n }\n\n /* Merges child i with child i+1 if their combined size is not too large /\n tryMerge(i: number, maxSize: number): boolean {\n const {children} = this;\n if (i >= 0 && i + 1 < children.length) {\n if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n if (\n children[i].isShared\n ) // cloned already UNLESS i is outside scan range\n {\n children[i] = children[i].clone();\n }\n children[i].mergeSibling(children[i + 1], maxSize);\n children.splice(i + 1, 1);\n this.keys.splice(i + 1, 1);\n this.keys[i] = children[i].maxKey();\n return true;\n }\n }\n return false;\n }\n\n /\n Move children from `rhs` into this.\n * `rhs` must be part of this tree, and be removed from it after this call\n * (otherwise isShared for its children could be incorrect).\n */\n mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n // assert !this.isShared;\n const oldLength = this.keys.length;\n this.keys.push(...rhs.keys);\n const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n this.children.push(...rhsChildren);\n\n if (rhs.isShared && !this.isShared) {\n // All children of a shared node are implicitly shared, and since their new\n // parent is not shared, they must now be explicitly marked as shared.\n for (let i = 0; i < rhsChildren.length; i++) {\n rhsChildren[i].isShared = true;\n }\n }\n\n // If our children are themselves almost empty due to a mass-delete,\n // they may need to be merged too (but only the oldLength-1 and its\n // right sibling should need this).\n this.tryMerge(oldLength - 1, maxNodeSize);\n }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n key: K,\n keys: K[],\n failXor: number,\n comparator: Comparator<K>,\n): number {\n let lo = 0;\n let hi = keys.length;\n let mid = hi >> 1;\n while (lo < hi) {\n const c = comparator(keys[mid], key);\n if (c < 0) {\n lo = mid + 1;\n } else if (c > 0) {\n // key < keys[mid]\n hi = mid;\n } else if (c === 0) {\n return mid;\n } else {\n // c is NaN or otherwise invalid\n if (key === key) {\n // at least the search key is not NaN\n return keys.length;\n }\n throw new Error('NaN was used as a key');\n }\n mid = (lo + hi) >> 1;\n }\n return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"mappings":";;AAEA,IAAM,gBAAgB;AAItB,IAAa,WAAb,MAAa,SAAY;CACvB,QAAkB;CAClB,OAAe;CAEf;CAEA,YAAY,YAA2B,SAA+B;EACpE,KAAK,aAAa;EAClB,IAAI,SACF,KAAK,MAAM,OAAO,SAChB,KAAK,IAAI,GAAG;CAGlB;;CAGA,QAAQ;EACN,KAAK,QAAQ;EACb,KAAK,OAAO;CACd;CAEA,QAAQ;EACN,KAAK,MAAM,WAAW;EACtB,MAAM,MAAM,IAAI,SAAY,KAAK,UAAU;EAC3C,IAAI,QAAQ,KAAK;EACjB,IAAI,OAAO,KAAK;EAChB,OAAO;CACT;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;CAEA,IAAI,KAAc;EAChB,IAAI,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,MAAM,MAAM;EACvD,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK,IAAI;EACvC,IAAI,WAAW,MAAM,OAAO;EAE5B,KAAK,QAAQ,IAAI,cAAiB,CAAC,KAAK,OAAO,MAAM,CAAC;EACtD,OAAO;CACT;;;;;;;;CASA,IAAI,KAAiB;EACnB,OAAO,KAAK,MAAM,IAAI,KAAK,IAAI;CACjC;;;;;;;CAQA,OAAO,KAAiB;EACtB,OAAO,KAAK,QAAQ,GAAG;CACzB;CAEA,QAAQ,KAAiB;EACvB,IAAI,OAAO,KAAK;EAChB,IAAI,KAAK,UACP,KAAK,QAAQ,OAAO,KAAK,MAAM;EAEjC,IAAI;GACF,OAAO,KAAK,OAAO,KAAK,IAAI;EAC9B,UAAU;GACR,IAAI;GACJ,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,WAAW,GAAG;IACjD,aAAa,KAAK;IAClB,KAAK,QAAQ,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS;GACvD;GAEA,IAAI,UACF,KAAK,WAAW;EAEpB;CACF;CAEA,OAA4B;EAC1B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,SAA8B;EAC5B,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,KAAA,GAAW,IAAI;CAChE;CAEA,WAAW,WAAe,YAAqB,MAA2B;EACxE,OAAO,WAAW,KAAK,OAAO,KAAK,YAAY,WAAW,SAAS;CACrE;CAEA,iBAAsC;EACpC,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,KAAA,GACA,IACF;CACF;CAEA,mBACE,YACA,YAAqB,MACA;EACrB,OAAO,mBACL,KAAK,QAAQ,GACb,KAAK,OACL,KAAK,YACL,YACA,SACF;CACF;;CAGA,UAAyB;EACvB,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK;CACnB;;;;;;CAOA,OAAO,WACL,YACA,eACa;EACb,MAAM,OAAO,IAAI,SAAY,UAAU;EAGvC,MAAM,SAAqB,CAAC;EAC5B,IAAI,cAAmB,CAAC;EACxB,IAAI,OAAO;EAEX,KAAK,MAAM,OAAO,eAAe;GAC/B,YAAY,KAAK,GAAG;GACpB,IAAI,YAAY,WAAW,eAAe;IACxC,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;IACrC,cAAc,CAAC;GACjB;GACA;EACF;EAEA,IAAI,YAAY,SAAS,GACvB,OAAO,KAAK,IAAI,MAAS,WAAW,CAAC;EAGvC,IAAI,OAAO,WAAW,GAAG,OAAO;EAEhC,KAAK,OAAO;EAEZ,IAAI,OAAO,WAAW,GAAG;GACvB,KAAK,QAAQ,OAAO;GACpB,OAAO;EACT;EAGA,IAAI,eAA2B;EAC/B,OAAO,aAAa,SAAS,GAAG;GAC9B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,eAC5C,UAAU,KACR,IAAI,cAAiB,aAAa,MAAM,GAAG,IAAI,aAAa,CAAC,CAC/D;GAEF,eAAe;EACjB;EAEA,KAAK,QAAQ,aAAa;EAC1B,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,KAAK,KAAK,MAAM,KAAK,QAC9B,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAAQ;GACZ,SAAS;IACP,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,SAAS,KAAK,WAAW,MAAM,CAAC,QACpD;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK;GAC/B;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK;EACZ;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,IAAM,uBAAN,MAA6D;CAC3D;CACA;CACA;CACA;CAEA,YACE,WACA,WACA,MACA,QACA;EACA,KAAK,aAAa;EAClB,KAAK,aAAa;EAClB,KAAK,QAAQ;EACb,KAAK,KAAK;CACZ;CAEA,OAA0B;EACxB,SAAS;GACP,IAAI,EAAE,KAAK,MAAM,GACf,OAAO;IAAC,MAAM;IAAO,OAAO,KAAK,MAAM,KAAK,KAAK;GAAG;GAGtD,IAAI,QAES;GAAb,SAAoB;IAClB,IAAI,EAAE,SAAS,KAAK,WAAW,QAC7B,OAAO;KAAC,MAAM;KAAM,OAAO,KAAA;IAAyB;IAEtD,IAAI,EAAE,KAAK,WAAW,UAAU,GAC9B;GAEJ;GACA,OAAO,QAAQ,GAAG,SAAS;IACzB,KAAK,WAAW,QAAQ,KACtB,KAAK,WAAW,MAAM,CAAC,KAAK,WAAW,OAAO,CAC9C;IACF,KAAK,WAAW,QAAQ,KAAK,KAAK,WAAW,QAAQ,EAAE,CAAC,SAAS;GACnE;GACA,KAAK,QAAQ,KAAK,WAAW,EAAE,CAAC,KAAK,WAAW;GAChD,KAAK,KAAK,KAAK,MAAM,KAAK;EAC5B;CACF;CAEA,CAAC,OAAO,YAAY;EAClB,OAAO;CACT;AACF;AAEA,SAAS,WACP,MACA,YACA,WACA,WACqB;CACrB,MAAM,OAAO,SAAS,WAAW,MAAM,UAAU;CACjD,IAAI,SAAS,KAAA,GACX,OAAO,gBAAmB;EAAC,MAAM;EAAM,OAAO,KAAA;CAAS,EAAE;CAG3D,IAAI,CAAC,WAAW,WAAW,QAAQ;CACnC,IAAI,IACF,cAAc,KAAA,IACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,UAAU,IAAI;CAErD,IACE,CAAC,aACD,cAAc,KAAA,KAEd,IAAI,IAAI,KAAK,KAAK,UAClB,WAAW,KAAK,KAAK,IAAI,IAAI,SAAS,MAAM,GAE5C;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;CACrB,IAAI,eAAe,KAAA,GAAW;EAC5B,aAAa;EACb,IAAI,eAAe,KAAA,GACjB,OAAO,gBAAmB;GAAC,MAAM;GAAM,OAAO,KAAA;EAAS,EAAE;CAE7D;CACA,IAAI,CAAC,WAAW,WAAW,QACzB,SAAS,YAAY,MAAM,UAAU,KACrC,SAAS,QAAQ,MAAM,UAAU;CACnC,OACE,CAAC,UAAU,MAAM,SAAS,UAAU,EAAE,CAAC,UAAU,KACjD,2CACF;CACA,IAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,UAAU;CACpD,IACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,IAAI,UAAU,KAAK,GAExC;CAGF,OAAO,IAAI,qBAAqB,WAAW,WAAW,MAAM,CAAC;AAC/D;AAEA,SAAS,SACP,KACA,MACA,YAC4E;CAC5E,IAAI,WAAW;CACf,MAAM,YAA0B,CAAC;CACjC,MAAM,YAAsB,CAAC;CAE7B,IAAI,SAAS,WAAW,GAAG;EACzB,KAAK,IAAI,IAAI,GAAG,SAAS,WAAW,GAAG,KAAK;GAC1C,UAAU,KAAK,SAAS;GACxB,UAAU,KACR,QAAQ,KAAA,IAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,UAAU;GACnE,IAAI,UAAU,MAAM,UAAU,EAAE,CAAC,QAAQ;GACzC,WAAW,UAAU,EAAE,CAAC,UAAU;EACpC;EACA,UAAU,QAAQ;EAClB,UAAU,QAAQ;CACpB;CACA,OAAO;EAAC;EAAW;EAAW;CAAQ;AACxC;AAEA,SAAS,SAAY,MAAoD;CACvE,OAAO;EACL;EACA,CAAC,OAAO,YAAY;GAClB,OAAO;EACT;CACF;AACF;;AAGA,IAAM,QAAN,MAAM,MAAS;CAEb;CAKA;CAEA,YAAY,MAAW;EACrB,KAAK,OAAO;EACZ,KAAK,WAAW,KAAA;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,SAAS;EAEP,OAAO,KAAK,KAAK,GAAG,EAAE;CACxB;CAEA,SAAwB;EACtB,OAAO,KAAK,KAAK;CACnB;CAEA,QAAkB;EAChB,OAAO,IAAI,MAAS,KAAK,KAAK,MAAM,CAAC,CAAC;CACxC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,IAAI,IAAI,KAAA,IAAY,KAAK,KAAK;CACvC;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACrD,OAAO,KAAK,KAAK,IAAI,KAAK,KAAK;CACjC;CAEA,IAAI,KAAQ,MAAoC;EAC9C,IAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;EACnD,IAAI,IAAI,GAAG;GAET,IAAI,CAAC;GACL,KAAK;GAEL,IAAI,KAAK,KAAK,SAAS,eAAe;IACpC,KAAK,KAAK,OAAO,GAAG,GAAG,GAAG;IAC1B,OAAO;GACT;GAEA,MAAM,kBAAkB,KAAK,kBAAkB;GAE/C,IAAI,SAAmB;GACvB,IAAI,IAAI,KAAK,KAAK,QAAQ;IACxB,KAAK,KAAK,KAAK;IACf,SAAS;GACX;GAEA,OAAO,KAAK,OAAO,GAAG,GAAG,GAAG;GAE5B,OAAO;EACT;EAGA,KAAK,KAAK,KAAK;EACf,OAAO;CACT;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;CAClC;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;CACnC;CAEA,oBAA8B;EAC5B,MAAM,OAAO,KAAK,KAAK,UAAU;EACjC,MAAM,OAAO,KAAK,KAAK,OAAO,IAAI;EAClC,OAAO,IAAI,MAAS,IAAI;CAC1B;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG;EAC5C,MAAM,QAAQ,OAAO;EAErB,IAAI,OAAO,GACT,OAAO;EAGT,MAAM,EAAC,SAAQ;EACf,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK;GAGjC,IAFY,KAAK,OAEL,KAAK,MAAM,KAAK,aAAa,MACvC,MAAM,IAAI,MAAM,6CAA6C;GAG/D,KAAK,KAAK,OAAO,GAAG,CAAC;GACrB,KAAK;GACL,OAAO;EACT;EAEA,OAAO;CACT;CAEA,aAAa,KAAe,GAAW;EACrC,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;CAC5B;AACF;;AAGA,IAAM,gBAAN,MAAM,sBAAyB,MAAS;CAItC;;;;;CAMA,YAAY,UAAsB,MAAY;EAC5C,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;EAEjC;EACA,MAAM,IAAI;EACV,KAAK,WAAW;CAClB;CAEA,aAAuC;EACrC,OAAO;CACT;CAEA,QAAkB;EAChB,MAAM,WAAW,KAAK,SAAS,MAAM,CAAC;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,SAAS,EAAE,CAAC,WAAW;EAEzB,OAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC;CAC1D;CAEA,SAAS;EACP,OAAO,KAAK,SAAS,EAAE,CAAC,OAAO;CACjC;CAEA,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI,KAAA;CAC5D;CAEA,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;EACpD,MAAM,EAAC,aAAY;EACnB,OAAO,IAAI,SAAS,SAAS,SAAS,EAAE,CAAC,IAAI,KAAK,IAAI,IAAI;CAC5D;CAEA,IAAI,KAAQ,MAAoC;EAC9C,MAAM,IAAI,KAAK;EACf,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE,SAAS,CAAC;EAC9D,IAAI,QAAQ,EAAE;EAEd,IAAI,MAAM,UACR,EAAE,KAAK,QAAQ,MAAM,MAAM;EAE7B,IAAI,MAAM,KAAK,UAAU,eAAe;GAKtC,IAAI;GACJ,IACE,IAAI,MACH,QAAQ,EAAE,IAAI,GAAA,CAAI,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,GAC1B;IACA,IAAI,MAAM,UACR,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IAEjC,MAAM,cAAc,KAAK;IACzB,KAAK,KAAK,IAAI,KAAK,MAAM,OAAO;GAClC,OAAO,KACJ,QAAQ,EAAE,IAAI,QAAQ,KAAA,KACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,OAAO,GAAG,GAAG,IAAI,GAC3B;IACA,IAAI,MAAM,UAAU,EAAE,IAAI,KAAK,QAAQ,MAAM,MAAM;IACnD,MAAM,aAAa,KAAK;IACxB,KAAK,KAAK,KAAK,EAAE,EAAE,CAAC,OAAO;GAC7B;EACF;EAEA,MAAM,SAAS,MAAM,IAAI,KAAK,IAAI;EAClC,KAAK,KAAK,KAAK,MAAM,OAAO;EAC5B,IAAI,WAAW,MAAM,OAAO;EAG5B,IAAI,KAAK,KAAK,SAAS,eAAe;GAEpC,KAAK,OAAO,IAAI,GAAG,MAAM;GACzB,OAAO;EACT;EAEA,MAAM,kBAAkB,KAAK,kBAAkB;EAE/C,IAAI,SAA2B;EAC/B,IAAI,IAAI,OAAO,OAAO,GAAG,KAAK,OAAO,CAAC,IAAI,GAAG;GAC3C,SAAS;GACT,KAAK,KAAK,KAAK;EACjB;EACA,OAAO,OAAO,IAAI,GAAG,MAAM;EAC3B,OAAO;CACT;;;;;;CAOA,OAAO,GAAW,OAAiB;EACjC,KAAK,SAAS,OAAO,GAAG,GAAG,KAAK;EAChC,KAAK,KAAK,OAAO,GAAG,GAAG,MAAM,OAAO,CAAC;CACvC;;;;;CAMA,oBAAoB;EAClB,MAAM,OAAO,KAAK,SAAS,UAAU;EACrC,OAAO,IAAI,cACT,KAAK,SAAS,OAAO,IAAI,GACzB,KAAK,KAAK,OAAO,IAAI,CACvB;CACF;CAEA,cAAc,KAAe;EAC3B,KAAK,KAAK,KAAK,IAAI,KAAK,MAAM,CAAE;EAChC,KAAK,SAAS,KAAM,IAAyB,SAAS,MAAM,CAAE;CAChE;CAEA,aAAa,KAAe;EAC1B,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,CAAE;EACjC,KAAK,SAAS,QAAS,IAAyB,SAAS,IAAI,CAAE;CACjE;CAEA,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,EAAC,SAAQ;EACf,MAAM,EAAC,aAAY;EACnB,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG;EACzC,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;EAC5C,IAAI,KAAK,OACP,IAAI;GACF,IAAI,SAAS,EAAE,CAAC,UACd,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;GAElC,MAAM,SAAS,SAAS,EAAE,CAAC,OAAO,KAAK,IAAI;GAG3C,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;GAC7B,OAAO;EACT,UAAU;GAER,MAAM,OAAO;GACb,IAAI,OAAO,GAAG;GACd,KAAK,IAAI,OAAO,KAAK,MAAM,KACzB,IAAI,SAAS,EAAE,CAAC,KAAK,UAAU,MAAM;IACnC,IAAI,SAAS,EAAE,CAAC,KAAK,WAAW,GAC9B,KAAK,SAAS,GAAG,aAAa;SACzB;KAEL,KAAK,OAAO,GAAG,CAAC;KAChB,SAAS,OAAO,GAAG,CAAC;IACtB;GACF;EAEJ;EAEF,OAAO;CACT;;CAGA,SAAS,GAAW,SAA0B;EAC5C,MAAM,EAAC,aAAY;EACnB,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS,QACzB;OAAA,SAAS,EAAE,CAAC,KAAK,SAAS,SAAS,IAAI,EAAE,CAAC,KAAK,UAAU,SAAS;IACpE,IACE,SAAS,EAAE,CAAC,UAGZ,SAAS,KAAK,SAAS,EAAE,CAAC,MAAM;IAElC,SAAS,EAAE,CAAC,aAAa,SAAS,IAAI,IAAI,OAAO;IACjD,SAAS,OAAO,IAAI,GAAG,CAAC;IACxB,KAAK,KAAK,OAAO,IAAI,GAAG,CAAC;IACzB,KAAK,KAAK,KAAK,SAAS,EAAE,CAAC,OAAO;IAClC,OAAO;GACT;;EAEF,OAAO;CACT;;;;;;CAOA,aAAa,KAAe,aAAqB;EAE/C,MAAM,YAAY,KAAK,KAAK;EAC5B,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI;EAC1B,MAAM,cAAe,IAAoC;EACzD,KAAK,SAAS,KAAK,GAAG,WAAW;EAEjC,IAAI,IAAI,YAAY,CAAC,KAAK,UAGxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,YAAY,EAAE,CAAC,WAAW;EAO9B,KAAK,SAAS,YAAY,GAAG,WAAW;CAC1C;AACF;AAIA,SAAS,QACP,KACA,MACA,SACA,YACQ;CACR,IAAI,KAAK;CACT,IAAI,KAAK,KAAK;CACd,IAAI,MAAM,MAAM;CAChB,OAAO,KAAK,IAAI;EACd,MAAM,IAAI,WAAW,KAAK,MAAM,GAAG;EACnC,IAAI,IAAI,GACN,KAAK,MAAM;OACN,IAAI,IAAI,GAEb,KAAK;OACA,IAAI,MAAM,GACf,OAAO;OACF;GAEL,IAAI,QAAQ,KAEV,OAAO,KAAK;GAEd,MAAM,IAAI,MAAM,uBAAuB;EACzC;EACA,MAAO,KAAK,MAAO;CACrB;CACA,OAAO,MAAM;AACf;AAGA,IAAM,YAAY,IAAI,MAAW,CAAC,CAAC;AACnC,UAAU,WAAW"}

package/out/shared/src/cache.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"cache.js","names":[~~"#cache","#ttlMs","#destroyed","#intervalHandle","#removeExpired"~~],"sources":["../../../../shared/src/cache.ts"],"sourcesContent":["/*\n Stores values with an expiration time at time of insertion.\n * Does not update the expiration time on retrieval.\n * Values are automatically removed from the cache after the TTL expires.\n * The cache is cleaned up periodically based on the TTL so it does\n * not grow indefinitely. The cleanup interval is started lazily on the\n * first `set()` and is `unref`ed (where supported) so it never keeps\n * the process alive.\n \n Call `destroy()` to stop the cleanup interval and release the cached\n * values. `destroy()` is idempotent, and a destroyed cache is inert:\n * `get()` always misses, `set()` is a no-op, and the cleanup interval\n * is never restarted.\n /\nexport class TimedCache<T> {\n readonly #cache: Map<string, {value: T; expiresAt: number}>;\n readonly #ttlMs: number;\n #intervalHandle: ReturnType<typeof setInterval> \| undefined;\n #destroyed = false;\n\n constructor(ttlMs: number) {\n this.#cache = new Map();\n this.#ttlMs = ttlMs;\n }\n\n set(key: string, value: T): void {\n if (this.#destroyed) {\n return;\n }\n if (this.#intervalHandle === undefined) {\n this.#intervalHandle = setInterval(\n () => this.#removeExpired(),\n this.#ttlMs 2,\n );\n // In browsers setInterval returns a number, which has no unref.\n this.#intervalHandle.unref?.();\n }\n this.#cache.set(key, {value, expiresAt: Date.now() + this.#ttlMs});\n }\n\n get(key: string): T \| undefined {\n const entry = this.#cache.get(key);\n if (entry === undefined \|\| entry.expiresAt < Date.now()) {\n this.#cache.delete(key);\n return undefined;\n }\n return entry.value;\n }\n\n #removeExpired(): void {\n const now = Date.now();\n for (const [key, entry] of this.#cache.entries()) {\n if (entry.expiresAt < now) {\n this.#cache.delete(key);\n }\n }\n }\n\n destroy(): void {\n this.#destroyed = true;\n if (this.#intervalHandle !== undefined) {\n clearInterval(this.#intervalHandle);\n this.#intervalHandle = undefined;\n }\n this.#cache.clear();\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,IAAa,aAAb,MAA2B;CACzB;CACA;CACA;CACA,aAAa;CAEb,YAAY,OAAe;EACzB,~~KAAKA~~,yBAAS,IAAI,IAAI;EACtB,~~KAAKC~~,SAAS;CAChB;CAEA,IAAI,KAAa,OAAgB;EAC/B,IAAI,~~KAAKC~~,YACP;EAEF,IAAI,~~KAAKC~~,oBAAoB,KAAA,GAAW;GACtC,~~KAAKA~~,kBAAkB,kBACf,~~KAAKC~~,eAAe,GAC1B,~~KAAKH~~,SAAS,CAChB;GAEA,~~KAAKE~~,gBAAgB,QAAQ;EAC/B;EACA,~~KAAKH~~,OAAO,IAAI,KAAK;GAAC;GAAO,WAAW,KAAK,IAAI,IAAI,~~KAAKC~~;EAAM,CAAC;CACnE;CAEA,IAAI,KAA4B;EAC9B,MAAM,QAAQ,~~KAAKD~~,OAAO,IAAI,GAAG;EACjC,IAAI,UAAU,KAAA,KAAa,MAAM,YAAY,KAAK,IAAI,GAAG;GACvD,~~KAAKA~~,OAAO,OAAO,GAAG;GACtB;EACF;EACA,OAAO,MAAM;CACf;CAEA,iBAAuB;EACrB,MAAM,MAAM,KAAK,IAAI;EACrB,KAAK,MAAM,CAAC,KAAK,UAAU,~~KAAKA~~,OAAO,QAAQ,GAC7C,IAAI,MAAM,YAAY,KACpB,~~KAAKA~~,OAAO,OAAO,GAAG;CAG5B;CAEA,UAAgB;EACd,~~KAAKE~~,aAAa;EAClB,IAAI,~~KAAKC~~,oBAAoB,KAAA,GAAW;GACtC,cAAc,~~KAAKA~~,eAAe;GAClC,~~KAAKA~~,kBAAkB,KAAA;EACzB;EACA,~~KAAKH~~,OAAO,MAAM;CACpB;AACF"}
1	+ {"version":3,"file":"cache.js","names":[],"sources":["../../../../shared/src/cache.ts"],"sourcesContent":["/*\n Stores values with an expiration time at time of insertion.\n * Does not update the expiration time on retrieval.\n * Values are automatically removed from the cache after the TTL expires.\n * The cache is cleaned up periodically based on the TTL so it does\n * not grow indefinitely. The cleanup interval is started lazily on the\n * first `set()` and is `unref`ed (where supported) so it never keeps\n * the process alive.\n \n Call `destroy()` to stop the cleanup interval and release the cached\n * values. `destroy()` is idempotent, and a destroyed cache is inert:\n * `get()` always misses, `set()` is a no-op, and the cleanup interval\n * is never restarted.\n /\nexport class TimedCache<T> {\n readonly #cache: Map<string, {value: T; expiresAt: number}>;\n readonly #ttlMs: number;\n #intervalHandle: ReturnType<typeof setInterval> \| undefined;\n #destroyed = false;\n\n constructor(ttlMs: number) {\n this.#cache = new Map();\n this.#ttlMs = ttlMs;\n }\n\n set(key: string, value: T): void {\n if (this.#destroyed) {\n return;\n }\n if (this.#intervalHandle === undefined) {\n this.#intervalHandle = setInterval(\n () => this.#removeExpired(),\n this.#ttlMs 2,\n );\n // In browsers setInterval returns a number, which has no unref.\n this.#intervalHandle.unref?.();\n }\n this.#cache.set(key, {value, expiresAt: Date.now() + this.#ttlMs});\n }\n\n get(key: string): T \| undefined {\n const entry = this.#cache.get(key);\n if (entry === undefined \|\| entry.expiresAt < Date.now()) {\n this.#cache.delete(key);\n return undefined;\n }\n return entry.value;\n }\n\n #removeExpired(): void {\n const now = Date.now();\n for (const [key, entry] of this.#cache.entries()) {\n if (entry.expiresAt < now) {\n this.#cache.delete(key);\n }\n }\n }\n\n destroy(): void {\n this.#destroyed = true;\n if (this.#intervalHandle !== undefined) {\n clearInterval(this.#intervalHandle);\n this.#intervalHandle = undefined;\n }\n this.#cache.clear();\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,IAAa,aAAb,MAA2B;CACzB;CACA;CACA;CACA,aAAa;CAEb,YAAY,OAAe;EACzB,KAAK,yBAAS,IAAI,IAAI;EACtB,KAAK,SAAS;CAChB;CAEA,IAAI,KAAa,OAAgB;EAC/B,IAAI,KAAK,YACP;EAEF,IAAI,KAAK,oBAAoB,KAAA,GAAW;GACtC,KAAK,kBAAkB,kBACf,KAAK,eAAe,GAC1B,KAAK,SAAS,CAChB;GAEA,KAAK,gBAAgB,QAAQ;EAC/B;EACA,KAAK,OAAO,IAAI,KAAK;GAAC;GAAO,WAAW,KAAK,IAAI,IAAI,KAAK;EAAM,CAAC;CACnE;CAEA,IAAI,KAA4B;EAC9B,MAAM,QAAQ,KAAK,OAAO,IAAI,GAAG;EACjC,IAAI,UAAU,KAAA,KAAa,MAAM,YAAY,KAAK,IAAI,GAAG;GACvD,KAAK,OAAO,OAAO,GAAG;GACtB;EACF;EACA,OAAO,MAAM;CACf;CAEA,iBAAuB;EACrB,MAAM,MAAM,KAAK,IAAI;EACrB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,OAAO,QAAQ,GAC7C,IAAI,MAAM,YAAY,KACpB,KAAK,OAAO,OAAO,GAAG;CAG5B;CAEA,UAAgB;EACd,KAAK,aAAa;EAClB,IAAI,KAAK,oBAAoB,KAAA,GAAW;GACtC,cAAc,KAAK,eAAe;GAClC,KAAK,kBAAkB,KAAA;EACzB;EACA,KAAK,OAAO,MAAM;CACpB;AACF"}

package/out/shared/src/config.js CHANGED Viewed

@@ -1,6 +1,6 @@
 //#region ../shared/src/config.ts
 var isProd = process.env.NODE_ENV === "production";
 //#endregion
-export { isProd };
+export { isProd, isProd as skipAssertJSONValue };
 //# sourceMappingURL=config.js.map

package/out/shared/src/custom-key-map.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"custom-key-map.js","names":[~~"#toKey","#map"~~],"sources":["../../../../shared/src/custom-key-map.ts"],"sourcesContent":["type Primitive = undefined \| null \| boolean \| string \| number \| symbol \| bigint;\n\n/*\n A {@link Map} that uses a custom key transformation function to convert keys\n * to a primitive type that can be used as a {@link Map} key.\n \n This allows for using objects as keys in a {@link Map} without worrying about\n * reference equality.\n /\nexport class CustomKeyMap<K, V> {\n readonly [Symbol.toStringTag] = 'CustomKeyMap';\n readonly #toKey: (key: K) => Primitive;\n readonly #map = new Map<Primitive, readonly [K, V]>();\n\n constructor(\n toKey: (key: K) => Primitive,\n iterable?: Iterable<readonly [K, V]> \| null,\n ) {\n this.#toKey = toKey;\n if (iterable) {\n for (const [key, value] of iterable ?? []) {\n this.#map.set(toKey(key), [key, value]);\n }\n }\n }\n\n clear(): void {\n this.#map.clear();\n }\n\n delete(key: K): boolean {\n return this.#map.delete(this.#toKey(key));\n }\n\n forEach(\n callbackfn: (value: V, key: K, map: CustomKeyMap<K, V>) => void,\n // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n thisArg?: any,\n ): void {\n for (const [key, value] of this.#map.values()) {\n callbackfn.call(thisArg, value, key, this);\n }\n }\n\n get(key: K): V \| undefined {\n return this.#map.get(this.#toKey(key))?.[1];\n }\n\n has(key: K): boolean {\n return this.#map.has(this.#toKey(key));\n }\n\n set(key: K, value: V): this {\n this.#map.set(this.#toKey(key), [key, value]);\n return this;\n }\n\n get size(): number {\n return this.#map.size;\n }\n\n entries(): MapIterator<[K, V]> {\n for (const entry of this.#map.values()) {\n yield entry.slice(0, 2) as [K, V];\n }\n }\n\n keys(): MapIterator<K> {\n for (const entry of this.#map.values()) {\n yield entry[0];\n }\n }\n\n values(): MapIterator<V> {\n for (const entry of this.#map.values()) {\n yield entry[1];\n }\n }\n\n [Symbol.iterator](): MapIterator<[K, V]> {\n return this.entries();\n }\n}\n"],"mappings":";;;;;;;;AASA,IAAa,eAAb,MAAgC;CAC9B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAgC;CAEpD,YACE,OACA,UACA;EACA,~~KAAKA~~,SAAS;EACd,IAAI,UACF,KAAK,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,GACtC,~~KAAKC~~,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;CAG5C;CAEA,QAAc;EACZ,~~KAAKA~~,KAAK,MAAM;CAClB;CAEA,OAAO,KAAiB;EACtB,OAAO,~~KAAKA~~,KAAK,OAAO,~~KAAKD~~,OAAO,GAAG,CAAC;CAC1C;CAEA,QACE,YAEA,SACM;EACN,KAAK,MAAM,CAAC,KAAK,UAAU,~~KAAKC~~,KAAK,OAAO,GAC1C,WAAW,KAAK,SAAS,OAAO,KAAK,IAAI;CAE7C;CAEA,IAAI,KAAuB;EACzB,OAAO,~~KAAKA~~,KAAK,IAAI,~~KAAKD~~,OAAO,GAAG,CAAC,~~IAAI~~;CAC3C;CAEA,IAAI,KAAiB;EACnB,OAAO,~~KAAKC~~,KAAK,IAAI,~~KAAKD~~,OAAO,GAAG,CAAC;CACvC;CAEA,IAAI,KAAQ,OAAgB;EAC1B,~~KAAKC~~,KAAK,IAAI,~~KAAKD~~,OAAO,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;EAC5C,OAAO;CACT;CAEA,IAAI,OAAe;EACjB,OAAO,~~KAAKC~~,KAAK;CACnB;CAEA,CAAC,UAA+B;EAC9B,KAAK,MAAM,SAAS,~~KAAKA~~,KAAK,OAAO,GACnC,MAAM,MAAM,MAAM,GAAG,CAAC;CAE1B;CAEA,CAAC,OAAuB;EACtB,KAAK,MAAM,SAAS,~~KAAKA~~,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,SAAyB;EACxB,KAAK,MAAM,SAAS,~~KAAKA~~,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,QAAQ;CACtB;AACF"}
1	+ {"version":3,"file":"custom-key-map.js","names":[],"sources":["../../../../shared/src/custom-key-map.ts"],"sourcesContent":["type Primitive = undefined \| null \| boolean \| string \| number \| symbol \| bigint;\n\n/*\n A {@link Map} that uses a custom key transformation function to convert keys\n * to a primitive type that can be used as a {@link Map} key.\n \n This allows for using objects as keys in a {@link Map} without worrying about\n * reference equality.\n /\nexport class CustomKeyMap<K, V> {\n readonly [Symbol.toStringTag] = 'CustomKeyMap';\n readonly #toKey: (key: K) => Primitive;\n readonly #map = new Map<Primitive, readonly [K, V]>();\n\n constructor(\n toKey: (key: K) => Primitive,\n iterable?: Iterable<readonly [K, V]> \| null,\n ) {\n this.#toKey = toKey;\n if (iterable) {\n for (const [key, value] of iterable ?? []) {\n this.#map.set(toKey(key), [key, value]);\n }\n }\n }\n\n clear(): void {\n this.#map.clear();\n }\n\n delete(key: K): boolean {\n return this.#map.delete(this.#toKey(key));\n }\n\n forEach(\n callbackfn: (value: V, key: K, map: CustomKeyMap<K, V>) => void,\n // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n thisArg?: any,\n ): void {\n for (const [key, value] of this.#map.values()) {\n callbackfn.call(thisArg, value, key, this);\n }\n }\n\n get(key: K): V \| undefined {\n return this.#map.get(this.#toKey(key))?.[1];\n }\n\n has(key: K): boolean {\n return this.#map.has(this.#toKey(key));\n }\n\n set(key: K, value: V): this {\n this.#map.set(this.#toKey(key), [key, value]);\n return this;\n }\n\n get size(): number {\n return this.#map.size;\n }\n\n entries(): MapIterator<[K, V]> {\n for (const entry of this.#map.values()) {\n yield entry.slice(0, 2) as [K, V];\n }\n }\n\n keys(): MapIterator<K> {\n for (const entry of this.#map.values()) {\n yield entry[0];\n }\n }\n\n values(): MapIterator<V> {\n for (const entry of this.#map.values()) {\n yield entry[1];\n }\n }\n\n [Symbol.iterator](): MapIterator<[K, V]> {\n return this.entries();\n }\n}\n"],"mappings":";;;;;;;;AASA,IAAa,eAAb,MAAgC;CAC9B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAgC;CAEpD,YACE,OACA,UACA;EACA,KAAK,SAAS;EACd,IAAI,UACF,KAAK,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,GACtC,KAAK,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;CAG5C;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;CAEA,OAAO,KAAiB;EACtB,OAAO,KAAK,KAAK,OAAO,KAAK,OAAO,GAAG,CAAC;CAC1C;CAEA,QACE,YAEA,SACM;EACN,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,KAAK,OAAO,GAC1C,WAAW,KAAK,SAAS,OAAO,KAAK,IAAI;CAE7C;CAEA,IAAI,KAAuB;EACzB,OAAO,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC,CAAC,GAAG;CAC3C;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC;CACvC;CAEA,IAAI,KAAQ,OAAgB;EAC1B,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;EAC5C,OAAO;CACT;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,CAAC,UAA+B;EAC9B,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,MAAM,MAAM,GAAG,CAAC;CAE1B;CAEA,CAAC,OAAuB;EACtB,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,SAAyB;EACxB,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,MAAM;CAEhB;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,QAAQ;CACtB;AACF"}

package/out/shared/src/custom-key-set.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"custom-key-set.js","names":[~~"#toKey","#map"~~],"sources":["../../../../shared/src/custom-key-set.ts"],"sourcesContent":["type Primitive = undefined \| null \| boolean \| string \| number \| symbol \| bigint;\n\n/*\n A {@link Set} that uses a custom value transformation function to convert values\n * to a primitive type that can be used as a {@link Set} value.\n \n This allows for using objects as values in a {@link Set} without worrying about\n * reference equality.\n /\n\nexport class CustomKeySet<V> {\n readonly [Symbol.toStringTag] = 'CustomKeySet';\n readonly #toKey: (value: V) => Primitive;\n readonly #map = new Map<Primitive, V>();\n\n constructor(toKey: (value: V) => Primitive, iterable?: Iterable<V> \| null) {\n this.#toKey = toKey;\n if (iterable) {\n for (const value of iterable ?? []) {\n this.#map.set(toKey(value), value);\n }\n }\n }\n\n add(value: V): this {\n this.#map.set(this.#toKey(value), value);\n return this;\n }\n\n clear(): void {\n this.#map.clear();\n }\n\n delete(value: V): boolean {\n return this.#map.delete(this.#toKey(value));\n }\n\n forEach(\n callbackfn: (value: V, value2: V, set: CustomKeySet<V>) => void,\n // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n thisArg?: any,\n ): void {\n this.#map.forEach(value => {\n callbackfn.call(thisArg, value, value, this);\n });\n }\n\n has(value: V): boolean {\n return this.#map.has(this.#toKey(value));\n }\n\n get size(): number {\n return this.#map.size;\n }\n\n entries(): IterableIterator<[V, V]> {\n for (const value of this.#map.values()) {\n yield [value, value];\n }\n }\n\n keys(): IterableIterator<V> {\n return this.#map.values();\n }\n\n values(): IterableIterator<V> {\n return this.#map.values();\n }\n\n [Symbol.iterator](): IterableIterator<V> {\n return this.#map.values();\n }\n}\n"],"mappings":";;;;;;;;AAUA,IAAa,eAAb,MAA6B;CAC3B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAkB;CAEtC,YAAY,OAAgC,UAA+B;EACzE,~~KAAKA~~,SAAS;EACd,IAAI,UACF,KAAK,MAAM,SAAS,YAAY,CAAC,GAC/B,~~KAAKC~~,KAAK,IAAI,MAAM,KAAK,GAAG,KAAK;CAGvC;CAEA,IAAI,OAAgB;EAClB,~~KAAKA~~,KAAK,IAAI,~~KAAKD~~,OAAO,KAAK,GAAG,KAAK;EACvC,OAAO;CACT;CAEA,QAAc;EACZ,~~KAAKC~~,KAAK,MAAM;CAClB;CAEA,OAAO,OAAmB;EACxB,OAAO,~~KAAKA~~,KAAK,OAAO,~~KAAKD~~,OAAO,KAAK,CAAC;CAC5C;CAEA,QACE,YAEA,SACM;EACN,~~KAAKC~~,KAAK,SAAQ,UAAS;GACzB,WAAW,KAAK,SAAS,OAAO,OAAO,IAAI;EAC7C,CAAC;CACH;CAEA,IAAI,OAAmB;EACrB,OAAO,~~KAAKA~~,KAAK,IAAI,~~KAAKD~~,OAAO,KAAK,CAAC;CACzC;CAEA,IAAI,OAAe;EACjB,OAAO,~~KAAKC~~,KAAK;CACnB;CAEA,CAAC,UAAoC;EACnC,KAAK,MAAM,SAAS,~~KAAKA~~,KAAK,OAAO,GACnC,MAAM,CAAC,OAAO,KAAK;CAEvB;CAEA,OAA4B;EAC1B,OAAO,~~KAAKA~~,KAAK,OAAO;CAC1B;CAEA,SAA8B;EAC5B,OAAO,~~KAAKA~~,KAAK,OAAO;CAC1B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,~~KAAKA~~,KAAK,OAAO;CAC1B;AACF"}
1	+ {"version":3,"file":"custom-key-set.js","names":[],"sources":["../../../../shared/src/custom-key-set.ts"],"sourcesContent":["type Primitive = undefined \| null \| boolean \| string \| number \| symbol \| bigint;\n\n/*\n A {@link Set} that uses a custom value transformation function to convert values\n * to a primitive type that can be used as a {@link Set} value.\n \n This allows for using objects as values in a {@link Set} without worrying about\n * reference equality.\n /\n\nexport class CustomKeySet<V> {\n readonly [Symbol.toStringTag] = 'CustomKeySet';\n readonly #toKey: (value: V) => Primitive;\n readonly #map = new Map<Primitive, V>();\n\n constructor(toKey: (value: V) => Primitive, iterable?: Iterable<V> \| null) {\n this.#toKey = toKey;\n if (iterable) {\n for (const value of iterable ?? []) {\n this.#map.set(toKey(value), value);\n }\n }\n }\n\n add(value: V): this {\n this.#map.set(this.#toKey(value), value);\n return this;\n }\n\n clear(): void {\n this.#map.clear();\n }\n\n delete(value: V): boolean {\n return this.#map.delete(this.#toKey(value));\n }\n\n forEach(\n callbackfn: (value: V, value2: V, set: CustomKeySet<V>) => void,\n // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n thisArg?: any,\n ): void {\n this.#map.forEach(value => {\n callbackfn.call(thisArg, value, value, this);\n });\n }\n\n has(value: V): boolean {\n return this.#map.has(this.#toKey(value));\n }\n\n get size(): number {\n return this.#map.size;\n }\n\n entries(): IterableIterator<[V, V]> {\n for (const value of this.#map.values()) {\n yield [value, value];\n }\n }\n\n keys(): IterableIterator<V> {\n return this.#map.values();\n }\n\n values(): IterableIterator<V> {\n return this.#map.values();\n }\n\n [Symbol.iterator](): IterableIterator<V> {\n return this.#map.values();\n }\n}\n"],"mappings":";;;;;;;;AAUA,IAAa,eAAb,MAA6B;CAC3B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,IAAkB;CAEtC,YAAY,OAAgC,UAA+B;EACzE,KAAK,SAAS;EACd,IAAI,UACF,KAAK,MAAM,SAAS,YAAY,CAAC,GAC/B,KAAK,KAAK,IAAI,MAAM,KAAK,GAAG,KAAK;CAGvC;CAEA,IAAI,OAAgB;EAClB,KAAK,KAAK,IAAI,KAAK,OAAO,KAAK,GAAG,KAAK;EACvC,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;CAEA,OAAO,OAAmB;EACxB,OAAO,KAAK,KAAK,OAAO,KAAK,OAAO,KAAK,CAAC;CAC5C;CAEA,QACE,YAEA,SACM;EACN,KAAK,KAAK,SAAQ,UAAS;GACzB,WAAW,KAAK,SAAS,OAAO,OAAO,IAAI;EAC7C,CAAC;CACH;CAEA,IAAI,OAAmB;EACrB,OAAO,KAAK,KAAK,IAAI,KAAK,OAAO,KAAK,CAAC;CACzC;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,CAAC,UAAoC;EACnC,KAAK,MAAM,SAAS,KAAK,KAAK,OAAO,GACnC,MAAM,CAAC,OAAO,KAAK;CAEvB;CAEA,OAA4B;EAC1B,OAAO,KAAK,KAAK,OAAO;CAC1B;CAEA,SAA8B;EAC5B,OAAO,KAAK,KAAK,OAAO;CAC1B;CAEA,CAAC,OAAO,YAAiC;EACvC,OAAO,KAAK,KAAK,OAAO;CAC1B;AACF"}

package/out/shared/src/deep-clone.d.ts CHANGED Viewed

@@ -1,4 +1,3 @@
 import type { JSONValue, ReadonlyJSONValue } from './json.ts';
 export declare function deepClone(value: ReadonlyJSONValue): JSONValue;
-export declare function internalDeepClone(value: ReadonlyJSONValue, seen: Array<ReadonlyJSONValue>): JSONValue;
 //# sourceMappingURL=deep-clone.d.ts.map

package/out/shared/src/deep-clone.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"deep-clone.d.ts","sourceRoot":"","sources":["../../../../shared/src/deep-clone.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,SAAS,EAAE,iBAAiB,EAAC,MAAM,WAAW,CAAC;AAE5D,wBAAgB,SAAS,CAAC,KAAK,EAAE,iBAAiB,GAAG,SAAS,CAG7D~~;AAED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,iBAAiB,EACxB,IAAI,EAAE,KAAK,CAAC,iBAAiB,CAAC,GAC7B,SAAS,CAsCX~~"}
1	+ {"version":3,"file":"deep-clone.d.ts","sourceRoot":"","sources":["../../../../shared/src/deep-clone.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,SAAS,EAAE,iBAAiB,EAAC,MAAM,WAAW,CAAC;AAE5D,wBAAgB,SAAS,CAAC,KAAK,EAAE,iBAAiB,GAAG,SAAS,CAG7D"}

package/out/shared/src/deep-clone.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"deep-clone.js","names":[],"sources":["../../../../shared/src/deep-clone.ts"],"sourcesContent":["import {hasOwn} from './has-own.ts';\nimport type {JSONValue, ReadonlyJSONValue} from './json.ts';\n\nexport function deepClone(value: ReadonlyJSONValue): JSONValue {\n const seen: Array<ReadonlyJSONValue> = [];\n return internalDeepClone(value, seen);\n}\n\~~nexport~~ ~~function~~ internalDeepClone(\n value: ReadonlyJSONValue,\n seen: Array<ReadonlyJSONValue>,\n): JSONValue {\n switch (typeof value) {\n case 'boolean':\n case 'number':\n case 'string':\n case 'undefined':\n return value;\n case 'object': {\n if (value === null) {\n return null;\n }\n if (seen.includes(value)) {\n throw new Error('Cyclic object');\n }\n seen.push(value);\n if (Array.isArray(value)) {\n const rv = value.map(v => internalDeepClone(v, seen));\n seen.pop();\n return rv;\n }\n\n const obj: JSONValue = {};\n\n for (const k in value) {\n if (hasOwn(value, k)) {\n const v = (value as Record<string, ReadonlyJSONValue>)[k];\n if (v !== undefined) {\n obj[k] = internalDeepClone(v, seen);\n }\n }\n }\n seen.pop();\n return obj;\n }\n\n default:\n throw new Error(`Invalid type: ${typeof value}`);\n }\n}\n"],"mappings":";;AAGA,SAAgB,UAAU,OAAqC;CAE7D,OAAO,kBAAkB,OAAO,CAAA,CAAI;AACtC;AAEA,~~SAAgB~~,~~kBACd~~,OACA,MACW;CACX,QAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,aACH,OAAO;EACT,KAAK,UAAU;GACb,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,KAAK,SAAS,KAAK,GACrB,MAAM,IAAI,MAAM,eAAe;GAEjC,KAAK,KAAK,KAAK;GACf,IAAI,MAAM,QAAQ,KAAK,GAAG;IACxB,MAAM,KAAK,MAAM,KAAI,MAAK,kBAAkB,GAAG,IAAI,CAAC;IACpD,KAAK,IAAI;IACT,OAAO;GACT;GAEA,MAAM,MAAiB,CAAC;GAExB,KAAK,MAAM,KAAK,OACd,IAAI,OAAO,OAAO,CAAC,GAAG;IACpB,MAAM,IAAK,MAA4C;IACvD,IAAI,MAAM,KAAA,GACR,IAAI,KAAK,kBAAkB,GAAG,IAAI;GAEtC;GAEF,KAAK,IAAI;GACT,OAAO;EACT;EAEA,SACE,MAAM,IAAI,MAAM,iBAAiB,OAAO,OAAO;CACnD;AACF"}
1	+ {"version":3,"file":"deep-clone.js","names":[],"sources":["../../../../shared/src/deep-clone.ts"],"sourcesContent":["import {hasOwn} from './has-own.ts';\nimport type {JSONValue, ReadonlyJSONValue} from './json.ts';\n\nexport function deepClone(value: ReadonlyJSONValue): JSONValue {\n const seen: Array<ReadonlyJSONValue> = [];\n return internalDeepClone(value, seen);\n}\n\nfunction internalDeepClone(\n value: ReadonlyJSONValue,\n seen: Array<ReadonlyJSONValue>,\n): JSONValue {\n switch (typeof value) {\n case 'boolean':\n case 'number':\n case 'string':\n case 'undefined':\n return value;\n case 'object': {\n if (value === null) {\n return null;\n }\n if (seen.includes(value)) {\n throw new Error('Cyclic object');\n }\n seen.push(value);\n if (Array.isArray(value)) {\n const rv = value.map(v => internalDeepClone(v, seen));\n seen.pop();\n return rv;\n }\n\n const obj: JSONValue = {};\n\n for (const k in value) {\n if (hasOwn(value, k)) {\n const v = (value as Record<string, ReadonlyJSONValue>)[k];\n if (v !== undefined) {\n obj[k] = internalDeepClone(v, seen);\n }\n }\n }\n seen.pop();\n return obj;\n }\n\n default:\n throw new Error(`Invalid type: ${typeof value}`);\n }\n}\n"],"mappings":";;AAGA,SAAgB,UAAU,OAAqC;CAE7D,OAAO,kBAAkB,OAAO,CAAA,CAAI;AACtC;AAEA,SAAS,kBACP,OACA,MACW;CACX,QAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,aACH,OAAO;EACT,KAAK,UAAU;GACb,IAAI,UAAU,MACZ,OAAO;GAET,IAAI,KAAK,SAAS,KAAK,GACrB,MAAM,IAAI,MAAM,eAAe;GAEjC,KAAK,KAAK,KAAK;GACf,IAAI,MAAM,QAAQ,KAAK,GAAG;IACxB,MAAM,KAAK,MAAM,KAAI,MAAK,kBAAkB,GAAG,IAAI,CAAC;IACpD,KAAK,IAAI;IACT,OAAO;GACT;GAEA,MAAM,MAAiB,CAAC;GAExB,KAAK,MAAM,KAAK,OACd,IAAI,OAAO,OAAO,CAAC,GAAG;IACpB,MAAM,IAAK,MAA4C;IACvD,IAAI,MAAM,KAAA,GACR,IAAI,KAAK,kBAAkB,GAAG,IAAI;GAEtC;GAEF,KAAK,IAAI;GACT,OAAO;EACT;EAEA,SACE,MAAM,IAAI,MAAM,iBAAiB,OAAO,OAAO;CACnD;AACF"}

package/out/shared/src/document-visible.js CHANGED Viewed

@@ -1,4 +1,4 @@
-import { resolver } from "@rocicorp/resolver";
+import { resolver } from "./resolver.js";
 //#region ../shared/src/document-visible.ts
 function getDocumentVisibilityWatcher(doc, hiddenIntervalMS, signal) {
 	return doc ? new DocumentVisibilityWatcherImpl(doc, hiddenIntervalMS, signal) : new DocumentVisibilityWatcherNoDoc();

package/out/shared/src/document-visible.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"document-visible.js","names":[~~"#doc","#hiddenIntervalMS","#promises","#onVisibilityChange","#timeoutID","#setVisibilityState","#waitFor"~~],"sources":["../../../../shared/src/document-visible.ts"],"sourcesContent":["import {resolver} from '~~@rocicorp/~~resolver';\n\ntype PartialDocument = Pick<\n Document,\n 'visibilityState' \| 'addEventListener' \| 'removeEventListener'\n>;\n\nexport function getDocumentVisibilityWatcher(\n doc: PartialDocument \| undefined,\n hiddenIntervalMS: number,\n signal: AbortSignal,\n): DocumentVisibilityWatcher {\n return doc\n ? new DocumentVisibilityWatcherImpl(doc, hiddenIntervalMS, signal)\n : new DocumentVisibilityWatcherNoDoc();\n}\n\nexport interface DocumentVisibilityWatcher {\n readonly visibilityState: DocumentVisibilityState;\n waitForVisible(): Promise<unknown>;\n waitForHidden(): Promise<unknown>;\n}\n\nclass DocumentVisibilityWatcherImpl implements DocumentVisibilityWatcher {\n readonly #doc: PartialDocument;\n readonly #hiddenIntervalMS: number;\n #timeoutID: ReturnType<typeof setTimeout> \| 0 = 0;\n\n // This trails doc.visibilityState by hiddenIntervalMS when being hidden. This\n // is because we want to wait for the tab to be hidden for a while before\n // considering as hidden.\n visibilityState: DocumentVisibilityState;\n\n readonly #promises = new Set<{\n resolve: () => void;\n state: DocumentVisibilityState;\n }>();\n\n constructor(\n doc: PartialDocument,\n hiddenIntervalMS: number,\n signal: AbortSignal,\n ) {\n this.#doc = doc;\n this.#hiddenIntervalMS = hiddenIntervalMS;\n this.visibilityState = doc.visibilityState;\n // Safari got support for abort signal in addEventListener in version\n // 15 (Released 2021-09-20)\n this.#doc.addEventListener('visibilitychange', this.#onVisibilityChange, {\n signal,\n });\n }\n\n #onVisibilityChange = () => {\n if (this.#doc.visibilityState === 'visible') {\n clearTimeout(this.#timeoutID);\n this.#setVisibilityState('visible');\n } else {\n this.#timeoutID = setTimeout(() => {\n this.#setVisibilityState('hidden');\n }, this.#hiddenIntervalMS);\n }\n };\n\n #setVisibilityState(visibilityState: DocumentVisibilityState) {\n if (visibilityState === this.visibilityState) {\n return;\n }\n this.visibilityState = visibilityState;\n for (const entry of this.#promises) {\n const {resolve, state} = entry;\n if (state === visibilityState) {\n resolve();\n this.#promises.delete(entry);\n }\n }\n }\n\n waitForVisible(): Promise<unknown> {\n return this.#waitFor('visible');\n }\n\n waitForHidden(): Promise<unknown> {\n return this.#waitFor('hidden');\n }\n\n #waitFor(state: DocumentVisibilityState): Promise<unknown> {\n if (this.visibilityState === state) {\n return Promise.resolve();\n }\n\n const {promise, resolve} = resolver();\n this.#promises.add({resolve, state});\n return promise;\n }\n}\n\nconst resolvedPromise = Promise.resolve();\nconst promiseThatNeverResolves = new Promise(() => undefined);\n\nclass DocumentVisibilityWatcherNoDoc implements DocumentVisibilityWatcher {\n readonly visibilityState: DocumentVisibilityState = 'visible';\n waitForVisible(): Promise<unknown> {\n return resolvedPromise;\n }\n\n waitForHidden(): Promise<unknown> {\n return promiseThatNeverResolves;\n }\n}\n"],"mappings":";;AAOA,SAAgB,6BACd,KACA,kBACA,QAC2B;CAC3B,OAAO,MACH,IAAI,8BAA8B,KAAK,kBAAkB,MAAM,IAC/D,IAAI,+BAA+B;AACzC;AAQA,IAAM,gCAAN,MAAyE;CACvE;CACA;CACA,aAAgD;CAKhD;CAEA,4BAAqB,IAAI,IAGtB;CAEH,YACE,KACA,kBACA,QACA;EACA,~~KAAKA~~,OAAO;EACZ,~~KAAKC~~,oBAAoB;EACzB,KAAK,kBAAkB,IAAI;EAG3B,~~KAAKD~~,KAAK,iBAAiB,oBAAoB,~~KAAKG~~,qBAAqB,EACvE,OACF,CAAC;CACH;CAEA,4BAA4B;EAC1B,IAAI,~~KAAKH~~,KAAK,oBAAoB,WAAW;GAC3C,aAAa,~~KAAKI~~,UAAU;GAC5B,~~KAAKC~~,oBAAoB,SAAS;EACpC,OACE,~~KAAKD~~,aAAa,iBAAiB;GACjC,~~KAAKC~~,oBAAoB,QAAQ;EACnC,GAAG,~~KAAKJ~~,iBAAiB;CAE7B;CAEA,oBAAoB,iBAA0C;EAC5D,IAAI,oBAAoB,KAAK,iBAC3B;EAEF,KAAK,kBAAkB;EACvB,KAAK,MAAM,SAAS,~~KAAKC~~,WAAW;GAClC,MAAM,EAAC,SAAS,UAAS;GACzB,IAAI,UAAU,iBAAiB;IAC7B,QAAQ;IACR,~~KAAKA~~,UAAU,OAAO,KAAK;GAC7B;EACF;CACF;CAEA,iBAAmC;EACjC,OAAO,~~KAAKI~~,SAAS,SAAS;CAChC;CAEA,gBAAkC;EAChC,OAAO,~~KAAKA~~,SAAS,QAAQ;CAC/B;CAEA,SAAS,OAAkD;EACzD,IAAI,KAAK,oBAAoB,OAC3B,OAAO,QAAQ,QAAQ;EAGzB,MAAM,EAAC,SAAS,YAAW,SAAS;EACpC,~~KAAKJ~~,UAAU,IAAI;GAAC;GAAS;EAAK,CAAC;EACnC,OAAO;CACT;AACF;AAEA,IAAM,kBAAkB,QAAQ,QAAQ;AACxC,IAAM,2BAA2B,IAAI,cAAc,KAAA,CAAS;AAE5D,IAAM,iCAAN,MAA0E;CACxE,kBAAoD;CACpD,iBAAmC;EACjC,OAAO;CACT;CAEA,gBAAkC;EAChC,OAAO;CACT;AACF"}
1	+ {"version":3,"file":"document-visible.js","names":[],"sources":["../../../../shared/src/document-visible.ts"],"sourcesContent":["import {resolver} from './resolver.ts';\n\ntype PartialDocument = Pick<\n Document,\n 'visibilityState' \| 'addEventListener' \| 'removeEventListener'\n>;\n\nexport function getDocumentVisibilityWatcher(\n doc: PartialDocument \| undefined,\n hiddenIntervalMS: number,\n signal: AbortSignal,\n): DocumentVisibilityWatcher {\n return doc\n ? new DocumentVisibilityWatcherImpl(doc, hiddenIntervalMS, signal)\n : new DocumentVisibilityWatcherNoDoc();\n}\n\nexport interface DocumentVisibilityWatcher {\n readonly visibilityState: DocumentVisibilityState;\n waitForVisible(): Promise<unknown>;\n waitForHidden(): Promise<unknown>;\n}\n\nclass DocumentVisibilityWatcherImpl implements DocumentVisibilityWatcher {\n readonly #doc: PartialDocument;\n readonly #hiddenIntervalMS: number;\n #timeoutID: ReturnType<typeof setTimeout> \| 0 = 0;\n\n // This trails doc.visibilityState by hiddenIntervalMS when being hidden. This\n // is because we want to wait for the tab to be hidden for a while before\n // considering as hidden.\n visibilityState: DocumentVisibilityState;\n\n readonly #promises = new Set<{\n resolve: () => void;\n state: DocumentVisibilityState;\n }>();\n\n constructor(\n doc: PartialDocument,\n hiddenIntervalMS: number,\n signal: AbortSignal,\n ) {\n this.#doc = doc;\n this.#hiddenIntervalMS = hiddenIntervalMS;\n this.visibilityState = doc.visibilityState;\n // Safari got support for abort signal in addEventListener in version\n // 15 (Released 2021-09-20)\n this.#doc.addEventListener('visibilitychange', this.#onVisibilityChange, {\n signal,\n });\n }\n\n #onVisibilityChange = () => {\n if (this.#doc.visibilityState === 'visible') {\n clearTimeout(this.#timeoutID);\n this.#setVisibilityState('visible');\n } else {\n this.#timeoutID = setTimeout(() => {\n this.#setVisibilityState('hidden');\n }, this.#hiddenIntervalMS);\n }\n };\n\n #setVisibilityState(visibilityState: DocumentVisibilityState) {\n if (visibilityState === this.visibilityState) {\n return;\n }\n this.visibilityState = visibilityState;\n for (const entry of this.#promises) {\n const {resolve, state} = entry;\n if (state === visibilityState) {\n resolve();\n this.#promises.delete(entry);\n }\n }\n }\n\n waitForVisible(): Promise<unknown> {\n return this.#waitFor('visible');\n }\n\n waitForHidden(): Promise<unknown> {\n return this.#waitFor('hidden');\n }\n\n #waitFor(state: DocumentVisibilityState): Promise<unknown> {\n if (this.visibilityState === state) {\n return Promise.resolve();\n }\n\n const {promise, resolve} = resolver();\n this.#promises.add({resolve, state});\n return promise;\n }\n}\n\nconst resolvedPromise = Promise.resolve();\nconst promiseThatNeverResolves = new Promise(() => undefined);\n\nclass DocumentVisibilityWatcherNoDoc implements DocumentVisibilityWatcher {\n readonly visibilityState: DocumentVisibilityState = 'visible';\n waitForVisible(): Promise<unknown> {\n return resolvedPromise;\n }\n\n waitForHidden(): Promise<unknown> {\n return promiseThatNeverResolves;\n }\n}\n"],"mappings":";;AAOA,SAAgB,6BACd,KACA,kBACA,QAC2B;CAC3B,OAAO,MACH,IAAI,8BAA8B,KAAK,kBAAkB,MAAM,IAC/D,IAAI,+BAA+B;AACzC;AAQA,IAAM,gCAAN,MAAyE;CACvE;CACA;CACA,aAAgD;CAKhD;CAEA,4BAAqB,IAAI,IAGtB;CAEH,YACE,KACA,kBACA,QACA;EACA,KAAK,OAAO;EACZ,KAAK,oBAAoB;EACzB,KAAK,kBAAkB,IAAI;EAG3B,KAAK,KAAK,iBAAiB,oBAAoB,KAAK,qBAAqB,EACvE,OACF,CAAC;CACH;CAEA,4BAA4B;EAC1B,IAAI,KAAK,KAAK,oBAAoB,WAAW;GAC3C,aAAa,KAAK,UAAU;GAC5B,KAAK,oBAAoB,SAAS;EACpC,OACE,KAAK,aAAa,iBAAiB;GACjC,KAAK,oBAAoB,QAAQ;EACnC,GAAG,KAAK,iBAAiB;CAE7B;CAEA,oBAAoB,iBAA0C;EAC5D,IAAI,oBAAoB,KAAK,iBAC3B;EAEF,KAAK,kBAAkB;EACvB,KAAK,MAAM,SAAS,KAAK,WAAW;GAClC,MAAM,EAAC,SAAS,UAAS;GACzB,IAAI,UAAU,iBAAiB;IAC7B,QAAQ;IACR,KAAK,UAAU,OAAO,KAAK;GAC7B;EACF;CACF;CAEA,iBAAmC;EACjC,OAAO,KAAK,SAAS,SAAS;CAChC;CAEA,gBAAkC;EAChC,OAAO,KAAK,SAAS,QAAQ;CAC/B;CAEA,SAAS,OAAkD;EACzD,IAAI,KAAK,oBAAoB,OAC3B,OAAO,QAAQ,QAAQ;EAGzB,MAAM,EAAC,SAAS,YAAW,SAAS;EACpC,KAAK,UAAU,IAAI;GAAC;GAAS;EAAK,CAAC;EACnC,OAAO;CACT;AACF;AAEA,IAAM,kBAAkB,QAAQ,QAAQ;AACxC,IAAM,2BAA2B,IAAI,cAAc,KAAA,CAAS;AAE5D,IAAM,iCAAN,MAA0E;CACxE,kBAAoD;CACpD,iBAAmC;EACjC,OAAO;CACT;CAEA,gBAAkC;EAChC,OAAO;CACT;AACF"}

package/out/shared/src/dotenv.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"dotenv.js","names":[],"sources":["../../../../shared/src/dotenv.ts"],"sourcesContent":["import {config as dotenvxConfig} from '@dotenvx/dotenvx';\n\n// Import env vars from .env file if present but don't whine if not present.\n// Also no free marketing for dotenvx.\ndotenvxConfig({\n ignore: ['MISSING_ENV_FILE'],\n quiet: true,\n});\n"],"mappings":";;~~AAIA~~,OAAc;CACZ,QAAQ,CAAC,kBAAkB;CAC3B,OAAO;AACT,CAAC"}
1	+ {"version":3,"file":"dotenv.js","names":["dotenvxConfig"],"sources":["../../../../shared/src/dotenv.ts"],"sourcesContent":["import {config as dotenvxConfig} from '@dotenvx/dotenvx';\n\n// Import env vars from .env file if present but don't whine if not present.\n// Also no free marketing for dotenvx.\ndotenvxConfig({\n ignore: ['MISSING_ENV_FILE'],\n quiet: true,\n});\n"],"mappings":";;AAIAA,OAAc;CACZ,QAAQ,CAAC,kBAAkB;CAC3B,OAAO;AACT,CAAC"}

package/out/shared/src/error.js CHANGED Viewed

@@ -41,7 +41,7 @@ function getErrorMessageInternal(error, seen) {
 */
 function getErrorCauses(error) {
 	const causes = [];
-	const seen = new Set([error]);
+	const seen = /* @__PURE__ */ new Set([error]);
 	let current = error;
 	for (;;) {
 		const cause = readCause(current);