things-api 0.12.0 → 0.13.0

package/dist/read/project-view.d.ts

@@ -31,11 +31,48 @@ export interface ProjectHeadingGroup {
     /** This heading's repeating template rows (invisible in list views). */
     repeating: Todo[];
 }
+/**
+ * An ARCHIVED heading rendered inside the logged region (HEADARC2-A). Unlike a
+ * live {@link ProjectHeadingGroup}, an archived heading is itself a logged item,
+ * and its children — ALL of them, whatever their own state — nest beneath it as
+ * a grouped section (most-recently-completed first). That includes any odd OPEN
+ * child a GUI "Put Back" left stranded under the archived heading (HEADARC2-C):
+ * the group renders what is there, it does NOT filter to status=3.
+ */
+export interface LoggedHeadingGroup {
+    /** The archived heading (status "completed"); the wire emits its `archived`. */
+    heading: Heading;
+    /** Every child of the archived heading, most-recently-completed first. */
+    items: Todo[];
+}
 export interface ProjectView {
     project: Project;
+    /**
+     * ALL live (non-logbook, non-trash) children of the project — unheaded AND
+     * headed — in project `index` order, each headed row carrying its `heading`
+     * ref (and `headingProject`). This is the flat wire representation (the read
+     * doctrine's project-view `items[]`): membership in a heading is a per-row
+     * attribute, not a bucket. The structured buckets below (`active`, `headings`,
+     * `scheduled`, …) are the SAME children re-grouped into the GUI's render layout
+     * for the TTY projection — the library owns the clock + `todayIndex`, so the
+     * renderer reconstructs the exact GUI placement from them without re-deriving
+     * dates. The two are always consistent (built from one child fetch).
+     */
+    items: Todo[];
+    /**
+     * The full heading catalog — EVERY heading (live AND swept archived) in project
+     * `index` order (read-shape doctrine §3.12 / #C3). This is the flat wire
+     * representation of `headings[]` (`[{uuid,title,archived?}]`): which headings
+     * exist, in what order, and whether each is archived — the ORDER axis that
+     * earns the bucket its place. A live-group's row membership rides the flat
+     * `items[]` refs; a swept archived heading's children ride the flat `logbook`
+     * refs. The structured `headings` / `loggedHeadings` below re-group the SAME
+     * headings + children into the GUI render layout for the byte-stable TTY.
+     */
+    headingCatalog: Heading[];
     /** Open, unscheduled/current UNHEADED children, by index. */
     active: Todo[];
-    /** Headings in project order, each with its own sub-buckets. */
+    /** OPEN headings in project order, each with its own sub-buckets. An archived heading never renders here. */
     headings: ProjectHeadingGroup[];
     /** UNHEADED future-dated children grouped by date ascending. */
     scheduled: IsoDateGroup<Todo>[];
@@ -43,7 +80,20 @@ export interface ProjectView {
     someday: Todo[];
     /** UNHEADED repeating template rows owned by this project (invisible in list views). */
     repeating: Todo[];
+    /**
+     * The flat logged region: swept children of OPEN headings (each carrying its
+     * heading ref) plus swept un-headed children, most-recently-completed first.
+     * Children of ARCHIVED headings are NOT here — they group under their heading
+     * in {@link ProjectView.loggedHeadings}.
+     */
     logged: Todo[];
+    /**
+     * The archived-heading GROUPS of the logged region (HEADARC2-A), in project
+     * (heading `index`) order — each an archived heading with its children nested.
+     * Rendered only under `--show-logged`, after the flat {@link ProjectView.logged}
+     * rows (the flat-then-grouped ordering is a defensible choice, not GUI-probed).
+     */
+    loggedHeadings: LoggedHeadingGroup[];
     /**
      * PLOG1 (additive): count of untrashed OPEN (status=0) children this project
      * still holds while it is ITSELF completed or canceled — including once swept
@@ -54,6 +104,16 @@ export interface ProjectView {
      * child.
      */
     openChildrenWhileResolved: number;
+    /**
+     * HEADARC2-C (additive): count of untrashed OPEN (status=0) children buried
+     * under an ARCHIVED heading of this project — the heading analog of the §6¾
+     * odd state. The GUI's "Put Back" of a trashed open child restores it in place
+     * under the archived heading WITHOUT reopening the heading, leaving an open,
+     * actionable to-do invisible to every live view (reachable only by expanding
+     * this card's logged region). Counted regardless of the PROJECT's own status.
+     * 0 when no archived heading holds an open child.
+     */
+    openChildrenUnderArchivedHeading: number;
 }
 export declare class ProjectNotFoundError extends Error {
     constructor(uuid: string);

package/dist/read/project-view.js

@@ -72,30 +72,63 @@ export function projectView(db, uuid, now, filter = {}, zone) {
         todo: mapTodo(r, refs, childTags.get(r.uuid) ?? [], packedToday),
     }));
     markLogged([project, ...todos.map((t) => t.todo)], boundary);
+    // TRINARY heading split (the completion≠logged law, applied to headings): an
+    // OPEN heading — or an archived one NOT yet past the log-move boundary — stays
+    // a LIVE group IN PLACE (an archived-unswept heading carries `archived` yet
+    // renders among the live groups, exactly as a completed-unswept to-do row
+    // stays checked in place, §above / log-boundary.ts). Only a SWEPT archived
+    // heading moves into the logged region as a grouped section (HEADARC2-A).
+    const headingSwept = (h) => h.status !== "open" && h.stopped !== null && h.stopped <= boundary;
+    const liveHeadings = headings.filter((h) => !headingSwept(h));
+    const sweptHeadings = headings.filter((h) => headingSwept(h));
+    const liveHeadingSet = new Set(liveHeadings.map((h) => h.uuid));
+    const sweptHeadingSet = new Set(sweptHeadings.map((h) => h.uuid));
+    // The owning-project ref stamped on every headed child — so the heading ref a
+    // flat logged row carries promotes its `headingUuid` in the project's scope
+    // (the round-trip predicate is project-scoped), mirroring the list views.
+    const projectRef = { uuid: project.uuid, title: project.title };
     // Project-level (UNHEADED) buckets.
     const active = [];
     const scheduledRows = [];
     const repeating = [];
     const someday = [];
     const logged = [];
-    // Per-heading sub-buckets, keyed by heading uuid (§9 fidelity fix): a headed
-    // scheduled/someday/repeating child nests under its heading, NOT at the
+    // Children of a SWEPT archived heading — grouped under their heading in the
+    // logged region (keyed by heading uuid), ALL of them regardless of state.
+    const sweptHeadingChildren = new Map();
+    // Per-heading LIVE sub-buckets, keyed by heading uuid (§9 fidelity fix): a
+    // headed scheduled/someday/repeating child nests under its heading, NOT at the
     // project level.
     const headingItems = new Map();
     const headingScheduled = new Map();
     const headingSomeday = new Map();
     const headingRepeating = new Map();
-    // Known (fetched, untrashed) headings — a child whose heading FK is not one
-    // of these falls back to the project-level (unheaded) buckets rather than
-    // vanishing (mirrors the render's historical loose fallback).
-    const headingSet = new Set(headings.map((h) => h.uuid));
-    const headingUuidOf = (row) => row.heading !== null && headingSet.has(row.heading) ? row.heading : null;
+    // A child whose heading FK is not a LIVE heading (an unknown/trashed heading,
+    // OR a swept archived heading handled above) falls back to the project-level
+    // (unheaded) buckets rather than vanishing (mirrors the render's loose fallback).
+    const liveHeadingUuidOf = (row) => row.heading !== null && liveHeadingSet.has(row.heading) ? row.heading : null;
     // Every untrashed, non-template OPEN child, regardless of which bucket it
     // lands in below — surfaced (only when the project is itself resolved) as
     // the PLOG1 stranded-open-child count.
     let openChildren = 0;
+    // Open children buried under a SWEPT archived heading — the §6¾ odd state for
+    // headings (HEADARC2-C), surfaced regardless of the project's own status.
+    let openChildrenUnderArchivedHeading = 0;
     for (const { row, todo } of todos) {
-        const h = headingUuidOf(row);
+        if (todo.heading !== null)
+            todo.headingProject = projectRef;
+        // A child of a SWEPT archived heading groups under it in the logged region,
+        // WHATEVER its own state — including the odd OPEN child a GUI Put-Back
+        // stranded (HEADARC2-C): render what is there, do NOT filter to status=3.
+        if (row.heading !== null && sweptHeadingSet.has(row.heading)) {
+            pushInto(sweptHeadingChildren, row.heading, todo);
+            if (row.status === 0 && !todo.repeating.isTemplate) {
+                openChildren += 1; // also stranded when the project itself is resolved
+                openChildrenUnderArchivedHeading += 1;
+            }
+            continue;
+        }
+        const h = liveHeadingUuidOf(row);
         if (todo.repeating.isTemplate) {
             if (h !== null)
                 pushInto(headingRepeating, h, todo);
@@ -151,7 +184,7 @@ export function projectView(db, uuid, now, filter = {}, zone) {
     // section; a heading with any surviving child (in ANY sub-bucket) is kept.
     // With no scope active every heading renders (its own empty state).
     const contentScoped = overdue || tf.sql !== "";
-    const headingGroups = headings
+    const headingGroups = liveHeadings
         .map((heading) => ({
         heading,
         items: headingItems.get(heading.uuid) ?? [],
@@ -164,15 +197,47 @@ export function projectView(db, uuid, now, filter = {}, zone) {
         g.scheduled.length > 0 ||
         g.someday.length > 0 ||
         g.repeating.length > 0);
+    // The logged-region archived-heading groups, in project (heading index) order;
+    // each group's children most-recently-completed first (open odd children, with
+    // no stopDate, sort last — the same null-last convention the flat logged list
+    // uses). Under a content scope (--overdue / --tag) an empty group collapses.
+    const loggedHeadings = sweptHeadings
+        .map((heading) => ({
+        heading,
+        items: (sweptHeadingChildren.get(heading.uuid) ?? []).toSorted((a, b) => (b.stopped?.getTime() ?? 0) - (a.stopped?.getTime() ?? 0)),
+    }))
+        .filter((g) => !contentScoped || g.items.length > 0);
+    // The flat wire `items[]`: every LIVE child in project index order (the
+    // `todos` fetch is already `ORDER BY index ASC`). Excludes swept logged rows
+    // (→ `logged`) and children of swept archived headings (→ `loggedHeadings`) —
+    // exactly the rows that leave the live region. Each headed row already carries
+    // its `heading` ref + `headingProject` (stamped in the loop above).
+    const items = todos
+        .map((t) => t.todo)
+        .filter((td) => !td.logged && !(td.heading !== null && sweptHeadingSet.has(td.heading.uuid)));
+    // The catalog: every heading (live + swept archived) in index order — but under
+    // a content scope (`--overdue` / `--tag`) a heading whose children were all
+    // filtered out COLLAPSES, exactly as it does for the live groups + logged groups
+    // and the TTY. With no scope every heading survives (empty ones included), so
+    // this is a no-op there. Built from the SAME survivors the render layout uses.
+    const survivingHeadings = new Set([
+        ...headingGroups.map((g) => g.heading.uuid),
+        ...loggedHeadings.map((g) => g.heading.uuid),
+    ]);
+    const headingCatalog = headings.filter((h) => survivingHeadings.has(h.uuid));
     return {
         project,
+        items,
+        headingCatalog,
         active,
         headings: headingGroups,
         scheduled,
         someday,
         repeating,
         logged,
+        loggedHeadings,
         openChildrenWhileResolved: project.status === "open" ? 0 : openChildren,
+        openChildrenUnderArchivedHeading,
     };
 }
 //# sourceMappingURL=project-view.js.map

package/dist/read/project-view.js.map

@@ -1 +1 @@
-{"version":3,"file":"project-view.js","sourceRoot":"","sources":["../../src/read/project-view.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAEnF,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO,EAAgB,MAAM,qBAAqB,CAAC;AACpF,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAClG,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAmB,MAAM,YAAY,CAAC;AA+CxD,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,IAAY;QACtB,KAAK,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;IACrC,CAAC;CACF;AAKD,qEAAqE;AACrE,SAAS,QAAQ,CAAI,GAAqB,EAAE,GAAW,EAAE,KAAQ;IAC/D,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAChC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACrB,CAAC;AAED,uFAAuF;AACvF,SAAS,WAAW,CAAC,IAAoB;IACvC,MAAM,GAAG,GAAyB,EAAE,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC,QAAQ,CACxC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CACtD,EAAE,CAAC;QACF,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACjD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,EAAgB,EAChB,IAAY,EACZ,GAAU,EACV,SAAqB,EAAE,EACvB,IAAa;IAEb,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,KAAK,IAAI,CAAC;IACxC,MAAM,UAAU,GAAG,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC7C,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAE/E,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IACjC,2EAA2E;IAC3E,2DAA2D;IAC3D,MAAM,WAAW,GAAG,gBAAgB,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,CAAC,IAAe,EAAE,EAAE,CACjC,iBAAiB,CACf,EAAE,EACF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACxB,CAAC;IACJ,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,WAAW,CAAC,CAAC;IAClG,gFAAgF;IAChF,OAAO,CAAC,aAAa,GAAG,gBAAgB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAEzD,MAAM,WAAW,GAAG,aAAa,CAC/B,EAAE,EACF,uEAAuE,EACvE,CAAC,IAAI,CAAC,CACP,CAAC;IACF,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAE7D,4EAA4E;IAC5E,uEAAuE;IACvE,yEAAyE;IACzE,wEAAwE;IACxE,mEAAmE;IACnE,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,QAAQ,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACpD,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9E,8EAA8E;IAC9E,6EAA6E;IAC7E,0EAA0E;IAC1E,8EAA8E;IAC9E,8EAA8E;IAC9E,4EAA4E;IAC5E,6EAA6E;IAC7E,oBAAoB;IACpB,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,aAAa,CAC7B,EAAE,EACF;;SAEK,EAAE,CAAC,GAAG,GAAG,UAAU;4BACA,EACxB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,YAAY,CAAC,CAC3C,CAAC;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,WAAW,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClC,GAAG,EAAE,CAAC;QACN,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,WAAW,CAAC;KACjE,CAAC,CAAC,CAAC;IACJ,UAAU,CAAC,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAE7D,oCAAoC;IACpC,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,MAAM,aAAa,GAAmB,EAAE,CAAC;IACzC,MAAM,SAAS,GAAW,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAW,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,6EAA6E;IAC7E,wEAAwE;IACxE,iBAAiB;IACjB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC3D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,4EAA4E;IAC5E,0EAA0E;IAC1E,8DAA8D;IAC9D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,MAAM,aAAa,GAAG,CAAC,GAAY,EAAiB,EAAE,CACpD,GAAG,CAAC,OAAO,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3E,0EAA0E;IAC1E,0EAA0E;IAC1E,uCAAuC;IACvC,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,gBAAgB,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;gBAC/C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;QACxC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,+DAA+D;YAC/D,mEAAmE;YACnE,mEAAmE;YACnE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;gBAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,KAAK,KAAK,CAAC,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;gBAC7C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,CAAC,SAAS,GAAG,WAAW,EAAE,CAAC;YAC1D,MAAM,EAAE,GAAiB;gBACvB,IAAI,EAAE,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE;gBAC3C,EAAE,EAAE,GAAG,CAAC,UAAU,IAAI,CAAC;gBACvB,IAAI;aACL,CAAC;YACF,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;;gBAC7C,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,IAAI;YAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;YAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACjF,qEAAqE;IACrE,MAAM,SAAS,GAAG,WAAW,CAAC,aAAa,CAAC,CAAC;IAE7C,yEAAyE;IACzE,0EAA0E;IAC1E,2EAA2E;IAC3E,oEAAoE;IACpE,MAAM,aAAa,GAAG,OAAO,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;IAC/C,MAAM,aAAa,GAA0B,QAAQ;SAClD,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACjB,OAAO;QACP,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;QAC3C,SAAS,EAAE,WAAW,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO,EAAE,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;QAC/C,SAAS,EAAE,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;KACpD,CAAC,CAAC;SACF,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,aAAa;QACd,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QAClB,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;QACtB,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QACpB,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CACzB,CAAC;IAEJ,OAAO;QACL,OAAO;QACP,MAAM;QACN,QAAQ,EAAE,aAAa;QACvB,SAAS;QACT,OAAO;QACP,SAAS;QACT,MAAM;QACN,yBAAyB,EAAE,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;KACxE,CAAC;AACJ,CAAC"}
+{"version":3,"file":"project-view.js","sourceRoot":"","sources":["../../src/read/project-view.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAEnF,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,OAAO,EAAgB,MAAM,qBAAqB,CAAC;AACpF,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAClG,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,EAAE,OAAO,EAAE,MAAM,iBAAiB,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAmB,MAAM,YAAY,CAAC;AA4GxD,MAAM,OAAO,oBAAqB,SAAQ,KAAK;IAC7C,YAAY,IAAY;QACtB,KAAK,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,sBAAsB,CAAC;IACrC,CAAC;CACF;AAKD,qEAAqE;AACrE,SAAS,QAAQ,CAAI,GAAqB,EAAE,GAAW,EAAE,KAAQ;IAC/D,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAChC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACrB,CAAC;AAED,uFAAuF;AACvF,SAAS,WAAW,CAAC,IAAoB;IACvC,MAAM,GAAG,GAAyB,EAAE,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC,QAAQ,CACxC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CACtD,EAAE,CAAC;QACF,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACjD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,EAAgB,EAChB,IAAY,EACZ,GAAU,EACV,SAAqB,EAAE,EACvB,IAAa;IAEb,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,KAAK,IAAI,CAAC;IACxC,MAAM,UAAU,GAAG,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC7C,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;QAAE,MAAM,IAAI,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAE/E,MAAM,IAAI,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;IACjC,2EAA2E;IAC3E,2DAA2D;IAC3D,MAAM,WAAW,GAAG,gBAAgB,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,CAAC,IAAe,EAAE,EAAE,CACjC,iBAAiB,CACf,EAAE,EACF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACxB,CAAC;IACJ,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,WAAW,CAAC,CAAC;IAClG,gFAAgF;IAChF,OAAO,CAAC,aAAa,GAAG,gBAAgB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAEzD,MAAM,WAAW,GAAG,aAAa,CAC/B,EAAE,EACF,uEAAuE,EACvE,CAAC,IAAI,CAAC,CACP,CAAC;IACF,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAE7D,4EAA4E;IAC5E,uEAAuE;IACvE,yEAAyE;IACzE,wEAAwE;IACxE,mEAAmE;IACnE,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,QAAQ,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACpD,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9E,8EAA8E;IAC9E,6EAA6E;IAC7E,0EAA0E;IAC1E,8EAA8E;IAC9E,8EAA8E;IAC9E,4EAA4E;IAC5E,6EAA6E;IAC7E,oBAAoB;IACpB,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,aAAa,CAC7B,EAAE,EACF;;SAEK,EAAE,CAAC,GAAG,GAAG,UAAU;4BACA,EACxB,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,GAAG,YAAY,CAAC,CAC3C,CAAC;IACF,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,WAAW,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClC,GAAG,EAAE,CAAC;QACN,IAAI,EAAE,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,WAAW,CAAC;KACjE,CAAC,CAAC,CAAC;IACJ,UAAU,CAAC,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAE7D,6EAA6E;IAC7E,+EAA+E;IAC/E,4EAA4E;IAC5E,0EAA0E;IAC1E,2EAA2E;IAC3E,0EAA0E;IAC1E,MAAM,YAAY,GAAG,CAAC,CAAU,EAAW,EAAE,CAC3C,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC,OAAO,IAAI,QAAQ,CAAC;IACrE,MAAM,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAChE,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAElE,8EAA8E;IAC9E,4EAA4E;IAC5E,0EAA0E;IAC1E,MAAM,UAAU,GAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;IAErE,oCAAoC;IACpC,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,MAAM,aAAa,GAAmB,EAAE,CAAC;IACzC,MAAM,SAAS,GAAW,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAW,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,4EAA4E;IAC5E,0EAA0E;IAC1E,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvD,2EAA2E;IAC3E,+EAA+E;IAC/E,iBAAiB;IACjB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC3D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,8EAA8E;IAC9E,6EAA6E;IAC7E,kFAAkF;IAClF,MAAM,iBAAiB,GAAG,CAAC,GAAY,EAAiB,EAAE,CACxD,GAAG,CAAC,OAAO,KAAK,IAAI,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/E,0EAA0E;IAC1E,0EAA0E;IAC1E,uCAAuC;IACvC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,8EAA8E;IAC9E,0EAA0E;IAC1E,IAAI,gCAAgC,GAAG,CAAC,CAAC;IAEzC,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;YAAE,IAAI,CAAC,cAAc,GAAG,UAAU,CAAC;QAC5D,4EAA4E;QAC5E,uEAAuE;QACvE,0EAA0E;QAC1E,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7D,QAAQ,CAAC,oBAAoB,EAAE,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAClD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;gBACnD,YAAY,IAAI,CAAC,CAAC,CAAC,oDAAoD;gBACvE,gCAAgC,IAAI,CAAC,CAAC;YACxC,CAAC;YACD,SAAS;QACX,CAAC;QACD,MAAM,CAAC,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,gBAAgB,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;gBAC/C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;QACxC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,+DAA+D;YAC/D,mEAAmE;YACnE,mEAAmE;YACnE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;gBAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,KAAK,KAAK,CAAC,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,cAAc,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;gBAC7C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,CAAC,SAAS,GAAG,WAAW,EAAE,CAAC;YAC1D,MAAM,EAAE,GAAiB;gBACvB,IAAI,EAAE,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE;gBAC3C,EAAE,EAAE,GAAG,CAAC,UAAU,IAAI,CAAC;gBACvB,IAAI;aACL,CAAC;YACF,IAAI,CAAC,KAAK,IAAI;gBAAE,QAAQ,CAAC,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;;gBAC7C,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,IAAI;YAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;;YAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACjF,qEAAqE;IACrE,MAAM,SAAS,GAAG,WAAW,CAAC,aAAa,CAAC,CAAC;IAE7C,yEAAyE;IACzE,0EAA0E;IAC1E,2EAA2E;IAC3E,oEAAoE;IACpE,MAAM,aAAa,GAAG,OAAO,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC;IAC/C,MAAM,aAAa,GAA0B,YAAY;SACtD,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACjB,OAAO;QACP,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;QAC3C,SAAS,EAAE,WAAW,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAChE,OAAO,EAAE,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;QAC/C,SAAS,EAAE,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE;KACpD,CAAC,CAAC;SACF,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,aAAa;QACd,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;QAClB,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;QACtB,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QACpB,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CACzB,CAAC;IAEJ,+EAA+E;IAC/E,+EAA+E;IAC/E,8EAA8E;IAC9E,6EAA6E;IAC7E,MAAM,cAAc,GAAyB,aAAa;SACvD,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACjB,OAAO;QACP,KAAK,EAAE,CAAC,oBAAoB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAC5D,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CACpE;KACF,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEvD,wEAAwE;IACxE,6EAA6E;IAC7E,8EAA8E;IAC9E,+EAA+E;IAC/E,oEAAoE;IACpE,MAAM,KAAK,GAAG,KAAK;SAChB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAClB,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,OAAO,KAAK,IAAI,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEhG,gFAAgF;IAChF,4EAA4E;IAC5E,iFAAiF;IACjF,8EAA8E;IAC9E,+EAA+E;IAC/E,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC;QAChC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QAC3C,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;KAC7C,CAAC,CAAC;IACH,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAE7E,OAAO;QACL,OAAO;QACP,KAAK;QACL,cAAc;QACd,MAAM;QACN,QAAQ,EAAE,aAAa;QACvB,SAAS;QACT,OAAO;QACP,SAAS;QACT,MAAM;QACN,cAAc;QACd,yBAAyB,EAAE,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;QACvE,gCAAgC;KACjC,CAAC;AACJ,CAAC"}

package/dist/read/queries.d.ts

@@ -5,7 +5,7 @@
 import type { DatabaseSync } from "node:sqlite";
 import { type Ref } from "../model/entities.ts";
 import type { ChecklistRow, TaskRow } from "../model/mappers.ts";
-import { type CandidateRef } from "./shape.ts";
+import { type CandidateRef, type RefKind, type RefPromoter } from "./shape.ts";
 /** Rows that repeat via a template are normal; template rows are invisible in list views. */
 export declare const NOT_TEMPLATE = "(t.rt1_recurrenceRule IS NULL AND t.repeater IS NULL)";
 /**
@@ -129,6 +129,9 @@ export declare function resolveTaskUuidPrefix(db: DatabaseSync, refRaw: string,
  * docs/design/reference-resolution.md.
  */
 export declare function normalizeNameKey(s: string): string;
+/** The fused TTY ref form `Title [8charPrefix]` — the round-trippable decorated ref every candidate renders. */
+export declare const REF_PREFIX_LEN = 8;
+export declare function fusedRef(title: string, uuid: string): string;
 export interface NamedResolution {
     resolved: {
         uuid: string;
@@ -206,10 +209,49 @@ export declare function resolveProjectWriteTarget(db: DatabaseSync, refRaw: stri
     };
 }, includeTrashed?: boolean, includeNonOpen?: boolean): string;
 export declare function resolveTagUuid(db: DatabaseSync, ref: string): string;
+/** Options shared by the read-side project resolvers (a name-tier narrowing subset). */
+interface ReadProjectOptions {
+    prefixTier?: boolean;
+    scopeWhere?: string;
+    scopeBinds?: (string | number)[];
+}
+/**
+ * A read-side PROJECT NAME resolution verdict under the liveness law (never
+ * throws) — the shared core behind the throwing {@link resolveProjectUuid}
+ * (`project show`) and the cross-kind {@link classifyShowTarget} router.
+ *
+ * The uuid / partial-uuid tiers reach EVERY project row (explicit intent stays
+ * able to view a trashed project by id); the NAME tiers resolve against LIVE
+ * (untrashed) rows only, so a dead twin never shadows a live one nor inflates
+ * an ambiguity count. When the live pool is empty, the TRASHED pool is consulted
+ * for the reads-only ergonomic fallback: a UNIQUELY-named trashed project still
+ * resolves by name (the render discloses it — the card's own `(trashed)` marker
+ * / `stage: "trash"`), while several dead twins report honestly instead.
+ */
+export interface ReadProjectVerdict {
+    /** The resolved winner — a live unique, a uuid/partial-uuid, or the unique-dead fallback; else null. */
+    resolved: {
+        uuid: string;
+        title: string;
+    } | null;
+    /** ALL live name-matching rows at the deciding tier (0, 1, or many). */
+    liveRows: {
+        uuid: string;
+        title: string;
+    }[];
+    /** 0 / 1 / >1 — the LIVE match count (the ambiguity count when > 1). */
+    liveMatches: number;
+    /** Count of TRASHED-name twins — feeds the disclosure tail / dead-hint. */
+    trashedMatches: number;
+}
+export declare function readProjectNameVerdict(db: DatabaseSync, ref: string, options?: ReadProjectOptions): ReadProjectVerdict;
 /**
  * Write destinations stay strict (a trashed project is not a valid target);
  * READ surfaces pass `trashed: true` so a project in the Trash can still be
- * viewed — its would-be-recovered children are only visible there.
+ * viewed. Under `trashed: true` the read-side liveness law applies: an explicit
+ * uuid / partial-uuid reaches any project, but a NAME resolves against LIVE rows
+ * only (a dead same-name twin never shadows a live one), with the reads-only
+ * unique-dead fallback + trash disclosure ({@link readProjectNameVerdict}).
  */
 export declare function resolveProjectUuid(db: DatabaseSync, ref: string, options?: {
     trashed?: boolean;
@@ -217,6 +259,14 @@ export declare function resolveProjectUuid(db: DatabaseSync, ref: string, option
     scopeWhere?: string;
     scopeBinds?: (string | number)[];
 }): string;
+/**
+ * The disclosure tail appended to a read-side project ambiguity when the
+ * uuid-reachable pool holds additional TRASHED twins of the ambiguous name. The
+ * ambiguity COUNT stays over live rows (coherent with the rendered candidate
+ * list); the dead ones are disclosed separately rather than inflating it. Empty
+ * when none are trashed.
+ */
+export declare function trashDisclosureTail(deadCount: number): string;
 export declare function resolveAreaUuid(db: DatabaseSync, ref: string, options?: {
     prefixTier?: boolean;
     scopeWhere?: string;
@@ -245,6 +295,24 @@ export declare function resolveHeadingUuid(db: DatabaseSync, projectUuid: string
     uuid: string;
     title: string;
 };
+/**
+ * Does a container ref's bare TITLE round-trip through its own resolver, in its
+ * own scope, back to THIS entity's uuid? The single predicate the emit boundary
+ * consults for the JSON round-trip law — true only when the sole resolution is
+ * `entityUuid` (not-found / ambiguous / a different entity all → false, i.e. the
+ * title must promote its uuid sibling). See {@link resolveTitleForRoundTrip}.
+ */
+export declare function titleRoundTrips(db: DatabaseSync, kind: RefKind, title: string, entityUuid: string, projectUuid?: string): boolean;
+/**
+ * Build the {@link RefPromoter} the read-shaping transform ({@link shapeReadPayload})
+ * consults to decide flat-ref uuid promotion, memoized per (kind, title, scope)
+ * for ONE response emission so a large view never re-runs a resolution it has
+ * already made. A fresh promoter (fresh memo) per response — the consumer
+ * surfaces build one via the client. The memo caches the RESOLVED uuid (or null),
+ * independent of the comparison target, so twin entities sharing a title share
+ * the one resolution.
+ */
+export declare function makeRefPromoter(db: DatabaseSync): RefPromoter;
 /**
  * A row's EFFECTIVE area: its own `area` link, else the area of its project,
  * else the area of its heading's project. To-dos nested in a project (or under a
@@ -323,3 +391,4 @@ export declare function fetchTagsForTasks(db: DatabaseSync, taskUuids: string[])
 export declare function makeHeadingProjectResolver(db: DatabaseSync): (headingUuid: string) => Ref | null;
 /** Lazy uuid -> Ref resolver over TMTask + TMArea titles, cached per instance. */
 export declare function makeRefResolver(db: DatabaseSync): (uuid: string | null) => Ref | null;
+export {};

package/dist/read/queries.js

@@ -1,6 +1,6 @@
 import { q, selectList } from "../db/schema.js";
 import { TASK_TYPE_FROM_DB } from "../model/entities.js";
-import { candidateRef, CANDIDATE_CAP } from "./shape.js";
+import { candidateRef, CANDIDATE_CAP, } from "./shape.js";
 /** Rows that repeat via a template are normal; template rows are invisible in list views. */
 export const NOT_TEMPLATE = "(t.rt1_recurrenceRule IS NULL AND t.repeater IS NULL)";
 /** ` AND col IN (…)` for the restricted form; empty for the tag-agnostic form. */
@@ -234,6 +234,27 @@ export function normalizeNameKey(s) {
         .replace(/[\s‐-―−-]+/gu, "");
 }
 const BASE62 = /^[0-9A-Za-z]+$/;
+/**
+ * The DECORATED-REF form `Title [ref]` — a bare title with the machine-stable
+ * uuid/partial-uuid pinned in trailing brackets (the fused form every TTY
+ * candidate renders, `Title [8charPrefix]`). The title half is a COMMENT
+ * (ignored), so a stale copy still resolves after a rename; the bracket is the
+ * ref, resolved through the uuid/partial-uuid tier. Greedy `.*` so the LAST
+ * bracket wins (`"Family [Sub] [TC9yozLk]"` → `TC9yozLk`). The empty-title form
+ * `" [J2kPq9Ws]"` (a titleless heading) is legal — `(.*)` matches empty. Because
+ * `$`-anchored so the LAST bracket always wins. The space before `[` is OPTIONAL
+ * because {@link stripThingsUri} trims the ref first, so the empty-title form
+ * `" [J2kPq9Ws]"` (a titleless heading) arrives as the bare `[J2kPq9Ws]` — both
+ * resolve. The bracket is 4–22 base62 chars; a segment shorter than the 6-char
+ * partial-uuid floor simply fails to resolve (the FORM is recognized, the
+ * resolution is the real uuid/partial-uuid tier's).
+ */
+const DECORATED_REF = /^(.*?) ?\[([0-9A-Za-z]{4,22})\]$/;
+/** The fused TTY ref form `Title [8charPrefix]` — the round-trippable decorated ref every candidate renders. */
+export const REF_PREFIX_LEN = 8;
+export function fusedRef(title, uuid) {
+    return `${title} [${uuid.slice(0, REF_PREFIX_LEN)}]`;
+}
 /**
  * Tiered reference resolution (docs/design/reference-resolution.md): exact
  * uuid → exact title → case-insensitive title → normalized title → uuid
@@ -287,12 +308,42 @@ export function resolveNamedRef(db, table, extraWhere, extraBinds, refRaw, optio
         if (rows.length > 1)
             return { resolved: null, matches: rows.length, candidates: rows };
     }
+    // The DECORATED-REF tier — LAST, after exact/case/normalized title and the
+    // uuid/partial-uuid tiers all miss. `Title [ref]`: the title is ignored and the
+    // bracketed segment resolves through the uuid/partial-uuid tier (uuid-exact,
+    // then a >=6-char partial-uuid prefix). Runs regardless of `prefixTier` — the
+    // bracket is EXPLICIT ref intent (a rendered fused ref), like a bare uuid. A
+    // literal title `Title [ref]` outranks this by construction (exact-title is an
+    // earlier tier). Scope/extraWhere apply (uuid-tier `sel`, not the name tiers).
+    const decorated = DECORATED_REF.exec(ref);
+    if (decorated !== null) {
+        const inner = decorated[2] ?? "";
+        const exactRows = sel("uuid = ?", [inner]);
+        if (exactRows.length === 1)
+            return { resolved: exactRows[0] ?? null, matches: 1 };
+        if (inner.length >= 6) {
+            const upper = inner.slice(0, -1) + String.fromCharCode(inner.charCodeAt(inner.length - 1) + 1);
+            const rows = sel("uuid >= ? AND uuid < ?", [inner, upper]);
+            if (rows.length === 1)
+                return { resolved: rows[0] ?? null, matches: 1 };
+            if (rows.length > 1)
+                return { resolved: null, matches: rows.length, candidates: rows };
+        }
+    }
     return { resolved: null, matches: 0 };
 }
 /** The accepted-forms clause for a name-accepting resolver's not-found copy. */
 function acceptedForms(prefixTier) {
     return prefixTier ? "tried uuid, partial-uuid, and name" : "tried uuid and name";
 }
+/**
+ * The single-kind ambiguous-name refusal copy shared by the read resolvers
+ * (`"X" matches N projects — use the exact name or a uuid`). `kind` is the
+ * singular noun; the plural `s` is appended here so the count agrees.
+ */
+function ambiguousNameMessage(ref, count, kind, capped) {
+    return `"${ref}" matches ${count} ${kind}s${capped ? `; first ${CANDIDATE_CAP} shown` : ""} — use the exact name or a uuid`;
+}
 function resolveUuidOrThrow(db, table, extraWhere, ref, kind, listCmd, options) {
     const r = resolveNamedRef(db, table, extraWhere, [], ref, options);
     if (r.resolved !== null)
@@ -301,8 +352,7 @@ function resolveUuidOrThrow(db, table, extraWhere, ref, kind, listCmd, options)
         throw new ReferenceResolutionError(`no ${kind} matching "${ref}" — ${acceptedForms(options?.prefixTier !== false)} (list ${kind}s with \`${listCmd}\`)`, { code: "not-found", ref });
     }
     const all = r.candidates ?? [];
-    const capped = all.length > CANDIDATE_CAP;
-    throw new ReferenceResolutionError(`"${ref}" matches ${r.matches} ${kind}s${capped ? `; first ${CANDIDATE_CAP} shown` : ""} — use the exact name or a uuid`, {
+    throw new ReferenceResolutionError(ambiguousNameMessage(ref, r.matches, kind, all.length > CANDIDATE_CAP), {
         code: "ambiguous",
         ref,
         candidates: all.slice(0, CANDIDATE_CAP).map((c) => candidateRef(kind, c)),
@@ -402,11 +452,13 @@ export function resolveProjectWriteTarget(db, refRaw, scope, includeTrashed = fa
     }
     const all = describeProjectCandidates(db, r.candidates ?? []);
     const shown = all.slice(0, CANDIDATE_CAP);
+    // The fused ref form `Title [8charPrefix]` — the bracketed prefix pastes back
+    // as a decorated ref that resolves straight to this project.
     const lines = shown
-        .map((c) => `  ${c.uuid.slice(0, 8)} — ${c.title}${c.area !== undefined ? ` (in ${c.area})` : ""}`)
+        .map((c) => `  ${fusedRef(c.title, c.uuid)}${c.area !== undefined ? ` (in ${c.area})` : ""}`)
         .join("\n");
     const more = all.length > CANDIDATE_CAP ? `\n  … ${all.length - CANDIDATE_CAP} more` : "";
-    throw new ReferenceResolutionError(`"${ref}" matches ${r.matches} projects — disambiguate with a uuid or partial-uuid:\n${lines}${more}`, { code: "ambiguous", ref, candidates: shown });
+    throw new ReferenceResolutionError(`"${ref}" matches ${r.matches} projects — disambiguate with a ref below:\n${lines}${more}`, { code: "ambiguous", ref, candidates: shown });
 }
 /** Fixed-shape candidates for an ambiguous project name, each with its area container hint. */
 function describeProjectCandidates(db, candidates) {
@@ -419,13 +471,82 @@ function describeProjectCandidates(db, candidates) {
 export function resolveTagUuid(db, ref) {
     return resolveUuidOrThrow(db, "TMTag", "1=1", ref, "tag", "things tags");
 }
+/** Count (and, when unique, resolve) a NAME against the TRASHED project pool only. */
+function trashedProjectNameMatches(db, ref, options) {
+    return resolveNamedRef(db, "TMTask", "type = 1 AND trashed = 1", [], ref, {
+        prefixTier: false,
+        ...(options?.scopeWhere !== undefined && {
+            scopeWhere: options.scopeWhere,
+            scopeBinds: options.scopeBinds,
+        }),
+    });
+}
+export function readProjectNameVerdict(db, ref, options) {
+    // uuid/partial-uuid tiers span every project (`type = 1`); name tiers narrow
+    // to LIVE rows via `nameExtraWhere` — the same split the write side uses.
+    const live = resolveNamedRef(db, "TMTask", "type = 1", [], ref, {
+        ...options,
+        nameExtraWhere: "trashed = 0",
+    });
+    if (live.resolved !== null)
+        return {
+            resolved: live.resolved,
+            liveRows: [live.resolved],
+            liveMatches: 1,
+            trashedMatches: 0,
+        };
+    if (live.matches > 1)
+        return {
+            resolved: null,
+            liveRows: live.candidates ?? [],
+            liveMatches: live.matches,
+            // Disclose extra trashed twins WITHOUT folding them into the count.
+            trashedMatches: trashedProjectNameMatches(db, ref, options).matches,
+        };
+    // Zero live name/uuid matches: the trashed pool decides the ergonomic fallback.
+    const dead = trashedProjectNameMatches(db, ref, options);
+    if (dead.resolved !== null)
+        return { resolved: dead.resolved, liveRows: [], liveMatches: 0, trashedMatches: dead.matches };
+    return { resolved: null, liveRows: [], liveMatches: 0, trashedMatches: dead.matches };
+}
 /**
  * Write destinations stay strict (a trashed project is not a valid target);
  * READ surfaces pass `trashed: true` so a project in the Trash can still be
- * viewed — its would-be-recovered children are only visible there.
+ * viewed. Under `trashed: true` the read-side liveness law applies: an explicit
+ * uuid / partial-uuid reaches any project, but a NAME resolves against LIVE rows
+ * only (a dead same-name twin never shadows a live one), with the reads-only
+ * unique-dead fallback + trash disclosure ({@link readProjectNameVerdict}).
  */
 export function resolveProjectUuid(db, ref, options) {
-    return resolveUuidOrThrow(db, "TMTask", options?.trashed === true ? "type = 1" : "type = 1 AND trashed = 0", ref, "project", "things projects", options);
+    if (options?.trashed !== true) {
+        // The non-widening read pool: name AND uuid tiers are LIVE-only (a trashed
+        // project is invisible even by uuid here) — the filter/scope/write-target
+        // callers, unchanged.
+        return resolveUuidOrThrow(db, "TMTask", "type = 1 AND trashed = 0", ref, "project", "things projects", options);
+    }
+    const v = readProjectNameVerdict(db, ref, options);
+    if (v.resolved !== null)
+        return v.resolved.uuid;
+    if (v.liveMatches > 1) {
+        const shown = v.liveRows.slice(0, CANDIDATE_CAP);
+        throw new ReferenceResolutionError(ambiguousNameMessage(ref, v.liveMatches, "project", v.liveRows.length > CANDIDATE_CAP) +
+            trashDisclosureTail(v.trashedMatches), { code: "ambiguous", ref, candidates: shown.map((c) => candidateRef("project", c)) });
+    }
+    // Zero live matches (a unique dead row would have resolved above), so a
+    // non-empty trash count here is always the several-dead-twins case.
+    throw new ReferenceResolutionError(`no project matching "${ref}" — ${acceptedForms(options.prefixTier !== false)} (list projects with \`things projects\`)${deadNameMatchHint({ trashed: v.trashedMatches })}`, { code: "not-found", ref });
+}
+/**
+ * The disclosure tail appended to a read-side project ambiguity when the
+ * uuid-reachable pool holds additional TRASHED twins of the ambiguous name. The
+ * ambiguity COUNT stays over live rows (coherent with the rendered candidate
+ * list); the dead ones are disclosed separately rather than inflating it. Empty
+ * when none are trashed.
+ */
+export function trashDisclosureTail(deadCount) {
+    return deadCount === 0
+        ? ""
+        : `; also matched: ${deadCount} in the trash — \`things trash\` lists them, a uuid reaches one directly`;
 }
 export function resolveAreaUuid(db, ref, options) {
     return resolveUuidOrThrow(db, "TMArea", "1=1", ref, "area", "things areas", options);
@@ -464,13 +585,81 @@ export function resolveHeadingUuid(db, projectUuid, refRaw) {
         throw new ReferenceResolutionError(`no heading matching ${label} in this project — a heading selector is an exact title or a uuid (list them with \`things project-view <project>\`)`, { code: "not-found", ref: refRaw });
     }
     const all = r.candidates ?? [];
-    const capped = all.length > CANDIDATE_CAP;
-    throw new ReferenceResolutionError(`${label} matches ${r.matches} headings in this project${capped ? `; first ${CANDIDATE_CAP} shown` : ""} — disambiguate with a uuid`, {
+    const shown = all.slice(0, CANDIDATE_CAP);
+    // The fused ref form `Title [8charPrefix]` per candidate — a titleless heading
+    // reads ` [prefix]`, which pastes back as its decorated ref.
+    const lines = shown.map((c) => `  ${fusedRef(c.title, c.uuid)}`).join("\n");
+    const more = all.length > CANDIDATE_CAP ? `\n  … ${all.length - CANDIDATE_CAP} more` : "";
+    throw new ReferenceResolutionError(`${label} matches ${r.matches} headings in this project — disambiguate with a ref below:\n${lines}${more}`, {
         code: "ambiguous",
         ref: refRaw,
-        candidates: all.slice(0, CANDIDATE_CAP).map((c) => candidateRef("heading", c)),
+        candidates: shown.map((c) => candidateRef("heading", c)),
     });
 }
+/**
+ * Resolve a container ref's bare TITLE through the REAL resolver for its kind,
+ * returning the sole resolved uuid or null (not-found OR ambiguous → null). This
+ * is the emit-side promotion judgment behind the JSON round-trip law (the flat
+ * `area`/`project`/`heading` refs promote a `*Uuid` sibling exactly when their
+ * bare title would NOT round-trip): it is the RESOLVER'S OWN judgment, not a
+ * re-derived uniqueness query, so it inherits every quirk of the write path —
+ * notably projects resolve through {@link resolveProjectWriteTarget} (the
+ * uuid-prefix tier runs FIRST, over the live+open write-target pool, so a title
+ * that is a valid unique uuid-prefix of ANOTHER task resolves to that task, not
+ * this project → does not round-trip → promotes; logged/trashed/completed
+ * same-titled twins never resolve by name, so they never trigger promotion).
+ * Areas resolve over all areas ({@link resolveAreaUuid}); headings within their
+ * project ({@link resolveHeadingRef}, `type = 2 AND trashed = 0 AND project = ?`).
+ * A thrown {@link ReferenceResolutionError} (not-found / ambiguous) is caught and
+ * read as "did not resolve" → null.
+ */
+function resolveTitleForRoundTrip(db, kind, title, projectUuid) {
+    try {
+        if (kind === "area")
+            return resolveAreaUuid(db, title);
+        if (kind === "project")
+            return resolveProjectWriteTarget(db, title);
+        if (projectUuid === undefined)
+            return null; // heading round-trip needs its project scope
+        return resolveHeadingRef(db, projectUuid, title).resolved?.uuid ?? null;
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Does a container ref's bare TITLE round-trip through its own resolver, in its
+ * own scope, back to THIS entity's uuid? The single predicate the emit boundary
+ * consults for the JSON round-trip law — true only when the sole resolution is
+ * `entityUuid` (not-found / ambiguous / a different entity all → false, i.e. the
+ * title must promote its uuid sibling). See {@link resolveTitleForRoundTrip}.
+ */
+export function titleRoundTrips(db, kind, title, entityUuid, projectUuid) {
+    return resolveTitleForRoundTrip(db, kind, title, projectUuid) === entityUuid;
+}
+/**
+ * Build the {@link RefPromoter} the read-shaping transform ({@link shapeReadPayload})
+ * consults to decide flat-ref uuid promotion, memoized per (kind, title, scope)
+ * for ONE response emission so a large view never re-runs a resolution it has
+ * already made. A fresh promoter (fresh memo) per response — the consumer
+ * surfaces build one via the client. The memo caches the RESOLVED uuid (or null),
+ * independent of the comparison target, so twin entities sharing a title share
+ * the one resolution.
+ */
+export function makeRefPromoter(db) {
+    const memo = new Map();
+    const resolve = (kind, title, projectUuid) => {
+        const key = `${kind}\x00${projectUuid ?? ""}\x00${title}`;
+        if (memo.has(key))
+            return memo.get(key) ?? null;
+        const uuid = resolveTitleForRoundTrip(db, kind, title, projectUuid);
+        memo.set(key, uuid);
+        return uuid;
+    };
+    return {
+        roundTrips: (kind, title, entityUuid, projectUuid) => resolve(kind, title, projectUuid) === entityUuid,
+    };
+}
 /**
  * A row's EFFECTIVE area: its own `area` link, else the area of its project,
  * else the area of its heading's project. To-dos nested in a project (or under a