@graview/ship 0.1.0

package/dist/serve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serve.js","sourceRoot":"","sources":["../src/serve.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAA0D,MAAM,WAAW,CAAC;AACjG,OAAO,EACL,YAAY,EACZ,eAAe,EACf,KAAK,GAQN,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,SAAS,EAAoB,MAAM,iBAAiB,CAAC;AAG9D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AAEH;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG;IAClB,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,2CAA2C,EAAE;IAC5F,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,oHAAoH,EAAE;IACpK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,iDAAiD,EAAE;IAClG,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,iBAAiB,EAAE,IAAI,EAAE,2CAA2C,EAAE;IAC7F,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,iBAAiB,EAAE,IAAI,EAAE,4CAA4C,EAAE;IAC9F,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,sEAAsE,EAAE;IACvH,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,uBAAuB,EAAE;IACtE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,mBAAmB,EAAE;CAC7D,CAAC;AAEX,iIAAiI;AACjI,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,iBAAiB,EAAW,CAAC;AAmC1F,MAAM,IAAI,GAAG,CAAC,OAAwB,EAAa,EAAE;IACnD,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;IACjD,OAAO;QACL,IAAI,EAAE,OAAO;QACb,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9D,CAAC;AACJ,CAAC,CAAC;AAEF,SAAS,MAAM,CAAC,OAAwB,EAAE,IAAY;IACpD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACjD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAAsB,OAAwB;IAC5E,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;IAChD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC;IACtC;;;;;OAKG;IACH,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC;QAC7B,GAAG,EAAE,OAAO,CAAC,GAAG;QAChB,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,KAAK;QACL,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAChD,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAE3B;;;;;OAKG;IACH,MAAM,GAAG,GAAG,OAAO,CAAC,aAAa,IAAI,eAAe,CAAC;IACrD,IAAI,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACvC,MAAM,KAAK,GAAG,GAAe,EAAE;QAC7B,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QAC/C,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5B,CAAC,CAAC;IACF,MAAM,MAAM,GAAG,CAAC,IAAc,EAAE,IAAe,EAAY,EAAE;QAC3D,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/D,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;QACtF,MAAM,QAAQ,GAAa,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;QAClF,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QACvD,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,CAAC,GAAW,EAAe,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAEzF,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,EAAE;QAChD,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;YACtD,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,KAAK,UAAU,MAAM,CAAC,OAAwB,EAAE,QAAwB;QACtE,iEAAiE;QACjE,QAAQ,CAAC,SAAS,CAAC,6BAA6B,EAAE,GAAG,CAAC,CAAC;QACvD,QAAQ,CAAC,SAAS,CAAC,8BAA8B,EAAE,8DAA8D,CAAC,CAAC;QACnH,QAAQ,CAAC,SAAS,CAAC,8BAA8B,EAAE,oBAAoB,CAAC,CAAC;QACzE,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACjC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YAC9B,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,IAAI,GAAG,EAAE,kBAAkB,CAAC,CAAC;QAE5D,IAAI,GAAG,CAAC,QAAQ,KAAK,gBAAgB,EAAE,CAAC;YACtC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;gBAClB,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC;gBACjC,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE;gBAC1B,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;gBACpB,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC;aACjD,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,gBAAgB,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;YACxD,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACzC,OAAO;QACT,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,cAAc,EAAE,CAAC;YACpC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACtC,OAAO;QACT,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,eAAe,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAClE,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,CAA0C,CAAC;YAC5E,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,WAAW,KAAK,QAAQ,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC9G,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,yCAAyC,EAAE,CAAC,CAAC;gBAC1E,OAAO;YACT,CAAC;YACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YACpD,sEAAsE;YACtE,+DAA+D;YAC/D,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;gBAClB,GAAG,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,CAAC;gBAC5E,GAAG,CAAC,OAAO,IAAI,CAAC,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAClE,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,gBAAgB,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACnE,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,CAA6B,CAAC;YAC/D,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;gBACzC,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAChC,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACtC,OAAO;QACT,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,iBAAiB,EAAE,CAAC;YACvC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;gBAClB,GAAG,MAAM,CAAC,KAAc,EAAE,OAAO,CAAC,GAAY,CAAC;gBAC/C,mEAAmE;gBACnE,gEAAgE;gBAChE,KAAK,EAAE,OAAO,CAAC,KAAK,IAAK,OAAO,CAAC,OAA6B,CAAC,IAAI,IAAI,KAAK;gBAC5E,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI;aAC9B,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,iBAAiB,EAAE,CAAC;YACvC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,YAAY,CAAC,KAAc,EAAE,OAAO,CAAC,GAAY,CAAC,CAAC,CAAC;YACxE,OAAO;QACT,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,cAAc,IAAI,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACjE,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,CAMhC,CAAC;YACF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC7B,IAAI,CAAC;gBACH;;;;;mBAKG;gBACH,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI;oBACtB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1F,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE;wBACpB,MAAM,EAAE,IAAI;wBACZ,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/C,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;qBAC7C,CAAC,CAAC;gBACP,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC;gBACrB,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;YAChE,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;oBAClB,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;oBAC7D,OAAO,EAAE,IAAI;iBACd,CAAC,CAAC;YACL,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,cAAc,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;IACrD,OAAO;QACL,KAAK;QACL,MAAM;QACN,MAAM;QACN,IAAI;QACJ,GAAG,EAAE,oBAAoB,IAAI,EAAE;QAC/B,KAAK,CAAC,KAAK;YACT,MAAM,MAAM,CAAC,KAAK,EAAE,CAAC;YACrB,MAAM,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,OAAO,CAAO,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,QAAwB,EAAE,MAAc,EAAE,IAAa;IACnE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAClC,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9G,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACrB,CAAC;AAED,KAAK,UAAU,IAAI,CAAC,OAAwB;IAC1C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,OAAO;QAAE,MAAM,CAAC,IAAI,CAAC,KAAe,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACpD,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AACnD,CAAC;AAED,SAAS,MAAM,CAAC,MAAc,EAAE,IAAY;IAC1C,OAAO,IAAI,OAAO,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;QACjC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE;YACvB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,CAAC,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/E,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/snapshot.d.ts

@@ -0,0 +1,20 @@
+import { type Primitive } from "@graview/core";
+/**
+ * A stored graph mid-migration is BETWEEN schemas, so nothing here
+ * validates: the applier moves plain data structurally, and the new-schema
+ * store validates the final shape when it folds. Validation in the middle
+ * would refuse exactly the states migrations exist to pass through.
+ */
+export interface GraphSnapshot {
+    readonly nodes: readonly ({
+        readonly id: string;
+        readonly kind: string;
+    } & Record<string, unknown>)[];
+    readonly edges: readonly {
+        readonly kind: string;
+        readonly from: string;
+        readonly to: string;
+    }[];
+}
+export declare function applyToSnapshot(snapshot: GraphSnapshot, primitives: readonly Primitive[]): GraphSnapshot;
+//# sourceMappingURL=snapshot.d.ts.map

package/dist/snapshot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"snapshot.d.ts","sourceRoot":"","sources":["../src/snapshot.ts"],"names":[],"mappings":"AAAA,OAAO,EAAW,KAAK,SAAS,EAAE,MAAM,eAAe,CAAC;AAExD;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC;QAAE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IACtG,QAAQ,CAAC,KAAK,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAClG;AAED,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,aAAa,EACvB,UAAU,EAAE,SAAS,SAAS,EAAE,GAC/B,aAAa,CA2Cf"}

package/dist/snapshot.js

@@ -0,0 +1,41 @@
+import { isUnset } from "@graview/core";
+export function applyToSnapshot(snapshot, primitives) {
+    let nodes = [...snapshot.nodes];
+    let edges = [...snapshot.edges];
+    for (const primitive of primitives) {
+        switch (primitive.op) {
+            case "add-node":
+                nodes.push(primitive.node);
+                break;
+            case "remove-node":
+                nodes = nodes.filter((node) => node.id !== primitive.node.id);
+                edges = edges.filter((edge) => edge.from !== primitive.node.id && edge.to !== primitive.node.id);
+                break;
+            case "patch-node":
+                nodes = nodes.map((node) => {
+                    if (node.id !== primitive.id)
+                        return node;
+                    const patched = { ...node, ...primitive.after };
+                    // A key patched away is a removal, not a stored undefined — said
+                    // as `undefined` in memory and as `UNSET` once the op has been
+                    // written down, because JSON cannot carry the first one.
+                    for (const [key, value] of Object.entries(primitive.after)) {
+                        if (isUnset(value))
+                            delete patched[key];
+                    }
+                    return patched;
+                });
+                break;
+            case "add-edge":
+                edges.push(primitive.edge);
+                break;
+            case "remove-edge":
+                edges = edges.filter((edge) => !(edge.kind === primitive.edge.kind &&
+                    edge.from === primitive.edge.from &&
+                    edge.to === primitive.edge.to));
+                break;
+        }
+    }
+    return { nodes, edges };
+}
+//# sourceMappingURL=snapshot.js.map

package/dist/snapshot.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"snapshot.js","sourceRoot":"","sources":["../src/snapshot.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAkB,MAAM,eAAe,CAAC;AAaxD,MAAM,UAAU,eAAe,CAC7B,QAAuB,EACvB,UAAgC;IAEhC,IAAI,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,IAAI,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,QAAQ,SAAS,CAAC,EAAE,EAAE,CAAC;YACrB,KAAK,UAAU;gBACb,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAsC,CAAC,CAAC;gBAC7D,MAAM;YACR,KAAK,aAAa;gBAChB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC9D,KAAK,GAAG,KAAK,CAAC,MAAM,CAClB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,IAAI,CAAC,EAAE,CAC3E,CAAC;gBACF,MAAM;YACR,KAAK,YAAY;gBACf,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;oBACzB,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;wBAAE,OAAO,IAAI,CAAC;oBAC1C,MAAM,OAAO,GAA4B,EAAE,GAAG,IAAI,EAAE,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;oBACzE,iEAAiE;oBACjE,+DAA+D;oBAC/D,yDAAyD;oBACzD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3D,IAAI,OAAO,CAAC,KAAK,CAAC;4BAAE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;oBAC1C,CAAC;oBACD,OAAO,OAAyC,CAAC;gBACnD,CAAC,CAAC,CAAC;gBACH,MAAM;YACR,KAAK,UAAU;gBACb,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC3B,MAAM;YACR,KAAK,aAAa;gBAChB,KAAK,GAAG,KAAK,CAAC,MAAM,CAClB,CAAC,IAAI,EAAE,EAAE,CACP,CAAC,CACC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CAAC,IAAI;oBACjC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CAAC,IAAI;oBACjC,IAAI,CAAC,EAAE,KAAK,SAAS,CAAC,IAAI,CAAC,EAAE,CAC9B,CACJ,CAAC;gBACF,MAAM;QACV,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC"}

package/dist/source-edit.d.ts

@@ -0,0 +1,52 @@
+import type { DeclarationChange } from "@graview/core";
+import type * as TS from "typescript";
+/**
+ * A DECLARATION CHANGE, MADE AS AN EDIT TO THE SOURCE.
+ *
+ * The studio can write a whole declaration from its graph, and for a new
+ * app that is right. For an app somebody has been writing for months it is
+ * a disaster with a green tick on it: the graph holds the shape, not the
+ * comments that say why, not the `describe` and `format` functions, not a
+ * single hand-written body — so a regenerated `schema.ts` is a smaller,
+ * poorer file that happens to type-check.
+ *
+ * So a change is carried as a change — "move `tended-by` from plot to
+ * planting" — and made here, inside the checkout's own `defineNode` calls,
+ * by the parser's positions: the property removed with the comment above
+ * it, carried to the other kind at that kind's indentation, and every other
+ * character left exactly where it was.
+ *
+ * All or nothing. A change the source cannot take — a kind it cannot find,
+ * fields written some way other than `z.object({ … })` — refuses the whole
+ * set, and says which and why, rather than writing half a declaration.
+ */
+export interface SourceText {
+    readonly path: string;
+    readonly text: string;
+}
+export type SourceEdit = {
+    readonly ok: true;
+    readonly files: readonly SourceText[];
+} | {
+    readonly ok: false;
+    readonly refused: readonly string[];
+};
+type Ts = typeof TS;
+export declare function editDeclaration(ts: Ts, files: readonly SourceText[], changes: readonly DeclarationChange[]): SourceEdit;
+/**
+ * The checkout's own acts and rules, each as the object it is declared
+ * with: what a person or a seat rewrites when a change leaves one of them
+ * saying something that is no longer true.
+ */
+export declare function declaredCode(ts: Ts, files: readonly SourceText[]): {
+    readonly acts: Record<string, {
+        path: string;
+        text: string;
+    }>;
+    readonly rules: Record<string, {
+        path: string;
+        text: string;
+    }>;
+};
+export {};
+//# sourceMappingURL=source-edit.d.ts.map

package/dist/source-edit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"source-edit.d.ts","sourceRoot":"","sources":["../src/source-edit.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,KAAK,KAAK,EAAE,MAAM,YAAY,CAAC;AAEtC;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,MAAM,UAAU,GAClB;IAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAA;CAAE,GAC5D;IAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAAC;AAEhE,KAAK,EAAE,GAAG,OAAO,EAAE,CAAC;AAEpB,wBAAgB,eAAe,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,UAAU,EAAE,EAAE,OAAO,EAAE,SAAS,iBAAiB,EAAE,GAAG,UAAU,CASvH;AA8FD;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,EAAE,EAAE,EAAE,EACN,KAAK,EAAE,SAAS,UAAU,EAAE,GAC3B;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CAenI"}

package/dist/source-edit.js

@@ -0,0 +1,455 @@
+export function editDeclaration(ts, files, changes) {
+    const current = new Map(files.map((file) => [file.path, file.text]));
+    const refused = [];
+    for (const change of changes) {
+        const outcome = applyChange(ts, current, change);
+        if (typeof outcome === "string")
+            refused.push(outcome);
+    }
+    if (refused.length > 0)
+        return { ok: false, refused };
+    return { ok: true, files: files.map((file) => ({ path: file.path, text: current.get(file.path) })) };
+}
+const parse = (ts, path, text) => ts.createSourceFile(path, text, ts.ScriptTarget.Latest, true, ts.ScriptKind.TS);
+const calleeIs = (ts, call, name) => (ts.isIdentifier(call.expression) && call.expression.text === name) ||
+    (ts.isPropertyAccessExpression(call.expression) && call.expression.name.text === name);
+function visit(ts, node, found) {
+    if (found(node))
+        return node;
+    return ts.forEachChild(node, (child) => visit(ts, child, found));
+}
+/** The declarations of each sort, by the function that declares them. */
+const DECLARERS = {
+    kind: ["defineNode"],
+    act: ["defineMutation"],
+    rule: ["defineInvariant", "defineGraphInvariant"],
+};
+const declares = (ts, node, sort) => ts.isCallExpression(node) && DECLARERS[sort].some((name) => calleeIs(ts, node, name));
+/** `defineNode("plot", { … })` and its kin: the name, when it is a string literal, and the object. */
+function declared(ts, call) {
+    const [name, body] = call.arguments;
+    return name && ts.isStringLiteralLike(name) && body && ts.isObjectLiteralExpression(body) ? { name: name.text, object: body } : undefined;
+}
+function defineNodeOf(ts, files, kind) {
+    return declarationOf(ts, files, "kind", kind);
+}
+/**
+ * The declaration of this name. A name may be declared more than once — a
+ * tutorial's chapter keeps its own smaller `plot` beside the app's — and
+ * the one EXPORTED is the app's; the others are somebody's local copies.
+ */
+function declarationOf(ts, files, sort, wanted) {
+    const found = [];
+    for (const [path, text] of files) {
+        const source = parse(ts, path, text);
+        const visitAll = (node) => {
+            if (declares(ts, node, sort) && declared(ts, node)?.name === wanted)
+                found.push(foundAt(ts, path, source, node));
+            ts.forEachChild(node, visitAll);
+        };
+        visitAll(source);
+    }
+    const exported = (one) => !!one.statement && ts.canHaveModifiers(one.statement) && (ts.getModifiers(one.statement) ?? []).some((modifier) => modifier.kind === ts.SyntaxKind.ExportKeyword);
+    return found.find(exported) ?? found[0];
+}
+function foundAt(ts, path, source, call) {
+    let statement = call;
+    while (statement.parent && !ts.isSourceFile(statement.parent))
+        statement = statement.parent;
+    const variable = ts.isVariableStatement(statement) ? statement.declarationList.declarations[0] : undefined;
+    return {
+        path,
+        source,
+        object: declared(ts, call).object,
+        ...(ts.isVariableStatement(statement) ? { statement } : {}),
+        ...(variable && ts.isIdentifier(variable.name) ? { binding: variable.name.text } : {}),
+    };
+}
+const propertyName = (ts, property) => property.name && (ts.isIdentifier(property.name) || ts.isStringLiteralLike(property.name)) ? property.name.text : undefined;
+function property(ts, object, name) {
+    return object.properties.find((one) => ts.isPropertyAssignment(one) && propertyName(ts, one) === name);
+}
+/** The object inside `fields: z.object({ … })`, or why there is none to edit. */
+function fieldsOf(ts, found, kind) {
+    const fields = property(ts, found.object, "fields")?.initializer;
+    if (fields && ts.isCallExpression(fields) && calleeIs(ts, fields, "object")) {
+        const shape = fields.arguments[0];
+        if (shape && ts.isObjectLiteralExpression(shape))
+            return shape;
+    }
+    return `The fields of "${kind}" are not written as z.object({ … }) in ${found.path}, so the studio cannot edit them in place.`;
+}
+/**
+ * The checkout's own acts and rules, each as the object it is declared
+ * with: what a person or a seat rewrites when a change leaves one of them
+ * saying something that is no longer true.
+ */
+export function declaredCode(ts, files) {
+    const acts = {};
+    const rules = {};
+    for (const file of files) {
+        const source = parse(ts, file.path, file.text);
+        const walk = (node) => {
+            for (const [sort, into] of [["act", acts], ["rule", rules]]) {
+                const found = declares(ts, node, sort) ? declared(ts, node) : undefined;
+                if (found)
+                    into[found.name] = { path: file.path, text: file.text.slice(found.object.getStart(source), found.object.end) };
+            }
+            ts.forEachChild(node, walk);
+        };
+        walk(source);
+    }
+    return { acts, rules };
+}
+/* ------------------------------------------------------------ editing */
+/** The whitespace a line starts with. */
+const indentAt = (text, position) => {
+    const start = text.lastIndexOf("\n", position - 1) + 1;
+    return /^[ \t]*/.exec(text.slice(start))[0];
+};
+/** One level deeper than `indent`, in the file's own step. */
+const deeper = (text, indent) => indent + (/\n\t/.test(text) && !/\n {2}/.test(text) ? "\t" : "  ");
+const key = (name) => (/^[A-Za-z_$][\w$]*$/.test(name) ? name : JSON.stringify(name));
+/** Re-indent a block of source from one indentation to another. */
+const reindent = (block, from, to) => block
+    .split("\n")
+    .map((line) => (line.startsWith(from) ? to + line.slice(from.length) : line))
+    .join("\n");
+function insertProperty(text, object, source, entry) {
+    const last = object.properties[object.properties.length - 1];
+    // An object written on one line stays on one line, when what joins it fits on one.
+    if (!text.slice(object.getStart(source), object.end).includes("\n") && !entry.includes("\n")) {
+        return last
+            ? `${text.slice(0, last.end)}, ${entry}${text.slice(last.end)}`
+            : `${text.slice(0, object.getStart(source))}{ ${entry} }${text.slice(object.end)}`;
+    }
+    if (!last) {
+        const outer = indentAt(text, object.getStart(source));
+        const inner = deeper(text, outer);
+        return `${text.slice(0, object.getStart(source))}{\n${inner}${reindent(entry, "", inner).trimStart()},\n${outer}}${text.slice(object.end)}`;
+    }
+    const indent = indentAt(text, last.getStart(source));
+    const body = reindent(entry, "", indent).trimStart();
+    if (object.properties.hasTrailingComma) {
+        const comma = text.indexOf(",", last.end);
+        return `${text.slice(0, comma + 1)}\n${indent}${body},${text.slice(comma + 1)}`;
+    }
+    return `${text.slice(0, last.end)},\n${indent}${body}${text.slice(last.end)}`;
+}
+/**
+ * The property's span: from the end of whatever came before it — so the
+ * comment above it goes with it — to the comma after it.
+ */
+function spanOf(text, element) {
+    const comma = /^[ \t]*,/.exec(text.slice(element.end));
+    return { start: element.getFullStart(), end: element.end + (comma ? comma[0].length : 0) };
+}
+const cut = (text, span) => text.slice(0, span.start) + text.slice(span.end);
+function replaceNode(text, node, source, replacement) {
+    return text.slice(0, node.getStart(source)) + replacement + text.slice(node.end);
+}
+/* ------------------------------------------------------------ changes */
+function applyChange(ts, files, change) {
+    if (change.what === "add-kind")
+        return addKind(ts, files, change);
+    if (change.what === "add-migration")
+        return addMigration(ts, files, change);
+    if (change.what === "replace-act" || change.what === "replace-rule") {
+        const sort = change.what === "replace-act" ? "act" : "rule";
+        const name = change.what === "replace-act" ? change.act : change.rule;
+        const found = declarationOf(ts, files, sort, name);
+        if (!found)
+            return `No ${sort} "${name}" declared in ${[...files.keys()].join(", ")}.`;
+        const text = files.get(found.path);
+        files.set(found.path, replaceNode(text, found.object, found.source, reindent(change.text.trim(), "", indentAt(text, found.object.getStart(found.source))).trimStart()));
+        return undefined;
+    }
+    if (change.what === "add-act" || change.what === "add-rule") {
+        const sort = change.what === "add-act" ? "act" : "rule";
+        const name = change.what === "add-act" ? change.act : change.rule;
+        return addDeclaration(ts, files, sort, name, change.binding, change.text);
+    }
+    if (change.what === "remove-act" || change.what === "remove-rule") {
+        const sort = change.what === "remove-act" ? "act" : "rule";
+        const name = change.what === "remove-act" ? change.act : change.rule;
+        const found = declarationOf(ts, files, sort, name);
+        if (!found?.statement)
+            return `No ${sort} "${name}" declared as a statement of its own.`;
+        let next = cut(files.get(found.path), spanOf(files.get(found.path), found.statement));
+        files.set(found.path, next);
+        // And out of whatever list gathers them, wherever that is.
+        if (found.binding) {
+            for (const [path, text] of files) {
+                next = removeFromList(ts, path, text, found.binding) ?? text;
+                files.set(path, next);
+            }
+        }
+        return undefined;
+    }
+    const kind = change.what === "move-edge" ? change.from : change.kind;
+    const found = defineNodeOf(ts, files, kind);
+    if (!found)
+        return `No defineNode("${kind}", { … }) in ${[...files.keys()].join(", ")}.`;
+    const text = files.get(found.path);
+    switch (change.what) {
+        case "remove-kind": {
+            if (!found.statement)
+                return `defineNode("${kind}") in ${found.path} is not a statement of its own, so the studio cannot remove it.`;
+            let next = cut(text, spanOf(text, found.statement));
+            if (found.binding)
+                next = removeFromSchema(ts, found.path, next, found.binding) ?? next;
+            files.set(found.path, next);
+            return undefined;
+        }
+        case "set-kind-property": {
+            const existing = property(ts, found.object, change.property);
+            if (change.text === null) {
+                if (existing)
+                    files.set(found.path, cut(text, spanOf(text, existing)));
+            }
+            else if (existing) {
+                files.set(found.path, replaceNode(text, existing.initializer, found.source, change.text));
+            }
+            else {
+                files.set(found.path, insertProperty(text, found.object, found.source, `${key(change.property)}: ${change.text}`));
+            }
+            return undefined;
+        }
+        case "add-field":
+        case "change-field":
+        case "remove-field": {
+            const shape = fieldsOf(ts, found, kind);
+            if (typeof shape === "string")
+                return shape;
+            const existing = property(ts, shape, change.field);
+            if (change.what === "add-field") {
+                if (existing)
+                    return `"${kind}" already has a field "${change.field}" in ${found.path}.`;
+                files.set(found.path, insertProperty(text, shape, found.source, `${key(change.field)}: ${change.zod}`));
+            }
+            else if (!existing) {
+                return `"${kind}" has no field "${change.field}" in ${found.path}.`;
+            }
+            else if (change.what === "change-field") {
+                files.set(found.path, replaceNode(text, existing.initializer, found.source, change.zod));
+            }
+            else {
+                files.set(found.path, cut(text, spanOf(text, existing)));
+            }
+            return undefined;
+        }
+        case "add-edge":
+        case "change-edge":
+        case "remove-edge": {
+            const edges = property(ts, found.object, "edges");
+            const object = edges && ts.isObjectLiteralExpression(edges.initializer) ? edges.initializer : undefined;
+            const existing = object ? property(ts, object, change.edge) : undefined;
+            if (change.what === "add-edge") {
+                if (existing)
+                    return `"${kind}" already declares "${change.edge}" in ${found.path}.`;
+                const entry = `${key(change.edge)}: ${change.text}`;
+                files.set(found.path, object ? insertProperty(text, object, found.source, entry) : insertProperty(text, found.object, found.source, `edges: {\n  ${entry.split("\n").join("\n  ")},\n}`));
+            }
+            else if (!existing) {
+                return `"${kind}" declares no edge "${change.edge}" in ${found.path}.`;
+            }
+            else if (change.what === "change-edge") {
+                files.set(found.path, replaceNode(text, existing.initializer, found.source, reindent(change.text, "", indentAt(text, existing.getStart(found.source)))));
+            }
+            else {
+                files.set(found.path, cut(text, spanOf(text, existing)));
+            }
+            return undefined;
+        }
+        case "move-edge":
+            return moveEdge(ts, files, found, change);
+    }
+}
+/**
+ * THE SAME RELATION, ON ANOTHER KIND: carried as it was written. Its
+ * readings, its `appendOnly`, the comment that says why it exists all go
+ * with it; only where it points is rewritten.
+ */
+function moveEdge(ts, files, found, change) {
+    const text = files.get(found.path);
+    const edges = property(ts, found.object, "edges");
+    const object = edges && ts.isObjectLiteralExpression(edges.initializer) ? edges.initializer : undefined;
+    const existing = object ? property(ts, object, change.edge) : undefined;
+    if (!existing || !ts.isObjectLiteralExpression(existing.initializer))
+        return `"${change.from}" declares no edge "${change.edge}" in ${found.path}.`;
+    if (!defineNodeOf(ts, files, change.to))
+        return `No defineNode("${change.to}", { … }) to move "${change.edge}" onto.`;
+    // The property's own text, with its targets rewritten, and its comments above it.
+    const span = spanOf(text, existing);
+    const target = property(ts, existing.initializer, "to");
+    let carried = text.slice(span.start, existing.end);
+    if (target) {
+        const at = target.initializer.getStart(found.source) - span.start;
+        carried = carried.slice(0, at) + change.targets + carried.slice(target.initializer.end - span.start);
+    }
+    const from = indentAt(text, existing.getStart(found.source));
+    const block = carried.replace(/^\n/, "");
+    const withoutIndent = reindent(block, from, "");
+    // Removed from where it was — and an `edges: {}` left empty goes too.
+    let next = cut(text, span);
+    const after = defineNodeOf(ts, new Map([[found.path, next]]), change.from);
+    const left = property(ts, after.object, "edges");
+    if (left && ts.isObjectLiteralExpression(left.initializer) && left.initializer.properties.length === 0) {
+        next = cut(next, spanOf(next, left));
+    }
+    files.set(found.path, next);
+    const destination = defineNodeOf(ts, files, change.to);
+    const there = files.get(destination.path);
+    const edgesThere = property(ts, destination.object, "edges");
+    files.set(destination.path, edgesThere && ts.isObjectLiteralExpression(edgesThere.initializer)
+        ? insertProperty(there, edgesThere.initializer, destination.source, withoutIndent)
+        : insertProperty(there, destination.object, destination.source, `edges: {\n  ${withoutIndent.split("\n").join("\n  ")},\n}`));
+    return undefined;
+}
+/** The `createSchema([...])` array, wherever the kinds are gathered. */
+function schemaList(ts, path, text) {
+    const source = parse(ts, path, text);
+    const call = visit(ts, source, (node) => ts.isCallExpression(node) && calleeIs(ts, node, "createSchema"));
+    const list = call?.arguments[0];
+    return list && ts.isArrayLiteralExpression(list) ? { source, list } : undefined;
+}
+function removeFromSchema(ts, path, text, binding) {
+    const found = schemaList(ts, path, text);
+    return found ? removeElement(ts, text, found.source, found.list, binding) : undefined;
+}
+/** The binding taken out of every array literal in the file that lists it by name. */
+function removeFromList(ts, path, text, binding) {
+    const source = parse(ts, path, text);
+    const list = visit(ts, source, (node) => ts.isArrayLiteralExpression(node) && node.elements.some((one) => ts.isIdentifier(one) && one.text === binding));
+    return list ? removeElement(ts, text, source, list, binding) : undefined;
+}
+function removeElement(ts, text, source, list, binding) {
+    const element = list.elements.find((one) => ts.isIdentifier(one) && one.text === binding);
+    if (!element)
+        return undefined;
+    const found = { source, list };
+    const elements = found.list.elements;
+    const at = elements.indexOf(element);
+    // With the comma on whichever side it sits.
+    const start = at > 0 ? elements[at - 1].end : element.getStart(found.source);
+    const end = at > 0 ? element.end : (elements[at + 1]?.getStart(found.source) ?? element.end);
+    return text.slice(0, start) + text.slice(end);
+}
+function addKind(ts, files, change) {
+    if (defineNodeOf(ts, files, change.kind))
+        return `"${change.kind}" is already declared.`;
+    for (const [path, text] of files) {
+        const found = schemaList(ts, path, text);
+        if (!found)
+            continue;
+        let statement = found.list;
+        while (statement.parent && !ts.isSourceFile(statement.parent))
+            statement = statement.parent;
+        // Into the list — ahead of any spread, so the app's own kinds stay together.
+        const spread = found.list.elements.find((one) => ts.isSpreadElement(one));
+        const last = found.list.elements[found.list.elements.length - 1];
+        let next = spread
+            ? `${text.slice(0, spread.getStart(found.source))}${change.binding}, ${text.slice(spread.getStart(found.source))}`
+            : last
+                ? `${text.slice(0, last.end)}, ${change.binding}${text.slice(last.end)}`
+                : `${text.slice(0, found.list.getStart(found.source) + 1)}${change.binding}${text.slice(found.list.getStart(found.source) + 1)}`;
+        // And declared just above where the schema gathers them.
+        const before = statement.getStart(found.source);
+        next = `${next.slice(0, before)}${change.text.trim()}\n\n${next.slice(before)}`;
+        files.set(path, next);
+        return undefined;
+    }
+    return `No createSchema([ … ]) to add "${change.kind}" to.`;
+}
+/**
+ * A new act or rule: declared after the last of its sort, and added to the
+ * list that gathers the others — the array literal that already names them.
+ */
+function addDeclaration(ts, files, sort, name, binding, statement) {
+    if (declarationOf(ts, files, sort, name))
+        return `The ${sort} "${name}" is already declared.`;
+    for (const [path, text] of files) {
+        const source = parse(ts, path, text);
+        const bindings = new Set();
+        let last;
+        for (const top of source.statements) {
+            const call = visit(ts, top, (node) => declares(ts, node, sort));
+            if (!call)
+                continue;
+            last = top;
+            const bound = ts.isVariableStatement(top) ? top.declarationList.declarations[0]?.name : undefined;
+            if (bound && ts.isIdentifier(bound))
+                bindings.add(bound.text);
+        }
+        if (!last)
+            continue;
+        const list = visit(ts, source, (node) => ts.isArrayLiteralExpression(node) && node.elements.some((one) => ts.isIdentifier(one) && bindings.has(one.text)));
+        if (!list)
+            return `The ${sort}s in ${path} are not gathered in a list the studio can add "${binding}" to.`;
+        // The list first, since it comes after the declarations: an edit to it moves nothing above it.
+        const tail = list.elements[list.elements.length - 1];
+        const multiline = text.slice(list.getStart(source), list.end).includes("\n");
+        let next = multiline
+            ? `${text.slice(0, tail.end)},\n${indentAt(text, tail.getStart(source))}${binding}${text.slice(tail.end)}`
+            : `${text.slice(0, tail.end)}, ${binding}${text.slice(tail.end)}`;
+        next = `${next.slice(0, last.end)}\n\n${statement.trim()}${next.slice(last.end)}`;
+        files.set(path, next);
+        return undefined;
+    }
+    return `No file declares ${sort}s to add "${name}" beside.`;
+}
+/**
+ * THE APP CARRIES ITS STORED GRAPHS FORWARD: its `version` moves on and the
+ * migration to it joins `migrations`, in the `defineApp({ … })` the app is
+ * declared with — so the graph somebody already has opens on the new
+ * declaration by running it, logged and undoable like any other change.
+ */
+function addMigration(ts, files, change) {
+    for (const [path, text] of files) {
+        const source = parse(ts, path, text);
+        const call = visit(ts, source, (node) => ts.isCallExpression(node) && calleeIs(ts, node, "defineApp"));
+        const app = call?.arguments[0];
+        if (!app || !ts.isObjectLiteralExpression(app))
+            continue;
+        // The list first, then the version, then the import: each edit is later in the file than the next one's position, or re-read.
+        let next = text;
+        const migrations = property(ts, app, "migrations");
+        if (migrations) {
+            if (!ts.isArrayLiteralExpression(migrations.initializer))
+                return `The migrations in ${path} are not written as a list the studio can add to.`;
+            const list = migrations.initializer;
+            const tail = list.elements[list.elements.length - 1];
+            next = tail
+                ? `${next.slice(0, tail.end)},\n${indentAt(next, tail.getStart(source))}${change.text}${next.slice(tail.end)}`
+                : `${next.slice(0, list.getStart(source))}[${change.text}]${next.slice(list.end)}`;
+        }
+        let reread = parse(ts, path, next);
+        let object = visit(ts, reread, (node) => ts.isCallExpression(node) && calleeIs(ts, node, "defineApp")).arguments[0];
+        if (!migrations)
+            next = insertProperty(next, object, reread, `migrations: [${change.text}]`);
+        reread = parse(ts, path, next);
+        object = visit(ts, reread, (node) => ts.isCallExpression(node) && calleeIs(ts, node, "defineApp")).arguments[0];
+        const version = property(ts, object, "version");
+        next = version ? replaceNode(next, version.initializer, reread, String(change.version)) : insertProperty(next, object, reread, `version: ${change.version}`);
+        files.set(path, withImport(ts, path, next, change.import.name, change.import.from));
+        return undefined;
+    }
+    return "No defineApp({ … }) in the declaration to add a migration to.";
+}
+/** `name` imported from `from`: added to an import of that module the file already has, or as a line of its own. */
+function withImport(ts, path, text, name, from) {
+    const source = parse(ts, path, text);
+    const imports = source.statements.filter(ts.isImportDeclaration);
+    const existing = imports.find((one) => ts.isStringLiteral(one.moduleSpecifier) && one.moduleSpecifier.text === from && !one.importClause?.isTypeOnly);
+    const named = existing?.importClause?.namedBindings;
+    if (named && ts.isNamedImports(named)) {
+        if (named.elements.some((element) => element.name.text === name))
+            return text;
+        const last = named.elements[named.elements.length - 1];
+        return `${text.slice(0, last.end)}, ${name}${text.slice(last.end)}`;
+    }
+    const after = imports[imports.length - 1];
+    const line = `import { ${name} } from ${JSON.stringify(from)};`;
+    return after ? `${text.slice(0, after.end)}\n${line}${text.slice(after.end)}` : `${line}\n${text}`;
+}
+//# sourceMappingURL=source-edit.js.map