waterplane 0.0.1 → 0.1.6

package/node_modules/@waterplane/shared/dist/assess/sassio.d.ts

@@ -0,0 +1,257 @@
+/** A slice of assess.ts — moved whole from assess.ts, see docs/notes/shared-architecture.md. */
+import type { Lifecycle } from "../intent.js";
+import type { ItemCategory } from "../naming.js";
+import { type AssessScope, type AssessSource, type AssessVerdict } from "./sassvocab.js";
+/**
+ * One thing the run is asked about.
+ *
+ * `text` is the user's own words, in full. Nothing in this module reads its
+ * length, and nothing downstream may clip it: the entire feature exists because
+ * eighty-four such sentences were worth more than any forty a model would write
+ * to replace them.
+ */
+export interface AssessItem {
+    id: string;
+    source: AssessSource;
+    /** The words, in FULL. Never clipped, here or anywhere downstream. */
+    text: string;
+    /**
+     * Lifecycle for an intent row; absent for a pad note.
+     *
+     * It is not only context for the CLI: it is **what tells a row that can be
+     * RANKED from a row that has to be PUT BACK**. A `still wanted` verdict on a
+     * `queued` row is a position in an order the row is already in; the same
+     * verdict on a `failed` row is about a row the tick's ladder never looks at
+     * again, where writing a position alone changes nothing a person could ever
+     * observe. `applyAssessment` reads this field and nothing else to tell them
+     * apart, so a row that arrives without it is ranked — the behaviour every
+     * apply had before a failed row could be re-queued at all.
+     */
+    state?: Lifecycle;
+    /**
+     * **When the row this run judged settled** — `Intent.settledAt`, as the run
+     * saw it. The other half of `state`, and only meaningful with it.
+     *
+     * `state: "failed"` is a state, not an event: the same row can be `failed`
+     * twice over two different failures, and this document is written at the
+     * START of a run that a person applies MINUTES later, from a sheet they may
+     * have left open for an hour. In between, the row can have been revived by
+     * Activity or by a hand tap, run, and failed again — differently. Applying
+     * *still wanted* then re-runs work on the strength of a failure that is no
+     * longer the row's and that nobody has read.
+     *
+     * So the run records WHICH failure it was looking at, and the host compares
+     * it with what is on disk at apply time; a row that has settled again since
+     * is refused rather than revived. `applyAssessment` does not read it — the
+     * decision is unchanged, the mutation is the same one — it travels so the
+     * side that performs the mutation can tell the row it judged from a row that
+     * merely has the same state. The wire op carries the same fact for the same
+     * reason (`intent.requeue`'s `failedAt`).
+     *
+     * Absent on every pad note, on every row that has not settled, and on every
+     * document written before this field — which is `expectPrompt`'s posture on
+     * absence: a proposal that cannot say is applied on the state alone, exactly
+     * as it was before, never refused for not carrying a fact its writer had no
+     * way to write.
+     */
+    failedAt?: number;
+    /**
+     * Given to the CLI so it can judge what is LEFT, but not itself verdictable.
+     *
+     * A finished row is how you tell that the thing next to it was already built;
+     * it is not something to retire a second time. A verdict naming a context row
+     * is dropped and noted, which is the difference between "read this" and
+     * "decide about this".
+     */
+    context?: boolean;
+    label?: string;
+    createdAt?: number;
+}
+/** A pad note carrying this repo's `cwd` — the other half of "everything left". */
+export interface AssessNote {
+    id: string;
+    text: string;
+    createdAt?: number;
+}
+/** The document the host writes for the CLI to read. Versioned because it is a
+ *  file on disk in someone's repo, and a file on disk outlives a build. */
+export interface AssessInput {
+    version: 1;
+    /** When the host wrote it, so a file left behind says how old it is. */
+    at: number;
+    /** The repo it is about. */
+    cwd: string;
+    items: AssessItem[];
+    /**
+     * **The cut the run was asked about**, when it was asked about one — absent
+     * is the whole repo.
+     *
+     * On the document rather than only on the run, because this file IS what the
+     * CLI was handed and what the sheet renders a verdict against later. A
+     * proposal read back a week after the fact has to be able to say "these were
+     * the seven rows this judged", and the run row it came from may by then have
+     * been evicted (`ASSESS_MAX_RUNS`) while the sidecar proposal lives on.
+     *
+     * Never a reason to alter a VERDICT: every rule that decides what a verdict
+     * may say is `cleanAssessment`'s and reads `items`, which is already narrowed
+     * by the time this file exists. A second rule keyed on this field would be a
+     * second opinion about the same question.
+     */
+    scopedIds?: string[];
+    /** **What the scoped ids ARE**, when they are a slot — rows that fire
+     *  together (`AssessScope`). Absent on every other run. */
+    scope?: AssessScope;
+}
+/** Why the pure layer overrode what the CLI said. Machine-readable, so a sheet
+ *  can group them, plus `downgradeText` for the sentence. */
+export type AssessDowngrade = 
+/** A retiring verdict with nothing behind it. */
+"no-evidence"
+/** A word that is not one of the six. */
+ | "unknown-verdict"
+/** Two verdicts for one id: ambiguous about what happens to it. */
+ | "duplicate"
+/** The assessment never mentioned this item at all. */
+ | "unmentioned"
+/** `superseded` naming an id that was not in the input. */
+ | "supersede-unknown"
+/** `superseded` naming itself. */
+ | "supersede-self"
+/** A supersede chain that comes back round. */
+ | "supersede-cycle"
+/** In two groups, or in a group AND carrying another verdict. */
+ | "merge-conflict"
+/** The group it was in did not survive the merge rules. */
+ | "merge-dropped"
+/** `merged` naming a group that does not exist. */
+ | "merge-unknown";
+/** One existing item, with what the run concluded about it. */
+export interface AssessRow {
+    id: string;
+    verdict: AssessVerdict;
+    /** The citation, the rationale, or the sentence saying what was ambiguous.
+     *  Guaranteed non-empty on `done`/`obsolete`/`superseded` — that is the rule
+     *  this whole module exists for. */
+    evidence: string;
+    /** `wanted`: where it sits in the order. */
+    rank?: number;
+    /** `superseded`: the id that covers it. Flattened — always one hop. */
+    supersededBy?: string;
+    /** `merged`: which surviving group. */
+    gid?: string;
+    /** Set when the pure layer overrode the CLI. `unclear` rows produced by a
+     *  downgrade always carry one; a row the CLI itself called `unclear` does
+     *  not. */
+    downgraded?: AssessDowngrade;
+    /**
+     * What the run would CALL this row, and what kind of thing it is.
+     *
+     * They ride on every row the run judged, `unclear` and downgraded ones
+     * included, and that is deliberate: a naming is a reading of the WORDS, not a
+     * claim about the codebase, so the rule that strips a verdict for having no
+     * citation has nothing to say about it. A run that could not tell whether the
+     * thing was done can still tell that it is about a crash in the uploader.
+     *
+     * `cleanHeadline`/`cleanCategory` have already had their say by the time
+     * either appears here: absent means nothing usable was written, never a
+     * default.
+     */
+    headline?: string;
+    category?: ItemCategory;
+}
+/** Several rows the run says are one job, plus the prompt it wrote to cover
+ *  them. The highest-stakes row in the sheet: approving it means approving text
+ *  the user did not write, in place of text they did. */
+export interface AssessMerge {
+    gid: string;
+    /** 2..MAX_MERGE_SIZE ids, each in this group and no other. */
+    ids: string[];
+    /** The prompt that replaces them. Full text, never clipped. */
+    prompt: string;
+    rank?: number;
+    /** Why these are one job — the evidence each dismissed member carries. */
+    rationale: string;
+    /** What to call the row this group posts, and what kind it is. A merged row
+     *  is machine text already, so a nameless one is the worse outcome — see
+     *  `AssessPost`. */
+    headline?: string;
+    category?: ItemCategory;
+}
+/** A genuinely missing piece. Prose, a rank, and what to call it. */
+export interface AssessNew {
+    prompt: string;
+    rank?: number;
+    /** Same as `AssessMerge`: the prompt is the run's own words, so titling it is
+     *  not standing in for anybody. */
+    headline?: string;
+    category?: ItemCategory;
+    /**
+     * **The pad note whose words this IS, verbatim.** Set only by
+     * `cleanAssessment` itself, never read off the CLI's `new` array.
+     *
+     * A `wanted` verdict on a pad note used to be the one verdict with nowhere to
+     * go: the note was read, judged and left, because the pad is synced client
+     * state the host does not own. The offer closes that, and the words on it are
+     * the note's own because this module COPIED them — not because the CLI was
+     * asked to and complied. That is the difference between a guarantee and a
+     * hope, and it is why the field is synthesised here rather than parsed.
+     *
+     * It travels so the phone can clear the note once the receipt says the row
+     * landed: without it the person ends up holding the same sentence in two
+     * places with no way to tell which one is going to run.
+     */
+    fromNote?: string;
+}
+/**
+ * **Two or more rows that contradict each other** — opposite changes to one
+ * thing, or one depending on a row that runs LATER.
+ *
+ * Words, never a mutation: there is no choice that approves a conflict and
+ * `applyAssessment` never reads this list. The phone offers *edit*, *drop one*
+ * and *ignore* as the person's own separate verbs on the rows it names.
+ */
+export interface AssessConflict {
+    cid: string;
+    /** 2..MAX_CONFLICT_IDS assessable ids, distinct. */
+    ids: string[];
+    /** One sentence: what contradicts what. Never empty. */
+    why: string;
+}
+/**
+ * **One row that is two jobs** — the two texts it should become.
+ *
+ * Approving it posts both texts on the ORIGINAL row's clock and archives (not
+ * cancels) the original (`AssessMutations.split`). Intent rows only, and the
+ * two texts together still name every file the original named
+ * (`transportPaths`) — a split that loses a path is refused by
+ * `cleanAssessment`, because a picture somebody attached must not fall off
+ * the work it was attached to.
+ */
+export interface AssessSplit {
+    sid: string;
+    /** The row being split. */
+    id: string;
+    /** Exactly `SPLIT_PARTS` non-empty texts, in run order. Never clipped. */
+    texts: string[];
+    /** Why this is two jobs. */
+    rationale: string;
+}
+/** The whole proposal: what a person is being asked to approve. */
+export interface AssessProposal {
+    rows: AssessRow[];
+    merges: AssessMerge[];
+    news: AssessNew[];
+    /** Contradictions the run found — words only. Absent on every proposal
+     *  written before the slot check (2026-10-16). */
+    conflicts?: AssessConflict[];
+    /** Rows the run would split in two. Absent as above. */
+    splits?: AssessSplit[];
+    /**
+     * What the pure layer refused, one sentence each.
+     *
+     * Shown, not swallowed: a merge group dropped silently is indistinguishable
+     * from a merge group nobody proposed, and the difference is whether the run
+     * was any good.
+     */
+    notes: string[];
+}

package/node_modules/@waterplane/shared/dist/assess/sassio.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=sassio.js.map

package/node_modules/@waterplane/shared/dist/assess/sassio.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sassio.js","sourceRoot":"","sources":["../../src/assess/sassio.ts"],"names":[],"mappings":""}

package/node_modules/@waterplane/shared/dist/assess/sassslot.d.ts

@@ -0,0 +1,19 @@
+import { type AssessConflict, type AssessItem, type AssessMerge, type AssessRow, type AssessSplit } from "./sassio.js";
+/**
+ * A contradiction has to name at least two rows this run could decide about
+ * and say why. Unknown ids are dropped (and said); one left is not a conflict.
+ * Nothing here can change a row, so the rules are only about the card being
+ * something a person can act on.
+ */
+export declare function cleanConflicts(raw: Record<string, unknown>[], canDecide: ReadonlySet<string>, note: (s: string) => void): AssessConflict[];
+/**
+ * A split replaces somebody's words with two texts the run wrote, so it is
+ * held to the merge's standard plus one: exactly two non-empty texts, neither
+ * the original verbatim nor each other, none over `MAX_PROMPT_CHARS` (dropped,
+ * never cut), on an INTENT row (a pad note is not the host's to archive), on a
+ * row no other outcome retires, once per row — and every file path the
+ * original named (`transportPaths`) still named by one of the two. A split
+ * that loses a path is REFUSED, never repaired: appending the path to a text
+ * would be this module writing the instruction.
+ */
+export declare function cleanSplits(raw: Record<string, unknown>[], items: ReadonlyMap<string, AssessItem>, canDecide: ReadonlySet<string>, rows: readonly AssessRow[], memberOf: ReadonlyMap<string, AssessMerge>, note: (s: string) => void): AssessSplit[];

package/node_modules/@waterplane/shared/dist/assess/sassslot.js

@@ -0,0 +1,136 @@
+/**
+ * A slice of assess.ts: the slot check's two proposal kinds (2026-10-16),
+ * cleaned. `cleanAssessment` (sassclean.ts) calls both once the rows and the
+ * merges are settled. Layout: docs/notes/shared-architecture.md.
+ */
+import { transportPaths } from "../itempaths.js";
+import { MAX_CONFLICT_IDS, MAX_CONFLICTS, MAX_EVIDENCE_CHARS, MAX_PROMPT_CHARS, MAX_RATIONALE_CHARS, MAX_SPLITS, SPLIT_PARTS, clip, str } from "./sassvocab.js";
+// ── 8. Conflicts — words, never a mutation ───────────────────────────────────
+/**
+ * A contradiction has to name at least two rows this run could decide about
+ * and say why. Unknown ids are dropped (and said); one left is not a conflict.
+ * Nothing here can change a row, so the rules are only about the card being
+ * something a person can act on.
+ */
+export function cleanConflicts(raw, canDecide, note) {
+    const out = [];
+    const cids = new Set();
+    const sets = new Set();
+    for (const c of raw) {
+        if (out.length >= MAX_CONFLICTS) {
+            note(`only the first ${MAX_CONFLICTS} conflicts were kept.`);
+            break;
+        }
+        const cid = clip(str(c.cid) || str(c.id) || `c${out.length + 1}`, 40);
+        if (cids.has(cid)) {
+            note(`a second conflict called “${cid}” was dropped.`);
+            continue;
+        }
+        const cited = (Array.isArray(c.ids) ? c.ids : []).filter((x) => typeof x === "string").map((x) => x.trim()).filter(Boolean);
+        const uniq = [...new Set(cited)];
+        const ids = uniq.filter((id) => canDecide.has(id));
+        if (ids.length < uniq.length)
+            note(`conflict “${cid}” named ${uniq.length - ids.length} item(s) that were not in the list; they were dropped from it.`);
+        if (ids.length < 2) {
+            note(`conflict “${cid}” was left naming fewer than two items, so it was dropped.`);
+            continue;
+        }
+        if (ids.length > MAX_CONFLICT_IDS) {
+            note(`conflict “${cid}” named ${ids.length} items — over the limit of ${MAX_CONFLICT_IDS} — so it was dropped.`);
+            continue;
+        }
+        const why = clip(str(c.why) || str(c.reason) || str(c.rationale) || str(c.evidence), MAX_EVIDENCE_CHARS);
+        if (!why) {
+            note(`conflict “${cid}” did not say what contradicts what, so it was dropped.`);
+            continue;
+        }
+        const setKey = [...ids].sort().join("\n");
+        if (sets.has(setKey)) {
+            note(`conflict “${cid}” repeated another conflict's items, so it was dropped.`);
+            continue;
+        }
+        sets.add(setKey);
+        cids.add(cid);
+        out.push({ cid, ids, why });
+    }
+    return out;
+}
+// ── 9. Splits — one row, two texts, no file lost ─────────────────────────────
+/** The verdicts a split cannot stand beside: each already retires the row. */
+const RETIRING = new Set(["done", "obsolete", "superseded", "merged"]);
+/**
+ * A split replaces somebody's words with two texts the run wrote, so it is
+ * held to the merge's standard plus one: exactly two non-empty texts, neither
+ * the original verbatim nor each other, none over `MAX_PROMPT_CHARS` (dropped,
+ * never cut), on an INTENT row (a pad note is not the host's to archive), on a
+ * row no other outcome retires, once per row — and every file path the
+ * original named (`transportPaths`) still named by one of the two. A split
+ * that loses a path is REFUSED, never repaired: appending the path to a text
+ * would be this module writing the instruction.
+ */
+export function cleanSplits(raw, items, canDecide, rows, memberOf, note) {
+    const out = [];
+    const sids = new Set();
+    const seen = new Set();
+    const twice = new Set();
+    const verdict = new Map(rows.map((r) => [r.id, r.verdict]));
+    for (const s of raw) {
+        if (out.length >= MAX_SPLITS) {
+            note(`only the first ${MAX_SPLITS} splits were considered.`);
+            break;
+        }
+        const sid = clip(str(s.sid) || `s${out.length + 1}`, 40);
+        if (sids.has(sid)) {
+            note(`a second split called “${sid}” was dropped.`);
+            continue;
+        }
+        const id = str(s.id) || str(s.source);
+        const it = items.get(id);
+        if (!id || !it || !canDecide.has(id)) {
+            note(`split “${sid}” named an item that was not in the list, so it was dropped.`);
+            continue;
+        }
+        if (it.source !== "intent") {
+            note(`split “${sid}” was about a pad note, which is not split here — it was dropped.`);
+            continue;
+        }
+        if (seen.has(id)) {
+            twice.add(id);
+            continue;
+        }
+        seen.add(id);
+        const v = verdict.get(id);
+        if (memberOf.has(id) || (v && RETIRING.has(v))) {
+            note(`split “${sid}” was about “${id}”, which another outcome already retires, so it was dropped.`);
+            continue;
+        }
+        const rawTexts = Array.isArray(s.texts) ? s.texts : Array.isArray(s.parts) ? s.parts : [];
+        const texts = rawTexts.map((t) => (typeof t === "string" ? t.trim() : ""));
+        if (texts.length !== SPLIT_PARTS || texts.some((t) => !t)) {
+            note(`split “${sid}” did not give exactly ${SPLIT_PARTS} texts, so it was dropped.`);
+            continue;
+        }
+        if (texts.some((t) => t.length > MAX_PROMPT_CHARS)) {
+            note(`split “${sid}” proposed a text over ${MAX_PROMPT_CHARS} characters; it was dropped rather than cut short.`);
+            continue;
+        }
+        const orig = (it.text ?? "").trim();
+        if (texts[0] === texts[1] || texts.includes(orig)) {
+            note(`split “${sid}” did not actually divide “${id}” into two different jobs, so it was dropped.`);
+            continue;
+        }
+        const kept = new Set(texts.flatMap((t) => transportPaths(t)));
+        const lost = transportPaths(orig).filter((p) => !kept.has(p));
+        if (lost.length) {
+            note(`split “${sid}” would lose ${lost.join(", ")} from “${id}”, so it was refused.`);
+            continue;
+        }
+        sids.add(sid);
+        out.push({ sid, id, texts, rationale: clip(str(s.rationale) || str(s.reason) || str(s.why), MAX_RATIONALE_CHARS) });
+    }
+    // Two splits of one row are two different answers to how it divides.
+    for (const id of twice)
+        note(`“${id}” was split more than one way, so none of the splits was used.`);
+    return twice.size ? out.filter((s) => !twice.has(s.id)) : out;
+}
+//# sourceMappingURL=sassslot.js.map

package/node_modules/@waterplane/shared/dist/assess/sassslot.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sassslot.js","sourceRoot":"","sources":["../../src/assess/sassslot.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,EAAsB,gBAAgB,EAAE,aAAa,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,UAAU,EAAE,WAAW,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,gBAAgB,CAAC;AAIpL,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,GAA8B,EAAE,SAA8B,EAAE,IAAyB;IACtH,MAAM,GAAG,GAAqB,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,CAAC,MAAM,IAAI,aAAa,EAAE,CAAC;YAAC,IAAI,CAAC,kBAAkB,aAAa,uBAAuB,CAAC,CAAC;YAAC,MAAM;QAAC,CAAC;QACzG,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,6BAA6B,GAAG,gBAAgB,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACxF,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAU,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAClJ,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,aAAa,GAAG,WAAW,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,gEAAgE,CAAC,CAAC;QACxJ,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,aAAa,GAAG,4DAA4D,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACrH,IAAI,GAAG,CAAC,MAAM,GAAG,gBAAgB,EAAE,CAAC;YAAC,IAAI,CAAC,aAAa,GAAG,WAAW,GAAG,CAAC,MAAM,8BAA8B,gBAAgB,uBAAuB,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QAClK,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACzG,IAAI,CAAC,GAAG,EAAE,CAAC;YAAC,IAAI,CAAC,aAAa,GAAG,yDAAyD,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACxG,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,aAAa,GAAG,yDAAyD,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACpH,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAEhF,8EAA8E;AAC9E,MAAM,QAAQ,GAA+B,IAAI,GAAG,CAAgB,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC;AAElH;;;;;;;;;GASG;AACH,MAAM,UAAU,WAAW,CACzB,GAA8B,EAC9B,KAAsC,EACtC,SAA8B,EAC9B,IAA0B,EAC1B,QAA0C,EAC1C,IAAyB;IAEzB,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAU,CAAC,CAAC,CAAC;IACrE,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,CAAC,MAAM,IAAI,UAAU,EAAE,CAAC;YAAC,IAAI,CAAC,kBAAkB,UAAU,0BAA0B,CAAC,CAAC;YAAC,MAAM;QAAC,CAAC;QACtG,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,0BAA0B,GAAG,gBAAgB,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACrF,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,UAAU,GAAG,8DAA8D,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACtI,IAAI,EAAE,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAAC,IAAI,CAAC,UAAU,GAAG,mEAAmE,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QACjI,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAAC,SAAS;QAAC,CAAC;QAC9C,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,UAAU,GAAG,gBAAgB,EAAE,8DAA8D,CAAC,CAAC;YACpG,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1F,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAU,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpF,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,UAAU,GAAG,0BAA0B,WAAW,4BAA4B,CAAC,CAAC;YACrF,SAAS;QACX,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,gBAAgB,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,UAAU,GAAG,0BAA0B,gBAAgB,oDAAoD,CAAC,CAAC;YAClH,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,UAAU,GAAG,8BAA8B,EAAE,+CAA+C,CAAC,CAAC;YACnG,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,GAAG,gBAAgB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,uBAAuB,CAAC,CAAC;YACtF,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACtH,CAAC;IACD,qEAAqE;IACrE,KAAK,MAAM,EAAE,IAAI,KAAK;QAAE,IAAI,CAAC,IAAI,EAAE,gEAAgE,CAAC,CAAC;IACrG,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AAChE,CAAC"}

package/node_modules/@waterplane/shared/dist/assess/sassvocab.d.ts

@@ -0,0 +1,115 @@
+/**
+ * Where one assessable item's words live — the two stores addressable by `cwd`:
+ * the intent store, and the pad.
+ *
+ * The pad is NOT "where words go when a send gives up" any more. `retireToPad`
+ * is deleted: a queue row that fails now keeps its own row and its own full
+ * words for as long as it takes, so nothing is moved anywhere on a failure. The
+ * pad is thoughts written with no target — which named a repo because they
+ * attached a file, or were written for one — and that `cwd` is the whole reason
+ * an assessment of a repo has anything to say about them.
+ */
+export type AssessSource = "intent" | "note";
+/**
+ * The verdict on one existing item.
+ *
+ * `unclear` is the safe direction and every downgrade lands on it: it retires
+ * nothing, keeps the words where they are, and says what was ambiguous.
+ */
+export type AssessVerdict = "done" | "obsolete" | "superseded" | "merged" | "wanted" | "unclear";
+export declare const ASSESS_VERDICTS: readonly AssessVerdict[];
+/**
+ * The verdicts that must cite something.
+ *
+ * `merged` retires a row too and is deliberately NOT in this list: its evidence
+ * is the group itself — the sheet shows the new prompt in full next to all N
+ * originals — and a rationale that happens to be empty must not turn a
+ * reviewable merge into an unreviewable one. Everything else that retires a row
+ * does so on a claim about the codebase, and a claim about the codebase without
+ * a path, a line or a commit behind it is an opinion.
+ */
+export declare const CITING_VERDICTS: readonly AssessVerdict[];
+/** A merge group's floor. One id is not a merge — it is a rewrite of somebody's
+ *  sentence, which this does not offer. */
+export declare const MIN_MERGE_SIZE = 2;
+/**
+ * A merge group's ceiling.
+ *
+ * Six, because past that a "merge" stops being "these are facets of one job"
+ * and becomes a list flattened into a sentence, which is precisely how the
+ * detail in eighty-four prompts dies. Over the cap the group is dropped and its
+ * members fall back to `unclear` — they keep their own words, which is the
+ * whole trade.
+ */
+export declare const MAX_MERGE_SIZE = 6;
+/** How many groups one run may propose. A run that wants to merge half the
+ *  repo has understood the assignment as a rewrite. */
+export declare const MAX_MERGE_GROUPS = 20;
+/**
+ * How many genuinely new items one run may add.
+ *
+ * An assessment that proposes thirty new things has misunderstood the
+ * assignment, and this cap is the place that says so out loud rather than a
+ * scroll that hides it. The extras are dropped and NOTED, never clipped.
+ */
+export declare const MAX_NEW = 10;
+/** A citation is a label — a path, a line, a commit, a short sentence. Clipping
+ *  one loses nothing a person needs, and an unbounded string here is written by
+ *  a model into a row rendered on a phone. */
+export declare const MAX_EVIDENCE_CHARS = 400;
+/** Same, for a merge group's rationale, which gets a sentence rather than a
+ *  citation and so is allowed to be longer. */
+export declare const MAX_RATIONALE_CHARS = 600;
+/**
+ * A prompt is not a label: it is the thing that will RUN.
+ *
+ * So it is never truncated. Past this it is DROPPED, with a note saying which
+ * group or item went — `IntentPayload.steps`' promise ("kept in FULL, forever,
+ * un-clipped") applied one step earlier, at the point the words are proposed
+ * rather than the point they are stored.
+ */
+export declare const MAX_PROMPT_CHARS = 20000;
+/** A rank is a sort position, not a score. Out-of-range values are clamped
+ *  rather than dropped: a bad number must not cost the row its verdict. */
+export declare const MAX_RANK = 9999;
+/** How many refusal notes are kept for the sheet. A dropped group that says
+ *  nothing is indistinguishable from a group nobody proposed. */
+export declare const MAX_ASSESS_NOTES = 40;
+/** The contract with the CLI, both directions. Named here rather than in the
+ *  host because the prompt builder, the reader and the sheet all say them, and
+ *  three spellings of one path is a run that reads its own stale output. */
+export declare const ASSESS_IN_FILE: string;
+export declare const ASSESS_OUT_FILE: string;
+export declare const ASSESS_PLAN_FILE: string;
+/** A trimmed string, or "" for anything that is not one. */
+export declare const str: (v: unknown) => string;
+/** A LABEL clipped to `n` — never applied to a prompt (see `MAX_PROMPT_CHARS`). */
+export declare const clip: (s: string, n: number) => string;
+/**
+ * How many contradictions one run may name. A conflict is WORDS — it changes
+ * no row, ever — so the cap is only about a sheet staying readable.
+ */
+export declare const MAX_CONFLICTS = 10;
+/** How many rows a conflict may name. Two is the usual case; past six it is a
+ *  theme, not a contradiction a person can resolve by editing one row. */
+export declare const MAX_CONFLICT_IDS = 6;
+/** How many splits one run may propose. */
+export declare const MAX_SPLITS = 10;
+/** A split is exactly this many texts: one row that is two jobs. A three-way
+ *  split is two splits, approved one at a time. */
+export declare const SPLIT_PARTS = 2;
+/**
+ * **What a run was scoped to, beyond its ids** — absent is a plain run.
+ *
+ * `slot`: the ids are one slot (`intent/slot.ts`) — rows that fire together at
+ * one reset or instant — so the prompt can say "these fire together at X" and
+ * a `wanted` rank is the order WITHIN the slot. `key` is `Slot.key`; the host
+ * re-derives the slot with `findSlot` (tolerant: the phone may have read the
+ * reset a minute apart) and never trusts the phone's membership over its own.
+ */
+export type AssessScope = {
+    kind: "slot";
+    key: string;
+};
+/** `AssessScope` off the wire or disk: the one shape, else undefined. */
+export declare function cleanAssessScope(v: unknown): AssessScope | undefined;

package/node_modules/@waterplane/shared/dist/assess/sassvocab.js

@@ -0,0 +1,98 @@
+/** A slice of assess.ts — moved whole from assess.ts, see docs/notes/shared-architecture.md. */
+import { stateRel } from "../brand.js";
+export const ASSESS_VERDICTS = [
+    "done", "obsolete", "superseded", "merged", "wanted", "unclear",
+];
+/**
+ * The verdicts that must cite something.
+ *
+ * `merged` retires a row too and is deliberately NOT in this list: its evidence
+ * is the group itself — the sheet shows the new prompt in full next to all N
+ * originals — and a rationale that happens to be empty must not turn a
+ * reviewable merge into an unreviewable one. Everything else that retires a row
+ * does so on a claim about the codebase, and a claim about the codebase without
+ * a path, a line or a commit behind it is an opinion.
+ */
+export const CITING_VERDICTS = ["done", "obsolete", "superseded"];
+// ── The caps, and what each one is protecting ────────────────────────────────
+/** A merge group's floor. One id is not a merge — it is a rewrite of somebody's
+ *  sentence, which this does not offer. */
+export const MIN_MERGE_SIZE = 2;
+/**
+ * A merge group's ceiling.
+ *
+ * Six, because past that a "merge" stops being "these are facets of one job"
+ * and becomes a list flattened into a sentence, which is precisely how the
+ * detail in eighty-four prompts dies. Over the cap the group is dropped and its
+ * members fall back to `unclear` — they keep their own words, which is the
+ * whole trade.
+ */
+export const MAX_MERGE_SIZE = 6;
+/** How many groups one run may propose. A run that wants to merge half the
+ *  repo has understood the assignment as a rewrite. */
+export const MAX_MERGE_GROUPS = 20;
+/**
+ * How many genuinely new items one run may add.
+ *
+ * An assessment that proposes thirty new things has misunderstood the
+ * assignment, and this cap is the place that says so out loud rather than a
+ * scroll that hides it. The extras are dropped and NOTED, never clipped.
+ */
+export const MAX_NEW = 10;
+/** A citation is a label — a path, a line, a commit, a short sentence. Clipping
+ *  one loses nothing a person needs, and an unbounded string here is written by
+ *  a model into a row rendered on a phone. */
+export const MAX_EVIDENCE_CHARS = 400;
+/** Same, for a merge group's rationale, which gets a sentence rather than a
+ *  citation and so is allowed to be longer. */
+export const MAX_RATIONALE_CHARS = 600;
+/**
+ * A prompt is not a label: it is the thing that will RUN.
+ *
+ * So it is never truncated. Past this it is DROPPED, with a note saying which
+ * group or item went — `IntentPayload.steps`' promise ("kept in FULL, forever,
+ * un-clipped") applied one step earlier, at the point the words are proposed
+ * rather than the point they are stored.
+ */
+export const MAX_PROMPT_CHARS = 20_000;
+/** A rank is a sort position, not a score. Out-of-range values are clamped
+ *  rather than dropped: a bad number must not cost the row its verdict. */
+export const MAX_RANK = 9999;
+/** How many refusal notes are kept for the sheet. A dropped group that says
+ *  nothing is indistinguishable from a group nobody proposed. */
+export const MAX_ASSESS_NOTES = 40;
+/** The contract with the CLI, both directions. Named here rather than in the
+ *  host because the prompt builder, the reader and the sheet all say them, and
+ *  three spellings of one path is a run that reads its own stale output. */
+export const ASSESS_IN_FILE = stateRel("assess-in.json");
+export const ASSESS_OUT_FILE = stateRel("assess-out.json");
+export const ASSESS_PLAN_FILE = stateRel("plan.md");
+// ── Two string helpers every cleaner slice uses (not on the barrel) ──────────
+/** A trimmed string, or "" for anything that is not one. */
+export const str = (v) => (typeof v === "string" ? v.trim() : "");
+/** A LABEL clipped to `n` — never applied to a prompt (see `MAX_PROMPT_CHARS`). */
+export const clip = (s, n) => (s.length > n ? s.slice(0, n) : s);
+// ── The slot check's two proposal kinds (2026-10-16) ─────────────────────────
+/**
+ * How many contradictions one run may name. A conflict is WORDS — it changes
+ * no row, ever — so the cap is only about a sheet staying readable.
+ */
+export const MAX_CONFLICTS = 10;
+/** How many rows a conflict may name. Two is the usual case; past six it is a
+ *  theme, not a contradiction a person can resolve by editing one row. */
+export const MAX_CONFLICT_IDS = 6;
+/** How many splits one run may propose. */
+export const MAX_SPLITS = 10;
+/** A split is exactly this many texts: one row that is two jobs. A three-way
+ *  split is two splits, approved one at a time. */
+export const SPLIT_PARTS = 2;
+/** `AssessScope` off the wire or disk: the one shape, else undefined. */
+export function cleanAssessScope(v) {
+    if (!v || typeof v !== "object")
+        return undefined;
+    const r = v;
+    if (r.kind !== "slot" || typeof r.key !== "string" || !r.key.trim() || r.key.length > 200)
+        return undefined;
+    return { kind: "slot", key: r.key.trim() };
+}
+//# sourceMappingURL=sassvocab.js.map

package/node_modules/@waterplane/shared/dist/assess/sassvocab.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sassvocab.js","sourceRoot":"","sources":["../../src/assess/sassvocab.ts"],"names":[],"mappings":"AAAA,gGAAgG;AAChG,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAyBvC,MAAM,CAAC,MAAM,eAAe,GAA6B;IACvD,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS;CAChE,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,eAAe,GAA6B,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;AAE5F,gFAAgF;AAEhF;2CAC2C;AAC3C,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAEhC;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAEhC;uDACuD;AACvD,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAEnC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,EAAE,CAAC;AAE1B;;8CAE8C;AAC9C,MAAM,CAAC,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAEtC;+CAC+C;AAC/C,MAAM,CAAC,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEvC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAEvC;2EAC2E;AAC3E,MAAM,CAAC,MAAM,QAAQ,GAAG,IAAI,CAAC;AAE7B;iEACiE;AACjE,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAEnC;;4EAE4E;AAC5E,MAAM,CAAC,MAAM,cAAc,GAAG,QAAQ,CAAC,gBAAgB,CAAC,CAAC;AACzD,MAAM,CAAC,MAAM,eAAe,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;AAC3D,MAAM,CAAC,MAAM,gBAAgB,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;AAEpD,gFAAgF;AAEhF,4DAA4D;AAC5D,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACnF,mFAAmF;AACnF,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAEzF,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC;AAEhC;0EAC0E;AAC1E,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAElC,2CAA2C;AAC3C,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAC;AAE7B;mDACmD;AACnD,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAa7B,yEAAyE;AACzE,MAAM,UAAU,gBAAgB,CAAC,CAAU;IACzC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAClD,MAAM,CAAC,GAAG,CAA4B,CAAC;IACvC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG;QAAE,OAAO,SAAS,CAAC;IAC5G,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;AAC7C,CAAC"}