cspell-trie-lib 5.15.3 → 5.18.0-alpha.0

package/dist/lib/TrieNode.d.ts

@@ -1,3 +1,4 @@
+import type { PartialWithUndefined } from './types';
 export declare const FLAG_WORD = 1;
 export declare class ChildMap extends Map<string, TrieNode> {
 }

package/dist/lib/distance/distance.d.ts

@@ -1,6 +1,6 @@
-import type { SuggestionCostMapDef } from './suggestionCostsDef';
+import type { SuggestionCostMapDef } from '../models/suggestionCostsDef';
 import type { WeightMap } from './weightedMaps';
-export type { SuggestionCostMapDef } from './suggestionCostsDef';
+export type { SuggestionCostMapDef } from '../models/suggestionCostsDef';
 export type { WeightMap } from './weightedMaps';
 /**
  * Calculate the edit distance between any two words.

package/dist/lib/distance/distanceAStarWeighted.d.ts

@@ -5,4 +5,16 @@ import { WeightMap } from './weightedMaps';
  * Using basic weights, this algorithm has the same results as the Damerau-Levenshtein algorithm.
  */
 export declare function distanceAStarWeighted(wordA: string, wordB: string, map: WeightMap, cost?: number): number;
+export interface ExResult {
+    a: string;
+    b: string;
+    cost: number;
+    segments: {
+        a: string;
+        b: string;
+        c: number;
+        p: number;
+    }[];
+}
+export declare function distanceAStarWeightedEx(wordA: string, wordB: string, map: WeightMap, cost?: number): ExResult | undefined;
 //# sourceMappingURL=distanceAStarWeighted.d.ts.map

package/dist/lib/distance/distanceAStarWeighted.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.distanceAStarWeighted = void 0;
+exports.distanceAStarWeightedEx = exports.distanceAStarWeighted = void 0;
 const PairingHeap_1 = require("../utils/PairingHeap");
 /**
  * Calculate the edit distance between two words using an A* algorithm.
@@ -8,45 +8,79 @@ const PairingHeap_1 = require("../utils/PairingHeap");
  * Using basic weights, this algorithm has the same results as the Damerau-Levenshtein algorithm.
  */
 function distanceAStarWeighted(wordA, wordB, map, cost = 100) {
+    const best = _distanceAStarWeightedEx(wordA, wordB, map, cost);
+    return best ? best.c + best.p : -1;
+}
+exports.distanceAStarWeighted = distanceAStarWeighted;
+function distanceAStarWeightedEx(wordA, wordB, map, cost = 100) {
+    const best = _distanceAStarWeightedEx(wordA, wordB, map, cost);
+    if (!best)
+        return undefined;
+    const aa = '^' + wordA + '$';
+    const bb = '^' + wordB + '$';
+    const result = {
+        a: aa,
+        b: bb,
+        cost: best.c + best.p,
+        segments: [],
+    };
+    const segments = result.segments;
+    for (let n = best; n.f; n = n.f) {
+        const f = n.f;
+        const a = aa.slice(f.ai, n.ai);
+        const b = bb.slice(f.bi, n.bi);
+        const c = n.c - f.c;
+        const p = n.p - f.p;
+        segments.push({ a, b, c, p });
+    }
+    segments.reverse();
+    return result;
+}
+exports.distanceAStarWeightedEx = distanceAStarWeightedEx;
+function _distanceAStarWeightedEx(wordA, wordB, map, cost = 100) {
     // Add ^ and $ for begin/end detection.
     const a = '^' + wordA + '$';
     const b = '^' + wordB + '$';
     const aN = a.length;
     const bN = b.length;
     const candidates = new PairingHeap_1.PairingHeap(compare);
-    candidates.add({ ai: 0, bi: 0, c: 0 });
+    candidates.add({ ai: 0, bi: 0, c: 0, p: 0, f: undefined });
+    /** Substitute / Replace */
     function opSub(n) {
-        const { ai, bi, c } = n;
+        const { ai, bi, c, p } = n;
         if (ai < aN && bi < bN) {
             const cc = a[ai] === b[bi] ? c : c + cost;
-            candidates.add({ ai: ai + 1, bi: bi + 1, c: cc });
+            candidates.add({ ai: ai + 1, bi: bi + 1, c: cc, p, f: n });
         }
     }
+    /** Insert */
     function opIns(n) {
-        const { ai, bi, c } = n;
+        const { ai, bi, c, p } = n;
         if (bi < bN) {
-            candidates.add({ ai: ai, bi: bi + 1, c: c + cost });
+            candidates.add({ ai: ai, bi: bi + 1, c: c + cost, p, f: n });
         }
     }
+    /** Delete */
     function opDel(n) {
-        const { ai, bi, c } = n;
+        const { ai, bi, c, p } = n;
         if (ai < aN) {
-            candidates.add({ ai: ai + 1, bi: bi, c: c + cost });
+            candidates.add({ ai: ai + 1, bi: bi, c: c + cost, p, f: n });
         }
     }
+    /** Swap adjacent letters */
     function opSwap(n) {
-        const { ai, bi, c } = n;
+        const { ai, bi, c, p } = n;
         if (a[ai] === b[bi + 1] && a[ai + 1] === b[bi]) {
-            candidates.add({ ai: ai + 2, bi: bi + 2, c: c + cost });
+            candidates.add({ ai: ai + 2, bi: bi + 2, c: c + cost, p, f: n });
         }
     }
     function opMap(n) {
-        const { ai, bi, c } = n;
-        const pos = { a, b, ai, bi, c };
+        const { ai, bi, c, p } = n;
+        const pos = { a, b, ai, bi, c, p };
         const costCalculations = [map.calcInsDelCosts(pos), map.calcSwapCosts(pos), map.calcReplaceCosts(pos)];
         costCalculations.forEach((iter) => {
             for (const nn of iter) {
-                candidates.add(nn);
+                candidates.add({ ...nn, f: n });
             }
         });
     }
@@ -61,10 +95,8 @@ function distanceAStarWeighted(wordA, wordB, map, cost = 100) {
         opMap(best);
         opSub(best);
     }
-    // istanbul ignore else
-    return best ? best.c : -1;
+    return best;
 }
-exports.distanceAStarWeighted = distanceAStarWeighted;
 function compare(a, b) {
     // Choose lowest cost or farthest Manhattan distance.
     return a.c - b.c || b.ai + b.bi - a.ai - a.bi;

package/dist/lib/distance/formatResultEx.d.ts

@@ -0,0 +1,5 @@
+import { WeightMap } from '.';
+import { ExResult } from './distanceAStarWeighted';
+export declare function formatExResult(ex: ExResult | undefined): string;
+export declare function formattedDistance(wordA: string, wordB: string, weightMap: WeightMap, cost?: number): string;
+//# sourceMappingURL=formatResultEx.d.ts.map

package/dist/lib/distance/formatResultEx.js

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.formattedDistance = exports.formatExResult = void 0;
+const distanceAStarWeighted_1 = require("./distanceAStarWeighted");
+function pL(s, w) {
+    const strWidth = vizWidth(s);
+    const w0 = Math.max(0, w - strWidth);
+    return ' '.repeat(w0) + s;
+}
+function pR(s, w) {
+    const strWidth = vizWidth(s);
+    const w0 = Math.max(0, w - strWidth);
+    return s + ' '.repeat(w0);
+}
+function vizWidth(s) {
+    const r = s.replace(/[\u0300-\u036F\u007f-\u009f]/gu, '');
+    let i = 0;
+    for (const c of r) {
+        i += c.length;
+    }
+    return i;
+}
+function formatExResult(ex) {
+    if (!ex)
+        return '<undefined>';
+    const { cost, segments } = ex;
+    const asString = segments.map(({ a, b, c, p }) => ({
+        a: `<${a}>`,
+        b: `<${b}>`,
+        c: c.toString(10),
+        p: p.toString(10),
+    }));
+    asString.push({
+        a: '',
+        b: '',
+        c: ' = ' + segments.reduce((sum, { c }) => sum + c, 0).toString(10),
+        p: ' = ' + segments.reduce((sum, { p }) => sum + p, 0).toString(10),
+    });
+    const parts = asString.map(({ a, b, c, p }) => ({
+        a,
+        b,
+        c,
+        p,
+        w: Math.max(vizWidth(a), vizWidth(b), vizWidth(c), vizWidth(p)),
+    }));
+    const a = 'a: |' + parts.map(({ a, w }) => pR(a, w)).join('|') + '|';
+    const b = 'b: |' + parts.map(({ b, w }) => pR(b, w)).join('|') + '|';
+    const c = 'c: |' + parts.map(({ c, w }) => pL(c, w)).join('|') + '|';
+    const p = 'p: |' + parts.map(({ p, w }) => pL(p, w)).join('|') + '|';
+    return `<${ex.a.slice(1, -1)}> -> <${ex.b.slice(1, -1)}> (${cost})\n${[a, b, c, p].join('\n')}\n`;
+}
+exports.formatExResult = formatExResult;
+function formattedDistance(wordA, wordB, weightMap, cost) {
+    const x = (0, distanceAStarWeighted_1.distanceAStarWeightedEx)(wordA, wordB, weightMap, cost);
+    return formatExResult(x);
+}
+exports.formattedDistance = formattedDistance;
+//# sourceMappingURL=formatResultEx.js.map

package/dist/lib/distance/index.d.ts

@@ -1,4 +1,3 @@
 export { createWeightedMap, editDistance, editDistanceWeighted } from './distance';
 export type { WeightMap } from './distance';
-export type { SuggestionCostMapDef } from './suggestionCostsDef';
 //# sourceMappingURL=index.d.ts.map

package/dist/lib/distance/weightedMaps.d.ts

@@ -1,4 +1,4 @@
-import { SuggestionCostMapDef } from './suggestionCostsDef';
+import { SuggestionCostMapDef } from '../models/suggestionCostsDef';
 export declare type WeightedRepMapTrie = Record<string, WeightedRepTrieNode>;
 interface WeightedRepTrieNode {
     /** The nested Trie nodes */
@@ -8,11 +8,24 @@ interface WeightedRepTrieNode {
     /** The cost to swap */
     swap?: number | undefined;
 }
-interface TrieCost {
+/**
+ * Costs are minimized while penalties are maximized.
+ */
+interface Cost {
+    /**
+     * The cost of an operation
+     * `c'' = min(c, c')`
+     */
+    c?: number | undefined;
+    /**
+     * The penalties applied
+     * `p'' = max(p, p')`
+     */
+    p?: number | undefined;
+}
+interface TrieCost extends Cost {
     /** nested trie nodes */
     n?: Record<string, TrieCost>;
-    /** the cost to insert/delete */
-    c?: number | undefined;
 }
 interface TrieTrieCost {
     /** nested trie nodes */
@@ -26,6 +39,7 @@ export interface CostPosition {
     b: string;
     bi: number;
     c: number;
+    p: number;
 }
 export interface WeightMap {
     readonly insDel: TrieCost;
@@ -37,15 +51,18 @@ export interface WeightMap {
 }
 export declare function createWeightMap(...defs: SuggestionCostMapDef[]): WeightMap;
 export declare function addDefToWeightMap(map: WeightMap, def: SuggestionCostMapDef, ...defs: SuggestionCostMapDef[]): WeightMap;
+export declare function addDefsToWeightMap(map: WeightMap, defs: SuggestionCostMapDef[]): WeightMap;
+export declare function splitMapSubstringsIterable(map: string): Iterable<string>;
+export declare function splitMapSubstrings(map: string): string[];
 /**
  * Splits a WeightedMapDef.map
  * @param map
  */
 declare function splitMap(def: Pick<SuggestionCostMapDef, 'map'>): string[][];
-declare function splitMapSubstrings(map: string): string[];
 interface MatchTrieCost {
     i: number;
     c: number;
+    p: number;
 }
 declare function findTrieCostPrefixes(trie: TrieCost, str: string, i: number): Iterable<MatchTrieCost>;
 interface MatchTrieTrieCost {

package/dist/lib/distance/weightedMaps.js

@@ -1,21 +1,21 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.__testing__ = exports.lookupReplaceCost = exports.prettyPrintWeightMap = exports.prettyPrintSwap = exports.prettyPrintReplace = exports.addDefToWeightMap = exports.createWeightMap = void 0;
+exports.__testing__ = exports.lookupReplaceCost = exports.prettyPrintWeightMap = exports.prettyPrintSwap = exports.prettyPrintReplace = exports.splitMapSubstrings = exports.splitMapSubstringsIterable = exports.addDefsToWeightMap = exports.addDefToWeightMap = exports.createWeightMap = void 0;
 function createWeightMap(...defs) {
     const map = _createWeightMap();
-    _addDefToWeightMap(map, ...defs);
+    addDefsToWeightMap(map, defs);
     return map;
 }
 exports.createWeightMap = createWeightMap;
 function addDefToWeightMap(map, ...defs) {
-    return _addDefToWeightMap(map, ...defs);
+    return addDefsToWeightMap(map, defs);
 }
 exports.addDefToWeightMap = addDefToWeightMap;
-function _addDefToWeightMap(map, ...defs) {
+function addDefsToWeightMap(map, defs) {
     function addSet(set, def) {
-        addSetToTrieCost(map.insDel, set, def.insDel);
-        addSetToTrieTrieCost(map.replace, set, def.replace);
-        addSetToTrieTrieCost(map.swap, set, def.swap);
+        addSetToTrieCost(map.insDel, set, def.insDel, def.penalty);
+        addSetToTrieTrieCost(map.replace, set, def.replace, def.penalty);
+        addSetToTrieTrieCost(map.swap, set, def.swap, def.penalty);
     }
     for (const def of defs) {
         const mapSets = splitMap(def);
@@ -23,6 +23,7 @@ function _addDefToWeightMap(map, ...defs) {
     }
     return map;
 }
+exports.addDefsToWeightMap = addDefsToWeightMap;
 function _createWeightMap() {
     return new _WeightedMap();
 }
@@ -33,6 +34,45 @@ function lowest(a, b) {
         return a;
     return a <= b ? a : b;
 }
+function highest(a, b) {
+    if (a === undefined)
+        return b;
+    if (b === undefined)
+        return a;
+    return a >= b ? a : b;
+}
+function normalize(s) {
+    const f = new Set([s]);
+    f.add(s.normalize('NFC'));
+    f.add(s.normalize('NFD'));
+    return f;
+}
+function* splitMapSubstringsIterable(map) {
+    let seq = '';
+    let mode = 0;
+    for (const char of map) {
+        if (mode && char === ')') {
+            yield* normalize(seq);
+            mode = 0;
+            continue;
+        }
+        if (mode) {
+            seq += char;
+            continue;
+        }
+        if (char === '(') {
+            mode = 1;
+            seq = '';
+            continue;
+        }
+        yield* normalize(char);
+    }
+}
+exports.splitMapSubstringsIterable = splitMapSubstringsIterable;
+function splitMapSubstrings(map) {
+    return [...splitMapSubstringsIterable(map)];
+}
+exports.splitMapSubstrings = splitMapSubstrings;
 /**
  * Splits a WeightedMapDef.map
  * @param map
@@ -42,24 +82,7 @@ function splitMap(def) {
     const sets = map.split('|');
     return sets.map(splitMapSubstrings).filter((s) => s.length > 0);
 }
-function splitMapSubstrings(map) {
-    const values = [];
-    const len = map.length;
-    for (let i = 0; i < len; ++i) {
-        const c = map[i];
-        if (c !== '(') {
-            values.push(c);
-            continue;
-        }
-        const s = i + 1;
-        while (map[++i] !== ')' && i < len) {
-            // empty
-        }
-        values.push(map.slice(s, i));
-    }
-    return values.map((s) => s.trim()).filter((s) => !!s);
-}
-function addToTrieCost(trie, str, cost) {
+function addToTrieCost(trie, str, cost, penalties) {
     if (!str)
         return;
     let t = trie;
@@ -68,31 +91,32 @@ function addToTrieCost(trie, str, cost) {
         t = n[c] = n[c] || Object.create(null);
     }
     t.c = lowest(t.c, cost);
+    t.p = highest(t.p, penalties);
 }
-function addToTrieTrieCost(trie, left, right, cost) {
+function addToTrieTrieCost(trie, left, right, cost, penalties) {
     let t = trie;
     for (const c of left) {
         const n = (t.n = t.n || Object.create(null));
         t = n[c] = n[c] || Object.create(null);
     }
     const trieCost = (t.t = t.t || Object.create(null));
-    addToTrieCost(trieCost, right, cost);
+    addToTrieCost(trieCost, right, cost, penalties);
 }
-function addSetToTrieCost(trie, set, cost) {
+function addSetToTrieCost(trie, set, cost, penalties) {
     if (cost === undefined)
         return;
     for (const str of set) {
-        addToTrieCost(trie, str, cost);
+        addToTrieCost(trie, str, cost, penalties);
     }
 }
-function addSetToTrieTrieCost(trie, set, cost) {
+function addSetToTrieTrieCost(trie, set, cost, penalties) {
     if (cost === undefined)
         return;
     for (const left of set) {
         for (const right of set) {
             if (left === right)
                 continue;
-            addToTrieTrieCost(trie, left, right, cost);
+            addToTrieTrieCost(trie, left, right, cost, penalties);
         }
     }
 }
@@ -120,24 +144,24 @@ function* walkTrieNodes(t, s) {
 function* walkTrieCost(trie) {
     for (const { s, t } of walkTrieNodes(trie, '')) {
         if (t.c) {
-            yield { s, c: t.c };
+            yield { s, c: t.c, p: t.p };
         }
     }
 }
 function* walkTrieTrieCost(trie) {
     for (const { s: a, t } of walkTrieNodes(trie, '')) {
         if (t.t) {
-            for (const { s: b, c } of walkTrieCost(t.t)) {
-                yield { a, b, c };
+            for (const { s: b, c, p } of walkTrieCost(t.t)) {
+                yield { a, b, c, p };
             }
         }
     }
 }
 function* findTrieCostPrefixes(trie, str, i) {
     for (const n of searchTrieNodes(trie, str, i)) {
-        const c = n.t.c;
+        const { c, p } = n.t;
         if (c !== undefined) {
-            yield { i: n.i, c };
+            yield { i: n.i, c, p: p || 0 };
         }
     }
 }
@@ -156,34 +180,34 @@ class _WeightedMap {
         this.swap = {};
     }
     *calcInsDelCosts(pos) {
-        const { a, ai, b, bi, c } = pos;
+        const { a, ai, b, bi, c, p } = pos;
         for (const del of findTrieCostPrefixes(this.insDel, a, ai)) {
-            yield { a, b, ai: del.i, bi, c: c + del.c };
+            yield { a, b, ai: del.i, bi, c: c + del.c, p: p + del.p };
         }
         for (const ins of findTrieCostPrefixes(this.insDel, b, bi)) {
-            yield { a, b, ai, bi: ins.i, c: c + ins.c };
+            yield { a, b, ai, bi: ins.i, c: c + ins.c, p: p + ins.p };
         }
     }
     *calcReplaceCosts(pos) {
         // Search for matching substrings in `a` to be replaced by
         // matching substrings from `b`. All substrings start at their
         // respective `ai`/`bi` positions.
-        const { a, ai, b, bi, c } = pos;
+        const { a, ai, b, bi, c, p } = pos;
         for (const del of findTrieTrieCostPrefixes(this.replace, a, ai)) {
             for (const ins of findTrieCostPrefixes(del.t, b, bi)) {
-                yield { a, b, ai: del.i, bi: ins.i, c: c + ins.c };
+                yield { a, b, ai: del.i, bi: ins.i, c: c + ins.c, p: p + ins.p };
             }
         }
     }
     *calcSwapCosts(pos) {
-        const { a, ai, b, bi, c } = pos;
+        const { a, ai, b, bi, c, p } = pos;
         const swap = this.swap;
         for (const left of findTrieTrieCostPrefixes(swap, a, ai)) {
             for (const right of findTrieCostPrefixes(left.t, a, left.i)) {
                 const sw = a.slice(left.i, right.i) + a.slice(ai, left.i);
                 if (b.slice(bi).startsWith(sw)) {
                     const len = sw.length;
-                    yield { a, b, ai: ai + len, bi: bi + len, c: c + right.c };
+                    yield { a, b, ai: ai + len, bi: bi + len, c: c + right.c, p: p + right.p };
                 }
             }
         }
@@ -191,16 +215,18 @@ class _WeightedMap {
 }
 function prettyPrintInsDel(trie, pfx = '', indent = '  ') {
     function* walk() {
-        for (const { s, c } of walkTrieCost(trie)) {
-            yield indent + `(${s}) = ${c}`;
+        for (const { s, c, p } of walkTrieCost(trie)) {
+            const pm = p ? ` + ${p}` : '';
+            yield indent + `(${s}) = ${c}${pm}`;
         }
     }
     return ['InsDel:', ...[...walk()].sort()].map((line) => pfx + line + '\n').join('');
 }
 function prettyPrintReplace(trie, pfx = '', indent = '  ') {
     function* walk() {
-        for (const { a, b, c } of walkTrieTrieCost(trie)) {
-            yield indent + `(${a}) -> (${b}) = ${c}`;
+        for (const { a, b, c, p } of walkTrieTrieCost(trie)) {
+            const pm = p ? ` + ${p}` : '';
+            yield indent + `(${a}) -> (${b}) = ${c}${pm}`;
         }
     }
     return ['Replace:', ...[...walk()].sort()].map((line) => pfx + line + '\n').join('');
@@ -208,8 +234,9 @@ function prettyPrintReplace(trie, pfx = '', indent = '  ') {
 exports.prettyPrintReplace = prettyPrintReplace;
 function prettyPrintSwap(trie, pfx = '', indent = '  ') {
     function* walk() {
-        for (const { a, b, c } of walkTrieTrieCost(trie)) {
-            yield indent + `(${a}) <-> (${b}) = ${c}`;
+        for (const { a, b, c, p } of walkTrieTrieCost(trie)) {
+            const pm = p ? ` + ${p}` : '';
+            yield indent + `(${a}) <-> (${b}) = ${c}${pm}`;
         }
     }
     return ['Swap:', ...[...walk()].sort()].map((line) => pfx + line + '\n').join('');

package/dist/lib/find.d.ts

@@ -1,4 +1,5 @@
 import { TrieNode } from './TrieNode';
+import type { PartialWithUndefined } from './types';
 /**
  * No compounding allowed.
  */

package/dist/lib/find.js

@@ -1,9 +1,9 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.__testing__ = exports.createFindOptions = exports.isForbiddenWord = exports.isEndOfWordNode = exports.findWordExact = exports.findCompoundNode = exports.findLegacyCompound = exports.findWordNode = exports.findWord = void 0;
-const TrieNode_1 = require("./TrieNode");
-const trie_util_1 = require("./trie-util");
 const constants_1 = require("./constants");
+const trie_util_1 = require("./trie-util");
+const TrieNode_1 = require("./TrieNode");
 const defaultLegacyMinCompoundLength = 3;
 const _defaultFindOptions = {
     matchCase: false,

package/dist/lib/index.d.ts

@@ -1,8 +1,10 @@
 export { consolidate } from './consolidate';
 export { createWeightedMap, editDistance, editDistanceWeighted } from './distance';
-export type { SuggestionCostMapDef, WeightMap } from './distance';
+export type { WeightMap } from './distance';
 export type { FindFullResult } from './find';
 export { ExportOptions, importTrie, serializeTrie } from './io/importExport';
+export { mapDictionaryInformationToWeightMap } from './mappers/mapDictionaryInfoToWeightMap';
+export type { SuggestionCostMapDef } from './models/suggestionCostsDef';
 export { parseDictionary, parseDictionaryLines } from './SimpleDictionaryParser';
 export { MaxCost, suggestionCollector, SuggestionCollector, SuggestionResult } from './suggestCollector';
 export { CASE_INSENSITIVE_PREFIX, COMPOUND, COMPOUND_FIX, defaultTrieOptions, FORBID, FORBID_PREFIX, NORMALIZED, OPTIONAL_COMPOUND, OPTIONAL_COMPOUND_FIX, Trie, } from './trie';

package/dist/lib/index.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.WORD_SEPARATOR = exports.walker = exports.JOIN_SEPARATOR = exports.hintedWalker = exports.CompoundWordsMethod = exports.FLAG_WORD = exports.ChildMap = exports.TrieBuilder = exports.buildTrieFast = exports.buildTrie = exports.walk = exports.trieNodeToRoot = exports.orderTrie = exports.normalizeWordToLowercase = exports.normalizeWordForCaseInsensitive = exports.normalizeWord = exports.mergeOptionalWithDefaults = exports.mergeDefaults = exports.iteratorTrieWords = exports.iterateTrie = exports.isWordTerminationNode = exports.isDefined = exports.isCircular = exports.insert = exports.has = exports.findNode = exports.createTriFromList = exports.createTrieRoot = exports.countWords = exports.countNodes = exports.Trie = exports.OPTIONAL_COMPOUND_FIX = exports.OPTIONAL_COMPOUND = exports.NORMALIZED = exports.FORBID_PREFIX = exports.FORBID = exports.defaultTrieOptions = exports.COMPOUND_FIX = exports.COMPOUND = exports.CASE_INSENSITIVE_PREFIX = exports.suggestionCollector = exports.parseDictionaryLines = exports.parseDictionary = exports.serializeTrie = exports.importTrie = exports.editDistanceWeighted = exports.editDistance = exports.createWeightedMap = exports.consolidate = void 0;
+exports.WORD_SEPARATOR = exports.walker = exports.JOIN_SEPARATOR = exports.hintedWalker = exports.CompoundWordsMethod = exports.FLAG_WORD = exports.ChildMap = exports.TrieBuilder = exports.buildTrieFast = exports.buildTrie = exports.walk = exports.trieNodeToRoot = exports.orderTrie = exports.normalizeWordToLowercase = exports.normalizeWordForCaseInsensitive = exports.normalizeWord = exports.mergeOptionalWithDefaults = exports.mergeDefaults = exports.iteratorTrieWords = exports.iterateTrie = exports.isWordTerminationNode = exports.isDefined = exports.isCircular = exports.insert = exports.has = exports.findNode = exports.createTriFromList = exports.createTrieRoot = exports.countWords = exports.countNodes = exports.Trie = exports.OPTIONAL_COMPOUND_FIX = exports.OPTIONAL_COMPOUND = exports.NORMALIZED = exports.FORBID_PREFIX = exports.FORBID = exports.defaultTrieOptions = exports.COMPOUND_FIX = exports.COMPOUND = exports.CASE_INSENSITIVE_PREFIX = exports.suggestionCollector = exports.parseDictionaryLines = exports.parseDictionary = exports.mapDictionaryInformationToWeightMap = exports.serializeTrie = exports.importTrie = exports.editDistanceWeighted = exports.editDistance = exports.createWeightedMap = exports.consolidate = void 0;
 var consolidate_1 = require("./consolidate");
 Object.defineProperty(exports, "consolidate", { enumerable: true, get: function () { return consolidate_1.consolidate; } });
 var distance_1 = require("./distance");
@@ -10,6 +10,8 @@ Object.defineProperty(exports, "editDistanceWeighted", { enumerable: true, get:
 var importExport_1 = require("./io/importExport");
 Object.defineProperty(exports, "importTrie", { enumerable: true, get: function () { return importExport_1.importTrie; } });
 Object.defineProperty(exports, "serializeTrie", { enumerable: true, get: function () { return importExport_1.serializeTrie; } });
+var mapDictionaryInfoToWeightMap_1 = require("./mappers/mapDictionaryInfoToWeightMap");
+Object.defineProperty(exports, "mapDictionaryInformationToWeightMap", { enumerable: true, get: function () { return mapDictionaryInfoToWeightMap_1.mapDictionaryInformationToWeightMap; } });
 var SimpleDictionaryParser_1 = require("./SimpleDictionaryParser");
 Object.defineProperty(exports, "parseDictionary", { enumerable: true, get: function () { return SimpleDictionaryParser_1.parseDictionary; } });
 Object.defineProperty(exports, "parseDictionaryLines", { enumerable: true, get: function () { return SimpleDictionaryParser_1.parseDictionaryLines; } });

package/dist/lib/mappers/mapCosts.d.ts

@@ -0,0 +1,6 @@
+import { HunspellCosts, EditCosts } from '../models/DictionaryInformation';
+export declare type EditCostsRequired = Required<EditCosts>;
+export declare type HunspellCostsRequired = Required<HunspellCosts>;
+export declare function mapHunspellCosts(costs?: HunspellCosts): HunspellCostsRequired;
+export declare function mapEditCosts(costs?: EditCosts): EditCostsRequired;
+//# sourceMappingURL=mapCosts.d.ts.map

package/dist/lib/mappers/mapCosts.js

@@ -0,0 +1,28 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mapEditCosts = exports.mapHunspellCosts = void 0;
+const util_1 = require("../utils/util");
+const defaultEditCosts = {
+    accentCosts: 1,
+    baseCost: 100,
+    capsCosts: 1,
+    firstLetterPenalty: 4,
+    nonAlphabetCosts: 110,
+};
+const defaultHunspellCosts = {
+    ...defaultEditCosts,
+    ioConvertCost: 30,
+    keyboardCost: 99,
+    mapCost: 25,
+    replaceCosts: 75,
+    tryCharCost: 100,
+};
+function mapHunspellCosts(costs = {}) {
+    return { ...defaultHunspellCosts, ...(0, util_1.cleanCopy)(costs) };
+}
+exports.mapHunspellCosts = mapHunspellCosts;
+function mapEditCosts(costs = {}) {
+    return { ...defaultEditCosts, ...(0, util_1.cleanCopy)(costs) };
+}
+exports.mapEditCosts = mapEditCosts;
+//# sourceMappingURL=mapCosts.js.map

package/dist/lib/mappers/mapDictionaryInfo.d.ts

@@ -0,0 +1,4 @@
+import type { DictionaryInformation } from '../models/DictionaryInformation';
+import type { SuggestionCostMapDef } from '../models/suggestionCostsDef';
+export declare function mapDictionaryInformation(dictInfo: DictionaryInformation): SuggestionCostMapDef[];
+//# sourceMappingURL=mapDictionaryInfo.d.ts.map