@bevel-software/platform-core-backend 0.19.0 → 0.21.0

package/dist/shared/kb-walk.d.ts

@@ -1,52 +0,0 @@
-/**
- * THE walk of a knowledge-base checkout.
- *
- * Every reader of the tree — the access resolver looking for rules, plugin
- * discovery looking for manifests, a rename looking for grants, the catalog
- * scanners — used to carry a recursive `readdir` loop of its own, each with
- * its own skip list, its own idea of what an unreadable folder means and its
- * own visiting order. Two loops that disagree on one of those are two
- * answers to "what is in the tree", and every such disagreement was a bug.
- *
- * So there is one loop, and it decides three things once:
- *
- *   - WHAT IS SKIPPED: {@link isSkippedEntry} — dot-entries (`.git`, a parked
- *     delete) and vendored dependencies. Nothing else is pruned; a listener
- *     that stops at a leaf of its own (a skill folder, a plugin folder)
- *     simply ignores what lies beneath it.
- *   - IN WHAT ORDER: each folder's entries in {@link comparePathComponents}
- *     order, so "first by path" means the same thing to every listener.
- *   - WHAT A HOLE IS: a folder that exists but could not be listed is
- *     reported as an event and in the result — never thrown, never silently
- *     skipped — so a reader can show what it saw and a writer can refuse.
- *     A folder that vanished between listing and visiting is not a hole.
- *
- * Listeners see the same events in the same order; what each makes of them
- * is its own business (`.bevelignore` included — the explorer honours it,
- * the resolver must not, so it is a listener's decision, not the walk's).
- */
-export declare function isSkippedEntry(name: string): boolean;
-/** A directory entry as the walk presents it: a name and what it is. */
-export interface WalkedEntry {
-    name: string;
-    isDirectory(): boolean;
-    isFile(): boolean;
-}
-export interface KbWalkListener {
-    /** A folder was listed. `rel` is repo-relative (`''` for the root); `entries` are its children, skipped ones removed, in walk order. */
-    onDir?(rel: string, entries: readonly WalkedEntry[]): void | Promise<void>;
-    /** A file was seen. `dir` is its folder (`''` for the root), `name` its basename. */
-    onFile?(dir: string, name: string): void | Promise<void>;
-    /** A folder that exists but could not be listed. */
-    onHole?(rel: string, err: unknown): void | Promise<void>;
-}
-export interface KbWalkResult {
-    /** Every folder that could not be listed, repo-relative (`''` for the root). */
-    holes: string[];
-}
-/**
- * Walk the checkout at `root`, driving every listener from one traversal.
- * A missing root is an empty tree. Listener errors propagate untouched.
- */
-export declare function walkKb(root: string, listeners: readonly KbWalkListener[]): Promise<KbWalkResult>;
-//# sourceMappingURL=kb-walk.d.ts.map

package/dist/shared/kb-walk.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"kb-walk.d.ts","sourceRoot":"","sources":["../../src/shared/kb-walk.ts"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAEpD;AAED,wEAAwE;AACxE,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,IAAI,OAAO,CAAC;IACvB,MAAM,IAAI,OAAO,CAAC;CACnB;AAED,MAAM,WAAW,cAAc;IAC7B,wIAAwI;IACxI,KAAK,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,WAAW,EAAE,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3E,qFAAqF;IACrF,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACzD,oDAAoD;IACpD,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC1D;AAED,MAAM,WAAW,YAAY;IAC3B,gFAAgF;IAChF,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED;;;GAGG;AACH,wBAAsB,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,cAAc,EAAE,GAAG,OAAO,CAAC,YAAY,CAAC,CAiCtG"}

package/dist/shared/kb-walk.js

@@ -1,76 +0,0 @@
-import path from 'node:path';
-import fs from 'node:fs/promises';
-import { isAbsence } from './fs-errors.js';
-import { comparePathComponents } from './path-order.js';
-/**
- * THE walk of a knowledge-base checkout.
- *
- * Every reader of the tree — the access resolver looking for rules, plugin
- * discovery looking for manifests, a rename looking for grants, the catalog
- * scanners — used to carry a recursive `readdir` loop of its own, each with
- * its own skip list, its own idea of what an unreadable folder means and its
- * own visiting order. Two loops that disagree on one of those are two
- * answers to "what is in the tree", and every such disagreement was a bug.
- *
- * So there is one loop, and it decides three things once:
- *
- *   - WHAT IS SKIPPED: {@link isSkippedEntry} — dot-entries (`.git`, a parked
- *     delete) and vendored dependencies. Nothing else is pruned; a listener
- *     that stops at a leaf of its own (a skill folder, a plugin folder)
- *     simply ignores what lies beneath it.
- *   - IN WHAT ORDER: each folder's entries in {@link comparePathComponents}
- *     order, so "first by path" means the same thing to every listener.
- *   - WHAT A HOLE IS: a folder that exists but could not be listed is
- *     reported as an event and in the result — never thrown, never silently
- *     skipped — so a reader can show what it saw and a writer can refuse.
- *     A folder that vanished between listing and visiting is not a hole.
- *
- * Listeners see the same events in the same order; what each makes of them
- * is its own business (`.bevelignore` included — the explorer honours it,
- * the resolver must not, so it is a listener's decision, not the walk's).
- */
-export function isSkippedEntry(name) {
-    return name.startsWith('.') || name === 'node_modules';
-}
-/**
- * Walk the checkout at `root`, driving every listener from one traversal.
- * A missing root is an empty tree. Listener errors propagate untouched.
- */
-export async function walkKb(root, listeners) {
-    const holes = [];
-    const visit = async (abs, rel) => {
-        let listed;
-        try {
-            listed = await fs.readdir(abs, { withFileTypes: true });
-        }
-        catch (err) {
-            if (isAbsence(err)) {
-                // The root: a checkout without this tree, an empty walk. Deeper: a
-                // folder that vanished between listing and visiting — not a hole.
-                return;
-            }
-            holes.push(rel);
-            for (const l of listeners)
-                await l.onHole?.(rel, err);
-            return;
-        }
-        const entries = listed
-            .filter((e) => !isSkippedEntry(e.name) && (e.isDirectory() || e.isFile()))
-            .sort((a, b) => comparePathComponents(a.name, b.name));
-        for (const l of listeners)
-            await l.onDir?.(rel, entries);
-        for (const entry of entries) {
-            const childRel = rel ? `${rel}/${entry.name}` : entry.name;
-            if (entry.isDirectory()) {
-                await visit(path.join(abs, entry.name), childRel);
-            }
-            else {
-                for (const l of listeners)
-                    await l.onFile?.(rel, entry.name);
-            }
-        }
-    };
-    await visit(root, '');
-    return { holes };
-}
-//# sourceMappingURL=kb-walk.js.map

package/dist/shared/kb-walk.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"kb-walk.js","sourceRoot":"","sources":["../../src/shared/kb-walk.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAClC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AAExD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,IAAI,KAAK,cAAc,CAAC;AACzD,CAAC;AAuBD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,IAAY,EAAE,SAAoC;IAC7E,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,MAAM,KAAK,GAAG,KAAK,EAAE,GAAW,EAAE,GAAW,EAAiB,EAAE;QAC9D,IAAI,MAAkC,CAAC;QACvC,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,mEAAmE;gBACnE,kEAAkE;gBAClE,OAAO;YACT,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,CAAC,IAAI,SAAS;gBAAE,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACtD,OAAO;QACT,CAAC;QACD,MAAM,OAAO,GAAkB,MAAM;aAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;aACzE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACzD,KAAK,MAAM,CAAC,IAAI,SAAS;YAAE,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACzD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;YAC3D,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;gBACxB,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;YACpD,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,CAAC,IAAI,SAAS;oBAAE,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACtB,OAAO,EAAE,KAAK,EAAE,CAAC;AACnB,CAAC"}