@ttsc/graph 0.30.3 → 0.31.0

package/lib/model/TtscGraphProjection.js

@@ -0,0 +1,390 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TtscGraphProjection = void 0;
+const TtscGraphArtifactNodeKind_1 = require("../structures/TtscGraphArtifactNodeKind");
+const TtscGraphNodeId_1 = require("./TtscGraphNodeId");
+const copyGraphSnapshot_1 = require("./copyGraphSnapshot");
+/**
+ * Immutable structural projection components for validated resident facts.
+ *
+ * Node refinement and containment depend on all declarations in the same file;
+ * export reanchoring depends on the source node's module declaration. Grouping
+ * both raw nodes and source-owned edges by that file captures these
+ * dependencies, including metadata/artifact nodes sharing it. Global metadata
+ * invalidates all components, and complete generation order is reconstructed
+ * independently.
+ *
+ * @evidence contracts/common.md#principled-implementation Frozen raw reference sequences prove unchanged component inputs; all same-file declarations and source edges participate, so lexical collisions, module folding and artifact parents cannot borrow stale derived facts.
+ * @evidence contracts/common.md#clear-and-simple-design Full synthesis remains one implementation used by cold construction and invalidated components; create owns dependency partitioning and immutable component reuse.
+ * @evidence contracts/common.md#prohibited-implementation-shortcuts The store still validates the complete generation first. No content witness, owner or raw edge is skipped to obtain reuse, and public DTOs are never frozen by borrowing.
+ * @evidence contracts/common.md#meaningful-documentation Native prose explains actual synthesis dependencies, metadata invalidation and generation ordering rather than claiming universally delta-only work.
+ * @evidence contracts/performance.md#efficient-algorithms Grouping and generation ordering scan all raw references. Only changed file components synthesize outer records and detach/freeze nested facts once; metadata changes rebuild all. Reference arrays/maps remain linear in generation size.
+ * @evidence contracts/performance.md#reuse-equivalent-work Equal frozen node/edge sequences and equal project/config/producer/capability/universe metadata retain the component. Cross-file edge changes invalidate their owning component; target absence remains a store validation error.
+ * @evidence contracts/performance.md#bound-retention-and-release-resources Returned state retains only current file components and generation arrays; deleted components are omitted and no previous State reference is stored.
+ * @evidenceExclude contracts/portability.md#os-neutral-implementation In-memory fact coordinates and reference identity select reuse; no native filesystem or process operation runs here.
+ */
+var TtscGraphProjection;
+(function (TtscGraphProjection) {
+    /**
+     * Detach a caller's full dump before exposing synthesized immutable facts.
+     *
+     * Synthesis borrows nested facts synchronously and changes only new outer
+     * records. Final recursive copying detaches those facts before freezing or
+     * exposing the result, for mutable callers and frozen resident inputs alike.
+     *
+     * @evidence contracts/common.md#principled-implementation Readonly borrowed synthesis inputs preserve caller ownership; only fresh outer records change, and final recursive copying isolates every nested record before freezing and publication.
+     * @evidence contracts/common.md#clear-and-simple-design Cold models and invalidated components use the same synthesis implementation.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts Native export relations remain authoritative and no caller-owned DTO is frozen in place.
+     * @evidence contracts/common.md#meaningful-documentation Native prose states caller ownership, synchronous borrowing, construction-local changes and the final immutable publication boundary.
+     * @evidence contracts/performance.md#efficient-algorithms Synthesis scans facts and indexes owner handles; only colliding handles require candidate scans. One final recursive copy costs the selected fact population's nested bytes, without an intermediate mutable DTO copy.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work This operation constructs a supplied population; create selects components requiring construction.
+     * @evidence contracts/performance.md#bound-retention-and-release-resources The returned frozen facts transfer to the model/component owner; no historical state is retained here.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation In-memory synthesis and copying perform no native operations.
+     */
+    function full(dump) {
+        return (0, copyGraphSnapshot_1.copyGraphSnapshot)(synthesize(dump));
+    }
+    TtscGraphProjection.full = full;
+    /**
+     * Reuse only components with the same complete synthesis input sequence.
+     *
+     * The caller supplies store-owned frozen facts after complete validation.
+     * Same-file declarations determine lexical owners and module anchors; source
+     * edges belong to that same component. Output ordering remains
+     * generation-wide.
+     *
+     * @evidence contracts/common.md#principled-implementation Complete ordered raw inputs and global metadata qualify each component. Synthesis dependencies are local to a node's file, while cross-file edge target existence has already been validated by the store.
+     * @evidence contracts/common.md#clear-and-simple-design Partitioning, component selection and global output ordering are separate stages; full owns the shared synthesis implementation.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts Every raw node and source edge participates; no ownership, provenance or manifest validation is skipped and no native relation is invented.
+     * @evidence contracts/common.md#meaningful-documentation Native paragraphs explain the frozen-input premise and why same-file declarations and source edges form the dependency boundary.
+     * @evidence contracts/performance.md#efficient-algorithms Linear reference grouping/equality and generation ordering remain necessary. Invalidated components borrow nested inputs during synthesis and detach/freeze once at full's publication boundary, with temporary maps/arrays proportional to current facts.
+     * @evidence contracts/performance.md#reuse-equivalent-work Exact raw reference sequences plus project/config/schema/capability/producer/universe metadata retain equivalent components. Changed owner declarations or source relations invalidate the whole dependent file component.
+     * @evidence contracts/performance.md#bound-retention-and-release-resources New state retains only current components and output arrays; deleted components disappear and no previous state is linked.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation Fact coordinates select in-memory groups; no filesystem or process operation interprets them.
+     */
+    function create(dump, previous) {
+        const metadata = JSON.stringify({
+            project: dump.project,
+            tsconfig: dump.tsconfig,
+            schemaVersion: dump.provenance.schemaVersion,
+            capabilities: dump.provenance.capabilities,
+            producer: dump.provenance.producer,
+            artifactProducer: dump.provenance.artifactProducer,
+            universe: dump.provenance.universe,
+        });
+        const inputs = new Map();
+        const files = new Map();
+        for (const node of dump.nodes) {
+            let input = inputs.get(node.file);
+            if (input === undefined) {
+                input = { nodes: [], edges: [] };
+                inputs.set(node.file, input);
+            }
+            input.nodes.push(node);
+            files.set(node.id, node.file);
+        }
+        for (const edge of dump.edges)
+            inputs.get(files.get(edge.from)).edges.push(edge);
+        const components = new Map();
+        for (const [file, input] of inputs) {
+            const old = metadata === previous?.metadata
+                ? previous.components.get(file)
+                : undefined;
+            if (old !== undefined &&
+                same(input.nodes, old.rawNodes) &&
+                same(input.edges, old.rawEdges)) {
+                components.set(file, old);
+                continue;
+            }
+            const projected = full(input);
+            const count = input.nodes.filter((node) => node.kind !== "module").length;
+            components.set(file, {
+                rawNodes: Object.freeze(input.nodes),
+                rawEdges: Object.freeze(input.edges),
+                nodes: new Map(projected.nodes.slice(0, count).map((node) => [node.id, node])),
+                file: projected.nodes[count],
+                edges: new Map(input.edges.map((edge, index) => [edge, projected.edges[index]])),
+                structural: new Map(projected.edges
+                    .slice(input.edges.length)
+                    .map((edge) => [edge.to, edge])),
+            });
+        }
+        const nodes = [];
+        const structural = [];
+        const containers = new Set();
+        for (const node of dump.nodes) {
+            if (node.kind === "module")
+                continue;
+            const component = components.get(node.file);
+            nodes.push(component.nodes.get(node.id));
+            const edge = component.structural.get(node.id);
+            if (edge !== undefined)
+                structural.push(edge);
+            if (!node.external && !(0, TtscGraphArtifactNodeKind_1.isArtifactNodeKind)(node.kind) && node.file !== "")
+                containers.add(node.file);
+        }
+        for (const node of dump.nodes)
+            if (node.kind === "module" && node.file !== "")
+                containers.add(node.file);
+        for (const file of containers)
+            nodes.push(components.get(file).file);
+        const edges = dump.edges.map((edge) => components.get(files.get(edge.from)).edges.get(edge));
+        for (const edge of structural)
+            edges.push(edge);
+        return Object.freeze({
+            metadata,
+            components,
+            nodes: Object.freeze(nodes),
+            edges: Object.freeze(edges),
+        });
+    }
+    TtscGraphProjection.create = create;
+})(TtscGraphProjection || (exports.TtscGraphProjection = TtscGraphProjection = {}));
+/** Reference order is part of synthesis and query result identity. */
+function same(left, right) {
+    return (left.length === right.length &&
+        left.every((value, index) => value === right[index]));
+}
+/** Append to a construction-local bucket; published outputs are frozen later. */
+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. Merged declarations can share this
+ * handle; declaration ranges disambiguate their member ownership.
+ */
+function keyOf(node) {
+    return node.qualifiedName ?? node.name;
+}
+/**
+ * The owner key derived from facts the producer serialized separately.
+ *
+ * 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.
+ * Object keys containing dots, brackets or no characters carry a JSON bracket
+ * suffix, keeping their identity distinct from nested object ownership.
+ */
+function ownerKey(node) {
+    if (node.qualifiedName === undefined || node.qualifiedName === node.name)
+        return undefined;
+    const suffix = `.${node.name}`;
+    let owner;
+    if (node.qualifiedName.endsWith(suffix)) {
+        owner = node.qualifiedName.slice(0, -suffix.length);
+    }
+    else if (node.qualifiedName.endsWith('"]')) {
+        // The native producer brackets reserved/empty object keys using JSON. Find
+        // the opening string quote without treating an escaped quote inside the
+        // key as a boundary; JSON decoding accepts equivalent Unicode escapes.
+        const qualified = node.qualifiedName;
+        for (let index = qualified.length - 3; index > 0; index--) {
+            if (qualified[index] !== '"')
+                continue;
+            let escapes = 0;
+            for (let before = index - 1; before >= 0 && qualified[before] === "\\"; before--)
+                escapes++;
+            if (escapes % 2 !== 0)
+                continue;
+            if (qualified[index - 1] !== "[")
+                break;
+            try {
+                if (JSON.parse(qualified.slice(index, -1)) === node.name)
+                    owner = qualified.slice(0, index - 1);
+            }
+            catch {
+                // A malformed qualified coordinate proves no owner.
+            }
+            break;
+        }
+    }
+    return owner === "" ? undefined : owner;
+}
+/** Prove lexical ownership using complete same-file declaration coordinates. */
+function enclosesDeclaration(owner, member) {
+    const outer = owner.evidence;
+    const inner = member.evidence;
+    if (outer === undefined ||
+        inner === undefined ||
+        outer.file !== inner.file ||
+        outer.startCol === undefined ||
+        outer.endLine === undefined ||
+        outer.endCol === undefined ||
+        inner.startCol === undefined ||
+        inner.endLine === undefined ||
+        inner.endCol === undefined)
+        return false;
+    return ((outer.startLine < inner.startLine ||
+        (outer.startLine === inner.startLine &&
+            outer.startCol <= inner.startCol)) &&
+        (outer.endLine > inner.endLine ||
+            (outer.endLine === inner.endLine && outer.endCol >= inner.endCol)));
+}
+/** 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).
+ */
+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]));
+    // Create outer 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)
+            push(byFileKey, node.file + "\0" + keyOf(node), node);
+    }
+    const owners = new Map();
+    const owner = (node) => {
+        if (owners.has(node))
+            return owners.get(node);
+        const parent = ownerKey(node);
+        const candidates = parent === undefined
+            ? undefined
+            : byFileKey.get(node.file + "\0" + parent);
+        // A unique checker handle also owns merged namespace members outside its
+        // primary declaration span. Only a colliding handle needs lexical evidence.
+        // Ambiguous or incomplete ranges prove no declaration owner; retain file
+        // containment rather than assigning an arbitrary merged declaration.
+        const enclosing = candidates?.length === 1
+            ? candidates
+            : candidates?.filter((candidate) => enclosesDeclaration(candidate, node));
+        const selected = enclosing?.length === 1 ? enclosing[0] : undefined;
+        owners.set(node, selected);
+        return selected;
+    };
+    // 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";
+        }
+    }
+    // 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,
+        });
+    };
+    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;
+        }
+        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],
+    };
+}
+//# sourceMappingURL=TtscGraphProjection.js.map

package/lib/model/TtscGraphProjection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TtscGraphProjection.js","sourceRoot":"","sources":["../../src/model/TtscGraphProjection.ts"],"names":[],"mappings":";;;AAKA,uFAA6E;AAC7E,uDAAwD;AAExD,2DAAwD;AAExD;;;;;;;;;;;;;;;;;;GAkBG;AACH,IAAiB,mBAAmB,CAuJnC;AAvJD,WAAiB,mBAAmB;IA2BlC;;;;;;;;;;;;;;;OAeG;IACH,SAAgB,IAAI,CAClB,IAAgE;QAEhE,OAAO,IAAA,qCAAiB,EAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7C,CAAC;IAJe,oBAAA,IAAI,OAInB,CAAA;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,SAAgB,MAAM,CACpB,IAAuC,EACvC,QAAgB;QAEhB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;YAC9B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,aAAa,EAAE,IAAI,CAAC,UAAU,CAAC,aAAa;YAC5C,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,YAAY;YAC1C,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,QAAQ;YAClC,gBAAgB,EAAE,IAAI,CAAC,UAAU,CAAC,gBAAgB;YAClD,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,QAAQ;SACnC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkD,CAAC;QACzE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;gBACjC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC/B,CAAC;YACD,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAC3B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACnC,MAAM,GAAG,GACP,QAAQ,KAAK,QAAQ,EAAE,QAAQ;gBAC7B,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;gBAC/B,CAAC,CAAC,SAAS,CAAC;YAChB,IACE,GAAG,KAAK,SAAS;gBACjB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC,EAC/B,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC1B,SAAS;YACX,CAAC;YACD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;YAC1E,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE;gBACnB,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;gBACpC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;gBACpC,KAAK,EAAE,IAAI,GAAG,CACZ,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAC/D;gBACD,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC;gBAC5B,KAAK,EAAE,IAAI,GAAG,CACZ,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,CAAC,CAClE;gBACD,UAAU,EAAE,IAAI,GAAG,CACjB,SAAS,CAAC,KAAK;qBACZ,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;qBACzB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAClC;aACF,CAAC,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAAwC,EAAE,CAAC;QACtD,MAAM,UAAU,GAAwC,EAAE,CAAC;QAC3D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,SAAS;YACrC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;YAC7C,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/C,IAAI,IAAI,KAAK,SAAS;gBAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAA,8CAAkB,EAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE;gBACtE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE;gBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5E,KAAK,MAAM,IAAI,IAAI,UAAU;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAK,CAAC,CAAC;QACvE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAC1B,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAE,CAClE,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,UAAU;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,OAAO,MAAM,CAAC,MAAM,CAAC;YACnB,QAAQ;YACR,UAAU;YACV,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YAC3B,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC;IApFe,oBAAA,MAAM,SAoFrB,CAAA;AACH,CAAC,EAvJgB,mBAAmB,aAAnB,mBAAmB,GAAnB,mBAAmB,QAuJnC;AAkBD,sEAAsE;AACtE,SAAS,IAAI,CAAI,IAAkB,EAAE,KAAmB;IACtD,OAAO,CACL,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;QAC5B,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,CACrD,CAAC;AACJ,CAAC;AAED,iFAAiF;AACjF,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,IAAuC;IACpD,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,IAAI,CAAC;AACzC,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,QAAQ,CAAC,IAAuC;IACvD,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,KAAyB,CAAC;IAC9B,IAAI,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACxC,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACtD,CAAC;SAAM,IAAI,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,2EAA2E;QAC3E,wEAAwE;QACxE,uEAAuE;QACvE,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,KAAK,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YAC1D,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG;gBAAE,SAAS;YACvC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KACE,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,EACtB,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,CAAC,KAAK,IAAI,EACzC,MAAM,EAAE;gBAER,OAAO,EAAE,CAAC;YACZ,IAAI,OAAO,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAChC,IAAI,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG;gBAAE,MAAM;YACxC,IAAI,CAAC;gBACH,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI;oBACtD,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC1C,CAAC;YAAC,MAAM,CAAC;gBACP,oDAAoD;YACtD,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;AAC1C,CAAC;AAED,gFAAgF;AAChF,SAAS,mBAAmB,CAC1B,KAAwC,EACxC,MAAyC;IAEzC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC;IAC9B,IACE,KAAK,KAAK,SAAS;QACnB,KAAK,KAAK,SAAS;QACnB,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;QACzB,KAAK,CAAC,QAAQ,KAAK,SAAS;QAC5B,KAAK,CAAC,OAAO,KAAK,SAAS;QAC3B,KAAK,CAAC,MAAM,KAAK,SAAS;QAC1B,KAAK,CAAC,QAAQ,KAAK,SAAS;QAC5B,KAAK,CAAC,OAAO,KAAK,SAAS;QAC3B,KAAK,CAAC,MAAM,KAAK,SAAS;QAE1B,OAAO,KAAK,CAAC;IACf,OAAO,CACL,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS;QAChC,CAAC,KAAK,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;YAClC,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO;YAC5B,CAAC,KAAK,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CACrE,CAAC;AACJ,CAAC;AAED,+DAA+D;AAC/D,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CACb,IAAuC,EACvC,IAAY;IAEZ,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,CACjB,IAAgE;IAKhE,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,mFAAmF;IACnF,4EAA4E;IAC5E,0EAA0E;IAC1E,+EAA+E;IAC/E,6EAA6E;IAC7E,4EAA4E;IAC5E,wDAAwD;IACxD,MAAM,KAAK,GAAsB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAqB,EAAE;QAC3E,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,GAAwC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACzE,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,EAA6B,CAAC;IACvD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgD,CAAC;IACvE,MAAM,KAAK,GAAG,CAAC,IAAqB,EAA+B,EAAE;QACnE,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,UAAU,GACd,MAAM,KAAK,SAAS;YAClB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC;QAC/C,yEAAyE;QACzE,4EAA4E;QAC5E,yEAAyE;QACzE,qEAAqE;QACrE,MAAM,SAAS,GACb,UAAU,EAAE,MAAM,KAAK,CAAC;YACtB,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAC/B,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,CACrC,CAAC;QACR,MAAM,QAAQ,GAAG,SAAS,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACpE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC3B,OAAO,QAAQ,CAAC;IAClB,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"}

package/lib/model/TtscGraphProtocol.d.ts

@@ -0,0 +1,28 @@
+import { ITtscGraphSnapshot } from "../structures/ITtscGraphSnapshot";
+/**
+ * Decode the graph serve envelope before any state or body facts are consumed.
+ *
+ * @evidence contracts/common.md#principled-implementation JSON framing, protocol agreement and generated complete-envelope validation precede typed state admission.
+ * @evidence contracts/common.md#clear-and-simple-design The decoder owns the wire contract; state owns correlation and generation semantics after this boundary.
+ * @evidence contracts/common.md#prohibited-implementation-shortcuts The installed typia transform validates the declared envelope rather than a partial cast or handwritten schema replacement.
+ * @evidence contracts/common.md#meaningful-documentation Native comments explain why protocol agreement must precede shape validation and why routing fields belong in the envelope.
+ * @evidenceExclude contracts/performance.md#efficient-algorithms decode owns JSON and generated envelope validation; the namespace adds no processing algorithm.
+ * @evidenceExclude contracts/performance.md#reuse-equivalent-work decode validates each submitted line, while state establishes reuse of graph generations.
+ * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources The namespace retains no decoded frame or native handle; its caller owns typed results.
+ * @evidenceExclude contracts/portability.md#os-neutral-implementation a JSON line decoder; it reads no file, path or process.
+ */
+export declare namespace TtscGraphProtocol {
+    /**
+     * Decode one line or throw the owned framing/version/schema diagnostic.
+     *
+     * @evidence contracts/common.md#principled-implementation JSON parsing precedes protocol agreement and generated complete-envelope validation, so no field is routed before its declared wire contract holds.
+     * @evidence contracts/common.md#clear-and-simple-design This single decoder supplies typed inputs to state; state owns pending correlation, schema body agreement and generation semantics.
+     * @evidence contracts/common.md#prohibited-implementation-shortcuts Installed typia validates the whole declared envelope rather than a handwritten partial guard or a fabricated trusted frame.
+     * @evidence contracts/common.md#meaningful-documentation The headline states owned failure behavior; private comments explain version-before-shape and routing-field validation.
+     * @evidence contracts/performance.md#efficient-algorithms JSON parsing and generated field traversal process the line and carried graph facts linearly; no project, directory or historical-frame scan occurs.
+     * @evidenceExclude contracts/performance.md#reuse-equivalent-work Each submitted wire line requires validation; graph state alone coordinates current-model reuse.
+     * @evidenceExclude contracts/performance.md#bound-retention-and-release-resources Parsed values and error text are local; the typed result transfers to state and no native reader, child or frame history is retained.
+     * @evidenceExclude contracts/portability.md#os-neutral-implementation parses one line of JSON text and validates it; no file, path or process.
+     */
+    function decode(line: string): ITtscGraphSnapshot;
+}