@inventarch/graph 3.1.1 → 3.2.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LANGUAGE.md +2 -2
- package/README.md +5 -4
- package/SPEC.md +9 -9
- package/dist/coordinate.d.ts.map +1 -1
- package/dist/coordinate.js +16 -2
- package/dist/coordinate.js.map +1 -1
- package/package.json +2 -2
package/LANGUAGE.md
CHANGED
|
@@ -22,7 +22,7 @@ Spec source locators do not load documents. Resource capture and disclosure requ
|
|
|
22
22
|
| @convention | governance-system | Declares a convention in the shared governance shape. |
|
|
23
23
|
| @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. |
|
|
24
24
|
| @dimension | taxonomy | Defines a supported record dimension used by conditions and lookup. |
|
|
25
|
-
| @distribution | workspace-system | Declares root records from which a distributable closure is selected. |
|
|
25
|
+
| @distribution | workspace-system | Declares root records from which a distributable closure is selected, and optionally the host plugin product it describes. |
|
|
26
26
|
| @execution-binding | agent-composition-system | Connects a native target to a host-installed entry or operation descriptor. |
|
|
27
27
|
| @harness | agent-composition-system | Composes profiles and execution bindings in a workspace under a host contract. |
|
|
28
28
|
| @hook | hook-authoring-system | Represents a host event, tool/path selection and guard message. Registration and executing a guard require a host adapter. |
|
|
@@ -40,7 +40,7 @@ Spec source locators do not load documents. Resource capture and disclosure requ
|
|
|
40
40
|
| @placement | taxonomy | Defines source authority and reach metadata. |
|
|
41
41
|
| @plan | work-system | Represents an arrangement of milestones toward an intent; it heads the work hierarchy and has no parent. Plans do not nest. |
|
|
42
42
|
| @playbook | governance-system | Represents a procedure as phase/primitive cells. Cell delivery is generic; the authored method belongs to its author. |
|
|
43
|
-
| @predicate | taxonomy | Defines a directed relationship and its
|
|
43
|
+
| @predicate | taxonomy | Defines a directed relationship, its inverse spelling and its present phrase. |
|
|
44
44
|
| @primitive | taxonomy | Defines a cognitive primitive coordinate; a cell is selected using its phase and primitive. |
|
|
45
45
|
| @principle | governance-system | Declares a governing rationale in the shared governance shape. |
|
|
46
46
|
| @run | session-system | Represents a governed run identity, declared phase, status and owner. Declaration does not start execution. |
|
package/README.md
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
# @inventarch/graph
|
|
2
2
|
|
|
3
|
-
[](https://www.npmjs.com/package/@inventarch/graph) [](https://github.com/inventarch/ia/actions/workflows/platform-quality.yml) [](LICENSE) [](https://www.npmjs.com/package/@inventarch/graph) [](https://github.com/inventarch/ia/actions/workflows/platform-quality.yml) [](LICENSE) [](package.json)
|
|
4
4
|
|
|
5
5
|
> The typed graph over compiled IA records. It chooses the winning occurrence of each identity, resolves references, rechecks relationship consent, and lets you traverse relationships, inspect claims, conditions and record digests, and search record text.
|
|
6
6
|
>
|
|
@@ -36,20 +36,21 @@ for (const row of directedView(graph, 'floor/contract/head/kernel-phase'))
|
|
|
36
36
|
// inverse grounded-by floor/definition/system/taxonomy
|
|
37
37
|
```
|
|
38
38
|
|
|
39
|
-
`load` reads nothing itself: it takes compiled records, the registry that compiled them and the revision inputs. To read a workspace on disk, use [`@inventarch/db`](../db/README.md), which discovers the sources and builds the graph.
|
|
39
|
+
`load` reads nothing itself: it takes compiled records, the registry that compiled them and the revision inputs. `options` holds the revision inputs (`sources`, `languageVersion`, `kernelDigest`), the view `location` and an optional `phase`. Every record's source must be in `sources` at the same placement and provenance; otherwise `load` throws a `TypeError`. To read a workspace on disk, use [`@inventarch/db`](../db/README.md), which discovers the sources and builds the graph.
|
|
40
40
|
|
|
41
41
|
## 🧭 What it does
|
|
42
42
|
|
|
43
43
|
| Area | Exports |
|
|
44
44
|
| --- | --- |
|
|
45
45
|
| Load | `load(records, registry, options)` returns an immutable `Graph`: one winner per identity (the highest band; a tie at that band refuses every tied occurrence), shadows, resolved and dangling edges, indexes and diagnostics. `serialize(graph)` writes it in a stable order that input order does not affect. |
|
|
46
|
-
| Resolve | `resolve(reference, pool, registry)` returns
|
|
47
|
-
| Relationships | `directedView(graph, identity)` lists every relationship from that record's side, declared or derived inverse, plus typed field references. `traverse(graph, options)` walks breadth-first from start identities to a depth of 0 to 8, with optional scope
|
|
46
|
+
| Resolve | `resolve(reference, pool, registry)` returns `{ ok: true, identity, fragment? }`, or `{ ok: false, code }` with `IA-GRAPH-TARGET-MISSING` or `IA-GRAPH-TARGET-AMBIGUOUS`; candidate order never breaks a tie. |
|
|
47
|
+
| Relationships | `directedView(graph, identity)` lists every relationship from that record's side, declared or derived inverse, plus typed field references. `traverse(graph, options)` walks breadth-first from `start` identities. It follows the verbs in `follow` (any kernel spelling), or every edge in `direction` (`out`, `in` or `both`, the default), to a `depth` of 0 to 8 (default 1), with optional `scope`, `filter` and `coordinate`, and `maxNodes`/`maxEdges` bounds that mark a result `truncated`. |
|
|
48
48
|
| Claims | `claimants(graph, path, scope?)` names the records whose path selections in `CLAIM_FIELDS` (`authority.covers`, `subject.covers`, `work.covers`, `hook.paths`, `check.covers`) select a path. `selects(selection, path)` and `isSelection(selection)` implement the one path-selection dialect. |
|
|
49
49
|
| Conditions | `validateCoordinate`, `conditionHolds`, `selectors`, `variants`, `cell`, `effectiveSeverity` and `laneOf` evaluate conditions, selector groups and variant and cell selection for a coordinate. |
|
|
50
50
|
| Search | `search(graph, text, scope?)` ranks decoded record text with BM25, computing its statistics over the allowed scope only. |
|
|
51
51
|
| Revisions and digests | `revisionOf` hashes the sources, registry, language version and kernel digest. `authoredRevisionOf` leaves out sources at runtime placement, so runtime-band evidence does not move it. Each node carries `digest` from `recordDigest(record)`, which covers what a record says, not where it was read. |
|
|
52
52
|
| Canonical JSON | `canonical`, `digest` and `copy` give byte-stable canonical JSON and its SHA-256. Each refusal is a `CodecError` with a stable `code`. |
|
|
53
|
+
| Paths | `canonicalRoot(root)` normalizes a corpus-relative reach or view root, and `reaches(reach, location)` says whether a reach covers a location. |
|
|
53
54
|
|
|
54
55
|
Load diagnostics use the `GRAPH_CODES` (`IA-GRAPH-*`). Invalid query input, such as an unknown coordinate value or a traversal depth outside 0 to 8, throws `GraphUsageError`. The `./internal/*` subpaths are published for IA's own toolchain; use the root entry point.
|
|
55
56
|
|
package/SPEC.md
CHANGED
|
@@ -1,8 +1,6 @@
|
|
|
1
1
|
# Graph specification
|
|
2
2
|
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
Status: G01–G11 implemented; G12 states the canonical codec re-homed here from session-system; G13 adds the per-record digest; G01a adds the authored revision; G06b adds the directed view; G06c adds the claimant index and the path-selection dialect. Pure Node-compatible package depending only on @inventarch/language; no filesystem, clock, default registry or source-text lexer. Delivery paragraphs below retain historical counts and next steps.
|
|
3
|
+
Status: G01–G13 implemented. G01a adds the authored revision; G06a the typed field-reference index; G06b the directed view; G06c the claimant index and the path-selection dialect; G07a the cross-input floor citation; G10a bounded traversal; G12 states the canonical codec re-homed here from session-system; G13 adds the per-record digest. Pure Node-compatible package depending only on @inventarch/language; no filesystem, clock, default registry or source-text lexer. Delivery paragraphs below retain historical counts and next steps.
|
|
6
4
|
|
|
7
5
|
## Construction and revision
|
|
8
6
|
|
|
@@ -18,7 +16,7 @@ G03. Canonical reach/location roots are corpus-relative paths using language can
|
|
|
18
16
|
|
|
19
17
|
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.
|
|
20
18
|
|
|
21
|
-
G05. Build byName, byDiscriminator, byKind, bySystem, byCategory and
|
|
19
|
+
G05. Build byName, byDiscriminator, byKind, bySystem, byCategory, byLane and byArtifactSet postings from winners; category comes from the registration and lane from the validated kernel kind mapping (contract@authority maps authority), which the package root exports as `laneOf(record)`, the one definition of a lane: the index posts each winner under it, and runtime readers that order or seed by lane call it. 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.
|
|
22
20
|
|
|
23
21
|
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, each assertion keeping the verb `spelling` its author wrote while the edge's endpoints stay active (a registration-generated ground assertion carries `ground`; under language S07 it absorbs an equivalent unconditioned, fragmentless ground line written on the same system record in either outbound spelling, `ground` or `grounds`; any other ground line, such as `grounded-by @system <name>` on the schema, keeps its spelling and ordinary consent under G07). 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. The directed view (G06b) reads each resolved assertion from both endpoints, as declared on its author and as a derived inverse on the other side; a dangling assertion has no row there.
|
|
24
22
|
|
|
@@ -40,9 +38,11 @@ G08. A graph coordinate is a partial mapping of closed routing axes plus severit
|
|
|
40
38
|
|
|
41
39
|
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.
|
|
42
40
|
|
|
43
|
-
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.
|
|
41
|
+
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. Direction defaults to both; an explicit empty follow list crosses no edges. Depth is an integer 0..8, default 1, 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.
|
|
42
|
+
|
|
43
|
+
G10a. Bounded traversal: optional `maxNodes`/`maxEdges`, each a positive integer (otherwise TRAVERSAL-INVALID), 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 G10 contract.
|
|
44
44
|
|
|
45
|
-
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.
|
|
45
|
+
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. Fold text with NFKC, lowercase, NFD and mark removal. Split it into Unicode letter/digit runs, drop runs shorter than 2 characters, truncate the rest to 64 and drop the stopwords listed in `src/text.ts`. Score with 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.
|
|
46
46
|
|
|
47
47
|
## Canonical codec
|
|
48
48
|
|
|
@@ -52,13 +52,13 @@ G13. Every Node carries `digest`, its per-record digest, computed once per occur
|
|
|
52
52
|
|
|
53
53
|
## Diagnostics, evidence and boundaries
|
|
54
54
|
|
|
55
|
-
Graph source codes use IA-GRAPH-IDENTITY-TIE, TARGET-MISSING, TARGET-AMBIGUOUS, EDGE-UNCONSENTED and DIMENSION-UNKNOWN. Query errors
|
|
55
|
+
Graph source codes use IA-GRAPH-IDENTITY-TIE, TARGET-MISSING, TARGET-AMBIGUOUS, EDGE-UNCONSENTED and DIMENSION-UNKNOWN. Query usage errors throw `GraphUsageError` with IA-GRAPH-COORDINATE-VALUE-UNKNOWN, VERB-UNKNOWN or TRAVERSAL-INVALID; root normalization throws it with SCOPE-INVALID. `variants` returns IA-GRAPH-VARIANT-AMBIGUOUS in its `diagnostics` and selects none for that family. Codec refusals use IA-SESSION-INPUT-INVALID and IA-SESSION-LIMIT-EXCEEDED (G12). 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.
|
|
56
56
|
|
|
57
57
|
Each delivery 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.
|
|
58
58
|
|
|
59
|
-
Revision and coordinate APIs 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, indexes and queries
|
|
59
|
+
Revision and coordinate APIs 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, indexes and queries were still pending.
|
|
60
60
|
|
|
61
|
-
Graph load and indexes 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
|
|
61
|
+
Graph load and indexes 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 were still pending.
|
|
62
62
|
|
|
63
63
|
Queries and traversal 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.
|
|
64
64
|
|
package/dist/coordinate.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
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;
|
|
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;AAUD,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,UAAU,CA4BvF;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
CHANGED
|
@@ -1,17 +1,31 @@
|
|
|
1
1
|
import { ARTIFACT_SETS, CONDITION_AXES, SEVERITIES, canonicalValue, valuesFor } from '@inventarch/language';
|
|
2
2
|
import { GraphUsageError, graphDiagnostic } from './diagnostics.js';
|
|
3
|
+
/** A refused value's text as String() gives it, or a placeholder when that throws, as it does for `{"toString":1}`. */
|
|
4
|
+
function valueText(value) {
|
|
5
|
+
try {
|
|
6
|
+
return String(value);
|
|
7
|
+
}
|
|
8
|
+
catch {
|
|
9
|
+
return '<unprintable>';
|
|
10
|
+
}
|
|
11
|
+
}
|
|
3
12
|
export function validateCoordinate(input) {
|
|
4
13
|
if (input === null || typeof input !== 'object' || Array.isArray(input))
|
|
5
14
|
throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', 'Coordinate must be an axis/value object');
|
|
6
15
|
const output = {};
|
|
7
16
|
for (const [name, value] of Object.entries(input)) {
|
|
8
|
-
|
|
17
|
+
// `includes()` is a barrier CodeQL js/remote-property-injection recognizes; a `valuesFor()` Map lookup is not.
|
|
18
|
+
if (!CONDITION_AXES.includes(name))
|
|
19
|
+
throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', `Unknown coordinate axis '${name}'; admitted: ${CONDITION_AXES.join(', ')}`);
|
|
20
|
+
// @inventarch/language keeps CONDITION_AXES apart from valuesFor()'s tables; an axis without values is refused too.
|
|
21
|
+
const admitted = valuesFor(name);
|
|
22
|
+
if (admitted === undefined)
|
|
9
23
|
throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', `Unknown coordinate axis '${name}'; admitted: ${CONDITION_AXES.join(', ')}`);
|
|
10
24
|
if (value === undefined)
|
|
11
25
|
continue;
|
|
12
26
|
const canonical = typeof value === 'string' ? canonicalValue(name, value) : undefined;
|
|
13
27
|
if (canonical === undefined)
|
|
14
|
-
throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', `Unknown ${name} value '${
|
|
28
|
+
throw new GraphUsageError('IA-GRAPH-COORDINATE-VALUE-UNKNOWN', `Unknown ${name} value '${valueText(value)}'; admitted: ${admitted.join(', ')}`);
|
|
15
29
|
output[name] = canonical;
|
|
16
30
|
}
|
|
17
31
|
return Object.freeze(output);
|
package/dist/coordinate.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
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;
|
|
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,uHAAuH;AACvH,SAAS,SAAS,CAAC,KAAc;IAC/B,IAAI,CAAC;QACH,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,eAAe,CAAC;IACzB,CAAC;AACH,CAAC;AACD,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,+GAA+G;QAC/G,IAAI,CAAE,cAAoC,CAAC,QAAQ,CAAC,IAAI,CAAC;YACvD,MAAM,IAAI,eAAe,CACvB,mCAAmC,EACnC,4BAA4B,IAAI,gBAAgB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC5E,CAAC;QACJ,oHAAoH;QACpH,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,QAAQ,KAAK,SAAS;YACxB,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,SAAS,CAAC,KAAK,CAAC,gBAAgB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAChF,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/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@inventarch/graph",
|
|
3
|
-
"version": "3.
|
|
3
|
+
"version": "3.2.1",
|
|
4
4
|
"type": "module",
|
|
5
5
|
"main": "./dist/index.js",
|
|
6
6
|
"types": "./dist/index.d.ts",
|
|
@@ -71,7 +71,7 @@
|
|
|
71
71
|
"LANGUAGE.md"
|
|
72
72
|
],
|
|
73
73
|
"dependencies": {
|
|
74
|
-
"@inventarch/language": "3.
|
|
74
|
+
"@inventarch/language": "3.2.1"
|
|
75
75
|
},
|
|
76
76
|
"devDependencies": {
|
|
77
77
|
"@types/node": "^22.19.0",
|