@amalgm/live 0.2.81-main.41740705397 → 0.2.81-main.41784750721

package/dist/entities/moves.js

@@ -1,82 +0,0 @@
-/**
- * Batch move validation — the entity model's one-truth-transition law for
- * addresses (engine docs/entity-model.md, "Continuity"): the slot law and
- * acyclicity are STATE invariants — they constrain the graph after the
- * batch, never the order inside it — so movers may hold each other's slots
- * (directories exchange addresses on disk, and detection reports the
- * endpoints). A single move is a batch of one.
- *
- * A PARENTLESS mover is ADOPTION: the whole tree joins another under one
- * parent update — a tree boundary is never an identity boundary, so this
- * is the same lawful move, not a special ceremony. Adoption sheds the root
- * shape in the SAME transition: workspace is the root type only, so a
- * parentless workspace landing under a parent lands as a folder — one
- * write, never a two-step that could tear into a nested workspace.
- *
- * This module validates and PLANS; the host's store applies the returned
- * writes in one transaction.
- */
-import { CONTAINERS } from './types.js';
-import { mustGet, validName } from './rules.js';
-/**
- * Validate one batch of moves as one transition and return the writes to
- * land together. Refused whole when any move breaks a law: a mover named
- * twice, an inactive mover, an invalid name, a non-container target, two
- * movers claiming one slot, an occupied slot outside the batch, a cycle in
- * the post-state parent graph, or an inactive target chain.
- */
-export function planMoveBatch(moves, port) {
-    const byUuid = port.byUuid.bind(port);
-    const rows = new Map(); // uuid -> current row
-    const post = new Map(); // uuid -> its move
-    for (const move of moves) {
-        const { uuid, name } = move;
-        if (post.has(uuid))
-            throw new Error(`one batch moves ${uuid} once, not twice`);
-        const row = mustGet(uuid, byUuid);
-        if (row.status !== 'active') {
-            throw new Error(`only an active entity moves: ${uuid} is ${row.status}`);
-        }
-        validName(name);
-        rows.set(uuid, row);
-        post.set(uuid, move);
-    }
-    const postParentOf = (uuid) => post.get(uuid)?.parentUUID ?? mustGet(uuid, byUuid).parentUuid;
-    const targets = new Set();
-    for (const { uuid, parentUUID, name } of moves) {
-        const parent = mustGet(parentUUID, byUuid);
-        if (!CONTAINERS.has(parent.type)) {
-            throw new Error(`only containers hold active children: ${parentUUID} is ${parent.type}, not workspace/folder/repo.git`);
-        }
-        const slot = `${parentUUID}\0${name}`;
-        if (targets.has(slot))
-            throw new Error(`slot taken: two movers claim (${parentUUID}, ${name}) in one batch`);
-        targets.add(slot);
-        const occupant = port.activeChildByName(parentUUID, name);
-        if (occupant && occupant.uuid !== uuid && !post.has(occupant.uuid)) {
-            throw new Error(`slot taken: active entity ${occupant.uuid} already owns (${parentUUID}, ${name}) — move or trash it first`);
-        }
-        // The target parent's whole post-state chain: acyclic and effectively
-        // active, walked once.
-        const seen = new Set();
-        let cursor = parentUUID;
-        while (cursor !== null) {
-            if (cursor === uuid) {
-                throw new Error(`the parent graph is acyclic: ${uuid} cannot live under itself`);
-            }
-            if (seen.has(cursor))
-                throw new Error(`registry corrupt: parent cycle at ${cursor}`);
-            seen.add(cursor);
-            if (mustGet(cursor, byUuid).status !== 'active') {
-                throw new Error(`parent ${parentUUID} is not effectively active — restore it before putting entities under it`);
-            }
-            cursor = postParentOf(cursor);
-        }
-    }
-    return moves.map(({ uuid, parentUUID, name }) => {
-        const row = rows.get(uuid); // seated in the first pass
-        const adoptedWorkspace = row.parentUuid === null && row.type === 'workspace';
-        return { uuid, parentUuid: parentUUID, name, ...(adoptedWorkspace ? { type: 'folder' } : {}) };
-    });
-}
-//# sourceMappingURL=moves.js.map

package/dist/entities/moves.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"moves.js","sourceRoot":"","sources":["../../src/entities/moves.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAuC,MAAM,YAAY,CAAC;AAC7E,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAkBhD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAA4B,EAAE,IAAoB;IAC9E,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC,CAAC,sBAAsB;IACjE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAC,mBAAmB;IAC/D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,kBAAkB,CAAC,CAAC;QAC/E,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,OAAO,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,YAAY,GAAG,CAAC,IAAY,EAAiB,EAAE,CACnD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,IAAI,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,UAAU,CAAC;IACjE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAC/C,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,yCAAyC,UAAU,OAAO,MAAM,CAAC,IAAI,iCAAiC,CAAC,CAAC;QAC1H,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,UAAU,KAAK,IAAI,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,UAAU,KAAK,IAAI,gBAAgB,CAAC,CAAC;QAC7G,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC1D,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnE,MAAM,IAAI,KAAK,CAAC,6BAA6B,QAAQ,CAAC,IAAI,kBAAkB,UAAU,KAAK,IAAI,4BAA4B,CAAC,CAAC;QAC/H,CAAC;QACD,sEAAsE;QACtE,uBAAuB;QACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,MAAM,GAAkB,UAAU,CAAC;QACvC,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;YACvB,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,2BAA2B,CAAC,CAAC;YACnF,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,EAAE,CAAC,CAAC;YACrF,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjB,IAAI,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CAAC,UAAU,UAAU,0EAA0E,CAAC,CAAC;YAClH,CAAC;YACD,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,2BAA2B;QACxD,MAAM,gBAAgB,GAAG,GAAG,CAAC,UAAU,KAAK,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,CAAC;QAC7E,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAC1G,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/entities/trash.d.ts

@@ -1,7 +0,0 @@
-/** Trash expiry uses the authority's accepted Trash time, never a device clock. */
-import type { EntityStatus } from './types.js';
-export declare const TRASH_RETENTION_MS: number;
-/** Permanent removal is eligible at the end of 30 days in the current Trash
- * episode. Restore cancels that episode; a later Trash starts a new one. */
-export declare function trashHasExpired(status: EntityStatus, trashedAt: number, authorityNow: number): boolean;
-//# sourceMappingURL=trash.d.ts.map

package/dist/entities/trash.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"trash.d.ts","sourceRoot":"","sources":["../../src/entities/trash.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,eAAO,MAAM,kBAAkB,QAA2B,CAAC;AAE3D;4EAC4E;AAC5E,wBAAgB,eAAe,CAC7B,MAAM,EAAE,YAAY,EACpB,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,GACnB,OAAO,CAKT"}

package/dist/entities/trash.js

@@ -1,10 +0,0 @@
-export const TRASH_RETENTION_MS = 30 * 24 * 60 * 60 * 1000;
-/** Permanent removal is eligible at the end of 30 days in the current Trash
- * episode. Restore cancels that episode; a later Trash starts a new one. */
-export function trashHasExpired(status, trashedAt, authorityNow) {
-    if (![trashedAt, authorityNow].every(value => Number.isSafeInteger(value) && value >= 0)) {
-        throw new Error('Trash expiry requires valid authority timestamps');
-    }
-    return status === 'trashed' && authorityNow - trashedAt >= TRASH_RETENTION_MS;
-}
-//# sourceMappingURL=trash.js.map

package/dist/entities/trash.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"trash.js","sourceRoot":"","sources":["../../src/entities/trash.ts"],"names":[],"mappings":"AAGA,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE3D;4EAC4E;AAC5E,MAAM,UAAU,eAAe,CAC7B,MAAoB,EACpB,SAAiB,EACjB,YAAoB;IAEpB,IAAI,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;QACzF,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,MAAM,KAAK,SAAS,IAAI,YAAY,GAAG,SAAS,IAAI,kBAAkB,CAAC;AAChF,CAAC"}

package/dist/workspace/memory-store.d.ts

@@ -1,7 +0,0 @@
-import type { WorkspaceEntry, WorkspaceStore } from './types.js';
-export declare class MemoryWorkspaceStore implements WorkspaceStore {
-    #private;
-    list(): readonly WorkspaceEntry[];
-    replace(entries: readonly WorkspaceEntry[]): void;
-}
-//# sourceMappingURL=memory-store.d.ts.map

package/dist/workspace/memory-store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-store.d.ts","sourceRoot":"","sources":["../../src/workspace/memory-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAGjE,qBAAa,oBAAqB,YAAW,cAAc;;IAGzD,IAAI,IAAI,SAAS,cAAc,EAAE;IAKjC,OAAO,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,GAAG,IAAI;CAIlD"}

package/dist/workspace/memory-store.js

@@ -1,16 +0,0 @@
-import { assertWorkspaceEntries } from './entries.js';
-export class MemoryWorkspaceStore {
-    #entries = new Map();
-    list() {
-        return [...this.#entries.values()]
-            .sort((left, right) => left.name.localeCompare(right.name) || entryPath(left).localeCompare(entryPath(right)));
-    }
-    replace(entries) {
-        assertWorkspaceEntries(entries);
-        this.#entries = new Map(entries.map((entry) => [entry.id, entry]));
-    }
-}
-function entryPath(entry) {
-    return entry.kind === 'group' ? entry.folders[0]?.path ?? '' : entry.path;
-}
-//# sourceMappingURL=memory-store.js.map

package/dist/workspace/memory-store.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-store.js","sourceRoot":"","sources":["../../src/workspace/memory-store.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAEtD,MAAM,OAAO,oBAAoB;IAC/B,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;IAE7C,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;aAC/B,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,OAAO,CAAC,OAAkC;QACxC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;CACF;AAED,SAAS,SAAS,CAAC,KAAqB;IACtC,OAAO,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;AAC5E,CAAC"}

package/dist-cjs/apply/content-results.js

@@ -1,58 +0,0 @@
-"use strict";
-/** Portable private-result construction for file, link, and construct adapters. */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.prepareTextResult = prepareTextResult;
-exports.prepareBinaryResult = prepareBinaryResult;
-exports.prepareLinkResult = prepareLinkResult;
-const content_js_1 = require("../detection/content.js");
-const bytes_js_1 = require("../entities/bytes.js");
-const exactResult = (bytes, expected, sha256Hex, label) => {
-    if (sha256Hex(bytes) !== expected) {
-        throw new Error(`${label} does not match its accepted complete result`);
-    }
-    return bytes;
-};
-/**
- * Construct text privately. The snapshot is mandatory truth. A delta is only
- * a shortcut over the exact immutable base; reproduceTextChange falls back to
- * the already-verified snapshot on every base or result mismatch. The returned
- * snapshot reference remains caller-owned immutable input; Apply never mutates
- * it and the host streams it into private staging.
- */
-function prepareTextResult(plan, snapshot, exactBase, sha256Hex) {
-    const verifiedSnapshot = exactResult(snapshot, plan.artifact.contentHash, sha256Hex, 'text Apply snapshot');
-    if (plan.strategy.kind === 'snapshot')
-        return verifiedSnapshot;
-    return (0, content_js_1.reproduceTextChange)(exactBase, {
-        kind: 'file.text',
-        mode: 'delta',
-        basePayloadVersion: plan.strategy.basePayloadVersion,
-        resultPayloadVersion: plan.artifact.contentHash,
-        delta: plan.strategy.delta,
-    }, verifiedSnapshot, sha256Hex);
-}
-/** Verify reusable blocks while streaming them into private staging. A
- * construct payload stages exactly like a binary file. */
-async function prepareBinaryResult(plan, read, sink, sha256Hex) {
-    for (const [index, expected] of plan.manifest.chunks.entries()) {
-        const chunk = await read(index);
-        if (!(chunk instanceof Uint8Array)
-            || chunk.byteLength !== expected.bytes
-            || sha256Hex(chunk) !== expected.sha256) {
-            throw new Error(`binary Apply block ${index} failed verification`);
-        }
-        await sink.write(index, chunk);
-    }
-    const receipt = await sink.seal();
-    if (receipt.bytes !== plan.manifest.bytes
-        || receipt.contentHash !== plan.artifact.contentHash) {
-        throw new Error('binary Apply staged result failed complete verification');
-    }
-    return Object.freeze({ ...receipt });
-}
-/** A link result is only its literal UTF-8 target bytes. */
-function prepareLinkResult(plan, sha256Hex) {
-    exactResult((0, bytes_js_1.utf8Encode)(plan.targetText), plan.artifact.contentHash, sha256Hex, 'link Apply target');
-    return plan.targetText;
-}
-//# sourceMappingURL=content-results.js.map

package/dist-cjs/apply/content-results.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"content-results.js","sourceRoot":"","sources":["../../src/apply/content-results.ts"],"names":[],"mappings":";AAAA,mFAAmF;;AA+BnF,8CAiBC;AAgBD,kDAqBC;AAGD,8CAKC;AA3FD,wDAA8D;AAC9D,mDAAkD;AASlD,MAAM,WAAW,GAAG,CAClB,KAAiB,EACjB,QAAgB,EAChB,SAAoB,EACpB,KAAa,EACD,EAAE;IACd,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,8CAA8C,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAC/B,IAAmB,EACnB,QAAoB,EACpB,SAA4B,EAC5B,SAAoB;IAEpB,MAAM,gBAAgB,GAAG,WAAW,CAClC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,EAAE,qBAAqB,CACtE,CAAC;IACF,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,gBAAgB,CAAC;IAC/D,OAAO,IAAA,gCAAmB,EAAC,SAAS,EAAE;QACpC,IAAI,EAAE,WAAW;QACjB,IAAI,EAAE,OAAO;QACb,kBAAkB,EAAE,IAAI,CAAC,QAAQ,CAAC,kBAAkB;QACpD,oBAAoB,EAAE,IAAI,CAAC,QAAQ,CAAC,WAAW;QAC/C,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK;KAC3B,EAAE,gBAAgB,EAAE,SAAS,CAAC,CAAC;AAClC,CAAC;AAcD;0DAC0D;AACnD,KAAK,UAAU,mBAAmB,CACvC,IAA0C,EAC1C,IAA4C,EAC5C,IAAqB,EACrB,SAAoB;IAEpB,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/D,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,CAAC,KAAK,YAAY,UAAU,CAAC;eAC7B,KAAK,CAAC,UAAU,KAAK,QAAQ,CAAC,KAAK;eACnC,SAAS,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CAAC,sBAAsB,KAAK,sBAAsB,CAAC,CAAC;QACrE,CAAC;QACD,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;IAClC,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK;WACpC,OAAO,CAAC,WAAW,KAAK,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;QACvD,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;AACvC,CAAC;AAED,4DAA4D;AAC5D,SAAgB,iBAAiB,CAAC,IAAmB,EAAE,SAAoB;IACzE,WAAW,CACT,IAAA,qBAAU,EAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,EAAE,mBAAmB,CACvF,CAAC;IACF,OAAO,IAAI,CAAC,UAAU,CAAC;AACzB,CAAC"}

package/dist-cjs/apply/local-work.js

@@ -1,34 +0,0 @@
-"use strict";
-/**
- * Local work after a target: the local records that protect working ground
- * from an older accepted result. The Apply store answers it inside its
- * transaction; this is its pure form.
- *
- * An entity speaks only on its own channel, so a local record protects an
- * entity from a target when it is on that entity's channel and is not ordered
- * at or before the target. Order is delivery position, the one order every
- * channel shares; a channel's own sequence orders only that channel and never
- * decides here.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.hasLocalWorkAfter = hasLocalWorkAfter;
-/**
- * True when a local record on the entity's channel has a position that is
- * unknown or after `targetDelivery`. Its position is its stamp, or, before
- * the stamp lands, the Inbox position of the same mutation: Receive may hold
- * this computer's own record first, and a result ordered at or before the
- * target is older than it, never newer. A local record at the target is the
- * target itself, which Apply verifies against the already-equal disk.
- */
-function hasLocalWorkAfter(local, received, entityId, targetDelivery) {
-    if (!entityId || !Number.isSafeInteger(targetDelivery) || targetDelivery < 1) {
-        throw new Error('Apply local-work target is invalid');
-    }
-    return local.some((work) => {
-        if (work.entityId !== entityId)
-            return false;
-        const position = work.deliverySequence ?? received.find((delivered) => (delivered.entityId === work.entityId && delivered.mutationId === work.mutationId))?.deliverySequence;
-        return position === undefined || position > targetDelivery;
-    });
-}
-//# sourceMappingURL=local-work.js.map

package/dist-cjs/apply/local-work.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"local-work.js","sourceRoot":"","sources":["../../src/apply/local-work.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;AAyBH,8CAgBC;AAxBD;;;;;;;GAOG;AACH,SAAgB,iBAAiB,CAC/B,KAA2B,EAC3B,QAAsC,EACtC,QAAgB,EAChB,cAAsB;IAEtB,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QAC7E,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ;YAAE,OAAO,KAAK,CAAC;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CACrE,SAAS,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU,CACjF,CAAC,EAAE,gBAAgB,CAAC;QACrB,OAAO,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,cAAc,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist-cjs/entities/digest-steps.js

@@ -1,30 +0,0 @@
-"use strict";
-/**
- * Digests taken in steps (steps.ts): bytes a block per step, and JSON text a
- * bounded run per step (json-steps.ts). Each digests exactly the bytes its
- * whole-input form would, so the hash is the same however the steps are
- * paced.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.digestSteps = digestSteps;
-exports.jsonDigestSteps = jsonDigestSteps;
-const steps_js_1 = require("../steps.js");
-const bytes_js_1 = require("./bytes.js");
-const json_steps_js_1 = require("./json-steps.js");
-/** The SHA-256 of `bytes`. */
-function* digestSteps(bytes, createSha256) {
-    const hash = createSha256();
-    for (let offset = 0; offset < bytes.length; offset += steps_js_1.BYTES_PER_BOUNDARY) {
-        hash.update(bytes.subarray(offset, offset + steps_js_1.BYTES_PER_BOUNDARY));
-        yield;
-    }
-    return hash.digestHex();
-}
-/** The SHA-256 of the UTF-8 text JSON.stringify writes for plain JSON data,
- * each JsonItems standing for its mapped array. */
-function* jsonDigestSteps(value, createSha256) {
-    const hash = createSha256();
-    yield* (0, json_steps_js_1.jsonTextSteps)(value, text => hash.update((0, bytes_js_1.utf8Encode)(text)));
-    return hash.digestHex();
-}
-//# sourceMappingURL=digest-steps.js.map

package/dist-cjs/entities/digest-steps.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"digest-steps.js","sourceRoot":"","sources":["../../src/entities/digest-steps.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAQH,kCAOC;AAID,0CAIC;AArBD,0CAA6D;AAC7D,yCAAwC;AACxC,mDAAgD;AAGhD,8BAA8B;AAC9B,QAAe,CAAC,CAAC,WAAW,CAAC,KAAiB,EAAE,YAA0B;IACxE,MAAM,IAAI,GAAG,YAAY,EAAE,CAAC;IAC5B,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,MAAM,IAAI,6BAAkB,EAAE,CAAC;QACzE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,6BAAkB,CAAC,CAAC,CAAC;QACjE,KAAK,CAAC;IACR,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;AAC1B,CAAC;AAED;mDACmD;AACnD,QAAe,CAAC,CAAC,eAAe,CAAC,KAAc,EAAE,YAA0B;IACzE,MAAM,IAAI,GAAG,YAAY,EAAE,CAAC;IAC5B,KAAK,CAAC,CAAC,IAAA,6BAAa,EAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAA,qBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnE,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;AAC1B,CAAC"}

package/dist-cjs/entities/json-steps.js

@@ -1,135 +0,0 @@
-"use strict";
-/**
- * JSON text written in steps (steps.ts): exactly the text JSON.stringify
- * writes for plain JSON data, handed out in bounded runs, so a long list or
- * string never holds a host's thread however the steps are paced.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.JsonItems = void 0;
-exports.jsonTextSteps = jsonTextSteps;
-const steps_js_1 = require("../steps.js");
-/** JSON text, in UTF-16 code units, handed out between boundaries: at most
- * three UTF-8 bytes each, six for an escaped control character. A string
- * longer than this is written in pieces of this length. */
-const TEXT_PER_BOUNDARY = steps_js_1.BYTES_PER_BOUNDARY / 4;
-/** An array within JSON text standing for `items.map(json)`, so a long list
- * is never copied just to be written. */
-class JsonItems {
-    items;
-    json;
-    constructor(items, json) {
-        this.items = items;
-        this.json = json;
-    }
-}
-exports.JsonItems = JsonItems;
-/** The most UTF-16 code units JSON text spends on a value that is not a
- * string, array or object. */
-const SCALAR_TEXT = 24;
-/** What remains of `budget` code units once `value`'s text is spent from it,
- * before escaping, negative as soon as the text is surely longer. A
- * JsonItems is always longer. */
-function remaining(value, budget) {
-    if (typeof value === 'string')
-        return budget - value.length - 2;
-    if (typeof value !== 'object' || value === null)
-        return budget - SCALAR_TEXT;
-    if (value instanceof JsonItems)
-        return -1;
-    budget -= 2;
-    if (Array.isArray(value)) {
-        for (let index = 0; index < value.length && budget >= 0; index += 1) {
-            budget = remaining(value[index], budget - 1);
-        }
-        return budget;
-    }
-    for (const key in value) {
-        if (budget < 0)
-            break;
-        budget = remaining(value[key], budget - key.length - 4);
-    }
-    return budget;
-}
-/** Whether a value's JSON text is surely short, so it is written whole. */
-const short = (value) => remaining(value, TEXT_PER_BOUNDARY) >= 0;
-/** What JSON.stringify writes for a value, where a value it omits is `null`
- * inside an array and nothing in an object. */
-function whole(value, inArray) {
-    return JSON.stringify(value) ?? (inArray ? 'null' : '');
-}
-/**
- * Hand `write` the text JSON.stringify writes for `value`, each JsonItems
- * standing for its mapped array, in runs that join to exactly that text.
- * A value whose text is surely short is written whole; longer strings,
- * arrays and objects are walked, a boundary after each run of items or text.
- */
-function* jsonTextSteps(value, write) {
-    let text = '', work = 0;
-    function* walk(value) {
-        if (typeof value === 'string') {
-            text += '"';
-            for (let start = 0; start < value.length;) {
-                // A piece never ends between the two halves of a surrogate pair.
-                let end = Math.min(start + TEXT_PER_BOUNDARY, value.length);
-                const last = value.charCodeAt(end - 1);
-                if (end < value.length && last >= 0xd800 && last <= 0xdbff)
-                    end -= 1;
-                text += JSON.stringify(value.slice(start, end)).slice(1, -1);
-                start = end;
-                write(text);
-                text = '';
-                yield;
-            }
-            text += '"';
-            return;
-        }
-        const mapped = value instanceof JsonItems;
-        if (mapped || Array.isArray(value)) {
-            const items = mapped ? value.items : value;
-            text += '[';
-            for (let index = 0; index < items.length; index += 1) {
-                if (index > 0)
-                    text += ',';
-                const item = !(index in items) ? undefined
-                    : mapped ? value.json(items[index]) : items[index];
-                if (short(item))
-                    text += whole(item, true);
-                else
-                    yield* walk(item);
-                if (++work % steps_js_1.ITEMS_PER_BOUNDARY === 0 || text.length >= TEXT_PER_BOUNDARY) {
-                    write(text);
-                    text = '';
-                    yield;
-                }
-            }
-            text += ']';
-            return;
-        }
-        const fields = value;
-        text += '{';
-        let first = true;
-        for (const key of Object.keys(fields)) {
-            const field = fields[key];
-            if (field === undefined || typeof field === 'function' || typeof field === 'symbol')
-                continue;
-            text += `${first ? '' : ','}${JSON.stringify(key)}:`;
-            first = false;
-            if (short(field))
-                text += whole(field, false);
-            else
-                yield* walk(field);
-            if (++work % steps_js_1.ITEMS_PER_BOUNDARY === 0 || text.length >= TEXT_PER_BOUNDARY) {
-                write(text);
-                text = '';
-                yield;
-            }
-        }
-        text += '}';
-    }
-    if (short(value))
-        text = whole(value, false);
-    else
-        yield* walk(value);
-    write(text);
-}
-//# sourceMappingURL=json-steps.js.map

package/dist-cjs/entities/json-steps.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"json-steps.js","sourceRoot":"","sources":["../../src/entities/json-steps.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AA6DH,sCA2DC;AAtHD,0CAAiF;AAEjF;;2DAE2D;AAC3D,MAAM,iBAAiB,GAAG,6BAAkB,GAAG,CAAC,CAAC;AAEjD;yCACyC;AACzC,MAAa,SAAS;IACX,KAAK,CAAe;IACpB,IAAI,CAAuB;IAEpC,YAAY,KAAmB,EAAE,IAA0B;QACzD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AARD,8BAQC;AAED;8BAC8B;AAC9B,MAAM,WAAW,GAAG,EAAE,CAAC;AAEvB;;iCAEiC;AACjC,SAAS,SAAS,CAAC,KAAc,EAAE,MAAc;IAC/C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAChE,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,GAAG,WAAW,CAAC;IAC7E,IAAI,KAAK,YAAY,SAAS;QAAE,OAAO,CAAC,CAAC,CAAC;IAC1C,MAAM,IAAI,CAAC,CAAC;IACZ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACpE,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,MAAM,GAAG,CAAC;YAAE,MAAM;QACtB,MAAM,GAAG,SAAS,CAAE,KAAiC,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvF,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,2EAA2E;AAC3E,MAAM,KAAK,GAAG,CAAC,KAAc,EAAW,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC;AAEpF;+CAC+C;AAC/C,SAAS,KAAK,CAAC,KAAc,EAAE,OAAgB;IAC7C,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;GAKG;AACH,QAAe,CAAC,CAAC,aAAa,CAAC,KAAc,EAAE,KAA6B;IAC1E,IAAI,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC;IACxB,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAc;QAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,IAAI,GAAG,CAAC;YACZ,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC;gBAC1C,iEAAiE;gBACjE,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,iBAAiB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC5D,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;gBACvC,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM;oBAAE,GAAG,IAAI,CAAC,CAAC;gBACrE,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC7D,KAAK,GAAG,GAAG,CAAC;gBACZ,KAAK,CAAC,IAAI,CAAC,CAAC;gBACZ,IAAI,GAAG,EAAE,CAAC;gBACV,KAAK,CAAC;YACR,CAAC;YACD,IAAI,IAAI,GAAG,CAAC;YACZ,OAAO;QACT,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,YAAY,SAAS,CAAC;QAC1C,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,MAAM,KAAK,GAAuB,MAAM,CAAC,CAAC,CAAE,KAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,KAAkB,CAAC;YACpG,IAAI,IAAI,GAAG,CAAC;YACZ,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;gBACrD,IAAI,KAAK,GAAG,CAAC;oBAAE,IAAI,IAAI,GAAG,CAAC;gBAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;oBACxC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAE,KAA4B,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC7E,IAAI,KAAK,CAAC,IAAI,CAAC;oBAAE,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;;oBACtC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,IAAI,EAAE,IAAI,GAAG,6BAAkB,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,iBAAiB,EAAE,CAAC;oBAC1E,KAAK,CAAC,IAAI,CAAC,CAAC;oBACZ,IAAI,GAAG,EAAE,CAAC;oBACV,KAAK,CAAC;gBACR,CAAC;YACH,CAAC;YACD,IAAI,IAAI,GAAG,CAAC;YACZ,OAAO;QACT,CAAC;QACD,MAAM,MAAM,GAAG,KAAgC,CAAC;QAChD,IAAI,IAAI,GAAG,CAAC;QACZ,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,UAAU,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,SAAS;YAC9F,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;YACrD,KAAK,GAAG,KAAK,CAAC;YACd,IAAI,KAAK,CAAC,KAAK,CAAC;gBAAE,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;;gBACzC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxB,IAAI,EAAE,IAAI,GAAG,6BAAkB,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,iBAAiB,EAAE,CAAC;gBAC1E,KAAK,CAAC,IAAI,CAAC,CAAC;gBACZ,IAAI,GAAG,EAAE,CAAC;gBACV,KAAK,CAAC;YACR,CAAC;QACH,CAAC;QACD,IAAI,IAAI,GAAG,CAAC;IACd,CAAC;IACD,IAAI,KAAK,CAAC,KAAK,CAAC;QAAE,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;;QACxC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxB,KAAK,CAAC,IAAI,CAAC,CAAC;AACd,CAAC"}

package/dist-cjs/entities/moves.js

@@ -1,85 +0,0 @@
-"use strict";
-/**
- * Batch move validation — the entity model's one-truth-transition law for
- * addresses (engine docs/entity-model.md, "Continuity"): the slot law and
- * acyclicity are STATE invariants — they constrain the graph after the
- * batch, never the order inside it — so movers may hold each other's slots
- * (directories exchange addresses on disk, and detection reports the
- * endpoints). A single move is a batch of one.
- *
- * A PARENTLESS mover is ADOPTION: the whole tree joins another under one
- * parent update — a tree boundary is never an identity boundary, so this
- * is the same lawful move, not a special ceremony. Adoption sheds the root
- * shape in the SAME transition: workspace is the root type only, so a
- * parentless workspace landing under a parent lands as a folder — one
- * write, never a two-step that could tear into a nested workspace.
- *
- * This module validates and PLANS; the host's store applies the returned
- * writes in one transaction.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.planMoveBatch = planMoveBatch;
-const types_js_1 = require("./types.js");
-const rules_js_1 = require("./rules.js");
-/**
- * Validate one batch of moves as one transition and return the writes to
- * land together. Refused whole when any move breaks a law: a mover named
- * twice, an inactive mover, an invalid name, a non-container target, two
- * movers claiming one slot, an occupied slot outside the batch, a cycle in
- * the post-state parent graph, or an inactive target chain.
- */
-function planMoveBatch(moves, port) {
-    const byUuid = port.byUuid.bind(port);
-    const rows = new Map(); // uuid -> current row
-    const post = new Map(); // uuid -> its move
-    for (const move of moves) {
-        const { uuid, name } = move;
-        if (post.has(uuid))
-            throw new Error(`one batch moves ${uuid} once, not twice`);
-        const row = (0, rules_js_1.mustGet)(uuid, byUuid);
-        if (row.status !== 'active') {
-            throw new Error(`only an active entity moves: ${uuid} is ${row.status}`);
-        }
-        (0, rules_js_1.validName)(name);
-        rows.set(uuid, row);
-        post.set(uuid, move);
-    }
-    const postParentOf = (uuid) => post.get(uuid)?.parentUUID ?? (0, rules_js_1.mustGet)(uuid, byUuid).parentUuid;
-    const targets = new Set();
-    for (const { uuid, parentUUID, name } of moves) {
-        const parent = (0, rules_js_1.mustGet)(parentUUID, byUuid);
-        if (!types_js_1.CONTAINERS.has(parent.type)) {
-            throw new Error(`only containers hold active children: ${parentUUID} is ${parent.type}, not workspace/folder/repo.git`);
-        }
-        const slot = `${parentUUID}\0${name}`;
-        if (targets.has(slot))
-            throw new Error(`slot taken: two movers claim (${parentUUID}, ${name}) in one batch`);
-        targets.add(slot);
-        const occupant = port.activeChildByName(parentUUID, name);
-        if (occupant && occupant.uuid !== uuid && !post.has(occupant.uuid)) {
-            throw new Error(`slot taken: active entity ${occupant.uuid} already owns (${parentUUID}, ${name}) — move or trash it first`);
-        }
-        // The target parent's whole post-state chain: acyclic and effectively
-        // active, walked once.
-        const seen = new Set();
-        let cursor = parentUUID;
-        while (cursor !== null) {
-            if (cursor === uuid) {
-                throw new Error(`the parent graph is acyclic: ${uuid} cannot live under itself`);
-            }
-            if (seen.has(cursor))
-                throw new Error(`registry corrupt: parent cycle at ${cursor}`);
-            seen.add(cursor);
-            if ((0, rules_js_1.mustGet)(cursor, byUuid).status !== 'active') {
-                throw new Error(`parent ${parentUUID} is not effectively active — restore it before putting entities under it`);
-            }
-            cursor = postParentOf(cursor);
-        }
-    }
-    return moves.map(({ uuid, parentUUID, name }) => {
-        const row = rows.get(uuid); // seated in the first pass
-        const adoptedWorkspace = row.parentUuid === null && row.type === 'workspace';
-        return { uuid, parentUuid: parentUUID, name, ...(adoptedWorkspace ? { type: 'folder' } : {}) };
-    });
-}
-//# sourceMappingURL=moves.js.map

package/dist-cjs/entities/moves.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"moves.js","sourceRoot":"","sources":["../../src/entities/moves.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;AA4BH,sCAmDC;AA7ED,yCAA6E;AAC7E,yCAAgD;AAkBhD;;;;;;GAMG;AACH,SAAgB,aAAa,CAAC,KAA4B,EAAE,IAAoB;IAC9E,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC,CAAC,sBAAsB;IACjE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAC,mBAAmB;IAC/D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,kBAAkB,CAAC,CAAC;QAC/E,MAAM,GAAG,GAAG,IAAA,kBAAO,EAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,OAAO,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,IAAA,oBAAS,EAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,YAAY,GAAG,CAAC,IAAY,EAAiB,EAAE,CACnD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,UAAU,IAAI,IAAA,kBAAO,EAAC,IAAI,EAAE,MAAM,CAAC,CAAC,UAAU,CAAC;IACjE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAA,kBAAO,EAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,qBAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,yCAAyC,UAAU,OAAO,MAAM,CAAC,IAAI,iCAAiC,CAAC,CAAC;QAC1H,CAAC;QACD,MAAM,IAAI,GAAG,GAAG,UAAU,KAAK,IAAI,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,UAAU,KAAK,IAAI,gBAAgB,CAAC,CAAC;QAC7G,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC1D,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnE,MAAM,IAAI,KAAK,CAAC,6BAA6B,QAAQ,CAAC,IAAI,kBAAkB,UAAU,KAAK,IAAI,4BAA4B,CAAC,CAAC;QAC/H,CAAC;QACD,sEAAsE;QACtE,uBAAuB;QACvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,MAAM,GAAkB,UAAU,CAAC;QACvC,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;YACvB,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,2BAA2B,CAAC,CAAC;YACnF,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,EAAE,CAAC,CAAC;YACrF,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjB,IAAI,IAAA,kBAAO,EAAC,MAAM,EAAE,MAAM,CAAC,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CAAC,UAAU,UAAU,0EAA0E,CAAC,CAAC;YAClH,CAAC;YACD,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,2BAA2B;QACxD,MAAM,gBAAgB,GAAG,GAAG,CAAC,UAAU,KAAK,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,CAAC;QAC7E,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;IAC1G,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist-cjs/entities/trash.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TRASH_RETENTION_MS = void 0;
-exports.trashHasExpired = trashHasExpired;
-exports.TRASH_RETENTION_MS = 30 * 24 * 60 * 60 * 1000;
-/** Permanent removal is eligible at the end of 30 days in the current Trash
- * episode. Restore cancels that episode; a later Trash starts a new one. */
-function trashHasExpired(status, trashedAt, authorityNow) {
-    if (![trashedAt, authorityNow].every(value => Number.isSafeInteger(value) && value >= 0)) {
-        throw new Error('Trash expiry requires valid authority timestamps');
-    }
-    return status === 'trashed' && authorityNow - trashedAt >= exports.TRASH_RETENTION_MS;
-}
-//# sourceMappingURL=trash.js.map

package/dist-cjs/entities/trash.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"trash.js","sourceRoot":"","sources":["../../src/entities/trash.ts"],"names":[],"mappings":";;;AAOA,0CASC;AAbY,QAAA,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE3D;4EAC4E;AAC5E,SAAgB,eAAe,CAC7B,MAAoB,EACpB,SAAiB,EACjB,YAAoB;IAEpB,IAAI,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;QACzF,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;IACtE,CAAC;IACD,OAAO,MAAM,KAAK,SAAS,IAAI,YAAY,GAAG,SAAS,IAAI,0BAAkB,CAAC;AAChF,CAAC"}

package/dist-cjs/workspace/memory-store.js

@@ -1,20 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MemoryWorkspaceStore = void 0;
-const entries_js_1 = require("./entries.js");
-class MemoryWorkspaceStore {
-    #entries = new Map();
-    list() {
-        return [...this.#entries.values()]
-            .sort((left, right) => left.name.localeCompare(right.name) || entryPath(left).localeCompare(entryPath(right)));
-    }
-    replace(entries) {
-        (0, entries_js_1.assertWorkspaceEntries)(entries);
-        this.#entries = new Map(entries.map((entry) => [entry.id, entry]));
-    }
-}
-exports.MemoryWorkspaceStore = MemoryWorkspaceStore;
-function entryPath(entry) {
-    return entry.kind === 'group' ? entry.folders[0]?.path ?? '' : entry.path;
-}
-//# sourceMappingURL=memory-store.js.map

package/dist-cjs/workspace/memory-store.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-store.js","sourceRoot":"","sources":["../../src/workspace/memory-store.ts"],"names":[],"mappings":";;;AACA,6CAAsD;AAEtD,MAAa,oBAAoB;IAC/B,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;IAE7C,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;aAC/B,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,OAAO,CAAC,OAAkC;QACxC,IAAA,mCAAsB,EAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;CACF;AAZD,oDAYC;AAED,SAAS,SAAS,CAAC,KAAqB;IACtC,OAAO,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;AAC5E,CAAC"}