kibi-cli 1.0.1 → 2.0.0

package/dist/operations/proof/receipt-document.js

@@ -0,0 +1,117 @@
+/*
+ Kibi — repo-local, per-branch, queryable long-term memory for software projects
+ Copyright (C) 2026 Piotr Franczyk
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Affero General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU Affero General Public License for more details.
+
+ You should have received a copy of the GNU Affero General Public License
+ along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+import { dump as dumpYaml } from "js-yaml";
+/**
+ * Remove a top-level frontmatter block (`key:` plus its nested lines) from a
+ * markdown document, leaving every other byte untouched. Returns the patched
+ * content, or null when the content is not a well-formed frontmatter
+ * document the remover can safely splice.
+ *
+ * Used by proof maintenance to drop legacy `verification_receipts` blocks
+ * once a `proof_contract` exists, without canonicalizing the document.
+ */
+// implements REQ-kibi-proof-evidence-protocol
+export function removeFrontmatterBlock(content, key) {
+    const lines = content.match(/[^\n]*\n|[^\n]+$/g) ?? [];
+    if (lines.length === 0 || lines[0]?.trim() !== "---")
+        return null;
+    let closingIndex = -1;
+    for (let index = 1; index < lines.length; index++) {
+        if (lines[index]?.trim() === "---") {
+            closingIndex = index;
+            break;
+        }
+    }
+    if (closingIndex === -1)
+        return null;
+    let blockStart = -1;
+    let blockEnd = closingIndex;
+    for (let index = 1; index < closingIndex; index++) {
+        if (new RegExp(`^${key}\\s*:`).test(lines[index] ?? "")) {
+            blockStart = index;
+            break;
+        }
+    }
+    if (blockStart === -1)
+        return null;
+    for (let index = blockStart + 1; index < closingIndex; index++) {
+        const line = lines[index] ?? "";
+        if (/^[A-Za-z_][A-Za-z0-9_-]*\s*:/.test(line)) {
+            blockEnd = index;
+            break;
+        }
+    }
+    return [...lines.slice(0, blockStart), ...lines.slice(blockEnd)].join("");
+}
+/**
+ * Patch the `proof_receipts` frontmatter block of an authored test document
+ * without re-rendering anything else.
+ *
+ * Receipt ingest used to route every append through the canonical entity
+ * renderer, which re-dumps the whole frontmatter: inline tag lists became
+ * block lists, timestamps gained milliseconds, and so on. Those non-receipt
+ * edits are not stripped by the workspace snapshotter, so the snapshot hash
+ * changed on the first ingest that touched a hand-authored document and every
+ * later integration in the same `kibi prove --all` run refused with
+ * "changed the tracked workspace". This patcher splices ONLY the receipts
+ * block, leaving the rest of the document byte-for-byte identical.
+ *
+ * Returns null when the content is not a well-formed frontmatter document the
+ * patcher can safely splice; the caller then falls back to the canonical
+ * render.
+ */
+// implements REQ-kibi-proof-evidence-protocol
+export function patchReceiptsIntoDocument(content, receipts) {
+    const lines = content.match(/[^\n]*\n|[^\n]+$/g) ?? [];
+    if (lines.length === 0 || lines[0]?.trim() !== "---")
+        return null;
+    let closingIndex = -1;
+    for (let index = 1; index < lines.length; index++) {
+        if (lines[index]?.trim() === "---") {
+            closingIndex = index;
+            break;
+        }
+    }
+    if (closingIndex === -1)
+        return null;
+    let receiptsStart = -1;
+    let receiptsEnd = closingIndex;
+    for (let index = 1; index < closingIndex; index++) {
+        if (/^proof_receipts\s*:/.test(lines[index] ?? "")) {
+            receiptsStart = index;
+            break;
+        }
+    }
+    if (receiptsStart !== -1) {
+        for (let index = receiptsStart + 1; index < closingIndex; index++) {
+            const line = lines[index] ?? "";
+            if (/^[A-Za-z_][A-Za-z0-9_-]*\s*:/.test(line)) {
+                receiptsEnd = index;
+                break;
+            }
+        }
+    }
+    const block = dumpYaml({ proof_receipts: receipts.map((receipt) => ({ ...receipt })) }, { noRefs: true, lineWidth: -1, sortKeys: false });
+    const blockLines = block.match(/[^\n]*\n|[^\n]+$/g) ?? [];
+    const spliced = [
+        ...lines.slice(0, receiptsStart === -1 ? closingIndex : receiptsStart),
+        ...blockLines,
+        ...lines.slice(receiptsEnd),
+    ];
+    return spliced.join("");
+}

package/dist/operations/semantic-advisor/analyze-prose.d.ts

@@ -1,5 +1,6 @@
 import type { SemanticAdvisorAnalysisResult, SemanticAdvisorInput } from "./types.js";
 export declare const SEMANTIC_ADVISOR_VERSION = "semantic-advisor-v2";
 export { semanticClaimKey } from "./clauses.js";
+export declare function stringLogicClaims(value: unknown): string[];
 export declare function analyzeSemanticAdvisorInput(input: SemanticAdvisorInput): SemanticAdvisorAnalysisResult;
 //# sourceMappingURL=analyze-prose.d.ts.map

package/dist/operations/semantic-advisor/analyze-prose.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"analyze-prose.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/analyze-prose.ts"],"names":[],"mappings":"AAmCA,OAAO,KAAK,EACV,6BAA6B,EAC7B,oBAAoB,EAWrB,MAAM,YAAY,CAAC;AAEpB,eAAO,MAAM,wBAAwB,wBAAwB,CAAC;AAC9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AA81BhD,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,oBAAoB,GAC1B,6BAA6B,CA+D/B"}
+{"version":3,"file":"analyze-prose.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/analyze-prose.ts"],"names":[],"mappings":"AAmCA,OAAO,KAAK,EACV,6BAA6B,EAC7B,oBAAoB,EAWrB,MAAM,YAAY,CAAC;AAEpB,eAAO,MAAM,wBAAwB,wBAAwB,CAAC;AAC9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAEhD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,EAAE,CAI1D;AAo3BD,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,oBAAoB,GAC1B,6BAA6B,CA+D/B"}

package/dist/operations/semantic-advisor/analyze-prose.js

@@ -13,6 +13,11 @@ import { isRecord, payloadHash, propertiesOf, relationship, semanticClausesOf, s
 import { detectStrictSuggestion } from "./strict-rules.js";
 export const SEMANTIC_ADVISOR_VERSION = "semantic-advisor-v2";
 export { semanticClaimKey } from "./clauses.js";
+export function stringLogicClaims(value) {
+    return Array.isArray(value)
+        ? value.filter((entry) => typeof entry === "string")
+        : [];
+}
 const SIGNAL_PATTERNS = [
     {
         kind: "numeric_cardinality",
@@ -289,8 +294,9 @@ function modelingSuggestions(payload, modeled, clauses, interpretations) {
     return suggestions;
 }
 function withClauseProvenance(suggestion, clause, clauses, expectedClaimKeys, statement, sourceField) {
-    const clauseOffset = statement.indexOf(clause.text);
-    const clauseSpan = utf8Span(statement || clause.text, clauseOffset >= 0 ? clauseOffset : 0, clauseOffset >= 0 ? clauseOffset + clause.text.length : clause.text.length);
+    const clauseLocation = propositionSpan(statement, clause, 0);
+    const clauseText = clauseLocation.sourceText;
+    const clauseSpan = clauseLocation.span;
     const status = suggestion.kind === "ambiguity_observation"
         ? "ambiguous"
         : suggestion.kind === "ontology_gap"
@@ -309,7 +315,7 @@ function withClauseProvenance(suggestion, clause, clauses, expectedClaimKeys, st
                 : "missing";
         return {
             claim_key: entry.claim_key,
-            claim_text: entry.text,
+            claim_text: located.sourceText,
             role,
             status: entryStatus,
             span: located.span,
@@ -334,9 +340,7 @@ function withClauseProvenance(suggestion, clause, clauses, expectedClaimKeys, st
         if (properties === null)
             return step;
         if (step.type === "req") {
-            const existing = Array.isArray(properties.logic_claims)
-                ? properties.logic_claims.filter((value) => typeof value === "string")
-                : [];
+            const existing = stringLogicClaims(properties.logic_claims);
             return {
                 ...step,
                 properties: {
@@ -357,7 +361,7 @@ function withClauseProvenance(suggestion, clause, clauses, expectedClaimKeys, st
             properties: {
                 ...properties,
                 claim_key: clause.claim_key,
-                claim_text: clause.text,
+                claim_text: clauseText,
                 claim_span_start: clauseSpan.start,
                 claim_span_end: clauseSpan.end,
             },
@@ -366,14 +370,14 @@ function withClauseProvenance(suggestion, clause, clauses, expectedClaimKeys, st
     return {
         ...suggestion,
         claim_key: clause.claim_key,
-        claim_text: clause.text,
+        claim_text: clauseText,
         applyPlan,
         ...(suggestion.kind === "predicate" && suggestion.relationshipPlan !== null
             ? {
                 relationshipPlan: {
                     ...suggestion.relationshipPlan,
                     claimKey: clause.claim_key,
-                    claimText: clause.text,
+                    claimText: clauseText,
                     logicClaims: expectedClaimKeys,
                     semanticClauses: clauses.map(({ text }) => text),
                     semanticInventory,
@@ -387,7 +391,7 @@ function withClauseProvenance(suggestion, clause, clauses, expectedClaimKeys, st
                 relationshipPlan: {
                     ...suggestion.relationshipPlan,
                     claimKey: clause.claim_key,
-                    claimText: clause.text,
+                    claimText: clauseText,
                     logicClaims: expectedClaimKeys,
                     semanticClauses: clauses.map(({ text }) => text),
                     semanticInventory,
@@ -554,12 +558,36 @@ function shadowAnalysis(text, interpretations) {
     }));
 }
 function propositionSpan(text, clause, cursor) {
-    const exact = text.indexOf(clause.text, cursor);
+    const located = locateSourceText(text, clause.text, cursor);
+    return {
+        span: utf8Span(text, located.start, located.end),
+        next: Math.max(cursor, located.end),
+        sourceText: text.slice(located.start, located.end),
+    };
+}
+function escapeRegExp(value) {
+    return value.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+/**
+ * Locate canonical claim text while accepting source-only whitespace layout.
+ * The caller receives the authored slice so strict ingestion can compare the
+ * span with the claim text without rewriting the source document.
+ */
+function locateSourceText(source, claimText, cursor) {
+    const canonicalPattern = escapeRegExp(claimText).replace(/\s+/g, "\\s+");
+    const match = new RegExp(canonicalPattern).exec(source.slice(cursor));
+    if (match?.index !== undefined) {
+        const start = cursor + match.index;
+        return { start, end: start + match[0].length };
+    }
+    const exact = source.indexOf(claimText, cursor);
     const start = exact >= 0 ? exact : cursor;
-    const end = exact >= 0
-        ? exact + clause.text.length
-        : Math.min(text.length, start + clause.text.length);
-    return { span: utf8Span(text, start, end), next: Math.max(cursor, end) };
+    return {
+        start,
+        end: exact >= 0
+            ? exact + claimText.length
+            : Math.min(source.length, start + claimText.length),
+    };
 }
 function interpretationResults(interpretations, clauses, statement) {
     if (interpretations === undefined)
@@ -582,16 +610,8 @@ function interpretationResults(interpretations, clauses, statement) {
             (candidate.span.start < 0 || candidate.span.end < candidate.span.start))
             errors.push("interpretation span is invalid");
         if (clause && candidate.span) {
-            const candidateStart = statement.indexOf(candidate.claim_text);
-            const clauseStart = statement.indexOf(clause.text);
-            const sourceStart = candidateStart >= 0 ? candidateStart : clauseStart;
-            const sourceEnd = sourceStart >= 0
-                ? sourceStart +
-                    (candidateStart >= 0
-                        ? candidate.claim_text.length
-                        : clause.text.length)
-                : 0;
-            const expectedSpan = utf8Span(statement, Math.max(0, sourceStart), Math.max(0, sourceEnd));
+            const candidateLocation = locateSourceText(statement, candidate.claim_text, 0);
+            const expectedSpan = utf8Span(statement, candidateLocation.start, candidateLocation.end);
             if (candidate.span.start !== expectedSpan.start ||
                 candidate.span.end !== expectedSpan.end)
                 errors.push(`interpretation span for ${candidate.claim_key} does not match the exact UTF-8 proposition span`);
@@ -671,7 +691,7 @@ function propositionInventory(statement, clauses, suggestions, interpretations,
         }
         return {
             claim_key: clause.claim_key,
-            claim_text: clause.text,
+            claim_text: located.sourceText,
             role,
             status,
             span: located.span,

package/dist/operations/semantic-advisor/clauses.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"clauses.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/clauses.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,EAAE,UAAU,GAAG,UAAU,CAAC;CACjC,CAAC,CAAC;AAKH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAW7D;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAIrD;AA4BD,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,MAAM,EACZ,eAAe,CAAC,EAAE,SAAS,MAAM,EAAE,GAClC,SAAS,cAAc,EAAE,CAgB3B"}
+{"version":3,"file":"clauses.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/clauses.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;IACnB,MAAM,EAAE,UAAU,GAAG,UAAU,CAAC;CACjC,CAAC,CAAC;AAKH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAW7D;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAIrD;AA4BD,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,MAAM,EACZ,eAAe,CAAC,EAAE,SAAS,MAAM,EAAE,GAClC,SAAS,cAAc,EAAE,CA4B3B"}

package/dist/operations/semantic-advisor/clauses.js

@@ -46,11 +46,24 @@ export function extractSemanticClauses(text, suppliedClauses) {
     if (suppliedClauses !== undefined && normalized.length === 0) {
         throw new Error("Semantic advisor clauses must contain at least one non-empty atomic claim");
     }
-    return normalized.map((clause, index) => ({
-        claim_key: semanticClaimKey(clause),
-        text: clause,
-        index,
-        normative: NORMATIVE_PATTERN.test(clause),
-        source,
-    }));
+    // A repeated sentence has one logical identity. Keep the first source
+    // occurrence for its source span and provenance; retaining repeated claim
+    // keys would make the inventory impossible to persist because logic_claims
+    // is a set-like manifest and grounding is one-to-one.
+    const seen = new Set();
+    return normalized.flatMap((clause, index) => {
+        const identity = clause.toLowerCase();
+        if (seen.has(identity))
+            return [];
+        seen.add(identity);
+        return [
+            {
+                claim_key: semanticClaimKey(clause),
+                text: clause,
+                index,
+                normative: NORMATIVE_PATTERN.test(clause),
+                source,
+            },
+        ];
+    });
 }

package/dist/operations/semantic-advisor/strict-count-rules.d.ts

@@ -1,4 +1,6 @@
 import { type Payload } from "./shared.js";
 import type { SemanticModelingSuggestion } from "./types.js";
+export declare function numberToken(value: string): number | null;
+export declare function whenParsedNumber<T>(value: number | null, then: (value: number) => T): T | null;
 export declare function detectCountStrictSuggestion(payload: Payload, statement: string): SemanticModelingSuggestion | null;
 //# sourceMappingURL=strict-count-rules.d.ts.map

package/dist/operations/semantic-advisor/strict-count-rules.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"strict-count-rules.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/strict-count-rules.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,OAAO,EAKb,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,YAAY,CAAC;AAuB7D,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,MAAM,GAChB,0BAA0B,GAAG,IAAI,CA4DnC"}
+{"version":3,"file":"strict-count-rules.d.ts","sourceRoot":"","sources":["../../../src/operations/semantic-advisor/strict-count-rules.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,OAAO,EAKb,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,YAAY,CAAC;AAgB7D,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAIxD;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAChC,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,IAAI,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,GACzB,CAAC,GAAG,IAAI,CAGV;AAGD,wBAAgB,2BAA2B,CACzC,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,MAAM,GAChB,0BAA0B,GAAG,IAAI,CAsEnC"}

package/dist/operations/semantic-advisor/strict-count-rules.js

@@ -12,51 +12,66 @@ const NUMBER_WORDS = new Map([
     ["nine", 9],
     ["ten", 10],
 ]);
-function numberToken(value) {
+export function numberToken(value) {
     return /^\d+$/.test(value)
         ? Number(value)
         : (NUMBER_WORDS.get(value.toLowerCase()) ?? null);
 }
+export function whenParsedNumber(value, then) {
+    if (value === null)
+        return null;
+    return then(value);
+}
 // implements REQ-mcp-semantic-advisor-preflight
 export function detectCountStrictSuggestion(payload, statement) {
     const cardinality = statement.match(/\b(?<operator>at\s+most|at\s+least|exactly|no\s+more\s+than|up\s+to)\s+(?<value>\d+|zero|one|two|three|four|five|six|seven|eight|nine|ten)\s+(?<resource>[a-z][a-z\s_-]*?)\.?$/i);
-    if (cardinality?.groups?.operator &&
-        cardinality.groups.value &&
-        cardinality.groups.resource) {
-        const value = numberToken(cardinality.groups.value);
-        if (value !== null) {
-            const normalized = normalizeKey(cardinality.groups.resource);
+    const cardinalityGroups = cardinality?.groups;
+    if (cardinalityGroups?.operator &&
+        cardinalityGroups.value &&
+        cardinalityGroups.resource) {
+        const operatorText = cardinalityGroups.operator;
+        const valueText = cardinalityGroups.value;
+        const resourceText = cardinalityGroups.resource;
+        const value = numberToken(valueText);
+        const suggestion = whenParsedNumber(value, (parsed) => {
+            const normalized = normalizeKey(resourceText);
             const tail = singularize(normalized.split("_").at(-1) ?? normalized);
-            const operator = /at\s+least/i.test(cardinality.groups.operator)
+            const operator = /at\s+least/i.test(operatorText)
                 ? "gte"
-                : /exactly/i.test(cardinality.groups.operator)
+                : /exactly/i.test(operatorText)
                     ? "eq"
                     : "lte";
-            return strictSuggestion(payload, `${cardinality.groups.operator} ${cardinality.groups.value}`, {
+            return strictSuggestion(payload, `${operatorText} ${valueText}`, {
                 subject_key: tail === "session" ? "user.session" : normalized.replace(/_/g, "."),
                 property_key: normalized.includes("active_session")
                     ? "active_count"
                     : "count",
                 operator,
                 value_type: "int",
-                value_int: value,
+                value_int: parsed,
             }, "Bounded cardinality is a strict numeric property and should be modeled explicitly.", 0.9);
-        }
+        });
+        if (suggestion)
+            return suggestion;
     }
     const capped = statement.match(/^(?<subject>.+?)\s+cap(?:s|ped)?\s+at\s+(?:(?<property>[a-z][a-z\s_-]*?)\s+)?(?<value>\d+|zero|one|two|three|four|five|six|seven|eight|nine|ten)\.?$/i);
-    if (capped?.groups?.subject && capped.groups.value) {
-        const value = numberToken(capped.groups.value);
-        if (value !== null) {
-            return strictSuggestion(payload, `cap at ${capped.groups.value}`, {
-                subject_key: normalizeSubjectKey(capped.groups.subject),
-                property_key: capped.groups.property
-                    ? `${normalizeKey(capped.groups.property)}_cap`
-                    : "count",
-                operator: "lte",
-                value_type: "int",
-                value_int: value,
-            }, "Cap-at prose is an upper-bound strict property and should be modeled explicitly.", 0.9);
-        }
+    const cappedGroups = capped?.groups;
+    if (cappedGroups?.subject && cappedGroups.value) {
+        const subjectText = cappedGroups.subject;
+        const valueText = cappedGroups.value;
+        const propertyText = cappedGroups.property;
+        const value = numberToken(valueText);
+        const suggestion = whenParsedNumber(value, (parsed) => strictSuggestion(payload, `cap at ${valueText}`, {
+            subject_key: normalizeSubjectKey(subjectText),
+            property_key: propertyText
+                ? `${normalizeKey(propertyText)}_cap`
+                : "count",
+            operator: "lte",
+            value_type: "int",
+            value_int: parsed,
+        }, "Cap-at prose is an upper-bound strict property and should be modeled explicitly.", 0.9));
+        if (suggestion)
+            return suggestion;
     }
     return null;
 }

package/dist/prolog/codec.d.ts

@@ -4,7 +4,8 @@
  */
 /**
  * Escape a string for use as a Prolog atom.
- * Doubles single-quote characters per ISO Prolog standard.
+ * Escapes backslashes/control characters and doubles single quotes per ISO
+ * Prolog syntax.
  */
 export declare function escapeAtom(value: string): string;
 /**
@@ -23,13 +24,24 @@ export declare function toPrologString(value: string): string;
  * Alias for escapeAtom for semantic clarity.
  */
 export declare function escapeAtomContent(value: string): string;
+/**
+ * Parse a Prolog list of list rows without decoding or normalizing columns.
+ * Malformed outer collections fail closed rather than returning a partial
+ * projection.
+ */
 export declare function parseListOfLists(listStr: string): string[][];
+export declare function firstTwoDefinedParts(parts: readonly (string | undefined)[]): [string, string] | undefined;
+export declare function fallbackWhenPairMissing<T>(pair: [string, string] | undefined, fallback: T): T | null;
+export declare function typedLiteralFromParts(parts: readonly (string | undefined)[], original: string): unknown;
+export declare function fileUriLeaf(value: string): string;
+export declare function entityFromBindingParts(parts: readonly (string | undefined)[]): Record<string, unknown>;
 export declare function parseEntityFromBinding(bindingStr: string): Record<string, unknown>;
 export declare function parseEntityFromList(data: string[]): Record<string, unknown>;
 export declare function parsePropertyList(propsStr: string): Record<string, unknown>;
 export declare function parsePrologValue(valueInput: string): unknown;
 export declare function splitTopLevelGeneral(str: string, delimiter: string): string[];
 export declare function splitTopLevel(str: string, delimiter: string): string[];
+export declare function normalizeEntityId(value: string): string;
 export declare function parseAtomList(raw: string): string[];
 export declare function parsePairList(raw: string): Array<[string, string]>;
 export declare function parseTriples(raw: string): Array<[string, string, string]>;

package/dist/prolog/codec.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../../src/prolog/codec.ts"],"names":[],"mappings":"AAUA;;;GAGG;AAEH;;;GAGG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGhD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAMlD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CASpD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGvD;AAED,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CA8C5D;AAED,wBAAgB,sBAAsB,CAEpC,UAAU,EAAE,MAAM,GACjB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAoBzB;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAqB3E;AAED,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAmD3E;AAED,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAkG5D;AAED,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAoD7E;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAGtE;AAqBD,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CAenD;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAmBlE;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAoBzE;AAuDD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,eAAe,EAAE,CA6DjE"}
+{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../../src/prolog/codec.ts"],"names":[],"mappings":"AAUA;;;GAGG;AAEH;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAYhD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAIlD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CASpD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAGvD;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAU5D;AAED,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,GACrC,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAO9B;AAED,wBAAgB,uBAAuB,CAAC,CAAC,EACvC,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,EAClC,QAAQ,EAAE,CAAC,GACV,CAAC,GAAG,IAAI,CAEV;AAID,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,EACtC,QAAQ,EAAE,MAAM,GACf,OAAO,CAoCT;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAMjD;AAED,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,SAAS,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,GACrC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAiBzB;AAED,wBAAgB,sBAAsB,CAEpC,UAAU,EAAE,MAAM,GACjB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAGzB;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAqB3E;AAED,wBAAgB,iBAAiB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAoD3E;AAED,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CA6D5D;AAED,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAG7E;AAuFD,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,CAGtE;AAYD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAUvD;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CAenD;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAmBlE;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAoBzE;AAyCD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,eAAe,EAAE,CA6DjE"}