@issuegraph/store 0.1.0

package/dist/validity.js

@@ -0,0 +1,125 @@
+/**
+ * The document algebra, and the half of `invalid` that needs no graph walk.
+ *
+ * Pure and synchronous throughout: everything here answers "what would this
+ * edit produce" or "why can it not happen", and neither question has any
+ * business touching a network, a clock or the store's state.
+ *
+ * The split with {@link ../source.ts EdgeGuard} is by what the answer NEEDS TO
+ * SEE. A self-edge, an unknown reference and a duplicate are visible in the
+ * edit itself; a cycle is only visible by walking the graph, and the walk
+ * belongs with the derivation so the package family has one of it. Both halves
+ * produce the same refusal, and neither ever reaches `dispatch`.
+ */
+import { isSymmetricEdgeField } from '@issuegraph/core';
+import { findEdge, hasIssue, makeEdge, } from "./model.js";
+/** The edge an edit produces, or `undefined` for one that produces none. */
+export function resultingEdge(document, mutation) {
+    switch (mutation.op) {
+        case 'create':
+            return makeEdge(mutation.kind, mutation.from, mutation.to);
+        case 'delete':
+            return undefined;
+        case 'retype': {
+            const edge = findEdge(document, mutation.edgeId);
+            return edge === undefined ? undefined : makeEdge(mutation.nextKind, edge.from, edge.to);
+        }
+        case 'flip': {
+            const edge = findEdge(document, mutation.edgeId);
+            return edge === undefined ? undefined : makeEdge(edge.kind, edge.to, edge.from);
+        }
+    }
+}
+/** How an edit shows up in the projection while it is unlanded. */
+export function edgeChangeFor(document, mutation) {
+    if (mutation.op === 'create') {
+        const created = makeEdge(mutation.kind, mutation.from, mutation.to);
+        return { hidden: [], drawn: [created], marked: [created.id] };
+    }
+    if (mutation.op === 'delete') {
+        return { hidden: [], drawn: [], marked: [mutation.edgeId] };
+    }
+    // retype and flip replace one edge with another, which is why they are single
+    // operations: one round trip, one undo entry, one order re-evaluation.
+    //
+    // The empty change IS reachable: a sibling write can land a delete of this
+    // edge while this one is still in flight, and an overlay on an edge that is
+    // no longer there draws nothing rather than resurrecting it.
+    const produced = resultingEdge(document, mutation);
+    if (produced === undefined)
+        return { hidden: [], drawn: [], marked: [] };
+    // A REPLACEMENT THAT PRODUCES THE SAME IDENTITY IS A MARK, NOT A SWAP. A
+    // retype to the kind the edge already has, and a flip of a symmetric edge,
+    // both name the edge they started from — so hiding the original while drawing
+    // the replacement would hide and redraw one identity, and the projection
+    // (which filters hidden ids out of BOTH sources) would erase a real, landed
+    // relationship because the user made a no-op edit. Both are refused anyway;
+    // this is what lets the refusal be SHOWN on the edge it is about.
+    if (produced.id === mutation.edgeId) {
+        return { hidden: [], drawn: [], marked: [mutation.edgeId] };
+    }
+    return { hidden: [mutation.edgeId], drawn: [produced], marked: [produced.id] };
+}
+/** The document an edit would produce, if it landed exactly as proposed. */
+export function nextDocument(document, mutation) {
+    const change = edgeChangeFor(document, mutation);
+    const removed = new Set([
+        ...change.hidden,
+        ...(mutation.op === 'delete' ? [mutation.edgeId] : []),
+    ]);
+    const kept = document.edges.filter((edge) => !removed.has(edge.id));
+    const added = change.drawn.filter((edge) => !kept.some((existing) => existing.id === edge.id));
+    return { issues: document.issues, edges: [...kept, ...added] };
+}
+function refuse(code, message) {
+    return { code, message };
+}
+/**
+ * Why this edit cannot happen, from the edit and the document alone.
+ *
+ * Returns `undefined` when nothing structural stands in the way — which is not
+ * the same as "valid": an injected guard runs afterwards and may still refuse.
+ */
+export function structuralRefusal(document, mutation) {
+    if (mutation.op === 'create') {
+        if (mutation.from === mutation.to) {
+            return refuse('self-edge', 'An issue cannot carry a relationship to itself.');
+        }
+        for (const ref of [mutation.from, mutation.to]) {
+            if (!hasIssue(document, ref)) {
+                return refuse('unknown-issue', `This document holds no issue ${ref}.`);
+            }
+        }
+        const produced = makeEdge(mutation.kind, mutation.from, mutation.to);
+        if (findEdge(document, produced.id) !== undefined) {
+            return refuse('duplicate-edge', `${mutation.from} is already ${mutation.kind} ${mutation.to}.`);
+        }
+        return undefined;
+    }
+    const edge = findEdge(document, mutation.edgeId);
+    if (edge === undefined) {
+        return refuse('unknown-edge', 'That relationship is no longer in this document.');
+    }
+    if (mutation.op === 'delete')
+        return undefined;
+    if (mutation.op === 'retype' && mutation.nextKind === edge.kind) {
+        return refuse('unchanged-kind', `That relationship is already ${edge.kind}.`);
+    }
+    if (mutation.op === 'flip') {
+        if (isSymmetricEdgeField(edge.kind)) {
+            return refuse('symmetric-edge', `${edge.kind} carries no direction, so there is nothing to flip.`);
+        }
+        if (edge.from === edge.to) {
+            return refuse('self-edge', 'A relationship from an issue to itself has no direction to flip.');
+        }
+    }
+    const produced = resultingEdge(document, mutation);
+    // `produced` cannot be undefined here — the edge was found above and neither
+    // remaining operation deletes. Narrowed rather than asserted so a future
+    // operation added to the union has to say what it produces.
+    if (produced !== undefined && produced.id !== edge.id && findEdge(document, produced.id) !== undefined) {
+        return refuse('duplicate-edge', `${produced.from} is already ${produced.kind} ${produced.to}.`);
+    }
+    return undefined;
+}
+//# sourceMappingURL=validity.js.map

package/dist/validity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validity.js","sourceRoot":"","sources":["../src/validity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAExD,OAAO,EAIL,QAAQ,EACR,QAAQ,EACR,QAAQ,GACT,MAAM,YAAY,CAAC;AAmBpB,4EAA4E;AAC5E,MAAM,UAAU,aAAa,CAAC,QAAuB,EAAE,QAAkB;IACvE,QAAQ,QAAQ,CAAC,EAAE,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC7D,KAAK,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACjD,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1F,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACjD,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClF,CAAC;IACH,CAAC;AACH,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,aAAa,CAAC,QAAuB,EAAE,QAAkB;IACvE,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;IAChE,CAAC;IACD,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;QAC7B,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;IAC9D,CAAC;IACD,8EAA8E;IAC9E,uEAAuE;IACvE,EAAE;IACF,2EAA2E;IAC3E,4EAA4E;IAC5E,6DAA6D;IAC7D,MAAM,QAAQ,GAAG,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACnD,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IACzE,yEAAyE;IACzE,2EAA2E;IAC3E,8EAA8E;IAC9E,yEAAyE;IACzE,4EAA4E;IAC5E,4EAA4E;IAC5E,kEAAkE;IAClE,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;AACjF,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,YAAY,CAAC,QAAuB,EAAE,QAAkB;IACtE,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS;QAC9B,GAAG,MAAM,CAAC,MAAM;QAChB,GAAG,CAAC,QAAQ,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;KACvD,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/F,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;AACjE,CAAC;AAED,SAAS,MAAM,CAAC,IAA2B,EAAE,OAAe;IAC1D,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAuB,EACvB,QAAkB;IAElB,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,EAAE,CAAC;YAClC,OAAO,MAAM,CAAC,WAAW,EAAE,iDAAiD,CAAC,CAAC;QAChF,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC7B,OAAO,MAAM,CAAC,eAAe,EAAE,gCAAgC,GAAG,GAAG,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;QACrE,IAAI,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;YAClD,OAAO,MAAM,CAAC,gBAAgB,EAAE,GAAG,QAAQ,CAAC,IAAI,eAAe,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;QAClG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC,cAAc,EAAE,kDAAkD,CAAC,CAAC;IACpF,CAAC;IACD,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAE/C,IAAI,QAAQ,CAAC,EAAE,KAAK,QAAQ,IAAI,QAAQ,CAAC,QAAQ,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO,MAAM,CAAC,gBAAgB,EAAE,gCAAgC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAChF,CAAC;IACD,IAAI,QAAQ,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;QAC3B,IAAI,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,OAAO,MAAM,CAAC,gBAAgB,EAAE,GAAG,IAAI,CAAC,IAAI,qDAAqD,CAAC,CAAC;QACrG,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;YAC1B,OAAO,MAAM,CAAC,WAAW,EAAE,kEAAkE,CAAC,CAAC;QACjG,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,aAAa,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACnD,6EAA6E;IAC7E,yEAAyE;IACzE,4DAA4D;IAC5D,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,IAAI,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;QACvG,OAAO,MAAM,CAAC,gBAAgB,EAAE,GAAG,QAAQ,CAAC,IAAI,eAAe,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;IAClG,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/write.d.ts

@@ -0,0 +1,79 @@
+/**
+ * The write ledger and the projection built from it — the functional core of
+ * the write loop. The store (the imperative shell) holds these values, performs
+ * the IO, and notifies; every decision about what a record becomes is made
+ * here, where it can be tested without a clock or an adapter.
+ *
+ * The rule that shapes the whole file: **a failed write is marked, never
+ * reverted.** The user's work stays on the canvas carrying a state, and the
+ * only call that removes it is one the user makes.
+ */
+import type { EdgeId, GraphDocument, StoredEdge } from './model.ts';
+import type { EdgeState, InvalidReason, Mutation, MutationId } from './mutation.ts';
+/**
+ * An edit the store is still carrying.
+ *
+ * A record that lands is REMOVED, not marked `applied`: the landed document is
+ * then the evidence, and a settled-successful record would be a second copy of
+ * a fact that can go stale against it.
+ */
+export type WriteRecord = {
+    readonly mutationId: MutationId;
+    readonly mutation: Mutation;
+    readonly state: 'pending';
+} | {
+    readonly mutationId: MutationId;
+    readonly mutation: Mutation;
+    readonly state: 'invalid';
+    readonly reason: InvalidReason;
+} | {
+    readonly mutationId: MutationId;
+    readonly mutation: Mutation;
+    readonly state: 'failed';
+    readonly reason: string;
+} | {
+    readonly mutationId: MutationId;
+    readonly mutation: Mutation;
+    readonly state: 'conflict';
+    /** The authoritative document as it stood when the conflict was reported. Held, never merged. */
+    /**
+     * The document as the adapter reported it at the moment of the conflict.
+     * Retained for the host to show; never adopted. See the README's
+     * "Resolving a conflict".
+     */
+    readonly upstream: GraphDocument;
+};
+/** The state a record contributes to the edges it marks. */
+export declare function edgeStateOf(record: WriteRecord): EdgeState;
+/** A landed or optimistic edge, with whatever states currently apply to it. */
+export interface ProjectedEdge extends StoredEdge {
+    /**
+     * Every state this edge carries, in the canonical order of `EDGE_STATES`.
+     *
+     * A list rather than one value because the states are orthogonal: an edge can
+     * be `selected` while it is `pending-write`, and a viewer draws the selection
+     * halo on top of the marching dash rather than choosing between them.
+     */
+    readonly states: readonly EdgeState[];
+    /**
+     * The unsettled edits marking this edge. A host reads the reason, and calls
+     * `retry` / `discardMine`, through these identifiers.
+     */
+    readonly writes: readonly MutationId[];
+}
+/** Whether any edit is still in flight, which is what holds the order still. */
+export declare function anyPending(records: readonly WriteRecord[]): boolean;
+/**
+ * The edges a viewer should draw: the landed document plus every unsettled
+ * edit's overlay, each carrying its state.
+ *
+ * Overlays apply in proposal order, so two edits touching one edge compose in
+ * the order the user made them.
+ *
+ * This is the ONLY place optimistic edges exist. The selection order is derived
+ * from the landed edges alone, which is what makes "optimistic rendering yes,
+ * optimistic re-ordering no" a property of the structure rather than a rule
+ * someone has to remember.
+ */
+export declare function project(landed: GraphDocument, records: readonly WriteRecord[], selection: ReadonlySet<EdgeId>): readonly ProjectedEdge[];
+//# sourceMappingURL=write.d.ts.map

package/dist/write.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"write.d.ts","sourceRoot":"","sources":["../src/write.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACpE,OAAO,KAAK,EAAE,SAAS,EAAE,aAAa,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAIpF;;;;;;GAMG;AACH,MAAM,MAAM,WAAW,GACnB;IAAE,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GAC3F;IACE,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;CAChC,GACD;IACE,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB,GACD;IACE,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,iGAAiG;IACjG;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC;CAClC,CAAC;AAEN,4DAA4D;AAC5D,wBAAgB,WAAW,CAAC,MAAM,EAAE,WAAW,GAAG,SAAS,CAW1D;AAED,+EAA+E;AAC/E,MAAM,WAAW,aAAc,SAAQ,UAAU;IAC/C;;;;;;OAMG;IACH,QAAQ,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE,CAAC;IACtC;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE,CAAC;CACxC;AAED,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,GAAG,OAAO,CAEnE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,OAAO,CACrB,MAAM,EAAE,aAAa,EACrB,OAAO,EAAE,SAAS,WAAW,EAAE,EAC/B,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,GAC7B,SAAS,aAAa,EAAE,CAwC1B"}

package/dist/write.js

@@ -0,0 +1,84 @@
+/**
+ * The write ledger and the projection built from it — the functional core of
+ * the write loop. The store (the imperative shell) holds these values, performs
+ * the IO, and notifies; every decision about what a record becomes is made
+ * here, where it can be tested without a clock or an adapter.
+ *
+ * The rule that shapes the whole file: **a failed write is marked, never
+ * reverted.** The user's work stays on the canvas carrying a state, and the
+ * only call that removes it is one the user makes.
+ */
+import { EDGE_STATES } from "./mutation.js";
+import { edgeChangeFor } from "./validity.js";
+/** The state a record contributes to the edges it marks. */
+export function edgeStateOf(record) {
+    switch (record.state) {
+        case 'pending':
+            return 'pending-write';
+        case 'invalid':
+            return 'invalid';
+        case 'failed':
+            return 'failed';
+        case 'conflict':
+            return 'conflict';
+    }
+}
+/** Whether any edit is still in flight, which is what holds the order still. */
+export function anyPending(records) {
+    return records.some((record) => record.state === 'pending');
+}
+/**
+ * The edges a viewer should draw: the landed document plus every unsettled
+ * edit's overlay, each carrying its state.
+ *
+ * Overlays apply in proposal order, so two edits touching one edge compose in
+ * the order the user made them.
+ *
+ * This is the ONLY place optimistic edges exist. The selection order is derived
+ * from the landed edges alone, which is what makes "optimistic rendering yes,
+ * optimistic re-ordering no" a property of the structure rather than a rule
+ * someone has to remember.
+ */
+export function project(landed, records, selection) {
+    const hidden = new Set();
+    const drawn = [];
+    const states = new Map();
+    const writes = new Map();
+    for (const record of records) {
+        const change = edgeChangeFor(landed, record.mutation);
+        for (const id of change.hidden)
+            hidden.add(id);
+        for (const edge of change.drawn)
+            drawn.push(edge);
+        for (const id of change.marked) {
+            const forEdge = states.get(id) ?? new Set();
+            forEdge.add(edgeStateOf(record));
+            states.set(id, forEdge);
+            writes.set(id, [...(writes.get(id) ?? []), record.mutationId]);
+        }
+    }
+    const seen = new Set();
+    const visible = [];
+    for (const edge of [...landed.edges, ...drawn]) {
+        if (hidden.has(edge.id) || seen.has(edge.id))
+            continue;
+        seen.add(edge.id);
+        visible.push(edge);
+    }
+    return visible.map((edge) => {
+        // Copied rather than mutated in place: `states` is the map built above, and
+        // adding to its entry here would make the projection depend on how many
+        // times it had been walked.
+        const applied = new Set(states.get(edge.id));
+        if (selection.has(edge.id))
+            applied.add('selected');
+        return {
+            ...edge,
+            // Canonical order, so two projections of the same state compare equal and
+            // a viewer's memoisation is not defeated by set iteration order.
+            states: EDGE_STATES.filter((state) => applied.has(state)),
+            writes: writes.get(edge.id) ?? [],
+        };
+    });
+}
+//# sourceMappingURL=write.js.map

package/dist/write.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"write.js","sourceRoot":"","sources":["../src/write.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAoC9C,4DAA4D;AAC5D,MAAM,UAAU,WAAW,CAAC,MAAmB;IAC7C,QAAQ,MAAM,CAAC,KAAK,EAAE,CAAC;QACrB,KAAK,SAAS;YACZ,OAAO,eAAe,CAAC;QACzB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,UAAU;YACb,OAAO,UAAU,CAAC;IACtB,CAAC;AACH,CAAC;AAmBD,gFAAgF;AAChF,MAAM,UAAU,UAAU,CAAC,OAA+B;IACxD,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,OAAO,CACrB,MAAqB,EACrB,OAA+B,EAC/B,SAA8B;IAE9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAE/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QACtD,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAa,CAAC;YACvD,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QAC/C,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QACvD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QAC1B,4EAA4E;QAC5E,wEAAwE;QACxE,4BAA4B;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAY,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO;YACL,GAAG,IAAI;YACP,0EAA0E;YAC1E,iEAAiE;YACjE,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACzD,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;SAClC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/package.json

@@ -0,0 +1,56 @@
+{
+  "name": "@issuegraph/store",
+  "version": "0.1.0",
+  "description": "A framework-free client store for an Issuegraph document, plus the data-source port a host plugs its tracker into. Renders edits optimistically, dispatches every mutation outward, and never re-evaluates the selection order until the write lands.",
+  "keywords": [
+    "issuegraph",
+    "dependency-graph",
+    "backlog",
+    "scheduling",
+    "optimistic-updates",
+    "store"
+  ],
+  "license": "Apache-2.0",
+  "author": "Autonomy LLC",
+  "type": "module",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "LICENSE",
+    "README.md"
+  ],
+  "sideEffects": false,
+  "publishConfig": {
+    "access": "public",
+    "provenance": true
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/autnmy/issuegraph.git",
+    "directory": "packages/store"
+  },
+  "homepage": "https://github.com/autnmy/issuegraph#readme",
+  "bugs": {
+    "url": "https://github.com/autnmy/issuegraph/issues"
+  },
+  "engines": {
+    "node": ">=18"
+  },
+  "dependencies": {
+    "@issuegraph/core": "^0.1.0"
+  },
+  "devDependencies": {
+    "@types/node": "^22.18.0",
+    "typescript": "^6.0.3"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "typecheck": "tsc -p tsconfig.test.json",
+    "test": "node --test --test-timeout=20000 \"src/**/*.test.ts\""
+  }
+}