@graview/core 0.1.0

package/dist/beginning.js

@@ -0,0 +1,94 @@
+import { deriveEditMutations } from "./mutations/derive-edits.js";
+import { nodeRefArgs } from "./mutations/node-ref.js";
+/** Every act the app has, declared and derived alike. */
+function actsOf(app) {
+    return [...(app.mutations ?? []), ...deriveEditMutations(app.schema, app.mutations ?? [])];
+}
+export function beginning(app) {
+    const kinds = [...app.schema.kinds];
+    const acts = actsOf(app);
+    /** What each act must be handed, as kinds, ignoring optional arguments. */
+    const requires = new Map();
+    /** What each act makes. */
+    const makes = new Map();
+    for (const act of acts) {
+        makes.set(act.name, (act.creates ?? []));
+        const wanted = nodeRefArgs(act.input)
+            .filter((arg) => !arg.optional && !arg.kinds.includes("*"))
+            .flatMap((arg) => arg.kinds);
+        requires.set(act.name, [...new Set(wanted)]);
+    }
+    const madeBy = new Map();
+    for (const kind of kinds)
+        madeBy.set(kind, []);
+    for (const act of acts) {
+        for (const kind of makes.get(act.name) ?? [])
+            madeBy.get(kind)?.push(act.name);
+    }
+    /*
+     * THE SHORTEST CHAIN TO EACH KIND, by widening the set of what exists.
+     *
+     * Start with nothing; take every act whose required kinds are all present;
+     * whatever they make now exists, at this depth. Repeat until a pass adds
+     * nothing. Kinds left over are unreachable — which includes an act whose
+     * only door needs a kind only IT can make, a cycle nobody can enter.
+     */
+    const depth = new Map();
+    const present = new Set();
+    for (let round = 0;; round += 1) {
+        const arrived = [];
+        for (const act of acts) {
+            const wants = requires.get(act.name) ?? [];
+            if (!wants.every((kind) => present.has(kind)))
+                continue;
+            for (const kind of makes.get(act.name) ?? []) {
+                if (!present.has(kind))
+                    arrived.push(kind);
+            }
+        }
+        if (arrived.length === 0)
+            break;
+        for (const kind of arrived) {
+            present.add(kind);
+            depth.set(kind, round);
+        }
+    }
+    const needsOf = (kind) => {
+        const doors = madeBy.get(kind) ?? [];
+        if (doors.length === 0)
+            return [];
+        /* The cheapest door decides, because one open door is enough. */
+        const cheapest = doors
+            .map((name) => requires.get(name) ?? [])
+            .sort((a, b) => a.length - b.length)[0];
+        return [...new Set(cheapest)].filter((wanted) => wanted !== kind);
+    };
+    const order = kinds
+        .map((kind) => ({
+        kind,
+        madeBy: [...(madeBy.get(kind) ?? [])].sort(),
+        needs: [...needsOf(kind)].sort(),
+        depth: depth.get(kind) ?? null,
+    }))
+        .sort((a, b) => (a.depth ?? Number.MAX_SAFE_INTEGER) - (b.depth ?? Number.MAX_SAFE_INTEGER) ||
+        a.kind.localeCompare(b.kind));
+    const roots = order.filter((entry) => entry.depth === 0).map((entry) => entry.kind);
+    const doors = [
+        ...new Set(acts
+            .filter((act) => (requires.get(act.name) ?? []).length === 0)
+            .filter((act) => (makes.get(act.name) ?? []).length > 0)
+            .map((act) => act.name)),
+    ].sort();
+    const unreachable = order
+        .filter((entry) => entry.depth === null)
+        .map((entry) => ({
+        kind: entry.kind,
+        why: entry.madeBy.length === 0
+            ? "no act declares that it creates this kind"
+            : `every act that makes it needs ${entry.needs
+                .map((kind) => `"${kind}"`)
+                .join(", ")}, which nothing can make first`,
+    }));
+    return { order, roots, doors, unreachable };
+}
+//# sourceMappingURL=beginning.js.map

package/dist/beginning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"beginning.js","sourceRoot":"","sources":["../src/beginning.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAiEtD,yDAAyD;AACzD,SAAS,MAAM,CAAsB,GAAkB;IACrD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,GAAG,mBAAmB,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED,MAAM,UAAU,SAAS,CAAsB,GAAkB;IAC/D,MAAM,KAAK,GAAG,CAAC,GAAI,GAAG,CAAC,MAAM,CAAC,KAA2B,CAAC,CAAC;IAC3D,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAEzB,2EAA2E;IAC3E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6B,CAAC;IACtD,2BAA2B;IAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;IACnD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAsB,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC;aAClC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;aAC1D,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC/C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,IAAI,KAAK,GAAG,CAAC,GAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACjC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC3C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YACxD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAChC,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,IAAY,EAAqB,EAAE;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACrC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAClC,iEAAiE;QACjE,MAAM,QAAQ,GAAG,KAAK;aACnB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;aACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,CAAC;QAC3C,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;IACpE,CAAC,CAAC;IAEF,MAAM,KAAK,GAAoB,KAAK;SACjC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACd,IAAI;QACJ,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;QAC5C,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;QAChC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI;KAC/B,CAAC,CAAC;SACF,IAAI,CACH,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,MAAM,CAAC,gBAAgB,CAAC;QAC3E,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAC/B,CAAC;IAEJ,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACpF,MAAM,KAAK,GAAG;QACZ,GAAG,IAAI,GAAG,CACR,IAAI;aACD,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;aAC5D,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;aACvD,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAC1B;KACF,CAAC,IAAI,EAAE,CAAC;IAET,MAAM,WAAW,GAAG,KAAK;SACtB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC;SACvC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACf,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,GAAG,EACD,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;YACvB,CAAC,CAAC,2CAA2C;YAC7C,CAAC,CAAC,iCAAiC,KAAK,CAAC,KAAK;iBACzC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC;iBAC1B,IAAI,CAAC,IAAI,CAAC,gCAAgC;KACpD,CAAC,CAAC,CAAC;IAEN,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;AAC9C,CAAC"}

package/dist/bind.d.ts

@@ -0,0 +1,42 @@
+import type { z } from "zod";
+import type { InvariantDefinition, InvariantEvalArgs, Violation } from "./invariants/types.js";
+import type { MutationDefinition, MutationDefinitionSpec } from "./mutations/types.js";
+import type { AnySchema, KindOfSchema, NodeOfKind } from "./schema/schema.js";
+import { type ViewRegistry } from "./views/types.js";
+export interface SchemaBinding<S extends AnySchema> {
+    readonly schema: S;
+    /**
+     * Declares a mutation against this schema. Binding the schema up front is
+     * what lets TypeScript infer the argument type from `input` — so a
+     * mutation body sees real field types, and a renamed field breaks the
+     * build rather than the app.
+     */
+    defineMutation<const Name extends string, I extends z.ZodType>(name: Name, spec: MutationDefinitionSpec<S, I>): MutationDefinition<S, Name, I>;
+    defineInvariant<const K extends KindOfSchema<S>>(name: string, spec: {
+        readonly scope: {
+            readonly kind: K;
+            readonly match?: (node: NodeOfKind<S, K>) => boolean;
+        };
+        readonly label?: string;
+        readonly description?: string;
+        readonly repairs?: readonly string[];
+        /** Judge retired subjects too — see `InvariantDefinition.judgesPast`. */
+        readonly judgesPast?: boolean;
+        readonly evaluate: (args: InvariantEvalArgs<S, NodeOfKind<S, K>>) => Violation[];
+    }): InvariantDefinition<S>;
+    defineGraphInvariant(name: string, spec: {
+        readonly label?: string;
+        readonly description?: string;
+        readonly repairs?: readonly string[];
+        readonly evaluate: (args: InvariantEvalArgs<S, undefined>) => Violation[];
+    }): InvariantDefinition<S>;
+    createViews<V = unknown>(): ViewRegistry<S, V>;
+}
+/**
+ * Binds a schema so everything declared against it infers from it. Without
+ * this, TypeScript cannot infer a mutation's argument type and the schema
+ * type at once — and an argument typed `unknown` defeats the whole point of
+ * declaring the schema.
+ */
+export declare function bindSchema<S extends AnySchema>(schema: S): SchemaBinding<S>;
+//# sourceMappingURL=bind.d.ts.map

package/dist/bind.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bind.d.ts","sourceRoot":"","sources":["../src/bind.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAE7B,OAAO,KAAK,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAC/F,OAAO,KAAK,EACV,kBAAkB,EAClB,sBAAsB,EACvB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,KAAK,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAC9E,OAAO,EAAsB,KAAK,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAEzE,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,SAAS;IAChD,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACnB;;;;;OAKG;IACH,cAAc,CAAC,KAAK,CAAC,IAAI,SAAS,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,OAAO,EAC3D,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,sBAAsB,CAAC,CAAC,EAAE,CAAC,CAAC,GACjC,kBAAkB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAClC,eAAe,CAAC,KAAK,CAAC,CAAC,SAAS,YAAY,CAAC,CAAC,CAAC,EAC7C,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE;QACJ,QAAQ,CAAC,KAAK,EAAE;YAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO,CAAA;SAAE,CAAC;QAC3F,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QACxB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAC9B,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QACrC,yEAAyE;QACzE,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;QAC9B,QAAQ,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;KAClF,GACA,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC1B,oBAAoB,CAClB,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE;QACJ,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;QACxB,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAC9B,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;QACrC,QAAQ,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;KAC3E,GACA,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC1B,WAAW,CAAC,CAAC,GAAG,OAAO,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAChD;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,SAAS,EAAE,MAAM,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAgB3E"}

package/dist/bind.js

@@ -0,0 +1,26 @@
+import { defineInvariant } from "./invariants/engine.js";
+import { createViewRegistry } from "./views/types.js";
+/**
+ * Binds a schema so everything declared against it infers from it. Without
+ * this, TypeScript cannot infer a mutation's argument type and the schema
+ * type at once — and an argument typed `unknown` defeats the whole point of
+ * declaring the schema.
+ */
+export function bindSchema(schema) {
+    return {
+        schema,
+        defineMutation(name, spec) {
+            return { ...spec, name };
+        },
+        defineInvariant(name, spec) {
+            return defineInvariant(name, spec);
+        },
+        defineGraphInvariant(name, spec) {
+            return defineInvariant(name, { ...spec, scope: "graph" });
+        },
+        createViews() {
+            return createViewRegistry(schema);
+        },
+    };
+}
+//# sourceMappingURL=bind.js.map

package/dist/bind.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bind.js","sourceRoot":"","sources":["../src/bind.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAOzD,OAAO,EAAE,kBAAkB,EAAqB,MAAM,kBAAkB,CAAC;AAsCzE;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAsB,MAAS;IACvD,OAAO;QACL,MAAM;QACN,cAAc,CAAC,IAAI,EAAE,IAAI;YACvB,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC;QAC3B,CAAC;QACD,eAAe,CAAC,IAAI,EAAE,IAAI;YACxB,OAAO,eAAe,CAAqB,IAAI,EAAE,IAAa,CAAC,CAAC;QAClE,CAAC;QACD,oBAAoB,CAAC,IAAI,EAAE,IAAI;YAC7B,OAAO,eAAe,CAAI,IAAI,EAAE,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QAC/D,CAAC;QACD,WAAW;YACT,OAAO,kBAAkB,CAAO,MAAM,CAAC,CAAC;QAC1C,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/city.d.ts

@@ -0,0 +1,93 @@
+import type { AnySchema } from "./schema/schema.js";
+/**
+ * THE CITY IS A MAP DRAWN FROM THE DECLARATION.
+ *
+ * A kind is a neighbourhood, and where it stands is decided by the
+ * declaration alone — never by today's data, never by what looks nice.
+ * Same declaration, same map; add a kind and every existing plot stays
+ * where it was; a kind that grows takes a bigger block on the same corner.
+ * That is what makes an address an address: the place a person remembers
+ * is the place they get.
+ *
+ * Units are LATTICE CELLS on the isometric ground, not pixels. `col` runs
+ * down-right along one diagonal, `row` down-left along the other; a plot
+ * occupies `side × side` cells from its corner. Plots sit on a block grid
+ * one `BLOCK` apart, so a plot growing to its largest side never reaches
+ * its neighbour: the street between is the cell left over.
+ *
+ * Placement walks the kinds in the order the declaration says a blank
+ * installation fills them (`beginning(app).order`, or sorted ids when
+ * nobody said), puts the first at the origin, and puts each next kind in
+ * the free block adjacent to the placed kind it shares the most declared
+ * edges with — ties by id — spiralling outward when the near blocks are
+ * taken. A kind declaring `plot` is put exactly there.
+ */
+export interface Plot {
+    /** Corner cell, in lattice units. Multiples of BLOCK unless declared. */
+    readonly col: number;
+    readonly row: number;
+    /** Cells on a side: ceil(sqrt(count)), at least 1, at most MAX_SIDE. */
+    readonly side: number;
+}
+/** The most cells a plot takes on a side. */
+export declare const MAX_SIDE = 4;
+/** Block pitch: the largest side plus one cell of street. */
+export declare const BLOCK: number;
+export interface CityHints {
+    /** The kind chain a blank installation fills, first to last. */
+    readonly order?: readonly string[];
+    /** How many of each kind stand today. Changes side, never col or row. */
+    readonly counts?: Readonly<Record<string, number>>;
+    /** Hand-laid plots, by kind. Used verbatim; a declared `plot` on the kind wins first. */
+    readonly plots?: Readonly<Record<string, {
+        readonly col: number;
+        readonly row: number;
+    }>>;
+}
+export type CityMap = ReadonlyMap<string, Plot>;
+/** A road: two kinds joined by declared edges, and which edges. */
+export interface Road {
+    readonly from: string;
+    readonly to: string;
+    readonly edges: readonly string[];
+}
+/** Cells on a side for a population. */
+export declare function sideFor(count: number | undefined): number;
+/**
+ * How many declared edges join two kinds, either direction. A wildcard
+ * edge touches every kind and counts once toward each.
+ */
+export declare function sharedEdges(schema: AnySchema, a: string, b: string): number;
+export declare function cityMap(schema: AnySchema, hints?: CityHints): CityMap;
+/** The roads between placed kinds: one per pair joined by any declared edge. */
+export declare function roadsOf(schema: AnySchema, map: CityMap): readonly Road[];
+/**
+ * Two plots overlap when their blocks do — the checker's question about
+ * hand-laid plots, asked at the block size so a plot growing to its
+ * largest side can never reach a neighbour.
+ */
+export declare function plotsOverlap(a: {
+    readonly col: number;
+    readonly row: number;
+}, b: {
+    readonly col: number;
+    readonly row: number;
+}): boolean;
+/** The map's extent in lattice cells: the smallest box holding every plot at its side. */
+export declare function cityExtent(map: CityMap): {
+    readonly minCol: number;
+    readonly minRow: number;
+    readonly maxCol: number;
+    readonly maxRow: number;
+};
+/**
+ * THE 2:1 LATTICE, as a projection. A cell (col,row) meets the screen at
+ * x = (col − row) · w/2, y = (col + row) · h/2 with h = w/2 — the same
+ * pitch the ground's CSS draws (lines at ±atan 2), so a plot placed here
+ * sits on the grid a person can see.
+ */
+export declare function toIso(col: number, row: number, cell: number): {
+    readonly x: number;
+    readonly y: number;
+};
+//# sourceMappingURL=city.d.ts.map

package/dist/city.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"city.d.ts","sourceRoot":"","sources":["../src/city.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEpD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,MAAM,WAAW,IAAI;IACnB,yEAAyE;IACzE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,wEAAwE;IACxE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;CACvB;AAED,6CAA6C;AAC7C,eAAO,MAAM,QAAQ,IAAI,CAAC;AAC1B,6DAA6D;AAC7D,eAAO,MAAM,KAAK,QAAe,CAAC;AAElC,MAAM,WAAW,SAAS;IACxB,gEAAgE;IAChE,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,yEAAyE;IACzE,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACnD,yFAAyF;IACzF,QAAQ,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE;QAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC,CAAC;CAC3F;AAED,MAAM,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAEhD,mEAAmE;AACnE,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;CACnC;AAID,wCAAwC;AACxC,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,CAGzD;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAe3E;AAsBD,wBAAgB,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,GAAE,SAAc,GAAG,OAAO,CAgDzE;AAED,gFAAgF;AAChF,wBAAgB,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,GAAG,SAAS,IAAI,EAAE,CAsBxE;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE;IAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;CAAE,EAAE,CAAC,EAAE;IAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAE1I;AAED,0FAA0F;AAC1F,wBAAgB,UAAU,CAAC,GAAG,EAAE,OAAO,GAAG;IAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAa/I;AAED;;;;;GAKG;AACH,wBAAgB,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG;IAAE,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAExG"}

package/dist/city.js

@@ -0,0 +1,160 @@
+/** The most cells a plot takes on a side. */
+export const MAX_SIDE = 4;
+/** Block pitch: the largest side plus one cell of street. */
+export const BLOCK = MAX_SIDE + 1;
+const byId = (a, b) => (a < b ? -1 : a > b ? 1 : 0);
+/** Cells on a side for a population. */
+export function sideFor(count) {
+    if (!count || count <= 1)
+        return 1;
+    return Math.min(MAX_SIDE, Math.ceil(Math.sqrt(count)));
+}
+/**
+ * How many declared edges join two kinds, either direction. A wildcard
+ * edge touches every kind and counts once toward each.
+ */
+export function sharedEdges(schema, a, b) {
+    if (a === b)
+        return 0;
+    const kinds = schema.kinds;
+    let shared = 0;
+    for (const [from, to] of [
+        [a, b],
+        [b, a],
+    ]) {
+        const definition = schema.tryDefinition(from);
+        for (const declaration of Object.values(definition?.edges ?? {})) {
+            const targets = declaration.to === "*" ? kinds : declaration.to;
+            if (targets.includes(to))
+                shared += 1;
+        }
+    }
+    return shared;
+}
+/** The block cells a plot at (col,row) reserves: every cell of the block. */
+const blockKey = (col, row) => `${Math.floor(col / BLOCK)},${Math.floor(row / BLOCK)}`;
+/**
+ * Blocks around `(col,row)` at Manhattan distance `d`, in a stable order:
+ * the four cardinal neighbours first (down-right, down-left, up-left,
+ * up-right), then the rest clockwise. Deterministic, so the walk is.
+ */
+function ringAround(col, row, d) {
+    if (d === 0)
+        return [{ col, row }];
+    const out = [];
+    for (let i = 0; i < d; i++) {
+        out.push({ col: col + (d - i) * BLOCK, row: row + i * BLOCK });
+        out.push({ col: col - i * BLOCK, row: row + (d - i) * BLOCK });
+        out.push({ col: col - (d - i) * BLOCK, row: row - i * BLOCK });
+        out.push({ col: col + i * BLOCK, row: row - (d - i) * BLOCK });
+    }
+    return out;
+}
+export function cityMap(schema, hints = {}) {
+    const kinds = [...schema.kinds];
+    const order = [
+        ...(hints.order ?? []).filter((kind) => kinds.includes(kind)),
+        ...kinds.filter((kind) => !(hints.order ?? []).includes(kind)).sort(byId),
+    ].filter((kind, index, all) => all.indexOf(kind) === index);
+    const plots = new Map();
+    const taken = new Set();
+    const put = (kind, col, row) => {
+        plots.set(kind, { col, row, side: sideFor(hints.counts?.[kind]) });
+        taken.add(blockKey(col, row));
+    };
+    /* HAND-LAID FIRST, verbatim: a declared address is an address. */
+    for (const kind of order) {
+        const declared = schema.tryDefinition(kind)?.plot ?? hints.plots?.[kind];
+        if (declared)
+            put(kind, declared.col, declared.row);
+    }
+    for (const kind of order) {
+        if (plots.has(kind))
+            continue;
+        if (plots.size === 0) {
+            put(kind, 0, 0);
+            continue;
+        }
+        /*
+         * THE PLACED KIND IT SHARES THE MOST EDGES WITH. None shared means
+         * nothing to be near, and the city's first block is the anchor — so an
+         * unrelated kind still lands near the middle rather than off on its own.
+         */
+        let anchor;
+        let most = 0;
+        for (const placed of [...plots.keys()].sort(byId)) {
+            const shared = sharedEdges(schema, kind, placed);
+            if (shared > most || (shared === most && shared > 0 && anchor !== undefined && byId(placed, anchor) < 0)) {
+                most = shared;
+                anchor = placed;
+            }
+        }
+        const from = anchor ? plots.get(anchor) : plots.get(order.find((k) => plots.has(k)));
+        let found;
+        for (let d = 1; !found && d < 64; d++) {
+            found = ringAround(from.col, from.row, d).find((cell) => !taken.has(blockKey(cell.col, cell.row)));
+        }
+        put(kind, found?.col ?? from.col + BLOCK * plots.size, found?.row ?? from.row);
+    }
+    return plots;
+}
+/** The roads between placed kinds: one per pair joined by any declared edge. */
+export function roadsOf(schema, map) {
+    const kinds = [...map.keys()].sort(byId);
+    const roads = [];
+    for (let i = 0; i < kinds.length; i++) {
+        for (let j = i + 1; j < kinds.length; j++) {
+            const a = kinds[i];
+            const b = kinds[j];
+            const edges = [];
+            for (const [from, to] of [
+                [a, b],
+                [b, a],
+            ]) {
+                const definition = schema.tryDefinition(from);
+                for (const [name, declaration] of Object.entries(definition?.edges ?? {})) {
+                    const targets = declaration.to === "*" ? schema.kinds : declaration.to;
+                    if (targets.includes(to))
+                        edges.push(name);
+                }
+            }
+            if (edges.length > 0)
+                roads.push({ from: a, to: b, edges });
+        }
+    }
+    return roads;
+}
+/**
+ * Two plots overlap when their blocks do — the checker's question about
+ * hand-laid plots, asked at the block size so a plot growing to its
+ * largest side can never reach a neighbour.
+ */
+export function plotsOverlap(a, b) {
+    return Math.abs(a.col - b.col) < BLOCK && Math.abs(a.row - b.row) < BLOCK;
+}
+/** The map's extent in lattice cells: the smallest box holding every plot at its side. */
+export function cityExtent(map) {
+    let minCol = Infinity;
+    let minRow = Infinity;
+    let maxCol = -Infinity;
+    let maxRow = -Infinity;
+    for (const plot of map.values()) {
+        minCol = Math.min(minCol, plot.col);
+        minRow = Math.min(minRow, plot.row);
+        maxCol = Math.max(maxCol, plot.col + plot.side);
+        maxRow = Math.max(maxRow, plot.row + plot.side);
+    }
+    if (map.size === 0)
+        return { minCol: 0, minRow: 0, maxCol: 1, maxRow: 1 };
+    return { minCol, minRow, maxCol, maxRow };
+}
+/**
+ * THE 2:1 LATTICE, as a projection. A cell (col,row) meets the screen at
+ * x = (col − row) · w/2, y = (col + row) · h/2 with h = w/2 — the same
+ * pitch the ground's CSS draws (lines at ±atan 2), so a plot placed here
+ * sits on the grid a person can see.
+ */
+export function toIso(col, row, cell) {
+    return { x: ((col - row) * cell) / 2, y: ((col + row) * cell) / 4 };
+}
+//# sourceMappingURL=city.js.map

package/dist/city.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"city.js","sourceRoot":"","sources":["../src/city.ts"],"names":[],"mappings":"AAkCA,6CAA6C;AAC7C,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC1B,6DAA6D;AAC7D,MAAM,CAAC,MAAM,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC;AAoBlC,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE5E,wCAAwC;AACxC,MAAM,UAAU,OAAO,CAAC,KAAyB;IAC/C,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACnC,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;IACjE,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,MAAM,KAAK,GAAG,MAAM,CAAC,KAA0B,CAAC;IAChD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI;QACvB,CAAC,CAAC,EAAE,CAAC,CAAC;QACN,CAAC,CAAC,EAAE,CAAC,CAAC;KACE,EAAE,CAAC;QACX,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9C,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;YACjE,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,WAAW,CAAC,EAAwB,CAAC;YACvF,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,6EAA6E;AAC7E,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAE,GAAW,EAAU,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;AAE/G;;;;GAIG;AACH,SAAS,UAAU,CAAC,GAAW,EAAE,GAAW,EAAE,CAAS;IACrD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IACnC,MAAM,GAAG,GAAmC,EAAE,CAAC;IAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QAC/D,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QAC/D,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;QAC/D,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,MAAiB,EAAE,QAAmB,EAAE;IAC9D,MAAM,KAAK,GAAG,CAAC,GAAI,MAAM,CAAC,KAA2B,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG;QACZ,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7D,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;KAC1E,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAE5D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,GAAG,GAAG,CAAC,IAAY,EAAE,GAAW,EAAE,GAAW,EAAE,EAAE;QACrD,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;QACnE,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC;IAEF,kEAAkE;IAClE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAI,MAAM,CAAC,aAAa,CAAC,IAAI,CAAyD,EAAE,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC;QAClI,IAAI,QAAQ;YAAE,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9B,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAChB,SAAS;QACX,CAAC;QACD;;;;WAIG;QACH,IAAI,MAA0B,CAAC;QAC/B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACjD,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACzG,IAAI,GAAG,MAAM,CAAC;gBACd,MAAM,GAAG,MAAM,CAAC;YAClB,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAE,CAAC;QACxF,IAAI,KAA+C,CAAC;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrG,CAAC;QACD,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IACjF,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,OAAO,CAAC,MAAiB,EAAE,GAAY;IACrD,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACpB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;YACpB,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI;gBACvB,CAAC,CAAC,EAAE,CAAC,CAAC;gBACN,CAAC,CAAC,EAAE,CAAC,CAAC;aACE,EAAE,CAAC;gBACX,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;gBAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;oBAC1E,MAAM,OAAO,GAAG,WAAW,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAE,MAAM,CAAC,KAA2B,CAAC,CAAC,CAAE,WAAW,CAAC,EAAwB,CAAC;oBACrH,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,CAAiD,EAAE,CAAiD;IAC/H,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAC5E,CAAC;AAED,0FAA0F;AAC1F,MAAM,UAAU,UAAU,CAAC,GAAY;IACrC,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;IACvB,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;QAChC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC1E,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC5C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,KAAK,CAAC,GAAW,EAAE,GAAW,EAAE,IAAY;IAC1D,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACtE,CAAC"}

package/dist/cli/check/arrangement.d.ts

@@ -0,0 +1,13 @@
+import type { AnySchema } from "../../schema/schema.js";
+import type { CheckContext } from "./context.js";
+/**
+ * WHAT A KIND SAYS IT IS ARRANGED BY has to be something it has.
+ *
+ * `fieldRoles.order` names the field a kind sorts by when nothing is asked;
+ * a lens's `arrangedBy` names how its picture opens. Both are strings in a
+ * declaration that nothing else reads until a person is looking, so a
+ * renamed field would leave a picture quietly opening unsorted. The
+ * arrangement module already knows what each kind offers; this asks it.
+ */
+export declare function checkArrangement<S extends AnySchema>(ctx: CheckContext<S>): void;
+//# sourceMappingURL=arrangement.d.ts.map

package/dist/cli/check/arrangement.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrangement.d.ts","sourceRoot":"","sources":["../../../src/cli/check/arrangement.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAEjD;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,SAAS,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CA6ChF"}

package/dist/cli/check/arrangement.js

@@ -0,0 +1,63 @@
+import { admitArrangement, arrangeable, parseArrangement } from "../../arrange.js";
+/**
+ * WHAT A KIND SAYS IT IS ARRANGED BY has to be something it has.
+ *
+ * `fieldRoles.order` names the field a kind sorts by when nothing is asked;
+ * a lens's `arrangedBy` names how its picture opens. Both are strings in a
+ * declaration that nothing else reads until a person is looking, so a
+ * renamed field would leave a picture quietly opening unsorted. The
+ * arrangement module already knows what each kind offers; this asks it.
+ */
+export function checkArrangement(ctx) {
+    const { app, add } = ctx;
+    for (const definition of app.schema.definitions) {
+        const order = definition.fieldRoles?.["order"];
+        if (order === undefined)
+            continue;
+        const shape = (definition.fields.shape ?? {});
+        if (order === "label" || order in shape)
+            continue;
+        add({
+            severity: "warning",
+            code: "order-role-unknown",
+            where: `defineNode("${definition.kind}").fieldRoles.order`,
+            message: `"${definition.kind}" says it sorts by "${order}", and has no such field — so nothing sorts it.`,
+            fix: `Point order at one of ${Object.keys(shape).join(", ") || "its fields"}, or drop it.`,
+        });
+    }
+    for (const lens of app.lenses ?? []) {
+        if (!lens.arrangedBy)
+            continue;
+        /*
+         * The kinds a lens is bound over: the keys of a fields binding, or the
+         * kinds an entities binding names. An arrangement is admitted against
+         * each; what none of them offers is noted.
+         */
+        const bound = new Set();
+        for (const [key, binding] of Object.entries(lens.bindings ?? {})) {
+            if (lens.binds === "entities") {
+                const kind = binding.kind;
+                if (typeof kind === "string")
+                    bound.add(kind);
+            }
+            else {
+                bound.add(key);
+            }
+        }
+        if (bound.size === 0)
+            continue;
+        const asked = parseArrangement(lens.arrangedBy);
+        const dropped = [...bound].map((kind) => admitArrangement(asked, arrangeable(app.schema, kind)).dropped);
+        const byEvery = dropped.length > 0 ? dropped.reduce((common, these) => common.filter((part) => these.includes(part))) : [];
+        for (const part of byEvery) {
+            add({
+                severity: "note",
+                code: "lens-arrangement-unknown",
+                where: `lens "${lens.name}" arrangedBy`,
+                message: `The lens opens arranged by "${part}", and none of ${[...bound].join(", ")} can be arranged that way — the picture will open unarranged there.`,
+                fix: `Name a field, an edge or \`is\` the bound kind has; \`graview describe\` lists what each kind can be arranged by.`,
+            });
+        }
+    }
+}
+//# sourceMappingURL=arrangement.js.map

package/dist/cli/check/arrangement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrangement.js","sourceRoot":"","sources":["../../../src/cli/check/arrangement.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAInF;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAsB,GAAoB;IACxE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;IACzB,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,EAAE,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAA4B,CAAC;QACzE,IAAI,KAAK,KAAK,OAAO,IAAI,KAAK,IAAI,KAAK;YAAE,SAAS;QAClD,GAAG,CAAC;YACF,QAAQ,EAAE,SAAS;YACnB,IAAI,EAAE,oBAAoB;YAC1B,KAAK,EAAE,eAAe,UAAU,CAAC,IAAI,qBAAqB;YAC1D,OAAO,EAAE,IAAI,UAAU,CAAC,IAAI,uBAAuB,KAAK,iDAAiD;YACzG,GAAG,EAAE,yBAAyB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,YAAY,eAAe;SAC3F,CAAC,CAAC;IACL,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,SAAS;QAC/B;;;;WAIG;QACH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,CAAC;YACjE,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAI,OAA8B,CAAC,IAAI,CAAC;gBAClD,IAAI,OAAO,IAAI,KAAK,QAAQ;oBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QAC/B,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAgB,CAAC,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACzG,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3H,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,GAAG,CAAC;gBACF,QAAQ,EAAE,MAAM;gBAChB,IAAI,EAAE,0BAA0B;gBAChC,KAAK,EAAE,SAAS,IAAI,CAAC,IAAI,cAAc;gBACvC,OAAO,EAAE,+BAA+B,IAAI,kBAAkB,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,qEAAqE;gBACxJ,GAAG,EAAE,mHAAmH;aACzH,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/cli/check/beginnings.d.ts

@@ -0,0 +1,16 @@
+import type { AnySchema } from "../../schema/schema.js";
+/**
+ * `note` is a QUESTION ASKED OUT LOUD, not a problem.
+ *
+ * Some things a checker can see are legitimate designs that the author
+ * should nonetheless have looked at once: a lens written for this app and
+ * never proved against another domain, a role name two vocabularies both
+ * use, a kind unreachable on an empty graph. Filed as warnings they would
+ * be warnings that can only ever be acknowledged, and those are the ones
+ * people learn to scroll past — which costs the checker its authority on
+ * the warnings that matter. So they have their own voice: counted, printed,
+ * and never a failure.
+ */
+import type { CheckContext } from "./context.js";
+export declare function checkBlankInstallation<S extends AnySchema>(ctx: CheckContext<S>): void;
+//# sourceMappingURL=beginnings.d.ts.map

package/dist/cli/check/beginnings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"beginnings.d.ts","sourceRoot":"","sources":["../../../src/cli/check/beginnings.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAExD;;;;;;;;;;;GAWG;AACH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAEjD,wBAAgB,sBAAsB,CAAC,CAAC,SAAS,SAAS,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAgDtF"}

package/dist/cli/check/beginnings.js

@@ -0,0 +1,53 @@
+import { beginning } from "../../beginning.js";
+export function checkBlankInstallation(ctx) {
+    const { app, kinds, add } = ctx;
+    /*
+     * WHAT A BLANK INSTALLATION CAN ACTUALLY DO.
+     *
+     * `creates` and a nodeRef argument are together a chain — a feature cannot
+     * be made until a zone exists — and it is invisible at build time: the
+     * declaration is well-formed, every act is correct, and the gap only
+     * appears at runtime on the one graph nobody tests against. A ten-kind app
+     * can ship with one door and seven silent districts, and the first person
+     * to open it is the first to find out.
+     *
+     * Notes rather than warnings, because every answer here is a legitimate
+     * design: a kind a migration seeds, a catalogue that arrives whole, a
+     * product whose data comes from a sync. The author should have to look at
+     * it once, not argue with it forever.
+     */
+    const chain = beginning(app);
+    /*
+     * Only an app that says it MAKES things is asked how. An app whose every
+     * act edits what is already there — a catalogue, a graph that arrives by
+     * seed or sync — never claimed a way in, and telling it there is none is
+     * a note with no question in it.
+     */
+    const claimsToMake = (app.mutations ?? []).some((mutation) => (mutation.creates ?? []).length > 0);
+    if (!claimsToMake) {
+        // Nothing to say: creation is not this app's business.
+    }
+    else if (chain.doors.length === 0 && kinds.size > 0) {
+        add({
+            severity: "note",
+            code: "blank-graph-has-no-door",
+            where: "mutations",
+            message: `Nothing can be made in an empty ${app.name}: every act that creates a kind needs a node that does not exist yet.`,
+            fix: `If the graph arrives seeded or synced, that is the answer and this is just the note. Otherwise give one act no required nodeRef, so a blank installation has a way in.`,
+        });
+    }
+    else if (chain.unreachable.length > 0) {
+        add({
+            severity: "note",
+            code: "blank-graph-unreachable",
+            where: "mutations",
+            message: `${chain.unreachable
+                .map((entry) => `"${entry.kind}"`)
+                .join(", ")} cannot be made from empty — ${chain.unreachable[0].why}. The way in is ${chain.doors
+                .map((door) => `"${door}"`)
+                .join(", ")}.`,
+            fix: `Declare creates: ["<kind>"] on the act that adds one, or accept that these arrive by seed, migration or sync.`,
+        });
+    }
+}
+//# sourceMappingURL=beginnings.js.map

package/dist/cli/check/beginnings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"beginnings.js","sourceRoot":"","sources":["../../../src/cli/check/beginnings.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAiB/C,MAAM,UAAU,sBAAsB,CAAsB,GAAoB;IAC9E,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;IAChC;;;;;;;;;;;;;;OAcG;IACH,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;IAC7B;;;;;OAKG;IACH,MAAM,YAAY,GAAG,CAAC,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACnG,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,uDAAuD;IACzD,CAAC;SAAM,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACtD,GAAG,CAAC;YACF,QAAQ,EAAE,MAAM;YAChB,IAAI,EAAE,yBAAyB;YAC/B,KAAK,EAAE,WAAW;YAClB,OAAO,EAAE,mCAAmC,GAAG,CAAC,IAAI,uEAAuE;YAC3H,GAAG,EAAE,wKAAwK;SAC9K,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,GAAG,CAAC;YACF,QAAQ,EAAE,MAAM;YAChB,IAAI,EAAE,yBAAyB;YAC/B,KAAK,EAAE,WAAW;YAClB,OAAO,EAAE,GAAG,KAAK,CAAC,WAAW;iBAC1B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC;iBACjC,IAAI,CAAC,IAAI,CAAC,gCAAgC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,GAAG,mBAAmB,KAAK,CAAC,KAAK;iBACjG,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC;iBAC1B,IAAI,CAAC,IAAI,CAAC,GAAG;YAChB,GAAG,EAAE,+GAA+G;SACrH,CAAC,CAAC;IACL,CAAC;AACH,CAAC"}

package/dist/cli/check/brand.d.ts

@@ -0,0 +1,17 @@
+import type { AnySchema } from "../../schema/schema.js";
+/**
+ * `note` is a QUESTION ASKED OUT LOUD, not a problem.
+ *
+ * Some things a checker can see are legitimate designs that the author
+ * should nonetheless have looked at once: a lens written for this app and
+ * never proved against another domain, a role name two vocabularies both
+ * use, a kind unreachable on an empty graph. Filed as warnings they would
+ * be warnings that can only ever be acknowledged, and those are the ones
+ * people learn to scroll past — which costs the checker its authority on
+ * the warnings that matter. So they have their own voice: counted, printed,
+ * and never a failure.
+ */
+import type { CheckContext } from "./context.js";
+export declare function checkAccents<S extends AnySchema>(ctx: CheckContext<S>): void;
+export declare function checkPalette<S extends AnySchema>(ctx: CheckContext<S>): void;
+//# sourceMappingURL=brand.d.ts.map