data-structure-typed 2.5.2 → 2.5.3

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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L216)
+Defined in: [data-structures/trie/trie.ts:216](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L216)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L225)
+Defined in: [data-structures/trie/trie.ts:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L225)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L256)
+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 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L268)
+Defined in: [data-structures/trie/trie.ts:268](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L268)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L244)
+Defined in: [data-structures/trie/trie.ts:244](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L244)
 
 Get the number of stored words.
 
@@ -270,7 +270,7 @@ Word count.
 get toElementFn(): ((rawElement) => E) | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:48](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L48)
+Defined in: [data-structures/base/iterable-element-base.ts:48](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L48)
 
 Exposes the current `toElementFn`, if configured.
 
@@ -296,7 +296,7 @@ The converter function or `undefined` when not set.
 iterator: IterableIterator<string>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:61](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L61)
+Defined in: [data-structures/base/iterable-element-base.ts:61](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L61)
 
 Returns an iterator over the structure's elements.
 
@@ -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:339](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L339)
+Defined in: [data-structures/trie/trie.ts:343](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L343)
 
 Insert one word into the trie.
 
@@ -381,7 +381,7 @@ Time O(L), Space O(L)
 addMany(words): boolean[];
 ```
 
-Defined in: [data-structures/trie/trie.ts:405](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L405)
+Defined in: [data-structures/trie/trie.ts:413](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L413)
 
 Insert many words from an iterable.
 
@@ -424,7 +424,7 @@ Time O(ΣL), Space O(ΣL)
 clear(): void;
 ```
 
-Defined in: [data-structures/trie/trie.ts:568](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L568)
+Defined in: [data-structures/trie/trie.ts:588](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L588)
 
 Remove all words and reset to a fresh root.
 
@@ -461,7 +461,7 @@ Time O(1), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:985](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L985)
+Defined in: [data-structures/trie/trie.ts:1025](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1025)
 
 Deep clone this trie by iterating and inserting all words.
 
@@ -499,7 +499,7 @@ Time O(ΣL), Space O(ΣL)
 delete(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:632](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L632)
+Defined in: [data-structures/trie/trie.ts:656](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L656)
 
 Delete one word if present.
 
@@ -552,7 +552,7 @@ Time O(L), Space O(1)
 every(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:87](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L87)
+Defined in: [data-structures/base/iterable-element-base.ts:87](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L87)
 
 Tests whether all elements satisfy the predicate.
 
@@ -592,7 +592,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:1036](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1036)
+Defined in: [data-structures/trie/trie.ts:1080](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1080)
 
 Filter words into a new trie of the same class.
 
@@ -645,7 +645,7 @@ Time O(ΣL), Space O(ΣL)
 find<S>(predicate, thisArg?): S | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:163](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L163)
+Defined in: [data-structures/base/iterable-element-base.ts:163](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L163)
 
 Finds the first element that satisfies the predicate and returns it.
 
@@ -691,7 +691,7 @@ Time O(n) in the worst case; may exit early on the first match. Space O(1).
 find(predicate, thisArg?): string | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:164](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L164)
+Defined in: [data-structures/base/iterable-element-base.ts:164](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L164)
 
 Finds the first element that satisfies the predicate and returns it.
 
@@ -733,7 +733,7 @@ Time O(n) in the worst case; may exit early on the first match. Space O(1).
 forEach(callbackfn, thisArg?): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:133](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L133)
+Defined in: [data-structures/base/iterable-element-base.ts:133](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L133)
 
 Invokes a callback for each element in iteration order.
 
@@ -773,7 +773,7 @@ Time O(n), Space O(1).
 getHeight(): number;
 ```
 
-Defined in: [data-structures/trie/trie.ts:674](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L674)
+Defined in: [data-structures/trie/trie.ts:698](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L698)
 
 Compute the height (max depth) of the trie.
 
@@ -795,7 +795,7 @@ Time O(N), Space O(H)
 getLongestCommonPrefix(): string;
 ```
 
-Defined in: [data-structures/trie/trie.ts:839](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L839)
+Defined in: [data-structures/trie/trie.ts:871](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L871)
 
 Return the longest common prefix among all words.
 
@@ -831,7 +831,7 @@ getWords(
    isAllWhenEmptyPrefix?): string[];
 ```
 
-Defined in: [data-structures/trie/trie.ts:906](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L906)
+Defined in: [data-structures/trie/trie.ts:942](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L942)
 
 Collect words under a prefix up to a maximum count.
 
@@ -890,7 +890,7 @@ Time O(K·L), Space O(K·L)
 has(word): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:466](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L466)
+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 a word exists.
 
@@ -937,7 +937,7 @@ Time O(L), Space O(1)
 hasCommonPrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:779](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L779)
+Defined in: [data-structures/trie/trie.ts:807](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L807)
 
 Check whether the trie’s longest common prefix equals input.
 
@@ -967,7 +967,7 @@ Time O(min(H,L)), Space O(1)
 hasPrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:761](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L761)
+Defined in: [data-structures/trie/trie.ts:789](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L789)
 
 Check whether any word starts with input.
 
@@ -1010,7 +1010,7 @@ Time O(L), Space O(1)
 hasPurePrefix(input): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:701](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L701)
+Defined in: [data-structures/trie/trie.ts:725](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L725)
 
 Check whether input is a proper prefix of at least one word.
 
@@ -1040,7 +1040,7 @@ Time O(L), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/trie/trie.ts:521](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L521)
+Defined in: [data-structures/trie/trie.ts:537](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L537)
 
 Check whether the trie is empty.
 
@@ -1083,7 +1083,7 @@ map<RM>(
 thisArg?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1088](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1088)
+Defined in: [data-structures/trie/trie.ts:1136](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1136)
 
 Transform words
 
@@ -1135,7 +1135,7 @@ map<EM, RM>(
 thisArg?): IterableElementBase<EM, RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1101](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1101)
+Defined in: [data-structures/trie/trie.ts:1149](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1149)
 
 Map words into a new trie (possibly different record type).
 
@@ -1193,7 +1193,7 @@ IterableElementBase.map
 mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1128](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1128)
+Defined in: [data-structures/trie/trie.ts:1176](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1176)
 
 Map words into a new trie of the same element type.
 
@@ -1233,7 +1233,7 @@ Time O(ΣL), Space O(ΣL)
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:269](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L269)
+Defined in: [data-structures/base/iterable-element-base.ts:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L269)
 
 Prints `toVisual()` to the console. Intended for quick debugging.
 
@@ -1291,7 +1291,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:194](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L194)
+Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L194)
 
 ##### Parameters
 
@@ -1313,7 +1313,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.c
 reduce(callbackfn, initialValue): string;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L195)
+Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L195)
 
 ##### Parameters
 
@@ -1339,7 +1339,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.c
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L196)
+Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L196)
 
 ##### Type Parameters
 
@@ -1373,7 +1373,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.c
 some(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:110](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L110)
+Defined in: [data-structures/base/iterable-element-base.ts:110](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L110)
 
 Tests whether at least one element satisfies the predicate.
 
@@ -1413,7 +1413,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:246](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L246)
+Defined in: [data-structures/base/iterable-element-base.ts:246](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L246)
 
 Materializes the elements into a new array.
 
@@ -1439,7 +1439,7 @@ Time O(n), Space O(n).
 toVisual(): string[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:258](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L258)
+Defined in: [data-structures/base/iterable-element-base.ts:258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L258)
 
 Returns a representation of the structure suitable for quick visualization.
 Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -1466,7 +1466,7 @@ Time O(n), Space O(n).
 values(): IterableIterator<string>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:72](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L72)
+Defined in: [data-structures/base/iterable-element-base.ts:72](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L72)
 
 Returns an iterator over the values (alias of the default iterator).
 
@@ -1495,7 +1495,7 @@ Creating the iterator is O(1); full iteration is Time O(n), Space O(1).
 protected optional _toElementFn?: (rawElement) => string;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:39](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-element-base.ts#L39)
+Defined in: [data-structures/base/iterable-element-base.ts:39](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L39)
 
 The converter used to transform a raw element (`R`) into a public element (`E`).
 
@@ -1527,7 +1527,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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L278)
+Defined in: [data-structures/trie/trie.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L278)
 
 (Protected) Get total count for base class iteration.
 
@@ -1549,7 +1549,7 @@ Total number of elements.
 protected _caseProcess(str): string;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1212](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1212)
+Defined in: [data-structures/trie/trie.ts:1260](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1260)
 
 (Protected) Normalize a string according to case sensitivity.
 
@@ -1579,7 +1579,7 @@ Time O(L), Space O(L)
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1145](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1145)
+Defined in: [data-structures/trie/trie.ts:1193](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1193)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -1609,7 +1609,7 @@ Time O(1), Space O(1)
 protected _createLike<RM>(elements?, options?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1166](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1166)
+Defined in: [data-structures/trie/trie.ts:1214](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1214)
 
 (Protected) Create a like-kind trie and seed it from an iterable.
 
@@ -1651,7 +1651,7 @@ Time O(ΣL), Space O(ΣL)
 protected _getIterator(): IterableIterator<string>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1192](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1192)
+Defined in: [data-structures/trie/trie.ts:1240](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1240)
 
 (Protected) Iterate all words in lexicographic order of edges.
 
@@ -1677,7 +1677,7 @@ Time O(ΣL), Space O(H)
 protected _spawnLike<RM>(options?): Trie<RM>;
 ```
 
-Defined in: [data-structures/trie/trie.ts:1182](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L1182)
+Defined in: [data-structures/trie/trie.ts:1230](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L1230)
 
 (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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L17)
+Defined in: [data-structures/trie/trie.ts:17](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L17)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L24)
+Defined in: [data-structures/trie/trie.ts:24](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L24)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L61)
+Defined in: [data-structures/trie/trie.ts:61](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L61)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L72)
+Defined in: [data-structures/trie/trie.ts:72](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L72)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L84)
+Defined in: [data-structures/trie/trie.ts:84](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L84)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L95)
+Defined in: [data-structures/trie/trie.ts:95](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L95)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L38)
+Defined in: [data-structures/trie/trie.ts:38](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L38)
 
 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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/trie/trie.ts#L49)
+Defined in: [data-structures/trie/trie.ts:49](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/trie/trie.ts#L49)
 
 Set the character key of this node.