data-structure-typed 2.6.1 → 2.6.2

package/docs-site-docusaurus/docs/api/classes/Trie.md

@@ -6,7 +6,7 @@
 
 # Class: Trie\<R\>
 
-Defined in: [data-structures/trie/trie.ts:216](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L216)
+Defined in: [data-structures/trie/trie.ts:208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L208)
 
 Prefix tree (Trie) for fast prefix queries and word storage.
 
@@ -156,7 +156,7 @@ Time O(1), Space O(1)
 new Trie<R>(words?, options?): Trie<R>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L225)
+Defined in: [data-structures/trie/trie.ts:216](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L216)
 
 Create a Trie and optionally bulk-insert words.
 
@@ -198,7 +198,7 @@ Time O(totalChars), Space O(totalChars)
 get caseSensitive(): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:256](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L256)
+Defined in: [data-structures/trie/trie.ts:245](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L245)
 
 Get whether comparisons are case-sensitive.
 
@@ -222,7 +222,7 @@ True if case-sensitive.
 get root(): TrieNode;
 ```
 
-Defined in: [data-structures/trie/trie.ts:268](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L268)
+Defined in: [data-structures/trie/trie.ts:256](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L256)
 
 Get the root node.
 
@@ -246,7 +246,7 @@ Root TrieNode.
 get size(): number;
 ```
 
-Defined in: [data-structures/trie/trie.ts:244](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L244)
+Defined in: [data-structures/trie/trie.ts:234](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L234)
 
 Get the number of stored words.
 
@@ -330,7 +330,7 @@ Producing the iterator is O(1); consuming the entire iterator is Time O(n) with
 add(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:346](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L346)
+Defined in: [data-structures/trie/trie.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L290)
 
 Insert one word into the trie.
 
@@ -348,8 +348,6 @@ Word to insert.
 
 True if the word was newly added.
 
- *
-
 #### Remarks
 
 Time O(L), Space O(L)
@@ -381,7 +379,7 @@ Time O(L), Space O(L)
 addMany(words): boolean[];
 ```
 
-Defined in: [data-structures/trie/trie.ts:419](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L419)
+Defined in: [data-structures/trie/trie.ts:323](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L323)
 
 Insert many words from an iterable.
 
@@ -399,8 +397,6 @@ Iterable of strings (or raw records if toElementFn is provided).
 
 Array of per-word 'added' flags.
 
- *
-
 #### Remarks
 
 Time O(ΣL), Space O(ΣL)
@@ -424,7 +420,7 @@ Time O(ΣL), Space O(ΣL)
 clear(): void;
 ```
 
-Defined in: [data-structures/trie/trie.ts:603](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L603)
+Defined in: [data-structures/trie/trie.ts:384](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L384)
 
 Remove all words and reset to a fresh root.
 
@@ -434,8 +430,6 @@ Remove all words and reset to a fresh root.
 
 void
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -461,7 +455,7 @@ Time O(1), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1055](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1055)
+Defined in: [data-structures/trie/trie.ts:615](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L615)
 
 Deep clone this trie by iterating and inserting all words.
 
@@ -471,8 +465,6 @@ Deep clone this trie by iterating and inserting all words.
 
 A new trie with the same words and options.
 
- *
-
 #### Remarks
 
 Time O(ΣL), Space O(ΣL)
@@ -499,7 +491,7 @@ Time O(ΣL), Space O(ΣL)
 delete(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:674](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L674)
+Defined in: [data-structures/trie/trie.ts:412](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L412)
 
 Delete one word if present.
 
@@ -517,8 +509,6 @@ Word to delete.
 
 True if a word was removed.
 
- *
-
 #### Remarks
 
 Time O(L), Space O(1)
@@ -552,7 +542,7 @@ Time O(L), Space O(1)
 entries(): IterableIterator<[number, string]>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L208)
+Defined in: [data-structures/base/iterable-element-base.ts:207](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L207)
 
 Return an iterator of `[index, value]` pairs (Array-compatible).
 
@@ -616,7 +606,7 @@ Time O(n) in the worst case; may exit early when the first failure is found. Spa
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1113](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1113)
+Defined in: [data-structures/trie/trie.ts:633](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L633)
 
 Filter words into a new trie of the same class.
 
@@ -640,8 +630,6 @@ Value for `this` inside the predicate.
 
 A new trie containing words that satisfy the predicate.
 
- *
-
 #### Remarks
 
 Time O(ΣL), Space O(ΣL)
@@ -797,7 +785,7 @@ Time O(n), Space O(1).
 getHeight(): number;
 ```
 
-Defined in: [data-structures/trie/trie.ts:716](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L716)
+Defined in: [data-structures/trie/trie.ts:452](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L452)
 
 Compute the height (max depth) of the trie.
 
@@ -819,7 +807,7 @@ Time O(N), Space O(H)
 getLongestCommonPrefix(): string;
 ```
 
-Defined in: [data-structures/trie/trie.ts:895](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L895)
+Defined in: [data-structures/trie/trie.ts:543](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L543)
 
 Return the longest common prefix among all words.
 
@@ -829,8 +817,6 @@ Return the longest common prefix among all words.
 
 The longest common prefix string.
 
- *
-
 #### Remarks
 
 Time O(H), Space O(1)
@@ -855,7 +841,7 @@ getWords(
    isAllWhenEmptyPrefix?): string[];
 ```
 
-Defined in: [data-structures/trie/trie.ts:969](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L969)
+Defined in: [data-structures/trie/trie.ts:574](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L574)
 
 Collect words under a prefix up to a maximum count.
 
@@ -885,8 +871,6 @@ When true, collect from root even if prefix is empty.
 
 Array of collected words (at most max).
 
- *
-
 #### Remarks
 
 Time O(K·L), Space O(K·L)
@@ -914,7 +898,7 @@ Time O(K·L), Space O(K·L)
 has(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:487](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L487)
+Defined in: [data-structures/trie/trie.ts:348](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L348)
 
 Check whether a word exists.
 
@@ -932,8 +916,6 @@ Word to search for.
 
 True if present.
 
- *
-
 #### Remarks
 
 Time O(L), Space O(1)
@@ -961,7 +943,7 @@ Time O(L), Space O(1)
 hasCommonPrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:828](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L828)
+Defined in: [data-structures/trie/trie.ts:519](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L519)
 
 Check whether the trie’s longest common prefix equals input.
 
@@ -991,7 +973,7 @@ Time O(min(H,L)), Space O(1)
 hasPrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:810](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L810)
+Defined in: [data-structures/trie/trie.ts:502](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L502)
 
 Check whether any word starts with input.
 
@@ -1009,8 +991,6 @@ String to test as prefix.
 
 True if input matches a path from root.
 
- *
-
 #### Remarks
 
 Time O(L), Space O(1)
@@ -1034,7 +1014,7 @@ Time O(L), Space O(1)
 hasPurePrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:743](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L743)
+Defined in: [data-structures/trie/trie.ts:478](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L478)
 
 Check whether input is a proper prefix of at least one word.
 
@@ -1064,7 +1044,7 @@ Time O(L), Space O(1)
 includes(element): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L200)
+Defined in: [data-structures/base/iterable-element-base.ts:199](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L199)
 
 Check whether a value exists (Array-compatible alias for `has`).
 
@@ -1098,7 +1078,7 @@ Provided for familiarity when migrating from Array. Time O(n), Space O(1).
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:549](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L549)
+Defined in: [data-structures/trie/trie.ts:370](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L370)
 
 Check whether the trie is empty.
 
@@ -1108,8 +1088,6 @@ Check whether the trie is empty.
 
 True if size is 0.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1136,7 +1114,7 @@ Time O(1), Space O(1)
 keys(): IterableIterator<number>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L219)
+Defined in: [data-structures/base/iterable-element-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L218)
 
 Return an iterator of numeric indices (Array-compatible).
 
@@ -1165,12 +1143,10 @@ map<RM>(
 thisArg?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1172](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1172)
+Defined in: [data-structures/trie/trie.ts:653](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L653)
 
 Transform words
 
- *
-
 ##### Type Parameters
 
 ###### RM
@@ -1217,7 +1193,7 @@ map<EM, RM>(
 thisArg?): IterableElementBase<EM, RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1185)
+Defined in: [data-structures/trie/trie.ts:665](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L665)
 
 Map words into a new trie (possibly different record type).
 
@@ -1275,7 +1251,7 @@ IterableElementBase.map
 mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1212](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1212)
+Defined in: [data-structures/trie/trie.ts:690](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L690)
 
 Map words into a new trie of the same element type.
 
@@ -1315,7 +1291,7 @@ Time O(ΣL), Space O(ΣL)
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:301](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L301)
+Defined in: [data-structures/base/iterable-element-base.ts:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L298)
 
 Prints `toVisual()` to the console. Intended for quick debugging.
 
@@ -1373,7 +1349,7 @@ Time O(n), Space O(1). Throws if called on an empty structure without `initialVa
 reduce(callbackfn): string;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
+Defined in: [data-structures/base/iterable-element-base.ts:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L225)
 
 ##### Parameters
 
@@ -1395,7 +1371,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.c
 reduce(callbackfn, initialValue): string;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
+Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
 
 ##### Parameters
 
@@ -1421,7 +1397,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.c
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L228)
+Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
 
 ##### Type Parameters
 
@@ -1495,7 +1471,7 @@ Time O(n) in the worst case; may exit early on first success. Space O(1).
 toArray(): string[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L278)
+Defined in: [data-structures/base/iterable-element-base.ts:275](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L275)
 
 Materializes the elements into a new array.
 
@@ -1521,7 +1497,7 @@ Time O(n), Space O(n).
 toVisual(): string[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L290)
+Defined in: [data-structures/base/iterable-element-base.ts:287](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L287)
 
 Returns a representation of the structure suitable for quick visualization.
 Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -1609,7 +1585,7 @@ Time O(1), Space O(1).
 get protected _total(): number;
 ```
 
-Defined in: [data-structures/trie/trie.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L278)
+Defined in: [data-structures/trie/trie.ts:265](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L265)
 
 (Protected) Get total count for base class iteration.
 
@@ -1631,7 +1607,7 @@ Total number of elements.
 protected _caseProcess(str): string;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1296](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1296)
+Defined in: [data-structures/trie/trie.ts:766](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L766)
 
 (Protected) Normalize a string according to case sensitivity.
 
@@ -1661,7 +1637,7 @@ Time O(L), Space O(L)
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1229](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1229)
+Defined in: [data-structures/trie/trie.ts:706](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L706)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -1691,7 +1667,7 @@ Time O(1), Space O(1)
 protected _createLike<RM>(elements?, options?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1250](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1250)
+Defined in: [data-structures/trie/trie.ts:723](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L723)
 
 (Protected) Create a like-kind trie and seed it from an iterable.
 
@@ -1733,7 +1709,7 @@ Time O(ΣL), Space O(ΣL)
 protected _getIterator(): IterableIterator<string>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1276](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1276)
+Defined in: [data-structures/trie/trie.ts:747](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L747)
 
 (Protected) Iterate all words in lexicographic order of edges.
 
@@ -1759,7 +1735,7 @@ Time O(ΣL), Space O(H)
 protected _spawnLike<RM>(options?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1266](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1266)
+Defined in: [data-structures/trie/trie.ts:738](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L738)
 
 (Protected) Spawn an empty like-kind trie instance.
 

package/docs-site-docusaurus/docs/api/classes/TrieNode.md

@@ -6,7 +6,7 @@
 
 # Class: TrieNode
 
-Defined in: [data-structures/trie/trie.ts:17](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L17)
+Defined in: [data-structures/trie/trie.ts:16](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L16)
 
 Node used by Trie to store one character and its children.
 
@@ -22,7 +22,7 @@ Time O(1), Space O(1)
 new TrieNode(key): TrieNode;
 ```
 
-Defined in: [data-structures/trie/trie.ts:24](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L24)
+Defined in: [data-structures/trie/trie.ts:22](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L22)
 
 Create a Trie node with a character key.
 
@@ -52,7 +52,7 @@ Time O(1), Space O(1)
 get children(): Map<string, TrieNode>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:61](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L61)
+Defined in: [data-structures/trie/trie.ts:56](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L56)
 
 Get the child map of this node.
 
@@ -72,7 +72,7 @@ Map from character to child node.
 set children(value): void;
 ```
 
-Defined in: [data-structures/trie/trie.ts:72](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L72)
+Defined in: [data-structures/trie/trie.ts:66](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L66)
 
 Replace the child map of this node.
 
@@ -104,7 +104,7 @@ void
 get isEnd(): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:84](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L84)
+Defined in: [data-structures/trie/trie.ts:77](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L77)
 
 Check whether this node marks the end of a word.
 
@@ -124,7 +124,7 @@ True if this node ends a word.
 set isEnd(value): void;
 ```
 
-Defined in: [data-structures/trie/trie.ts:95](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L95)
+Defined in: [data-structures/trie/trie.ts:87](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L87)
 
 Mark this node as the end of a word or not.
 
@@ -156,7 +156,7 @@ void
 get key(): string;
 ```
 
-Defined in: [data-structures/trie/trie.ts:38](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L38)
+Defined in: [data-structures/trie/trie.ts:35](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L35)
 
 Get the character key of this node.
 
@@ -176,7 +176,7 @@ Character key string.
 set key(value): void;
 ```
 
-Defined in: [data-structures/trie/trie.ts:49](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L49)
+Defined in: [data-structures/trie/trie.ts:45](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L45)
 
 Set the character key of this node.