daftari 3.4.0 → 3.5.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +9 -0
- package/README.md +20 -4
- package/dist/view/doc-view.d.ts +21 -0
- package/dist/view/doc-view.d.ts.map +1 -0
- package/dist/view/doc-view.js +53 -0
- package/dist/view/doc-view.js.map +1 -0
- package/dist/view/graph.d.ts +52 -0
- package/dist/view/graph.d.ts.map +1 -0
- package/dist/view/graph.js +133 -0
- package/dist/view/graph.js.map +1 -0
- package/dist/view/pages.d.ts +34 -16
- package/dist/view/pages.d.ts.map +1 -1
- package/dist/view/pages.js +435 -83
- package/dist/view/pages.js.map +1 -1
- package/dist/view/render.d.ts +11 -0
- package/dist/view/render.d.ts.map +1 -1
- package/dist/view/render.js +77 -0
- package/dist/view/render.js.map +1 -1
- package/dist/view/server.d.ts +1 -0
- package/dist/view/server.d.ts.map +1 -1
- package/dist/view/server.js +214 -48
- package/dist/view/server.js.map +1 -1
- package/dist/view/status-view.d.ts +32 -0
- package/dist/view/status-view.d.ts.map +1 -0
- package/dist/view/status-view.js +39 -0
- package/dist/view/status-view.js.map +1 -0
- package/package.json +1 -1
- package/templates/view/cytoscape.min.js +31 -0
package/CHANGELOG.md
CHANGED
|
@@ -5,6 +5,15 @@ All notable changes to this project are documented in this file.
|
|
|
5
5
|
The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.1.0/),
|
|
6
6
|
and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
|
|
7
7
|
|
|
8
|
+
## [3.5.0] - 2026-08-14
|
|
9
|
+
|
|
10
|
+
### Added
|
|
11
|
+
|
|
12
|
+
- **Viewer: epistemic surface on the document page** (#387) — the document page leads with a **standing strip** (status badge, a confidence meter, a decay chip, a contested flag) over the body, with epistemic banners differentiated by kind (decay / structural / upstream-staleness / pins / validity), all read from a new `/api/doc/<path>` JSON contract (the same DTO the page renders — a client app could consume it unchanged). The collection index carries per-document standing dots.
|
|
13
|
+
- **Viewer: knowledge graph** (#388) — a new `/graph` route renders an interactive map of the vault (nodes are documents, colored by status and flagged when decayed or contested; edges are `source` / `link` / `derives_from` / `contested`), backed by a `GET /api/graph?scope=all|ego&root=&depth=` JSON endpoint. Click a node to open its document; every document page links to its own neighborhood; large graphs cap by degree with a truncation notice. The graph library is vendored and lazy-loaded only on this route.
|
|
14
|
+
- **Viewer: dashboard home** (#389) — the home page becomes a vault dashboard (documents, collections, open tensions, ratification queue, a freshness distribution, and the recent sleep-run trend), rendered from a new `GET /api/status` JSON endpoint. The collection index moves to `/docs`; a top-bar nav reaches documents and the graph from every page.
|
|
15
|
+
- **Viewer: in-vault links + table of contents** (#390) — relative links to other vault documents are resolved to `/doc/<path>` using the same resolver backlinks use (so they cannot disagree), and `h1`–`h3` headings get stable anchor ids plus an "On this page" table of contents. Both run after sanitization, adding only controlled attributes.
|
|
16
|
+
|
|
8
17
|
## [3.4.0] - 2026-08-14
|
|
9
18
|
|
|
10
19
|
### Added
|
package/README.md
CHANGED
|
@@ -327,10 +327,26 @@ reads that history back, so the loop's own liveness is legible over time.
|
|
|
327
327
|
## The viewer
|
|
328
328
|
|
|
329
329
|
`daftari view` serves a read-only web portal over the vault — loopback only,
|
|
330
|
-
no editing
|
|
331
|
-
|
|
332
|
-
|
|
333
|
-
|
|
330
|
+
no editing — that makes the vault's *epistemic state and knowledge graph*
|
|
331
|
+
legible, not just its prose:
|
|
332
|
+
|
|
333
|
+
- **Dashboard home** — vault metrics, a freshness distribution (fresh/aging/
|
|
334
|
+
stale), open-tension and ratification-queue counts, and the recent sleep-run
|
|
335
|
+
trend.
|
|
336
|
+
- **Document pages** lead with a **standing strip** — status, a confidence
|
|
337
|
+
meter, decay, and a contested flag — over rendered (sanitized) markdown, with
|
|
338
|
+
epistemic banners (decay / structural / upstream / pins), a **Contested**
|
|
339
|
+
panel, **backlinks**, a table of contents, and in-vault links resolved to
|
|
340
|
+
their documents.
|
|
341
|
+
- **Knowledge graph** (`/graph`) — an interactive map of the vault: nodes are
|
|
342
|
+
documents (colored by status, flagged when decayed or contested), edges are
|
|
343
|
+
source / link / derives-from / contested relations. Click a node to open it;
|
|
344
|
+
every document links to its own neighborhood.
|
|
345
|
+
- **Search** over the hybrid index, on every page.
|
|
346
|
+
|
|
347
|
+
Read-only by construction (only GET, no mutation routes, a loopback Host
|
|
348
|
+
allow-list against DNS-rebinding), built on `node:http` with one lazily loaded
|
|
349
|
+
graph library — no web framework.
|
|
334
350
|
|
|
335
351
|
```bash
|
|
336
352
|
daftari view --vault ./my-vault # then open http://127.0.0.1:8788
|
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
import type { Frontmatter } from "../frontmatter/types.js";
|
|
2
|
+
import { type Result } from "../frontmatter/types.js";
|
|
3
|
+
import { type VaultReadResult } from "../tools/read.js";
|
|
4
|
+
export interface DocBacklinkRef {
|
|
5
|
+
doc: string;
|
|
6
|
+
via: "source" | "link";
|
|
7
|
+
}
|
|
8
|
+
export interface DocView {
|
|
9
|
+
path: string;
|
|
10
|
+
frontmatter: Frontmatter;
|
|
11
|
+
content: string;
|
|
12
|
+
decay: VaultReadResult["decay"];
|
|
13
|
+
validity: VaultReadResult["validity"];
|
|
14
|
+
upstream_staleness: VaultReadResult["upstream_staleness"];
|
|
15
|
+
structural: VaultReadResult["structural"];
|
|
16
|
+
anchors: VaultReadResult["anchors"];
|
|
17
|
+
contested: NonNullable<VaultReadResult["contested"]>;
|
|
18
|
+
backlinks: DocBacklinkRef[];
|
|
19
|
+
}
|
|
20
|
+
export declare function buildDocView(vaultRoot: string, target: string): Promise<Result<DocView | null, Error>>;
|
|
21
|
+
//# sourceMappingURL=doc-view.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"doc-view.d.ts","sourceRoot":"","sources":["../../src/view/doc-view.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAM,KAAK,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAE1D,OAAO,EAAE,KAAK,eAAe,EAAa,MAAM,kBAAkB,CAAC;AAEnE,MAAM,WAAW,cAAc;IAC7B,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,QAAQ,GAAG,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,WAAW,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;IAEhB,KAAK,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC;IAChC,QAAQ,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC;IACtC,kBAAkB,EAAE,eAAe,CAAC,oBAAoB,CAAC,CAAC;IAC1D,UAAU,EAAE,eAAe,CAAC,YAAY,CAAC,CAAC;IAC1C,OAAO,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC;IACpC,SAAS,EAAE,WAAW,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC;IACrD,SAAS,EAAE,cAAc,EAAE,CAAC;CAC7B;AAGD,wBAAsB,YAAY,CAChC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,MAAM,CAAC,OAAO,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,CAiCxC"}
|
|
@@ -0,0 +1,53 @@
|
|
|
1
|
+
// The doc-view DTO — the JSON data contract behind a document page. Both the
|
|
2
|
+
// server-rendered HTML page and the `/api/doc/<path>` endpoint read this one
|
|
3
|
+
// shape, and a future client app would consume the same JSON: rendering is a
|
|
4
|
+
// presentation concern kept OUT of the DTO (it carries raw markdown `content`,
|
|
5
|
+
// not HTML), so the viewer can evolve from server-rendered to client-rendered
|
|
6
|
+
// without changing the contract.
|
|
7
|
+
//
|
|
8
|
+
// The DTO is pure reuse: the epistemic reports are exactly what `vault_read`
|
|
9
|
+
// already computes (decay, validity, upstream staleness, structural decay,
|
|
10
|
+
// anchors, contested); backlinks come from the same reverse maps the rest of
|
|
11
|
+
// the viewer uses. Nothing here recomputes knowledge state.
|
|
12
|
+
import { buildReverseLinkMap, buildReverseSourceMap } from "../curation/tension-blast.js";
|
|
13
|
+
import { loadDocuments } from "../curation/vault-docs.js";
|
|
14
|
+
import { ok } from "../frontmatter/types.js";
|
|
15
|
+
import { canonicalVaultRelPath } from "../storage/local.js";
|
|
16
|
+
import { vaultRead } from "../tools/read.js";
|
|
17
|
+
// Build the DTO for one document, or null if the path resolves to no vault doc.
|
|
18
|
+
export async function buildDocView(vaultRoot, target) {
|
|
19
|
+
const loaded = await loadDocuments(vaultRoot);
|
|
20
|
+
if (!loaded.ok)
|
|
21
|
+
return loaded;
|
|
22
|
+
const docs = loaded.value;
|
|
23
|
+
const canon = canonicalVaultRelPath(vaultRoot, target);
|
|
24
|
+
const path = canon.ok ? canon.value : target;
|
|
25
|
+
const doc = docs.find((d) => d.path === path);
|
|
26
|
+
if (!doc)
|
|
27
|
+
return ok(null);
|
|
28
|
+
const read = await vaultRead(vaultRoot, path);
|
|
29
|
+
if (!read.ok)
|
|
30
|
+
return read;
|
|
31
|
+
const r = read.value;
|
|
32
|
+
const reverseSource = buildReverseSourceMap(docs);
|
|
33
|
+
const reverseLink = buildReverseLinkMap(docs);
|
|
34
|
+
const backlinks = [];
|
|
35
|
+
for (const b of reverseSource.get(path) ?? [])
|
|
36
|
+
backlinks.push({ doc: b, via: "source" });
|
|
37
|
+
for (const b of reverseLink.get(path) ?? [])
|
|
38
|
+
backlinks.push({ doc: b, via: "link" });
|
|
39
|
+
backlinks.sort((a, b) => a.doc.localeCompare(b.doc) || a.via.localeCompare(b.via));
|
|
40
|
+
return ok({
|
|
41
|
+
path,
|
|
42
|
+
frontmatter: r.frontmatter,
|
|
43
|
+
content: r.content,
|
|
44
|
+
decay: r.decay,
|
|
45
|
+
validity: r.validity,
|
|
46
|
+
upstream_staleness: r.upstream_staleness,
|
|
47
|
+
structural: r.structural,
|
|
48
|
+
anchors: r.anchors,
|
|
49
|
+
contested: r.contested ?? [],
|
|
50
|
+
backlinks,
|
|
51
|
+
});
|
|
52
|
+
}
|
|
53
|
+
//# sourceMappingURL=doc-view.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"doc-view.js","sourceRoot":"","sources":["../../src/view/doc-view.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,6EAA6E;AAC7E,6EAA6E;AAC7E,+EAA+E;AAC/E,8EAA8E;AAC9E,iCAAiC;AACjC,EAAE;AACF,6EAA6E;AAC7E,2EAA2E;AAC3E,6EAA6E;AAC7E,4DAA4D;AAE5D,OAAO,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAC1F,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,OAAO,EAAE,EAAE,EAAe,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAAE,qBAAqB,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAwB,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAqBnE,gFAAgF;AAChF,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,SAAiB,EACjB,MAAc;IAEd,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,SAAS,CAAC,CAAC;IAC9C,IAAI,CAAC,MAAM,CAAC,EAAE;QAAE,OAAO,MAAM,CAAC;IAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;IAE1B,MAAM,KAAK,GAAG,qBAAqB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC9C,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;IAE1B,MAAM,IAAI,GAAG,MAAM,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAC9C,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IAErB,MAAM,aAAa,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAClD,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC9C,MAAM,SAAS,GAAqB,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;QAAE,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC;IACzF,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;QAAE,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IACrF,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEnF,OAAO,EAAE,CAAC;QACR,IAAI;QACJ,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;QACxC,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,EAAE;QAC5B,SAAS;KACV,CAAC,CAAC;AACL,CAAC"}
|
|
@@ -0,0 +1,52 @@
|
|
|
1
|
+
export type GraphEdgeKind = "source" | "link" | "derives_from" | "contested";
|
|
2
|
+
export interface GraphNode {
|
|
3
|
+
path: string;
|
|
4
|
+
title: string;
|
|
5
|
+
collection: string;
|
|
6
|
+
tier: string | null;
|
|
7
|
+
status: string;
|
|
8
|
+
decayed: boolean;
|
|
9
|
+
contested: boolean;
|
|
10
|
+
}
|
|
11
|
+
export interface GraphEdge {
|
|
12
|
+
from: string;
|
|
13
|
+
to: string;
|
|
14
|
+
kind: GraphEdgeKind;
|
|
15
|
+
}
|
|
16
|
+
export interface VaultGraph {
|
|
17
|
+
nodes: GraphNode[];
|
|
18
|
+
edges: GraphEdge[];
|
|
19
|
+
total: number;
|
|
20
|
+
shown: number;
|
|
21
|
+
truncated: boolean;
|
|
22
|
+
}
|
|
23
|
+
export interface GraphDoc {
|
|
24
|
+
path: string;
|
|
25
|
+
title: string;
|
|
26
|
+
collection: string;
|
|
27
|
+
tier: string | null;
|
|
28
|
+
status: string;
|
|
29
|
+
}
|
|
30
|
+
export interface GraphInput {
|
|
31
|
+
docs: GraphDoc[];
|
|
32
|
+
reverseSource: Map<string, Iterable<string>>;
|
|
33
|
+
reverseLink: Map<string, Iterable<string>>;
|
|
34
|
+
derivesEdges: {
|
|
35
|
+
from: string;
|
|
36
|
+
to: string;
|
|
37
|
+
}[];
|
|
38
|
+
contestedPairs: {
|
|
39
|
+
a: string;
|
|
40
|
+
b: string;
|
|
41
|
+
}[];
|
|
42
|
+
decayed: Set<string>;
|
|
43
|
+
}
|
|
44
|
+
export interface GraphOptions {
|
|
45
|
+
scope: "all" | "ego";
|
|
46
|
+
root?: string;
|
|
47
|
+
depth?: number;
|
|
48
|
+
cap?: number;
|
|
49
|
+
}
|
|
50
|
+
export declare const DEFAULT_NODE_CAP = 600;
|
|
51
|
+
export declare function buildGraph(input: GraphInput, opts: GraphOptions): VaultGraph;
|
|
52
|
+
//# sourceMappingURL=graph.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/view/graph.ts"],"names":[],"mappings":"AAQA,MAAM,MAAM,aAAa,GAAG,QAAQ,GAAG,MAAM,GAAG,cAAc,GAAG,WAAW,CAAC;AAE7E,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,aAAa,CAAC;CACrB;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,QAAQ,EAAE,CAAC;IAGjB,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7C,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3C,YAAY,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC7C,cAAc,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC3C,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,eAAO,MAAM,gBAAgB,MAAM,CAAC;AAoCpC,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,GAAG,UAAU,CAkG5E"}
|
|
@@ -0,0 +1,133 @@
|
|
|
1
|
+
// Pure knowledge-graph builder for `daftari view`. Takes already-loaded inputs
|
|
2
|
+
// (docs + the reverse maps, derives_from edges, contested pairs, and the decayed
|
|
3
|
+
// set) and returns a {nodes, edges} graph — no IO, so it is unit-testable
|
|
4
|
+
// without a vault. The server route wires the IO (loadDocuments, vaultEdges,
|
|
5
|
+
// listTensions, computeDecay) and calls this. This is the JSON the /api/graph
|
|
6
|
+
// endpoint serves and the graph client renders (the B-seam: one contract, two
|
|
7
|
+
// consumers).
|
|
8
|
+
export const DEFAULT_NODE_CAP = 600;
|
|
9
|
+
// Forward edges from a reverse map: reverse maps are target -> [referrers], so a
|
|
10
|
+
// forward edge runs referrer -> target. Only edges whose BOTH endpoints are
|
|
11
|
+
// known documents are kept (a dangling reference is not a graph edge).
|
|
12
|
+
function edgesFromReverse(reverse, kind, known) {
|
|
13
|
+
const out = [];
|
|
14
|
+
for (const [target, referrers] of reverse) {
|
|
15
|
+
if (!known.has(target))
|
|
16
|
+
continue;
|
|
17
|
+
for (const from of referrers) {
|
|
18
|
+
if (from === target || !known.has(from))
|
|
19
|
+
continue;
|
|
20
|
+
out.push({ from, to: target, kind });
|
|
21
|
+
}
|
|
22
|
+
}
|
|
23
|
+
return out;
|
|
24
|
+
}
|
|
25
|
+
// Undirected adjacency for ego BFS and (optionally) degree-ranked capping.
|
|
26
|
+
function adjacency(edges) {
|
|
27
|
+
const adj = new Map();
|
|
28
|
+
const link = (a, b) => {
|
|
29
|
+
const s = adj.get(a) ?? new Set();
|
|
30
|
+
s.add(b);
|
|
31
|
+
adj.set(a, s);
|
|
32
|
+
};
|
|
33
|
+
for (const e of edges) {
|
|
34
|
+
link(e.from, e.to);
|
|
35
|
+
link(e.to, e.from);
|
|
36
|
+
}
|
|
37
|
+
return adj;
|
|
38
|
+
}
|
|
39
|
+
export function buildGraph(input, opts) {
|
|
40
|
+
const known = new Set(input.docs.map((d) => d.path));
|
|
41
|
+
// All edges, deduped (a pair may be both source and link — keep both kinds
|
|
42
|
+
// but never the same kind twice), endpoints restricted to known docs.
|
|
43
|
+
const rawEdges = [
|
|
44
|
+
...edgesFromReverse(input.reverseSource, "source", known),
|
|
45
|
+
...edgesFromReverse(input.reverseLink, "link", known),
|
|
46
|
+
...input.derivesEdges
|
|
47
|
+
.filter((e) => e.from !== e.to && known.has(e.from) && known.has(e.to))
|
|
48
|
+
.map((e) => ({ from: e.from, to: e.to, kind: "derives_from" })),
|
|
49
|
+
...input.contestedPairs
|
|
50
|
+
.filter((p) => p.a !== p.b && known.has(p.a) && known.has(p.b))
|
|
51
|
+
// canonical order so the undirected contested edge dedupes stably
|
|
52
|
+
.map((p) => {
|
|
53
|
+
const [from, to] = p.a < p.b ? [p.a, p.b] : [p.b, p.a];
|
|
54
|
+
return { from, to, kind: "contested" };
|
|
55
|
+
}),
|
|
56
|
+
];
|
|
57
|
+
const seen = new Set();
|
|
58
|
+
let allEdges = [];
|
|
59
|
+
for (const e of rawEdges) {
|
|
60
|
+
const key = `${e.kind}|${e.from}|${e.to}`;
|
|
61
|
+
if (seen.has(key))
|
|
62
|
+
continue;
|
|
63
|
+
seen.add(key);
|
|
64
|
+
allEdges.push(e);
|
|
65
|
+
}
|
|
66
|
+
const contestedNodes = new Set();
|
|
67
|
+
for (const e of allEdges) {
|
|
68
|
+
if (e.kind === "contested") {
|
|
69
|
+
contestedNodes.add(e.from);
|
|
70
|
+
contestedNodes.add(e.to);
|
|
71
|
+
}
|
|
72
|
+
}
|
|
73
|
+
// Node universe, optionally narrowed to an ego neighborhood via undirected BFS.
|
|
74
|
+
let nodePaths = new Set(known);
|
|
75
|
+
if (opts.scope === "ego") {
|
|
76
|
+
const root = opts.root ?? "";
|
|
77
|
+
nodePaths = new Set();
|
|
78
|
+
if (known.has(root)) {
|
|
79
|
+
const depth = Math.max(0, opts.depth ?? 1);
|
|
80
|
+
const adj = adjacency(allEdges);
|
|
81
|
+
let frontier = new Set([root]);
|
|
82
|
+
nodePaths.add(root);
|
|
83
|
+
for (let d = 0; d < depth; d++) {
|
|
84
|
+
const next = new Set();
|
|
85
|
+
for (const n of frontier) {
|
|
86
|
+
for (const m of adj.get(n) ?? []) {
|
|
87
|
+
if (!nodePaths.has(m)) {
|
|
88
|
+
next.add(m);
|
|
89
|
+
nodePaths.add(m);
|
|
90
|
+
}
|
|
91
|
+
}
|
|
92
|
+
}
|
|
93
|
+
if (next.size === 0)
|
|
94
|
+
break;
|
|
95
|
+
frontier = next;
|
|
96
|
+
}
|
|
97
|
+
}
|
|
98
|
+
}
|
|
99
|
+
const total = nodePaths.size;
|
|
100
|
+
// Cap (R8): if over the cap, keep the highest-degree nodes (most connected =
|
|
101
|
+
// most informative), deterministic tiebreak by path. The root, if any, is
|
|
102
|
+
// always retained.
|
|
103
|
+
const cap = opts.cap ?? DEFAULT_NODE_CAP;
|
|
104
|
+
let truncated = false;
|
|
105
|
+
if (nodePaths.size > cap) {
|
|
106
|
+
truncated = true;
|
|
107
|
+
const adj = adjacency(allEdges.filter((e) => nodePaths.has(e.from) && nodePaths.has(e.to)));
|
|
108
|
+
const ranked = [...nodePaths].sort((a, b) => {
|
|
109
|
+
const da = adj.get(a)?.size ?? 0;
|
|
110
|
+
const db = adj.get(b)?.size ?? 0;
|
|
111
|
+
return db - da || a.localeCompare(b);
|
|
112
|
+
});
|
|
113
|
+
const keep = new Set(ranked.slice(0, cap));
|
|
114
|
+
if (opts.scope === "ego" && opts.root && known.has(opts.root))
|
|
115
|
+
keep.add(opts.root);
|
|
116
|
+
nodePaths = keep;
|
|
117
|
+
}
|
|
118
|
+
const nodes = input.docs
|
|
119
|
+
.filter((d) => nodePaths.has(d.path))
|
|
120
|
+
.map((d) => ({
|
|
121
|
+
path: d.path,
|
|
122
|
+
title: d.title,
|
|
123
|
+
collection: d.collection,
|
|
124
|
+
tier: d.tier,
|
|
125
|
+
status: d.status,
|
|
126
|
+
decayed: input.decayed.has(d.path),
|
|
127
|
+
contested: contestedNodes.has(d.path),
|
|
128
|
+
}))
|
|
129
|
+
.sort((a, b) => (a.title || a.path).localeCompare(b.title || b.path));
|
|
130
|
+
allEdges = allEdges.filter((e) => nodePaths.has(e.from) && nodePaths.has(e.to));
|
|
131
|
+
return { nodes, edges: allEdges, total, shown: nodes.length, truncated };
|
|
132
|
+
}
|
|
133
|
+
//# sourceMappingURL=graph.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/view/graph.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAC/E,iFAAiF;AACjF,0EAA0E;AAC1E,6EAA6E;AAC7E,8EAA8E;AAC9E,8EAA8E;AAC9E,cAAc;AAsDd,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAEpC,iFAAiF;AACjF,4EAA4E;AAC5E,uEAAuE;AACvE,SAAS,gBAAgB,CACvB,OAAsC,EACtC,IAAmB,EACnB,KAAkB;IAElB,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS;QACjC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAClD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,2EAA2E;AAC3E,SAAS,SAAS,CAAC,KAAkB;IACnC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC3C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAC1C,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACT,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACnB,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAiB,EAAE,IAAkB;IAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAErD,2EAA2E;IAC3E,sEAAsE;IACtE,MAAM,QAAQ,GAAgB;QAC5B,GAAG,gBAAgB,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,EAAE,KAAK,CAAC;QACzD,GAAG,gBAAgB,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,CAAC;QACrD,GAAG,KAAK,CAAC,YAAY;aAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACtE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,cAAuB,EAAE,CAAC,CAAC;QAC1E,GAAG,KAAK,CAAC,cAAc;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/D,kEAAkE;aACjE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACvD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,WAAoB,EAAE,CAAC;QAClD,CAAC,CAAC;KACL,CAAC;IACF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,QAAQ,GAAgB,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC3B,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC3B,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,gFAAgF;IAChF,IAAI,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7B,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;YACvC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC/B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;oBACzB,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;wBACjC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;4BACtB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;4BACZ,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBACnB,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;oBAAE,MAAM;gBAC3B,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC;IAE7B,6EAA6E;IAC7E,0EAA0E;IAC1E,mBAAmB;IACnB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,gBAAgB,CAAC;IACzC,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,SAAS,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;QACzB,SAAS,GAAG,IAAI,CAAC;QACjB,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5F,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YACjC,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnF,SAAS,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,MAAM,KAAK,GAAgB,KAAK,CAAC,IAAI;SAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACX,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAClC,SAAS,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;KACtC,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAExE,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC;AAC3E,CAAC"}
|
package/dist/view/pages.d.ts
CHANGED
|
@@ -1,20 +1,7 @@
|
|
|
1
|
+
import type { GraphOptions } from "./graph.js";
|
|
2
|
+
import { type TocEntry } from "./render.js";
|
|
3
|
+
import type { StatusView } from "./status-view.js";
|
|
1
4
|
export declare function layout(title: string, bodyHtml: string, query?: string): string;
|
|
2
|
-
export interface SearchHitView {
|
|
3
|
-
path: string;
|
|
4
|
-
title: string;
|
|
5
|
-
collection: string;
|
|
6
|
-
snippet: string;
|
|
7
|
-
}
|
|
8
|
-
export declare function renderSearchPage(query: string, hits: SearchHitView[]): string;
|
|
9
|
-
export interface IndexEntry {
|
|
10
|
-
path: string;
|
|
11
|
-
title: string;
|
|
12
|
-
}
|
|
13
|
-
export interface IndexGroup {
|
|
14
|
-
collection: string;
|
|
15
|
-
docs: IndexEntry[];
|
|
16
|
-
}
|
|
17
|
-
export declare function renderIndexPage(groups: IndexGroup[]): string;
|
|
18
5
|
export interface DocFrontmatterView {
|
|
19
6
|
title: string;
|
|
20
7
|
collection: string;
|
|
@@ -35,11 +22,42 @@ export interface DocTensionView {
|
|
|
35
22
|
claimOther: string;
|
|
36
23
|
loggedAt: string;
|
|
37
24
|
}
|
|
25
|
+
export type DocBannerKind = "decay" | "structural" | "upstream" | "anchor" | "validity";
|
|
26
|
+
export interface DocBannerView {
|
|
27
|
+
kind: DocBannerKind;
|
|
28
|
+
text: string;
|
|
29
|
+
}
|
|
38
30
|
export declare function renderDocPage(args: {
|
|
39
31
|
path: string;
|
|
40
32
|
frontmatter: DocFrontmatterView;
|
|
41
33
|
bodyHtml: string;
|
|
42
34
|
backlinks: DocBacklinkView[];
|
|
43
35
|
tensions?: DocTensionView[];
|
|
36
|
+
banners?: DocBannerView[];
|
|
37
|
+
validity?: string | null;
|
|
38
|
+
decayLevel?: string | null;
|
|
39
|
+
contestedCount?: number;
|
|
40
|
+
toc?: TocEntry[];
|
|
44
41
|
}): string;
|
|
42
|
+
export interface IndexEntry {
|
|
43
|
+
path: string;
|
|
44
|
+
title: string;
|
|
45
|
+
status?: string;
|
|
46
|
+
confidence?: string;
|
|
47
|
+
tier?: string | null;
|
|
48
|
+
}
|
|
49
|
+
export interface IndexGroup {
|
|
50
|
+
collection: string;
|
|
51
|
+
docs: IndexEntry[];
|
|
52
|
+
}
|
|
53
|
+
export declare function renderIndexPage(groups: IndexGroup[]): string;
|
|
54
|
+
export interface SearchHitView {
|
|
55
|
+
path: string;
|
|
56
|
+
title: string;
|
|
57
|
+
collection: string;
|
|
58
|
+
snippet: string;
|
|
59
|
+
}
|
|
60
|
+
export declare function renderSearchPage(query: string, hits: SearchHitView[]): string;
|
|
61
|
+
export declare function renderGraphPage(opts: GraphOptions): string;
|
|
62
|
+
export declare function renderDashboardPage(s: StatusView): string;
|
|
45
63
|
//# sourceMappingURL=pages.d.ts.map
|
package/dist/view/pages.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"pages.d.ts","sourceRoot":"","sources":["../../src/view/pages.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"pages.d.ts","sourceRoot":"","sources":["../../src/view/pages.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC/C,OAAO,EAAW,KAAK,QAAQ,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAqLnD,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,MAAM,CAS1E;AAmCD,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,YAAY,GAAG,UAAU,GAAG,QAAQ,GAAG,UAAU,CAAC;AAExF,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,aAAa,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;CACd;AAUD,wBAAgB,aAAa,CAAC,IAAI,EAAE;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,kBAAkB,CAAC;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,eAAe,EAAE,CAAC;IAC7B,QAAQ,CAAC,EAAE,cAAc,EAAE,CAAC;IAC5B,OAAO,CAAC,EAAE,aAAa,EAAE,CAAC;IAC1B,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;CAClB,GAAG,MAAM,CAyET;AAID,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB;AACD,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,UAAU,EAAE,CAAC;CACpB;AAcD,wBAAgB,eAAe,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,CAkB5D;AAID,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,MAAM,CAiB7E;AAmFD,wBAAgB,eAAe,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,CA0B1D;AAgBD,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM,CA6CzD"}
|