@agentshouse/mdruntime 0.1.0-c698c0ebd65bd → 0.1.0-c6bf34fa9e444

package/dist/shared.js

@@ -0,0 +1,421 @@
+import { finished, ROW_WEIGHT } from './turn.js';
+const BITS = 5;
+const MASK = (1 << BITS) - 1;
+const roots = new WeakMap();
+function hashOf(key) {
+    let hash = 0x811c9dc5;
+    for (let index = 0; index < key.length; index += 1) {
+        hash ^= key.charCodeAt(index);
+        hash = Math.imul(hash, 0x01000193);
+    }
+    return hash >>> 0;
+}
+function isLeaf(node) {
+    return 'key' in node;
+}
+function isCollision(node) {
+    return 'leaves' in node;
+}
+function fragment(hash, shift) {
+    return (hash >>> shift) & MASK;
+}
+function count(bits) {
+    let left = bits - ((bits >>> 1) & 0x55555555);
+    left = (left & 0x33333333) + ((left >>> 2) & 0x33333333);
+    return (((left + (left >>> 4)) & 0x0f0f0f0f) * 0x01010101) >>> 24;
+}
+function slot(bitmap, bit) {
+    return count(bitmap & (bit - 1));
+}
+function lookup(root, key) {
+    const hash = hashOf(key);
+    let node = root.node;
+    let shift = 0;
+    while (node !== undefined) {
+        if (isLeaf(node))
+            return node.key === key ? node : undefined;
+        if (isCollision(node))
+            return node.leaves.find((leaf) => leaf.key === key);
+        const bit = 1 << fragment(hash, shift);
+        if ((node.bitmap & bit) === 0)
+            return undefined;
+        node = node.children[slot(node.bitmap, bit)];
+        shift += BITS;
+    }
+    return undefined;
+}
+function branchOf(node, shift) {
+    return { bitmap: 1 << fragment(node.hash, shift), children: [node] };
+}
+function joined(left, right, shift) {
+    if (left.hash === right.hash) {
+        const leaves = isCollision(left) ? left.leaves : [left];
+        return { hash: right.hash, leaves: [...leaves, right] };
+    }
+    return put(branchOf(left, shift), right, shift);
+}
+function put(node, leaf, shift) {
+    if (node === undefined)
+        return leaf;
+    if (isLeaf(node)) {
+        if (node.key !== leaf.key)
+            return joined(node, leaf, shift);
+        return node.value === leaf.value ? node : leaf;
+    }
+    if (isCollision(node)) {
+        if (node.hash !== leaf.hash)
+            return joined(node, leaf, shift);
+        const at = node.leaves.findIndex((held) => held.key === leaf.key);
+        if (at === -1)
+            return { hash: node.hash, leaves: [...node.leaves, leaf] };
+        if (node.leaves[at].value === leaf.value)
+            return node;
+        return {
+            hash: node.hash,
+            leaves: node.leaves.map((held, index) => (index === at ? leaf : held)),
+        };
+    }
+    const bit = 1 << fragment(leaf.hash, shift);
+    const at = slot(node.bitmap, bit);
+    if ((node.bitmap & bit) === 0) {
+        return {
+            bitmap: node.bitmap | bit,
+            children: [...node.children.slice(0, at), leaf, ...node.children.slice(at)],
+        };
+    }
+    const child = node.children[at];
+    const next = put(child, leaf, shift + BITS);
+    if (next === child)
+        return node;
+    return {
+        bitmap: node.bitmap,
+        children: node.children.map((held, index) => (index === at ? next : held)),
+    };
+}
+function lone(node) {
+    if (node.children.length !== 1)
+        return null;
+    const [only] = node.children;
+    return isLeaf(only) || isCollision(only) ? only : null;
+}
+function taken(node, hash, key, shift) {
+    if (isLeaf(node))
+        return node.key === key ? undefined : node;
+    if (isCollision(node)) {
+        const leaves = node.leaves.filter((leaf) => leaf.key !== key);
+        if (leaves.length === node.leaves.length)
+            return node;
+        return leaves.length === 1 ? leaves[0] : { hash: node.hash, leaves };
+    }
+    const bit = 1 << fragment(hash, shift);
+    if ((node.bitmap & bit) === 0)
+        return node;
+    const at = slot(node.bitmap, bit);
+    const child = node.children[at];
+    const next = taken(child, hash, key, shift + BITS);
+    if (next === child)
+        return node;
+    if (next === undefined) {
+        if (node.children.length === 1)
+            return undefined;
+        const rest = {
+            bitmap: node.bitmap & ~bit,
+            children: node.children.filter((_, index) => index !== at),
+        };
+        return lone(rest) ?? rest;
+    }
+    const replaced = {
+        bitmap: node.bitmap,
+        children: node.children.map((held, index) => (index === at ? next : held)),
+    };
+    return lone(replaced) ?? replaced;
+}
+function* leavesOf(node) {
+    if (node === undefined)
+        return;
+    if (isLeaf(node)) {
+        yield node;
+        return;
+    }
+    if (isCollision(node)) {
+        yield* node.leaves;
+        return;
+    }
+    for (const child of node.children)
+        yield* leavesOf(child);
+}
+function facade(root) {
+    let keys;
+    const target = {};
+    const map = new Proxy(target, {
+        get(held, property, receiver) {
+            if (typeof property === 'string') {
+                const leaf = lookup(root, property);
+                if (leaf !== undefined)
+                    return leaf.value;
+            }
+            return Reflect.get(held, property, receiver);
+        },
+        has(held, property) {
+            return ((typeof property === 'string' && lookup(root, property) !== undefined) ||
+                Reflect.has(held, property));
+        },
+        ownKeys() {
+            keys ??= [...leavesOf(root.node)].map((leaf) => leaf.key);
+            return keys;
+        },
+        getOwnPropertyDescriptor(_held, property) {
+            if (typeof property !== 'string')
+                return undefined;
+            const leaf = lookup(root, property);
+            if (leaf === undefined)
+                return undefined;
+            return { value: leaf.value, writable: false, enumerable: true, configurable: true };
+        },
+        set: () => false,
+        defineProperty: () => false,
+        deleteProperty: () => false,
+    });
+    roots.set(map, root);
+    return map;
+}
+export function* entriesIn(map) {
+    const root = roots.get(map);
+    if (root === undefined) {
+        for (const key of Object.keys(map))
+            yield [key, map[key]];
+        return;
+    }
+    for (const leaf of leavesOf(root.node))
+        yield [leaf.key, leaf.value];
+}
+function* rooted(map) {
+    const held = roots.get(map);
+    if (held !== undefined)
+        return held;
+    let node;
+    let size = 0;
+    for (const [key, value] of entriesIn(map)) {
+        node = put(node, { key, hash: hashOf(key), value }, 0);
+        size += 1;
+        yield ROW_WEIGHT;
+    }
+    return { node, size };
+}
+const RUN = 1 << 10;
+function* merged(left, right) {
+    const into = [];
+    let at = 0;
+    let from = 0;
+    while (at < left.length || from < right.length) {
+        into.push(from === right.length || (at < left.length && left[at] < right[from])
+            ? left[at++]
+            : right[from++]);
+        yield ROW_WEIGHT;
+    }
+    return into;
+}
+function* pathsOf(map) {
+    for (const [key] of entriesIn(map))
+        yield key;
+}
+export function* sortedKeys(map) {
+    return yield* sorting(pathsOf(map));
+}
+export function* sorting(keys) {
+    let runs = [];
+    let run = [];
+    for (const key of keys) {
+        run.push(key);
+        yield ROW_WEIGHT;
+        if (run.length === RUN) {
+            runs.push(run.sort());
+            run = [];
+        }
+    }
+    if (run.length > 0)
+        runs.push(run.sort());
+    while (runs.length > 1) {
+        const next = [];
+        for (let at = 0; at < runs.length; at += 2) {
+            next.push(at + 1 === runs.length ? runs[at] : yield* merged(runs[at], runs[at + 1]));
+        }
+        runs = next;
+    }
+    return runs[0] ?? [];
+}
+export function* sharing(map) {
+    return roots.has(map) ? map : facade(yield* rooted(map));
+}
+export function shared(map) {
+    return finished(sharing(map));
+}
+export function patched(base, set, removed = []) {
+    return finished(patching(base, set, removed));
+}
+export function* patching(base, set, removed = []) {
+    const root = yield* rooted(base);
+    let node = root.node;
+    let size = root.size;
+    for (const key of removed) {
+        if (node === undefined)
+            break;
+        const before = lookup({ node, size }, key);
+        if (before === undefined)
+            continue;
+        node = taken(node, before.hash, key, 0);
+        size -= 1;
+        yield ROW_WEIGHT;
+    }
+    for (const [key, value] of set) {
+        const before = lookup({ node, size }, key);
+        node = put(node, { key, hash: hashOf(key), value }, 0);
+        if (before === undefined)
+            size += 1;
+        yield ROW_WEIGHT;
+    }
+    if (node === root.node && roots.has(base))
+        return base;
+    return facade({ node, size });
+}
+export function sizeOf(map) {
+    return roots.get(map)?.size ?? Object.keys(map).length;
+}
+function* compared(left, right, same, into) {
+    const pending = [[left, right]];
+    for (let pair = pending.pop(); pair !== undefined; pair = pending.pop()) {
+        const [one, other] = pair;
+        if (one === other)
+            continue;
+        if (one !== undefined &&
+            other !== undefined &&
+            !isLeaf(one) &&
+            !isCollision(one) &&
+            !isLeaf(other) &&
+            !isCollision(other)) {
+            const children = [];
+            for (let remaining = one.bitmap | other.bitmap; remaining !== 0; remaining &= remaining - 1) {
+                const bit = remaining & -remaining;
+                children.push([
+                    (one.bitmap & bit) === 0 ? undefined : one.children[slot(one.bitmap, bit)],
+                    (other.bitmap & bit) === 0 ? undefined : other.children[slot(other.bitmap, bit)],
+                ]);
+            }
+            pending.push(...children.reverse());
+            continue;
+        }
+        const before = new Map();
+        for (const leaf of leavesOf(one)) {
+            before.set(leaf.key, leaf.value);
+            yield ROW_WEIGHT;
+        }
+        for (const leaf of leavesOf(other)) {
+            const held = before.get(leaf.key);
+            before.delete(leaf.key);
+            if (held === undefined || !same(held, leaf.value))
+                into.add(leaf.key);
+            yield ROW_WEIGHT;
+        }
+        for (const key of before.keys())
+            into.add(key);
+    }
+}
+export function* differences(left, right, same = Object.is) {
+    const into = new Set();
+    if (left === right)
+        return into;
+    const leftRoot = roots.get(left);
+    const rightRoot = roots.get(right);
+    if (leftRoot !== undefined && rightRoot !== undefined) {
+        yield* compared(leftRoot.node, rightRoot.node, same, into);
+        return into;
+    }
+    for (const [key, value] of entriesIn(left)) {
+        if (!Object.hasOwn(right, key) || !same(value, right[key]))
+            into.add(key);
+        yield ROW_WEIGHT;
+    }
+    for (const [key] of entriesIn(right)) {
+        if (!Object.hasOwn(left, key))
+            into.add(key);
+        yield ROW_WEIGHT;
+    }
+    return into;
+}
+export function differing(left, right, same = Object.is) {
+    return finished(differences(left, right, same));
+}
+const drafts = new WeakMap();
+const GONE = Symbol('gone');
+export function drafted(base) {
+    const written = new Map();
+    const read = (key) => {
+        const held = written.get(key);
+        if (held === GONE)
+            return undefined;
+        return held ?? (Object.hasOwn(base, key) ? base[key] : undefined);
+    };
+    const draft = new Proxy({}, {
+        get(held, property, receiver) {
+            if (typeof property === 'string') {
+                const value = read(property);
+                if (value !== undefined)
+                    return value;
+            }
+            return Reflect.get(held, property, receiver);
+        },
+        has(held, property) {
+            return ((typeof property === 'string' && read(property) !== undefined) ||
+                Reflect.has(held, property));
+        },
+        ownKeys() {
+            const keys = new Set(Object.keys(base));
+            for (const [key, value] of written) {
+                if (value === GONE)
+                    keys.delete(key);
+                else
+                    keys.add(key);
+            }
+            return [...keys];
+        },
+        getOwnPropertyDescriptor(_held, property) {
+            if (typeof property !== 'string')
+                return undefined;
+            const value = read(property);
+            if (value === undefined)
+                return undefined;
+            return { value, writable: true, enumerable: true, configurable: true };
+        },
+        set(_held, property, value) {
+            if (typeof property !== 'string')
+                return false;
+            written.set(property, value);
+            return true;
+        },
+        deleteProperty(_held, property) {
+            if (typeof property !== 'string')
+                return false;
+            written.set(property, GONE);
+            return true;
+        },
+        defineProperty: () => false,
+    });
+    drafts.set(draft, { base, written });
+    return draft;
+}
+export function settled(draft) {
+    return finished(settling(draft));
+}
+export function* settling(draft) {
+    const held = drafts.get(draft);
+    const set = [];
+    const removed = [];
+    for (const [key, value] of held.written) {
+        if (value === GONE)
+            removed.push(key);
+        else
+            set.push([key, value]);
+        yield ROW_WEIGHT;
+    }
+    return yield* patching(held.base, set, removed);
+}

package/dist/shown.d.ts

@@ -0,0 +1,31 @@
+import type { DiscoveredRoom, Member } from './adapter.js';
+import type { ChangeSet } from './change-set.js';
+import type { QueueEntry } from './outcome.js';
+import type { Runtime } from './runtime.js';
+import type { Live, Moving } from './socket.js';
+import { type CycleProgress } from './status.js';
+export declare const ROOMS_TOPIC = "rooms";
+export declare const STATUS_TOPIC = "sync-status";
+export declare const REFUSAL_TOPIC = "connection-refusal";
+export declare const STORAGE_LOSS_TOPIC = "storage-loss";
+export declare const SERVICE_MODE_TOPIC = "service-mode";
+export declare const MEMBER_TOPIC = "member";
+export declare const AUTHORITY_TOPIC = "authority-changes";
+export declare const LOCKS_TOPIC = "locks";
+export declare const queueTopic: (locator: string) => string;
+export declare function recoverReads({ liveQueries, figures }: Runtime): void;
+export declare function emitRooms(runtime: Runtime, changed?: readonly string[]): Promise<void>;
+export declare function emitKnownRooms(runtime: Runtime): void;
+export declare function emitRefusal(runtime: Runtime): void;
+export declare function emitStorageLoss({ store }: Runtime): void;
+export declare function emitMember({ store }: Runtime, member: Member | null): void;
+export declare function show(runtime: Runtime): Promise<void>;
+export declare function moveTo(runtime: Runtime, next: Moving): Promise<void>;
+export declare function statusShown(runtime: Runtime): Promise<void>;
+export declare function transferring({ socket }: Runtime): Moving;
+export declare function pendingShown(runtime: Runtime): Promise<void>;
+export declare function entriesOf(runtime: Runtime, locator: string): Promise<readonly QueueEntry[]>;
+export declare function publishChangeSet(runtime: Runtime, set: ChangeSet): Promise<void>;
+export declare function roomUnreadable(runtime: Runtime, room: DiscoveredRoom): void;
+export declare function rest(runtime: Runtime, progress: CycleProgress | null, live?: Live): Promise<void>;
+//# sourceMappingURL=shown.d.ts.map

package/dist/shown.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shown.d.ts","sourceRoot":"","sources":["../src/shown.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAE3D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE/C,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAA6B,KAAK,aAAa,EAAmB,MAAM,aAAa,CAAC;AAiB7F,eAAO,MAAM,WAAW,UAAU,CAAC;AAEnC,eAAO,MAAM,YAAY,gBAAgB,CAAC;AAE1C,eAAO,MAAM,aAAa,uBAAuB,CAAC;AAElD,eAAO,MAAM,kBAAkB,iBAAiB,CAAC;AAEjD,eAAO,MAAM,kBAAkB,iBAAiB,CAAC;AAEjD,eAAO,MAAM,YAAY,WAAW,CAAC;AAErC,eAAO,MAAM,eAAe,sBAAsB,CAAC;AAEnD,eAAO,MAAM,WAAW,UAAU,CAAC;AAEnC,eAAO,MAAM,UAAU,YAAa,MAAM,WAA4B,CAAC;AA0CvE,wBAAgB,YAAY,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE,OAAO,QAG7D;AAED,wBAAgB,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAMtF;AAED,wBAAgB,cAAc,CAAC,OAAO,EAAE,OAAO,QAI9C;AA8ED,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,QAK3C;AAED,wBAAgB,eAAe,CAAC,EAAE,KAAK,EAAE,EAAE,OAAO,QAGjD;AAED,wBAAgB,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,QAEnE;AAsBD,wBAAgB,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAepD;AAED,wBAAgB,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAIpE;AAED,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAE3D;AAED,wBAAgB,YAAY,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,GAAG,MAAM,CAExD;AAED,wBAAgB,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAK5D;AAYD,wBAAsB,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,UAAU,EAAE,CAAC,CAKjG;AAcD,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAuBhF;AAED,wBAAgB,cAAc,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,cAAc,QAIpE;AAED,wBAAsB,IAAI,CACxB,OAAO,EAAE,OAAO,EAChB,QAAQ,EAAE,aAAa,GAAG,IAAI,EAC9B,IAAI,GAAE,IAAqC,iBAgC5C"}