cspell-trie-lib 9.7.0 → 9.8.0

package/dist/index.js

@@ -10,7 +10,6 @@ function* iteratorToIterable(iterator) {
 		iterator.return?.();
 	}
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/append.js
 /**
@@ -25,7 +24,6 @@ function opAppendSync(...iterablesToAppend) {
 	}
 	return fnAppend;
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/combine.js
 function opCombineSync(...fns) {
@@ -35,7 +33,6 @@ function opCombineSync(...fns) {
 	}
 	return combine;
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/concatMap.js
 function opConcatMapSync(mapFn) {
@@ -64,7 +61,6 @@ function opConcatMapSync(mapFn) {
 	}
 	return fnConcatMapSync;
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/filter.js
 function opFilterSync(filterFn) {
@@ -87,7 +83,6 @@ function opFilterSync(filterFn) {
 	}
 	return opFilterIterable;
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/flatten.js
 function opFlattenSync() {
@@ -96,7 +91,6 @@ function opFlattenSync() {
 	}
 	return fn;
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/map.js
 function opMapSync(mapFn) {
@@ -117,7 +111,6 @@ function opMapSync(mapFn) {
 	}
 	return opMapIterable;
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/reduce.js
 function opReduceSync(reduceFn, initialValue) {
@@ -144,7 +137,6 @@ function headTail(iter) {
 		tail: iteratorToIterable(iterator)
 	};
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/operators/unique.js
 function opUniqueSync(k) {
@@ -170,19 +162,16 @@ function opUniqueSync(k) {
 	}
 	return k ? fnK(k) : fn;
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/pipe.js
 function pipeSync(i, ...fns) {
 	return opCombineSync(...fns)(i);
 }
-
 //#endregion
 //#region ../cspell-pipe/dist/reduce.js
 function reduceSync(iter, reduceFn, initialValue) {
 	return [...initialValue === void 0 ? pipeSync(iter, opReduceSync(reduceFn)) : pipeSync(iter, opReduceSync(reduceFn, initialValue))][0];
 }
-
 //#endregion
 //#region src/lib/utils/memorizeLastCall.ts
 const SymEmpty = Symbol("memorizeLastCall");
@@ -197,7 +186,6 @@ function memorizeLastCall(fn) {
 	}
 	return calc;
 }
-
 //#endregion
 //#region src/lib/ITrieNode/find.ts
 const defaultLegacyMinCompoundLength$2 = 3;
@@ -490,23 +478,18 @@ function _createFindOptions$1(options) {
 		compoundSeparator: options.compoundSeparator ?? d.compoundSeparator
 	};
 }
-
 //#endregion
 //#region src/lib/walker/walkerTypes.ts
 const JOIN_SEPARATOR = "+";
 const WORD_SEPARATOR = " ";
-const CompoundWordsMethodEnum = {
+const CompoundWordsMethod = {
 	NONE: 0,
 	SEPARATE_WORDS: 1,
-	JOIN_WORDS: 2
-};
-const CompoundWordsMethod = {
-	...CompoundWordsMethodEnum,
+	JOIN_WORDS: 2,
 	0: "NONE",
 	1: "SEPARATE_WORDS",
 	2: "JOIN_WORDS"
 };
-
 //#endregion
 //#region src/lib/ITrieNode/walker/walker.ts
 /**
@@ -517,8 +500,8 @@ function* compoundWalker$1(root, compoundingMethod) {
 	const empty = Object.freeze([]);
 	const roots = {
 		[CompoundWordsMethod.NONE]: empty,
-		[CompoundWordsMethod.JOIN_WORDS]: [[JOIN_SEPARATOR, root]],
-		[CompoundWordsMethod.SEPARATE_WORDS]: [[WORD_SEPARATOR, root]]
+		[CompoundWordsMethod.JOIN_WORDS]: [["+", root]],
+		[CompoundWordsMethod.SEPARATE_WORDS]: [[" ", root]]
 	};
 	const rc = roots[compoundingMethod].length ? roots[compoundingMethod] : void 0;
 	function children(n) {
@@ -657,7 +640,6 @@ function* walkerWordsITrie(root) {
 		depth -= 1;
 	}
 }
-
 //#endregion
 //#region src/lib/ITrieNode/trie-util.ts
 /**
@@ -687,20 +669,17 @@ function countWords$1(root) {
 	}
 	return walk(root);
 }
-
 //#endregion
 //#region src/lib/utils/debugger.ts
 let debuggerIsAttached = false;
 function isDebuggerAttached() {
 	return debuggerIsAttached;
 }
-
 //#endregion
 //#region src/lib/utils/isDefined.ts
 function isDefined(t) {
 	return t !== void 0;
 }
-
 //#endregion
 //#region src/lib/walker/hintedWalker.ts
 function hintedWalker(root, ignoreCase, hint, compoundingMethod, emitWordSeparator) {
@@ -730,8 +709,8 @@ function* hintedWalkerNext(root, ignoreCase, hint, compoundingMethod, emitWordSe
 	const rootsForCompoundMethods = [...roots, ...compoundRoots];
 	const compoundMethodRoots = {
 		[CompoundWordsMethod.NONE]: [],
-		[CompoundWordsMethod.JOIN_WORDS]: rootsForCompoundMethods.map((r) => [JOIN_SEPARATOR, r]),
-		[CompoundWordsMethod.SEPARATE_WORDS]: rootsForCompoundMethods.map((r) => [WORD_SEPARATOR, r])
+		[CompoundWordsMethod.JOIN_WORDS]: rootsForCompoundMethods.map((r) => ["+", r]),
+		[CompoundWordsMethod.SEPARATE_WORDS]: rootsForCompoundMethods.map((r) => [" ", r])
 	};
 	function* children(n, hintOffset) {
 		if (n.c) {
@@ -794,7 +773,6 @@ function existMap(values) {
 	for (const v of values) m[v] = true;
 	return m;
 }
-
 //#endregion
 //#region src/lib/TrieNode/trie.ts
 function trieRootToITrieRoot(root) {
@@ -918,7 +896,6 @@ var ImplITrieRoot = class extends ImplITrieNode {
 		return new this(node);
 	}
 };
-
 //#endregion
 //#region src/lib/walker/walker.ts
 /**
@@ -928,8 +905,8 @@ var ImplITrieRoot = class extends ImplITrieNode {
 function* compoundWalker(root, compoundingMethod) {
 	const roots = {
 		[CompoundWordsMethod.NONE]: [],
-		[CompoundWordsMethod.JOIN_WORDS]: [[JOIN_SEPARATOR, root]],
-		[CompoundWordsMethod.SEPARATE_WORDS]: [[WORD_SEPARATOR, root]]
+		[CompoundWordsMethod.JOIN_WORDS]: [["+", root]],
+		[CompoundWordsMethod.SEPARATE_WORDS]: [[" ", root]]
 	};
 	const rc = roots[compoundingMethod].length ? roots[compoundingMethod] : void 0;
 	const empty = [];
@@ -1070,16 +1047,10 @@ function* _walkerWords(root) {
 function walker(root, compoundingMethod = CompoundWordsMethod.NONE) {
 	return compoundingMethod === CompoundWordsMethod.NONE ? nodeWalker(root) : compoundWalker(root, compoundingMethod);
 }
-
-//#endregion
-//#region src/lib/suggestions/genSuggestionsOptions.ts
-const defaultGenSuggestionOptions = {
+const defaultSuggestionOptions = {
 	compoundMethod: CompoundWordsMethod.NONE,
 	ignoreCase: true,
-	changeLimit: 5
-};
-const defaultSuggestionOptions = {
-	...defaultGenSuggestionOptions,
+	changeLimit: 5,
 	numSuggestions: 8,
 	includeTies: true,
 	get timeout() {
@@ -1111,7 +1082,6 @@ function createSuggestionOptions(...opts) {
 function assign(dest, src, k) {
 	dest[k] = src[k] ?? dest[k];
 }
-
 //#endregion
 //#region src/lib/utils/PairingHeap.ts
 var PairingHeap = class {
@@ -1202,10 +1172,8 @@ function mergeSiblings(compare, n) {
 	const m = merge(compare, n, s);
 	return ss ? merge(compare, m, mergeSiblings(compare, ss)) : m;
 }
-
 //#endregion
 //#region src/lib/suggestions/constants.ts
-const DEFAULT_COMPOUNDED_WORD_SEPARATOR = "∙";
 const opCosts = {
 	baseCost: 100,
 	swapCost: 75,
@@ -1216,11 +1184,7 @@ const opCosts = {
 	wordBreak: 99,
 	wordLengthCostFactor: .5
 };
-
-//#endregion
-//#region src/lib/suggestions/orthography.ts
-const intl = new Intl.Collator("en", { sensitivity: "base" });
-const compare$2 = intl.compare;
+new Intl.Collator("en", { sensitivity: "base" }).compare;
 /**
 * This a set of letters that look like each other.
 * There can be a maximum of 30 groups.
@@ -1278,14 +1242,12 @@ function calcVisualLetterMasks(groups) {
 	}
 	return map;
 }
-
 //#endregion
 //#region src/lib/utils/assert.ts
 function assert(condition, message = "Assert Failed") {
 	if (condition) return;
 	throw new Error(message);
 }
-
 //#endregion
 //#region src/lib/distance/weightedMaps.ts
 const matchPossibleWordSeparators = /[+∙•・●]/g;
@@ -1501,9 +1463,8 @@ function normalizeDef(def) {
 	};
 }
 function normalizeMap(map) {
-	return map.replaceAll(matchPossibleWordSeparators, DEFAULT_COMPOUNDED_WORD_SEPARATOR);
+	return map.replaceAll(matchPossibleWordSeparators, "∙");
 }
-
 //#endregion
 //#region src/lib/distance/distanceAStarWeighted.ts
 /**
@@ -1643,7 +1604,6 @@ function idx(r, c, cols) {
 function compare$1(a, b) {
 	return a.c - b.c || b.ai + b.bi - a.ai - a.bi;
 }
-
 //#endregion
 //#region src/lib/distance/levenshtein.ts
 const initialRow = [...".".repeat(50)].map((_, i) => i);
@@ -1692,7 +1652,6 @@ function levenshteinDistance(a, b) {
 	}
 	return pRow[nA];
 }
-
 //#endregion
 //#region src/lib/distance/distance.ts
 const defaultCost = 100;
@@ -1726,14 +1685,12 @@ function editDistanceWeighted(wordA, wordB, weights, editCost = defaultCost) {
 function createWeightedMap(defs) {
 	return createWeightMap(...defs);
 }
-
 //#endregion
 //#region src/lib/utils/timer.ts
 function startTimer() {
 	const start = performance.now();
 	return () => performance.now() - start;
 }
-
 //#endregion
 //#region src/lib/utils/util.ts
 function isDefined$1(a) {
@@ -1777,7 +1734,6 @@ function replaceAllFactory(match, replaceWithText) {
 	const r = RegExp(regexQuote(match), "g");
 	return (text) => text.replace(r, replaceWithText);
 }
-
 //#endregion
 //#region src/lib/suggestions/suggestCollector.ts
 const defaultMaxNumberSuggestions = 10;
@@ -1785,7 +1741,7 @@ const BASE_COST = 100;
 const MAX_NUM_CHANGES = 5;
 const MAX_ALLOWED_COST_SCALE = 1.03 * .5;
 const collator = new Intl.Collator();
-const regexSeparator = new RegExp(`[${regexQuote(WORD_SEPARATOR)}]`, "g");
+const regexSeparator = new RegExp(`[${regexQuote(" ")}]`, "g");
 const wordLengthCost = [
 	0,
 	50,
@@ -1817,7 +1773,7 @@ function suggestionCollector(wordToMatch, options) {
 	const numSugToHold = weightMap ? numSuggestions * 2 : numSuggestions;
 	const sugs = /* @__PURE__ */ new Map();
 	let maxCost = BASE_COST * Math.min(wordToMatch.length * MAX_ALLOWED_COST_SCALE, changeLimit);
-	const useSeparator = compoundSeparator || (weightMap ? DEFAULT_COMPOUNDED_WORD_SEPARATOR : defaultSuggestionCollectorOptions.compoundSeparator);
+	const useSeparator = compoundSeparator || (weightMap ? "∙" : defaultSuggestionCollectorOptions.compoundSeparator);
 	const fnCleanWord = !useSeparator || useSeparator === compoundSeparator ? (w) => w : replaceAllFactory(useSeparator, "");
 	if (useSeparator && weightMap) addDefToWeightMap(weightMap, {
 		map: useSeparator,
@@ -1966,7 +1922,6 @@ function isSuggestionResult(s) {
 	const r = s;
 	return !!r && typeof r === "object" && r?.cost !== void 0 && r.word !== void 0;
 }
-
 //#endregion
 //#region src/lib/suggestions/suggestAStar.ts
 /**
@@ -2000,7 +1955,7 @@ function* getSuggestionsAStar(trie, srcWord, options = {}) {
 	const BC = opCosts.baseCost;
 	const VC = opCosts.visuallySimilar;
 	const DL = opCosts.duplicateLetterCost;
-	const wordSeparator = compoundMethod === CompoundWordsMethod.JOIN_WORDS ? JOIN_SEPARATOR : WORD_SEPARATOR;
+	const wordSeparator = compoundMethod === CompoundWordsMethod.JOIN_WORDS ? "+" : " ";
 	const sc = specialChars(trie.info);
 	const comp = trie.info.compoundCharacter;
 	const compRoot = root.get(comp);
@@ -2238,7 +2193,6 @@ function searchTrieCostNodesMatchingTrie2(trie, node, emit, s = "") {
 		if (t.n) searchTrieCostNodesMatchingTrie2(t, c, emit, pfx);
 	}
 }
-
 //#endregion
 //#region src/lib/ITrieNode/TrieInfo.ts
 const defaultTrieInfoSettings = {
@@ -2411,7 +2365,6 @@ function revTrieInfo(info) {
 	}
 	return rev;
 }
-
 //#endregion
 //#region src/lib/utils/endian.ts
 let cachedEndianness;
@@ -2421,7 +2374,6 @@ function endianness() {
 	cachedEndianness = new Uint8Array(uint32s.buffer)[0] === 10 ? "BE" : "LE";
 	return cachedEndianness;
 }
-
 //#endregion
 //#region src/lib/binary/binaryFormat.ts
 const isLittleEndian = endianness() === "LE";
@@ -3056,7 +3008,6 @@ function byteAlign(offset, alignment) {
 function isByteAlignment(value) {
 	return value === 1 || value === 2 || value === 4 || value === 8;
 }
-
 //#endregion
 //#region src/lib/GTrie/GTrie.ts
 var GTrieNode = class {
@@ -3143,7 +3094,6 @@ var GTrie = class GTrie {
 		return trie;
 	}
 };
-
 //#endregion
 //#region ../cspell-performance-monitor/dist/index.js
 const symbolCSpell = Symbol.for("cspell");
@@ -3178,7 +3128,6 @@ function makeDisposableFunction(fn) {
 function isEnabledPerformanceMeasurements() {
 	return !!globalThisCSpell[symbolCSpell]?.enablePerformanceMeasurements;
 }
-
 //#endregion
 //#region src/lib/StringTable/StringTable.ts
 /**
@@ -3397,7 +3346,6 @@ function toU32Array(data) {
 	if (data instanceof Uint32Array) return data;
 	return new Uint32Array(data);
 }
-
 //#endregion
 //#region src/lib/utils/text.ts
 /**
@@ -3517,7 +3465,6 @@ function toCharCodes(s) {
 	for (let i = 0; i < s.length; ++i) values.push(s.charCodeAt(i));
 	return values;
 }
-
 //#endregion
 //#region src/lib/TrieBlob/Utf8.ts
 /**
@@ -3681,7 +3628,6 @@ function encodeTextToUtf8(text) {
 	encodeTextToUtf8Into(text, into);
 	return into;
 }
-
 //#endregion
 //#region src/lib/TrieBlob/CharIndex.ts
 Object.freeze([0]);
@@ -3801,17 +3747,9 @@ function splitUtf8(utf8) {
 		utf8 & 255
 	].filter((v) => v);
 }
-
 //#endregion
 //#region src/lib/TrieBlob/TrieBlobFormat.ts
-const NodeHeaderNumChildrenShift = 0;
-const NodeHeaderEOWMask = 256;
 const NodeHeaderPrefixMask = 1073741312;
-const NodeHeaderPrefixShift = 9;
-const NodeHeaderNumChildrenMask = 255;
-const NodeMaskCharByte = 255;
-const NodeChildIndexRefShift = 8;
-
 //#endregion
 //#region src/lib/TrieBlob/optimizeNodes.ts
 const MAX_AUTO_ADD_TO_STRING_TABLE = 4;
@@ -3962,15 +3900,15 @@ function optimizeNodesWithStringTable(src) {
 		const node = nodes[nodeIdx];
 		if (node.length !== 2) return;
 		const header = node[0];
-		if ((header & NodeHeaderEOWMask) !== 0) return;
-		if (header & NodeHeaderPrefixMask) return;
+		if ((header & 256) !== 0) return;
+		if (header & 1073741312) return;
 		const childEntry = node[1];
-		const charByte = childEntry & NodeMaskCharByte;
+		const charByte = childEntry & 255;
 		const childIdx = childEntry >>> 8;
 		if (multipleNodeRefs.has(childIdx)) return;
 		const childNode = nodes[childIdx];
 		const childHeader = childNode[0];
-		const childPrefixIdx = (childHeader & NodeHeaderPrefixMask) >>> NodeHeaderPrefixShift;
+		const childPrefixIdx = (childHeader & NodeHeaderPrefixMask) >>> 9;
 		const childBytes = builder.getEntry(childPrefixIdx) || [];
 		if (!multiStringRefs.has(childPrefixIdx)) {
 			multiStringRefs.add(childPrefixIdx);
@@ -3979,7 +3917,7 @@ function optimizeNodesWithStringTable(src) {
 		const prefixBytes = [charByte, ...childBytes];
 		const prefixIdx = builder.addStringBytes(prefixBytes);
 		const newNode = Uint32Array.from(childNode);
-		newNode[0] = prefixIdx << NodeHeaderPrefixShift | childHeader & ~NodeHeaderPrefixMask;
+		newNode[0] = prefixIdx << 9 | childHeader & ~NodeHeaderPrefixMask;
 		nodes[nodeIdx] = newNode;
 	}
 }
@@ -4008,7 +3946,6 @@ function walkNodes(nodes, nodeIdx, options) {
 	}
 	walk(nodeIdx);
 }
-
 //#endregion
 //#region src/lib/TrieBlob/resolveMap.ts
 function resolveMap(map, key, resolve) {
@@ -4018,24 +3955,18 @@ function resolveMap(map, key, resolve) {
 	map.set(key, v);
 	return v;
 }
-
 //#endregion
 //#region src/lib/constants.ts
 const COMPOUND_FIX = "+";
 const OPTIONAL_COMPOUND_FIX = "*";
 const CASE_INSENSITIVE_PREFIX = "~";
 const FORBID_PREFIX = "!";
-const LINE_COMMENT = "#";
-const IDENTITY_PREFIX = "=";
-const SUGGESTION_PREFIX = ":";
-const SUGGESTIONS_DISABLED = " ";
 const defaultTrieInfo = Object.freeze({
-	compoundCharacter: COMPOUND_FIX,
-	forbiddenWordPrefix: FORBID_PREFIX,
-	stripCaseAndAccentsPrefix: CASE_INSENSITIVE_PREFIX,
-	suggestionPrefix: SUGGESTION_PREFIX
+	compoundCharacter: "+",
+	forbiddenWordPrefix: "!",
+	stripCaseAndAccentsPrefix: "~",
+	suggestionPrefix: ":"
 });
-
 //#endregion
 //#region src/lib/utils/mergeDefaults.ts
 /**
@@ -4052,13 +3983,11 @@ function mergeDefaults(value, defaultValue) {
 	}
 	return result;
 }
-
 //#endregion
 //#region src/lib/utils/mergeOptionalWithDefaults.ts
 function mergeOptionalWithDefaults(...options) {
 	return options.reduce((acc, opt) => mergeDefaults(opt, acc), defaultTrieInfo);
 }
-
 //#endregion
 //#region src/lib/TrieBlob/prefix.ts
 function matchEntirePrefix(text, prefix) {
@@ -4071,13 +4000,11 @@ function matchEntirePrefix(text, prefix) {
 	}
 	return true;
 }
-
 //#endregion
 //#region src/lib/utils/rawData.ts
 function toUint8Array(data) {
 	return data instanceof Uint8Array ? data : new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
 }
-
 //#endregion
 //#region src/lib/TrieBlob/TrieBlobEncoder.ts
 const headerSig = "TrieBlob";
@@ -4130,7 +4057,6 @@ function isBTrieData(data) {
 	for (let i = 0; i < 8; i++) if (buf[i] !== headerSig.codePointAt(i)) return false;
 	return true;
 }
-
 //#endregion
 //#region src/lib/TrieBlob/TrieBlobNodeRef.ts
 function trieBlobNodeRefToITrieNodeId(ref) {
@@ -4143,7 +4069,6 @@ function iTrieNodeIdToTrieBlobNodeRefParts(id) {
 		pfx: Number(id & 4294967295n)
 	};
 }
-
 //#endregion
 //#region src/lib/TrieBlob/TrieBlobIRoot.ts
 const EMPTY_KEYS = Object.freeze([]);
@@ -4266,7 +4191,6 @@ var TrieBlobIRoot = class extends TrieBlobINode {
 		return this.info.suggestionPrefix;
 	}
 };
-
 //#endregion
 //#region src/lib/TrieBlob/TypedArrayCursor.ts
 var TypedArrayCursor = class {
@@ -4296,7 +4220,6 @@ var TypedArrayCursor = class {
 function createUint8ArrayCursor(array, i = 0) {
 	return new TypedArrayCursor(array, i);
 }
-
 //#endregion
 //#region src/lib/TrieBlob/Utf8Cursor.ts
 var Utf8CursorImpl = class {
@@ -4327,7 +4250,6 @@ var Utf8CursorImpl = class {
 function createTextToUtf8Cursor(text, offset = 0) {
 	return new Utf8CursorImpl(text, offset);
 }
-
 //#endregion
 //#region src/lib/TrieBlob/TrieBlob.ts
 var TrieBlob = class TrieBlob {
@@ -4365,8 +4287,8 @@ var TrieBlob = class TrieBlob {
 		this.hasForbiddenWords = !!this.#forbidIdx;
 		this.hasCompoundWords = !!this.#compoundIdx;
 		this.hasNonStrictWords = !!this.#nonStrictIdx;
-		this.NodeMaskNumChildren = NodeHeaderNumChildrenMask;
-		this.NodeChildRefShift = NodeChildIndexRefShift;
+		this.NodeMaskNumChildren = 255;
+		this.NodeChildRefShift = 8;
 		this.hasPreferredSuggestions = !!this.#suggestIdx;
 	}
 	has(word) {
@@ -4454,7 +4376,7 @@ var TrieBlob = class TrieBlob {
 		if (!nodeRef) return void 0;
 		const _nodes = this.nodes;
 		const _nodes8 = this.#nodes8;
-		const pfxShift = NodeHeaderPrefixShift;
+		const pfxShift = 9;
 		let { nodeIdx, pfx, prefix } = nodeRef;
 		const t = createTextToUtf8Cursor(text);
 		for (; !t.done; t.next()) {
@@ -4512,11 +4434,11 @@ var TrieBlob = class TrieBlob {
 		for (const suffix of this.#walkWords(nodeIdx)) yield prefix + suffix;
 	}
 	*#walkWords(rootRef) {
-		const NodeMaskNumChildren = NodeHeaderNumChildrenMask;
-		const NodeMaskEOW = NodeHeaderEOWMask;
-		const NodeMaskChildCharIndex = NodeMaskCharByte;
-		const NodeChildRefShift = NodeChildIndexRefShift;
-		const nodeHeaderPrefixShift = NodeHeaderPrefixShift;
+		const NodeMaskNumChildren = 255;
+		const NodeMaskEOW = 256;
+		const NodeMaskChildCharIndex = 255;
+		const NodeChildRefShift = 8;
+		const nodeHeaderPrefixShift = 9;
 		const nodes = this.nodes;
 		const st = this.#stringTable;
 		const stack = [{
@@ -4562,7 +4484,7 @@ var TrieBlob = class TrieBlob {
 	}
 	get size() {
 		if (this.#size) return this.#size;
-		const NodeMaskNumChildren = NodeHeaderNumChildrenMask;
+		const NodeMaskNumChildren = 255;
 		const nodes = this.nodes;
 		let p = 0;
 		let count = 0;
@@ -4601,11 +4523,11 @@ var TrieBlob = class TrieBlob {
 	* @yields the depth in the stack. The stack will contain the current Reference.
 	*/
 	*#walk(stack, depth = 0) {
-		const MaskNumChildren = NodeHeaderNumChildrenMask;
-		const NodeRefShift = NodeChildIndexRefShift;
-		const CharMask = NodeMaskCharByte;
+		const MaskNumChildren = 255;
+		const NodeRefShift = 8;
+		const CharMask = 255;
 		const PrefixMask = NodeHeaderPrefixMask;
-		const PrefixShift = NodeHeaderPrefixShift;
+		const PrefixShift = 9;
 		const nodes = this.nodes;
 		stack[0] ||= {
 			nodeIdx: 0,
@@ -4674,7 +4596,7 @@ var TrieBlob = class TrieBlob {
 	hasChildren(ref) {
 		const node = this.nodes[ref.nodeIdx];
 		const pfxV = node & NodeHeaderPrefixMask;
-		const has = (node & NodeHeaderNumChildrenMask) !== 0;
+		const has = (node & 255) !== 0;
 		if (!pfxV) return has;
 		if (isRefPfx(ref)) return ref.prefix ? true : has;
 		ref = this.#cvtToRefPfx(ref);
@@ -4722,11 +4644,11 @@ var TrieBlob = class TrieBlob {
 	*/
 	isRefEOW(ref) {
 		if (ref.prefix && ref.pfx < ref.prefix.length) return false;
-		return !!(this.nodes[ref.nodeIdx] & NodeHeaderEOWMask);
+		return !!(this.nodes[ref.nodeIdx] & 256);
 	}
 	#getNodePrefix(nodeIdx, pfx) {
 		const pfxV = this.nodes[nodeIdx] & NodeHeaderPrefixMask;
-		const prefix = pfxV ? this.#stringTable.getStringBytes(pfxV >>> NodeHeaderPrefixShift) : void 0;
+		const prefix = pfxV ? this.#stringTable.getStringBytes(pfxV >>> 9) : void 0;
 		if (!prefix) return void 0;
 		if (pfx >= prefix.length) return void 0;
 		return prefix;
@@ -4748,13 +4670,13 @@ var TrieBlob = class TrieBlob {
 	}
 	getNodeDebugInfo(ref) {
 		const node = this.nodes[ref.nodeIdx];
-		const isEOW = !!(node & NodeHeaderEOWMask);
-		const count = node & NodeHeaderNumChildrenMask;
+		const isEOW = !!(node & 256);
+		const count = node & 255;
 		const children = /* @__PURE__ */ new Map();
 		for (let i = 1; i <= count; ++i) {
 			const entry = this.nodes[ref.nodeIdx + i];
-			const c = entry & NodeMaskCharByte;
-			const idx = entry >>> NodeChildIndexRefShift;
+			const c = entry & 255;
+			const idx = entry >>> 8;
 			children.set(charToHex(c), numberToHex(idx) + " " + idx);
 		}
 		return {
@@ -4772,12 +4694,12 @@ var TrieBlob = class TrieBlob {
 function nodesToJson(nodes) {
 	function nodeElement(offset) {
 		const node = nodes[offset];
-		const numChildren = node & NodeHeaderNumChildrenMask;
-		const eow = !!(node & NodeHeaderEOWMask);
+		const numChildren = node & 255;
+		const eow = !!(node & 256);
 		const children = [];
 		for (let i = 1; i <= numChildren; ++i) children.push({
-			c: ("00" + (nodes[offset + i] & NodeMaskCharByte).toString(16)).slice(-2),
-			o: nodes[offset + i] >>> NodeChildIndexRefShift
+			c: ("00" + (nodes[offset + i] & 255).toString(16)).slice(-2),
+			o: nodes[offset + i] >>> 8
 		});
 		return {
 			id: offset,
@@ -4800,8 +4722,8 @@ function nodesToJson(nodes) {
 * @param data
 */
 function trieBlobSort(data) {
-	const MaskNumChildren = NodeHeaderNumChildrenMask;
-	const MaskChildCharIndex = NodeMaskCharByte;
+	const MaskNumChildren = 255;
+	const MaskChildCharIndex = 255;
 	const limit = data.length;
 	let idx = 0;
 	let node = data[0];
@@ -4831,7 +4753,6 @@ function charToHex(c) {
 function isRefPfx(ref) {
 	return "prefix" in ref;
 }
-
 //#endregion
 //#region src/lib/TrieBlob/TrieBuilderUtils.ts
 /**
@@ -4875,8 +4796,8 @@ function isSorted(node, mask, start, end) {
 }
 function toTrieBlob(nodes, stringTable, info) {
 	const endPerf = measurePerf("TrieBlob.toTrieBlob");
-	const nodeMaskChildCharIndex = NodeMaskCharByte;
-	const nodeChildRefShift = NodeChildIndexRefShift;
+	const nodeMaskChildCharIndex = 255;
+	const nodeChildRefShift = 8;
 	function calcNodeToIndex(nodes) {
 		let offset = 0;
 		const idx = Array(nodes.length + 1);
@@ -4890,9 +4811,9 @@ function toTrieBlob(nodes, stringTable, info) {
 	const nodeToIndex = calcNodeToIndex(nodes);
 	const nodeElementCount = nodeToIndex[nodeToIndex.length - 1];
 	const binNodes = new Uint32Array(nodeElementCount);
-	const lenShift = NodeHeaderNumChildrenShift;
-	const refShift = NodeChildIndexRefShift;
-	const NodeHeaderMask = ~NodeHeaderNumChildrenMask;
+	const lenShift = 0;
+	const refShift = 8;
+	const NodeHeaderMask = -256;
 	let offset = 0;
 	for (let i = 0; i < nodes.length; ++i) {
 		const node = nodes[i];
@@ -4908,7 +4829,6 @@ function toTrieBlob(nodes, stringTable, info) {
 	endPerf();
 	return t;
 }
-
 //#endregion
 //#region src/lib/TrieBlob/TrieBlobBuilder.ts
 const AUTO_OPTIMIZE_NODE_COUNT = 0;
@@ -4922,7 +4842,7 @@ var TrieBlobBuilder = class TrieBlobBuilder {
 	wordToCharacters = (word) => [...word];
 	#infoBuilder;
 	constructor(options, characteristics) {
-		this.nodes = [[0], Object.freeze([NodeHeaderEOWMask])];
+		this.nodes = [[0], Object.freeze([256])];
 		this.IdxEOW = 1;
 		this.#infoBuilder = new TrieInfoBuilder(options, characteristics);
 	}
@@ -4951,9 +4871,9 @@ var TrieBlobBuilder = class TrieBlobBuilder {
 	}
 	createCursor(id) {
 		const endPerf = measurePerf("TrieBlobBuilder.cursor");
-		const nodeChildRefShift = NodeChildIndexRefShift;
-		const NodeMaskEOW = NodeHeaderEOWMask;
-		const LetterMask = NodeMaskCharByte;
+		const nodeChildRefShift = 8;
+		const NodeMaskEOW = 256;
+		const LetterMask = 255;
 		const refNodes = [0, 1];
 		const lookupCharCode = createCharUtf8_32RevLookup();
 		let disposed = false;
@@ -5083,9 +5003,9 @@ var TrieBlobBuilder = class TrieBlobBuilder {
 		word = word.trim();
 		if (!word) return this;
 		this.#infoBuilder.addWord(word);
-		const NodeMaskChildCharIndex = NodeMaskCharByte;
-		const nodeChildRefShift = NodeChildIndexRefShift;
-		const NodeMaskEOW = NodeHeaderEOWMask;
+		const NodeMaskChildCharIndex = 255;
+		const nodeChildRefShift = 8;
+		const NodeMaskEOW = 256;
 		const IdxEOW = this.IdxEOW;
 		const nodes = this.nodes;
 		let nodeIdx = 0;
@@ -5122,9 +5042,9 @@ var TrieBlobBuilder = class TrieBlobBuilder {
 		return this;
 	}
 	has(word) {
-		const NodeMaskChildCharIndex = NodeMaskCharByte;
-		const nodeChildRefShift = NodeChildIndexRefShift;
-		const NodeMaskEOW = NodeHeaderEOWMask;
+		const NodeMaskChildCharIndex = 255;
+		const nodeChildRefShift = 8;
+		const NodeMaskEOW = 256;
 		const nodes = this.nodes;
 		const charIndexes = this.wordToUtf8Seq(word);
 		const len = charIndexes.length;
@@ -5157,7 +5077,7 @@ var TrieBlobBuilder = class TrieBlobBuilder {
 		const { optimize, useStringTable } = buildOptions || {};
 		const info = this.#infoBuilder.build();
 		const bNodes = this.nodes;
-		let sortedNodes = sortNodes(bNodes, NodeMaskCharByte);
+		let sortedNodes = sortNodes(bNodes, 255);
 		if (optimize ?? sortNodes.length < AUTO_OPTIMIZE_NODE_COUNT) sortedNodes = optimizeNodes(sortedNodes);
 		const stringTable = new StringTableBuilder().build();
 		const r = useStringTable ? optimizeNodesWithStringTable({
@@ -5199,9 +5119,9 @@ var TrieBlobBuilder = class TrieBlobBuilder {
 	*/
 	static fromTrieRoot(root, buildOptions) {
 		const endPerf = measurePerf("TrieBlobBuilder.fromTrieRoot");
-		const NodeCharIndexMask = NodeMaskCharByte;
-		const nodeChildRefShift = NodeChildIndexRefShift;
-		const NodeMaskEOW = NodeHeaderEOWMask;
+		const NodeCharIndexMask = 255;
+		const nodeChildRefShift = 8;
+		const NodeMaskEOW = 256;
 		const tf = new TrieBlobBuilder(void 0, root);
 		const IdxEOW = tf.IdxEOW;
 		const known = new Map([[root, 0]]);
@@ -5259,9 +5179,9 @@ var TrieBlobBuilder = class TrieBlobBuilder {
 	*/
 	static fromITrieRoot(root, buildOptions) {
 		const endPerf = measurePerf("TrieBlobBuilder.fromITrieRoot");
-		const NodeCharIndexMask = NodeMaskCharByte;
-		const nodeChildRefShift = NodeChildIndexRefShift;
-		const NodeMaskEOW = NodeHeaderEOWMask;
+		const NodeCharIndexMask = 255;
+		const nodeChildRefShift = 8;
+		const NodeMaskEOW = 256;
 		const tf = new TrieBlobBuilder(void 0, root);
 		const IdxEOW = tf.IdxEOW;
 		const known = new Map([[root.id, 0]]);
@@ -5325,7 +5245,6 @@ function createCharUtf8_32RevLookup(maxSize = 256) {
 		return code;
 	};
 }
-
 //#endregion
 //#region src/lib/utils/clean.ts
 function clean(t) {
@@ -5333,7 +5252,6 @@ function clean(t) {
 	for (const key of Object.keys(copy)) if (copy[key] === void 0) delete copy[key];
 	return copy;
 }
-
 //#endregion
 //#region src/lib/ITrie.ts
 const defaultLegacyMinCompoundLength$1 = 3;
@@ -5563,7 +5481,6 @@ var ITrieImpl = class ITrieImpl {
 		return createFindOptions$1(options);
 	}
 };
-
 //#endregion
 //#region src/lib/buildITrie.ts
 function buildITrieFromWords(words, info = {}, buildOptions) {
@@ -5576,7 +5493,6 @@ function buildITrieFromWords(words, info = {}, buildOptions) {
 		endPerf();
 	}
 }
-
 //#endregion
 //#region src/lib/utils/isValidChar.ts
 function isValidChar(char) {
@@ -5588,11 +5504,9 @@ function assertIsValidChar(char, message) {
 function formatCharCodes(char) {
 	return char.split("").map((c) => "0x" + c.charCodeAt(0).toString(16).padStart(4, "0").toUpperCase()).join(":");
 }
-
 //#endregion
 //#region src/lib/TrieNode/TrieNode.ts
 const FLAG_WORD = 1;
-
 //#endregion
 //#region src/lib/TrieNode/trie-util.ts
 function insert(word, root = {}) {
@@ -5605,11 +5519,11 @@ function insert(word, root = {}) {
 		node = c[head] || {};
 		c[head] = node;
 	}
-	node.f = (node.f || 0) | FLAG_WORD;
+	node.f = (node.f || 0) | 1;
 	return root;
 }
 function isWordTerminationNode(node) {
-	return ((node.f || 0) & FLAG_WORD) === FLAG_WORD;
+	return ((node.f || 0) & 1) === 1;
 }
 /**
 * Sorts the nodes in a trie in place.
@@ -5649,7 +5563,7 @@ function has(node, word) {
 		h = t.slice(0, 1);
 		t = t.slice(1);
 	}
-	return !h.length && !!((node.f || 0) & FLAG_WORD);
+	return !h.length && !!((node.f || 0) & 1);
 }
 function findNode(node, word) {
 	for (let i = 0; i < word.length; ++i) {
@@ -5771,7 +5685,6 @@ var CTrieRoot = class CTrieRoot {
 		return root;
 	}
 };
-
 //#endregion
 //#region src/lib/consolidate.ts
 /**
@@ -5840,14 +5753,13 @@ function consolidate(root) {
 		return n;
 	}
 	const eow = findEow(root) || {
-		f: FLAG_WORD,
+		f: 1,
 		c: void 0
 	};
 	signatures.set(signature(eow), eow);
 	cached.set(eow, count++);
 	return trieNodeToRoot(process(root), root);
 }
-
 //#endregion
 //#region src/lib/TrieBlob/trieDataEncoder.ts
 function encodeITrieToBTrie(trie, buildOptions) {
@@ -5860,15 +5772,14 @@ function encodeTrieDataToBTrie(data, buildOptions) {
 function decodeBTrie(data) {
 	return TrieBlob.decodeBin(data);
 }
-
 //#endregion
 //#region src/lib/TrieNode/find.ts
 const _defaultFindOptions = {
 	matchCase: false,
 	compoundMode: "compound",
-	forbidPrefix: FORBID_PREFIX,
-	compoundFix: COMPOUND_FIX,
-	caseInsensitivePrefix: CASE_INSENSITIVE_PREFIX,
+	forbidPrefix: "!",
+	compoundFix: "+",
+	caseInsensitivePrefix: "~",
 	legacyMinCompoundLength: 3,
 	compoundSeparator: void 0
 };
@@ -6038,7 +5949,7 @@ function findWordExact(root, word) {
 	return isEndOfWordNode(walk$1(root, word));
 }
 function isEndOfWordNode(n) {
-	return n?.f === FLAG_WORD;
+	return n?.f === 1;
 }
 function walk$1(root, word) {
 	const w = [...word];
@@ -6126,7 +6037,6 @@ const createFindOptions = memorizeLastCall(_createFindOptions);
 function _createFindOptions(options) {
 	return mergeDefaults(options, _defaultFindOptions);
 }
-
 //#endregion
 //#region src/lib/TrieNode/TrieNodeTrie.ts
 var TrieNodeTrie = class TrieNodeTrie {
@@ -6182,13 +6092,11 @@ var TrieNodeTrie = class TrieNodeTrie {
 		return new TrieNodeTrie(consolidate(createTrieRootFromList(words, options)));
 	}
 };
-
 //#endregion
 //#region ../../node_modules/.pnpm/gensequence@8.0.8/node_modules/gensequence/dist/util/util.js
 function* toIterableIterator$2(i) {
 	yield* i;
 }
-
 //#endregion
 //#region ../../node_modules/.pnpm/gensequence@8.0.8/node_modules/gensequence/dist/operators/operatorsBase.js
 /**
@@ -6335,7 +6243,6 @@ function isIterable(i) {
 function isIterableIterator(i) {
 	return typeof i.next == "function";
 }
-
 //#endregion
 //#region ../../node_modules/.pnpm/gensequence@8.0.8/node_modules/gensequence/dist/operators/operators.js
 /**
@@ -6407,7 +6314,6 @@ function pipe(...fns) {
 		return i;
 	};
 }
-
 //#endregion
 //#region ../../node_modules/.pnpm/gensequence@8.0.8/node_modules/gensequence/dist/ImplSequence.js
 var ImplSequence = class ImplSequence {
@@ -6501,13 +6407,11 @@ var ImplSequence = class ImplSequence {
 		return toIterableIterator$2(this.iter);
 	}
 };
-
 //#endregion
 //#region ../../node_modules/.pnpm/gensequence@8.0.8/node_modules/gensequence/dist/GenSequence.js
 function genSequence(i) {
 	return new ImplSequence(i);
 }
-
 //#endregion
 //#region src/lib/convertToTrieRefNodes.ts
 const MinReferenceCount = 3;
@@ -6517,7 +6421,7 @@ const MinReferenceCount = 3;
 */
 function convertToTrieRefNodes(root) {
 	const eow = {
-		f: FLAG_WORD,
+		f: 1,
 		c: void 0
 	};
 	const tallies = new Map([[eow, 0]]);
@@ -6582,11 +6486,9 @@ function convertToTrieRefNodes(root) {
 	rollup(root);
 	return walk(root);
 }
-
 //#endregion
 //#region src/lib/io/importExportV1.ts
-const EOW$3 = "*";
-const DATA$4 = EOW$3;
+const EOW$2 = "*";
 function toReferences(node) {
 	return genSequence(convertToTrieRefNodes(node));
 }
@@ -6597,7 +6499,7 @@ function escapeChar(char) {
 }
 function trieToExportString(node, base) {
 	function* walk(node) {
-		if (node.f) yield EOW$3;
+		if (node.f) yield EOW$2;
 		if (node.r) {
 			const refs = [...node.r].sort((a, b) => a[0] < b[0] ? -1 : 1);
 			for (const n of refs) {
@@ -6656,7 +6558,7 @@ function importTrie$5(linesX) {
 			if (next.done) break;
 			const line = next.value.trim();
 			if (!line || comment.test(line)) continue;
-			if (line === DATA$4) break;
+			if (line === "*") break;
 			headerRows.push(line);
 		}
 		parseHeaderRows(headerRows);
@@ -6664,12 +6566,12 @@ function importTrie$5(linesX) {
 	const regNotEscapedCommas = /(^|[^\\]),/g;
 	const regUnescapeCommas = /__COMMA__/g;
 	const regUnescape = /[\\](.)/g;
-	const flagsWord = { f: FLAG_WORD };
+	const flagsWord = { f: 1 };
 	function splitLine(line) {
 		return line.replaceAll(regNotEscapedCommas, "$1__COMMA__").split(regUnescapeCommas).map((a) => a.replaceAll(regUnescape, "$1"));
 	}
 	function decodeLine(line, nodes) {
-		const isWord = line[0] === EOW$3;
+		const isWord = line[0] === EOW$2;
 		line = isWord ? line.slice(1) : line;
 		const flags = isWord ? flagsWord : {};
 		const children = splitLine(line).filter((a) => !!a).map((a) => [a[0], Number.parseInt(a.slice(1) || "0", radix)]).map(([k, i]) => [k, nodes[i]]);
@@ -6679,7 +6581,7 @@ function importTrie$5(linesX) {
 		};
 	}
 	readHeader(iter);
-	return trieNodeToRoot(genSequence([DATA$4]).concat(iter).map((a) => a.replace(/\r?\n/, "")).filter((a) => !!a).reduce((acc, line) => {
+	return trieNodeToRoot(genSequence(["*"]).concat(iter).map((a) => a.replace(/\r?\n/, "")).filter((a) => !!a).reduce((acc, line) => {
 		const { lines, nodes } = acc;
 		const root = decodeLine(line, nodes);
 		nodes[lines] = root;
@@ -6694,10 +6596,9 @@ function importTrie$5(linesX) {
 		root: {}
 	}).root, {});
 }
-
 //#endregion
 //#region src/lib/io/importExportV2.ts
-const EOW$2 = "*";
+const EOW$1 = "*";
 const DATA$3 = "__DATA__";
 function leaves(node) {
 	function toRefNode(node, k) {
@@ -6748,12 +6649,12 @@ function flattenToReferences(node) {
 	return genSequence(walk());
 }
 function signature(node) {
-	const flags = node.f ? EOW$2 : "";
+	const flags = node.f ? EOW$1 : "";
 	const refs = node.r ? node.r.sort((a, b) => a - b).join(",") : "";
 	return node.s + flags + refs;
 }
 function toLine(node, base) {
-	const flags = node.f ? EOW$2 : "";
+	const flags = node.f ? EOW$1 : "";
 	const refs = node.r ? node.r.sort((a, b) => a - b).map((r) => r.toString(base)).join(",") : "";
 	return node.s + flags + refs;
 }
@@ -6804,13 +6705,13 @@ function importTrie$4(linesX) {
 			if (next.done) break;
 			const line = next.value.trim();
 			if (!line || comment.test(line)) continue;
-			if (line === DATA$3) break;
+			if (line === "__DATA__") break;
 			headerRows.push(line);
 		}
 		parseHeaderRows(headerRows);
 	}
 	function parseLine(line, base) {
-		const isWord = line[1] === EOW$2;
+		const isWord = line[1] === EOW$1;
 		const refOffset = isWord ? 2 : 1;
 		const refs = line.slice(refOffset).split(",").filter((a) => !!a).map((r) => Number.parseInt(r, base));
 		return {
@@ -6819,7 +6720,7 @@ function importTrie$4(linesX) {
 			refs
 		};
 	}
-	const flagsWord = { f: FLAG_WORD };
+	const flagsWord = { f: 1 };
 	function decodeLine(line, nodes) {
 		const { letter, isWord, refs } = parseLine(line, radix);
 		const flags = isWord ? flagsWord : {};
@@ -6847,7 +6748,6 @@ function importTrie$4(linesX) {
 		}
 	}).root, {});
 }
-
 //#endregion
 //#region src/lib/utils/bufferLines.ts
 function* buffer(iter, bufferSize) {
@@ -6868,26 +6768,6 @@ function* bufferLines(iter, bufferSize, eol) {
 	if (eol) for (const s of buffer(iter, bufferSize)) yield s.join("") + eol;
 	else for (const s of buffer(iter, bufferSize)) yield s.join("");
 }
-
-//#endregion
-//#region src/lib/io/constants.ts
-/** End of word */
-const EOW$1 = "$";
-/** Move up the tree */
-const BACK = "<";
-/** End of Line (ignored) */
-const EOL = "\n";
-/** Line Feed (ignored) */
-const LF = "\r";
-/** Start of Absolute Reference */
-const REF = "#";
-/** Start indexed of Reference  */
-const REF_REL = "@";
-/** End of Reference */
-const EOR = ";";
-/** Escape the next character */
-const ESCAPE = "\\";
-
 //#endregion
 //#region src/lib/io/importExportV4.ts
 /**
@@ -6915,14 +6795,14 @@ const REF_INDEX_BEGIN = "[";
 const REF_INDEX_END = "]";
 const INLINE_DATA_COMMENT_LINE = "/";
 const specialCharacters$1 = stringToCharSet$2([
-	EOW$1,
-	BACK,
-	EOL,
-	REF,
-	REF_REL,
-	EOR,
-	ESCAPE,
-	LF,
+	"$",
+	"<",
+	"\n",
+	"#",
+	"@",
+	";",
+	"\\",
+	"\r",
 	REF_INDEX_BEGIN,
 	REF_INDEX_END,
 	INLINE_DATA_COMMENT_LINE,
@@ -6934,7 +6814,7 @@ const SPECIAL_CHARACTERS_MAP = [
 	["\r", "\\r"],
 	["\\", "\\\\"]
 ];
-const specialCharacterMap$2 = stringToCharMap(SPECIAL_CHARACTERS_MAP);
+const specialCharacterMap$1 = stringToCharMap(SPECIAL_CHARACTERS_MAP);
 const characterMap$1 = stringToCharMap(SPECIAL_CHARACTERS_MAP.map((a) => [a[1], a[0]]));
 const specialPrefix$1 = stringToCharSet$2("~!");
 const WORDS_PER_LINE$1 = 20;
@@ -6968,48 +6848,50 @@ function serializeTrie$2(root, options = 16) {
 	};
 	const wordChars = [];
 	function ref(n, idx) {
-		const r = idx === void 0 || n < idx ? REF + n.toString(radix) : REF_REL + idx.toString(radix);
+		const r = idx === void 0 || n < idx ? "#" + n.toString(radix) : "@" + idx.toString(radix);
 		return radix === 10 ? r : r + ";";
 	}
 	function escape(s) {
-		return s in specialCharacters$1 ? ESCAPE + (specialCharacterMap$2[s] || s) : s;
+		return s in specialCharacters$1 ? "\\" + (specialCharacterMap$1[s] || s) : s;
 	}
 	function* flush() {
 		while (backBuffer.count) {
 			const n = Math.min(9, backBuffer.count);
 			yield n > 1 ? backBuffer.last + n : backBuffer.last;
-			backBuffer.last = BACK;
+			backBuffer.last = "<";
 			backBuffer.count -= n;
 		}
 		if (backBuffer.eol) {
-			yield EOL;
+			yield "\n";
 			backBuffer.eol = false;
 			backBuffer.words = 0;
 		}
 	}
 	function* emit(s) {
 		switch (s) {
-			case EOW$1:
+			case "$":
 				yield* flush();
-				backBuffer.last = EOW$1;
+				backBuffer.last = "$";
 				backBuffer.count = 0;
 				backBuffer.words++;
 				break;
-			case BACK:
+			case "<":
 				backBuffer.count++;
 				break;
-			case EOL:
+			case "\n":
 				backBuffer.eol = true;
 				break;
 			default:
 				if (backBuffer.words >= WORDS_PER_LINE$1) backBuffer.eol = true;
 				yield* flush();
-				if (s.startsWith(REF) || s.startsWith(REF_REL)) backBuffer.words++;
+				if (s.startsWith("#") || s.startsWith("@")) backBuffer.words++;
 				yield s;
 		}
 	}
-	const comment_begin = `${EOL}${INLINE_DATA_COMMENT_LINE}* `;
-	const comment_end = ` *${INLINE_DATA_COMMENT_LINE}${EOL}`;
+	const comment_begin = `
+${INLINE_DATA_COMMENT_LINE}* `;
+	const comment_end = ` *${INLINE_DATA_COMMENT_LINE}
+`;
 	function* walk(node, depth) {
 		const nodeNumber = cache.get(node);
 		const refIndex = nodeToIndexMap.get(node);
@@ -7025,12 +6907,12 @@ function serializeTrie$2(root, options = 16) {
 				wordChars[depth] = s;
 				yield* emit(escape(s));
 				yield* walk(n, depth + 1);
-				yield* emit(BACK);
-				if (depth === 0) yield* emit(EOL);
+				yield* emit("<");
+				if (depth === 0) yield* emit("\n");
 			}
 		}
-		if (node.f) yield* emit(EOW$1);
-		if (depth === 2 || depth === 3 && wordChars[0] in specialPrefix$1) yield* emit(EOL);
+		if (node.f) yield* emit("$");
+		if (depth === 2 || depth === 3 && wordChars[0] in specialPrefix$1) yield* emit("\n");
 	}
 	function* serialize(node) {
 		yield* walk(node, 0);
@@ -7086,7 +6968,7 @@ function importTrie$3(linesX) {
 		for (const value of iter) {
 			const line = value.trim();
 			if (!line || comment.test(line)) continue;
-			if (line === DATA$2) break;
+			if (line === "__DATA__") break;
 			headerRows.push(line);
 		}
 		parseHeaderRows(headerRows);
@@ -7100,10 +6982,10 @@ function parseStream$1(radix, iter) {
 	let refIndex = [];
 	const root = trieNodeToRoot({}, {});
 	function parseReference(acc, s) {
-		const isIndexRef = s === REF_REL;
+		const isIndexRef = s === "@";
 		let ref = "";
 		function parser(acc, s) {
-			if (s === EOR || radix === 10 && !(s in numbersSet)) {
+			if (s === ";" || radix === 10 && !(s in numbersSet)) {
 				const { root, nodes, stack } = acc;
 				const r = Number.parseInt(ref, radix);
 				const top = stack[stack.length - 1];
@@ -7116,7 +6998,7 @@ function parseStream$1(radix, iter) {
 					stack,
 					parser: void 0
 				};
-				return s === EOR ? rr : parserMain(rr, s);
+				return s === ";" ? rr : parserMain(rr, s);
 			}
 			ref = ref + s;
 			return acc;
@@ -7139,7 +7021,7 @@ function parseStream$1(radix, iter) {
 					parser: void 0
 				}, s);
 			}
-			if (s === ESCAPE) {
+			if (s === "\\") {
 				prev = s;
 				return acc;
 			}
@@ -7161,7 +7043,7 @@ function parseStream$1(radix, iter) {
 				isEscaped = false;
 				return acc;
 			}
-			if (s === ESCAPE) {
+			if (s === "\\") {
 				isEscaped = true;
 				return acc;
 			}
@@ -7205,7 +7087,7 @@ function parseStream$1(radix, iter) {
 		const { root, nodes, stack } = acc;
 		const top = stack[stack.length - 1];
 		const node = top.node;
-		node.f = FLAG_WORD;
+		node.f = 1;
 		if (!node.c) {
 			top.node = eow;
 			const p = stack[stack.length - 2].node;
@@ -7220,13 +7102,13 @@ function parseStream$1(radix, iter) {
 			parser
 		};
 	}
-	const charactersBack = stringToCharSet$2(BACK + "23456789");
+	const charactersBack = stringToCharSet$2("<23456789");
 	function parseBack(acc, s) {
 		if (!(s in charactersBack)) return parserMain({
 			...acc,
 			parser: void 0
 		}, s);
-		let n = s === BACK ? 1 : Number.parseInt(s, 10) - 1;
+		let n = s === "<" ? 1 : Number.parseInt(s, 10) - 1;
 		const { stack } = acc;
 		while (n-- > 0) stack.pop();
 		return {
@@ -7238,13 +7120,13 @@ function parseStream$1(radix, iter) {
 		return acc;
 	}
 	const parsers = createStringLookupMap([
-		[EOW$1, parseEOW],
-		[BACK, parseBack],
-		[REF, parseReference],
-		[REF_REL, parseReference],
-		[ESCAPE, parseEscapeCharacter],
-		[EOL, parseIgnore],
-		[LF, parseIgnore],
+		["$", parseEOW],
+		["<", parseBack],
+		["#", parseReference],
+		["@", parseReference],
+		["\\", parseEscapeCharacter],
+		["\n", parseIgnore],
+		["\r", parseIgnore],
 		[INLINE_DATA_COMMENT_LINE, parseComment]
 	]);
 	function parserMain(acc, s) {
@@ -7329,7 +7211,6 @@ function tapIterable(iterable) {
 	}
 	return { [Symbol.iterator]: iterableFn };
 }
-
 //#endregion
 //#region src/lib/TrieNode/TrieNodeBuilder.ts
 const EOW = Object.freeze({
@@ -7429,15 +7310,13 @@ var TrieNodeBuilder = class {
 		if (this.shouldSort) this.sortChildren(this.root);
 	}
 };
-
 //#endregion
 //#region src/lib/io/importV3.ts
-const specialCharacterMap$1 = new Map([
+const characterMap = new Map([...new Map([
 	["\n", "\\n"],
 	["\r", "\\r"],
 	["\\", "\\\\"]
-]);
-const characterMap = new Map([...specialCharacterMap$1].map((a) => [a[1], a[0]]));
+])].map((a) => [a[1], a[0]]));
 const DATA$1 = "__DATA__";
 function importTrieV3AsTrieRoot(srcLines) {
 	return importTrieV3WithBuilder(new TrieNodeBuilder(), srcLines);
@@ -7489,7 +7368,7 @@ function parseStream(radix) {
 	function parseReference(acc, _) {
 		let ref = "";
 		function parser(acc, s) {
-			if (s === EOR) {
+			if (s === ";") {
 				const { cursor } = acc;
 				const r = Number.parseInt(ref, radix);
 				cursor.reference(r + 1);
@@ -7510,7 +7389,7 @@ function parseStream(radix) {
 				acc.parser = void 0;
 				return parseCharacter(acc, s);
 			}
-			if (s === ESCAPE) {
+			if (s === "\\") {
 				prev = s;
 				return acc;
 			}
@@ -7531,13 +7410,13 @@ function parseStream(radix) {
 		acc.cursor.backStep(1);
 		return acc;
 	}
-	const charactersBack = stringToCharSet$1(BACK + "23456789");
+	const charactersBack = stringToCharSet$1("<23456789");
 	function parseBack(acc, s) {
 		if (!(s in charactersBack)) {
 			acc.parser = void 0;
 			return parserMain(acc, s);
 		}
-		const n = s === BACK ? 1 : Number.parseInt(s, 10) - 1;
+		const n = s === "<" ? 1 : Number.parseInt(s, 10) - 1;
 		acc.cursor.backStep(n);
 		acc.parser = parseBack;
 		return acc;
@@ -7546,12 +7425,12 @@ function parseStream(radix) {
 		return acc;
 	}
 	const parsers = new Map([
-		[EOW$1, parseEOW],
-		[BACK, parseBack],
-		[REF, parseReference],
-		[ESCAPE, parseEscapeCharacter],
-		[EOL, parseIgnore],
-		[LF, parseIgnore]
+		["$", parseEOW],
+		["<", parseBack],
+		["#", parseReference],
+		["\\", parseEscapeCharacter],
+		["\n", parseIgnore],
+		["\r", parseIgnore]
 	]);
 	function parserMain(acc, s) {
 		return (acc.parser ?? parsers.get(s) ?? parseCharacter)(acc, s);
@@ -7564,13 +7443,11 @@ function stringToCharSet$1(values) {
 	for (let i = 0; i < len; ++i) set[values[i]] = true;
 	return set;
 }
-
 //#endregion
 //#region src/lib/io/importV3FastBlob.ts
 function importTrieV3AsTrieBlob(srcLines) {
 	return importTrieV3WithBuilder(new TrieBlobBuilder(), srcLines);
 }
-
 //#endregion
 //#region src/lib/io/decode.ts
 function decodeTrieData(raw) {
@@ -7604,7 +7481,7 @@ function importTrie$2(input) {
 		for (const entry of iter) {
 			const line = entry.trim();
 			headerRows.push(line);
-			if (line === DATA$4 || line === DATA$3) break;
+			if (line === "*" || line === "__DATA__") break;
 		}
 		return headerRows;
 	}
@@ -7613,7 +7490,6 @@ function importTrie$2(input) {
 	if (!method) throw new Error(`Unsupported version: ${version}`);
 	return method(lines);
 }
-
 //#endregion
 //#region src/lib/suggestions/suggest.ts
 const baseCost = opCosts.baseCost;
@@ -7622,7 +7498,7 @@ const insertSpaceCost = -1;
 const mapSubCost = opCosts.visuallySimilar;
 const maxCostScale = opCosts.wordLengthCostFactor;
 const discourageInsertCost = baseCost;
-const setOfSeparators = new Set([JOIN_SEPARATOR, WORD_SEPARATOR]);
+const setOfSeparators = new Set(["+", " "]);
 function suggest(root, word, options = {}) {
 	const opts = createSuggestionOptions(options);
 	const collector = suggestionCollector(word, clean(opts));
@@ -7647,8 +7523,8 @@ function* genCompoundableSuggestions(root, word, options = {}) {
 	const x = " " + word;
 	const mx = x.length - 1;
 	const specialInsCosts = Object.assign(Object.create(null), {
-		[WORD_SEPARATOR]: insertSpaceCost,
-		[JOIN_SEPARATOR]: insertSpaceCost
+		[" "]: insertSpaceCost,
+		["+"]: insertSpaceCost
 	});
 	const specialSubCosts = Object.assign(Object.create(null), { "-": discourageInsertCost });
 	let stopNow = false;
@@ -7765,7 +7641,6 @@ function* genCompoundableSuggestions(root, word, options = {}) {
 		goDeeper = min <= costLimit;
 	}
 }
-
 //#endregion
 //#region src/lib/trie.ts
 const defaultLegacyMinCompoundLength = 3;
@@ -7967,7 +7842,6 @@ var Trie = class Trie {
 		return findOptions;
 	}
 };
-
 //#endregion
 //#region src/lib/utils/secondChanceCache.ts
 var SecondChanceCache = class {
@@ -8022,7 +7896,6 @@ var SecondChanceCache = class {
 		return [...this.map1, ...this.map0];
 	}
 };
-
 //#endregion
 //#region src/lib/TrieBuilder.ts
 /**
@@ -8280,7 +8153,6 @@ function assertFrozen(n) {
 	if (!("id" in n)) console.warn("%o", n);
 	if (!Object.isFrozen(n) || !("id" in n)) throw new Error("Must be TrieNodeExFrozen");
 }
-
 //#endregion
 //#region src/lib/utils/normalizeWord.ts
 /**
@@ -8305,17 +8177,16 @@ const normalizeWordForCaseInsensitive = (text) => {
 	const t = text.toLowerCase();
 	return [t, t.normalize("NFD").replaceAll(/\p{M}/gu, "")];
 };
-
 //#endregion
 //#region src/lib/SimpleDictionaryParser.ts
 const BATCH_SIZE = 0;
 const _defaultOptions = {
-	commentCharacter: LINE_COMMENT,
-	optionalCompoundCharacter: OPTIONAL_COMPOUND_FIX,
-	compoundCharacter: COMPOUND_FIX,
-	forbiddenPrefix: FORBID_PREFIX,
-	caseInsensitivePrefix: CASE_INSENSITIVE_PREFIX,
-	keepExactPrefix: IDENTITY_PREFIX,
+	commentCharacter: "#",
+	optionalCompoundCharacter: "*",
+	compoundCharacter: "+",
+	forbiddenPrefix: "!",
+	caseInsensitivePrefix: "~",
+	keepExactPrefix: "=",
 	stripCaseAndAccents: true,
 	stripCaseAndAccentsKeepDuplicate: false,
 	stripCaseAndAccentsOnForbidden: false,
@@ -8323,11 +8194,11 @@ const _defaultOptions = {
 	splitKeepBoth: false,
 	splitSeparator: /[\s,;]/g,
 	keepOptionalCompoundCharacter: false,
-	suggestionPrefix: SUGGESTION_PREFIX,
+	suggestionPrefix: ":",
 	disableSuggestionHandling: false,
 	makeWordsForbidden: false
 };
-const defaultParseDictionaryOptions = Object.freeze(_defaultOptions);
+Object.freeze(_defaultOptions);
 const cSpellToolDirective = "cspell-dictionary:";
 /**
 * Normalizes a dictionary words based upon prefix / suffixes.
@@ -8345,7 +8216,7 @@ function createDictionaryLineParserMapper(options) {
 		"	",
 		"\0"
 	].includes(suggestionPrefix);
-	if (disableSuggestionHandling) suggestionPrefix = SUGGESTIONS_DISABLED;
+	if (disableSuggestionHandling) suggestionPrefix = " ";
 	function isString(line) {
 		return typeof line === "string";
 	}
@@ -8548,8 +8419,8 @@ function parseDictionary(text, options) {
 }
 function trieInfoFromOptions(options) {
 	const info = extractTrieInfo(options);
-	const sugPrefix = info.suggestionPrefix ?? SUGGESTION_PREFIX;
-	if (options?.disableSuggestionHandling || sugPrefix !== SUGGESTION_PREFIX) info.suggestionPrefix = SUGGESTIONS_DISABLED;
+	const sugPrefix = info.suggestionPrefix ?? ":";
+	if (options?.disableSuggestionHandling || sugPrefix !== ":") info.suggestionPrefix = " ";
 	return info;
 }
 function mergeOptions(base, ...partials) {
@@ -8591,7 +8462,6 @@ function createBatchAndSortLines(batchSize = BATCH_SIZE) {
 	}
 	return batchAndSortLines;
 }
-
 //#endregion
 //#region src/lib/utils/decompress.ts
 async function decompress(data, method = "gzip") {
@@ -8620,7 +8490,6 @@ async function decompress(data, method = "gzip") {
 		writer.releaseLock();
 	}
 }
-
 //#endregion
 //#region src/lib/decodeTrie.ts
 function decodeTrie(raw) {
@@ -8649,17 +8518,16 @@ async function convertToBTrie(file, options) {
 		content: bTrieData
 	};
 }
-
 //#endregion
 //#region src/lib/io/importExportV3.ts
 const specialCharacters = stringToCharSet([
-	EOW$1,
-	BACK,
-	EOL,
-	REF,
-	EOR,
-	ESCAPE,
-	LF,
+	"$",
+	"<",
+	"\n",
+	"#",
+	";",
+	"\\",
+	"\r",
 	"0123456789",
 	"`~!@#$%^&*()_-+=[]{};:'\"<>,./?\\|"
 ].join(""));
@@ -8706,39 +8574,39 @@ function serializeTrie$1(root, options = 16) {
 		return "#" + n.toString(radix) + ";";
 	}
 	function escape(s) {
-		return s in specialCharacters ? ESCAPE + (specialCharacterMap.get(s) || s) : s;
+		return s in specialCharacters ? "\\" + (specialCharacterMap.get(s) || s) : s;
 	}
 	function* flush() {
 		while (backBuffer.count) {
 			const n = Math.min(9, backBuffer.count);
 			yield n > 1 ? backBuffer.last + n : backBuffer.last;
-			backBuffer.last = BACK;
+			backBuffer.last = "<";
 			backBuffer.count -= n;
 		}
 		if (backBuffer.eol) {
-			yield EOL;
+			yield "\n";
 			backBuffer.eol = false;
 			backBuffer.words = 0;
 		}
 	}
 	function* emit(s) {
 		switch (s) {
-			case EOW$1:
+			case "$":
 				yield* flush();
-				backBuffer.last = EOW$1;
+				backBuffer.last = "$";
 				backBuffer.count = 0;
 				backBuffer.words++;
 				break;
-			case BACK:
+			case "<":
 				backBuffer.count++;
 				break;
-			case EOL:
+			case "\n":
 				backBuffer.eol = true;
 				break;
 			default:
 				if (backBuffer.words >= WORDS_PER_LINE) backBuffer.eol = true;
 				yield* flush();
-				if (s.startsWith(REF)) backBuffer.words++;
+				if (s.startsWith("#")) backBuffer.words++;
 				yield s;
 		}
 	}
@@ -8749,19 +8617,19 @@ function serializeTrie$1(root, options = 16) {
 			return;
 		}
 		if (node.c) {
-			if (addBreaks && depth > 0 && depth <= 2) yield* emit(EOL);
+			if (addBreaks && depth > 0 && depth <= 2) yield* emit("\n");
 			cache.set(node, count++);
 			const c = Object.entries(node.c).sort((a, b) => a[0] < b[0] ? -1 : 1);
 			for (const [s, n] of c) {
 				wordChars[depth] = s;
 				yield* emit(escape(s));
 				yield* walk(n, depth + 1);
-				yield* emit(BACK);
-				if (depth === 0) yield* emit(EOL);
+				yield* emit("<");
+				if (depth === 0) yield* emit("\n");
 			}
 		}
-		if (node.f) yield* emit(EOW$1);
-		if (addBreaks && (depth === 2 || depth === 3 && wordChars[0] in specialPrefix)) yield* emit(EOL);
+		if (node.f) yield* emit("$");
+		if (addBreaks && (depth === 2 || depth === 3 && wordChars[0] in specialPrefix)) yield* emit("\n");
 	}
 	function* serialize(node) {
 		yield* walk(node, 0);
@@ -8792,7 +8660,6 @@ function stringToCharSet(values) {
 	for (let i = 0; i < len; ++i) set[values[i]] = true;
 	return set;
 }
-
 //#endregion
 //#region src/lib/io/importExport.ts
 const serializers = [
@@ -8837,7 +8704,7 @@ function importTrie(input) {
 		for (const entry of iter) {
 			const line = entry.trim();
 			headerRows.push(line);
-			if (line === DATA$4 || line === DATA$3) break;
+			if (line === "*" || line === "__DATA__") break;
 		}
 		return headerRows;
 	}
@@ -8846,7 +8713,6 @@ function importTrie(input) {
 	if (!method) throw new Error(`Unsupported version: ${version}`);
 	return method(lines);
 }
-
 //#endregion
 //#region src/lib/models/locale/knownLocales.ts
 const codes = [
@@ -10945,7 +10811,6 @@ const codes = [
 		"South Africa"
 	]
 ];
-
 //#endregion
 //#region src/lib/models/locale/locale.ts
 let codesByLocale;
@@ -11008,7 +10873,6 @@ function parseLocale(locales) {
 	locales = typeof locales === "string" ? locales.split(",") : locales;
 	return locales.map(createLocale);
 }
-
 //#endregion
 //#region src/lib/mappers/mapCosts.ts
 const defaultEditCosts = {
@@ -11038,7 +10902,6 @@ function mapEditCosts(costs = {}) {
 		...cleanCopy(costs)
 	};
 }
-
 //#endregion
 //#region src/lib/mappers/joinLetters.ts
 /**
@@ -11050,7 +10913,6 @@ function mapEditCosts(costs = {}) {
 function joinLetters(letters) {
 	return [...letters].map((a) => a.length > 1 || !a.length ? `(${a})` : a).join("");
 }
-
 //#endregion
 //#region src/lib/mappers/mapToSuggestionCostDef.ts
 function parseAlphabet(cs, locale, editCost) {
@@ -11139,7 +11001,6 @@ function* splitMap(map) {
 		yield char;
 	}
 }
-
 //#endregion
 //#region src/lib/mappers/mapHunspellInformation.ts
 function hunspellInformationToSuggestionCostDef(hunInfo, locales) {
@@ -11286,7 +11147,6 @@ function reducer(fn, initialVal) {
 function asArrayOf(v) {
 	return Array.isArray(v) ? v : [v];
 }
-
 //#endregion
 //#region src/lib/mappers/mapDictionaryInfo.ts
 function mapDictionaryInformation(dictInfo) {
@@ -11332,7 +11192,6 @@ function mapAdjustment(adj) {
 		penalty
 	};
 }
-
 //#endregion
 //#region src/lib/mappers/mapDictionaryInfoToWeightMap.ts
 const defaultDefs = [{
@@ -11364,7 +11223,7 @@ function mapDictionaryInformationToWeightMap(dictInfo) {
 	addAdjustment(map, ...defaultAdjustments, ...adjustments);
 	return map;
 }
-
 //#endregion
 export { CASE_INSENSITIVE_PREFIX, COMPOUND_FIX, CompoundWordsMethod, FLAG_WORD, FORBID_PREFIX, GTrie, GTrieNode, JOIN_SEPARATOR, OPTIONAL_COMPOUND_FIX, Trie, TrieBuilder, WORD_SEPARATOR, buildITrieFromWords, buildTrie, buildTrieFast, consolidate, convertToBTrie, countNodes, countWords, createDictionaryLineParserMapper as createDictionaryLineParser, createTrieRoot, createTrieRootFromList, createWeightedMap, decodeFile, decodeTrie, defaultTrieInfo, defaultTrieInfo as defaultTrieOptions, editDistance, editDistanceWeighted, encodeITrieToBTrie, encodeTrieDataToBTrie, expandCharacterSet, findNode, has, hintedWalker, impersonateCollector, importTrie, insert, isCircular, isDefined, isWordTerminationNode, iterateTrie, iteratorTrieWords, mapDictionaryInformationToWeightMap, mergeDefaults, mergeOptionalWithDefaults, normalizeWord, normalizeWordForCaseInsensitive, normalizeWordToLowercase, orderTrie, parseDictionary, parseDictionaryLegacy, parseDictionaryLines, serializeTrie, suggestionCollector, trieNodeToRoot, walk, walker };
+
 //# sourceMappingURL=index.js.map