@rocicorp/zero 0.0.0-202410031711

package/out/shared/src/json.js

@@ -0,0 +1,164 @@
+import { assertObject, throwInvalidType } from './asserts.js';
+import { skipAssertJSONValue } from './config.js';
+import { hasOwn } from './has-own.js';
+/**
+ * Checks deep equality of two JSON value with (almost) same semantics as
+ * `JSON.stringify`. The only difference is that with `JSON.stringify` the
+ * ordering of the properties in an object/map/dictionary matters. In
+ * {@link deepEqual} the following two values are consider equal, even though the
+ * strings JSON.stringify would produce is different:
+ *
+ * ```js
+ * assert(deepEqual(t({a: 1, b: 2}, {b: 2, a: 1}))
+ * ```
+ */
+export function deepEqual(a, b) {
+    if (a === b) {
+        return true;
+    }
+    if (typeof a !== typeof b) {
+        return false;
+    }
+    switch (typeof a) {
+        case 'boolean':
+        case 'number':
+        case 'string':
+            return false;
+    }
+    // a cannot be undefined here because either a and b are undefined or their
+    // types are different.
+    // eslint-disable-next-line  @typescript-eslint/no-non-null-assertion
+    a = a;
+    // 'object'
+    if (Array.isArray(a)) {
+        if (!Array.isArray(b)) {
+            return false;
+        }
+        if (a.length !== b.length) {
+            return false;
+        }
+        for (let i = 0; i < a.length; i++) {
+            if (!deepEqual(a[i], b[i])) {
+                return false;
+            }
+        }
+        return true;
+    }
+    if (a === null || b === null) {
+        return false;
+    }
+    if (Array.isArray(b)) {
+        return false;
+    }
+    // We know a and b are objects here but type inference is not smart enough.
+    a = a;
+    b = b;
+    // We use for-in loops instead of for of Object.keys() to make sure deepEquals
+    // does not allocate any objects.
+    let aSize = 0;
+    for (const key in a) {
+        if (hasOwn(a, key)) {
+            if (!deepEqual(a[key], b[key])) {
+                return false;
+            }
+            aSize++;
+        }
+    }
+    let bSize = 0;
+    for (const key in b) {
+        if (hasOwn(b, key)) {
+            bSize++;
+        }
+    }
+    return aSize === bSize;
+}
+export function assertJSONValue(v) {
+    if (skipAssertJSONValue) {
+        return;
+    }
+    switch (typeof v) {
+        case 'boolean':
+        case 'number':
+        case 'string':
+            return;
+        case 'object':
+            if (v === null) {
+                return;
+            }
+            if (Array.isArray(v)) {
+                return assertJSONArray(v);
+            }
+            return assertObjectIsJSONObject(v);
+    }
+    throwInvalidType(v, 'JSON value');
+}
+export function assertJSONObject(v) {
+    assertObject(v);
+    assertObjectIsJSONObject(v);
+}
+function assertObjectIsJSONObject(v) {
+    for (const k in v) {
+        if (hasOwn(v, k)) {
+            const value = v[k];
+            if (value !== undefined) {
+                assertJSONValue(value);
+            }
+        }
+    }
+}
+function assertJSONArray(v) {
+    for (const item of v) {
+        assertJSONValue(item);
+    }
+}
+/**
+ * Checks if a value is a JSON value. If there is a value that is not a JSON
+ * value, the path parameter is updated to the path of the invalid value.
+ */
+export function isJSONValue(v, path) {
+    switch (typeof v) {
+        case 'boolean':
+        case 'number':
+        case 'string':
+            return true;
+        case 'object':
+            if (v === null) {
+                return true;
+            }
+            if (Array.isArray(v)) {
+                return isJSONArray(v, path);
+            }
+            return objectIsJSONObject(v, path);
+    }
+    return false;
+}
+export function isJSONObject(v, path) {
+    if (typeof v !== 'object' || v === null) {
+        return false;
+    }
+    return objectIsJSONObject(v, path);
+}
+function objectIsJSONObject(v, path) {
+    for (const k in v) {
+        if (hasOwn(v, k)) {
+            path.push(k);
+            const value = v[k];
+            if (value !== undefined && !isJSONValue(value, path)) {
+                return false;
+            }
+            path.pop();
+        }
+    }
+    return true;
+}
+function isJSONArray(v, path) {
+    for (let i = 0; i < v.length; i++) {
+        path.push(i);
+        if (!isJSONValue(v[i], path)) {
+            return false;
+        }
+        path.pop();
+    }
+    return true;
+}
+//# sourceMappingURL=json.js.map

package/out/shared/src/json.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json.js","sourceRoot":"","sources":["../../../../shared/src/json.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,YAAY,EAAE,gBAAgB,EAAC,MAAM,cAAc,CAAC;AAC5D,OAAO,EAAC,mBAAmB,EAAC,MAAM,aAAa,CAAC;AAChD,OAAO,EAAC,MAAM,EAAC,MAAM,cAAc,CAAC;AAyCpC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CACvB,CAAgC,EAChC,CAAgC;IAEhC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,QAAQ,OAAO,CAAC,EAAE,CAAC;QACjB,KAAK,SAAS,CAAC;QACf,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,uBAAuB;IACvB,qEAAqE;IACrE,CAAC,GAAG,CAAE,CAAC;IAEP,WAAW;IACX,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2EAA2E;IAC3E,CAAC,GAAG,CAAuB,CAAC;IAC5B,CAAC,GAAG,CAAuB,CAAC;IAE5B,8EAA8E;IAC9E,iCAAiC;IAEjC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC/B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YACnB,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,OAAO,KAAK,KAAK,KAAK,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,CAAU;IACxC,IAAI,mBAAmB,EAAE,CAAC;QACxB,OAAO;IACT,CAAC;IACD,QAAQ,OAAO,CAAC,EAAE,CAAC;QACjB,KAAK,SAAS,CAAC;QACf,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ;YACX,OAAO;QACT,KAAK,QAAQ;YACX,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO;YACT,CAAC;YACD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrB,OAAO,eAAe,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,wBAAwB,CAAC,CAA4B,CAAC,CAAC;IAClE,CAAC;IACD,gBAAgB,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,CAAU;IACzC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChB,wBAAwB,CAAC,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,wBAAwB,CAC/B,CAA0B;IAE1B,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,eAAe,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,CAAY;IACnC,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACrB,eAAe,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAOD;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,CAAU,EAAE,IAAU;IAChD,QAAQ,OAAO,CAAC,EAAE,CAAC;QACjB,KAAK,SAAS,CAAC;QACf,KAAK,QAAQ,CAAC;QACd,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC;QACd,KAAK,QAAQ;YACX,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrB,OAAO,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,kBAAkB,CAAC,CAA4B,EAAE,IAAI,CAAC,CAAC;IAClE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,CAAU,EAAE,IAAU;IACjD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,kBAAkB,CAAC,CAA4B,EAAE,IAAI,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,kBAAkB,CACzB,CAA0B,EAC1B,IAAU;IAEV,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;gBACrD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,GAAG,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,CAAY,EAAE,IAAU;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,GAAG,EAAE,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/out/shared/src/must.d.ts

@@ -0,0 +1,2 @@
+export declare function must<T>(v: T | undefined | null, msg?: string): T;
+//# sourceMappingURL=must.d.ts.map

package/out/shared/src/must.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"must.d.ts","sourceRoot":"","sources":["../../../../shared/src/must.ts"],"names":[],"mappings":"AAAA,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG,IAAI,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAMhE"}

package/out/shared/src/must.js

@@ -0,0 +1,8 @@
+export function must(v, msg) {
+    // eslint-disable-next-line eqeqeq
+    if (v == null) {
+        throw new Error(msg ?? `Unexpected ${v} value`);
+    }
+    return v;
+}
+//# sourceMappingURL=must.js.map

package/out/shared/src/must.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"must.js","sourceRoot":"","sources":["../../../../shared/src/must.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,IAAI,CAAI,CAAuB,EAAE,GAAY;IAC3D,kCAAkC;IAClC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,cAAc,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/out/shared/src/navigator.d.ts

@@ -0,0 +1,7 @@
+type Navigator = {
+    onLine: boolean;
+    userAgent: string;
+};
+declare const localNavigator: Navigator | undefined;
+export { localNavigator as navigator };
+//# sourceMappingURL=navigator.d.ts.map

package/out/shared/src/navigator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"navigator.d.ts","sourceRoot":"","sources":["../../../../shared/src/navigator.ts"],"names":[],"mappings":"AAAA,KAAK,SAAS,GAAG;IACf,MAAM,EAAE,OAAO,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;CAEnB,CAAC;AAEF,QAAA,MAAM,cAAc,EAAE,SAAS,GAAG,SACwB,CAAC;AAE3D,OAAO,EAAC,cAAc,IAAI,SAAS,EAAC,CAAC"}

package/out/shared/src/parse-big-int.d.ts

@@ -0,0 +1,2 @@
+export declare function parseBigInt(val: string, radix: number): bigint;
+//# sourceMappingURL=parse-big-int.d.ts.map

package/out/shared/src/parse-big-int.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-big-int.d.ts","sourceRoot":"","sources":["../../../../shared/src/parse-big-int.ts"],"names":[],"mappings":"AACA,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAQ9D"}

package/out/shared/src/parse-big-int.js

@@ -0,0 +1,11 @@
+// Until there's BigInt.fromString(val, radix) ... https://github.com/tc39/proposal-number-fromstring
+export function parseBigInt(val, radix) {
+    const base = BigInt(radix);
+    let result = 0n;
+    for (let i = 0; i < val.length; i++) {
+        result *= base;
+        result += BigInt(parseInt(val[i], radix));
+    }
+    return result;
+}
+//# sourceMappingURL=parse-big-int.js.map

package/out/shared/src/parse-big-int.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-big-int.js","sourceRoot":"","sources":["../../../../shared/src/parse-big-int.ts"],"names":[],"mappings":"AAAA,qGAAqG;AACrG,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,KAAa;IACpD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3B,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,IAAI,IAAI,CAAC;QACf,MAAM,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/out/shared/src/queue.d.ts

@@ -0,0 +1,40 @@
+/**
+ * A Queue allows the consumers to await (possibly future) values,
+ * and producers to await the consumption of their values.
+ */
+export declare class Queue<T> {
+    #private;
+    /**
+     * @returns A Promise that resolves when the value is consumed.
+     */
+    enqueue(value: T): Promise<void>;
+    /** @returns A Promise that resolves when the rejection is consumed. */
+    enqueueRejection(reason?: unknown): Promise<void>;
+    /**
+     * Deletes all unconsumed entries matching the specified `value` based on identity equality.
+     * The consumed callback(s) are resolved as if the values were dequeued.
+     *
+     * Note: deletion of `undefined` values is not supported. This method will assert
+     * if `value` is undefined.
+     *
+     * @returns The number of entries deleted.
+     */
+    delete(value: T): number;
+    /**
+     * @param timeoutValue An optional value to resolve if `timeoutMs` is reached.
+     * @param timeoutMs The milliseconds after which the `timeoutValue` is resolved
+     *                  if nothing is produced for the consumer.
+     * @returns A Promise that resolves to the next enqueued value.
+     */
+    dequeue(timeoutValue?: T, timeoutMs?: number): Promise<T>;
+    /**
+     * @returns The instantaneous number of outstanding values waiting to be
+     *          dequeued. Note that if a value was enqueued while a consumer
+     *          was waiting (with `await dequeue()`), the value is immediately
+     *          handed to the consumer and the Queue's size remains 0.
+     */
+    size(): number;
+    asAsyncIterable(cleanup?: () => void): AsyncIterable<T>;
+    asAsyncIterator(cleanup?: () => void): AsyncIterator<T>;
+}
+//# sourceMappingURL=queue.d.ts.map

package/out/shared/src/queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../../../../shared/src/queue.ts"],"names":[],"mappings":"AAGA;;;GAGG;AACH,qBAAa,KAAK,CAAC,CAAC;;IAMlB;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAUhC,uEAAuE;IACvE,gBAAgB,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAgBjD;;;;;;;;OAQG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAexB;;;;;OAKG;IACH,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,SAAS,GAAE,MAAU,GAAG,OAAO,CAAC,CAAC,CAAC;IAqB5D;;;;;OAKG;IACH,IAAI,IAAI,MAAM;IAId,eAAe,CAAC,OAAO,aAAO,GAAG,aAAa,CAAC,CAAC,CAAC;IAIjD,eAAe,CAAC,OAAO,aAAO,GAAG,aAAa,CAAC,CAAC,CAAC;CAiBlD"}

package/out/shared/src/queue.js

@@ -0,0 +1,118 @@
+import { resolver } from '@rocicorp/resolver';
+import { assert } from './asserts.js';
+/**
+ * A Queue allows the consumers to await (possibly future) values,
+ * and producers to await the consumption of their values.
+ */
+export class Queue {
+    // Consumers waiting for entries to be produced.
+    #consumers = [];
+    // Produced entries waiting to be consumed.
+    #produced = [];
+    /**
+     * @returns A Promise that resolves when the value is consumed.
+     */
+    enqueue(value) {
+        const consumer = this.#consumers.shift();
+        if (consumer) {
+            consumer.resolver.resolve(value);
+            clearTimeout(consumer.timeoutID);
+            return Promise.resolve();
+        }
+        return this.#enqueueProduced(Promise.resolve(value), value);
+    }
+    /** @returns A Promise that resolves when the rejection is consumed. */
+    enqueueRejection(reason) {
+        const consumer = this.#consumers.shift();
+        if (consumer) {
+            consumer.resolver.reject(reason);
+            clearTimeout(consumer.timeoutID);
+            return Promise.resolve();
+        }
+        return this.#enqueueProduced(Promise.reject(reason));
+    }
+    #enqueueProduced(produced, value) {
+        const { promise, resolve: consumed } = resolver();
+        this.#produced.push({ produced, value, consumed });
+        return promise;
+    }
+    /**
+     * Deletes all unconsumed entries matching the specified `value` based on identity equality.
+     * The consumed callback(s) are resolved as if the values were dequeued.
+     *
+     * Note: deletion of `undefined` values is not supported. This method will assert
+     * if `value` is undefined.
+     *
+     * @returns The number of entries deleted.
+     */
+    delete(value) {
+        assert(value !== undefined);
+        let count = 0;
+        for (let i = this.#produced.length - 1; i >= 0; i--) {
+            const p = this.#produced[i];
+            if (p.value === value) {
+                this.#produced.splice(i, 1);
+                p.consumed();
+                count++;
+            }
+        }
+        return count;
+    }
+    /**
+     * @param timeoutValue An optional value to resolve if `timeoutMs` is reached.
+     * @param timeoutMs The milliseconds after which the `timeoutValue` is resolved
+     *                  if nothing is produced for the consumer.
+     * @returns A Promise that resolves to the next enqueued value.
+     */
+    dequeue(timeoutValue, timeoutMs = 0) {
+        const produced = this.#produced.shift();
+        if (produced) {
+            produced.consumed();
+            return produced.produced;
+        }
+        const r = resolver();
+        const timeoutID = timeoutValue === undefined
+            ? undefined
+            : setTimeout(() => {
+                const i = this.#consumers.findIndex(c => c.resolver === r);
+                if (i >= 0) {
+                    const [consumer] = this.#consumers.splice(i, 1);
+                    consumer.resolver.resolve(timeoutValue);
+                }
+            }, timeoutMs);
+        this.#consumers.push({ resolver: r, timeoutID });
+        return r.promise;
+    }
+    /**
+     * @returns The instantaneous number of outstanding values waiting to be
+     *          dequeued. Note that if a value was enqueued while a consumer
+     *          was waiting (with `await dequeue()`), the value is immediately
+     *          handed to the consumer and the Queue's size remains 0.
+     */
+    size() {
+        return this.#produced.length;
+    }
+    asAsyncIterable(cleanup = NOOP) {
+        return { [Symbol.asyncIterator]: () => this.asAsyncIterator(cleanup) };
+    }
+    asAsyncIterator(cleanup = NOOP) {
+        return {
+            next: async () => {
+                try {
+                    const value = await this.dequeue();
+                    return { value };
+                }
+                catch (e) {
+                    cleanup();
+                    throw e;
+                }
+            },
+            return: value => {
+                cleanup();
+                return Promise.resolve({ value, done: true });
+            },
+        };
+    }
+}
+const NOOP = () => { };
+//# sourceMappingURL=queue.js.map

package/out/shared/src/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../../../shared/src/queue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAgB,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAC,MAAM,EAAC,MAAM,cAAc,CAAC;AAEpC;;;GAGG;AACH,MAAM,OAAO,KAAK;IAChB,gDAAgD;IACvC,UAAU,GAAkB,EAAE,CAAC;IACxC,2CAA2C;IAClC,SAAS,GAAkB,EAAE,CAAC;IAEvC;;OAEG;IACH,OAAO,CAAC,KAAQ;QACd,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACjC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACjC,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3B,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9D,CAAC;IAED,uEAAuE;IACvE,gBAAgB,CAAC,MAAgB;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACjC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACjC,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3B,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,gBAAgB,CAAC,QAAoB,EAAE,KAAS;QAC9C,MAAM,EAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAC,GAAG,QAAQ,EAAQ,CAAC;QACtD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAC,CAAC,CAAC;QACjD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,KAAQ;QACb,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QAE5B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACb,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,YAAgB,EAAE,YAAoB,CAAC;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACxC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACpB,OAAO,QAAQ,CAAC,QAAQ,CAAC;QAC3B,CAAC;QACD,MAAM,CAAC,GAAG,QAAQ,EAAK,CAAC;QACxB,MAAM,SAAS,GACb,YAAY,KAAK,SAAS;YACxB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE;gBACd,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC;gBAC3D,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACX,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAChD,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC,EAAE,SAAS,CAAC,CAAC;QACpB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAC,QAAQ,EAAE,CAAC,EAAE,SAAS,EAAC,CAAC,CAAC;QAC/C,OAAO,CAAC,CAAC,OAAO,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED,eAAe,CAAC,OAAO,GAAG,IAAI;QAC5B,OAAO,EAAC,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,EAAC,CAAC;IACvE,CAAC;IAED,eAAe,CAAC,OAAO,GAAG,IAAI;QAC5B,OAAO;YACL,IAAI,EAAE,KAAK,IAAI,EAAE;gBACf,IAAI,CAAC;oBACH,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;oBACnC,OAAO,EAAC,KAAK,EAAC,CAAC;gBACjB,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,OAAO,EAAE,CAAC;oBACV,MAAM,CAAC,CAAC;gBACV,CAAC;YACH,CAAC;YACD,MAAM,EAAE,KAAK,CAAC,EAAE;gBACd,OAAO,EAAE,CAAC;gBACV,OAAO,OAAO,CAAC,OAAO,CAAC,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC;YAC9C,CAAC;SACF,CAAC;IACJ,CAAC;CACF;AAED,MAAM,IAAI,GAAG,GAAG,EAAE,GAAE,CAAC,CAAC"}

package/out/shared/src/rand.d.ts

@@ -0,0 +1,7 @@
+/**
+ * @param min Inclusive minimum of the result.
+ * @param max Inclusive maximum of the result.
+ * @returns A random integer in the (inclusive) range of [`min`, `max`].
+ */
+export declare function randInt(min: number, max: number): number;
+//# sourceMappingURL=rand.d.ts.map

package/out/shared/src/rand.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rand.d.ts","sourceRoot":"","sources":["../../../../shared/src/rand.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,UAI/C"}

package/out/shared/src/rand.js

@@ -0,0 +1,11 @@
+/**
+ * @param min Inclusive minimum of the result.
+ * @param max Inclusive maximum of the result.
+ * @returns A random integer in the (inclusive) range of [`min`, `max`].
+ */
+export function randInt(min, max) {
+    min = Math.ceil(min);
+    max = Math.floor(max);
+    return Math.floor(Math.random() * (max - min + 1) + min);
+}
+//# sourceMappingURL=rand.js.map

package/out/shared/src/rand.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rand.js","sourceRoot":"","sources":["../../../../shared/src/rand.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,GAAW,EAAE,GAAW;IAC9C,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrB,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AAC3D,CAAC"}

package/out/shared/src/random-uint64.d.ts

@@ -0,0 +1,2 @@
+export declare function randomUint64(): bigint;
+//# sourceMappingURL=random-uint64.d.ts.map

package/out/shared/src/random-uint64.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-uint64.d.ts","sourceRoot":"","sources":["../../../../shared/src/random-uint64.ts"],"names":[],"mappings":"AAAA,wBAAgB,YAAY,IAAI,MAAM,CAOrC"}

package/out/shared/src/random-values.d.ts

@@ -0,0 +1,2 @@
+export declare function getNonCryptoRandomValues(array: Uint8Array): Uint8Array;
+//# sourceMappingURL=random-values.d.ts.map

package/out/shared/src/random-values.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"random-values.d.ts","sourceRoot":"","sources":["../../../../shared/src/random-values.ts"],"names":[],"mappings":"AAAA,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,UAAU,cAWzD"}

package/out/shared/src/resolved-promises.d.ts

@@ -0,0 +1,5 @@
+export declare const promiseTrue: Promise<boolean>;
+export declare const promiseFalse: Promise<boolean>;
+export declare const promiseUndefined: Promise<undefined>;
+export declare const promiseVoid: Promise<void>;
+//# sourceMappingURL=resolved-promises.d.ts.map

package/out/shared/src/resolved-promises.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolved-promises.d.ts","sourceRoot":"","sources":["../../../../shared/src/resolved-promises.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,WAAW,kBAAwB,CAAC;AACjD,eAAO,MAAM,YAAY,kBAAyB,CAAC;AACnD,eAAO,MAAM,gBAAgB,oBAA6B,CAAC;AAC3D,eAAO,MAAM,WAAW,eAAoB,CAAC"}

package/out/shared/src/resolved-promises.js

@@ -0,0 +1,5 @@
+export const promiseTrue = Promise.resolve(true);
+export const promiseFalse = Promise.resolve(false);
+export const promiseUndefined = Promise.resolve(undefined);
+export const promiseVoid = Promise.resolve();
+//# sourceMappingURL=resolved-promises.js.map

package/out/shared/src/resolved-promises.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolved-promises.js","sourceRoot":"","sources":["../../../../shared/src/resolved-promises.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACjD,MAAM,CAAC,MAAM,YAAY,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AACnD,MAAM,CAAC,MAAM,gBAAgB,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AAC3D,MAAM,CAAC,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC"}

package/out/shared/src/set-utils.d.ts

@@ -0,0 +1,9 @@
+export declare function equals<T>(a: Set<T>, b: Set<T>): boolean;
+export declare function union<T>(...sets: Set<T>[]): Set<T>;
+export declare function intersection<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): Set<T>;
+/**
+ * Returns the elements in {@link a} that are not in {@link b}.
+ */
+export declare function difference<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): Set<T>;
+export declare function symmetricDifference<T>(a: Set<T>, b: Set<T>): Set<T>;
+//# sourceMappingURL=set-utils.d.ts.map

package/out/shared/src/set-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"set-utils.d.ts","sourceRoot":"","sources":["../../../../shared/src/set-utils.ts"],"names":[],"mappings":"AAAA,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,WAU7C;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAQlD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAc5E;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAQ1E;AAED,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAUnE"}

package/out/shared/src/set-utils.js

@@ -0,0 +1,60 @@
+export function equals(a, b) {
+    if (a.size !== b.size) {
+        return false;
+    }
+    for (const value of a) {
+        if (!b.has(value)) {
+            return false;
+        }
+    }
+    return true;
+}
+export function union(...sets) {
+    const result = new Set();
+    for (const set of sets) {
+        for (const value of set) {
+            result.add(value);
+        }
+    }
+    return result;
+}
+export function intersection(a, b) {
+    const result = new Set();
+    if (a.size > b.size) {
+        // Optimization: iterate over the smaller Set.
+        const swap = a;
+        a = b;
+        b = swap;
+    }
+    for (const value of a) {
+        if (b.has(value)) {
+            result.add(value);
+        }
+    }
+    return result;
+}
+/**
+ * Returns the elements in {@link a} that are not in {@link b}.
+ */
+export function difference(a, b) {
+    const result = new Set();
+    for (const value of a) {
+        if (!b.has(value)) {
+            result.add(value);
+        }
+    }
+    return result;
+}
+export function symmetricDifference(a, b) {
+    const result = new Set(a);
+    for (const value of b) {
+        if (a.has(value)) {
+            result.delete(value);
+        }
+        else {
+            result.add(value);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=set-utils.js.map

package/out/shared/src/set-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"set-utils.js","sourceRoot":"","sources":["../../../../shared/src/set-utils.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,MAAM,CAAI,CAAS,EAAE,CAAS;IAC5C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,KAAK,CAAI,GAAG,IAAc;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,YAAY,CAAI,CAAiB,EAAE,CAAiB;IAClE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACpB,8CAA8C;QAC9C,MAAM,IAAI,GAAG,CAAC,CAAC;QACf,CAAC,GAAG,CAAC,CAAC;QACN,CAAC,GAAG,IAAI,CAAC;IACX,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAI,CAAiB,EAAE,CAAiB;IAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAI,CAAS,EAAE,CAAS;IACzD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAI,CAAC,CAAC,CAAC;IAC7B,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACjB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/out/shared/src/sleep.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Creates a promise that resolves after `ms` milliseconds. Note that if you
+ * pass in `0` no `setTimeout` is used and the promise resolves immediately. In
+ * other words no macro task is used in that case.
+ *
+ * Pass in an AbortSignal to clear the timeout.
+ */
+export declare function sleep(ms: number, signal?: AbortSignal): Promise<void>;
+/**
+ * Returns a pair of promises. The first promise resolves after `ms` milliseconds
+ * unless the AbortSignal is aborted. The second promise resolves when the AbortSignal
+ * is aborted.
+ */
+export declare function sleepWithAbort(ms: number, signal: AbortSignal): [ok: Promise<void>, aborted: Promise<void>];
+//# sourceMappingURL=sleep.d.ts.map

package/out/shared/src/sleep.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sleep.d.ts","sourceRoot":"","sources":["../../../../shared/src/sleep.ts"],"names":[],"mappings":"AAMA;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAoBrE;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,WAAW,GAClB,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAsB7C"}

package/out/shared/src/sleep.js

@@ -0,0 +1,54 @@
+import { resolver } from '@rocicorp/resolver';
+import { AbortError } from './abort-error.js';
+const promiseVoid = Promise.resolve();
+const promiseNever = new Promise(() => undefined);
+/**
+ * Creates a promise that resolves after `ms` milliseconds. Note that if you
+ * pass in `0` no `setTimeout` is used and the promise resolves immediately. In
+ * other words no macro task is used in that case.
+ *
+ * Pass in an AbortSignal to clear the timeout.
+ */
+export function sleep(ms, signal) {
+    if (ms === 0) {
+        return promiseVoid;
+    }
+    return new Promise((resolve, reject) => {
+        let handleAbort;
+        if (signal) {
+            handleAbort = () => {
+                clearTimeout(id);
+                reject(new AbortError('Aborted'));
+            };
+            signal.addEventListener('abort', handleAbort, { once: true });
+        }
+        const id = setTimeout(() => {
+            resolve();
+            signal?.removeEventListener('abort', handleAbort);
+        }, ms);
+    });
+}
+/**
+ * Returns a pair of promises. The first promise resolves after `ms` milliseconds
+ * unless the AbortSignal is aborted. The second promise resolves when the AbortSignal
+ * is aborted.
+ */
+export function sleepWithAbort(ms, signal) {
+    if (ms === 0) {
+        return [promiseVoid, promiseNever];
+    }
+    const { promise: abortedPromise, resolve: abortedResolve } = resolver();
+    const sleepPromise = new Promise(resolve => {
+        const handleAbort = () => {
+            clearTimeout(id);
+            abortedResolve();
+        };
+        const id = setTimeout(() => {
+            resolve();
+            signal.removeEventListener('abort', handleAbort);
+        }, ms);
+        signal.addEventListener('abort', handleAbort, { once: true });
+    });
+    return [sleepPromise, abortedPromise];
+}
+//# sourceMappingURL=sleep.js.map

package/out/shared/src/sleep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sleep.js","sourceRoot":"","sources":["../../../../shared/src/sleep.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAC,MAAM,oBAAoB,CAAC;AAC5C,OAAO,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAE5C,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;AACtC,MAAM,YAAY,GAAG,IAAI,OAAO,CAAO,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AAExD;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAC,EAAU,EAAE,MAAoB;IACpD,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrC,IAAI,WAAuB,CAAC;QAC5B,IAAI,MAAM,EAAE,CAAC;YACX,WAAW,GAAG,GAAG,EAAE;gBACjB,YAAY,CAAC,EAAE,CAAC,CAAC;gBACjB,MAAM,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;YACpC,CAAC,CAAC;YACF,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAC,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE;YACzB,OAAO,EAAE,CAAC;YACV,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACpD,CAAC,EAAE,EAAE,CAAC,CAAC;IACT,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,EAAU,EACV,MAAmB;IAEnB,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,EAAC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,cAAc,EAAC,GAAG,QAAQ,EAAQ,CAAC;IAE5E,MAAM,YAAY,GAAG,IAAI,OAAO,CAAO,OAAO,CAAC,EAAE;QAC/C,MAAM,WAAW,GAAG,GAAG,EAAE;YACvB,YAAY,CAAC,EAAE,CAAC,CAAC;YACjB,cAAc,EAAE,CAAC;QACnB,CAAC,CAAC;QAEF,MAAM,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE;YACzB,OAAO,EAAE,CAAC;YACV,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACnD,CAAC,EAAE,EAAE,CAAC,CAAC;QAEP,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,EAAC,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;AACxC,CAAC"}

package/out/shared/src/string-compare.d.ts

@@ -0,0 +1,2 @@
+export declare function stringCompare(a: string, b: string): number;
+//# sourceMappingURL=string-compare.d.ts.map

package/out/shared/src/string-compare.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"string-compare.d.ts","sourceRoot":"","sources":["../../../../shared/src/string-compare.ts"],"names":[],"mappings":"AAAA,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAQ1D"}

package/out/shared/src/string-compare.js

@@ -0,0 +1,10 @@
+export function stringCompare(a, b) {
+    if (a === b) {
+        return 0;
+    }
+    if (a < b) {
+        return -1;
+    }
+    return 1;
+}
+//# sourceMappingURL=string-compare.js.map