@lossless-claude/lcm 0.2.0

package/dist/src/prompts/system.yaml

@@ -0,0 +1,5 @@
+name: system
+description: System prompt for the LCM summarization engine
+variables: []
+template: |
+  You are a context-compaction summarization engine. Follow user instructions exactly and return plain text summary content only.

package/dist/src/retrieval.d.ts

@@ -0,0 +1,122 @@
+import type { ConversationStore, MessageSearchResult } from "./store/conversation-store.js";
+import type { SummaryStore, SummarySearchResult } from "./store/summary-store.js";
+export interface DescribeResult {
+    id: string;
+    type: "summary" | "file";
+    /** Summary-specific fields */
+    summary?: {
+        conversationId: number;
+        kind: "leaf" | "condensed";
+        content: string;
+        depth: number;
+        tokenCount: number;
+        descendantCount: number;
+        descendantTokenCount: number;
+        sourceMessageTokenCount: number;
+        fileIds: string[];
+        parentIds: string[];
+        childIds: string[];
+        messageIds: number[];
+        earliestAt: Date | null;
+        latestAt: Date | null;
+        subtree: Array<{
+            summaryId: string;
+            parentSummaryId: string | null;
+            depthFromRoot: number;
+            kind: "leaf" | "condensed";
+            depth: number;
+            tokenCount: number;
+            descendantCount: number;
+            descendantTokenCount: number;
+            sourceMessageTokenCount: number;
+            earliestAt: Date | null;
+            latestAt: Date | null;
+            childCount: number;
+            path: string;
+        }>;
+        createdAt: Date;
+    };
+    /** File-specific fields */
+    file?: {
+        conversationId: number;
+        fileName: string | null;
+        mimeType: string | null;
+        byteSize: number | null;
+        storageUri: string;
+        explorationSummary: string | null;
+        createdAt: Date;
+    };
+}
+export interface GrepInput {
+    query: string;
+    mode: "regex" | "full_text";
+    scope: "messages" | "summaries" | "both";
+    conversationId?: number;
+    since?: Date;
+    before?: Date;
+    limit?: number;
+}
+export interface GrepResult {
+    messages: MessageSearchResult[];
+    summaries: SummarySearchResult[];
+    totalMatches: number;
+}
+export interface ExpandInput {
+    summaryId: string;
+    /** Max traversal depth (default 1) */
+    depth?: number;
+    /** Include raw source messages at leaf level */
+    includeMessages?: boolean;
+    /** Max tokens to return before truncating */
+    tokenCap?: number;
+}
+export interface ExpandResult {
+    /** Child summaries found */
+    children: Array<{
+        summaryId: string;
+        kind: "leaf" | "condensed";
+        content: string;
+        tokenCount: number;
+    }>;
+    /** Source messages (only if includeMessages=true and hitting leaf summaries) */
+    messages: Array<{
+        messageId: number;
+        role: string;
+        content: string;
+        tokenCount: number;
+    }>;
+    /** Total estimated tokens in result */
+    estimatedTokens: number;
+    /** Whether result was truncated due to tokenCap */
+    truncated: boolean;
+}
+export declare class RetrievalEngine {
+    private conversationStore;
+    private summaryStore;
+    constructor(conversationStore: ConversationStore, summaryStore: SummaryStore);
+    /**
+     * Describe an LCM item by ID.
+     *
+     * - IDs starting with "sum_" are looked up as summaries (with lineage).
+     * - IDs starting with "file_" are looked up as large files.
+     * - Returns null if the item is not found.
+     */
+    describe(id: string): Promise<DescribeResult | null>;
+    private describeSummary;
+    private describeFile;
+    /**
+     * Search compacted history using regex or full-text search.
+     *
+     * Depending on `scope`, searches messages, summaries, or both (in parallel).
+     */
+    grep(input: GrepInput): Promise<GrepResult>;
+    /**
+     * Expand a summary to its children and/or source messages.
+     *
+     * - Condensed summaries: returns child summaries, recursing up to `depth`.
+     * - Leaf summaries with `includeMessages`: fetches the source messages.
+     * - Respects `tokenCap` and sets `truncated` when the cap is exceeded.
+     */
+    expand(input: ExpandInput): Promise<ExpandResult>;
+    private expandRecursive;
+}

package/dist/src/retrieval.js

@@ -0,0 +1,214 @@
+// ── Helpers ──────────────────────────────────────────────────────────────────
+/** Rough token estimate: ~4 chars per token. */
+function estimateTokens(content) {
+    return Math.ceil(content.length / 4);
+}
+// ── RetrievalEngine ──────────────────────────────────────────────────────────
+export class RetrievalEngine {
+    conversationStore;
+    summaryStore;
+    constructor(conversationStore, summaryStore) {
+        this.conversationStore = conversationStore;
+        this.summaryStore = summaryStore;
+    }
+    // ── describe ─────────────────────────────────────────────────────────────
+    /**
+     * Describe an LCM item by ID.
+     *
+     * - IDs starting with "sum_" are looked up as summaries (with lineage).
+     * - IDs starting with "file_" are looked up as large files.
+     * - Returns null if the item is not found.
+     */
+    async describe(id) {
+        if (id.startsWith("sum_")) {
+            return this.describeSummary(id);
+        }
+        if (id.startsWith("file_")) {
+            return this.describeFile(id);
+        }
+        return null;
+    }
+    async describeSummary(id) {
+        const summary = await this.summaryStore.getSummary(id);
+        if (!summary) {
+            return null;
+        }
+        // Fetch lineage in parallel
+        const [parents, children, messageIds, subtree] = await Promise.all([
+            this.summaryStore.getSummaryParents(id),
+            this.summaryStore.getSummaryChildren(id),
+            this.summaryStore.getSummaryMessages(id),
+            this.summaryStore.getSummarySubtree(id),
+        ]);
+        return {
+            id,
+            type: "summary",
+            summary: {
+                conversationId: summary.conversationId,
+                kind: summary.kind,
+                content: summary.content,
+                depth: summary.depth,
+                tokenCount: summary.tokenCount,
+                descendantCount: summary.descendantCount,
+                descendantTokenCount: summary.descendantTokenCount,
+                sourceMessageTokenCount: summary.sourceMessageTokenCount,
+                fileIds: summary.fileIds,
+                parentIds: parents.map((p) => p.summaryId),
+                childIds: children.map((c) => c.summaryId),
+                messageIds,
+                earliestAt: summary.earliestAt,
+                latestAt: summary.latestAt,
+                subtree: subtree.map((node) => ({
+                    summaryId: node.summaryId,
+                    parentSummaryId: node.parentSummaryId,
+                    depthFromRoot: node.depthFromRoot,
+                    kind: node.kind,
+                    depth: node.depth,
+                    tokenCount: node.tokenCount,
+                    descendantCount: node.descendantCount,
+                    descendantTokenCount: node.descendantTokenCount,
+                    sourceMessageTokenCount: node.sourceMessageTokenCount,
+                    earliestAt: node.earliestAt,
+                    latestAt: node.latestAt,
+                    childCount: node.childCount,
+                    path: node.path,
+                })),
+                createdAt: summary.createdAt,
+            },
+        };
+    }
+    async describeFile(id) {
+        const file = await this.summaryStore.getLargeFile(id);
+        if (!file) {
+            return null;
+        }
+        return {
+            id,
+            type: "file",
+            file: {
+                conversationId: file.conversationId,
+                fileName: file.fileName,
+                mimeType: file.mimeType,
+                byteSize: file.byteSize,
+                storageUri: file.storageUri,
+                explorationSummary: file.explorationSummary,
+                createdAt: file.createdAt,
+            },
+        };
+    }
+    // ── grep ─────────────────────────────────────────────────────────────────
+    /**
+     * Search compacted history using regex or full-text search.
+     *
+     * Depending on `scope`, searches messages, summaries, or both (in parallel).
+     */
+    async grep(input) {
+        const { query, mode, scope, conversationId, since, before, limit } = input;
+        const searchInput = { query, mode, conversationId, since, before, limit };
+        let messages = [];
+        let summaries = [];
+        if (scope === "messages") {
+            messages = await this.conversationStore.searchMessages(searchInput);
+        }
+        else if (scope === "summaries") {
+            summaries = await this.summaryStore.searchSummaries(searchInput);
+        }
+        else {
+            // scope === "both" — run in parallel
+            [messages, summaries] = await Promise.all([
+                this.conversationStore.searchMessages(searchInput),
+                this.summaryStore.searchSummaries(searchInput),
+            ]);
+        }
+        messages.sort((a, b) => b.createdAt.getTime() - a.createdAt.getTime());
+        summaries.sort((a, b) => b.createdAt.getTime() - a.createdAt.getTime());
+        return {
+            messages,
+            summaries,
+            totalMatches: messages.length + summaries.length,
+        };
+    }
+    // ── expand ───────────────────────────────────────────────────────────────
+    /**
+     * Expand a summary to its children and/or source messages.
+     *
+     * - Condensed summaries: returns child summaries, recursing up to `depth`.
+     * - Leaf summaries with `includeMessages`: fetches the source messages.
+     * - Respects `tokenCap` and sets `truncated` when the cap is exceeded.
+     */
+    async expand(input) {
+        const depth = input.depth ?? 1;
+        const includeMessages = input.includeMessages ?? false;
+        const tokenCap = input.tokenCap ?? Infinity;
+        const result = {
+            children: [],
+            messages: [],
+            estimatedTokens: 0,
+            truncated: false,
+        };
+        await this.expandRecursive(input.summaryId, depth, includeMessages, tokenCap, result);
+        return result;
+    }
+    async expandRecursive(summaryId, depth, includeMessages, tokenCap, result) {
+        if (depth <= 0) {
+            return;
+        }
+        if (result.truncated) {
+            return;
+        }
+        const summary = await this.summaryStore.getSummary(summaryId);
+        if (!summary) {
+            return;
+        }
+        if (summary.kind === "condensed") {
+            const children = await this.summaryStore.getSummaryChildren(summaryId);
+            for (const child of children) {
+                if (result.truncated) {
+                    break;
+                }
+                // Check if adding this child would exceed the token cap
+                if (result.estimatedTokens + child.tokenCount > tokenCap) {
+                    result.truncated = true;
+                    break;
+                }
+                result.children.push({
+                    summaryId: child.summaryId,
+                    kind: child.kind,
+                    content: child.content,
+                    tokenCount: child.tokenCount,
+                });
+                result.estimatedTokens += child.tokenCount;
+                // Recurse into children if depth allows
+                if (depth > 1) {
+                    await this.expandRecursive(child.summaryId, depth - 1, includeMessages, tokenCap, result);
+                }
+            }
+        }
+        else if (summary.kind === "leaf" && includeMessages) {
+            // Leaf summary — fetch source messages
+            const messageIds = await this.summaryStore.getSummaryMessages(summaryId);
+            for (const msgId of messageIds) {
+                if (result.truncated) {
+                    break;
+                }
+                const msg = await this.conversationStore.getMessageById(msgId);
+                if (!msg) {
+                    continue;
+                }
+                const tokenCount = msg.tokenCount || estimateTokens(msg.content);
+                if (result.estimatedTokens + tokenCount > tokenCap) {
+                    result.truncated = true;
+                    break;
+                }
+                result.messages.push({
+                    messageId: msg.messageId,
+                    role: msg.role,
+                    content: msg.content,
+                    tokenCount,
+                });
+                result.estimatedTokens += tokenCount;
+            }
+        }
+    }
+}
+//# sourceMappingURL=retrieval.js.map

package/dist/src/retrieval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retrieval.js","sourceRoot":"","sources":["../../src/retrieval.ts"],"names":[],"mappings":"AA6GA,gFAAgF;AAEhF,gDAAgD;AAChD,SAAS,cAAc,CAAC,OAAe;IACrC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACvC,CAAC;AAED,gFAAgF;AAEhF,MAAM,OAAO,eAAe;IAEhB;IACA;IAFV,YACU,iBAAoC,EACpC,YAA0B;QAD1B,sBAAiB,GAAjB,iBAAiB,CAAmB;QACpC,iBAAY,GAAZ,YAAY,CAAc;IACjC,CAAC;IAEJ,4EAA4E;IAE5E;;;;;;OAMG;IACH,KAAK,CAAC,QAAQ,CAAC,EAAU;QACvB,IAAI,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,eAAe,CAAC,EAAU;QACtC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,IAAI,CAAC;QACd,CAAC;QAED,4BAA4B;QAC5B,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACjE,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,EAAE,CAAC;YACxC,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,EAAE,CAAC;YACxC,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,EAAE,CAAC;SACxC,CAAC,CAAC;QAEH,OAAO;YACL,EAAE;YACF,IAAI,EAAE,SAAS;YACf,OAAO,EAAE;gBACP,cAAc,EAAE,OAAO,CAAC,cAAc;gBACtC,IAAI,EAAE,OAAO,CAAC,IAAI;gBAClB,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,eAAe,EAAE,OAAO,CAAC,eAAe;gBACxC,oBAAoB,EAAE,OAAO,CAAC,oBAAoB;gBAClD,uBAAuB,EAAE,OAAO,CAAC,uBAAuB;gBACxD,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC1C,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC1C,UAAU;gBACV,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,QAAQ,EAAE,OAAO,CAAC,QAAQ;gBAC1B,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBAC9B,SAAS,EAAE,IAAI,CAAC,SAAS;oBACzB,eAAe,EAAE,IAAI,CAAC,eAAe;oBACrC,aAAa,EAAE,IAAI,CAAC,aAAa;oBACjC,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,eAAe,EAAE,IAAI,CAAC,eAAe;oBACrC,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;oBAC/C,uBAAuB,EAAE,IAAI,CAAC,uBAAuB;oBACrD,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;iBAChB,CAAC,CAAC;gBACH,SAAS,EAAE,OAAO,CAAC,SAAS;aAC7B;SACF,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,YAAY,CAAC,EAAU;QACnC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO;YACL,EAAE;YACF,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE;gBACJ,cAAc,EAAE,IAAI,CAAC,cAAc;gBACnC,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;gBAC3C,SAAS,EAAE,IAAI,CAAC,SAAS;aAC1B;SACF,CAAC;IACJ,CAAC;IAED,4EAA4E;IAE5E;;;;OAIG;IACH,KAAK,CAAC,IAAI,CAAC,KAAgB;QACzB,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;QAE3E,MAAM,WAAW,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QAE1E,IAAI,QAAQ,GAA0B,EAAE,CAAC;QACzC,IAAI,SAAS,GAA0B,EAAE,CAAC;QAE1C,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;YACzB,QAAQ,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QACtE,CAAC;aAAM,IAAI,KAAK,KAAK,WAAW,EAAE,CAAC;YACjC,SAAS,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;QACnE,CAAC;aAAM,CAAC;YACN,qCAAqC;YACrC,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBACxC,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,WAAW,CAAC;gBAClD,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,WAAW,CAAC;aAC/C,CAAC,CAAC;QACL,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;QACvE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;QAExE,OAAO;YACL,QAAQ;YACR,SAAS;YACT,YAAY,EAAE,QAAQ,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;SACjD,CAAC;IACJ,CAAC;IAED,4EAA4E;IAE5E;;;;;;OAMG;IACH,KAAK,CAAC,MAAM,CAAC,KAAkB;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;QAC/B,MAAM,eAAe,GAAG,KAAK,CAAC,eAAe,IAAI,KAAK,CAAC;QACvD,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAE5C,MAAM,MAAM,GAAiB;YAC3B,QAAQ,EAAE,EAAE;YACZ,QAAQ,EAAE,EAAE;YACZ,eAAe,EAAE,CAAC;YAClB,SAAS,EAAE,KAAK;SACjB,CAAC;QAEF,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAEtF,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,KAAK,CAAC,eAAe,CAC3B,SAAiB,EACjB,KAAa,EACb,eAAwB,EACxB,QAAgB,EAChB,MAAoB;QAEpB,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,OAAO;QACT,CAAC;QACD,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC9D,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;YAEvE,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC7B,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;oBACrB,MAAM;gBACR,CAAC;gBAED,wDAAwD;gBACxD,IAAI,MAAM,CAAC,eAAe,GAAG,KAAK,CAAC,UAAU,GAAG,QAAQ,EAAE,CAAC;oBACzD,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC;oBACxB,MAAM;gBACR,CAAC;gBAED,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;oBACnB,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,OAAO,EAAE,KAAK,CAAC,OAAO;oBACtB,UAAU,EAAE,KAAK,CAAC,UAAU;iBAC7B,CAAC,CAAC;gBACH,MAAM,CAAC,eAAe,IAAI,KAAK,CAAC,UAAU,CAAC;gBAE3C,wCAAwC;gBACxC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;oBACd,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC5F,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,IAAI,eAAe,EAAE,CAAC;YACtD,uCAAuC;YACvC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;YAEzE,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;gBAC/B,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;oBACrB,MAAM;gBACR,CAAC;gBAED,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;gBAC/D,IAAI,CAAC,GAAG,EAAE,CAAC;oBACT,SAAS;gBACX,CAAC;gBAED,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAEjE,IAAI,MAAM,CAAC,eAAe,GAAG,UAAU,GAAG,QAAQ,EAAE,CAAC;oBACnD,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC;oBACxB,MAAM;gBACR,CAAC;gBAED,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;oBACnB,SAAS,EAAE,GAAG,CAAC,SAAS;oBACxB,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,UAAU;iBACX,CAAC,CAAC;gBACH,MAAM,CAAC,eAAe,IAAI,UAAU,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/src/scrub.d.ts

@@ -0,0 +1,46 @@
+export declare const BUILT_IN_PATTERNS: string[];
+export interface ScrubCounts {
+    text: string;
+    builtIn: number;
+    global: number;
+    project: number;
+}
+export declare class ScrubEngine {
+    private readonly spanningPatterns;
+    private readonly tokenPatterns;
+    /** Original index (into the combined [builtIn, global, project] array) for each spanning pattern. */
+    private readonly _spanningOrigIdx;
+    /** Original index for each token pattern. */
+    private readonly _tokenOrigIdx;
+    /** Number of global patterns (for category accounting). */
+    private readonly _globalPatternCount;
+    readonly invalidPatterns: string[];
+    constructor(globalPatterns: string[], projectPatterns: string[]);
+    /**
+     * Redact all matching patterns in text, returning the scrubbed text along
+     * with per-category counts of how many redactions were made.
+     *
+     * Strategy:
+     * - "Spanning" patterns (those that can match across whitespace) are applied
+     *   to the full text via a multi-range merge to avoid one pattern consuming
+     *   another's matches.
+     * - "Token" patterns (no whitespace/dot in source) are applied token-by-token
+     *   so that greedy `.*`-style patterns in one token don't eat adjacent tokens.
+     */
+    scrubWithCounts(text: string): ScrubCounts;
+    /**
+     * Redact all matching patterns in text, replacing matches with [REDACTED].
+     *
+     * Strategy:
+     * - "Spanning" patterns (those that can match across whitespace) are applied
+     *   to the full text via a multi-range merge to avoid one pattern consuming
+     *   another's matches.
+     * - "Token" patterns (no whitespace/dot in source) are applied token-by-token
+     *   so that greedy `.*`-style patterns in one token don't eat adjacent tokens.
+     */
+    scrub(text: string): string;
+    /** Parse a sensitive-patterns.txt file. Returns empty array if file is absent. */
+    static loadProjectPatterns(filePath: string): Promise<string[]>;
+    /** Build a ScrubEngine for a given project directory. */
+    static forProject(globalPatterns: string[], projectDir: string): Promise<ScrubEngine>;
+}

package/dist/src/scrub.js

@@ -0,0 +1,184 @@
+import { readFile } from "node:fs/promises";
+import { join } from "node:path";
+export const BUILT_IN_PATTERNS = [
+    "sk-[A-Za-z0-9]{20,}",
+    "sk-ant-[A-Za-z0-9\\-]{40,}",
+    "ghp_[A-Za-z0-9]{36}",
+    "AKIA[0-9A-Z]{16}",
+    "-----BEGIN .* KEY-----",
+    "Bearer [A-Za-z0-9\\-._~+/]+=*",
+    "[Pp]assword\\s*[:=]\\s*\\S+",
+];
+/**
+ * Returns true if a regex pattern source can match across whitespace boundaries.
+ * Patterns containing a literal space, \s, or a dot (which matches space) are
+ * considered "spanning" and will be applied to the full text rather than
+ * token-by-token.
+ */
+function isSpanningPattern(source) {
+    // Check for literal space or the escape sequence \s — unambiguous spanning intent.
+    // Use string includes (not regex) so we detect the two-char sequence \s, not whitespace chars.
+    if (source.includes(" ") || source.includes("\\s"))
+        return true;
+    // Check for unescaped `.` which can match spaces
+    // Walk the source and look for `.` not preceded by `\`
+    for (let i = 0; i < source.length; i++) {
+        if (source[i] === "\\") {
+            i++; // skip escaped char
+            continue;
+        }
+        if (source[i] === ".")
+            return true;
+    }
+    return false;
+}
+export class ScrubEngine {
+    spanningPatterns = [];
+    tokenPatterns = [];
+    /** Original index (into the combined [builtIn, global, project] array) for each spanning pattern. */
+    _spanningOrigIdx = [];
+    /** Original index for each token pattern. */
+    _tokenOrigIdx = [];
+    /** Number of global patterns (for category accounting). */
+    _globalPatternCount;
+    invalidPatterns = [];
+    constructor(globalPatterns, projectPatterns) {
+        this._globalPatternCount = globalPatterns.length;
+        const all = [...BUILT_IN_PATTERNS, ...globalPatterns, ...projectPatterns];
+        for (let i = 0; i < all.length; i++) {
+            const source = all[i];
+            try {
+                const regex = new RegExp(source, "g");
+                if (isSpanningPattern(source)) {
+                    this.spanningPatterns.push({ source, regex });
+                    this._spanningOrigIdx.push(i);
+                }
+                else {
+                    this.tokenPatterns.push({ source, regex });
+                    this._tokenOrigIdx.push(i);
+                }
+            }
+            catch {
+                this.invalidPatterns.push(source);
+            }
+        }
+    }
+    /**
+     * Redact all matching patterns in text, returning the scrubbed text along
+     * with per-category counts of how many redactions were made.
+     *
+     * Strategy:
+     * - "Spanning" patterns (those that can match across whitespace) are applied
+     *   to the full text via a multi-range merge to avoid one pattern consuming
+     *   another's matches.
+     * - "Token" patterns (no whitespace/dot in source) are applied token-by-token
+     *   so that greedy `.*`-style patterns in one token don't eat adjacent tokens.
+     */
+    scrubWithCounts(text) {
+        const builtInCount = BUILT_IN_PATTERNS.length;
+        const globalCount = this._globalPatternCount;
+        const taggedRanges = [];
+        for (let pi = 0; pi < this.spanningPatterns.length; pi++) {
+            const { regex } = this.spanningPatterns[pi];
+            regex.lastIndex = 0;
+            let m;
+            while ((m = regex.exec(text)) !== null) {
+                taggedRanges.push({ range: [m.index, m.index + m[0].length], idx: this._spanningOrigIdx[pi] });
+                if (m[0].length === 0)
+                    regex.lastIndex++;
+            }
+        }
+        // Step 2: apply token patterns per whitespace-separated segment
+        const segments = text.split(/(\s+)/);
+        let offset = 0;
+        for (const seg of segments) {
+            if (!/^\s+$/.test(seg) && this.tokenPatterns.length > 0) {
+                for (let pi = 0; pi < this.tokenPatterns.length; pi++) {
+                    const { regex } = this.tokenPatterns[pi];
+                    regex.lastIndex = 0;
+                    let m;
+                    while ((m = regex.exec(seg)) !== null) {
+                        taggedRanges.push({ range: [offset + m.index, offset + m.index + m[0].length], idx: this._tokenOrigIdx[pi] });
+                        if (m[0].length === 0)
+                            regex.lastIndex++;
+                    }
+                }
+            }
+            offset += seg.length;
+        }
+        if (taggedRanges.length === 0)
+            return { text, builtIn: 0, global: 0, project: 0 };
+        // Sort by start position
+        taggedRanges.sort((a, b) => a.range[0] - b.range[0]);
+        // Merge overlapping ranges; when overlaps occur, the lowest original pattern
+        // index wins so that built-in > global > project and earlier patterns win.
+        const merged = [];
+        let cur = taggedRanges[0];
+        for (let i = 1; i < taggedRanges.length; i++) {
+            const next = taggedRanges[i];
+            if (next.range[0] <= cur.range[1]) {
+                cur = { range: [cur.range[0], Math.max(cur.range[1], next.range[1])], idx: Math.min(cur.idx, next.idx) };
+            }
+            else {
+                merged.push(cur);
+                cur = next;
+            }
+        }
+        merged.push(cur);
+        // Count redactions by category
+        let builtIn = 0;
+        let global = 0;
+        let project = 0;
+        for (const { idx } of merged) {
+            if (idx < builtInCount)
+                builtIn++;
+            else if (idx < builtInCount + globalCount)
+                global++;
+            else
+                project++;
+        }
+        // Build result string
+        let result = "";
+        let pos = 0;
+        for (const { range: [s, e] } of merged) {
+            result += text.slice(pos, s) + "[REDACTED]";
+            pos = e;
+        }
+        result += text.slice(pos);
+        return { text: result, builtIn, global, project };
+    }
+    /**
+     * Redact all matching patterns in text, replacing matches with [REDACTED].
+     *
+     * Strategy:
+     * - "Spanning" patterns (those that can match across whitespace) are applied
+     *   to the full text via a multi-range merge to avoid one pattern consuming
+     *   another's matches.
+     * - "Token" patterns (no whitespace/dot in source) are applied token-by-token
+     *   so that greedy `.*`-style patterns in one token don't eat adjacent tokens.
+     */
+    scrub(text) {
+        return this.scrubWithCounts(text).text;
+    }
+    /** Parse a sensitive-patterns.txt file. Returns empty array if file is absent. */
+    static async loadProjectPatterns(filePath) {
+        try {
+            const content = await readFile(filePath, "utf-8");
+            return content
+                .split("\n")
+                .map((line) => line.trim())
+                .filter((line) => line.length > 0 && !line.startsWith("#"));
+        }
+        catch (err) {
+            if (err.code === "ENOENT")
+                return [];
+            throw err;
+        }
+    }
+    /** Build a ScrubEngine for a given project directory. */
+    static async forProject(globalPatterns, projectDir) {
+        const projectPatterns = await ScrubEngine.loadProjectPatterns(join(projectDir, "sensitive-patterns.txt"));
+        return new ScrubEngine(globalPatterns, projectPatterns);
+    }
+}
+//# sourceMappingURL=scrub.js.map

package/dist/src/scrub.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scrub.js","sourceRoot":"","sources":["../../src/scrub.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,MAAM,CAAC,MAAM,iBAAiB,GAAa;IACzC,qBAAqB;IACrB,4BAA4B;IAC5B,qBAAqB;IACrB,kBAAkB;IAClB,wBAAwB;IACxB,+BAA+B;IAC/B,6BAA6B;CAC9B,CAAC;AAEF;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,MAAc;IACvC,mFAAmF;IACnF,+FAA+F;IAC/F,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAChE,iDAAiD;IACjD,uDAAuD;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACvB,CAAC,EAAE,CAAC,CAAC,oBAAoB;YACzB,SAAS;QACX,CAAC;QACD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;IACrC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AASD,MAAM,OAAO,WAAW;IACL,gBAAgB,GAA6C,EAAE,CAAC;IAChE,aAAa,GAA6C,EAAE,CAAC;IAC9E,qGAAqG;IACpF,gBAAgB,GAAa,EAAE,CAAC;IACjD,6CAA6C;IAC5B,aAAa,GAAa,EAAE,CAAC;IAC9C,2DAA2D;IAC1C,mBAAmB,CAAS;IACpC,eAAe,GAAa,EAAE,CAAC;IAExC,YAAY,cAAwB,EAAE,eAAyB;QAC7D,IAAI,CAAC,mBAAmB,GAAG,cAAc,CAAC,MAAM,CAAC;QACjD,MAAM,GAAG,GAAG,CAAC,GAAG,iBAAiB,EAAE,GAAG,cAAc,EAAE,GAAG,eAAe,CAAC,CAAC;QAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBACtC,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC9C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChC,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC3C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACH,eAAe,CAAC,IAAY;QAC1B,MAAM,YAAY,GAAG,iBAAiB,CAAC,MAAM,CAAC;QAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC;QAI7C,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YACzD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YAC5C,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACpB,IAAI,CAAyB,CAAC;YAC9B,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBACvC,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC/F,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,SAAS,EAAE,CAAC;YAC3C,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;oBACtD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;oBACzC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;oBACpB,IAAI,CAAyB,CAAC;oBAC9B,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;wBACtC,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;wBAC9G,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;4BAAE,KAAK,CAAC,SAAS,EAAE,CAAC;oBAC3C,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC;QACvB,CAAC;QAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;QAElF,yBAAyB;QACzB,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAErD,6EAA6E;QAC7E,2EAA2E;QAC3E,MAAM,MAAM,GAAoD,EAAE,CAAC;QACnE,IAAI,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClC,GAAG,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3G,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjB,GAAG,GAAG,IAAI,CAAC;YACb,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEjB,+BAA+B;QAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,EAAE,GAAG,EAAE,IAAI,MAAM,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,YAAY;gBAAE,OAAO,EAAE,CAAC;iBAC7B,IAAI,GAAG,GAAG,YAAY,GAAG,WAAW;gBAAE,MAAM,EAAE,CAAC;;gBAC/C,OAAO,EAAE,CAAC;QACjB,CAAC;QAED,sBAAsB;QACtB,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,MAAM,EAAE,CAAC;YACvC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,YAAY,CAAC;YAC5C,GAAG,GAAG,CAAC,CAAC;QACV,CAAC;QACD,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IACpD,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,IAAY;QAChB,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC;IAED,kFAAkF;IAClF,MAAM,CAAC,KAAK,CAAC,mBAAmB,CAAC,QAAgB;QAC/C,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAClD,OAAO,OAAO;iBACX,KAAK,CAAC,IAAI,CAAC;iBACX,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;iBAC1B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAK,GAA6B,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,EAAE,CAAC;YAChE,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;IAED,yDAAyD;IACzD,MAAM,CAAC,KAAK,CAAC,UAAU,CACrB,cAAwB,EACxB,UAAkB;QAElB,MAAM,eAAe,GAAG,MAAM,WAAW,CAAC,mBAAmB,CAC3D,IAAI,CAAC,UAAU,EAAE,wBAAwB,CAAC,CAC3C,CAAC;QACF,OAAO,IAAI,WAAW,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;IAC1D,CAAC;CACF"}

package/dist/src/sensitive.d.ts

@@ -0,0 +1,4 @@
+export declare function handleSensitive(argv: string[], cwd: string, configPath?: string): Promise<{
+    exitCode: number;
+    stdout: string;
+}>;