@hivehub/rulebook 5.3.2 → 5.4.0

package/dist/core/compress/compressor.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Deterministic prose compressor for `rulebook compress`.
+ *
+ * Applies only SAFE transformations — filler-word removal, pleasantry
+ * stripping, and redundant-phrase replacement. Never restructures
+ * sentences, never touches code, URLs, paths, commands, dates, or
+ * version numbers. That conservative scope is what makes the
+ * validator in `validator.ts` a sufficient safety net.
+ *
+ * When richer compression is wanted (useMemo → stabilize, "implement
+ * a solution for" → "fix"), the user can layer Claude-powered
+ * rewriting on top of this module. The validator contract is
+ * orthogonal to the rewriter — any future LLM-backed compressor gets
+ * graded against the same invariants.
+ *
+ * Grounded in `.rulebook/specs/RULEBOOK_TERSE.md` §Compression
+ * companion.
+ */
+import { type ValidationResult } from './validator.js';
+export interface CompressResult {
+    output: string;
+    retries: number;
+    validation: ValidationResult;
+}
+export interface CompressOptions {
+    /** Max retry count after validation failure. Defaults to 2. */
+    maxRetries?: number;
+}
+interface Segment {
+    protected: boolean;
+    text: string;
+}
+/**
+ * Split input into protected and prose segments.
+ * Protected: fenced code blocks, inline code, URLs.
+ * Everything else is prose.
+ */
+declare function segment(input: string): Segment[];
+declare function compressProse(prose: string): string;
+/**
+ * Compress `input` using the deterministic rewriter. Returns the
+ * compressed output along with the validation result and retry count.
+ *
+ * The retry loop is defensive: on this conservative algorithm we
+ * should never produce a validation failure (we only touch prose
+ * segments), so a failure means either (a) a prose segment
+ * contained a protected pattern we missed, or (b) an unusual edge
+ * case in the splitter. Retries progressively disable classes of
+ * transformations to preserve as much safety as possible.
+ */
+export declare function compress(input: string, options?: CompressOptions): CompressResult;
+/**
+ * Exported for tests.
+ */
+export declare const __test__: {
+    compressProse: typeof compressProse;
+    segment: typeof segment;
+};
+export {};
+//# sourceMappingURL=compressor.d.ts.map

package/dist/core/compress/compressor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compressor.d.ts","sourceRoot":"","sources":["../../../src/core/compress/compressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAwB,KAAK,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAE7E,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,gBAAgB,CAAC;CAC9B;AAED,MAAM,WAAW,eAAe;IAC9B,+DAA+D;IAC/D,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AA8DD,UAAU,OAAO;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;GAIG;AACH,iBAAS,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,EAAE,CA6CzC;AAaD,iBAAS,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CA8B5C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,eAAoB,GAAG,cAAc,CA0BrF;AAyCD;;GAEG;AACH,eAAO,MAAM,QAAQ;;;CAA6B,CAAC"}

package/dist/core/compress/compressor.js

@@ -0,0 +1,232 @@
+/**
+ * Deterministic prose compressor for `rulebook compress`.
+ *
+ * Applies only SAFE transformations — filler-word removal, pleasantry
+ * stripping, and redundant-phrase replacement. Never restructures
+ * sentences, never touches code, URLs, paths, commands, dates, or
+ * version numbers. That conservative scope is what makes the
+ * validator in `validator.ts` a sufficient safety net.
+ *
+ * When richer compression is wanted (useMemo → stabilize, "implement
+ * a solution for" → "fix"), the user can layer Claude-powered
+ * rewriting on top of this module. The validator contract is
+ * orthogonal to the rewriter — any future LLM-backed compressor gets
+ * graded against the same invariants.
+ *
+ * Grounded in `.rulebook/specs/RULEBOOK_TERSE.md` §Compression
+ * companion.
+ */
+import { extractors, validate } from './validator.js';
+// ── Transformation rules — order matters (phrase replacements first) ──
+/** Redundant phrases → shorter synonym. Applied to prose only. */
+const PHRASE_REPLACEMENTS = [
+    [/\bin order to\b/gi, 'to'],
+    [/\bmake sure to\b/gi, 'ensure'],
+    [/\bmake sure that\b/gi, 'ensure'],
+    [/\bthe reason is because\b/gi, 'because'],
+    [/\bthe reason why\b/gi, 'why'],
+    [/\bat this point in time\b/gi, 'now'],
+    [/\bwith regard to\b/gi, 'on'],
+    [/\bwith respect to\b/gi, 'on'],
+    [/\bdue to the fact that\b/gi, 'because'],
+    [/\ba number of\b/gi, 'several'],
+    [/\bfor the purpose of\b/gi, 'to'],
+    [/\bit is important to note that\b/gi, ''],
+    [/\bit should be noted that\b/gi, ''],
+];
+/** Leading pleasantries to strip from prose segments. */
+const PLEASANTRY_PREFIXES = [
+    /^\s*(sure|certainly|of course)[,!.]?\s+/i,
+    /^\s*(happy to help|great question|good point)[,!.]?\s+/i,
+    /^\s*(i'd|i would) be happy to[^.]*\.\s+/i,
+    /^\s*(let me)[^.]*\.\s+/i,
+];
+/** Filler words removed when they appear between word-boundaries. */
+const FILLER_WORDS = [
+    'just',
+    'really',
+    'basically',
+    'actually',
+    'simply',
+    'essentially',
+    'generally',
+    'frankly',
+    'honestly',
+    'literally',
+    'very',
+    'quite',
+    'perhaps',
+    'maybe',
+];
+/** Hedging phrases to remove. */
+const HEDGING_PATTERNS = [
+    /\bit might be worth\b/gi,
+    /\byou could consider\b/gi,
+    /\byou (?:may|might) want to\b/gi,
+    /\bi (?:think|believe|feel) that\b/gi,
+    // Lookahead uses `\s*\w` to tolerate whitespace collapsed by earlier
+    // substitutions (e.g. "I think  consider" after a "you might want to"
+    // strip leaves a double space before the next word).
+    /\bi (?:think|believe|feel)\s+(?=\w)/gi,
+    /\bin my opinion,?\s*/gi,
+];
+/**
+ * Split input into protected and prose segments.
+ * Protected: fenced code blocks, inline code, URLs.
+ * Everything else is prose.
+ */
+function segment(input) {
+    const segments = [];
+    // Layered matches: fenced code, inline code, URLs. First we build a
+    // mask of protected character ranges; prose is the complement.
+    const mask = new Array(input.length).fill(false);
+    const markRanges = (re) => {
+        const matches = input.matchAll(re);
+        for (const m of matches) {
+            if (m.index === undefined)
+                continue;
+            for (let i = m.index; i < m.index + m[0].length; i++)
+                mask[i] = true;
+        }
+    };
+    // Capture fenced code FIRST so inline-code inside ``` blocks doesn't
+    // get double-marked (it's already inside a fenced region).
+    markRanges(extractors.FENCED_CODE_RE);
+    // Inline code — recomputed on a version where fenced blocks are
+    // masked out so we don't match inside them.
+    const stripped = input
+        .split('')
+        .map((c, i) => (mask[i] ? ' ' : c))
+        .join('');
+    const inlineMatches = stripped.matchAll(extractors.INLINE_CODE_RE);
+    for (const m of inlineMatches) {
+        if (m.index === undefined)
+            continue;
+        for (let i = m.index; i < m.index + m[0].length; i++)
+            mask[i] = true;
+    }
+    markRanges(extractors.URL_RE);
+    markRanges(extractors.PATH_RE);
+    markRanges(extractors.DATE_RE);
+    markRanges(extractors.VERSION_RE);
+    // Now scan the mask to build contiguous segments.
+    let i = 0;
+    while (i < input.length) {
+        const isProtected = mask[i];
+        let j = i;
+        while (j < input.length && mask[j] === isProtected)
+            j++;
+        segments.push({ protected: isProtected, text: input.slice(i, j) });
+        i = j;
+    }
+    return segments;
+}
+// ── Prose rewriter ────────────────────────────────────────────────────
+function stripFillerWord(text, word) {
+    // Remove ", just," / " just " / " just." patterns but preserve
+    // sentence boundaries. Matches word only when surrounded by word
+    // boundaries and whitespace, not at the start of a capitalized
+    // sentence (where removal changes meaning more aggressively).
+    const pattern = new RegExp(`(?<=\\s|^)${word}\\s+(?=[a-zA-Z])`, 'gi');
+    return text.replace(pattern, '');
+}
+function compressProse(prose) {
+    let out = prose;
+    // 1. Strip leading pleasantries.
+    for (const re of PLEASANTRY_PREFIXES) {
+        out = out.replace(re, '');
+    }
+    // 2. Remove hedging phrases.
+    for (const re of HEDGING_PATTERNS) {
+        out = out.replace(re, '');
+    }
+    // 3. Apply phrase replacements.
+    for (const [re, repl] of PHRASE_REPLACEMENTS) {
+        out = out.replace(re, repl);
+    }
+    // 4. Remove filler words (as standalone mid-sentence tokens).
+    for (const word of FILLER_WORDS) {
+        out = stripFillerWord(out, word);
+    }
+    // 5. Normalize whitespace artifacts introduced by deletions.
+    out = out
+        .replace(/\s+([,.;:!?])/g, '$1') // collapse space-before-punct
+        .replace(/[ \t]{2,}/g, ' ') // collapse multiple spaces
+        .replace(/\n[ \t]+\n/g, '\n\n'); // trim trailing whitespace on blank lines
+    return out;
+}
+/**
+ * Compress `input` using the deterministic rewriter. Returns the
+ * compressed output along with the validation result and retry count.
+ *
+ * The retry loop is defensive: on this conservative algorithm we
+ * should never produce a validation failure (we only touch prose
+ * segments), so a failure means either (a) a prose segment
+ * contained a protected pattern we missed, or (b) an unusual edge
+ * case in the splitter. Retries progressively disable classes of
+ * transformations to preserve as much safety as possible.
+ */
+export function compress(input, options = {}) {
+    const maxRetries = options.maxRetries ?? 2;
+    let retries = 0;
+    let output = applyCompression(input, {
+        pleasantries: true,
+        hedging: true,
+        phraseReplacements: true,
+        fillerWords: true,
+    });
+    let validation = validate(input, output);
+    while (!validation.ok && retries < maxRetries) {
+        retries++;
+        // On retry 1 → disable filler words (most aggressive class).
+        // On retry 2 → also disable hedging.
+        // If still failing, fall through and return the failure state.
+        output = applyCompression(input, {
+            pleasantries: true,
+            hedging: retries < 2,
+            phraseReplacements: true,
+            fillerWords: false,
+        });
+        validation = validate(input, output);
+    }
+    return { output, retries, validation };
+}
+function applyCompression(input, enabled) {
+    const segs = segment(input);
+    const pieces = [];
+    for (const s of segs) {
+        if (s.protected) {
+            // Protected segments MUST pass through byte-identically.
+            // No whitespace normalization, no substitutions.
+            pieces.push(s.text);
+            continue;
+        }
+        let rewritten = s.text;
+        if (enabled.pleasantries) {
+            for (const re of PLEASANTRY_PREFIXES)
+                rewritten = rewritten.replace(re, '');
+        }
+        if (enabled.hedging) {
+            for (const re of HEDGING_PATTERNS)
+                rewritten = rewritten.replace(re, '');
+        }
+        if (enabled.phraseReplacements) {
+            for (const [re, repl] of PHRASE_REPLACEMENTS)
+                rewritten = rewritten.replace(re, repl);
+        }
+        if (enabled.fillerWords) {
+            for (const word of FILLER_WORDS)
+                rewritten = stripFillerWord(rewritten, word);
+        }
+        // Whitespace normalization INSIDE prose segments only. Keep
+        // inter-paragraph blank lines (don't collapse \n\n → \n).
+        rewritten = rewritten.replace(/ +([,.;:!?])/g, '$1').replace(/[ \t]{2,}/g, ' ');
+        pieces.push(rewritten);
+    }
+    return pieces.join('');
+}
+/**
+ * Exported for tests.
+ */
+export const __test__ = { compressProse, segment };
+//# sourceMappingURL=compressor.js.map

package/dist/core/compress/compressor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compressor.js","sourceRoot":"","sources":["../../../src/core/compress/compressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAyB,MAAM,gBAAgB,CAAC;AAa7E,yEAAyE;AAEzE,kEAAkE;AAClE,MAAM,mBAAmB,GAAoC;IAC3D,CAAC,mBAAmB,EAAE,IAAI,CAAC;IAC3B,CAAC,oBAAoB,EAAE,QAAQ,CAAC;IAChC,CAAC,sBAAsB,EAAE,QAAQ,CAAC;IAClC,CAAC,6BAA6B,EAAE,SAAS,CAAC;IAC1C,CAAC,sBAAsB,EAAE,KAAK,CAAC;IAC/B,CAAC,6BAA6B,EAAE,KAAK,CAAC;IACtC,CAAC,sBAAsB,EAAE,IAAI,CAAC;IAC9B,CAAC,uBAAuB,EAAE,IAAI,CAAC;IAC/B,CAAC,4BAA4B,EAAE,SAAS,CAAC;IACzC,CAAC,mBAAmB,EAAE,SAAS,CAAC;IAChC,CAAC,0BAA0B,EAAE,IAAI,CAAC;IAClC,CAAC,oCAAoC,EAAE,EAAE,CAAC;IAC1C,CAAC,+BAA+B,EAAE,EAAE,CAAC;CACtC,CAAC;AAEF,yDAAyD;AACzD,MAAM,mBAAmB,GAA0B;IACjD,0CAA0C;IAC1C,yDAAyD;IACzD,0CAA0C;IAC1C,yBAAyB;CAC1B,CAAC;AAEF,qEAAqE;AACrE,MAAM,YAAY,GAA0B;IAC1C,MAAM;IACN,QAAQ;IACR,WAAW;IACX,UAAU;IACV,QAAQ;IACR,aAAa;IACb,WAAW;IACX,SAAS;IACT,UAAU;IACV,WAAW;IACX,MAAM;IACN,OAAO;IACP,SAAS;IACT,OAAO;CACR,CAAC;AAEF,iCAAiC;AACjC,MAAM,gBAAgB,GAA0B;IAC9C,yBAAyB;IACzB,0BAA0B;IAC1B,iCAAiC;IACjC,qCAAqC;IACrC,qEAAqE;IACrE,sEAAsE;IACtE,qDAAqD;IACrD,uCAAuC;IACvC,wBAAwB;CACzB,CAAC;AASF;;;;GAIG;AACH,SAAS,OAAO,CAAC,KAAa;IAC5B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,oEAAoE;IACpE,+DAA+D;IAC/D,MAAM,IAAI,GAAG,IAAI,KAAK,CAAU,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAE1D,MAAM,UAAU,GAAG,CAAC,EAAU,EAAQ,EAAE;QACtC,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;gBAAE,SAAS;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACvE,CAAC;IACH,CAAC,CAAC;IAEF,qEAAqE;IACrE,2DAA2D;IAC3D,UAAU,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;IACtC,gEAAgE;IAChE,4CAA4C;IAC5C,MAAM,QAAQ,GAAG,KAAK;SACnB,KAAK,CAAC,EAAE,CAAC;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC,IAAI,CAAC,EAAE,CAAC,CAAC;IACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;IACnE,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS;YAAE,SAAS;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACvE,CAAC;IACD,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC9B,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC/B,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC/B,UAAU,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAElC,kDAAkD;IAClD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,WAAW;YAAE,CAAC,EAAE,CAAC;QACxD,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,yEAAyE;AAEzE,SAAS,eAAe,CAAC,IAAY,EAAE,IAAY;IACjD,+DAA+D;IAC/D,iEAAiE;IACjE,+DAA+D;IAC/D,8DAA8D;IAC9D,MAAM,OAAO,GAAG,IAAI,MAAM,CAAC,aAAa,IAAI,kBAAkB,EAAE,IAAI,CAAC,CAAC;IACtE,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,aAAa,CAAC,KAAa;IAClC,IAAI,GAAG,GAAG,KAAK,CAAC;IAEhB,iCAAiC;IACjC,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,6BAA6B;IAC7B,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAClC,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,gCAAgC;IAChC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,mBAAmB,EAAE,CAAC;QAC7C,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,8DAA8D;IAC9D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,GAAG,GAAG,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,6DAA6D;IAC7D,GAAG,GAAG,GAAG;SACN,OAAO,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC,8BAA8B;SAC9D,OAAO,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,2BAA2B;SACtD,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,0CAA0C;IAE7E,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa,EAAE,UAA2B,EAAE;IACnE,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC;IAC3C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE;QACnC,YAAY,EAAE,IAAI;QAClB,OAAO,EAAE,IAAI;QACb,kBAAkB,EAAE,IAAI;QACxB,WAAW,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,IAAI,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEzC,OAAO,CAAC,UAAU,CAAC,EAAE,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QAC9C,OAAO,EAAE,CAAC;QACV,6DAA6D;QAC7D,qCAAqC;QACrC,+DAA+D;QAC/D,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE;YAC/B,YAAY,EAAE,IAAI;YAClB,OAAO,EAAE,OAAO,GAAG,CAAC;YACpB,kBAAkB,EAAE,IAAI;YACxB,WAAW,EAAE,KAAK;SACnB,CAAC,CAAC;QACH,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AACzC,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAa,EACb,OAKC;IAED,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAChB,yDAAyD;YACzD,iDAAiD;YACjD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpB,SAAS;QACX,CAAC;QACD,IAAI,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC;QACvB,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YACzB,KAAK,MAAM,EAAE,IAAI,mBAAmB;gBAAE,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,gBAAgB;gBAAE,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC/B,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,mBAAmB;gBAAE,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,YAAY;gBAAE,SAAS,GAAG,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAChF,CAAC;QACD,4DAA4D;QAC5D,0DAA0D;QAC1D,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC"}

package/dist/core/compress/discover.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Discover candidate markdown memory files in a project.
+ *
+ * Caveman-compress is advertised as a tool for the files the model
+ * READS on every session, so this helper surfaces the same class of
+ * files: project-root memory markdown (`CLAUDE.md`, `AGENTS.md`,
+ * `AGENTS.override.md`) plus long-lived `.rulebook/` notes and
+ * knowledge/learning entries.
+ */
+export interface Candidate {
+    relPath: string;
+    absPath: string;
+    bytes: number;
+    hasBackup: boolean;
+    backupBytes?: number;
+    backupRatio?: number;
+}
+export declare function listCompressCandidates(projectRoot: string): Promise<Candidate[]>;
+//# sourceMappingURL=discover.d.ts.map

package/dist/core/compress/discover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"discover.d.ts","sourceRoot":"","sources":["../../../src/core/compress/discover.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAKH,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AA0CD,wBAAsB,sBAAsB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAmDtF"}

package/dist/core/compress/discover.js

@@ -0,0 +1,100 @@
+/**
+ * Discover candidate markdown memory files in a project.
+ *
+ * Caveman-compress is advertised as a tool for the files the model
+ * READS on every session, so this helper surfaces the same class of
+ * files: project-root memory markdown (`CLAUDE.md`, `AGENTS.md`,
+ * `AGENTS.override.md`) plus long-lived `.rulebook/` notes and
+ * knowledge/learning entries.
+ */
+import { readdir, stat } from 'node:fs/promises';
+import { join } from 'node:path';
+const ROOT_FILE_GLOB = ['CLAUDE.md', 'CLAUDE.local.md', 'AGENTS.md', 'AGENTS.override.md'];
+const RULEBOOK_SUBPATHS = [
+    '.rulebook/PLANS.md',
+    '.rulebook/STATE.md',
+    '.rulebook/knowledge',
+    '.rulebook/learnings',
+];
+async function safeStat(path) {
+    try {
+        const s = await stat(path);
+        return { exists: true, size: s.size };
+    }
+    catch {
+        return { exists: false, size: 0 };
+    }
+}
+function backupPathFor(filePath) {
+    return filePath.replace(/\.md$/i, '.original.md');
+}
+async function walkMarkdown(dir, out) {
+    let entries;
+    try {
+        entries = await readdir(dir, { withFileTypes: true });
+    }
+    catch {
+        return;
+    }
+    for (const e of entries) {
+        if (e.name.startsWith('.'))
+            continue;
+        const full = join(dir, e.name);
+        if (e.isDirectory()) {
+            await walkMarkdown(full, out);
+        }
+        else if (e.name.endsWith('.md') && !e.name.endsWith('.original.md')) {
+            out.push(full);
+        }
+    }
+}
+export async function listCompressCandidates(projectRoot) {
+    const found = [];
+    for (const name of ROOT_FILE_GLOB) {
+        const p = join(projectRoot, name);
+        if ((await safeStat(p)).exists)
+            found.push(p);
+    }
+    for (const sub of RULEBOOK_SUBPATHS) {
+        const p = join(projectRoot, sub);
+        const s = await safeStat(p);
+        if (!s.exists)
+            continue;
+        try {
+            const statRes = await stat(p);
+            if (statRes.isDirectory()) {
+                await walkMarkdown(p, found);
+            }
+            else {
+                found.push(p);
+            }
+        }
+        catch {
+            /* ignore */
+        }
+    }
+    const candidates = [];
+    for (const abs of found) {
+        const fileStat = await safeStat(abs);
+        const backupPath = backupPathFor(abs);
+        const backupStat = await safeStat(backupPath);
+        const relPath = abs.startsWith(projectRoot)
+            ? abs.slice(projectRoot.length).replace(/^[\\/]/, '')
+            : abs;
+        const candidate = {
+            relPath,
+            absPath: abs,
+            bytes: fileStat.size,
+            hasBackup: backupStat.exists,
+        };
+        if (backupStat.exists && backupStat.size > 0) {
+            candidate.backupBytes = backupStat.size;
+            candidate.backupRatio = fileStat.size / backupStat.size;
+        }
+        candidates.push(candidate);
+    }
+    // Sort by largest first so the caller sees the biggest win targets.
+    candidates.sort((a, b) => b.bytes - a.bytes);
+    return candidates;
+}
+//# sourceMappingURL=discover.js.map

package/dist/core/compress/discover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"discover.js","sourceRoot":"","sources":["../../../src/core/compress/discover.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAWjC,MAAM,cAAc,GAAG,CAAC,WAAW,EAAE,iBAAiB,EAAE,WAAW,EAAE,oBAAoB,CAAC,CAAC;AAE3F,MAAM,iBAAiB,GAAsB;IAC3C,oBAAoB;IACpB,oBAAoB;IACpB,qBAAqB;IACrB,qBAAqB;CACtB,CAAC;AAEF,KAAK,UAAU,QAAQ,CAAC,IAAY;IAClC,IAAI,CAAC;QACH,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACxC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IACpC,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,QAAgB;IACrC,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;AACpD,CAAC;AAED,KAAK,UAAU,YAAY,CAAC,GAAW,EAAE,GAAa;IACpD,IAAI,OAAO,CAAC;IACZ,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;IACxD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;IACT,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;YACpB,MAAM,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;YACtE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAAC,WAAmB;IAC9D,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,MAAM;YAAE,SAAS;QACxB,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;gBAC1B,MAAM,YAAY,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/B,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,YAAY;QACd,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QACtC,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC;YACzC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;YACrD,CAAC,CAAC,GAAG,CAAC;QAER,MAAM,SAAS,GAAc;YAC3B,OAAO;YACP,OAAO,EAAE,GAAG;YACZ,KAAK,EAAE,QAAQ,CAAC,IAAI;YACpB,SAAS,EAAE,UAAU,CAAC,MAAM;SAC7B,CAAC;QAEF,IAAI,UAAU,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC7C,SAAS,CAAC,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC;YACxC,SAAS,CAAC,WAAW,GAAG,QAAQ,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC;QAC1D,CAAC;QAED,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IAED,oEAAoE;IACpE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/core/compress/validator.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Validator for `rulebook compress`.
+ *
+ * The compressor may only rewrite prose. Everything that carries
+ * technical substance MUST round-trip byte-identically between the
+ * original file and the compressed output. This module defines the
+ * protected-region extractors and the diff-checker that compares
+ * them.
+ *
+ * Grounded in `.rulebook/specs/RULEBOOK_TERSE.md` §Compression
+ * companion and `docs/analysis/caveman/02-skill-design.md`.
+ */
+export type ViolationKind = 'heading-missing' | 'heading-text-changed' | 'fenced-code-changed' | 'inline-code-changed' | 'url-changed' | 'path-changed' | 'command-changed' | 'date-changed' | 'version-changed';
+export interface Violation {
+    kind: ViolationKind;
+    detail: string;
+}
+export interface ValidationResult {
+    ok: boolean;
+    violations: Violation[];
+    stats: {
+        originalBytes: number;
+        compressedBytes: number;
+        ratio: number;
+    };
+}
+/** Extract atomic markdown heading entries as "level\ttext" strings. */
+declare function extractHeadings(source: string): string[];
+/** Extract inline-code bodies (the text inside backticks). */
+declare function extractInlineCode(source: string): string[];
+export declare function validate(original: string, compressed: string): ValidationResult;
+/**
+ * Exposed for tests and the compressor's retry logic.
+ */
+export declare const extractors: {
+    FENCED_CODE_RE: RegExp;
+    INLINE_CODE_RE: RegExp;
+    URL_RE: RegExp;
+    DATE_RE: RegExp;
+    VERSION_RE: RegExp;
+    HEADING_RE: RegExp;
+    PATH_RE: RegExp;
+    extractHeadings: typeof extractHeadings;
+    extractInlineCode: typeof extractInlineCode;
+};
+export {};
+//# sourceMappingURL=validator.d.ts.map

package/dist/core/compress/validator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validator.d.ts","sourceRoot":"","sources":["../../../src/core/compress/validator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,MAAM,MAAM,aAAa,GACrB,iBAAiB,GACjB,sBAAsB,GACtB,qBAAqB,GACrB,qBAAqB,GACrB,aAAa,GACb,cAAc,GACd,iBAAiB,GACjB,cAAc,GACd,iBAAiB,CAAC;AAEtB,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,aAAa,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,OAAO,CAAC;IACZ,UAAU,EAAE,SAAS,EAAE,CAAC;IACxB,KAAK,EAAE;QACL,aAAa,EAAE,MAAM,CAAC;QACtB,eAAe,EAAE,MAAM,CAAC;QACxB,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;CACH;AA8BD,wEAAwE;AACxE,iBAAS,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAKjD;AAED,8DAA8D;AAC9D,iBAAS,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAOnD;AAsCD,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,gBAAgB,CAoD/E;AAED;;GAEG;AACH,eAAO,MAAM,UAAU;;;;;;;;;;CAUtB,CAAC"}

package/dist/core/compress/validator.js

@@ -0,0 +1,131 @@
+/**
+ * Validator for `rulebook compress`.
+ *
+ * The compressor may only rewrite prose. Everything that carries
+ * technical substance MUST round-trip byte-identically between the
+ * original file and the compressed output. This module defines the
+ * protected-region extractors and the diff-checker that compares
+ * them.
+ *
+ * Grounded in `.rulebook/specs/RULEBOOK_TERSE.md` §Compression
+ * companion and `docs/analysis/caveman/02-skill-design.md`.
+ */
+// ── Regex patterns — all non-greedy, multiline where needed ───────────
+const FENCED_CODE_RE = /```[\s\S]*?```/g;
+const INLINE_CODE_RE = /(?<!`)`([^`\n]+)`(?!`)/g;
+// URL must not consume trailing sentence-ending punctuation (. , ; : ! ?).
+const URL_RE = /\bhttps?:\/\/[^\s)>\]"'`]*[^\s)>\]"'`.,;:!?]/g;
+const DATE_RE = /\b\d{4}-\d{2}-\d{2}\b/g;
+// Version numbers: optional `v`, then X.Y or X.Y.Z(-suffix).
+const VERSION_RE = /\bv?\d+\.\d+(?:\.\d+)?(?:-[\w.]+)?\b/g;
+// ATX-style markdown headings.
+const HEADING_RE = /^(#{1,6})\s+(.+?)\s*$/gm;
+// File paths. Three alternatives:
+//   relative: `./foo/bar` or `../baz`
+//   Windows : `C:\Users\...`
+//   absolute Unix: `/usr/local/bin/node` — requires start-of-line or whitespace/paren prefix.
+const PATH_RE = /(?:\.{1,2}\/[\w./\\-]+|[A-Za-z]:\\[\w./\\-]+|(?<=^|[\s(])\/[a-zA-Z][\w./\\-]+)/gm;
+function normalize(arr) {
+    return arr.slice().sort();
+}
+function extract(source, re) {
+    const out = [];
+    const matches = source.matchAll(re);
+    for (const m of matches)
+        out.push(m[0]);
+    return out;
+}
+/** Extract atomic markdown heading entries as "level\ttext" strings. */
+function extractHeadings(source) {
+    const out = [];
+    const matches = source.matchAll(HEADING_RE);
+    for (const m of matches)
+        out.push(`${m[1].length}\t${m[2]}`);
+    return out;
+}
+/** Extract inline-code bodies (the text inside backticks). */
+function extractInlineCode(source) {
+    const out = [];
+    // Strip fenced blocks first so we don't double-count code inside ```.
+    const scrubbed = source.replace(FENCED_CODE_RE, '');
+    const matches = scrubbed.matchAll(INLINE_CODE_RE);
+    for (const m of matches)
+        out.push(m[1]);
+    return out;
+}
+function diff(label, original, compressed) {
+    const violations = [];
+    const normalOrig = normalize(original);
+    const normalComp = normalize(compressed);
+    // Everything in original must appear in compressed, same count.
+    const compCount = new Map();
+    for (const v of normalComp)
+        compCount.set(v, (compCount.get(v) ?? 0) + 1);
+    for (const v of normalOrig) {
+        const n = compCount.get(v) ?? 0;
+        if (n === 0) {
+            violations.push({
+                kind: label,
+                detail: `missing from compressed output: ${JSON.stringify(v).slice(0, 120)}`,
+            });
+        }
+        else {
+            compCount.set(v, n - 1);
+        }
+    }
+    // Anything LEFT in compCount that came from compressed but wasn't in
+    // original means the compressor introduced a new protected item (for
+    // example by mistranscribing a URL). That is also a violation.
+    for (const [v, n] of compCount) {
+        if (n > 0) {
+            violations.push({
+                kind: label,
+                detail: `introduced in compressed output: ${JSON.stringify(v).slice(0, 120)}`,
+            });
+        }
+    }
+    return violations;
+}
+export function validate(original, compressed) {
+    const violations = [];
+    // Heading structure (level + text) must match exactly.
+    violations.push(...diff('heading-missing', extractHeadings(original), extractHeadings(compressed)));
+    // Fenced code blocks — byte-for-byte, ordered.
+    violations.push(...diff('fenced-code-changed', extract(original, FENCED_CODE_RE), extract(compressed, FENCED_CODE_RE)));
+    // Inline code bodies.
+    violations.push(...diff('inline-code-changed', extractInlineCode(original), extractInlineCode(compressed)));
+    // URLs.
+    violations.push(...diff('url-changed', extract(original, URL_RE), extract(compressed, URL_RE)));
+    // File paths.
+    violations.push(...diff('path-changed', extract(original, PATH_RE), extract(compressed, PATH_RE)));
+    // Dates.
+    violations.push(...diff('date-changed', extract(original, DATE_RE), extract(compressed, DATE_RE)));
+    // Version numbers.
+    violations.push(...diff('version-changed', extract(original, VERSION_RE), extract(compressed, VERSION_RE)));
+    const originalBytes = Buffer.byteLength(original, 'utf8');
+    const compressedBytes = Buffer.byteLength(compressed, 'utf8');
+    return {
+        ok: violations.length === 0,
+        violations,
+        stats: {
+            originalBytes,
+            compressedBytes,
+            ratio: originalBytes > 0 ? compressedBytes / originalBytes : 1,
+        },
+    };
+}
+/**
+ * Exposed for tests and the compressor's retry logic.
+ */
+export const extractors = {
+    FENCED_CODE_RE,
+    INLINE_CODE_RE,
+    URL_RE,
+    DATE_RE,
+    VERSION_RE,
+    HEADING_RE,
+    PATH_RE,
+    extractHeadings,
+    extractInlineCode,
+};
+//# sourceMappingURL=validator.js.map

package/dist/core/compress/validator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validator.js","sourceRoot":"","sources":["../../../src/core/compress/validator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AA4BH,yEAAyE;AAEzE,MAAM,cAAc,GAAG,iBAAiB,CAAC;AACzC,MAAM,cAAc,GAAG,yBAAyB,CAAC;AACjD,2EAA2E;AAC3E,MAAM,MAAM,GAAG,+CAA+C,CAAC;AAC/D,MAAM,OAAO,GAAG,wBAAwB,CAAC;AACzC,6DAA6D;AAC7D,MAAM,UAAU,GAAG,uCAAuC,CAAC;AAC3D,+BAA+B;AAC/B,MAAM,UAAU,GAAG,yBAAyB,CAAC;AAC7C,kCAAkC;AAClC,sCAAsC;AACtC,6BAA6B;AAC7B,8FAA8F;AAC9F,MAAM,OAAO,GAAG,kFAAkF,CAAC;AAEnG,SAAS,SAAS,CAAC,GAAa;IAC9B,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,OAAO,CAAC,MAAc,EAAE,EAAU;IACzC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,wEAAwE;AACxE,SAAS,eAAe,CAAC,MAAc;IACrC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8DAA8D;AAC9D,SAAS,iBAAiB,CAAC,MAAc;IACvC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,sEAAsE;IACtE,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;IACpD,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,IAAI,CAAC,KAAa,EAAE,QAAkB,EAAE,UAAoB;IACnE,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,MAAM,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IAEzC,gEAAgE;IAChE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE1E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,KAAsB;gBAC5B,MAAM,EAAE,mCAAmC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;aAC7E,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,qEAAqE;IACrE,+DAA+D;IAC/D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,UAAU,CAAC,IAAI,CAAC;gBACd,IAAI,EAAE,KAAsB;gBAC5B,MAAM,EAAE,oCAAoC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;aAC9E,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,QAAgB,EAAE,UAAkB;IAC3D,MAAM,UAAU,GAAgB,EAAE,CAAC;IAEnC,uDAAuD;IACvD,UAAU,CAAC,IAAI,CACb,GAAG,IAAI,CAAC,iBAAiB,EAAE,eAAe,CAAC,QAAQ,CAAC,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,CACnF,CAAC;IAEF,+CAA+C;IAC/C,UAAU,CAAC,IAAI,CACb,GAAG,IAAI,CACL,qBAAqB,EACrB,OAAO,CAAC,QAAQ,EAAE,cAAc,CAAC,EACjC,OAAO,CAAC,UAAU,EAAE,cAAc,CAAC,CACpC,CACF,CAAC;IAEF,sBAAsB;IACtB,UAAU,CAAC,IAAI,CACb,GAAG,IAAI,CAAC,qBAAqB,EAAE,iBAAiB,CAAC,QAAQ,CAAC,EAAE,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAC3F,CAAC;IAEF,QAAQ;IACR,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAEhG,cAAc;IACd,UAAU,CAAC,IAAI,CACb,GAAG,IAAI,CAAC,cAAc,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAClF,CAAC;IAEF,SAAS;IACT,UAAU,CAAC,IAAI,CACb,GAAG,IAAI,CAAC,cAAc,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAClF,CAAC;IAEF,mBAAmB;IACnB,UAAU,CAAC,IAAI,CACb,GAAG,IAAI,CAAC,iBAAiB,EAAE,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC,EAAE,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAC3F,CAAC;IAEF,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC1D,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAE9D,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC;QAC3B,UAAU;QACV,KAAK,EAAE;YACL,aAAa;YACb,eAAe;YACf,KAAK,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;SAC/D;KACF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,cAAc;IACd,cAAc;IACd,MAAM;IACN,OAAO;IACP,UAAU;IACV,UAAU;IACV,OAAO;IACP,eAAe;IACf,iBAAiB;CAClB,CAAC"}

package/dist/core/doctor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"doctor.d.ts","sourceRoot":"","sources":["../../src/core/doctor.ts"],"names":[],"mappings":"AAGA;;;;;GAKG;AAEH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;IACjC,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAKD,wBAAsB,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAiB1E"}
+{"version":3,"file":"doctor.d.ts","sourceRoot":"","sources":["../../src/core/doctor.ts"],"names":[],"mappings":"AAGA;;;;;GAKG;AAEH,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;IACjC,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,WAAW,EAAE,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;CACnB;AAKD,wBAAsB,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAmB1E"}