@issuegraph/store 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,239 @@
+# @issuegraph/store
+
+A framework-free client store for an [Issuegraph](https://github.com/autnmy/issuegraph)
+document, and the data-source port a host plugs its own tracker in through.
+
+**The package fetches nothing, authenticates nothing and persists nothing.** It holds the
+document, renders edits optimistically, dispatches every one of them outward, and refuses to
+re-evaluate the selection order until a write has actually landed.
+
+```
+npm install @issuegraph/store
+```
+
+Apache-2.0. `0.x`, and the API is unstable until `1.0` — a published package is a public
+commitment, and this one is not making it yet.
+
+---
+
+## The five-minute version
+
+```ts
+import { createMemorySource, createStore } from '@issuegraph/store';
+
+const store = createStore({
+  source: createMemorySource({
+    issues: [
+      { ref: '1', title: 'Ship the thing', state: 'open' },
+      { ref: '2', title: 'Build the thing', state: 'open' },
+    ],
+    edges: [],
+  }),
+  derive: myOrderDeriver, // see "The deriver" below
+});
+
+await store.hydrate();
+
+const handle = store.propose({ op: 'create', kind: 'blocked-by', from: '1', to: '2' });
+// The edge is already drawn, marked `pending-write`.
+// The order has NOT moved, and reports `status: 'held'`.
+
+await handle.settled;
+// Now the order has re-derived, and `snapshot.lastChange` says what moved.
+```
+
+Read state with `getSnapshot()` and react to it with `subscribe(listener)` — the pair
+`useSyncExternalStore` wants, so a React host needs no adapter and a non-React host is not
+asked to pretend it is one.
+
+**Every array reachable from a snapshot is frozen** — nested ones included, so a conflict
+record's `upstream.edges` and an edge's `states` are as protected as `landed`. They are the
+store's own state, so a `.sort()` on one would reorder that state with no dispatch and no
+notification; `[...rows].sort()` is the form to use. The store copies before freezing, so
+handing it an array never freezes an adapter out of its own storage. The *elements* are left
+as you made them — the store owns which edges and rows it holds, you own what each one is.
+
+---
+
+## The data-source port
+
+One interface, two methods. Everything else an adapter needs — a token, a retry policy, a
+rate limiter, a cache — stays on its own side of it.
+
+```ts
+interface DataSource {
+  hydrate(): Promise<GraphDocument>;
+  dispatch(mutation: Mutation): Promise<DispatchResult>;
+}
+```
+
+`dispatch` answers with one of four outcomes:
+
+| outcome | what it means | what the store does |
+|---|---|---|
+| `applied` | the edit landed; carries the **whole** resulting document | adopts it, re-derives the order, emits a change summary |
+| `unchanged` | the edit changed nothing; carries the **whole** document | adopts it, re-derives, emits **no** summary |
+| `rejected` | the write was refused; carries a reason | marks the edge `failed` and offers `retry` |
+| `conflict` | the document moved upstream mid-edit; carries the current one | marks the edge `conflict` and holds **both** versions |
+
+Three contracts an adapter has to honour:
+
+- **`applied` and `unchanged` both carry the authoritative full document — issues included —
+  not a patch.** A partial answer would need merge rules, and merge rules are where an
+  optimistic store goes wrong. Both, because both are the same kind of claim about the
+  document; they differ only in whether *this* edit caused the difference, which is what
+  decides whether a change summary is emitted. `unchanged` matters more than it looks: an
+  adapter often has nothing to apply precisely *because* your store is out of date — another
+  client got there first — and a bare "nothing to do" would leave you without an edge that
+  genuinely exists. An adapter that changed no issues returns the ones it holds.
+- **The store dispatches once per mutation and never retries on its own.** A retry is a user
+  act, so nothing here assumes an idempotency you have not been given.
+- **The store runs one authoritative operation at a time**, queueing the rest, so `dispatch`
+  is never re-entered and never overlaps a `hydrate`. Both answer with an unversioned
+  authoritative document, and two of those in flight cannot be ordered by anything the store
+  can observe — whichever answers second wins, and if that is the older one it silently rolls
+  an edge back out. Rather than push a version onto every adapter, the store declines to
+  create the situation. A queued edit still renders `pending-write` immediately; only the
+  round trip waits, and `rehydrate()` resolves once it has had its turn.
+
+Because of that last one, an edit reaches the adapter some time *after* it is proposed.
+`createScriptedSource` exposes `whenPending(mutationId?)` for exactly this — await the
+hand-off rather than guessing how many microtasks separate the two.
+
+Two adapters ship with the package. `createMemorySource` holds a document in a variable and
+applies every edit — it is the reference implementation, and the one a demo runs on with no
+tracker at all. `createScriptedSource` settles only when told to, which is what lets a test
+observe the store mid-flight and induce a rejection or a conflict on purpose; write your own
+adapter's tests against it.
+
+---
+
+## The deriver, and why you supply it
+
+```ts
+type OrderDeriver = (document: GraphDocument) => readonly OrderRow[];
+```
+
+Required, with no default. The selection order is its own concern with its own package, and a
+default here would be a second implementation of it — which is exactly the duplication this
+package family exists to remove.
+
+The division of labour: **the store owns *when* the order is recomputed; the deriver owns
+*what* it is.**
+
+An optional `EdgeGuard` sits beside it for refusals that need to see the graph — a
+`blocked-by` that would close a cycle:
+
+```ts
+type EdgeGuard = (context: { mutation; current; next }) => InvalidReason | undefined;
+```
+
+---
+
+## The order can be trusted, structurally
+
+The store keeps two edge sets:
+
+- **`landed`** — what the data source has confirmed. **The only input to the deriver.**
+- **`projected`** — `landed` plus every unsettled edit, each carrying its states. What a
+  viewer draws.
+
+Optimistic rendering is allowed; optimistic **re-ordering** is not. The rail's whole value is
+being what a picker will actually do, and an order reflecting an unlanded edit is a ranking
+that exists nowhere. Keeping the two sets apart makes that a property of the structure rather
+than a rule every reader has to remember.
+
+While any edit is in flight, `order.status` is `'held'` and the rows are the previous ones,
+unchanged — a stale-but-labelled order beats a half-computed one. Same principle if your
+deriver throws: the last order that *was* derived stands, and `orderError` says why it is
+stale.
+
+## Host callbacks that throw cannot break the store
+
+Three of them — the deriver, the guard, and a subscriber — and one rule for all three, because
+they are all your code and the store already reads a throwing *adapter* as a rejection.
+
+A guard that throws reached **no verdict**, and an unknown verdict is not permission to write:
+the edit is refused `invalid` with code `guard-failed`. A deriver that throws follows a write
+that already landed, so it cannot become a failed write; the order goes stale with
+`orderError` set. A subscriber that throws is isolated and rethrown asynchronously, so it
+still surfaces without taking the notification loop down.
+
+None of them may escape into the dispatch queue, where they would strand every edit behind
+them with the order held for ever.
+
+## Edge states are overlays, not variants
+
+An edge always keeps its kind. State is carried beside it, as a list, because the five states
+are orthogonal and combine:
+
+`selected` · `pending-write` · `invalid` · `failed` · `conflict`
+
+`invalid` is **refused before any write** — the adapter is never called. Two things produce
+it, split by what the answer needs to see:
+
+- the store itself, for what is visible in the edit — a self-edge, a reference the document
+  does not hold, an exact duplicate, a retype to the kind the edge already has, a flip on a
+  symmetric relationship;
+- your `EdgeGuard`, for anything needing the graph.
+
+## A failed write is marked, never reverted
+
+The user's work stays on the canvas. `retry` re-dispatches it, and on a conflict you get the
+two single-step resolutions below. **Nothing auto-merges, nothing auto-reverts, and nothing
+times out** — `discardMine` is the only call that removes an optimistic edit, and a person has
+to make it.
+
+### Resolving a conflict
+
+A conflict's `upstream` is **for display, and is never adopted** — it is the "view diff" half
+of the choice, and a reading of the past: a conflict can sit on screen for as long as a person
+takes to read it.
+
+The store ships the two single-step resolutions and **not** the composite:
+
+```ts
+store.discardMine(id);   // drop the overlay; adopts nothing
+store.retry(id);         // re-dispatch, unchanged
+```
+
+**"Retry on latest" is yours to compose**, and the two lines are the point:
+
+```ts
+await store.rehydrate();
+if (store.getSnapshot().hydrationError) return;                 // do not retry unconfirmed
+if (store.getSnapshot().writes.some((w) => w.mutationId === id)) store.retry(id);
+```
+
+That is deliberate, and it is the one place this package asks you to write something it could
+have written for you. Both calls above read state and act on it with no `await` in between, so
+neither can be overtaken. The composite has an `await` in the middle, and everything that can
+happen during it — the read failing, the user discarding, the user pressing again — is a
+decision about *user intent* that the caller holding the await can make and the store cannot.
+What a store-owned version would need — a resolution reservation, or cancellation on the
+port — and why it belongs with the editor layer instead, is
+[issue #7](https://github.com/autnmy/issuegraph/issues/7). The adapter is the authority on the current document; the store asks it
+rather than keeping a guess about how stale its own copy has become.
+
+`lastChange` belongs to the edit that is **current when it lands**. Two edits proposed before
+the first settles means the first's summary would otherwise be written after the second began,
+and a host would show the previous edit's blast radius beside the current one.
+
+## Two smaller contracts worth knowing
+
+- **Issue references are opaque.** The format admits both `123` and `owner/repo#123`
+  (§4.2); normalising between them is the reader's job. This store compares references and
+  never parses one, so an adapter must emit canonical identifiers.
+- **Edge identity is derived, not assigned.** It is a pure function of kind and endpoints,
+  with the two symmetric kinds (§4.3.4, §4.3.7) sorting theirs — so `A serialize-with B` and
+  `B serialize-with A` are one edge. That is what lets the store recognise the edge your
+  adapter returns as the one it drew.
+
+---
+
+## What this package does not do
+
+Rendering of any kind, including the wording of the change summary — the counts ship as
+numbers so a host writes the sentence in its own language. Undo, multi-select batching, the
+first-pass review queue, audit findings and graph clustering all compose on top of it rather
+than living in it.

package/dist/adapters/memory.d.ts

@@ -0,0 +1,30 @@
+/**
+ * The in-memory adapter: a whole data source with no tracker behind it.
+ *
+ * It exists to make BYO-DataSource a fact rather than a claim. A seam that only
+ * one real adapter has ever driven is a seam by assertion, and a demo that
+ * needs an app installation, an auth flow and a backend proves nothing about
+ * whether the port is a port. This one holds a document in a variable, applies
+ * every edit to it, and answers immediately.
+ *
+ * It is a reference implementation, not a test double: it is the adapter a
+ * public demo runs on, and the shortest correct answer to "what does an adapter
+ * have to do?".
+ */
+import { type GraphDocument } from '../model.ts';
+import type { DataSource } from '../source.ts';
+/** An in-memory data source, plus a window onto what it currently holds. */
+export interface MemorySource extends DataSource {
+    /** The document as it stands. For a demo's "reset" button, and for tests. */
+    current(): GraphDocument;
+}
+/**
+ * A data source holding one document in memory.
+ *
+ * Every edit applies and nothing ever fails, which is the point: this is the
+ * happy path with no infrastructure at all. Inducing failure and conflict is
+ * {@link ../adapters/scripted.ts createScriptedSource}'s job, and keeping the
+ * two apart is what makes them two adapters rather than one with a switch.
+ */
+export declare function createMemorySource(seed: GraphDocument): MemorySource;
+//# sourceMappingURL=memory.d.ts.map

package/dist/adapters/memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/adapters/memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EACL,KAAK,aAAa,EAKnB,MAAM,aAAa,CAAC;AAErB,OAAO,KAAK,EAAE,UAAU,EAAkB,MAAM,cAAc,CAAC;AAE/D,4EAA4E;AAC5E,MAAM,WAAW,YAAa,SAAQ,UAAU;IAC9C,6EAA6E;IAC7E,OAAO,IAAI,aAAa,CAAC;CAC1B;AAwCD;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,aAAa,GAAG,YAAY,CAiBpE"}

package/dist/adapters/memory.js

@@ -0,0 +1,81 @@
+/**
+ * The in-memory adapter: a whole data source with no tracker behind it.
+ *
+ * It exists to make BYO-DataSource a fact rather than a claim. A seam that only
+ * one real adapter has ever driven is a seam by assertion, and a demo that
+ * needs an app installation, an auth flow and a backend proves nothing about
+ * whether the port is a port. This one holds a document in a variable, applies
+ * every edit to it, and answers immediately.
+ *
+ * It is a reference implementation, not a test double: it is the adapter a
+ * public demo runs on, and the shortest correct answer to "what does an adapter
+ * have to do?".
+ */
+import { findEdge, makeEdge, sameEdgeSet, } from "../model.js";
+/**
+ * Apply an edit to a document, or report that it changes nothing.
+ *
+ * Returns `undefined` for a no-op — a delete of an edge that is not there, a
+ * create of one that already is. The store has its own refusals for those, but
+ * an adapter cannot assume it is talking to this store, and answering
+ * `unchanged` is both truthful and what a real tracker would say.
+ */
+function applied(document, mutation) {
+    switch (mutation.op) {
+        case 'create': {
+            const edge = makeEdge(mutation.kind, mutation.from, mutation.to);
+            if (findEdge(document, edge.id) !== undefined)
+                return undefined;
+            return [...document.edges, edge];
+        }
+        case 'delete': {
+            if (findEdge(document, mutation.edgeId) === undefined)
+                return undefined;
+            return document.edges.filter((edge) => edge.id !== mutation.edgeId);
+        }
+        case 'retype': {
+            const edge = findEdge(document, mutation.edgeId);
+            if (edge === undefined)
+                return undefined;
+            const next = makeEdge(mutation.nextKind, edge.from, edge.to);
+            const kept = document.edges.filter((other) => other.id !== edge.id);
+            if (kept.some((other) => other.id === next.id))
+                return kept;
+            return [...kept, next];
+        }
+        case 'flip': {
+            const edge = findEdge(document, mutation.edgeId);
+            if (edge === undefined)
+                return undefined;
+            const next = makeEdge(edge.kind, edge.to, edge.from);
+            const kept = document.edges.filter((other) => other.id !== edge.id);
+            if (kept.some((other) => other.id === next.id))
+                return kept;
+            return [...kept, next];
+        }
+    }
+}
+/**
+ * A data source holding one document in memory.
+ *
+ * Every edit applies and nothing ever fails, which is the point: this is the
+ * happy path with no infrastructure at all. Inducing failure and conflict is
+ * {@link ../adapters/scripted.ts createScriptedSource}'s job, and keeping the
+ * two apart is what makes them two adapters rather than one with a switch.
+ */
+export function createMemorySource(seed) {
+    let document = { issues: [...seed.issues], edges: [...seed.edges] };
+    return {
+        current: () => document,
+        hydrate: () => Promise.resolve(document),
+        dispatch(mutation) {
+            const edges = applied(document, mutation);
+            if (edges === undefined || sameEdgeSet(document.edges, edges)) {
+                return Promise.resolve({ outcome: 'unchanged', document });
+            }
+            document = { issues: document.issues, edges };
+            return Promise.resolve({ outcome: 'applied', document });
+        },
+    };
+}
+//# sourceMappingURL=memory.js.map

package/dist/adapters/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../src/adapters/memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAGL,QAAQ,EACR,QAAQ,EACR,WAAW,GACZ,MAAM,aAAa,CAAC;AAUrB;;;;;;;GAOG;AACH,SAAS,OAAO,CAAC,QAAuB,EAAE,QAAkB;IAC1D,QAAQ,QAAQ,CAAC,EAAE,EAAE,CAAC;QACpB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YACjE,IAAI,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAChE,OAAO,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACxE,OAAO,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtE,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7D,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;YACpE,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC5D,OAAO,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACjD,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACrD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;YACpE,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC5D,OAAO,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAmB;IACpD,IAAI,QAAQ,GAAkB,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;IAEnF,OAAO;QACL,OAAO,EAAE,GAAG,EAAE,CAAC,QAAQ;QAEvB,OAAO,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC;QAExC,QAAQ,CAAC,QAAkB;YACzB,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC1C,IAAI,KAAK,KAAK,SAAS,IAAI,WAAW,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC9D,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC7D,CAAC;YACD,QAAQ,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;YAC9C,OAAO,OAAO,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC3D,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/adapters/scripted.d.ts

@@ -0,0 +1,67 @@
+/**
+ * The scripted adapter: asynchronous, and able to fail on purpose.
+ *
+ * It is a second adapter rather than the in-memory one with a flag, and the
+ * structural difference is deliberate: **it does not settle until it is told
+ * to.** That is the only way to observe the store mid-flight, which is the only
+ * way to assert that the order stays put while a write is pending — and a flag
+ * on a synchronous adapter could never provide it.
+ *
+ * Two audiences. Inside this package it is what induces `failed` and `conflict`
+ * rather than asserting they exist. Outside it, it is the harness a host writes
+ * its own adapter's tests against, which is why it ships rather than living in
+ * a test file.
+ */
+import type { GraphDocument } from '../model.ts';
+import type { Mutation, MutationId } from '../mutation.ts';
+import type { DataSource, DispatchResult } from '../source.ts';
+/** An edit this adapter has been handed and has not answered yet. */
+export interface PendingDispatch {
+    readonly mutationId: MutationId;
+    readonly mutation: Mutation;
+}
+/**
+ * What to answer with.
+ *
+ * `'applied'` and `'unchanged'` are resolved against the adapter's own
+ * document, so a caller can say "this one lands" or "there was nothing to do"
+ * without restating the edges. Anything else is passed through verbatim.
+ */
+export type ScriptedOutcome = 'applied' | 'unchanged' | DispatchResult;
+/** A scripted data source, plus the controls a test or a demo drives it with. */
+export interface ScriptedSource extends DataSource {
+    /** Every edit handed over and not yet answered, oldest first. */
+    pending(): readonly PendingDispatch[];
+    /**
+     * Resolves once an edit is waiting to be settled — a named one, or the next
+     * one to arrive.
+     *
+     * A store that serialises its writes hands an edit over some time AFTER the
+     * caller proposed it, so "proposed" and "the adapter has it" are two
+     * different moments. Without this a caller has to guess how many microtasks
+     * separate them, which is the kind of test that passes until it doesn't.
+     */
+    whenPending(mutationId?: MutationId): Promise<PendingDispatch>;
+    /**
+     * Answer the oldest unanswered edit. Throws when there is none, because
+     * settling nothing is always a mistake in the caller rather than a state to
+     * tolerate — and a silent no-op here would make a test pass by not running.
+     */
+    settleNext(outcome: ScriptedOutcome): void;
+    /** Answer one specific edit, whatever order it was handed over in. */
+    settle(mutationId: MutationId, outcome: ScriptedOutcome): void;
+    /** Reject the oldest unanswered edit's promise outright — a crashing adapter. */
+    throwNext(error: Error): void;
+    /** The document as it stands. Advanced only by an `applied` settlement. */
+    current(): GraphDocument;
+}
+/**
+ * A data source that hands control of every settlement to its caller.
+ *
+ * `seed` is what it hydrates. `apply` computes the document an `'applied'`
+ * settlement produces — injected rather than reimplemented here, so a test can
+ * reuse an in-memory source's behaviour or supply its own without this adapter
+ * growing a second copy of the edit semantics.
+ */
+export declare function createScriptedSource(seed: GraphDocument, apply: (document: GraphDocument, mutation: Mutation) => GraphDocument): ScriptedSource;
+//# sourceMappingURL=scripted.d.ts.map

package/dist/adapters/scripted.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scripted.d.ts","sourceRoot":"","sources":["../../src/adapters/scripted.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC3D,OAAO,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAE/D,qEAAqE;AACrE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B;AAED;;;;;;GAMG;AACH,MAAM,MAAM,eAAe,GAAG,SAAS,GAAG,WAAW,GAAG,cAAc,CAAC;AAEvE,iFAAiF;AACjF,MAAM,WAAW,cAAe,SAAQ,UAAU;IAChD,iEAAiE;IACjE,OAAO,IAAI,SAAS,eAAe,EAAE,CAAC;IACtC;;;;;;;;OAQG;IACH,WAAW,CAAC,UAAU,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAC/D;;;;OAIG;IACH,UAAU,CAAC,OAAO,EAAE,eAAe,GAAG,IAAI,CAAC;IAC3C,sEAAsE;IACtE,MAAM,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,GAAG,IAAI,CAAC;IAC/D,iFAAiF;IACjF,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,IAAI,CAAC;IAC9B,2EAA2E;IAC3E,OAAO,IAAI,aAAa,CAAC;CAC1B;AAYD;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,aAAa,EACnB,KAAK,EAAE,CAAC,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,QAAQ,KAAK,aAAa,GACpE,cAAc,CA8EhB"}