@framers/agentos 0.1.56 → 0.1.57

package/dist/core/utils/text-utils.js

@@ -0,0 +1,254 @@
+/**
+ * @fileoverview Shared text utility functions used across AgentOS modules.
+ *
+ * These utilities cover common text-processing operations: numeric clamping,
+ * safe JSON parsing (including markdown code-fence stripping), tokenisation,
+ * text normalisation, and a lightweight token-count estimator used wherever
+ * the exact subword count is not critical.
+ *
+ * All functions are pure (no side-effects) and operate synchronously so they
+ * can be called from any context — including hot paths and web workers.
+ *
+ * @module agentos/core/utils/text-utils
+ */
+// ---------------------------------------------------------------------------
+// Numeric helpers
+// ---------------------------------------------------------------------------
+/**
+ * Clamps a numeric `value` to the closed interval [`min`, `max`].
+ *
+ * @example
+ * ```typescript
+ * clamp(5, 0, 10);  // → 5
+ * clamp(-3, 0, 10); // → 0
+ * clamp(15, 0, 10); // → 10
+ * ```
+ *
+ * @param value - The number to clamp.
+ * @param min   - The inclusive lower bound.
+ * @param max   - The inclusive upper bound.
+ * @returns The clamped value, guaranteed to satisfy `min <= result <= max`.
+ */
+export function clamp(value, min, max) {
+    // Guard: if min > max the range is degenerate; return min as a safe fallback.
+    if (min > max) {
+        return min;
+    }
+    return Math.min(Math.max(value, min), max);
+}
+// ---------------------------------------------------------------------------
+// JSON parsing
+// ---------------------------------------------------------------------------
+/**
+ * Safely parses a JSON string, stripping markdown code fences if present.
+ *
+ * LLMs frequently wrap JSON in triple-backtick blocks (e.g. ` ```json … ``` `
+ * or ` ``` … ``` `).  This function strips those fences before attempting
+ * `JSON.parse`, so callers do not need to pre-process LLM output.
+ *
+ * @example
+ * ```typescript
+ * // Plain JSON
+ * parseJsonResponse<{ ok: boolean }>('{"ok":true}'); // → { ok: true }
+ *
+ * // Markdown-fenced JSON
+ * parseJsonResponse('```json\n{"ok":true}\n```'); // → { ok: true }
+ *
+ * // Invalid input
+ * parseJsonResponse('not json'); // → null
+ * ```
+ *
+ * @typeParam T - Expected shape of the parsed value.
+ * @param response - Raw string that may contain JSON, optionally wrapped in
+ *   markdown code fences.
+ * @returns The parsed value cast to `T`, or `null` if parsing fails for any
+ *   reason (syntax error, empty input, etc.).
+ */
+export function parseJsonResponse(response) {
+    if (!response || typeof response !== 'string') {
+        return null;
+    }
+    // Strip leading/trailing whitespace first.
+    let raw = response.trim();
+    // Remove markdown code fences.  Handles both:
+    //   ```json\n…\n```  and  ```\n…\n```
+    const fencePattern = /^```(?:json|javascript|js|ts|typescript)?\s*\n?([\s\S]*?)\n?```$/i;
+    const fenceMatch = fencePattern.exec(raw);
+    if (fenceMatch) {
+        // fenceMatch[1] is the content between the fences.
+        raw = fenceMatch[1].trim();
+    }
+    try {
+        return JSON.parse(raw);
+    }
+    catch {
+        // Parsing failed — return null rather than throwing so callers can handle
+        // gracefully without a try/catch at every call site.
+        return null;
+    }
+}
+// ---------------------------------------------------------------------------
+// Tokenisation & normalisation
+// ---------------------------------------------------------------------------
+/**
+ * Splits text into lowercase word tokens, stripping punctuation.
+ *
+ * This is an intentionally simple, dependency-free tokeniser suited for tasks
+ * like keyword matching, vocabulary analysis, and lightweight NLP pipelines.
+ * It is *not* a subword tokeniser and does not respect language-specific rules.
+ *
+ * Steps performed:
+ * 1. Convert to lowercase.
+ * 2. Replace non-alphanumeric characters (except spaces) with spaces.
+ * 3. Split on whitespace.
+ * 4. Drop empty strings that can arise from consecutive separators.
+ *
+ * @example
+ * ```typescript
+ * tokenize('Hello, World!');    // → ['hello', 'world']
+ * tokenize('foo  bar\tbaz');    // → ['foo', 'bar', 'baz']
+ * tokenize('');                 // → []
+ * ```
+ *
+ * @param text - The string to tokenise.
+ * @returns An array of lowercase word tokens with punctuation removed.
+ */
+export function tokenize(text) {
+    if (!text || typeof text !== 'string') {
+        return [];
+    }
+    return (text
+        .toLowerCase()
+        // Replace every run of non-alphanumeric, non-space chars with a space.
+        .replace(/[^a-z0-9\s]/g, ' ')
+        // Split on any run of whitespace.
+        .split(/\s+/)
+        // Remove empty strings produced by leading/trailing whitespace or
+        // consecutive separators.
+        .filter((token) => token.length > 0));
+}
+/**
+ * Normalises text by lowercasing, stripping punctuation, and collapsing
+ * internal whitespace runs to a single space.
+ *
+ * This produces a canonical form useful for fuzzy comparisons, deduplication,
+ * and pre-processing before embedding or classification.
+ *
+ * Steps performed:
+ * 1. Convert to lowercase.
+ * 2. Replace non-alphanumeric characters (except spaces) with spaces.
+ * 3. Collapse consecutive whitespace to a single space.
+ * 4. Trim leading and trailing whitespace.
+ *
+ * @example
+ * ```typescript
+ * normalizeText('Hello, World!');       // → 'hello world'
+ * normalizeText('  foo   bar  ');       // → 'foo bar'
+ * normalizeText("it's a test!");        // → 'it s a test'
+ * ```
+ *
+ * @param text - The string to normalise.
+ * @returns A normalised string.
+ */
+export function normalizeText(text) {
+    if (!text || typeof text !== 'string') {
+        return '';
+    }
+    return (text
+        .toLowerCase()
+        // Replace punctuation/symbols with spaces.
+        .replace(/[^a-z0-9\s]/g, ' ')
+        // Collapse runs of whitespace to a single space.
+        .replace(/\s+/g, ' ')
+        .trim());
+}
+// ---------------------------------------------------------------------------
+// Token estimation
+// ---------------------------------------------------------------------------
+/**
+ * Estimates the number of LLM tokens in a string using the rough heuristic
+ * of **1 token ≈ 4 characters** (the widely-cited GPT-family average).
+ *
+ * This is intentionally approximate. It is suitable for budget checks,
+ * sliding-window sizing, and other cost-control logic where precision is not
+ * required.  For exact subword counts, use the model's native tokeniser.
+ *
+ * @example
+ * ```typescript
+ * estimateTokens('Hello!');     // → 2  (6 chars / 4 → ceil(1.5) = 2)
+ * estimateTokens('');           // → 0
+ * estimateTokens('a'.repeat(8)); // → 2
+ * ```
+ *
+ * @param text - The string whose token count should be estimated.
+ * @returns A non-negative integer estimate of the token count.
+ *   Returns `0` for empty or non-string input.
+ */
+export function estimateTokens(text) {
+    if (!text || typeof text !== 'string') {
+        return 0;
+    }
+    return Math.ceil(text.length / 4);
+}
+// ---------------------------------------------------------------------------
+// Vector similarity
+// ---------------------------------------------------------------------------
+/**
+ * Computes the cosine similarity between two numeric vectors.
+ *
+ * Cosine similarity measures the cosine of the angle between two vectors in
+ * an inner-product space.  It ranges from **-1.0** (perfectly opposite
+ * directions) to **1.0** (perfectly identical directions), with **0** meaning
+ * the vectors are orthogonal (no linear similarity).
+ *
+ * This single implementation consolidates 6+ duplicate `cosineSimilarity`
+ * helpers that previously existed across the AgentOS codebase (discovery,
+ * social-posting, rag, etc.), providing a single well-tested source of truth.
+ *
+ * ### Edge-case behaviour
+ * | Condition | Return value | Reason |
+ * |---|---|---|
+ * | Empty arrays | `0` | Division by zero is undefined; 0 is the safe neutral value. |
+ * | Mismatched dimensions | `0` | Meaningless to compare vectors in different spaces. |
+ * | Either vector is the zero vector | `0` | Magnitude is 0, denominator would be 0. |
+ *
+ * @example
+ * ```typescript
+ * // Identical unit vectors → 1
+ * cosineSimilarity([1, 0], [1, 0]);  // → 1.0
+ *
+ * // Orthogonal vectors → 0
+ * cosineSimilarity([1, 0], [0, 1]);  // → 0
+ *
+ * // Opposite unit vectors → -1
+ * cosineSimilarity([1, 0], [-1, 0]); // → -1.0
+ *
+ * // Non-unit but parallel vectors → 1
+ * cosineSimilarity([2, 4], [1, 2]);  // → 1.0
+ * ```
+ *
+ * @param a - First numeric vector (any dimension ≥ 1).
+ * @param b - Second numeric vector — must have the same length as `a`.
+ * @returns Cosine similarity in the range `[-1, 1]`.
+ *   Returns `0` for mismatched dimensions, empty arrays, or zero-magnitude vectors.
+ */
+export function cosineSimilarity(a, b) {
+    // Guard: vectors must be non-empty and share the same dimensionality.
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    // Accumulate dot product and squared norms in a single pass for efficiency.
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i]; // contribution to the dot product
+        normA += a[i] * a[i]; // squared magnitude of a
+        normB += b[i] * b[i]; // squared magnitude of b
+    }
+    // Denominator is the product of the two vector magnitudes.
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    // Guard: if either vector is the zero vector the denominator is 0.
+    // Cosine similarity is undefined in that case; return 0 as the neutral value.
+    return denom === 0 ? 0 : dot / denom;
+}
+//# sourceMappingURL=text-utils.js.map

package/dist/core/utils/text-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-utils.js","sourceRoot":"","sources":["../../../src/core/utils/text-utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,KAAK,CAAC,KAAa,EAAE,GAAW,EAAE,GAAW;IAC3D,8EAA8E;IAC9E,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;QACd,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,iBAAiB,CAAc,QAAgB;IAC7D,IAAI,CAAC,QAAQ,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2CAA2C;IAC3C,IAAI,GAAG,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;IAE1B,8CAA8C;IAC9C,sCAAsC;IACtC,MAAM,YAAY,GAAG,mEAAmE,CAAC;IACzF,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1C,IAAI,UAAU,EAAE,CAAC;QACf,mDAAmD;QACnD,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAM,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,0EAA0E;QAC1E,qDAAqD;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,+BAA+B;AAC/B,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,CACL,IAAI;SACD,WAAW,EAAE;QACd,uEAAuE;SACtE,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;QAC7B,kCAAkC;SACjC,KAAK,CAAC,KAAK,CAAC;QACb,kEAAkE;QAClE,0BAA0B;SACzB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CACvC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,CACL,IAAI;SACD,WAAW,EAAE;QACd,2CAA2C;SAC1C,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;QAC7B,iDAAiD;SAChD,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CACV,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtC,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,sEAAsE;IACtE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtD,4EAA4E;IAC5E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAI,kCAAkC;QACzD,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,yBAAyB;QAChD,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,yBAAyB;IAClD,CAAC;IAED,2DAA2D;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAElD,mEAAmE;IACnE,8EAA8E;IAC9E,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC"}

package/dist/extensions/index.d.ts

@@ -8,5 +8,4 @@ export * from './manifest';
 export * from './RegistryConfig';
 export { MultiRegistryLoader } from './MultiRegistryLoader';
 export { ExtensionLoader } from './ExtensionLoader';
-export { createPiiRedactionPack, createExtensionPack as createPiiExtensionPack } from './packs/pii-redaction';
 //# sourceMappingURL=index.d.ts.map

package/dist/extensions/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/extensions/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,0BAA0B,CAAC;AACzC,cAAc,yBAAyB,CAAC;AACxC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,OAAO,EAAE,sBAAsB,EAAE,mBAAmB,IAAI,sBAAsB,EAAE,MAAM,uBAAuB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/extensions/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,0BAA0B,CAAC;AACzC,cAAc,yBAAyB,CAAC;AACxC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/extensions/index.js

@@ -8,6 +8,4 @@ export * from './manifest.js';
 export * from './RegistryConfig.js';
 export { MultiRegistryLoader } from './MultiRegistryLoader.js';
 export { ExtensionLoader } from './ExtensionLoader.js';
-// PII Redaction extension pack
-export { createPiiRedactionPack, createExtensionPack as createPiiExtensionPack } from './packs/pii-redaction/index.js';
 //# sourceMappingURL=index.js.map

package/dist/extensions/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/extensions/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,0BAA0B,CAAC;AACzC,cAAc,yBAAyB,CAAC;AACxC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,+BAA+B;AAC/B,OAAO,EAAE,sBAAsB,EAAE,mBAAmB,IAAI,sBAAsB,EAAE,MAAM,uBAAuB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/extensions/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC;AACzB,cAAc,0BAA0B,CAAC;AACzC,cAAc,yBAAyB,CAAC;AACxC,cAAc,qBAAqB,CAAC;AACpC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@framers/agentos",
-  "version": "0.1.56",
+  "version": "0.1.57",
   "description": "Modular AgentOS orchestration library",
   "type": "module",
   "main": "dist/index.js",
@@ -38,11 +38,6 @@
       "default": "./dist/core/guardrails/index.js",
       "types": "./dist/core/guardrails/index.d.ts"
     },
-    "./extensions/packs/pii-redaction": {
-      "import": "./dist/extensions/packs/pii-redaction/index.js",
-      "default": "./dist/extensions/packs/pii-redaction/index.js",
-      "types": "./dist/extensions/packs/pii-redaction/index.d.ts"
-    },
     "./core/safety": {
       "import": "./dist/core/safety/index.js",
       "default": "./dist/core/safety/index.js",

package/dist/extensions/packs/pii-redaction/EntityMerger.d.ts

@@ -1,127 +0,0 @@
-/**
- * @file EntityMerger.ts
- * @description Post-processing step that de-duplicates, filters, and merges
- * {@link PiiEntity} spans emitted by the multi-tier detection pipeline.
- *
- * When multiple recognisers (regex, NER, LLM judge) run over the same text
- * they frequently emit overlapping or duplicate spans.  This module resolves
- * those conflicts deterministically so that downstream redaction always
- * receives a clean, non-overlapping, sorted list of entities.
- *
- * ## Processing pipeline
- * 1. **Denylist boost** — entities whose text matches a denylist entry are
- *    promoted to score `1.0`, guaranteeing they survive threshold filtering.
- * 2. **Allowlist filter** — entities whose text matches an allowlist entry are
- *    unconditionally removed before any other processing.
- * 3. **Sort** — remaining entities are sorted by start offset; ties are broken
- *    by span length descending so that longer (more specific) spans are
- *    processed first in the overlap-resolution pass.
- * 4. **Overlap resolution** — a single-pass scan collapses overlapping and
- *    adjacent spans into the best representative entity (details below).
- * 5. **Threshold filter** — entities whose final score is below
- *    `confidenceThreshold` are removed.
- * 6. **Final sort** — output is sorted by start offset for stable iteration.
- *
- * @module pii-redaction/EntityMerger
- */
-import type { PiiEntity } from './types';
-/**
- * Options controlling how {@link mergeEntities} filters and merges a raw list
- * of {@link PiiEntity} detections.
- *
- * All properties are optional; omitting them applies neutral defaults (no
- * allow/denylist, no threshold filtering).
- */
-export interface MergeOptions {
-    /**
-     * Case-insensitive list of literal text values to **exclude** from the
-     * output.  Any entity whose `.text` matches one of these strings (after
-     * lowercasing) is silently dropped, even if it would otherwise pass all
-     * other filters.
-     *
-     * Typical use-case: whitelisting known-safe values such as
-     * `'support@company.com'` that appear in boilerplate and should never be
-     * redacted.
-     *
-     * @example `['support@example.com', '127.0.0.1']`
-     */
-    allowlist?: string[];
-    /**
-     * Case-insensitive list of literal text values that should **always** be
-     * redacted.  Any entity whose `.text` matches one of these strings (after
-     * lowercasing) has its score boosted to `1.0`, ensuring it survives
-     * threshold filtering regardless of the original confidence score.
-     *
-     * Typical use-case: internal project codenames or employee IDs that the
-     * organisation treats as sensitive.
-     *
-     * @example `['PROJ-SECRET', 'acme-internal']`
-     */
-    denylist?: string[];
-    /**
-     * Minimum confidence score (inclusive) an entity must have after all
-     * other transformations to be included in the output.
-     *
-     * Entities with `score < confidenceThreshold` are discarded.  When omitted
-     * (or `undefined`) no threshold filtering is applied and all entities with
-     * any score are retained.
-     *
-     * Must be in the range `[0, 1]` when provided.
-     *
-     * @default undefined (no threshold applied)
-     */
-    confidenceThreshold?: number;
-}
-/**
- * Merges a raw list of {@link PiiEntity} detections produced by one or more
- * recognisers into a clean, non-overlapping, threshold-filtered output list.
- *
- * The function is **pure** — it does not mutate any of its inputs.
- *
- * ### Merge rules (applied in order)
- *
- * 1. **Denylist boost**: If an entity's `.text` (lowercased) appears in
- *    `options.denylist` (lowercased), its `score` is set to `1.0`.
- *
- * 2. **Allowlist filter**: If an entity's `.text` (lowercased) appears in
- *    `options.allowlist` (lowercased), the entity is removed entirely.
- *
- * 3. **Sort**: Entities are sorted by `start` offset ascending; ties broken
- *    by span length descending so longer spans are preferred in step 4.
- *
- * 4. **Overlap resolution** (single-pass, left-to-right):
- *    - *Exact or subset overlap* (current span is fully inside last span, or
- *      they share the same offsets): keep whichever has the higher score.
- *    - *Current is longer AND score ≥ last*: the current span replaces the
- *      last accumulated span (it provides more context at equal or better
- *      confidence).
- *    - *Adjacent spans* (gap between end of last and start of current is ≤ 2
- *      characters **and** both have the same `entityType`): the two spans are
- *      merged into a single entity whose text bridges the gap.
- *    - *Otherwise*: both spans are kept as separate entities.
- *
- * 5. **Confidence threshold filter**: Entities with `score <
- *    options.confidenceThreshold` are removed.
- *
- * 6. **Final sort**: Output is sorted by `start` offset ascending.
- *
- * @param entities - Raw (possibly overlapping, unsorted) entity list from the
- *                   detection pipeline.
- * @param options  - Optional filtering / merging knobs.  Safe to omit.
- * @param text     - The original input string.  Required only when adjacent
- *                   merging may occur (needed to fill gap characters).
- *                   Defaults to `''` which produces a gap of spaces.
- * @returns A new array of non-overlapping {@link PiiEntity} objects sorted by
- *          `start` offset.
- *
- * @example
- * ```ts
- * const clean = mergeEntities(rawEntities, {
- *   allowlist: ['support@example.com'],
- *   denylist: ['secret-project'],
- *   confidenceThreshold: 0.6,
- * }, originalText);
- * ```
- */
-export declare function mergeEntities(entities: PiiEntity[], options?: MergeOptions, text?: string): PiiEntity[];
-//# sourceMappingURL=EntityMerger.d.ts.map

package/dist/extensions/packs/pii-redaction/EntityMerger.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"EntityMerger.d.ts","sourceRoot":"","sources":["../../../../src/extensions/packs/pii-redaction/EntityMerger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAMzC;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;;;;;;;OAWG;IACH,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IAErB;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IAEpB;;;;;;;;;;;OAWG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAgFD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDG;AACH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,SAAS,EAAE,EACrB,OAAO,GAAE,YAAiB,EAC1B,IAAI,SAAK,GACR,SAAS,EAAE,CAqIb"}