@inventarch/graph 0.0.0-stage → 1.1.0

package/LANGUAGE.md

@@ -0,0 +1,56 @@
+# Public IA language
+
+IA records declare typed identities, fields and relationships. Owning canonical schemas define the structural contract; language syntax and reference resolution preserve those declarations.
+
+The selected vocabulary below is shared by this release. Use `ia vocabulary --json` for its attributed catalogue and `ia vocabulary --schema` for canonical field schemas. `ia validate` reports structural and evaluated evidence separately. An admitted declaration does not establish semantic quality or grant execution authority.
+
+Spec source locators do not load documents. Resource capture and disclosure require explicit selection, matching pins and a host-owned disclosure boundary. Model, operation, evaluator and authority callbacks belong to the application host.
+
+| Word | Owner | Meaning |
+| --- | --- | --- |
+| @agent | agent-system | Names a participant and the vocabulary to which its governance applies. It does not grant host permissions. |
+| @agent-profile | agent-composition-system | Composes an agent, capabilities, optional mandate/voice/delegates and installed execution contracts. |
+| @artifact-set | taxonomy | Defines a closed grouping of artifact genres. |
+| @authoring-guide | authoring-system | Associates a vocabulary owner and schema with an authoring reference and usage guidance. |
+| @axis | taxonomy | Defines a closed coordinate axis for selection. |
+| @capability | agent-composition-system | Groups operations, procedures, templates, checks and included capabilities with declared execution bounds. |
+| @cardinality | taxonomy | Defines relationship multiplicity constraints. |
+| @case | compliance-system | Declares scenario inputs, expected behavior and evaluator attribution. A declaration is not an observed test result. |
+| @category | taxonomy | Defines a closed concept classification used by record shapes and contextual selection. |
+| @check | compliance-system | Names a check implementation and scope. Declaring an implementation name does not install or execute it. |
+| @contract | compliance-system | Names versioned requirements that may be adopted by other records. Requirements need explicit evaluation evidence. |
+| @convention | governance-system | Declares a convention in the shared governance shape. |
+| @decision | work-system | Represents a choice that is needed or has been made: the question, options and decider, and once made, the choice and rationale. |
+| @dimension | taxonomy | Defines a supported record dimension used by conditions and lookup. |
+| @distribution | workspace-system | Declares root records from which a distributable closure is selected. |
+| @execution-binding | agent-composition-system | Connects a native target to a host-installed entry or operation descriptor. |
+| @harness | agent-composition-system | Composes profiles and execution bindings in a workspace under a host contract. |
+| @hook | hook-authoring-system | Represents a host event, tool/path selection and guard message. Registration and executing a guard require a host adapter. |
+| @improvement | learning-system | Represents a proposed change, review metadata and publication metadata. It does not authorize or apply the proposal. |
+| @intent-shape | taxonomy | Defines a request framing and its retrieval defaults. |
+| @kind | taxonomy | Defines a closed semantic role for records; lowering determines the role of each registered word. |
+| @lane | taxonomy | Defines a retrieval lane associated with record kinds. |
+| @law | governance-system | Declares a rule with severity. Structural admission cannot establish the truth or suitability of its prose. |
+| @mandate | agent-system | States bounded authority and conditions for a participant. Host authorization remains independent. |
+| @milestone | work-system | Represents an outcome with an exit criterion inside exactly one plan; it names a condition, not the work toward it. |
+| @move | taxonomy | Defines the closed classification of an agent action or activity. |
+| @observation | learning-system | Represents an attributed evidence account with interpretation and retention metadata. Evidence claims are not verified by field typing. |
+| @operation | authoring-system | Binds a declared operation to an implementation/input/output/effect contract; the host installs implementations. |
+| @phase | taxonomy | Defines a cognitive phase coordinate: orient, plan, act or learn. |
+| @placement | taxonomy | Defines source authority and reach metadata. |
+| @plan | work-system | Represents an arrangement of milestones toward an intent; it heads the work hierarchy and has no parent. Plans do not nest. |
+| @playbook | governance-system | Represents a procedure as phase/primitive cells. Cell delivery is generic; the authored method belongs to its author. |
+| @predicate | taxonomy | Defines a directed relationship and its inverse spelling. |
+| @primitive | taxonomy | Defines a cognitive primitive coordinate; a cell is selected using its phase and primitive. |
+| @principle | governance-system | Declares a governing rationale in the shared governance shape. |
+| @run | session-system | Represents a governed run identity, declared phase, status and owner. Declaration does not start execution. |
+| @schema | floor | Declares the structural contract for exactly one registered discriminator. |
+| @spec | work-system | Represents a maintained specification with explicit status and at most one same-word supersession. Contents and document membership belong to its author; a source locator does not load a body or prove semantic quality. |
+| @system | floor | Registers vocabulary, direct system dependencies, a local steward and consent for relationships. |
+| @task | work-system | Represents one owner's action toward exactly one milestone. Whether it is ready to start is computed by a work evaluator, never stored on the record. |
+| @template | template-system | Represents bounded rendering inputs and output structure. Rendering does not publish or install output. |
+| @value-type | taxonomy | Defines the field types that schemas may require. |
+| @voice | agent-composition-system | Declares communication attributes separate from authority and procedure. |
+| @workspace | workspace-system | Groups systems into an explicit work boundary; relationships can describe dependencies between boundaries. |
+
+This guide describes the selected structural vocabulary. Private expert procedures, live provider behavior and unobserved platform qualification are separate from the installed public contract.

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,4 @@
+InventArch
+Copyright (c) 2026 InventArch contributors
+
+Licensed under the Apache License, Version 2.0. See LICENSE.

package/README.md

@@ -1,3 +1,5 @@
-# Temporary Holding Version
+# @inventarch/graph
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+The pure graph layer consumes compiled IA records and an explicit registry. [SPEC.md](SPEC.md) owns behavior and implementation status. The package provides immutable graph construction, reach/phase authority resolution, occurrence and relationship indexes, a derived typed field-reference index kept apart from the edges, revision hashing, and coordinate/dimension validation. Conditions, selectors, variant and cell selection, and scoped breadth-first traversal consume those products. search(graph, text, scope) ranks decoded content using BM25 with scope-local statistics.
+
+The package depends on @inventarch/language and uses node:crypto only for deterministic SHA-256. It performs no filesystem I/O, clock reads, source parsing, cache publication or model/tool execution. Decoded prose search is implemented here; IA lexical analysis stays in language.

package/SPEC.md

@@ -0,0 +1,53 @@
+# Graph specification
+
+Bounded traversal extension (Workbench): optional `maxNodes`/`maxEdges` retain normal authority, scope, direction and condition behavior while bounding emitted records and edge examination. A bounded result reports `truncated`; callers must not describe it as a complete graph. Calls without limits preserve the original contract.
+
+Status: G01–G11 implemented under the graph plan. Shared concepts: graph/matrix design. Pure Node-compatible package depending only on @inventarch/language; no filesystem, clock, default registry or source-text lexer. Task-delivery paragraphs below retain historical counts and next steps; current readiness covers the completed downstream consumers.
+
+## Construction and revision
+
+G01. `load(records, registry, options)` returns an immutable Graph containing source diagnostics. Options explicitly supply revision sources, language version, kernel digest, view location and optional phase. A revision source has path, text and Location. `revisionOf` SHA-256 hashes sorted canonical source paths/raw text/placement/provenance, stable registry serialization, language version and kernel digest. Any byte or semantic input change affects the revision. Location/phase identify a view and do not change corpus revision. Duplicate source paths and inconsistent caller-supplied registration/identity/placement are TypeErrors, not authored syntax diagnostics.
+
+G02. Graph snapshots all inputs and exposes read-only collection views backed by inaccessible copies; casting a ReadonlyMap to Map must not make mutation possible. Nested record/schema/registry arrays and objects are frozen copies. `serialize(graph)` has total stable ordering independent of source, record and map insertion order. Object keys sort by code point, maps by serialized key, sets by serialized value. Source text is revision input, never re-lexed here. SHA-256 uses the pure deterministic node:crypto hash API.
+
+G03. Canonical reach/location roots are corpus-relative paths using language canonicalPath with an empty-root sentinel. Above-root traversal or absolute roots are usage errors. Empty reach covers every location; a nonempty reach covers itself and segment-boundary descendants only. Validate each record's placement kind/band pair. Provenance never determines authority.
+
+## Authority and indexes
+
+G04. Filter occurrences by reach and optional phase before authority. For phase applicability, any selector group without a phase term admits every phase; otherwise the record admits the union of its groups' phase values. No selectors or an omitted phase imposes no phase filter. At each identity the unique highest-band applicable occurrence wins. A highest-band tie refuses every tied participant with IDENTITY-TIE and admits no lower fallback. Differing overlapping reaches do not break ties. Retain all source occurrences, explicit shadows and ties separately; nodes is a winners-only identity map. Out-of-reach/phase occurrences remain inspectable but unindexed.
+
+G05. Build byName, byDiscriminator, byKind, bySystem, byCategory and byLane postings from winners; category comes from the registration and lane from the validated kernel kind mapping (contract@authority maps authority). Index cells at phase/primitive, selector axis/value groups and all condition terms from cells/edges/variants/requirements. Classification is an optional single head artifact-set field, a scalar/string closed value. Severity is an optional single governance.severity scalar/string closed value. Unknown, malformed or repeated dimension declarations refuse that record with DIMENSION-UNKNOWN. Provenance is the compiled loader-supplied value. Prose/gloss fields never supply routing coordinates.
+
+G06. Resolve every authored edge through language.resolveTarget against winners, including formerly dangling edges. Normalize inverse direction into active endpoints; retain author identity, typed reference, fragment, condition subject (the author), spans and source assertions. A missing endpoint is null: ordinary edges remain under out[author], inverse edges under in[author]. Both forms remain in dangling and a byDanglingReference index. More than one candidate refuses the edge with TARGET-AMBIGUOUS; zero retains it with TARGET-MISSING warning. Resolve API reports these graph codes without candidate-order selection.
+
+G06a. Derive `references`, a typed field-reference index beside the edges, from every typed ref value a winner holds in its head or sections, list items and nested fields included. Each `FieldReference` carries `from` (the holder), `to` (the resolved winner), `field` (the compiler's field path: `head.steward`, `composition.mandate`, `binding.target`, or the bare section name for a section-level item), the authored `reference` and the holder's source span. Targets resolve through the same resolve API as edges; an unresolved or ambiguous ref is omitted without a graph diagnostic, because compliance reports it (IA-COMP-FIELD-REF-MISSING). The `relationships` section is skipped by name, so a consent-refused assertion never reappears as a reference, and a ref inside the span of an edge the compiler already lowered (a floor `@system` `discriminators` entry's `ground`) is skipped, so no authored ref is both an edge and a reference. A field reference carries no predicate and is never consent-, cardinality- or COMP-checked; `edges`, `in`, `out`, `dangling`, diagnostics and revision are unchanged by it. `referencedBy` keys `references` by target. Ordering is total over from, field, to, source path/line and the serialized reference, independent of input order; equal entries are stored once.
+
+G07. Check both word owners' consent on each resolved edge in active direction, reporting only the first refusing side as EDGE-UNCONSENTED. The exact unconditioned, fragmentless system-to-registered-schema ground assertion generated by registration bypasses ledgers as specified by language S07; no other ground edge is exempt. Store equivalent unconditioned edges once, retaining every source assertion. Conditioned edges also key by condition subject, because equal terms authored on different records may see different dimensions. Sort edges by endpoints/predicate/fragment/condition/author/source for a total order.
+
+G07a. Reuse language S07a's fixed incoming whole-schema citation permission when an edge resolves across inputs. Pass the actual logical target endpoint's fragment to consent, preserving inverse references on the other endpoint. The source ledger remains required; missing/ambiguous targets retain their existing outcomes. No additional ground or authority exemption is introduced.
+
+A fragment still addresses the originally referenced record after inverse normalization. Edges therefore retain fragmentEndpoint (from for an inverse assertion, to for an outbound assertion), preventing an inverse fragment from being misapplied to its author.
+
+## Coordinates and queries
+
+G08. A graph coordinate is a partial mapping of closed routing axes plus severity/provenance to values. validateCoordinate canonicalizes case-insensitive values using language tables and rejects unknown names/values as COORDINATE-VALUE-UNKNOWN. Public query methods reject invalid coordinates with a typed GraphUsageError. Missing routing axes cannot satisfy conditions. Conditions read severity as max(subject severity, request severity), provenance from the subject, and artifact-set from its classification; other axes come from the request. Selector terms, including artifact-set, match the request. No default dimensions are invented.
+
+G09. selectors(record, coordinate) reports matched, neutral or disqualified. Groups are OR; terms within a group are AND. A fully supplied matching group establishes matched with its maximum term count. No selectors or an uncontradicted group with missing values yields neutral; all groups contradicted by at least one supplied value yields disqualified. This affects retrieval, never parses a meaning gloss. variants selects the highest-specificity applicable clause in each key family; equal maxima report VARIANT-AMBIGUOUS and select none for that family. A conditional exact cell that does not apply cannot suppress a valid primary fallback. Cell selection returns exact, primary or absent for one record/coordinate.
+
+G10. traverse(graph, options) performs breadth-first traversal from a declared start list. follow verbs use the exact language table and imply direction; direction is consulted only if follow is absent. Depth is an integer 0..8, otherwise TRAVERSAL-INVALID. Unknown verb is VERB-UNKNOWN. Scope is an allowed identity set and prunes starts, endpoints and traversal; an out-of-scope intermediary cannot expose its descendants. A filter prunes nodes by kind/discriminator/system using typed data. Missing starts yield no walk. Cycles terminate. With a coordinate, false conditions go to gated and are not crossed/returned as followed; without one, conditioned edges may be traversed with their conditions retained. Expose dangling separately. Nodes order by depth/identity, via by from/predicate/direction/target, edges by G07's total order.
+
+G11. search(graph, text, scope?) is graph-owned BM25 over decoded names, field/item text, references and semantic products without indexing the same body text twice. Preserve donor NFKC/lowercase/NFD mark removal, Unicode letter/digit tokens of 2..64 characters, donor stopwords, k1=1.2 and b=.75. Query terms deduplicate. Statistics N/df/average length are computed over the allowed scope, never hidden records. Return positive scores sorted descending then identity. Text tokenization is over decoded prose/query strings, not IA source syntax. Expose no mutable postings.
+
+## Diagnostics, evidence and boundaries
+
+Graph source codes use IA-GRAPH-IDENTITY-TIE, TARGET-MISSING, TARGET-AMBIGUOUS, EDGE-UNCONSENTED and DIMENSION-UNKNOWN. Query errors use IA-GRAPH-COORDINATE-VALUE-UNKNOWN, VERB-UNKNOWN, TRAVERSAL-INVALID and VARIANT-AMBIGUOUS; root normalization uses SCOPE-INVALID. Source diagnostic shape matches language with the graph namespace; errors refuse their stated subject, warnings retain evidence. Fragments are retained but compliance owns existence. Graph performs no scenario execution, caching, scope-token issuance, ranking into runtime packets or model/tool dispatch. Public evidence must distinguish these boundaries.
+
+Each task records native success/refusal, permutation/immutability and public-consumer evidence here. Native taxonomy/system records, the authoring playbook, law and check provide the normal path; overlays and malformed coordinates provide adversarial cases. Central exact-cell/primary examples use separate records to avoid double-delivery. Raising severity uses an advisory fixture, because a blocking subject is already blocking without a request override.
+
+Task 1 delivered: public revision, root/reach and coordinate/dimension APIs; internal immutable snapshots and stable typed collection serialization. 39 graph tests cover native inputs, source/registry/placement/provenance/kernel/version revision changes, mutation resistance, invalid coordinates and scope escape variants. Workspace tests/typecheck/build passed; graph load/index/query tasks remain pending.
+
+Task 2 delivered: immutable graph load, winner-only indexes with retained occurrences/shadows/ties, active-direction relationships, dangling references and consent rechecks. 57 graph tests and the complete 1401-test workspace suite pass, with typecheck/build/kernel check. Native graph: 153 records, 26 structural grounds, zero diagnostics. Contextual queries and text search remain pending.
+
+Task 3 delivered: conditions, selectors, variants, cell selection and breadth-first traversal. Traversal defaults to depth 1 and both directions when follow is absent; an explicit empty follow list crosses no edges. Via entries describe shortest-path hops, while followed edges retain cycles without revisiting nodes. Scope and typed filters prune before any edge emission, including gated edges. Query results are immutable. 86 graph tests and 1430 workspace tests/45 files pass with typecheck/build/kernel check.
+
+Task 4 delivered: immutable decoded-text postings and scoped BM25. The name is indexed once using displayName, along with the discriminator, nested compiled field/item/list/reference values and semantic text not already represented at its source line. Field keys and source syntax are not lexed. Search results preserve query-term order, deduplicate terms and exclude nonexistent scope identities from statistics. 92 graph tests; 1440 workspace tests/47 files, typecheck/build, native/kernel and dependency checks pass. The emitted-declaration/built-runtime consumer admits all 153 native nodes and exercises exact cells, variants, inverse gating, scoped search and immutable views. Graph G01–G11 are delivered; scenario execution, scoped capability tokens, caches and runtime packet assembly retain their downstream owners.

package/dist/coordinate.d.ts

@@ -0,0 +1,14 @@
+import type { ArtifactSet, CompiledRecord, ConditionAxis, KernelSeverity, Provenance } from '@inventarch/language';
+import type { GraphDiagnostic } from './diagnostics.js';
+export type Coordinate = Readonly<Partial<Record<ConditionAxis, string>>>;
+export interface Dimensions {
+    readonly provenance: Provenance;
+    readonly severity?: KernelSeverity;
+    readonly artifactSet?: ArtifactSet;
+}
+export declare function validateCoordinate(input: Readonly<Record<string, unknown>>): Coordinate;
+export declare function dimensionsOf(record: CompiledRecord): {
+    dimensions: Dimensions;
+    diagnostics: readonly GraphDiagnostic[];
+};
+//# sourceMappingURL=coordinate.d.ts.map

package/dist/coordinate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate.d.ts","sourceRoot":"","sources":["../src/coordinate.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,WAAW,EAEX,cAAc,EACd,aAAa,EACb,cAAc,EACd,UAAU,EACX,MAAM,sBAAsB,CAAC;AAE9B,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACxD,MAAM,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AAC1E,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAC;IAChC,QAAQ,CAAC,QAAQ,CAAC,EAAE,cAAc,CAAC;IACnC,QAAQ,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC;CACpC;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,UAAU,CAoBvF;AACD,wBAAgB,YAAY,CAAC,MAAM,EAAE,cAAc,GAAG;IACpD,UAAU,EAAE,UAAU,CAAC;IACvB,WAAW,EAAE,SAAS,eAAe,EAAE,CAAC;CACzC,CAmCA"}

package/dist/coordinate.js

@@ -0,0 +1,48 @@
+import { ARTIFACT_SETS, CONDITION_AXES, SEVERITIES, canonicalValue, valuesFor } from '@inventarch/language';
+import { GraphUsageError, graphDiagnostic } from './diagnostics.js';
+export function validateCoordinate(input) {
+    if (input === null || typeof input !== 'object' || Array.isArray(input))
+        throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', 'Coordinate must be an axis/value object');
+    const output = {};
+    for (const [name, value] of Object.entries(input)) {
+        if (valuesFor(name) === undefined)
+            throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', `Unknown coordinate axis '${name}'; admitted: ${CONDITION_AXES.join(', ')}`);
+        if (value === undefined)
+            continue;
+        const canonical = typeof value === 'string' ? canonicalValue(name, value) : undefined;
+        if (canonical === undefined)
+            throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', `Unknown ${name} value '${String(value)}'; admitted: ${valuesFor(name).join(', ')}`);
+        output[name] = canonical;
+    }
+    return Object.freeze(output);
+}
+export function dimensionsOf(record) {
+    const diagnostics = [];
+    const read = (fields, key, domain) => {
+        const matched = fields.filter((f) => f.key === key);
+        if (matched.length === 0)
+            return undefined;
+        const value = matched[0].value;
+        const canonical = matched.length === 1 && (value.kind === 'scalar' || value.kind === 'string')
+            ? domain.find((v) => v.toLowerCase() === value.text.toLowerCase())
+            : undefined;
+        if (canonical === undefined)
+            diagnostics.push(graphDiagnostic('IA-GRAPH-DIMENSION-UNKNOWN', record.source.path, matched[0].span.line, `${record.identity}: ${key} must occur once as one of ${domain.join(', ')}`));
+        return canonical;
+    };
+    const governance = record.sections
+        .filter((s) => s.name === 'governance')
+        .flatMap((s) => s.fields)
+        .filter((f) => 'key' in f);
+    const severity = read(governance, 'severity', SEVERITIES);
+    const artifactSet = read(record.head, 'artifact-set', ARTIFACT_SETS);
+    return {
+        dimensions: Object.freeze({
+            provenance: record.provenance,
+            ...(severity === undefined ? {} : { severity }),
+            ...(artifactSet === undefined ? {} : { artifactSet }),
+        }),
+        diagnostics,
+    };
+}
+//# sourceMappingURL=coordinate.js.map

package/dist/coordinate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate.js","sourceRoot":"","sources":["../src/coordinate.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,UAAU,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAS5G,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AASpE,MAAM,UAAU,kBAAkB,CAAC,KAAwC;IACzE,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACrE,MAAM,IAAI,eAAe,CAAC,mCAAmC,EAAE,yCAAyC,CAAC,CAAC;IAC5G,MAAM,MAAM,GAA2C,EAAE,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAClD,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,SAAS;YAC/B,MAAM,IAAI,eAAe,CACvB,mCAAmC,EACnC,4BAA4B,IAAI,gBAAgB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC5E,CAAC;QACJ,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,MAAM,SAAS,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtF,IAAI,SAAS,KAAK,SAAS;YACzB,MAAM,IAAI,eAAe,CACvB,mCAAmC,EACnC,WAAW,IAAI,WAAW,MAAM,CAAC,KAAK,CAAC,gBAAgB,SAAS,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACrF,CAAC;QACJ,MAAM,CAAC,IAAqB,CAAC,GAAG,SAAS,CAAC;IAC5C,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AACD,MAAM,UAAU,YAAY,CAAC,MAAsB;IAIjD,MAAM,WAAW,GAAsB,EAAE,CAAC;IAC1C,MAAM,IAAI,GAAG,CAAC,MAAgC,EAAE,GAAW,EAAE,MAAyB,EAAsB,EAAE;QAC5G,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;QACpD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC3C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC;QAChC,MAAM,SAAS,GACb,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC;YAC1E,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAClE,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,SAAS,KAAK,SAAS;YACzB,WAAW,CAAC,IAAI,CACd,eAAe,CACb,4BAA4B,EAC5B,MAAM,CAAC,MAAM,CAAC,IAAI,EAClB,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,IAAI,EACrB,GAAG,MAAM,CAAC,QAAQ,KAAK,GAAG,8BAA8B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC5E,CACF,CAAC;QACJ,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IACF,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ;SAC/B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;SACtC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;SACxB,MAAM,CAAC,CAAC,CAAC,EAAsB,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,UAAU,CAA+B,CAAC;IACxF,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,cAAc,EAAE,aAAa,CAA4B,CAAC;IAChG,OAAO;QACL,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC;YACxB,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,GAAG,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC;YAC/C,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;SACtD,CAAC;QACF,WAAW;KACZ,CAAC;AACJ,CAAC"}

package/dist/diagnostics.d.ts

@@ -0,0 +1,12 @@
+import type { Diagnostic } from '@inventarch/language';
+export declare const GRAPH_CODES: readonly ["IA-GRAPH-IDENTITY-TIE", "IA-GRAPH-TARGET-MISSING", "IA-GRAPH-TARGET-AMBIGUOUS", "IA-GRAPH-EDGE-UNCONSENTED", "IA-GRAPH-DIMENSION-UNKNOWN", "IA-GRAPH-COORDINATE-VALUE-UNKNOWN", "IA-GRAPH-VERB-UNKNOWN", "IA-GRAPH-TRAVERSAL-INVALID", "IA-GRAPH-VARIANT-AMBIGUOUS", "IA-GRAPH-SCOPE-INVALID"];
+export type GraphCode = (typeof GRAPH_CODES)[number];
+export interface GraphDiagnostic extends Omit<Diagnostic, 'code'> {
+    readonly code: GraphCode;
+}
+export declare class GraphUsageError extends Error {
+    readonly code: GraphCode;
+    constructor(code: GraphCode, message: string);
+}
+export declare function graphDiagnostic(code: GraphCode, path: string, line: number, message: string, warning?: boolean): GraphDiagnostic;
+//# sourceMappingURL=diagnostics.d.ts.map

package/dist/diagnostics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diagnostics.d.ts","sourceRoot":"","sources":["../src/diagnostics.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACvD,eAAO,MAAM,WAAW,2SAWd,CAAC;AACX,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC;AACrD,MAAM,WAAW,eAAgB,SAAQ,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC;IAC/D,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;CAC1B;AACD,qBAAa,eAAgB,SAAQ,KAAK;IAEtC,QAAQ,CAAC,IAAI,EAAE,SAAS;gBAAf,IAAI,EAAE,SAAS,EACxB,OAAO,EAAE,MAAM;CAKlB;AACD,wBAAgB,eAAe,CAC7B,IAAI,EAAE,SAAS,EACf,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,EACf,OAAO,UAAQ,GACd,eAAe,CAEjB"}

package/dist/diagnostics.js

@@ -0,0 +1,24 @@
+export const GRAPH_CODES = [
+    'IA-GRAPH-IDENTITY-TIE',
+    'IA-GRAPH-TARGET-MISSING',
+    'IA-GRAPH-TARGET-AMBIGUOUS',
+    'IA-GRAPH-EDGE-UNCONSENTED',
+    'IA-GRAPH-DIMENSION-UNKNOWN',
+    'IA-GRAPH-COORDINATE-VALUE-UNKNOWN',
+    'IA-GRAPH-VERB-UNKNOWN',
+    'IA-GRAPH-TRAVERSAL-INVALID',
+    'IA-GRAPH-VARIANT-AMBIGUOUS',
+    'IA-GRAPH-SCOPE-INVALID',
+];
+export class GraphUsageError extends Error {
+    code;
+    constructor(code, message) {
+        super(message);
+        this.code = code;
+        this.name = 'GraphUsageError';
+    }
+}
+export function graphDiagnostic(code, path, line, message, warning = false) {
+    return { code, path, line, severity: warning ? 'warning' : 'error', message: `${path}:${line}: ${message}` };
+}
+//# sourceMappingURL=diagnostics.js.map

package/dist/diagnostics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"diagnostics.js","sourceRoot":"","sources":["../src/diagnostics.ts"],"names":[],"mappings":"AACA,MAAM,CAAC,MAAM,WAAW,GAAG;IACzB,uBAAuB;IACvB,yBAAyB;IACzB,2BAA2B;IAC3B,2BAA2B;IAC3B,4BAA4B;IAC5B,mCAAmC;IACnC,uBAAuB;IACvB,4BAA4B;IAC5B,4BAA4B;IAC5B,wBAAwB;CAChB,CAAC;AAKX,MAAM,OAAO,eAAgB,SAAQ,KAAK;IAE7B;IADX,YACW,IAAe,EACxB,OAAe;QAEf,KAAK,CAAC,OAAO,CAAC,CAAC;QAHN,SAAI,GAAJ,IAAI,CAAW;QAIxB,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;IAChC,CAAC;CACF;AACD,MAAM,UAAU,eAAe,CAC7B,IAAe,EACf,IAAY,EACZ,IAAY,EACZ,OAAe,EACf,OAAO,GAAG,KAAK;IAEf,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,IAAI,IAAI,IAAI,KAAK,OAAO,EAAE,EAAE,CAAC;AAC/G,CAAC"}

package/dist/immutable.d.ts

@@ -0,0 +1,6 @@
+/** Read-only views with inaccessible backing storage; Object.freeze(Map) alone is insufficient. */
+export declare function readonlyMap<K, V>(entries: Iterable<readonly [K, V]>): ReadonlyMap<K, V>;
+export declare function readonlySet<T>(values: Iterable<T>): ReadonlySet<T>;
+/** Only structured record data belongs here: no Date, function, resource or class instances. */
+export declare function snapshot<T>(value: T): T;
+//# sourceMappingURL=immutable.d.ts.map

package/dist/immutable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"immutable.d.ts","sourceRoot":"","sources":["../src/immutable.ts"],"names":[],"mappings":"AAAA,mGAAmG;AACnG,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAoBvF;AACD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAmBlE;AACD,gGAAgG;AAChG,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAOvC"}

package/dist/immutable.js

@@ -0,0 +1,53 @@
+/** Read-only views with inaccessible backing storage; Object.freeze(Map) alone is insufficient. */
+export function readonlyMap(entries) {
+    const backing = new Map(entries);
+    const view = Object.create(Map.prototype);
+    Object.defineProperties(view, {
+        size: { get: () => backing.size },
+        get: { value: (key) => backing.get(key) },
+        has: { value: (key) => backing.has(key) },
+        entries: { value: () => backing.entries() },
+        keys: { value: () => backing.keys() },
+        values: { value: () => backing.values() },
+        [Symbol.iterator]: { value: () => backing.entries() },
+        forEach: {
+            value: (callback, thisArg) => backing.forEach((value, key) => callback.call(thisArg, value, key, view)),
+        },
+        set: { value: undefined },
+        delete: { value: undefined },
+        clear: { value: undefined },
+    });
+    return Object.freeze(view);
+}
+export function readonlySet(values) {
+    const backing = new Set(values);
+    const view = Object.create(Set.prototype);
+    Object.defineProperties(view, {
+        size: { get: () => backing.size },
+        has: { value: (value) => backing.has(value) },
+        entries: { value: () => backing.entries() },
+        keys: { value: () => backing.keys() },
+        values: { value: () => backing.values() },
+        [Symbol.iterator]: { value: () => backing.values() },
+        forEach: {
+            value: (callback, thisArg) => backing.forEach((value) => callback.call(thisArg, value, value, view)),
+        },
+        add: { value: undefined },
+        delete: { value: undefined },
+        clear: { value: undefined },
+    });
+    return Object.freeze(view);
+}
+/** Only structured record data belongs here: no Date, function, resource or class instances. */
+export function snapshot(value) {
+    if (value instanceof Map)
+        return readonlyMap([...value].map(([k, v]) => [snapshot(k), snapshot(v)]));
+    if (value instanceof Set)
+        return readonlySet([...value].map(snapshot));
+    if (Array.isArray(value))
+        return Object.freeze(value.map(snapshot));
+    if (value !== null && typeof value === 'object')
+        return Object.freeze(Object.fromEntries(Object.entries(value).map(([k, v]) => [k, snapshot(v)])));
+    return value;
+}
+//# sourceMappingURL=immutable.js.map

package/dist/immutable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"immutable.js","sourceRoot":"","sources":["../src/immutable.ts"],"names":[],"mappings":"AAAA,mGAAmG;AACnG,MAAM,UAAU,WAAW,CAAO,OAAkC;IAClE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAsB,CAAC;IAC/D,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE;QAC5B,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE;QACjC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,GAAM,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QAC5C,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,GAAM,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;QAC5C,OAAO,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;QAC3C,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE;QACrC,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE;QACzC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;QACrD,OAAO,EAAE;YACP,KAAK,EAAE,CAAC,QAA4D,EAAE,OAAiB,EAAE,EAAE,CACzF,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;SAC5E;QACD,GAAG,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE;QACzB,MAAM,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE;QAC5B,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE;KAC5B,CAAC,CAAC;IACH,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AACD,MAAM,UAAU,WAAW,CAAI,MAAmB;IAChD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAmB,CAAC;IAC5D,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE;QAC5B,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE;QACjC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,KAAQ,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;QAChD,OAAO,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;QAC3C,IAAI,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE;QACrC,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE;QACzC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE;QACpD,OAAO,EAAE;YACP,KAAK,EAAE,CAAC,QAA4D,EAAE,OAAiB,EAAE,EAAE,CACzF,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;SACzE;QACD,GAAG,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE;QACzB,MAAM,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE;QAC5B,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE;KAC5B,CAAC,CAAC;IACH,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AACD,gGAAgG;AAChG,MAAM,UAAU,QAAQ,CAAI,KAAQ;IAClC,IAAI,KAAK,YAAY,GAAG;QAAE,OAAO,WAAW,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAM,CAAC;IAC1G,IAAI,KAAK,YAAY,GAAG;QAAE,OAAO,WAAW,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAM,CAAC;IAC5E,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAM,CAAC;IACzE,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAC7C,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAM,CAAC;IACzG,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,18 @@
+export { GRAPH_CODES, GraphUsageError } from './diagnostics.js';
+export type { GraphCode, GraphDiagnostic } from './diagnostics.js';
+export { canonicalRoot, reaches } from './paths.js';
+export { stableSerialize, revisionOf } from './revision.js';
+export type { RevisionInputs, RevisionSource } from './revision.js';
+export { validateCoordinate, dimensionsOf } from './coordinate.js';
+export type { Coordinate, Dimensions } from './coordinate.js';
+export { load, serialize } from './load.js';
+export { resolve } from './resolve.js';
+export type { Resolution } from './resolve.js';
+export type { CellRef, CellSelection, Edge, EdgeAssertion, FieldReference, Graph, LoadOptions, Node, Occurrence, Shadow, Tie, } from './types.js';
+export { cell, conditionHolds, effectiveSeverity, selectors, variants } from './queries.js';
+export type { SelectorMatch, VariantSelection } from './queries.js';
+export { traverse } from './traverse.js';
+export type { Traversal, TraverseOptions, Via, WalkNode } from './traverse.js';
+export { fold, tokenize, search } from './text.js';
+export type { TextIndex, SearchHit } from './text.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAChE,YAAY,EAAE,SAAS,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC5D,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AACpE,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AACnE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,YAAY,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC/C,YAAY,EACV,OAAO,EACP,aAAa,EACb,IAAI,EACJ,aAAa,EACb,cAAc,EACd,KAAK,EACL,WAAW,EACX,IAAI,EACJ,UAAU,EACV,MAAM,EACN,GAAG,GACJ,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAC5F,YAAY,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACpE,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,YAAY,EAAE,SAAS,EAAE,eAAe,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC/E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC"}

package/dist/index.js

@@ -0,0 +1,10 @@
+export { GRAPH_CODES, GraphUsageError } from './diagnostics.js';
+export { canonicalRoot, reaches } from './paths.js';
+export { stableSerialize, revisionOf } from './revision.js';
+export { validateCoordinate, dimensionsOf } from './coordinate.js';
+export { load, serialize } from './load.js';
+export { resolve } from './resolve.js';
+export { cell, conditionHolds, effectiveSeverity, selectors, variants } from './queries.js';
+export { traverse } from './traverse.js';
+export { fold, tokenize, search } from './text.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAEhE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAE5D,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEnE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAevC,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAE5F,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEzC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC"}

package/dist/load.d.ts

@@ -0,0 +1,6 @@
+import type { CompiledRecord, FrozenRegistry } from '@inventarch/language';
+import type { Edge, Graph, LoadOptions } from './types.js';
+export declare const edgeOrder: (a: Edge, b: Edge) => number;
+export declare function load(records: readonly CompiledRecord[], registry: FrozenRegistry, options: LoadOptions): Graph;
+export declare function serialize(graph: Graph): string;
+//# sourceMappingURL=load.d.ts.map

package/dist/load.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"load.d.ts","sourceRoot":"","sources":["../src/load.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAGV,cAAc,EAEd,cAAc,EAEf,MAAM,sBAAsB,CAAC;AAS9B,OAAO,KAAK,EAAW,IAAI,EAAkB,KAAK,EAAE,WAAW,EAAiC,MAAM,YAAY,CAAC;AAEnH,eAAO,MAAM,SAAS,GAAI,GAAG,IAAI,EAAE,GAAG,IAAI,KAAG,MASd,CAAC;AAChC,wBAAgB,IAAI,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,EAAE,WAAW,GAAG,KAAK,CAgS9G;AAkFD,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAE9C"}