@ttsc/graph 0.30.4 → 0.31.0

package/lib/model/TtscGraphMemory.js

@@ -3,8 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.TtscGraphMemory = void 0;
 exports.documentationTarget = documentationTarget;
 exports.leadingToken = leadingToken;
-const TtscGraphArtifactNodeKind_1 = require("../structures/TtscGraphArtifactNodeKind");
-const TtscGraphNodeId_1 = require("./TtscGraphNodeId");
+const TtscGraphProjection_1 = require("./TtscGraphProjection");
 const TtscGraphSourceReader_1 = require("./TtscGraphSourceReader");
 /**
  * The in-memory resident graph the MCP tools answer from.
@@ -16,8 +15,23 @@ const TtscGraphSourceReader_1 = require("./TtscGraphSourceReader");
  * implementation relationships are checker facts already present in the dump.
  * Every tool call is then a lookup or traversal over the indexes built here;
  * nothing recompiles.
+ *
+ * Snapshot records are owned copies and recursively frozen. Borrowed node
+ * records and edge buckets have recursively readonly types, so caller changes
+ * cannot invalidate generation-keyed indexes and caches.
+ *
+ * @evidence contracts/common.md#principled-implementation Native facts are preserved while module/file folding, exact owner suffixes and artifact parents synthesize only this layer's structural relationships.
+ * @evidence contracts/common.md#clear-and-simple-design One snapshot owns node, name, relation and citation indexes; individual accessors expose that shared model.
+ * @evidence contracts/common.md#prohibited-implementation-shortcuts Export surfaces remain checker relationships rather than guessed from local export flags or fixture paths.
+ * @evidence contracts/common.md#meaningful-documentation Native paragraphs distinguish compiler facts from synthesized structure, and accessors explain lookup and absence semantics.
+ * @evidenceExclude contracts/performance.md#efficient-algorithms from and fromResident own projection/index construction through their private helpers; this class declaration describes the resulting representation.
+ * @evidenceExclude contracts/performance.md#reuse-equivalent-work from and fromResident establish each shared generation; the declaration does not independently coordinate requests.
+ * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources from and fromResident transfer generation storage to their caller; session/caller release owns its duration rather than this declaration.
+ * @evidenceExclude contracts/portability.md#os-neutral-implementation an in-memory index over parsed facts; the source reader it owns is the only file reader.
  */
 class TtscGraphMemory {
+    projection;
+    nodeKeys;
     byId;
     outEdges;
     inEdges;
@@ -32,73 +46,172 @@ class TtscGraphMemory {
     edges;
     /** Provenance-gated source display facts cached for this exact snapshot. */
     source;
-    constructor(project, nodes, edges, provenance) {
+    constructor(project, nodes, edges, provenance, projection, previous) {
+        this.projection = projection;
         this.project = project;
         this.nodes = nodes;
         this.edges = edges;
-        this.source = new TtscGraphSourceReader_1.TtscGraphSourceReader(project, provenance);
-        this.byId = new Map(nodes.map((n) => [n.id, n]));
-        this.byNameIndex = new Map();
-        this.bySymbolIndex = new Map();
-        this.byDocTagTarget = new Map();
+        // Source adjudication belongs to this generation even when graph facts
+        // remain equivalent. Never transfer cached lines or cached absence.
+        this.source = new TtscGraphSourceReader_1.TtscGraphSourceReader(project, provenance === undefined
+            ? undefined
+            : {
+                capabilities: [...provenance.capabilities],
+                sources: provenance.sources.map((source) => ({ ...source })),
+            });
+        this.byId = new Map(nodes.map((node) => [node.id, node]));
+        this.nodeKeys = new Map();
         for (const node of nodes) {
-            const bucket = this.byNameIndex.get(node.name);
-            if (bucket)
-                bucket.push(node);
-            else
-                this.byNameIndex.set(node.name, [node]);
-            if (node.kind !== "file") {
-                push(this.bySymbolIndex, node.name, node);
-                if (node.qualifiedName !== undefined) {
-                    push(this.bySymbolIndex, node.qualifiedName, node);
-                }
-            }
-            for (const target of docTagTargetsOf(node)) {
-                const carriers = this.byDocTagTarget.get(target);
-                // The membership check is redundant today — `docTagTargetsOf`
-                // deduplicates within a node and this loop visits each node once — and
-                // it is kept because the cost is a scan of a list that holds the
-                // carriers of one address, while the failure it prevents is a
-                // declaration reported twice as implementing one specification.
-                if (carriers === undefined)
-                    this.byDocTagTarget.set(target, [node]);
-                else if (!carriers.includes(node))
-                    carriers.push(node);
-            }
-        }
-        this.outEdges = new Map();
-        this.inEdges = new Map();
-        for (const edge of edges) {
-            push(this.outEdges, edge.from, edge);
-            push(this.inEdges, edge.to, edge);
+            const retained = previous?.nodeKeys.get(node);
+            this.nodeKeys.set(node, retained ?? {
+                symbols: node.kind === "file"
+                    ? []
+                    : node.qualifiedName !== undefined &&
+                        node.qualifiedName !== node.name
+                        ? [node.name, node.qualifiedName]
+                        : [node.name],
+                targets: docTagTargetsOf(node),
+            });
         }
+        this.byNameIndex = index(nodes, (node) => node.name, previous?.byNameIndex);
+        this.bySymbolIndex = index(nodes, (node) => this.nodeKeys.get(node).symbols, previous?.bySymbolIndex);
+        this.byDocTagTarget = index(nodes, (node) => this.nodeKeys.get(node).targets, previous?.byDocTagTarget);
+        this.outEdges = index(edges, (edge) => edge.from, previous?.outEdges);
+        this.inEdges = index(edges, (edge) => edge.to, previous?.inEdges);
+        Object.freeze(this);
     }
-    /** Build a model from a parsed dump, synthesizing structural relationships. */
+    /**
+     * Build a model from a parsed dump, synthesizing structural relationships.
+     *
+     * The parsed dump must describe one valid generation. Node records are copied
+     * before member-kind refinement so the caller's dump is unchanged.
+     *
+     * @evidence contracts/common.md#principled-implementation Synthesis reanchors native module exports and derives containment from exact owner handles and disambiguating declaration ranges before constructing the indexes for that generation.
+     * @evidence contracts/common.md#clear-and-simple-design Synthesis owns representation changes; the private constructor owns index construction.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts No export edges are guessed from flags, and artifact ownership follows its producer rather than TypeScript id heuristics.
+     * @evidence contracts/common.md#meaningful-documentation Native prose states the valid-generation precondition and caller-dump preservation.
+     * @evidence contracts/performance.md#efficient-algorithms Synthesis indexes nodes by file and handle, scanning only colliding owner buckets once per member; owned snapshot copying and index construction scan nodes, edges and facets; per-node target sets make citation deduplication linear in tag population without repeatedly scanning carrier buckets.
+     * @evidence contracts/performance.md#reuse-equivalent-work One model builds all indexes once over owned frozen facts and buckets, so external mutation cannot invalidate shared generation identity.
+     * @evidence contracts/performance.md#bound-retention-and-release-resources The model retains node/edge arrays, lookup indexes and source cache proportional to its generation; the session or direct caller releases the whole model when no longer needed.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation builds indexes from a parsed dump object and reads no file; source text goes through TtscGraphSourceReader.
+     */
     static from(dump) {
-        const { nodes, edges } = synthesize(dump);
+        const { nodes, edges } = TtscGraphProjection_1.TtscGraphProjection.full(dump);
         return new TtscGraphMemory(dump.project, nodes, edges, dump.provenance);
     }
-    /** The node with this id, or undefined. */
+    /**
+     * Project validated frozen resident facts while retaining equivalent work.
+     *
+     * The shard store invokes this before committing its staged generation. Each
+     * model owns new index maps and a new source reader; unchanged facts and
+     * ordered index buckets may be shared with the previous immutable model.
+     *
+     * @evidence contracts/common.md#principled-implementation Validated frozen fact identity and complete projection dependencies qualify component reuse; construction never mutates the preceding model.
+     * @evidence contracts/common.md#clear-and-simple-design The projection owner handles synthesis components and this model owns ordered query indexes and source authority.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts This internal path requires the store's complete validation; public from still detaches caller DTOs and no graph facts or validation are omitted.
+     * @evidence contracts/common.md#meaningful-documentation Native prose states the validated-input premise, staged commit and per-generation source-reader boundary.
+     * @evidence contracts/performance.md#efficient-algorithms Projection scans references and rebuilds only invalidated components; index scans retain equal buckets without allocating their arrays, while maps and generation arrays remain linear in facts.
+     * @evidence contracts/performance.md#reuse-equivalent-work Same-file owner/module dependencies and metadata qualify immutable components; exact ordered reference equality qualifies node/relation/citation buckets. New source adjudication is intentionally independent.
+     * @evidence contracts/performance.md#bound-retention-and-release-resources Each model retains only its current components, facts, indexes and source reader; unchanged values may also belong to retained old models, without a link retaining prior model generations.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation Processes only frozen in-memory facts; source IO remains with the per-generation reader.
+     */
+    static fromResident(dump, previous) {
+        const projection = TtscGraphProjection_1.TtscGraphProjection.create(dump, previous?.projection);
+        return new TtscGraphMemory(dump.project, projection.nodes, projection.edges, dump.provenance, projection, previous);
+    }
+    /**
+     * The node with this exact stable id, or undefined when absent.
+     *
+     * @evidence contracts/common.md#principled-implementation The id index returns the snapshot's exact node without conflating same-named declarations.
+     * @evidence contracts/common.md#clear-and-simple-design This accessor delegates identity lookup to the single model index.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts Missing identities are not replaced by name-matched candidates.
+     * @evidence contracts/common.md#meaningful-documentation The native headline states exact-id and missing-result semantics.
+     * @evidence contracts/performance.md#efficient-algorithms Exact identity requires one construction-time map lookup and no node scan.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work The accessor borrows a completed id index; from owns shared construction.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources Returning an existing node acquires no handle or independent retained entry.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation one Map lookup over in-memory facts.
+     */
     node(id) {
         return this.byId.get(id);
     }
-    /** Edges leaving a node (the node is the `from`). */
+    /**
+     * Edges leaving a node (the node is the from endpoint), empty when absent.
+     *
+     * @evidence contracts/common.md#principled-implementation The outgoing index preserves native and synthesized edge direction for the exact node id.
+     * @evidence contracts/common.md#clear-and-simple-design The accessor exposes one readonly bucket without rescanning the edge population.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts Absence returns no edges rather than inferred calls from matching names.
+     * @evidence contracts/common.md#meaningful-documentation Native prose states endpoint direction, missing behavior and the readonly return contract.
+     * @evidence contracts/performance.md#efficient-algorithms A map lookup returns the outgoing bucket without traversing unrelated edges.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work from owns the reused adjacency computation; the accessor only borrows its result.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources Existing buckets remain generation-owned; the accessor acquires no separate resource.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation one Map lookup over in-memory edges.
+     */
     outgoing(id) {
         return this.outEdges.get(id) ?? [];
     }
-    /** Edges entering a node (the node is the `to`). */
+    /**
+     * Edges entering a node (the node is the to endpoint), empty when absent.
+     *
+     * @evidence contracts/common.md#principled-implementation The incoming index selects edges by their original target identity.
+     * @evidence contracts/common.md#clear-and-simple-design The accessor shares construction-time adjacency instead of implementing another traversal.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts No callers are guessed from text or substituted when the bucket is absent.
+     * @evidence contracts/common.md#meaningful-documentation Native prose states incoming direction and empty absence before the tags.
+     * @evidence contracts/performance.md#efficient-algorithms A map lookup returns the incoming bucket without scanning graph edges.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work This accessor borrows the index already shared by from rather than coordinating another producer.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources It retains no state beyond the generation's existing edge bucket.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation one Map lookup over in-memory edges.
+     */
     incoming(id) {
         return this.inEdges.get(id) ?? [];
     }
-    /** Every node whose simple name equals `name`. */
+    /**
+     * Every node whose simple name equals name, empty when absent.
+     *
+     * @evidence contracts/common.md#principled-implementation The exact simple-name index returns all matching identities, preserving ambiguity.
+     * @evidence contracts/common.md#clear-and-simple-design A readonly bucket supplies name lookup independently of ranked search.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts Multiple declarations remain candidates rather than selecting the expected fixture's declaration.
+     * @evidence contracts/common.md#meaningful-documentation Native prose describes exact matching and empty absence.
+     * @evidence contracts/performance.md#efficient-algorithms Exact-name lookup performs one map access instead of filtering all nodes.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work Name-index construction and validity belong to from, not this borrowed bucket lookup.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources The returned bucket remains generation-owned with no separately retained cache or handle.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation one Map lookup over in-memory facts.
+     */
     named(name) {
         return this.byNameIndex.get(name) ?? [];
     }
-    /** Every non-file node whose simple or owner-qualified symbol handle matches. */
+    /**
+     * Every non-file node whose simple or owner-qualified symbol handle matches.
+     *
+     * Matches borrow a frozen generation-owned bucket; no match returns an empty
+     * readonly list, and several matches remain distinct.
+     *
+     * @evidence contracts/common.md#principled-implementation The symbol index includes simple and qualified handles but excludes file containers from symbol resolution.
+     * @evidence contracts/common.md#clear-and-simple-design One shared index serves all exact-handle consumers without duplicate resolution policy.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts The accessor preserves ambiguity rather than fabricating a unique resolution.
+     * @evidence contracts/common.md#meaningful-documentation Native prose explains non-file selection, qualified handles and multiple/missing matches.
+     * @evidence contracts/performance.md#efficient-algorithms Both simple and qualified handles use the construction-time symbol index, so this accessor performs one map lookup without scanning candidates.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work This borrows one already-built symbol bucket; model construction owns shared work.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources Existing candidates remain frozen generation-owned records in a borrowed bucket; the accessor acquires no separate resource or retained entry.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation one Map lookup over in-memory facts.
+     */
     symbols(handle) {
         return this.bySymbolIndex.get(handle) ?? [];
     }
-    /** Every workspace node on its module's export surface. */
+    /**
+     * Every workspace node marked exported by the native declaration facts.
+     *
+     * External declarations are omitted. Module-specific re-export membership is
+     * available separately through exports edges.
+     *
+     * @evidence contracts/common.md#principled-implementation Filtering exported flags and excluding external nodes yields local exported declarations, not a guessed package front door.
+     * @evidence contracts/common.md#clear-and-simple-design The accessor performs one explicit population filter; per-module surface remains in relation indexes.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts The API does not equate declaring-file export flags with all barrel export relationships.
+     * @evidence contracts/common.md#meaningful-documentation Native prose distinguishes exported declarations from module-specific re-exports and states external omission.
+     * @evidence contracts/performance.md#efficient-algorithms One O(V) filter over generation nodes selects exported nonexternal declarations; no separate export-flag index is built.
+     * @evidence contracts/performance.md#reuse-equivalent-work Completed exported-list memoization is not implemented; every call returns a new mutable array over the shared generation nodes.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources The projected array belongs to its caller; this method retains no separate state.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation filters the in-memory node array; no file, path or process.
+     */
     exported() {
         return this.nodes.filter((n) => n.exported && !n.external);
     }
@@ -117,6 +230,15 @@ class TtscGraphMemory {
      * part of a tag's text names a thing belongs to whatever convention wrote the
      * tag, so this is a selection rule of the consuming layer rather than a fact
      * the producer claims.
+     *
+     * @evidence contracts/common.md#principled-implementation Exact target lookup returns indexed declaration carriers under documentationTarget's explicit consumer-side selection rule.
+     * @evidence contracts/common.md#clear-and-simple-design The reverse citation index is built once alongside node indexes instead of rescanning tags per query.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts A match identifies a written citation, not a coverage or truth verdict about its target.
+     * @evidence contracts/common.md#meaningful-documentation Native paragraphs explain reverse lookup, exact spelling and the consumer heuristic's authority boundary.
+     * @evidence contracts/performance.md#efficient-algorithms Reverse citation lookup uses the constructed target index instead of scanning all tags per request.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work The accessor borrows the shared citation index; from owns synthesis and its validity key.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources It returns an existing readonly carrier list and acquires no resource or historical cache.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation one Map lookup over in-memory facts.
      */
     citing(target) {
         return this.byDocTagTarget.get(target) ?? [];
@@ -134,13 +256,13 @@ exports.TtscGraphMemory = TtscGraphMemory;
 function docTagTargetsOf(node) {
     if (node.docTags === undefined)
         return [];
-    const targets = [];
+    const targets = new Set();
     for (const tag of node.docTags) {
         const token = documentationTarget(tag.text);
-        if (token !== undefined && !targets.includes(token))
-            targets.push(token);
+        if (token !== undefined)
+            targets.add(token);
     }
-    return targets;
+    return [...targets];
 }
 /**
  * The address a documentation tag's text opens with, or undefined when its
@@ -165,6 +287,15 @@ function docTagTargetsOf(node) {
  * layer whose audit already declares its selection heuristic. A convention
  * whose addresses look like prose is simply not indexed; nothing is lost from
  * the tag itself, which `details` still returns in full.
+ *
+ * @evidence contracts/common.md#principled-implementation Leading-token extraction plus interior separators selects address-like tokens while rejecting ordinary prose; this is explicitly a lookup heuristic.
+ * @evidence contracts/common.md#clear-and-simple-design One selector owns citation indexing and query normalization, leaving raw tags unchanged in declaration facts.
+ * @evidence contracts/common.md#prohibited-implementation-shortcuts Address punctuation is a general convention boundary rather than an allowlist of expected specifications.
+ * @evidence contracts/common.md#meaningful-documentation Native paragraphs state false-prose matches, accepted address forms and the limitation for prose-like conventions.
+ * @evidence contracts/performance.md#efficient-algorithms Leading-token extraction and address classification scan only the tag text, with no graph-wide lookup.
+ * @evidenceExclude contracts/performance.md#reuse-equivalent-work This pure token classifier has no completed-work coordinator; from builds the reusable citation index.
+ * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources The optional returned string owns no native resource or retained history.
+ * @evidenceExclude contracts/portability.md#os-neutral-implementation tokenizes a tag string; the address it returns is text that is never resolved or opened.
  */
 function documentationTarget(text) {
     const token = leadingToken(text);
@@ -185,6 +316,15 @@ function documentationTarget(text) {
  * An unclosed brace group is not a token: `{@link ISale` with the brace
  * forgotten would otherwise fall through to the whitespace split and index the
  * address `{@link`, which every link in the project shares.
+ *
+ * @evidence contracts/common.md#principled-implementation Trim and first whitespace preserve the opening token; a leading brace group is returned whole only when closed.
+ * @evidence contracts/common.md#clear-and-simple-design This lexical helper is shared by citation selection rather than parsing tag semantics itself.
+ * @evidence contracts/common.md#prohibited-implementation-shortcuts Malformed brace groups return absence instead of being coerced into a ubiquitous partial link.
+ * @evidence contracts/common.md#meaningful-documentation Native prose explains brace grouping and the malformed-token reason before acknowledgment tags.
+ * @evidence contracts/performance.md#efficient-algorithms A single bounded text scan finds the token boundary without constructing a parser or scanning unrelated tags.
+ * @evidenceExclude contracts/performance.md#reuse-equivalent-work This pure per-string extraction does not coordinate reusable producer work.
+ * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources Only the returned token survives the call; no retained map or handle is acquired.
+ * @evidenceExclude contracts/portability.md#os-neutral-implementation splits a string at whitespace or a brace group; the token is never resolved or opened.
  */
 function leadingToken(text) {
     const trimmed = text?.trim();
@@ -197,185 +337,51 @@ function leadingToken(text) {
     const stop = trimmed.search(/\s/u);
     return stop < 0 ? trimmed : trimmed.slice(0, stop);
 }
-/** Append value to the slice stored at key, creating the slice on first use. */
-function push(map, key, value) {
-    const bucket = map.get(key);
-    if (bucket)
-        bucket.push(value);
-    else
-        map.set(key, [value]);
-}
-/**
- * The within-file identity of a node: its owner-qualified name when it has one
- * (`Class.method`), else its simple name. Two nodes in one file never share a
- * key, so it is the handle the ownership synthesis looks owners up by.
- */
-function keyOf(node) {
-    return node.qualifiedName ?? node.name;
-}
 /**
- * The owner key derived from facts the producer serialized separately.
+ * Build an ordered index, copying a bucket only after its membership differs.
  *
- * A quoted member named `"a.b"` has Name `a.b` and QualifiedName `Box.a.b`.
- * Cutting the qualified name at its last dot invents owner `Box.a`; removing
- * the exact `.${name}` suffix instead preserves the producer's real boundary.
- */
-function ownerKey(node) {
-    if (node.qualifiedName === undefined || node.qualifiedName === node.name)
-        return undefined;
-    const suffix = `.${node.name}`;
-    if (!node.qualifiedName.endsWith(suffix))
-        return undefined;
-    const owner = node.qualifiedName.slice(0, -suffix.length);
-    return owner === "" ? undefined : owner;
-}
-/** A file's id and node name from its dump path coordinate. */
-function fileNodeId(file) {
-    return file;
-}
-/**
- * A wire span with its file put back: the one the builder left out because the
- * reader has it, or the one it kept because it could not be derived (an
- * implementation in another file).
+ * The scan compares reference identity at each position with the previous
+ * immutable bucket. Prefixes are copied only on the first difference; a
+ * shortened bucket is copied at the end. New maps never mutate old maps or
+ * frozen buckets. Cost is linear in memberships plus changed bucket sizes;
+ * current counts/maps are temporary and no historical index is retained.
  */
-function spanIn(span, file) {
-    return { ...span, file: span.file ?? file };
-}
-/**
- * The source file a node id names. An id is `path#Qualified.Name:kind`, and a
- * file node's id is the path itself.
- */
-function fileOfNodeId(id) {
-    return (0, TtscGraphNodeId_1.ttscGraphNodeIdPath)(id) ?? id;
-}
-function basename(file) {
-    const slash = file.lastIndexOf("/");
-    return slash >= 0 ? file.slice(slash + 1) : file;
-}
-/**
- * Derive the structural layer from a dump's faithful facts: refine class-member
- * variables to properties, add a `file` node per workspace source, connect the
- * `contains` ownership tree, and re-anchor compiler-owned `exports` edges.
- */
-function synthesize(dump) {
-    // A module node is the dump's name for a source file's export surface, and a
-    // file node is this layer's name for the same file. Fold the two: the module
-    // keeps its file present here even when the file declares nothing (a barrel),
-    // and its `exports` edges are re-anchored on the file id every other tool
-    // already traverses. What the module carried, the file now carries.
-    const moduleFiles = new Set(dump.nodes.filter((n) => n.kind === "module").map((n) => n.file));
-    const moduleIds = new Map(dump.nodes.filter((n) => n.kind === "module").map((n) => [n.id, n.file]));
-    // Clone nodes so property refinement does not mutate the caller's dump, and
-    // put back the file the builder left out of every span: a node's span is in
-    // the node's file, an edge's span is in the file its `from` id names. The
-    // builder omits both because they are exactly reconstructible and they are not
-    // small — the two copies are 17% of the document, 55 MB of VS Code's 323 MB,
-    // paid again in the encode, the pipe, the parse and the validation. Nothing
-    // downstream of this line sees a span without its file.
-    const nodes = dump.nodes.flatMap((n) => {
-        if (n.kind === "module")
-            return [];
-        const { evidence, implementation, ...rest } = n;
-        return [
-            {
-                ...rest,
-                kind: n.kind,
-                ...(evidence !== undefined
-                    ? { evidence: spanIn(evidence, n.file) }
-                    : {}),
-                ...(implementation !== undefined
-                    ? { implementation: spanIn(implementation, n.file) }
-                    : {}),
-            },
-        ];
-    });
-    const edges = dump.edges.map((edge) => {
-        const { evidence, ...rest } = edge;
-        const from = moduleIds.get(edge.from);
-        return {
-            ...rest,
-            ...(from !== undefined ? { from: fileNodeId(from) } : {}),
-            ...(evidence !== undefined
-                ? { evidence: spanIn(evidence, fileOfNodeId(edge.from)) }
-                : {}),
-        };
-    });
-    // Index workspace nodes by (file, within-file key) so ownership can resolve a
-    // member to its declaring class/namespace.
-    const byFileKey = new Map();
-    for (const node of nodes) {
-        if (!node.external)
-            byFileKey.set(node.file + "\0" + keyOf(node), node);
-    }
-    const owner = (node) => {
-        const parent = ownerKey(node);
-        if (parent === undefined)
-            return undefined;
-        return byFileKey.get(node.file + "\0" + parent);
-    };
-    // Refine: a `variable` whose owner is a class or interface is a property.
-    for (const node of nodes) {
-        if (node.kind !== "variable" || node.external)
-            continue;
-        const parent = owner(node);
-        if (parent && (parent.kind === "class" || parent.kind === "interface")) {
-            node.kind = "property";
+function index(values, keys, previous) {
+    const result = new Map();
+    const counts = new Map();
+    const append = (key, value) => {
+        const count = counts.get(key) ?? 0;
+        let bucket = result.get(key);
+        if (bucket === undefined) {
+            bucket = previous?.get(key) ?? [];
+            result.set(key, bucket);
         }
-    }
-    // One file container node per distinct workspace source file, plus every file
-    // the dump saw an export surface on — a barrel declares nothing, so its only
-    // trace in the dump is its module node, and it is exactly the file a consumer
-    // imports the package from.
-    const fileNodes = new Map();
-    const addFileNode = (file) => {
-        if (file === "" || fileNodes.has(file))
-            return;
-        fileNodes.set(file, {
-            id: fileNodeId(file),
-            kind: "file",
-            name: basename(file),
-            file,
-            external: false,
-        });
+        if (bucket === previous?.get(key)) {
+            if (bucket[count] !== value) {
+                bucket = [...bucket.slice(0, count), value];
+                result.set(key, bucket);
+            }
+        }
+        else
+            bucket.push(value);
+        counts.set(key, count + 1);
     };
-    for (const node of nodes) {
-        if (node.external || (0, TtscGraphArtifactNodeKind_1.isArtifactNodeKind)(node.kind))
-            continue;
-        addFileNode(node.file);
-    }
-    for (const file of moduleFiles)
-        addFileNode(file);
-    // Ownership: a member is contained by its owner; a top-level declaration by
-    // its file. Exports are not synthesized here: the dump's `exports` edges come
-    // from the checker's export table, which follows re-exports and barrels, so
-    // they say which module puts a symbol on the wire. Deriving them from the
-    // `exported` flag instead would say only that the declaring file made it
-    // public, which is the fact that cannot tell a package's front door from its
-    // legacy subpath.
-    const structural = [];
-    for (const node of nodes) {
-        // An artifact is contained by the artifact its producer named, and by
-        // nothing when that producer named none. It is never contained by a `file`
-        // node: a document is already its own node, a Prisma address carries no
-        // path on purpose, and an API operation has no file at all.
-        if ((0, TtscGraphArtifactNodeKind_1.isArtifactNodeKind)(node.kind)) {
-            if (node.parent !== undefined && node.parent !== "")
-                structural.push({ from: node.parent, to: node.id, kind: "contains" });
-            continue;
+    for (const value of values) {
+        const selected = keys(value);
+        if (typeof selected === "string")
+            append(selected, value);
+        else {
+            for (const key of selected)
+                append(key, value);
         }
-        if (node.external || node.file === "")
-            continue;
-        const parent = owner(node);
-        const container = parent ? parent.id : fileNodeId(node.file);
-        structural.push({
-            from: container,
-            to: node.id,
-            kind: "contains",
-        });
     }
-    return {
-        nodes: [...nodes, ...fileNodes.values()],
-        edges: [...edges, ...structural],
-    };
+    for (const [key, bucket] of result) {
+        const count = counts.get(key);
+        if (bucket === previous?.get(key) && bucket.length !== count)
+            result.set(key, Object.freeze(bucket.slice(0, count)));
+        else if (bucket !== previous?.get(key))
+            Object.freeze(bucket);
+    }
+    return result;
 }
 //# sourceMappingURL=TtscGraphMemory.js.map

package/lib/model/TtscGraphMemory.js.map

@@ -1 +1 @@
-{"version":3,"file":"TtscGraphMemory.js","sourceRoot":"","sources":["../../src/model/TtscGraphMemory.ts"],"names":[],"mappings":";;;;;AAKA,uFAA6E;AAE7E,uDAAwD;AACxD,mEAAgE;AAEhE;;;;;;;;;;GAUG;AACH;IACmB,IAAI,CAA8B;IAClC,QAAQ,CAAgC;IACxC,OAAO,CAAgC;IACvC,WAAW,CAAgC;IAC3C,aAAa,CAAgC;IAC7C,cAAc,CAAgC;IAE/D,wDAAwD;IAC/C,OAAO,CAAS;IACzB,8EAA8E;IACrE,KAAK,CAA4B;IAC1C,oDAAoD;IAC3C,KAAK,CAA4B;IAC1C,4EAA4E;IACnE,MAAM,CAAwB;IAEvC,YACE,OAAe,EACf,KAAuB,EACvB,KAAuB,EACvB,UAAsC;QAEtC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,6CAAqB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAE7D,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/C,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;gBACzB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC1C,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;oBACrC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACjD,8DAA8D;gBAC9D,uEAAuE;gBACvE,iEAAiE;gBACjE,8DAA8D;gBAC9D,gEAAgE;gBAChE,IAAI,QAAQ,KAAK,SAAS;oBAAE,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;qBAC/D,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,MAAM,CAAC,IAAI,CAAC,IAAoB;QAC9B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC1E,CAAC;IAED,2CAA2C;IAC3C,IAAI,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,qDAAqD;IACrD,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IACrC,CAAC;IAED,oDAAoD;IACpD,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IACpC,CAAC;IAED,kDAAkD;IAClD,KAAK,CAAC,IAAY;QAChB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1C,CAAC;IAED,iFAAiF;IACjF,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC9C,CAAC;IAED,2DAA2D;IAC3D,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,MAAc;QACnB,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC/C,CAAC;CACF;;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CAAC,IAAoB;IAC3C,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAC1C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,6BACE,IAAwB;IAExB,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACxC,yEAAyE;IACzE,4EAA4E;IAC5E,kDAAkD;IAClD,OAAO,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;QACzD,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,sBAA6B,IAAwB;IACnD,MAAM,OAAO,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC;IAC7B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,SAAS,CAAC;IAC9D,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7D,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnC,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACrD,CAAC;AAED,gFAAgF;AAChF,SAAS,IAAI,CAAO,GAAgB,EAAE,GAAM,EAAE,KAAQ;IACpD,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,IAAI,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;QAC1B,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,IAAoB;IACjC,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,IAAI,CAAC;AACzC,CAAC;AAED;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,IAAoB;IACpC,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,KAAK,IAAI,CAAC,IAAI;QACtE,OAAO,SAAS,CAAC;IACnB,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1D,OAAO,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;AAC1C,CAAC;AAED,+DAA+D;AAC/D,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAC,IAAoB,EAAE,IAAY;IAChD,OAAO,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,EAAU;IAC9B,OAAO,IAAA,qCAAmB,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AACvC,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACpC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACnD,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,IAAoB;IAItC,6EAA6E;IAC7E,6EAA6E;IAC7E,8EAA8E;IAC9E,0EAA0E;IAC1E,oEAAoE;IACpE,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACjE,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CACzE,CAAC;IACF,4EAA4E;IAC5E,4EAA4E;IAC5E,0EAA0E;IAC1E,+EAA+E;IAC/E,6EAA6E;IAC7E,4EAA4E;IAC5E,wDAAwD;IACxD,MAAM,KAAK,GAAqB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAoB,EAAE;QACzE,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;QACnC,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QAChD,OAAO;YACL;gBACE,GAAG,IAAI;gBACP,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,GAAG,CAAC,QAAQ,KAAK,SAAS;oBACxB,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;oBACxC,CAAC,CAAC,EAAE,CAAC;gBACP,GAAG,CAAC,cAAc,KAAK,SAAS;oBAC9B,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,cAAc,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;oBACpD,CAAC,CAAC,EAAE,CAAC;aACR;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAqB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACtD,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC;QACnC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,OAAO;YACL,GAAG,IAAI;YACP,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,GAAG,CAAC,QAAQ,KAAK,SAAS;gBACxB,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE;gBACzD,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,8EAA8E;IAC9E,2CAA2C;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,IAAoB,EAA8B,EAAE;QACjE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC3C,OAAO,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC;IAClD,CAAC,CAAC;IAEF,0EAA0E;IAC1E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ;YAAE,SAAS;QACxD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,CAAC,EAAE,CAAC;YACvE,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QACzB,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,8EAA8E;IAC9E,4BAA4B;IAC5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,MAAM,WAAW,GAAG,CAAC,IAAY,EAAQ,EAAE;QACzC,IAAI,IAAI,KAAK,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO;QAC/C,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE;YAClB,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC;YACpB,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;YACpB,IAAI;YACJ,QAAQ,EAAE,KAAK;SAChB,CAAC,CAAC;IACL,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAA,8CAAkB,EAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7D,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,WAAW;QAAE,WAAW,CAAC,IAAI,CAAC,CAAC;IAElD,4EAA4E;IAC5E,8EAA8E;IAC9E,4EAA4E;IAC5E,0EAA0E;IAC1E,yEAAyE;IACzE,6EAA6E;IAC7E,kBAAkB;IAClB,MAAM,UAAU,GAAqB,EAAE,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,sEAAsE;QACtE,2EAA2E;QAC3E,wEAAwE;QACxE,4DAA4D;QAC5D,IAAI,IAAA,8CAAkB,EAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE;gBACjD,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YACxE,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE;YAAE,SAAS;QAChD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,UAAU,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,SAAS;YACf,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,UAAU;SACjB,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;QACxC,KAAK,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,UAAU,CAAC;KACjC,CAAC;AACJ,CAAC"}
+{"version":3,"file":"TtscGraphMemory.js","sourceRoot":"","sources":["../../src/model/TtscGraphMemory.ts"],"names":[],"mappings":";;;;;AAIA,+DAA4D;AAE5D,mEAAgE;AAKhE;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH;IAiCqB,UAAU;IAhCZ,QAAQ,CAGvB;IAEe,IAAI,CAA4B;IAChC,QAAQ,CAAuC;IAC/C,OAAO,CAAuC;IAC9C,WAAW,CAAuC;IAClD,aAAa,CAAuC;IACpD,cAAc,CAAuC;IAEtE,wDAAwD;IAC/C,OAAO,CAAS;IAEzB,8EAA8E;IACrE,KAAK,CAA0B;IAExC,oDAAoD;IAC3C,KAAK,CAA0B;IAExC,4EAA4E;IACnE,MAAM,CAAwB;IAEvC,YACE,OAAe,EACf,KAA8B,EAC9B,KAA8B,EAC9B,UAGa,EACI,UAAsC,EACvD,QAA0B;0BADT,UAAU;QAG3B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,uEAAuE;QACvE,oEAAoE;QACpE,IAAI,CAAC,MAAM,GAAG,IAAI,6CAAqB,CACrC,OAAO,EACP,UAAU,KAAK,SAAS;YACtB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC;gBACE,YAAY,EAAE,CAAC,GAAG,UAAU,CAAC,YAAY,CAAC;gBAC1C,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC;aAC7D,CACN,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,CAAC,QAAQ,CAAC,GAAG,CACf,IAAI,EACJ,QAAQ,IAAI;gBACV,OAAO,EACL,IAAI,CAAC,IAAI,KAAK,MAAM;oBAClB,CAAC,CAAC,EAAE;oBACJ,CAAC,CAAC,IAAI,CAAC,aAAa,KAAK,SAAS;wBAC9B,IAAI,CAAC,aAAa,KAAK,IAAI,CAAC,IAAI;wBAClC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC;wBACjC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACnB,OAAO,EAAE,eAAe,CAAC,IAAI,CAAC;aAC/B,CACF,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;QAC5E,IAAI,CAAC,aAAa,GAAG,KAAK,CACxB,KAAK,EACL,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,OAAO,EAC1C,QAAQ,EAAE,aAAa,CACxB,CAAC;QACF,IAAI,CAAC,cAAc,GAAG,KAAK,CACzB,KAAK,EACL,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,OAAO,EAC1C,QAAQ,EAAE,cAAc,CACzB,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACtE,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAClE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,MAAM,CAAC,IAAI,CAAC,IAAoB;QAC9B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,yCAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxD,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC1E,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,YAAY,CACjB,IAAuC,EACvC,QAA0B;QAE1B,MAAM,UAAU,GAAG,yCAAmB,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC1E,OAAO,IAAI,eAAe,CACxB,IAAI,CAAC,OAAO,EACZ,UAAU,CAAC,KAAK,EAChB,UAAU,CAAC,KAAK,EAChB,IAAI,CAAC,UAAU,EACf,UAAU,EACV,QAAQ,CACT,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,EAAU;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,EAAU;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;IACpC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,IAAY;QAChB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC9C,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC7D,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,MAAM,CAAC,MAAc;QACnB,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IAC/C,CAAC;CACF;;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CAAC,IAAkB;IACzC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACtB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,6BACE,IAAwB;IAExB,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACxC,yEAAyE;IACzE,4EAA4E;IAC5E,kDAAkD;IAClD,OAAO,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC;QACzD,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,sBAA6B,IAAwB;IACnD,MAAM,OAAO,GAAG,IAAI,EAAE,IAAI,EAAE,CAAC;IAC7B,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,EAAE;QAAE,OAAO,SAAS,CAAC;IAC9D,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7D,CAAC;IACD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACnC,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,KAAK,CACZ,MAAoB,EACpB,IAA8C,EAC9C,QAA4C;IAE5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,MAAM,GAAG,CAAC,GAAW,EAAE,KAAQ,EAAQ,EAAE;QAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,GAAG,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,MAAM,KAAK,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE,CAAC;gBAC5B,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC5C,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;;YAAO,MAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC;IACF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,OAAO,QAAQ,KAAK,QAAQ;YAAE,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;aACrD,CAAC;YACJ,KAAK,MAAM,GAAG,IAAI,QAAQ;gBAAE,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC/B,IAAI,MAAM,KAAK,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK;YAC1D,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;aACpD,IAAI,MAAM,KAAK,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAChE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}