@higher.archi/boe 1.0.0

package/dist/functions/phonetic/nysiis.js

@@ -0,0 +1,162 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.nysiis = nysiis;
+exports.nysiisMatch = nysiisMatch;
+/**
+ * NYSIIS Phonetic Algorithm
+ *
+ * New York State Identification and Intelligence System (NYSIIS)
+ * Encodes names into a phonetic code for matching names that sound similar.
+ *
+ * Implementation by Kamau Washington based on Wikipedia specification:
+ * https://en.wikipedia.org/wiki/New_York_State_Identification_and_Intelligence_System
+ *
+ * Developed by the New York State Identification and Intelligence System in 1970.
+ * More accurate than Soundex for matching names with different spellings.
+ *
+ * @param input - Name to encode
+ * @returns NYSIIS phonetic code (max 6 characters), or empty string if no input
+ *
+ * @example
+ * nysiis('McDonald')   // Returns "MCDANA"
+ * nysiis('Macdonald')  // Returns "MCDANA" (same encoding)
+ * nysiis('Johnson')    // Returns "JANSAN"
+ * nysiis('Jonson')     // Returns "JANSAN" (same encoding)
+ * nysiis('Schmidt')    // Returns "SNAD"
+ * nysiis('Smith')      // Returns "SNAT" (different - they don't match)
+ */
+function nysiis(input) {
+    // Vowel array defined outside of processing loop
+    const vowels = ['A', 'E', 'I', 'O', 'U'];
+    // Helper function to replace character at an index
+    const replaceAt = (str, index, replace = '') => {
+        const deleteCount = replace.length || 1;
+        return str.slice(0, index) + replace + str.slice(index + deleteCount);
+    };
+    // Fail fast if there isn't an input value to code (code defensively)
+    if (!input || input.length === 0) {
+        return '';
+    }
+    // Strip leading and trailing whitespace
+    input = input.trim();
+    // Make input uppercase (wiki algorithm doesn't mention this as first step)
+    input = input.toUpperCase();
+    // Step 1: Prefix transformations
+    if (input.startsWith('MAC')) {
+        input = 'MCC' + input.slice(3);
+    }
+    else if (input.startsWith('KN')) {
+        input = 'NN' + input.slice(2);
+    }
+    else if (input.startsWith('K')) {
+        input = 'C' + input.slice(1);
+    }
+    else if (input.startsWith('PH')) {
+        input = 'FF' + input.slice(2);
+    }
+    else if (input.startsWith('PF')) {
+        input = 'FF' + input.slice(2);
+    }
+    else if (input.startsWith('SCH')) {
+        input = 'SSS' + input.slice(3);
+    }
+    // Step 2: Suffix transformations
+    if (input.endsWith('EE')) {
+        input = input.slice(0, -2) + 'Y';
+    }
+    else if (input.endsWith('IE')) {
+        input = input.slice(0, -2) + 'Y';
+    }
+    for (const item of ['DT', 'RT', 'RD', 'NT', 'ND']) {
+        if (input.endsWith(item)) {
+            input = input.slice(0, -2) + 'D';
+            break;
+        }
+    }
+    // Steps 3-4: Character-by-character processing
+    let idx = 1;
+    while (idx < input.length) {
+        // Step 5 (1): Only process letters, skip all other characters including spaces
+        if (!/[A-Za-z]/.test(input[idx])) {
+            input = replaceAt(input, idx);
+            // Keeps current index and restarts
+            continue;
+        }
+        // Step 5 (2): Vowel handling
+        if (vowels.includes(input[idx])) {
+            if (input.slice(idx, idx + 2) === 'EV') {
+                input = replaceAt(input, idx, 'EV');
+            }
+            else {
+                input = replaceAt(input, idx, 'A');
+            }
+        }
+        // Step 5 (3): Q, Z, M transformations
+        else if (input[idx] === 'Q') {
+            input = replaceAt(input, idx, 'G');
+        }
+        else if (input[idx] === 'Z') {
+            input = replaceAt(input, idx, 'S');
+        }
+        else if (input[idx] === 'M') {
+            input = replaceAt(input, idx, 'N');
+        }
+        // Step 5 (4): KN and K transformations
+        else if (input.slice(idx, idx + 2) === 'KN') {
+            input = replaceAt(input, idx, 'N');
+        }
+        else if (input[idx] === 'K') {
+            input = replaceAt(input, idx, 'C');
+        }
+        // Step 5 (5): PH transformation
+        else if (input.slice(idx, idx + 2) === 'PH') {
+            input = replaceAt(input, idx, 'FF');
+        }
+        // Step 5 (6): H transformation
+        // Replace H with previous char if (previous not vowel OR next not vowel)
+        else if (input[idx] === 'H' && (!vowels.includes(input[idx - 1]) || !vowels.includes(input[idx + 1] || ''))) {
+            input = replaceAt(input, idx, input[idx - 1]);
+        }
+        // Step 5 (7): W transformation
+        // Replace W with previous char if previous is a vowel
+        else if (input[idx] === 'W' && vowels.includes(input[idx - 1])) {
+            input = replaceAt(input, idx, input[idx - 1]);
+        }
+        // Step 6: Remove duplicate consecutive characters
+        if (input[idx] === input[idx - 1]) {
+            input = replaceAt(input, idx, '');
+            continue;
+        }
+        idx++;
+    }
+    // Step 7: Remove trailing S
+    if (input.endsWith('S')) {
+        input = input.slice(0, -1);
+    }
+    // Step 8: Handle AY ending
+    if (input.endsWith('AY')) {
+        input = input.slice(0, -2) + 'Y';
+    }
+    // Step 9: Remove trailing A
+    if (input.endsWith('A')) {
+        input = input.slice(0, -1);
+    }
+    // Return first 6 characters
+    return input.slice(0, 6);
+}
+/**
+ * Compare two names using NYSIIS encoding
+ *
+ * @param name1 - First name to compare
+ * @param name2 - Second name to compare
+ * @returns true if names sound similar (same NYSIIS code)
+ *
+ * @example
+ * nysiisMatch('McDonald', 'Macdonald')  // Returns true
+ * nysiisMatch('Johnson', 'Jonson')      // Returns true
+ * nysiisMatch('Schmidt', 'Smith')       // Returns false (different codes)
+ */
+function nysiisMatch(name1, name2) {
+    return nysiis(name1) === nysiis(name2);
+}
+//# sourceMappingURL=nysiis.js.map

package/dist/functions/phonetic/nysiis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nysiis.js","sourceRoot":"","sources":["../../../src/functions/phonetic/nysiis.ts"],"names":[],"mappings":";;AAuBA,wBA4HC;AAcD,kCAEC;AAnKD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAgB,MAAM,CAAC,KAAa;IAClC,iDAAiD;IACjD,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAEzC,mDAAmD;IACnD,MAAM,SAAS,GAAG,CAAC,GAAW,EAAE,KAAa,EAAE,UAAkB,EAAE,EAAU,EAAE;QAC7E,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC;QACxC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC,CAAC;IACxE,CAAC,CAAC;IAEF,qEAAqE;IACrE,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,wCAAwC;IACxC,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAErB,2EAA2E;IAC3E,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAE5B,iCAAiC;IACjC,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;SAAM,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;SAAM,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACjC,KAAK,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;SAAM,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;SAAM,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;SAAM,IAAI,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACnC,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,iCAAiC;IACjC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACnC,CAAC;SAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACnC,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;QAClD,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACjC,MAAM;QACR,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,OAAO,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1B,+EAA+E;QAC/E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACjC,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9B,mCAAmC;YACnC,SAAS;QACX,CAAC;QAED,6BAA6B;QAC7B,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBACvC,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;YACtC,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QACD,sCAAsC;aACjC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YAC5B,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YAC9B,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YAC9B,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC;QACD,uCAAuC;aAClC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5C,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YAC9B,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC;QACD,gCAAgC;aAC3B,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5C,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,+BAA+B;QAC/B,yEAAyE;aACpE,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YAC5G,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,+BAA+B;QAC/B,sDAAsD;aACjD,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/D,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,kDAAkD;QAClD,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;YAClC,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YAClC,SAAS;QACX,CAAC;QAED,GAAG,EAAE,CAAC;IACR,CAAC;IAED,4BAA4B;IAC5B,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,2BAA2B;IAC3B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACnC,CAAC;IAED,4BAA4B;IAC5B,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,4BAA4B;IAC5B,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,WAAW,CAAC,KAAa,EAAE,KAAa;IACtD,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC;AACzC,CAAC"}

package/dist/functions/phonetic/soundex.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Soundex Phonetic Algorithm
+ *
+ * Encodes names into a 4-character phonetic code (1 letter + 3 digits).
+ * Names that sound similar will have the same Soundex code.
+ *
+ * Developed by Robert C. Russell and Margaret King Odell in 1918-1922.
+ * Widely used in genealogy, census data, and name matching.
+ *
+ * Algorithm:
+ * 1. Keep the first letter
+ * 2. Replace consonants with digits based on phonetic similarity:
+ *    - B, F, P, V → 1
+ *    - C, G, J, K, Q, S, X, Z → 2
+ *    - D, T → 3
+ *    - L → 4
+ *    - M, N → 5
+ *    - R → 6
+ * 3. Remove adjacent duplicate digits
+ * 4. Remove all occurrences of A, E, I, O, U, H, W, Y (except first letter)
+ * 5. Pad with zeros or truncate to 4 characters
+ *
+ * @param name - Name to encode
+ * @returns 4-character Soundex code (e.g., "R163" for "Robert")
+ *
+ * @example
+ * soundex('Robert')    // Returns "R163"
+ * soundex('Rupert')    // Returns "R163" (sounds similar)
+ * soundex('Smith')     // Returns "S530"
+ * soundex('Smythe')    // Returns "S530" (sounds similar)
+ * soundex('Johnson')   // Returns "J525"
+ * soundex('Jonson')    // Returns "J525" (sounds similar)
+ */
+export declare function soundex(name: string): string;
+/**
+ * Compare two names using Soundex encoding
+ *
+ * @param name1 - First name to compare
+ * @param name2 - Second name to compare
+ * @returns true if names sound similar (same Soundex code)
+ *
+ * @example
+ * soundexMatch('Robert', 'Rupert')  // Returns true
+ * soundexMatch('Smith', 'Smythe')   // Returns true
+ * soundexMatch('Johnson', 'Jackson') // Returns false
+ */
+export declare function soundexMatch(name1: string, name2: string): boolean;
+//# sourceMappingURL=soundex.d.ts.map

package/dist/functions/phonetic/soundex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"soundex.d.ts","sourceRoot":"","sources":["../../../src/functions/phonetic/soundex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CA6D5C;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAElE"}

package/dist/functions/phonetic/soundex.js

@@ -0,0 +1,103 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.soundex = soundex;
+exports.soundexMatch = soundexMatch;
+/**
+ * Soundex Phonetic Algorithm
+ *
+ * Encodes names into a 4-character phonetic code (1 letter + 3 digits).
+ * Names that sound similar will have the same Soundex code.
+ *
+ * Developed by Robert C. Russell and Margaret King Odell in 1918-1922.
+ * Widely used in genealogy, census data, and name matching.
+ *
+ * Algorithm:
+ * 1. Keep the first letter
+ * 2. Replace consonants with digits based on phonetic similarity:
+ *    - B, F, P, V → 1
+ *    - C, G, J, K, Q, S, X, Z → 2
+ *    - D, T → 3
+ *    - L → 4
+ *    - M, N → 5
+ *    - R → 6
+ * 3. Remove adjacent duplicate digits
+ * 4. Remove all occurrences of A, E, I, O, U, H, W, Y (except first letter)
+ * 5. Pad with zeros or truncate to 4 characters
+ *
+ * @param name - Name to encode
+ * @returns 4-character Soundex code (e.g., "R163" for "Robert")
+ *
+ * @example
+ * soundex('Robert')    // Returns "R163"
+ * soundex('Rupert')    // Returns "R163" (sounds similar)
+ * soundex('Smith')     // Returns "S530"
+ * soundex('Smythe')    // Returns "S530" (sounds similar)
+ * soundex('Johnson')   // Returns "J525"
+ * soundex('Jonson')    // Returns "J525" (sounds similar)
+ */
+function soundex(name) {
+    if (!name || name.length === 0) {
+        return '0000';
+    }
+    // Convert to uppercase and remove non-alphabetic characters
+    const cleaned = name.toUpperCase().replace(/[^A-Z]/g, '');
+    if (cleaned.length === 0) {
+        return '0000';
+    }
+    // Keep first letter
+    const firstLetter = cleaned[0];
+    // Soundex digit mapping
+    const soundexMap = {
+        'B': '1', 'F': '1', 'P': '1', 'V': '1',
+        'C': '2', 'G': '2', 'J': '2', 'K': '2', 'Q': '2', 'S': '2', 'X': '2', 'Z': '2',
+        'D': '3', 'T': '3',
+        'L': '4',
+        'M': '5', 'N': '5',
+        'R': '6',
+        // A, E, I, O, U, H, W, Y → removed (mapped to '0')
+        'A': '0', 'E': '0', 'I': '0', 'O': '0', 'U': '0', 'H': '0', 'W': '0', 'Y': '0'
+    };
+    // Convert all characters to Soundex digits
+    let code = firstLetter;
+    let prevDigit = soundexMap[firstLetter] || '0';
+    for (let i = 1; i < cleaned.length; i++) {
+        const char = cleaned[i];
+        const digit = soundexMap[char] || '0';
+        // Skip if same as previous digit (remove adjacent duplicates)
+        if (digit === prevDigit) {
+            continue;
+        }
+        // Skip zeros (vowels and H, W, Y)
+        if (digit === '0') {
+            prevDigit = digit;
+            continue;
+        }
+        code += digit;
+        prevDigit = digit;
+        // Stop when we have 4 characters
+        if (code.length === 4) {
+            break;
+        }
+    }
+    // Pad with zeros if needed
+    while (code.length < 4) {
+        code += '0';
+    }
+    return code;
+}
+/**
+ * Compare two names using Soundex encoding
+ *
+ * @param name1 - First name to compare
+ * @param name2 - Second name to compare
+ * @returns true if names sound similar (same Soundex code)
+ *
+ * @example
+ * soundexMatch('Robert', 'Rupert')  // Returns true
+ * soundexMatch('Smith', 'Smythe')   // Returns true
+ * soundexMatch('Johnson', 'Jackson') // Returns false
+ */
+function soundexMatch(name1, name2) {
+    return soundex(name1) === soundex(name2);
+}
+//# sourceMappingURL=soundex.js.map

package/dist/functions/phonetic/soundex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"soundex.js","sourceRoot":"","sources":["../../../src/functions/phonetic/soundex.ts"],"names":[],"mappings":";;AAiCA,0BA6DC;AAcD,oCAEC;AA9GD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,SAAgB,OAAO,CAAC,IAAY;IAClC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,4DAA4D;IAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAE1D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,oBAAoB;IACpB,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAE/B,wBAAwB;IACxB,MAAM,UAAU,GAA2B;QACzC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;QACtC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;QAC9E,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;QAClB,GAAG,EAAE,GAAG;QACR,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;QAClB,GAAG,EAAE,GAAG;QACR,mDAAmD;QACnD,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;KAC/E,CAAC;IAEF,2CAA2C;IAC3C,IAAI,IAAI,GAAG,WAAW,CAAC;IACvB,IAAI,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC;IAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;QAEtC,8DAA8D;QAC9D,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,SAAS;QACX,CAAC;QAED,kCAAkC;QAClC,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;YAClB,SAAS,GAAG,KAAK,CAAC;YAClB,SAAS;QACX,CAAC;QAED,IAAI,IAAI,KAAK,CAAC;QACd,SAAS,GAAG,KAAK,CAAC;QAElB,iCAAiC;QACjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM;QACR,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,IAAI,IAAI,GAAG,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,YAAY,CAAC,KAAa,EAAE,KAAa;IACvD,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC;AAC3C,CAAC"}

package/dist/functions/similarity/cosine-similarity.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Cosine Similarity
+ *
+ * Compares two text inputs using word-frequency vectors.
+ * Returns a similarity score between 0 and 1, where:
+ * - 0 = completely dissimilar
+ * - 1 = identical
+ *
+ * Algorithm:
+ * 1. Tokenize both inputs into words
+ * 2. Build frequency vectors for each word across both inputs
+ * 3. Calculate dot product of vectors
+ * 4. Calculate magnitude (length) of each vector
+ * 5. Return: dot_product / (magnitude1 * magnitude2)
+ *
+ * @param text1 - First text to compare
+ * @param text2 - Second text to compare
+ * @returns Similarity score rounded to 2 decimal places (0.00 - 1.00)
+ *
+ * @example
+ * cosineSimilarity('the quick brown fox', 'the lazy brown dog')
+ * // Returns 0.50 (50% similar - shared words: 'the', 'brown')
+ *
+ * cosineSimilarity('hello world', 'hello world')
+ * // Returns 1.00 (100% identical)
+ *
+ * cosineSimilarity('foo bar', 'baz qux')
+ * // Returns 0.00 (0% similar - no shared words)
+ */
+export declare function cosineSimilarity(text1: string, text2: string): number;
+//# sourceMappingURL=cosine-similarity.d.ts.map

package/dist/functions/similarity/cosine-similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cosine-similarity.d.ts","sourceRoot":"","sources":["../../../src/functions/similarity/cosine-similarity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAqDrE"}

package/dist/functions/similarity/cosine-similarity.js

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cosineSimilarity = cosineSimilarity;
+/**
+ * Cosine Similarity
+ *
+ * Compares two text inputs using word-frequency vectors.
+ * Returns a similarity score between 0 and 1, where:
+ * - 0 = completely dissimilar
+ * - 1 = identical
+ *
+ * Algorithm:
+ * 1. Tokenize both inputs into words
+ * 2. Build frequency vectors for each word across both inputs
+ * 3. Calculate dot product of vectors
+ * 4. Calculate magnitude (length) of each vector
+ * 5. Return: dot_product / (magnitude1 * magnitude2)
+ *
+ * @param text1 - First text to compare
+ * @param text2 - Second text to compare
+ * @returns Similarity score rounded to 2 decimal places (0.00 - 1.00)
+ *
+ * @example
+ * cosineSimilarity('the quick brown fox', 'the lazy brown dog')
+ * // Returns 0.50 (50% similar - shared words: 'the', 'brown')
+ *
+ * cosineSimilarity('hello world', 'hello world')
+ * // Returns 1.00 (100% identical)
+ *
+ * cosineSimilarity('foo bar', 'baz qux')
+ * // Returns 0.00 (0% similar - no shared words)
+ */
+function cosineSimilarity(text1, text2) {
+    // Tokenize inputs into words
+    const words1 = text1.toLowerCase().split(/\s+/).filter(w => w.length > 0);
+    const words2 = text2.toLowerCase().split(/\s+/).filter(w => w.length > 0);
+    // Build combined vocabulary (all unique words from both texts)
+    const vocabulary = new Set([...words1, ...words2]);
+    // Build frequency vectors
+    const vector1 = {};
+    const vector2 = {};
+    for (const word of vocabulary) {
+        vector1[word] = 0;
+        vector2[word] = 0;
+    }
+    for (const word of words1) {
+        vector1[word]++;
+    }
+    for (const word of words2) {
+        vector2[word]++;
+    }
+    // Calculate dot product
+    let dotProduct = 0;
+    for (const word of vocabulary) {
+        dotProduct += vector1[word] * vector2[word];
+    }
+    // Calculate magnitudes
+    let magnitude1 = 0;
+    let magnitude2 = 0;
+    for (const word of vocabulary) {
+        magnitude1 += vector1[word] ** 2;
+        magnitude2 += vector2[word] ** 2;
+    }
+    magnitude1 = Math.sqrt(magnitude1);
+    magnitude2 = Math.sqrt(magnitude2);
+    // Handle division by zero (empty inputs)
+    if (magnitude1 === 0 || magnitude2 === 0) {
+        return 0.0;
+    }
+    // Calculate cosine similarity
+    const similarity = dotProduct / (magnitude1 * magnitude2);
+    // Round to 2 decimal places
+    return Math.round(similarity * 100) / 100;
+}
+//# sourceMappingURL=cosine-similarity.js.map

package/dist/functions/similarity/cosine-similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cosine-similarity.js","sourceRoot":"","sources":["../../../src/functions/similarity/cosine-similarity.ts"],"names":[],"mappings":";;AA6BA,4CAqDC;AAlFD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,SAAgB,gBAAgB,CAAC,KAAa,EAAE,KAAa;IAC3D,6BAA6B;IAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1E,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE1E,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;IAEnD,0BAA0B;IAC1B,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,MAAM,OAAO,GAA2B,EAAE,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;IAClB,CAAC;IAED,wBAAwB;IACxB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED,uBAAuB;IACvB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACnC,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAEnC,yCAAyC;IACzC,IAAI,UAAU,KAAK,CAAC,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACzC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,8BAA8B;IAC9B,MAAM,UAAU,GAAG,UAAU,GAAG,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC;IAE1D,4BAA4B;IAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;AAC5C,CAAC"}

package/dist/functions/similarity/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Text Similarity Functions
+ *
+ * Functions for measuring similarity between text strings.
+ */
+export { cosineSimilarity } from './cosine-similarity';
+//# sourceMappingURL=index.d.ts.map

package/dist/functions/similarity/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/functions/similarity/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/functions/similarity/index.js

@@ -0,0 +1,11 @@
+"use strict";
+/**
+ * Text Similarity Functions
+ *
+ * Functions for measuring similarity between text strings.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cosineSimilarity = void 0;
+var cosine_similarity_1 = require("./cosine-similarity");
+Object.defineProperty(exports, "cosineSimilarity", { enumerable: true, get: function () { return cosine_similarity_1.cosineSimilarity; } });
+//# sourceMappingURL=index.js.map

package/dist/functions/similarity/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/functions/similarity/index.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH,yDAAuD;AAA9C,qHAAA,gBAAgB,OAAA"}

package/dist/index.d.ts

@@ -0,0 +1,56 @@
+/**
+ * BOE - Bag of Engines
+ *
+ * A modular, multi-paradigm rule engine supporting:
+ * - Forward chaining (data-driven)
+ * - Backward chaining (goal-driven)
+ * - Scoring (accumulative)
+ * - Sequential (first-match-wins)
+ * - Fuzzy logic (linguistic inference)
+ * - Bayesian (probabilistic inference)
+ *
+ * Architecture:
+ * - core/     - Shared types, memory, operators, evaluation
+ * - engines/  - Individual engine implementations (each with its own Engine class)
+ */
+export { ForwardEngine } from './engines/forward';
+export { BackwardEngine } from './engines/backward';
+export { ScoringEngine } from './engines/scoring';
+export { SequentialEngine } from './engines/sequential';
+export { FuzzyEngine } from './engines/fuzzy';
+export { BayesianEngine } from './engines/bayesian';
+export { MonteCarloEngine } from './engines/monte-carlo';
+export { StateMachineEngine } from './engines/state-machine';
+export { ConstraintEngine } from './engines/constraint';
+export { UtilityEngine } from './engines/utility';
+export { PricingEngine } from './engines/pricing';
+export * from './core';
+export { ForwardChainingStrategy, compileForwardRuleSet, compileForwardRule, forwardStrategy } from './engines/forward';
+export type { ForwardRule, ForwardRuleSet, ForwardConfig, CompiledForwardRuleSet, CompiledForwardRule, ForwardOptions, ForwardResult, ActionRegistry, ActionHandler } from './engines/forward';
+export { BackwardChainingStrategy, compileBackwardRuleSet, backwardStrategy } from './engines/backward';
+export type { BackwardRule, BackwardRuleSet, BackwardConfig, CompiledBackwardRuleSet, BackwardOptions, BackwardResult, ProofStep, ProofResult } from './engines/backward';
+export { ScoringStrategy, compileScoringRuleSet, scoringStrategy } from './engines/scoring';
+export type { ScoringRule, ScoringRuleSet, ScoringConfig, CompiledScoringRuleSet, ScoringOptions, ScoringResult, ScoreFunctionRegistry, ScoringMethod, OutputBounds } from './engines/scoring';
+export { SequentialStrategy, compileSequentialRuleSet, sequentialStrategy } from './engines/sequential';
+export type { SequentialRule, SequentialRuleSet, SequentialConfig, CompiledSequentialRuleSet, SequentialOptions, SequentialResult } from './engines/sequential';
+export { FuzzyStrategy, compileFuzzyRuleSet, fuzzyStrategy, compileFuzzyVariable, analyzeCoverage, autoAdjustCoverage } from './engines/fuzzy';
+export type { FuzzyRule, FuzzyRuleSet, FuzzyOptions, FuzzyResult, FuzzyVariable, FuzzyTerm, CompiledFuzzyRuleSet, CompiledFuzzyVariable, DefuzzifyPreset, DefuzzifyConfig } from './engines/fuzzy';
+export { BayesianStrategy, compileBayesianRuleSet, compileBayesianRule, bayesianStrategy, parseLikelihood, SEMANTIC_LIKELIHOODS } from './engines/bayesian';
+export type { BayesianRule, BayesianRuleSet, BayesianConfig, CompiledBayesianRuleSet, CompiledBayesianRule, BayesianOptions, BayesianResult, Hypothesis, PriorValue, PriorDefault, LikelihoodValue, LikelihoodMap, SemanticLikelihood, EvidenceEntry } from './engines/bayesian';
+export { MonteCarloStrategy, compileMonteCarloRuleSet, monteCarloStrategy } from './engines/monte-carlo';
+export type { MonteCarloVariable, MonteCarloOutput, MonteCarloRuleSet, MonteCarloConfig, CompiledMonteCarloRuleSet, MonteCarloOptions, MonteCarloResult, OutputStatistics } from './engines/monte-carlo';
+export { StateMachineStrategy, compileStateMachine, compileStateMachineDefinition, stateMachineStrategy } from './engines/state-machine';
+export type { StateMachineDefinition, StateMachineConfig, StateDefinition, StateTransition, CompiledStateMachineDefinition, MachineSnapshot, TransitionResult, StateMachineOptions } from './engines/state-machine';
+export { ConstraintStrategy, compileConstraintRuleSet, constraintStrategy } from './engines/constraint';
+export type { ConstraintVariable, Constraint, Preference, PreferenceWeight, SemanticWeight, ConstraintRuleSet, ConstraintConfig, CompiledConstraintRuleSet, CompiledPreference, ConstraintOptions, ConstraintResult, ConstraintAllResult, ScoredSolution } from './engines/constraint';
+export { SEMANTIC_WEIGHTS } from './engines/constraint';
+export { UtilityStrategy, compileUtilityRuleSet, compileUtilityRule, utilityStrategy } from './engines/utility';
+export type { UtilityCriterion, UtilityRule, UtilityRuleSet, UtilityConfig, CompiledUtilityCriterion, CompiledUtilityRule, CompiledUtilityRuleSet, AlternativeResult, SensitivityInfo, UtilityOptions, UtilityResult, AlternativeInput, UtilityExecuteOptions } from './engines/utility';
+export { DefeasibleEngine, compileDefeasibleRuleSet } from './engines/defeasible';
+export type { DefeasibleRule, DefeasibleRuleSet, DefeasibleConfig, CompiledDefeasibleRuleSet, DefeasibleOptions, DefeasibleResult } from './engines/defeasible';
+export { ExpertEngine, ExpertStrategy, compileExpertRuleSet, expertStrategy, compileTemplate, interpolate, hasInterpolation, buildAvailableRefs } from './engines/expert';
+export type { ExpertRule, ExpertRuleSet, ExpertConfig, ExplainBlock, CompiledExpertRuleSet, CompiledExpertRule, CompiledExplainBlock, CompiledTemplate, ExpertOptions, ExpertResult, ExpertQueryResult, InferenceStep, InterpolationContext } from './engines/expert';
+export { PricingStrategy, compilePricingRuleSet, compilePricingRule, pricingStrategy, pricingEngine, calculateFlat, calculateGraduated, calculateVolume, formatCurrency, formatNumber, formatPercent, round, calculateDiscount, applyMinMax, CURRENCIES, getCurrencyInfo } from './engines/pricing';
+export type { CurrencyCode, CurrencyInfo, PricingRule, PricingRuleSet, PricingConfig, PricingComponent, PricingMode, PricingInput, PricingPackage, FlatPricing, GraduatedTier, GraduatedPricing, VolumeBracket, VolumePricing, Meter, MultiMeterPricing, FormulaPricing, Adjustment, DiscountAdjustment, MinimumAdjustment, MaximumAdjustment, Metric, ScenarioDefinition, ScenarioDefinitions, AttributeSchema, ProductType, ResolvedPricingConfig, CompiledPricingRuleSet, CompiledPricingRule, CompiledPricingComponent, CompiledPricingMode, CompiledAdjustment, CompiledMetric, PricingOptions, PricingResult, ScenarioComparisonResult, ScenarioResult, ComponentResult, AdjustmentResult, TierBreakdown, MeterResult, PricingSummary, CalculatorContext, TierCalculationResult } from './engines/pricing';
+export { soundex, nysiis, caverphone2, cosineSimilarity } from './functions';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAOH,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAMlD,cAAc,QAAQ,CAAC;AAOvB,OAAO,EACL,uBAAuB,EACvB,qBAAqB,EACrB,kBAAkB,EAClB,eAAe,EAChB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EACV,WAAW,EACX,cAAc,EACd,aAAa,EACb,sBAAsB,EACtB,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,cAAc,EACd,aAAa,EACd,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EACL,wBAAwB,EACxB,sBAAsB,EACtB,gBAAgB,EACjB,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EACV,YAAY,EACZ,eAAe,EACf,cAAc,EACd,uBAAuB,EACvB,eAAe,EACf,cAAc,EACd,SAAS,EACT,WAAW,EACZ,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,eAAe,EACf,qBAAqB,EACrB,eAAe,EAChB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EACV,WAAW,EACX,cAAc,EACd,aAAa,EACb,sBAAsB,EACtB,cAAc,EACd,aAAa,EACb,qBAAqB,EACrB,aAAa,EACb,YAAY,EACb,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EACL,kBAAkB,EAClB,wBAAwB,EACxB,kBAAkB,EACnB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,cAAc,EACd,iBAAiB,EACjB,gBAAgB,EAChB,yBAAyB,EACzB,iBAAiB,EACjB,gBAAgB,EACjB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EACL,aAAa,EACb,mBAAmB,EACnB,aAAa,EACb,oBAAoB,EACpB,eAAe,EACf,kBAAkB,EACnB,MAAM,iBAAiB,CAAC;AACzB,YAAY,EACV,SAAS,EACT,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,aAAa,EACb,SAAS,EACT,oBAAoB,EACpB,qBAAqB,EACrB,eAAe,EACf,eAAe,EAChB,MAAM,iBAAiB,CAAC;AAGzB,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,mBAAmB,EACnB,gBAAgB,EAChB,eAAe,EACf,oBAAoB,EACrB,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EACV,YAAY,EACZ,eAAe,EACf,cAAc,EACd,uBAAuB,EACvB,oBAAoB,EACpB,eAAe,EACf,cAAc,EACd,UAAU,EACV,UAAU,EACV,YAAY,EACZ,eAAe,EACf,aAAa,EACb,kBAAkB,EAClB,aAAa,EACd,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,kBAAkB,EAClB,wBAAwB,EACxB,kBAAkB,EACnB,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EACV,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,EACjB,gBAAgB,EAChB,yBAAyB,EACzB,iBAAiB,EACjB,gBAAgB,EAChB,gBAAgB,EACjB,MAAM,uBAAuB,CAAC;AAG/B,OAAO,EACL,oBAAoB,EACpB,mBAAmB,EACnB,6BAA6B,EAC7B,oBAAoB,EACrB,MAAM,yBAAyB,CAAC;AACjC,YAAY,EACV,sBAAsB,EACtB,kBAAkB,EAClB,eAAe,EACf,eAAe,EACf,8BAA8B,EAC9B,eAAe,EACf,gBAAgB,EAChB,mBAAmB,EACpB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EACL,kBAAkB,EAClB,wBAAwB,EACxB,kBAAkB,EACnB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,kBAAkB,EAClB,UAAU,EACV,UAAU,EACV,gBAAgB,EAChB,cAAc,EACd,iBAAiB,EACjB,gBAAgB,EAChB,yBAAyB,EACzB,kBAAkB,EAClB,iBAAiB,EACjB,gBAAgB,EAChB,mBAAmB,EACnB,cAAc,EACf,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EACL,eAAe,EACf,qBAAqB,EACrB,kBAAkB,EAClB,eAAe,EAChB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EACV,gBAAgB,EAChB,WAAW,EACX,cAAc,EACd,aAAa,EACb,wBAAwB,EACxB,mBAAmB,EACnB,sBAAsB,EACtB,iBAAiB,EACjB,eAAe,EACf,cAAc,EACd,aAAa,EACb,gBAAgB,EAChB,qBAAqB,EACtB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EACL,gBAAgB,EAChB,wBAAwB,EACzB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,cAAc,EACd,iBAAiB,EACjB,gBAAgB,EAChB,yBAAyB,EACzB,iBAAiB,EACjB,gBAAgB,EACjB,MAAM,sBAAsB,CAAC;AAG9B,OAAO,EACL,YAAY,EACZ,cAAc,EACd,oBAAoB,EACpB,cAAc,EACd,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,kBAAkB,EACnB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EACV,UAAU,EACV,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,qBAAqB,EACrB,kBAAkB,EAClB,oBAAoB,EACpB,gBAAgB,EAChB,aAAa,EACb,YAAY,EACZ,iBAAiB,EACjB,aAAa,EACb,oBAAoB,EACrB,MAAM,kBAAkB,CAAC;AAO1B,OAAO,EACL,eAAe,EACf,qBAAqB,EACrB,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,aAAa,EACb,kBAAkB,EAClB,eAAe,EACf,cAAc,EACd,YAAY,EACZ,aAAa,EACb,KAAK,EACL,iBAAiB,EACjB,WAAW,EAEX,UAAU,EACV,eAAe,EAChB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EAEV,YAAY,EACZ,YAAY,EAEZ,WAAW,EACX,cAAc,EACd,aAAa,EACb,gBAAgB,EAChB,WAAW,EACX,YAAY,EACZ,cAAc,EACd,WAAW,EACX,aAAa,EACb,gBAAgB,EAChB,aAAa,EACb,aAAa,EACb,KAAK,EACL,iBAAiB,EACjB,cAAc,EACd,UAAU,EACV,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,MAAM,EACN,kBAAkB,EAClB,mBAAmB,EACnB,eAAe,EACf,WAAW,EAEX,qBAAqB,EACrB,sBAAsB,EACtB,mBAAmB,EACnB,wBAAwB,EACxB,mBAAmB,EACnB,kBAAkB,EAClB,cAAc,EAEd,cAAc,EACd,aAAa,EACb,wBAAwB,EACxB,cAAc,EACd,eAAe,EACf,gBAAgB,EAChB,aAAa,EACb,WAAW,EACX,cAAc,EACd,iBAAiB,EACjB,qBAAqB,EACtB,MAAM,mBAAmB,CAAC;AAM3B,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC"}