@bitspark/ontos-deixis-projection 0.14.0

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 @@
+ontos
+Copyright 2026 Bitspark and the ontos contributors
+
+This product includes software developed at Bitspark (https://github.com/Bitspark).

package/dist/src/index.d.ts

@@ -0,0 +1,102 @@
+import { Node, type Option } from "@bitspark/deixis-core";
+import { type Value } from "@bitspark/ontos-core";
+/** The name of the profile this package implements. */
+export declare const PROFILE = "ontos-over-deixis-v1";
+/**
+ * The position spelling the profile is defined over. It is the value the vector file
+ * carries, and a conforming face is conforming to exactly this spelling — the tests pin
+ * it against @bitspark/deixis-pos's own `PROFILE`.
+ */
+export declare const POSITION_SPELLING = "deixis-pos-v1";
+/**
+ * The bridge's slot: an optional byte string. `Some(b)` reads as an atom's bytes, `None`
+ * (spelled `undefined` by deixis) as "no atom here, a tuple's positions instead".
+ *
+ * Deixis requires a value at every node and says nothing about what it means. This choice
+ * is the profile's, made here and nowhere else.
+ */
+export type Payload = Option<Uint8Array>;
+/** The projection's codomain, `Node[Option[Bytes]]`. */
+export type BytesNode = Node<Payload>;
+/**
+ * Equality of the WHOLE payload: `None` differs from every `Some`, and two `Some`s
+ * compare by exact bytes, length included.
+ */
+export declare function payloadEq(a: Payload, b: Payload): boolean;
+/**
+ * The deixis identity `=D` at this bridge's slot: deixis's lifted relation over
+ * `payloadEq`.
+ *
+ * Deixis deliberately provides no native equality for a node — it lifts one from the slot
+ * and declines to choose the slot's relation on a caller's behalf — so the relation is
+ * supplied here, explicitly.
+ */
+export declare function nodeEq(a: BytesNode, b: BytesNode): boolean;
+/**
+ * `P : Ontos → Node[Option[Bytes]]` — TOTAL. Every ontos value has a projection, so this
+ * function cannot fail on an L0 value:
+ *
+ *   P(Atom(b))          = Node(Some(b), {})
+ *   P(Tuple(v₀ … vₙ₋₁)) = Node(None, { κ(i) ↦ P(vᵢ) | 0 ≤ i < n })
+ */
+export declare function project(value: Value): BytesNode;
+/** The refusal classes. Normative: two conforming faces agree on which one applies. */
+export type UnrecognizedKind = "key_mismatch" | "value_with_children";
+/**
+ * Why a node is not an ontos value.
+ *
+ * `Node[Option[Bytes]]` admits shapes the projection never produces, and they do not all
+ * fail for the same reason — so they do not all get the same explanation. A malformed key
+ * domain is a statement about WHICH positions a tuple carries; a payload beside children
+ * is a statement about WHAT KIND of node it is at all. Collapsing the second into the
+ * first would name a key as the culprit when no key is wrong.
+ *
+ * Do not branch on `message`. It is informative, not normative (PROJECTION.md §Vectors):
+ * conformance is the refusal and its `kind`, and two conforming faces are free to word
+ * the prose differently. Branch on `kind`, or on `instanceof` of a subclass.
+ */
+export declare abstract class Unrecognized extends Error {
+    readonly name: string;
+    /** Which refusal this is. Normative. */
+    abstract readonly kind: UnrecognizedKind;
+    /** Tuple indices from the root to the node that refused. */
+    readonly path: readonly number[];
+    protected constructor(path: readonly number[], message: string);
+}
+/**
+ * The first entry, in canonical order, whose key is not the spelling of its position. A
+ * shifted or sparse domain, a named key, a non-canonical spelling and a stray entry after
+ * a dense prefix all surface here, located by `entry`.
+ */
+export declare class KeyMismatch extends Unrecognized {
+    readonly name = "KeyMismatch";
+    readonly kind: "key_mismatch";
+    /** The entry position (in canonical order) whose key mismatched. */
+    readonly entry: number;
+    /** `κ(entry)` — the key that position must carry. */
+    readonly expected: Uint8Array;
+    /** The key bytes actually present. */
+    readonly found: Uint8Array;
+    constructor(path: readonly number[], entry: number, expected: Uint8Array, found: Uint8Array);
+}
+/**
+ * The node carries an own value AND children. `P` emits a payload only at a childless
+ * node, so this is outside its image however well-formed the keys are — and the keys are
+ * not consulted, because the shape is already wrong.
+ */
+export declare class ValueWithChildren extends Unrecognized {
+    readonly name = "ValueWithChildren";
+    readonly kind: "value_with_children";
+    /** How many children the node carries. Any number but zero refuses. */
+    readonly children: number;
+    constructor(path: readonly number[], children: number);
+}
+/**
+ * `R : Node[Option[Bytes]] ⇀ Ontos` — PARTIAL. Succeeds exactly on the image of `project`
+ * (law 2), and throws an `Unrecognized` subclass on everything else:
+ *
+ *   R(Node(Some(b), {})) = Atom(b)
+ *   R(Node(None, m))     = Tuple(R(m(κ(0))), …, R(m(κ(n−1))))
+ *                          defined only when dom m = { κ(0), …, κ(n−1) } and every child recognizes.
+ */
+export declare function recognize(node: BytesNode): Value;

package/dist/src/index.js

@@ -0,0 +1,229 @@
+/*
+ * ontos-over-deixis-v1 — the projection between ontos values and Node[Option[Bytes]],
+ * on the deixis-pos-v1 position spelling. See ../../PROJECTION.md (normative).
+ *
+ *   P(Atom(b))            = Node(Some(b), {})                            total
+ *   P(Tuple(v₀ … vₙ₋₁))   = Node(None, { κ(i) ↦ P(vᵢ) })                 total
+ *   R(Node(Some(b), {}))  = Atom(b)                                      partial:
+ *   R(Node(None, m))      = Tuple over κ(0) … κ(n−1), exactly            exact or refusal
+ *
+ * Deixis v0.2.0 gives every node an own value independently of its children
+ * (Node[T] = T × FinMap[Bytes, Node[T]]), so there is no leaf/struct sum to switch on.
+ * `Option` is THIS BRIDGE'S chosen payload domain, not a feature of the deixis core — the
+ * core carries T opaquely and never interprets it. The two ontos constructors therefore
+ * land on two disjoint node shapes, a present value with no children and an absent value
+ * with the dense positional children, and the shapes that are NEITHER are exactly what R
+ * refuses.
+ *
+ * The recognizer never parses a key: κ is order-preserving, so deixis's canonical entry
+ * order is tuple order, and recognition is one pairwise walk comparing each entry key
+ * octet-for-octet against the generated κ(i). It never sorts entries into new positions,
+ * fills gaps, drops keys, or normalizes an alternate spelling to its index — recognition
+ * is exact or it throws, because a repair pass would silently coarsen identity, which no
+ * layer may do.
+ *
+ * This package is additive and defines no equality of its own at L0 — ontos identity
+ * stays where it is (`equals` from @bitspark/ontos-core). What it DOES supply is the slot
+ * relation deixis requires of a caller: see `nodeEq`. Nothing in ontos/core or
+ * ontos-codec-v1 changes because this package exists, and the dependency direction is
+ * ontos → deixis, never the reverse.
+ *
+ * BROWSER-COMPATIBLE BY CONSTRUCTION. This file imports only @bitspark/ontos-core,
+ * @bitspark/deixis-core and @bitspark/deixis-pos — all three pure ESM over Uint8Array —
+ * and nothing from `node:`; there is no Buffer, no process, no filesystem. The
+ * test/browser.test.ts guard pins that for this file AND for the runtime closure.
+ *
+ * Peer of projection/deixis/rs (Rust) and projection/deixis/go (Go). Written with both
+ * in view, so it is NOT an independent reading of PROJECTION.md — see the note at the
+ * bottom of this file.
+ */
+import { Node, some } from "@bitspark/deixis-core";
+import { key } from "@bitspark/deixis-pos";
+import { atom, tuple, bytesEqual, toHex } from "@bitspark/ontos-core";
+/** The name of the profile this package implements. */
+export const PROFILE = "ontos-over-deixis-v1";
+/**
+ * The position spelling the profile is defined over. It is the value the vector file
+ * carries, and a conforming face is conforming to exactly this spelling — the tests pin
+ * it against @bitspark/deixis-pos's own `PROFILE`.
+ */
+export const POSITION_SPELLING = "deixis-pos-v1";
+/**
+ * Equality of the WHOLE payload: `None` differs from every `Some`, and two `Some`s
+ * compare by exact bytes, length included.
+ */
+export function payloadEq(a, b) {
+    if (a === undefined || b === undefined)
+        return a === b;
+    return bytesEqual(a.value, b.value);
+}
+/**
+ * The deixis identity `=D` at this bridge's slot: deixis's lifted relation over
+ * `payloadEq`.
+ *
+ * Deixis deliberately provides no native equality for a node — it lifts one from the slot
+ * and declines to choose the slot's relation on a caller's behalf — so the relation is
+ * supplied here, explicitly.
+ */
+export function nodeEq(a, b) {
+    return a.equalBy(b, payloadEq);
+}
+/** A node with a payload and no children; composing zero children cannot collide. */
+function childless(own) {
+    return Node.compose(own, []);
+}
+/**
+ * `P : Ontos → Node[Option[Bytes]]` — TOTAL. Every ontos value has a projection, so this
+ * function cannot fail on an L0 value:
+ *
+ *   P(Atom(b))          = Node(Some(b), {})
+ *   P(Tuple(v₀ … vₙ₋₁)) = Node(None, { κ(i) ↦ P(vᵢ) | 0 ≤ i < n })
+ */
+export function project(value) {
+    switch (value.kind) {
+        case "atom":
+            // Some(b) AND childless. The childlessness is half the projection: it is what
+            // lets R tell an atom from a tuple without a tag.
+            return childless(some(value.bytes()));
+        case "tuple": {
+            // Law 6: the empty TUPLE is Node(None, {}) and the empty ATOM is Node(Some(""), {}).
+            // Both are childless, so the whole distinction rests on the payload — which is
+            // exactly what a lax bridge would merge.
+            const entries = [];
+            const items = value.items();
+            for (let i = 0; i < items.length; i += 1) {
+                entries.push([key(BigInt(i)), project(items[i])]);
+            }
+            // κ is injective (deixis-pos-v1), so 0…n−1 yield n distinct keys and deixis's
+            // DuplicateKeyError is unreachable here — P stays total in its signature.
+            return Node.compose(undefined, entries);
+        }
+        default: {
+            // L0 is closed: Value = Atom | Tuple. A third case would be a new floor, not a
+            // new projection; the `never` makes the compiler say so.
+            const impossible = value;
+            throw new TypeError(`${PROFILE}: not an L0 value: ${String(impossible)}`);
+        }
+    }
+}
+/**
+ * Why a node is not an ontos value.
+ *
+ * `Node[Option[Bytes]]` admits shapes the projection never produces, and they do not all
+ * fail for the same reason — so they do not all get the same explanation. A malformed key
+ * domain is a statement about WHICH positions a tuple carries; a payload beside children
+ * is a statement about WHAT KIND of node it is at all. Collapsing the second into the
+ * first would name a key as the culprit when no key is wrong.
+ *
+ * Do not branch on `message`. It is informative, not normative (PROJECTION.md §Vectors):
+ * conformance is the refusal and its `kind`, and two conforming faces are free to word
+ * the prose differently. Branch on `kind`, or on `instanceof` of a subclass.
+ */
+export class Unrecognized extends Error {
+    name = "Unrecognized";
+    /** Tuple indices from the root to the node that refused. */
+    path;
+    constructor(path, message) {
+        super(message);
+        this.path = Object.freeze([...path]);
+    }
+}
+/**
+ * The first entry, in canonical order, whose key is not the spelling of its position. A
+ * shifted or sparse domain, a named key, a non-canonical spelling and a stray entry after
+ * a dense prefix all surface here, located by `entry`.
+ */
+export class KeyMismatch extends Unrecognized {
+    name = "KeyMismatch";
+    kind = "key_mismatch";
+    /** The entry position (in canonical order) whose key mismatched. */
+    entry;
+    /** `κ(entry)` — the key that position must carry. */
+    expected;
+    /** The key bytes actually present. */
+    found;
+    constructor(path, entry, expected, found) {
+        const where = path.length === 0 ? "$" : `$.${path.join(".")}`;
+        super(path, `${where}: entry ${entry} carries key ${toHex(found)}, not κ(${entry}) = ${toHex(expected)} — ` +
+            `recognition under ${PROFILE} is exact, and dom m must be exactly {κ(0) … κ(n−1)}`);
+        this.entry = entry;
+        this.expected = expected;
+        this.found = found;
+    }
+}
+/**
+ * The node carries an own value AND children. `P` emits a payload only at a childless
+ * node, so this is outside its image however well-formed the keys are — and the keys are
+ * not consulted, because the shape is already wrong.
+ */
+export class ValueWithChildren extends Unrecognized {
+    name = "ValueWithChildren";
+    kind = "value_with_children";
+    /** How many children the node carries. Any number but zero refuses. */
+    children;
+    constructor(path, children) {
+        const where = path.length === 0 ? "$" : `$.${path.join(".")}`;
+        super(path, `${where}: the node carries an own value and ${children} child(ren); under ${PROFILE} ` +
+            `a payload belongs only to a CHILDLESS node, so no key is at fault here`);
+        this.children = children;
+    }
+}
+/**
+ * `R : Node[Option[Bytes]] ⇀ Ontos` — PARTIAL. Succeeds exactly on the image of `project`
+ * (law 2), and throws an `Unrecognized` subclass on everything else:
+ *
+ *   R(Node(Some(b), {})) = Atom(b)
+ *   R(Node(None, m))     = Tuple(R(m(κ(0))), …, R(m(κ(n−1))))
+ *                          defined only when dom m = { κ(0), …, κ(n−1) } and every child recognizes.
+ */
+export function recognize(node) {
+    return recognizeAt(node, []);
+}
+function recognizeAt(node, path) {
+    const own = node.own();
+    const entries = node.entries();
+    if (own !== undefined) {
+        // A present payload is an atom — but ONLY if the node is childless. A node carrying
+        // both is well-formed deixis and outside the image of P. That is a question about
+        // the node's SHAPE, so it is answered before any key is read: the keys may be
+        // flawless κ and the node is still not an ontos value.
+        if (entries.length > 0) {
+            throw new ValueWithChildren(path, entries.length);
+        }
+        return atom(own.value);
+    }
+    // An absent payload is a tuple. Because κ is order-preserving, deixis's canonical entry
+    // order IS tuple order. So the recognizer walks the entries ONCE, comparing each key
+    // against the GENERATED κ(i) — it never parses a key and needs no κ decoder. That is
+    // also what makes the refusals exact: a gap (dom = {κ(0), κ(2)}) shows up as entry 1
+    // carrying κ(2); a named key, an empty key, a straggler after a dense prefix, and a key
+    // that would DECODE to i but is not octet-equal to κ(i) are all caught by the same
+    // comparison. n = 0 is the empty tuple and is in the image.
+    const items = [];
+    for (let i = 0; i < entries.length; i += 1) {
+        const [found, child] = entries[i];
+        const expected = key(BigInt(i));
+        if (!bytesEqual(found, expected)) {
+            throw new KeyMismatch(path, i, expected, found);
+        }
+        path.push(i);
+        items.push(recognizeAt(child, path));
+        path.pop();
+    }
+    return tuple(items);
+}
+/*
+ * INDEPENDENCE NOTE, recorded because the profile's maturity claim depends on it.
+ *
+ * This face was written by ontos, with projection/deixis/rs and projection/deixis/go
+ * open beside PROJECTION.md. It is therefore independent of neither face's code nor of
+ * the organisation that wrote them, and per ontos-internal#255 it changes NOTHING about the
+ * profile's maturity: `ontos-over-deixis-v1` stays UNWITNESSED, permanently. A third
+ * ontos-authored face is a third consumer of the same reading, not a witness to it.
+ *
+ * The v0.2.0 migration does not change that in either direction: all three faces were
+ * carried to the mandatory-value model together, by one author with all three open, so
+ * it is not a fresh independent reading — and it does not retract the Go face's original
+ * one either, which remains a fact about how that face was FIRST written.
+ */
+//# sourceMappingURL=index.js.map

package/dist/src/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAEH,OAAO,EAAE,IAAI,EAAE,IAAI,EAAe,MAAM,uBAAuB,CAAC;AAChE,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAC3C,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAc,MAAM,sBAAsB,CAAC;AAElF,uDAAuD;AACvD,MAAM,CAAC,MAAM,OAAO,GAAG,sBAAsB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,eAAe,CAAC;AAcjD;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,CAAU,EAAE,CAAU;IAC9C,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC;IACvD,OAAO,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACtC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAC,CAAY,EAAE,CAAY;IAC/C,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;AACjC,CAAC;AAED,qFAAqF;AACrF,SAAS,SAAS,CAAC,GAAY;IAC7B,OAAO,IAAI,CAAC,OAAO,CAAU,GAAG,EAAE,EAAE,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,KAAY;IAClC,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,MAAM;YACT,8EAA8E;YAC9E,kDAAkD;YAClD,OAAO,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxC,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,qFAAqF;YACrF,+EAA+E;YAC/E,yCAAyC;YACzC,MAAM,OAAO,GAAyC,EAAE,CAAC;YACzD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;YACD,8EAA8E;YAC9E,0EAA0E;YAC1E,OAAO,IAAI,CAAC,OAAO,CAAU,SAAS,EAAE,OAAO,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;YACR,+EAA+E;YAC/E,yDAAyD;YACzD,MAAM,UAAU,GAAU,KAAK,CAAC;YAChC,MAAM,IAAI,SAAS,CAAC,GAAG,OAAO,sBAAsB,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC5E,CAAC;IACH,CAAC;AACH,CAAC;AAKD;;;;;;;;;;;;GAYG;AACH,MAAM,OAAgB,YAAa,SAAQ,KAAK;IAC5B,IAAI,GAAW,cAAc,CAAC;IAGhD,4DAA4D;IACnD,IAAI,CAAoB;IAEjC,YAAsB,IAAuB,EAAE,OAAe;QAC5D,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACvC,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,WAAY,SAAQ,YAAY;IACzB,IAAI,GAAG,aAAa,CAAC;IACrB,IAAI,GAAG,cAAuB,CAAC;IACjD,oEAAoE;IAC3D,KAAK,CAAS;IACvB,qDAAqD;IAC5C,QAAQ,CAAa;IAC9B,sCAAsC;IAC7B,KAAK,CAAa;IAE3B,YAAY,IAAuB,EAAE,KAAa,EAAE,QAAoB,EAAE,KAAiB;QACzF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9D,KAAK,CACH,IAAI,EACJ,GAAG,KAAK,WAAW,KAAK,gBAAgB,KAAK,CAAC,KAAK,CAAC,WAAW,KAAK,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK;YAC7F,qBAAqB,OAAO,sDAAsD,CACrF,CAAC;QACF,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,iBAAkB,SAAQ,YAAY;IAC/B,IAAI,GAAG,mBAAmB,CAAC;IAC3B,IAAI,GAAG,qBAA8B,CAAC;IACxD,uEAAuE;IAC9D,QAAQ,CAAS;IAE1B,YAAY,IAAuB,EAAE,QAAgB;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9D,KAAK,CACH,IAAI,EACJ,GAAG,KAAK,uCAAuC,QAAQ,sBAAsB,OAAO,GAAG;YACrF,wEAAwE,CAC3E,CAAC;QACF,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,IAAe;IACvC,OAAO,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,WAAW,CAAC,IAAe,EAAE,IAAc;IAClD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;IAE/B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,oFAAoF;QACpF,kFAAkF;QAClF,8EAA8E;QAC9E,uDAAuD;QACvD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,wFAAwF;IACxF,qFAAqF;IACrF,qFAAqF;IACrF,qFAAqF;IACrF,wFAAwF;IACxF,mFAAmF;IACnF,4DAA4D;IAC5D,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,EAAE,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;AACtB,CAAC;AAED;;;;;;;;;;;;;GAaG"}

package/package.json

@@ -0,0 +1,38 @@
+{
+  "name": "@bitspark/ontos-deixis-projection",
+  "version": "0.14.0",
+  "license": "Apache-2.0",
+  "description": "ontos-over-deixis-v1: the total projection P and exact partial recognizer R between ontos values and Node[Option[Bytes]], on the deixis-pos-v1 position spelling. Additive; the one TypeScript package in ontos that knows deixis exists. Browser-compatible (no Node-only imports). Depends on @bitspark/ontos-core, @bitspark/deixis-core and @bitspark/deixis-pos.",
+  "type": "module",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/Bitspark/ontos.git"
+  },
+  "publishConfig": {
+    "access": "public",
+    "registry": "https://registry.npmjs.org/",
+    "provenance": true
+  },
+  "files": [
+    "dist/src",
+    "LICENSE",
+    "NOTICE"
+  ],
+  "exports": {
+    ".": "./dist/src/index.js",
+    "./package.json": "./package.json"
+  },
+  "dependencies": {
+    "@bitspark/deixis-core": "0.6.0",
+    "@bitspark/deixis-pos": "0.6.0",
+    "@bitspark/ontos-core": "^0.14.0"
+  },
+  "devDependencies": {
+    "@bitspark/ontos-codec": "^0.14.0"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "test": "node --test test/*.test.ts"
+  },
+  "gitHead": "a44df597c4e7561ce2573b30e4c058c164853490"
+}