aicodeman 0.2.8

package/dist/utils/string-similarity.js

@@ -0,0 +1,189 @@
+/**
+ * @fileoverview String similarity utilities for fuzzy matching.
+ *
+ * Provides Levenshtein distance and similarity scoring for:
+ * - Completion phrase fuzzy matching
+ * - Todo content deduplication
+ *
+ * @module utils/string-similarity
+ */
+/**
+ * Calculate the Levenshtein (edit) distance between two strings.
+ * This is the minimum number of single-character edits (insertions,
+ * deletions, or substitutions) required to change one string into the other.
+ *
+ * Uses Wagner-Fischer algorithm with O(min(m,n)) space optimization.
+ *
+ * @param a - First string
+ * @param b - Second string
+ * @returns The edit distance (0 = identical)
+ *
+ * @example
+ * levenshteinDistance('hello', 'hello') // 0
+ * levenshteinDistance('hello', 'helo')  // 1 (one deletion)
+ * levenshteinDistance('COMPLETE', 'COMPLET') // 1 (one deletion)
+ */
+export function levenshteinDistance(a, b) {
+    // Ensure a is the shorter string for space efficiency
+    if (a.length > b.length) {
+        [a, b] = [b, a];
+    }
+    const m = a.length;
+    const n = b.length;
+    // Early exit for identical strings
+    if (a === b)
+        return 0;
+    // Early exit for empty strings
+    if (m === 0)
+        return n;
+    // Use single array (space optimization)
+    let prev = new Array(m + 1);
+    let curr = new Array(m + 1);
+    // Initialize first row
+    for (let i = 0; i <= m; i++) {
+        prev[i] = i;
+    }
+    // Fill the matrix row by row
+    for (let j = 1; j <= n; j++) {
+        curr[0] = j;
+        for (let i = 1; i <= m; i++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            curr[i] = Math.min(prev[i] + 1, // deletion
+            curr[i - 1] + 1, // insertion
+            prev[i - 1] + cost // substitution
+            );
+        }
+        // Swap rows
+        [prev, curr] = [curr, prev];
+    }
+    return prev[m];
+}
+/**
+ * Calculate similarity ratio between two strings (0 to 1).
+ * Uses Levenshtein distance normalized by the longer string's length.
+ *
+ * @param a - First string
+ * @param b - Second string
+ * @returns Similarity ratio (1.0 = identical, 0.0 = completely different)
+ *
+ * @example
+ * stringSimilarity('hello', 'hello') // 1.0
+ * stringSimilarity('hello', 'helo')  // 0.8 (4/5 similar)
+ * stringSimilarity('abc', 'xyz')     // 0.0 (3 edits, length 3)
+ */
+export function stringSimilarity(a, b) {
+    if (a === b)
+        return 1.0;
+    if (a.length === 0 && b.length === 0)
+        return 1.0;
+    if (a.length === 0 || b.length === 0)
+        return 0.0;
+    const distance = levenshteinDistance(a, b);
+    const maxLength = Math.max(a.length, b.length);
+    return 1 - distance / maxLength;
+}
+/**
+ * Check if two strings are similar within a given threshold.
+ *
+ * @param a - First string
+ * @param b - Second string
+ * @param threshold - Minimum similarity ratio (default: 0.85 = 85% similar)
+ * @returns True if similarity >= threshold
+ *
+ * @example
+ * isSimilar('COMPLETE', 'COMPLET', 0.85)  // true (87.5% similar)
+ * isSimilar('COMPLETE', 'DONE', 0.85)     // false (0% similar)
+ */
+export function isSimilar(a, b, threshold = 0.85) {
+    return stringSimilarity(a, b) >= threshold;
+}
+/**
+ * Check if two strings are similar with edit distance tolerance.
+ * More intuitive for short strings than percentage-based threshold.
+ *
+ * @param a - First string
+ * @param b - Second string
+ * @param maxDistance - Maximum allowed edit distance (default: 2)
+ * @returns True if edit distance <= maxDistance
+ *
+ * @example
+ * isSimilarByDistance('COMPLETE', 'COMPLET', 2)   // true (distance 1)
+ * isSimilarByDistance('COMPLETE', 'COMP', 2)     // false (distance 4)
+ */
+export function isSimilarByDistance(a, b, maxDistance = 2) {
+    return levenshteinDistance(a, b) <= maxDistance;
+}
+/**
+ * Normalize a completion phrase for comparison.
+ * Handles variations in case, whitespace, and separators.
+ *
+ * @param phrase - Raw completion phrase
+ * @returns Normalized phrase (uppercase, no separators)
+ *
+ * @example
+ * normalizePhrase('task_done')   // 'TASKDONE'
+ * normalizePhrase('TASK-DONE')   // 'TASKDONE'
+ * normalizePhrase('Task Done')   // 'TASKDONE'
+ */
+export function normalizePhrase(phrase) {
+    return phrase
+        .toUpperCase()
+        .replace(/[\s_\-.]+/g, '') // Remove whitespace, underscores, hyphens, dots
+        .trim();
+}
+/**
+ * Check if two completion phrases match with fuzzy tolerance.
+ *
+ * First normalizes both phrases, then checks:
+ * 1. Exact match after normalization
+ * 2. Edit distance <= maxDistance for typo tolerance
+ *
+ * @param phrase1 - First phrase to compare
+ * @param phrase2 - Second phrase to compare
+ * @param maxDistance - Maximum edit distance for fuzzy match (default: 2)
+ * @returns True if phrases match (exact or fuzzy)
+ *
+ * @example
+ * fuzzyPhraseMatch('COMPLETE', 'COMPLETE')        // true (exact)
+ * fuzzyPhraseMatch('COMPLETE', 'COMPLET')         // true (typo)
+ * fuzzyPhraseMatch('TASK_DONE', 'TASKDONE')       // true (separator)
+ * fuzzyPhraseMatch('COMPLETE', 'FINISHED')        // false (different word)
+ */
+export function fuzzyPhraseMatch(phrase1, phrase2, maxDistance = 2) {
+    const norm1 = normalizePhrase(phrase1);
+    const norm2 = normalizePhrase(phrase2);
+    // Exact match after normalization
+    if (norm1 === norm2)
+        return true;
+    // For short phrases (< 6 chars), require exact match to avoid false positives
+    // e.g., "DONE" shouldn't match "DENY"
+    if (norm1.length < 6 || norm2.length < 6) {
+        return false;
+    }
+    // Fuzzy match with edit distance
+    return isSimilarByDistance(norm1, norm2, maxDistance);
+}
+/**
+ * Generate a content hash for todo deduplication.
+ * Normalizes content and generates a simple hash.
+ *
+ * @param content - Todo item content
+ * @returns Normalized hash string for comparison
+ */
+export function todoContentHash(content) {
+    // Normalize: lowercase, collapse whitespace, remove punctuation
+    const normalized = content
+        .toLowerCase()
+        .replace(/\s+/g, ' ')
+        .replace(/[^\w\s]/g, '')
+        .trim();
+    // Simple hash using reduce (fast, good enough for deduplication)
+    let hash = 0;
+    for (let i = 0; i < normalized.length; i++) {
+        const char = normalized.charCodeAt(i);
+        hash = (hash << 5) - hash + char;
+        hash = hash & hash; // Convert to 32-bit integer
+    }
+    return hash.toString(36);
+}
+//# sourceMappingURL=string-similarity.js.map

package/dist/utils/string-similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"string-similarity.js","sourceRoot":"","sources":["../../src/utils/string-similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,CAAS;IACtD,sDAAsD;IACtD,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACxB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,mCAAmC;IACnC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtB,+BAA+B;IAC/B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtB,wCAAwC;IACxC,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAEpC,uBAAuB;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,CAAC;IAED,6BAA6B;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAEZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAChB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,WAAW;YACxB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,YAAY;YAC7B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,eAAe;aACnC,CAAC;QACJ,CAAC;QAED,YAAY;QACZ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACxB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACjD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAEjD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/C,OAAO,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC;AAClC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,IAAI;IAC9D,OAAO,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,CAAC;AAC7C,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,CAAS,EAAE,WAAW,GAAG,CAAC;IACvE,OAAO,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,WAAW,CAAC;AAClD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,OAAO,MAAM;SACV,WAAW,EAAE;SACb,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,gDAAgD;SAC1E,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe,EAAE,OAAe,EAAE,WAAW,GAAG,CAAC;IAChF,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAEvC,kCAAkC;IAClC,IAAI,KAAK,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IAEjC,8EAA8E;IAC9E,sCAAsC;IACtC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iCAAiC;IACjC,OAAO,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;AACxD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe;IAC7C,gEAAgE;IAChE,MAAM,UAAU,GAAG,OAAO;SACvB,WAAW,EAAE;SACb,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,IAAI,EAAE,CAAC;IAEV,iEAAiE;IACjE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;QACjC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,4BAA4B;IAClD,CAAC;IACD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AAC3B,CAAC"}

package/dist/utils/token-validation.d.ts

@@ -0,0 +1,39 @@
+/**
+ * @fileoverview Token validation utilities.
+ *
+ * Centralizes token count validation logic used across the codebase.
+ * Claude's context window is ~200k tokens, so 500k is a generous upper bound.
+ *
+ * @module utils/token-validation
+ */
+/**
+ * Maximum tokens allowed per session.
+ * Claude's context is ~200k, so 500k is a safe upper bound for validation.
+ */
+export declare const MAX_SESSION_TOKENS = 500000;
+/**
+ * Validates token counts are within acceptable bounds.
+ * Rejects negative values and values exceeding MAX_SESSION_TOKENS.
+ *
+ * @param inputTokens - Input token count to validate
+ * @param outputTokens - Output token count to validate
+ * @returns Object with isValid flag and optional error reason
+ */
+export declare function validateTokenCounts(inputTokens: number, outputTokens: number): {
+    isValid: boolean;
+    reason?: string;
+};
+/**
+ * Validates token counts and cost for restoration/persistence.
+ * Returns true if all values are valid.
+ *
+ * @param inputTokens - Input token count
+ * @param outputTokens - Output token count
+ * @param cost - Cost value (must be non-negative)
+ * @returns Object with isValid flag and optional error reason
+ */
+export declare function validateTokensAndCost(inputTokens: number, outputTokens: number, cost: number): {
+    isValid: boolean;
+    reason?: string;
+};
+//# sourceMappingURL=token-validation.d.ts.map

package/dist/utils/token-validation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"token-validation.d.ts","sourceRoot":"","sources":["../../src/utils/token-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;GAGG;AACH,eAAO,MAAM,kBAAkB,SAAU,CAAC;AAE1C;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAgBpH;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,IAAI,EAAE,MAAM,GACX;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAcvC"}

package/dist/utils/token-validation.js

@@ -0,0 +1,59 @@
+/**
+ * @fileoverview Token validation utilities.
+ *
+ * Centralizes token count validation logic used across the codebase.
+ * Claude's context window is ~200k tokens, so 500k is a generous upper bound.
+ *
+ * @module utils/token-validation
+ */
+/**
+ * Maximum tokens allowed per session.
+ * Claude's context is ~200k, so 500k is a safe upper bound for validation.
+ */
+export const MAX_SESSION_TOKENS = 500_000;
+/**
+ * Validates token counts are within acceptable bounds.
+ * Rejects negative values and values exceeding MAX_SESSION_TOKENS.
+ *
+ * @param inputTokens - Input token count to validate
+ * @param outputTokens - Output token count to validate
+ * @returns Object with isValid flag and optional error reason
+ */
+export function validateTokenCounts(inputTokens, outputTokens) {
+    if (inputTokens < 0 || outputTokens < 0) {
+        return {
+            isValid: false,
+            reason: `Negative token values: input=${inputTokens}, output=${outputTokens}`,
+        };
+    }
+    if (inputTokens > MAX_SESSION_TOKENS || outputTokens > MAX_SESSION_TOKENS) {
+        return {
+            isValid: false,
+            reason: `Token values exceed maximum (${MAX_SESSION_TOKENS}): input=${inputTokens}, output=${outputTokens}`,
+        };
+    }
+    return { isValid: true };
+}
+/**
+ * Validates token counts and cost for restoration/persistence.
+ * Returns true if all values are valid.
+ *
+ * @param inputTokens - Input token count
+ * @param outputTokens - Output token count
+ * @param cost - Cost value (must be non-negative)
+ * @returns Object with isValid flag and optional error reason
+ */
+export function validateTokensAndCost(inputTokens, outputTokens, cost) {
+    const tokenValidation = validateTokenCounts(inputTokens, outputTokens);
+    if (!tokenValidation.isValid) {
+        return tokenValidation;
+    }
+    if (cost < 0) {
+        return {
+            isValid: false,
+            reason: `Negative cost value: ${cost}`,
+        };
+    }
+    return { isValid: true };
+}
+//# sourceMappingURL=token-validation.js.map

package/dist/utils/token-validation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"token-validation.js","sourceRoot":"","sources":["../../src/utils/token-validation.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,OAAO,CAAC;AAE1C;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,WAAmB,EAAE,YAAoB;IAC3E,IAAI,WAAW,GAAG,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO;YACL,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,gCAAgC,WAAW,YAAY,YAAY,EAAE;SAC9E,CAAC;IACJ,CAAC;IAED,IAAI,WAAW,GAAG,kBAAkB,IAAI,YAAY,GAAG,kBAAkB,EAAE,CAAC;QAC1E,OAAO;YACL,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,gCAAgC,kBAAkB,YAAY,WAAW,YAAY,YAAY,EAAE;SAC5G,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,WAAmB,EACnB,YAAoB,EACpB,IAAY;IAEZ,MAAM,eAAe,GAAG,mBAAmB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IACvE,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,OAAO;YACL,OAAO,EAAE,KAAK;YACd,MAAM,EAAE,wBAAwB,IAAI,EAAE;SACvC,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC3B,CAAC"}

package/dist/utils/type-safety.d.ts

@@ -0,0 +1,33 @@
+/**
+ * @fileoverview Type safety utilities for exhaustive checking.
+ *
+ * @module utils/type-safety
+ */
+/**
+ * Assert that a value should never occur at runtime.
+ * Used in switch/case default blocks to ensure exhaustive handling.
+ *
+ * If TypeScript sees a code path where `value` is not `never`,
+ * it will report a compile-time error, catching missing cases.
+ *
+ * @param value - The value that should be of type `never`
+ * @param message - Optional custom error message
+ * @throws Error if called at runtime (indicates unhandled case)
+ *
+ * @example
+ * type Status = 'active' | 'inactive' | 'pending';
+ * function handleStatus(status: Status): void {
+ *   switch (status) {
+ *     case 'active': // handle active
+ *       break;
+ *     case 'inactive': // handle inactive
+ *       break;
+ *     case 'pending': // handle pending
+ *       break;
+ *     default:
+ *       assertNever(status); // Compile error if case is missing
+ *   }
+ * }
+ */
+export declare function assertNever(value: never, message?: string): never;
+//# sourceMappingURL=type-safety.d.ts.map

package/dist/utils/type-safety.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-safety.d.ts","sourceRoot":"","sources":["../../src/utils/type-safety.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,KAAK,CAEjE"}

package/dist/utils/type-safety.js

@@ -0,0 +1,35 @@
+/**
+ * @fileoverview Type safety utilities for exhaustive checking.
+ *
+ * @module utils/type-safety
+ */
+/**
+ * Assert that a value should never occur at runtime.
+ * Used in switch/case default blocks to ensure exhaustive handling.
+ *
+ * If TypeScript sees a code path where `value` is not `never`,
+ * it will report a compile-time error, catching missing cases.
+ *
+ * @param value - The value that should be of type `never`
+ * @param message - Optional custom error message
+ * @throws Error if called at runtime (indicates unhandled case)
+ *
+ * @example
+ * type Status = 'active' | 'inactive' | 'pending';
+ * function handleStatus(status: Status): void {
+ *   switch (status) {
+ *     case 'active': // handle active
+ *       break;
+ *     case 'inactive': // handle inactive
+ *       break;
+ *     case 'pending': // handle pending
+ *       break;
+ *     default:
+ *       assertNever(status); // Compile error if case is missing
+ *   }
+ * }
+ */
+export function assertNever(value, message) {
+    throw new Error(message ?? `Unexpected value: ${JSON.stringify(value)}`);
+}
+//# sourceMappingURL=type-safety.js.map

package/dist/utils/type-safety.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"type-safety.js","sourceRoot":"","sources":["../../src/utils/type-safety.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,WAAW,CAAC,KAAY,EAAE,OAAgB;IACxD,MAAM,IAAI,KAAK,CAAC,OAAO,IAAI,qBAAqB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAC3E,CAAC"}