kibi-cli 0.2.3 → 0.2.5

package/dist/prolog/codec.js

@@ -0,0 +1,434 @@
+/*
+ * 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.
+ */
+/**
+ * Prolog codec utilities for escaping atoms, parsing responses, and handling
+ * Prolog list/property structures.
+ */
+/**
+ * Escape a string for use as a Prolog atom.
+ * Doubles single-quote characters per ISO Prolog standard.
+ */
+export function escapeAtom(value) {
+    return value.replace(/'/g, "''");
+}
+/**
+ * Convert a string to a Prolog atom, quoting if necessary.
+ * Simple atoms (lowercase start, alphanumeric + underscore) pass through.
+ */
+export function toPrologAtom(value) {
+    const simplePrologAtom = /^[a-z][a-zA-Z0-9_]*$/;
+    return simplePrologAtom.test(value)
+        ? value
+        : `'${value.replace(/'/g, "''")}'`;
+}
+/**
+ * Escape a string for embedding inside a single-quoted Prolog atom.
+ * Alias for escapeAtom for semantic clarity.
+ */
+export function escapeAtomContent(value) {
+    return value.replace(/'/g, "''");
+}
+/**
+ * Split a string by delimiter at the top level (not inside brackets or quotes).
+ * This is the general-purpose version that splits at depth 0.
+ */
+export function splitTopLevel(str, delimiter) {
+    const results = [];
+    let current = "";
+    let depth = 0;
+    let inDoubleQuotes = false;
+    let inSingleQuotes = false;
+    for (let i = 0; i < str.length; i++) {
+        const char = str[i];
+        const prev = i > 0 ? str[i - 1] : "";
+        if (char === '"' && !inSingleQuotes && prev !== "\\") {
+            inDoubleQuotes = !inDoubleQuotes;
+            current += char;
+            continue;
+        }
+        if (char === "'" && !inDoubleQuotes && prev !== "\\") {
+            inSingleQuotes = !inSingleQuotes;
+            current += char;
+            continue;
+        }
+        if (!inSingleQuotes && !inDoubleQuotes && (char === "[" || char === "(")) {
+            depth++;
+            current += char;
+            continue;
+        }
+        if (!inSingleQuotes && !inDoubleQuotes && (char === "]" || char === ")")) {
+            depth--;
+            current += char;
+            continue;
+        }
+        if (!inSingleQuotes &&
+            !inDoubleQuotes &&
+            depth === 0 &&
+            char === delimiter) {
+            if (current.length > 0) {
+                results.push(current);
+            }
+            current = "";
+            continue;
+        }
+        current += char;
+    }
+    if (current.length > 0) {
+        results.push(current);
+    }
+    return results;
+}
+/**
+ * Parse a Prolog list of lists into a JavaScript array.
+ * Input: "[[a,b,c],[d,e,f]]"
+ * Output: [["a", "b", "c"], ["d", "e", "f"]]
+ */
+export function parseListOfLists(listStr) {
+    const cleaned = listStr.trim().replace(/^\[/, "").replace(/\]$/, "");
+    if (cleaned === "") {
+        return [];
+    }
+    const results = [];
+    let depth = 0;
+    let current = "";
+    let currentList = [];
+    for (let i = 0; i < cleaned.length; i++) {
+        const char = cleaned[i];
+        if (char === "[") {
+            depth++;
+            if (depth > 1)
+                current += char;
+        }
+        else if (char === "]") {
+            depth--;
+            if (depth === 0) {
+                if (current) {
+                    currentList.push(current.trim());
+                    current = "";
+                }
+                if (currentList.length > 0) {
+                    results.push(currentList);
+                    currentList = [];
+                }
+            }
+            else {
+                current += char;
+            }
+        }
+        else if (char === "," && depth === 1) {
+            if (current) {
+                currentList.push(current.trim());
+                current = "";
+            }
+        }
+        else if (char === "," && depth === 0) {
+            // Skip comma between lists
+        }
+        else {
+            current += char;
+        }
+    }
+    return results;
+}
+/**
+ * Parse a single entity from Prolog binding format.
+ * Input: "[abc123, req, [id=abc123, title=\"Test\", ...]]"
+ */
+export function parseEntityFromBinding(bindingStr) {
+    const cleaned = bindingStr.trim().replace(/^\[/, "").replace(/\]$/, "");
+    const parts = splitTopLevelGeneral(cleaned, ",");
+    if (parts.length < 3) {
+        return {};
+    }
+    const id = parts[0].trim();
+    const type = parts[1].trim();
+    const propsStr = parts.slice(2).join(",").trim();
+    const props = parsePropertyList(propsStr);
+    return { ...props, id: normalizeEntityId(stripOuterQuotes(id)), type };
+}
+/**
+ * Parse entity from array returned by parseListOfLists.
+ * Input: ["abc123", "req", "[id=abc123, title=\"Test\", ...]"]
+ */
+export function parseEntityFromList(data) {
+    if (data.length < 3) {
+        return {};
+    }
+    const id = data[0].trim();
+    const type = data[1].trim();
+    const propsStr = data[2].trim();
+    const props = parsePropertyList(propsStr);
+    return { ...props, id: normalizeEntityId(stripOuterQuotes(id)), type };
+}
+/**
+ * Parse Prolog property list into JavaScript object.
+ * Input: "[id=abc123, title=\"Test\"]"
+ */
+export function parsePropertyList(propsStr) {
+    const props = {};
+    let cleaned = propsStr.trim();
+    if (cleaned.startsWith("[")) {
+        cleaned = cleaned.substring(1);
+    }
+    if (cleaned.endsWith("]")) {
+        cleaned = cleaned.substring(0, cleaned.length - 1);
+    }
+    const pairs = splitTopLevelGeneral(cleaned, ",");
+    for (const pair of pairs) {
+        const eqIndex = pair.indexOf("=");
+        if (eqIndex === -1)
+            continue;
+        const key = pair.substring(0, eqIndex).trim();
+        const value = pair.substring(eqIndex + 1).trim();
+        if (key === "..." || value === "..." || value === "...|...") {
+            continue;
+        }
+        const parsed = parsePrologValue(value);
+        props[key] = parsed;
+    }
+    return props;
+}
+/**
+ * Parse a single Prolog value, handling typed literals and URIs.
+ */
+export function parsePrologValue(valueInput) {
+    const value = valueInput.trim();
+    // Handle typed literal: ^^("value", type)
+    if (value.startsWith("^^(")) {
+        const innerStart = value.indexOf("(") + 1;
+        let depth = 1;
+        let innerEnd = innerStart;
+        for (let i = innerStart; i < value.length; i++) {
+            if (value[i] === "(")
+                depth++;
+            if (value[i] === ")") {
+                depth--;
+                if (depth === 0) {
+                    innerEnd = i;
+                    break;
+                }
+            }
+        }
+        const innerContent = value.substring(innerStart, innerEnd);
+        const parts = splitTopLevelGeneral(innerContent, ",");
+        if (parts.length >= 2) {
+            let literalValue = parts[0].trim();
+            if (literalValue.startsWith('"') && literalValue.endsWith('"')) {
+                literalValue = literalValue.substring(1, literalValue.length - 1);
+            }
+            // Handle array notation
+            if (literalValue.startsWith("[") && literalValue.endsWith("]")) {
+                const listContent = literalValue.substring(1, literalValue.length - 1);
+                if (listContent === "") {
+                    return [];
+                }
+                return splitTopLevelGeneral(listContent, ",").map((item) => item.trim());
+            }
+            return literalValue;
+        }
+    }
+    // Handle URI
+    if (value.startsWith("file:///")) {
+        const lastSlash = value.lastIndexOf("/");
+        if (lastSlash !== -1) {
+            return value.substring(lastSlash + 1);
+        }
+        return value;
+    }
+    // Handle quoted string
+    if (value.startsWith('"') && value.endsWith('"')) {
+        return value.substring(1, value.length - 1);
+    }
+    // Handle quoted atom
+    if (value.startsWith("'") && value.endsWith("'")) {
+        return value.substring(1, value.length - 1);
+    }
+    // Handle list
+    if (value.startsWith("[") && value.endsWith("]")) {
+        const listContent = value.substring(1, value.length - 1);
+        if (listContent === "") {
+            return [];
+        }
+        const items = splitTopLevelGeneral(listContent, ",").map((item) => {
+            return parsePrologValue(item.trim());
+        });
+        return items;
+    }
+    return value;
+}
+/**
+ * General-purpose split at top level (not inside brackets or quotes).
+ * More robust version used by property parsing.
+ */
+function splitTopLevelGeneral(str, delimiter) {
+    const results = [];
+    let current = "";
+    let depth = 0;
+    let inQuotes = false;
+    for (let i = 0; i < str.length; i++) {
+        const char = str[i];
+        const prevChar = i > 0 ? str[i - 1] : "";
+        if (char === '"' && prevChar !== "\\") {
+            inQuotes = !inQuotes;
+            current += char;
+        }
+        else if (!inQuotes && (char === "[" || char === "(")) {
+            depth++;
+            current += char;
+        }
+        else if (!inQuotes && (char === "]" || char === ")")) {
+            depth--;
+            current += char;
+        }
+        else if (!inQuotes && depth === 0 && char === delimiter) {
+            if (current) {
+                results.push(current);
+                current = "";
+            }
+        }
+        else {
+            current += char;
+        }
+    }
+    if (current) {
+        results.push(current);
+    }
+    return results;
+}
+/**
+ * Strip outer quotes from a string value.
+ */
+function stripOuterQuotes(value) {
+    if (value.startsWith("'") && value.endsWith("'")) {
+        return value.slice(1, -1);
+    }
+    if (value.startsWith('"') && value.endsWith('"')) {
+        return value.slice(1, -1);
+    }
+    return value;
+}
+/**
+ * Normalize entity ID by extracting filename from file:// URI.
+ */
+function normalizeEntityId(value) {
+    if (!value.startsWith("file:///")) {
+        return value;
+    }
+    const idx = value.lastIndexOf("/");
+    return idx === -1 ? value : value.slice(idx + 1);
+}
+/**
+ * Parse an atom list from Prolog response.
+ * Input: "[a, b, c]" or atom string
+ */
+export function parseAtomList(raw) {
+    const trimmed = raw.trim();
+    if (trimmed === "[]" || trimmed.length === 0) {
+        return [];
+    }
+    const content = unwrapList(trimmed);
+    if (content.length === 0) {
+        return [];
+    }
+    return splitTopLevelGeneral(content, ",")
+        .map((token) => stripQuotes(token.trim()))
+        .filter((token) => token.length > 0);
+}
+/**
+ * Parse a list of pairs from Prolog response.
+ */
+export function parsePairList(raw) {
+    const rows = parseListRows(raw);
+    const pairs = [];
+    for (const row of rows) {
+        const parts = splitTopLevelGeneral(row, ",").map((part) => stripQuotes(part.trim()));
+        if (parts.length >= 2) {
+            pairs.push([parts[0], parts[1]]);
+        }
+    }
+    return pairs;
+}
+/**
+ * Parse a list of triples from Prolog response.
+ */
+export function parseTriples(raw) {
+    const rows = parseListRows(raw);
+    const triples = [];
+    for (const row of rows) {
+        const parts = splitTopLevelGeneral(row, ",").map((part) => stripQuotes(part.trim()));
+        if (parts.length >= 3) {
+            triples.push([parts[0], parts[1], parts[2]]);
+        }
+    }
+    return triples;
+}
+/**
+ * Parse list rows from Prolog response.
+ */
+function parseListRows(raw) {
+    const trimmed = raw.trim();
+    if (trimmed === "[]" || trimmed.length === 0) {
+        return [];
+    }
+    const content = unwrapList(trimmed);
+    if (content.length === 0) {
+        return [];
+    }
+    const rows = [];
+    let depth = 0;
+    let current = "";
+    for (let i = 0; i < content.length; i++) {
+        const ch = content[i];
+        if (ch === "[") {
+            depth++;
+            if (depth > 1) {
+                current += ch;
+            }
+            continue;
+        }
+        if (ch === "]") {
+            depth--;
+            if (depth === 0) {
+                rows.push(current.trim());
+                current = "";
+            }
+            else {
+                current += ch;
+            }
+            continue;
+        }
+        if (ch === "," && depth === 0) {
+            continue;
+        }
+        current += ch;
+    }
+    return rows;
+}
+/**
+ * Unwrap outer list brackets.
+ */
+function unwrapList(value) {
+    if (value.startsWith("[") && value.endsWith("]")) {
+        return value.slice(1, -1).trim();
+    }
+    return value;
+}
+/**
+ * Strip quotes from a value (single or double).
+ */
+function stripQuotes(value) {
+    if (value.startsWith("'") && value.endsWith("'")) {
+        return value.slice(1, -1);
+    }
+    if (value.startsWith('"') && value.endsWith('"')) {
+        return value.slice(1, -1);
+    }
+    return value;
+}

package/dist/prolog.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"prolog.d.ts","sourceRoot":"","sources":["../src/prolog.ts"],"names":[],"mappings":"AAuDA,wBAAgB,eAAe,IAAI,MAAM,CAsCxC;AACD,MAAM,WAAW,aAAa;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,YAAY,CAAM;IAC1B,OAAO,CAAC,WAAW,CAAM;IACzB,OAAO,CAAC,KAAK,CAAuC;IACpD,OAAO,CAAC,oBAAoB,CAAoC;IAChE,OAAO,CAAC,cAAc,CACyC;IAC/D,OAAO,CAAC,cAAc,CAAuB;IAC7C,OAAO,CAAC,aAAa,CAA6B;gBAEtC,OAAO,GAAE,aAAkB;IAKjC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;YAoCd,YAAY;IAyCpB,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAuJ1D,eAAe,IAAI,IAAI;IAIvB,OAAO,CAAC,eAAe;YAYT,YAAY;IA0B1B,OAAO,CAAC,WAAW;IA8EnB,OAAO,CAAC,aAAa;IAIrB,OAAO,CAAC,eAAe;IAevB,OAAO,CAAC,cAAc;IA8BtB,SAAS,IAAI,OAAO;IAIpB,MAAM,IAAI,MAAM;IAIV,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC;CAyBjC"}
+{"version":3,"file":"prolog.d.ts","sourceRoot":"","sources":["../src/prolog.ts"],"names":[],"mappings":"AA4BA,wBAAgB,eAAe,IAAI,MAAM,CAsCxC;AACD,MAAM,WAAW,aAAa;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,OAAO,CAA6B;IAC5C,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,YAAY,CAAM;IAC1B,OAAO,CAAC,WAAW,CAAM;IACzB,OAAO,CAAC,KAAK,CAAuC;IACpD,OAAO,CAAC,oBAAoB,CAAoC;IAChE,OAAO,CAAC,cAAc,CACyC;IAC/D,OAAO,CAAC,cAAc,CAAuB;IAC7C,OAAO,CAAC,aAAa,CAA6B;gBAEtC,OAAO,GAAE,aAAkB;IAKjC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;YAoCd,YAAY;IAyCpB,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IAuJ1D,eAAe,IAAI,IAAI;IAIvB,OAAO,CAAC,eAAe;YAYT,YAAY;IA0B1B,OAAO,CAAC,WAAW;IA8EnB,OAAO,CAAC,aAAa;IAIrB,OAAO,CAAC,eAAe;IAevB,OAAO,CAAC,cAAc;IA8BtB,SAAS,IAAI,OAAO;IAIpB,MAAM,IAAI,MAAM;IAIV,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC;CAyBjC"}

package/dist/prolog.js

@@ -15,33 +15,6 @@
  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/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 import { spawn, spawnSync } from "node:child_process";
 import { existsSync } from "node:fs";
 import { createRequire } from "node:module";

package/dist/public/extractors/symbols-coordinator.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"symbols-coordinator.d.ts","sourceRoot":"","sources":["../../../src/public/extractors/symbols-coordinator.ts"],"names":[],"mappings":"AA8CA,OAAO,EACL,uBAAuB,EACvB,KAAK,mBAAmB,GACzB,MAAM,yCAAyC,CAAC"}
+{"version":3,"file":"symbols-coordinator.d.ts","sourceRoot":"","sources":["../../../src/public/extractors/symbols-coordinator.ts"],"names":[],"mappings":"AAmBA,OAAO,EACL,uBAAuB,EACvB,KAAK,mBAAmB,GACzB,MAAM,yCAAyC,CAAC"}

package/dist/public/extractors/symbols-coordinator.js

@@ -15,32 +15,5 @@
  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/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 // Public re-export of symbols coordinator
 export { enrichSymbolCoordinates, } from "../../extractors/symbols-coordinator.js";

package/dist/public/prolog/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/public/prolog/index.ts"],"names":[],"mappings":"AA8CA,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/public/prolog/index.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/public/prolog/index.js

@@ -15,32 +15,5 @@
  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/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 // Public re-export of PrologProcess
 export { PrologProcess } from "../../prolog.js";

package/dist/public/schemas/entity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"entity.d.ts","sourceRoot":"","sources":["../../../src/public/schemas/entity.ts"],"names":[],"mappings":"AA+CA,QAAA,MAAM,YAAY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAsDjB,CAAC;AAEF,eAAe,YAAY,CAAC"}
+{"version":3,"file":"entity.d.ts","sourceRoot":"","sources":["../../../src/public/schemas/entity.ts"],"names":[],"mappings":"AAoBA,QAAA,MAAM,YAAY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAsDjB,CAAC;AAEF,eAAe,YAAY,CAAC"}

package/dist/public/schemas/entity.js

@@ -15,33 +15,6 @@
  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/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 // Public export of entity schema
 // Generated from entity.schema.json
 const entitySchema = {

package/dist/public/schemas/relationship.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"relationship.d.ts","sourceRoot":"","sources":["../../../src/public/schemas/relationship.ts"],"names":[],"mappings":"AA+CA,QAAA,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAiCvB,CAAC;AAEF,eAAe,kBAAkB,CAAC"}
+{"version":3,"file":"relationship.d.ts","sourceRoot":"","sources":["../../../src/public/schemas/relationship.ts"],"names":[],"mappings":"AAoBA,QAAA,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAiCvB,CAAC;AAEF,eAAe,kBAAkB,CAAC"}

package/dist/public/schemas/relationship.js

@@ -15,33 +15,6 @@
  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/>.
 */
-/*
- How to apply this header to source files (examples)
-
- 1) Prepend header to a single file (POSIX shells):
-
-    cat LICENSE_HEADER.txt "$FILE" > "$FILE".with-header && mv "$FILE".with-header "$FILE"
-
- 2) Apply to multiple files (example: the project's main entry files):
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp packages/cli/src/*.ts packages/mcp/src/*.ts; do
-      if [ -f "$f" ]; then
-        cp "$f" "$f".bak
-        (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-      fi
-    done
-
- 3) Avoid duplicating the header: run a quick guard to only add if missing
-
-    for f in packages/cli/bin/kibi packages/mcp/bin/kibi-mcp; do
-      if [ -f "$f" ]; then
-        if ! head -n 5 "$f" | grep -q "Copyright (C) 2026 Piotr Franczyk"; then
-          cp "$f" "$f".bak
-          (cat LICENSE_HEADER.txt; echo; cat "$f" ) > "$f".new && mv "$f".new "$f"
-        fi
-      fi
-    done
-*/
 // Public export of relationship schema
 // Generated from relationship.schema.json
 const relationshipSchema = {

package/dist/query/service.d.ts

@@ -0,0 +1,35 @@
+import type { PrologProcess } from "../prolog.js";
+export interface QueryFilters {
+    type?: string;
+    id?: string;
+    tags?: string[];
+    sourceFile?: string;
+    limit?: number;
+    offset?: number;
+}
+export interface QueryResult {
+    entities: Array<Record<string, unknown>>;
+    totalCount: number;
+}
+export declare const VALID_ENTITY_TYPES: string[];
+/**
+ * Build a Prolog query goal from filters.
+ */
+export declare function buildEntityQueryGoal(filters: QueryFilters): string;
+/**
+ * Execute a filtered entity query against the KB.
+ */
+export declare function queryEntities(prolog: PrologProcess, filters: QueryFilters): Promise<QueryResult>;
+/**
+ * Validate entity type.
+ */
+export declare function validateEntityType(type: string): boolean;
+/**
+ * Get validation error message for invalid type.
+ */
+export declare function getInvalidTypeError(type: string): string;
+/**
+ * Build human-readable summary text for query results.
+ */
+export declare function buildQuerySummaryText(result: QueryResult, filters: QueryFilters): string;
+//# sourceMappingURL=service.d.ts.map

package/dist/query/service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"service.d.ts","sourceRoot":"","sources":["../../src/query/service.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAQlD,MAAM,WAAW,YAAY;IAC3B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACzC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,eAAO,MAAM,kBAAkB,UAS9B,CAAC;AAEF;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,YAAY,GAAG,MAAM,CAqClE;AAED;;GAEG;AACH,wBAAsB,aAAa,CACjC,MAAM,EAAE,aAAa,EACrB,OAAO,EAAE,YAAY,GACpB,OAAO,CAAC,WAAW,CAAC,CAmCtB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAExD;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,YAAY,GACpB,MAAM,CAkBR"}