data-structure-typed 2.6.0 → 2.6.2

package/dist/esm-legacy/trie.mjs

@@ -408,68 +408,26 @@ var _Trie = class _Trie extends IterableElementBase {
     return this._size;
   }
   /**
-    * Insert one word into the trie.
-    * @remarks Time O(L), Space O(L)
-    * @param word - Word to insert.
-    * @returns True if the word was newly added.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // basic Trie creation and add words
-  *  // Create a simple Trie with initial words
-  *     const trie = new Trie(['apple', 'app', 'apply']);
-  *
-  *     // Verify size
-  *     console.log(trie.size); // 3;
-  *
-  *     // Check if words exist
-  *     console.log(trie.has('apple')); // true;
-  *     console.log(trie.has('app')); // true;
-  *
-  *     // Add a new word
-  *     trie.add('application');
-  *     console.log(trie.size); // 4;
-    */
+   * Insert one word into the trie.
+   * @remarks Time O(L), Space O(L)
+   * @param word - Word to insert.
+   * @returns True if the word was newly added.
+   * @example
+   * // basic Trie creation and add words
+   *  // Create a simple Trie with initial words
+   *     const trie = new Trie(['apple', 'app', 'apply']);
+   *
+   *     // Verify size
+   *     console.log(trie.size); // 3;
+   *
+   *     // Check if words exist
+   *     console.log(trie.has('apple')); // true;
+   *     console.log(trie.has('app')); // true;
+   *
+   *     // Add a new word
+   *     trie.add('application');
+   *     console.log(trie.size); // 4;
+   */
   add(word) {
     word = this._caseProcess(word);
     let cur = this.root;
@@ -490,57 +448,18 @@ var _Trie = class _Trie extends IterableElementBase {
     return isNewWord;
   }
   /**
-    * Insert many words from an iterable.
-    * @remarks Time O(ΣL), Space O(ΣL)
-    * @param words - Iterable of strings (or raw records if toElementFn is provided).
-    * @returns Array of per-word 'added' flags.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Add multiple words
-  *  const trie = new Trie();
-  *     trie.addMany(['cat', 'car', 'card']);
-  *     console.log(trie.has('cat')); // true;
-  *     console.log(trie.has('car')); // true;
-  *     console.log(trie.size); // 3;
-    */
+   * Insert many words from an iterable.
+   * @remarks Time O(ΣL), Space O(ΣL)
+   * @param words - Iterable of strings (or raw records if toElementFn is provided).
+   * @returns Array of per-word 'added' flags.
+   * @example
+   * // Add multiple words
+   *  const trie = new Trie();
+   *     trie.addMany(['cat', 'car', 'card']);
+   *     console.log(trie.has('cat')); // true;
+   *     console.log(trie.has('car')); // true;
+   *     console.log(trie.size); // 3;
+   */
   addMany(words) {
     const ans = [];
     for (const word of words) {
@@ -553,60 +472,18 @@ var _Trie = class _Trie extends IterableElementBase {
     return ans;
   }
   /**
-    * Check whether a word exists.
-    * @remarks Time O(L), Space O(1)
-    * @param word - Word to search for.
-    * @returns True if present.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check if a word exists
-  *  const dict = new Trie(['apple', 'app', 'application']);
-  *
-  *     console.log(dict.has('app')); // true;
-  *     console.log(dict.has('apple')); // true;
-  *     console.log(dict.has('ap')); // false;
-    */
+   * Check whether a word exists.
+   * @remarks Time O(L), Space O(1)
+   * @param word - Word to search for.
+   * @returns True if present.
+   * @example
+   * // Check if a word exists
+   *  const dict = new Trie(['apple', 'app', 'application']);
+   *
+   *     console.log(dict.has('app')); // true;
+   *     console.log(dict.has('apple')); // true;
+   *     console.log(dict.has('ap')); // false;
+   */
   has(word) {
     word = this._caseProcess(word);
     let cur = this.root;
@@ -618,176 +495,56 @@ var _Trie = class _Trie extends IterableElementBase {
     return cur.isEnd;
   }
   /**
-    * Check whether the trie is empty.
-    * @remarks Time O(1), Space O(1)
-    * @returns True if size is 0.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check if empty
-  *  const trie = new Trie();
-  *     console.log(trie.isEmpty()); // true;
-  *     trie.add('word');
-  *     console.log(trie.isEmpty()); // false;
-    */
+   * Check whether the trie is empty.
+   * @remarks Time O(1), Space O(1)
+   * @returns True if size is 0.
+   * @example
+   * // Check if empty
+   *  const trie = new Trie();
+   *     console.log(trie.isEmpty()); // true;
+   *     trie.add('word');
+   *     console.log(trie.isEmpty()); // false;
+   */
   isEmpty() {
     return this._size === 0;
   }
   /**
-    * Remove all words and reset to a fresh root.
-    * @remarks Time O(1), Space O(1)
-    * @returns void
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all words
-  *  const trie = new Trie(['a', 'b', 'c']);
-  *     trie.clear();
-  *     console.log(trie.isEmpty()); // true;
-    */
+   * Remove all words and reset to a fresh root.
+   * @remarks Time O(1), Space O(1)
+   * @returns void
+   * @example
+   * // Remove all words
+   *  const trie = new Trie(['a', 'b', 'c']);
+   *     trie.clear();
+   *     console.log(trie.isEmpty()); // true;
+   */
   clear() {
     this._size = 0;
     this._root = new TrieNode("");
   }
   /**
-    * Delete one word if present.
-    * @remarks Time O(L), Space O(1)
-    * @param word - Word to delete.
-    * @returns True if a word was removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Trie delete and iteration
-  *  const trie = new Trie(['car', 'card', 'care', 'careful', 'can', 'cat']);
-  *
-  *     // Delete a word
-  *     trie.delete('card');
-  *     console.log(trie.has('card')); // false;
-  *
-  *     // Word with same prefix still exists
-  *     console.log(trie.has('care')); // true;
-  *
-  *     // Size decreased
-  *     console.log(trie.size); // 5;
-  *
-  *     // Iterate through all words
-  *     const allWords = [...trie];
-  *     console.log(allWords.length); // 5;
-    */
+   * Delete one word if present.
+   * @remarks Time O(L), Space O(1)
+   * @param word - Word to delete.
+   * @returns True if a word was removed.
+   * @example
+   * // Trie delete and iteration
+   *  const trie = new Trie(['car', 'card', 'care', 'careful', 'can', 'cat']);
+   *
+   *     // Delete a word
+   *     trie.delete('card');
+   *     console.log(trie.has('card')); // false;
+   *
+   *     // Word with same prefix still exists
+   *     console.log(trie.has('care')); // true;
+   *
+   *     // Size decreased
+   *     console.log(trie.size); // 5;
+   *
+   *     // Iterate through all words
+   *     const allWords = [...trie];
+   *     console.log(allWords.length); // 5;
+   */
   delete(word) {
     word = this._caseProcess(word);
     let isDeleted = false;
@@ -863,60 +620,18 @@ var _Trie = class _Trie extends IterableElementBase {
     return !cur.isEnd;
   }
   /**
-    * Check whether any word starts with input.
-    * @remarks Time O(L), Space O(1)
-    * @param input - String to test as prefix.
-    * @returns True if input matches a path from root.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check if a prefix exists
-  *  const trie = new Trie(['hello', 'help', 'world']);
-  *
-  *     console.log(trie.hasPrefix('hel')); // true;
-  *     console.log(trie.hasPrefix('wor')); // true;
-  *     console.log(trie.hasPrefix('xyz')); // false;
-    */
+   * Check whether any word starts with input.
+   * @remarks Time O(L), Space O(1)
+   * @param input - String to test as prefix.
+   * @returns True if input matches a path from root.
+   * @example
+   * // Check if a prefix exists
+   *  const trie = new Trie(['hello', 'help', 'world']);
+   *
+   *     console.log(trie.hasPrefix('hel')); // true;
+   *     console.log(trie.hasPrefix('wor')); // true;
+   *     console.log(trie.hasPrefix('xyz')); // false;
+   */
   hasPrefix(input) {
     input = this._caseProcess(input);
     let cur = this.root;
@@ -947,57 +662,15 @@ var _Trie = class _Trie extends IterableElementBase {
     return commonPre === input;
   }
   /**
-    * Return the longest common prefix among all words.
-    * @remarks Time O(H), Space O(1)
-    * @returns The longest common prefix string.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Find shared prefix
-  *  const trie = new Trie(['flower', 'flow', 'flight']);
-  *
-  *     console.log(trie.getLongestCommonPrefix()); // 'fl';
-    */
+   * Return the longest common prefix among all words.
+   * @remarks Time O(H), Space O(1)
+   * @returns The longest common prefix string.
+   * @example
+   * // Find shared prefix
+   *  const trie = new Trie(['flower', 'flow', 'flight']);
+   *
+   *     console.log(trie.getLongestCommonPrefix()); // 'fl';
+   */
   getLongestCommonPrefix() {
     let commonPre = "";
     const dfs = /* @__PURE__ */ __name((cur) => {
@@ -1010,66 +683,24 @@ var _Trie = class _Trie extends IterableElementBase {
     return commonPre;
   }
   /**
-    * Collect words under a prefix up to a maximum count.
-    * @remarks Time O(K·L), Space O(K·L)
-    * @param [prefix] - Prefix to match; default empty string for root.
-    * @param [max] - Maximum number of words to return; default is Number.MAX_SAFE_INTEGER.
-    * @param [isAllWhenEmptyPrefix] - When true, collect from root even if prefix is empty.
-    * @returns Array of collected words (at most max).
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Trie getWords and prefix search
-  *  const trie = new Trie(['apple', 'app', 'apply', 'application', 'apricot']);
-  *
-  *     // Get all words with prefix 'app'
-  *     const appWords = trie.getWords('app');
-  *     console.log(appWords); // contains 'app';
-  *     console.log(appWords); // contains 'apple';
-  *     console.log(appWords); // contains 'apply';
-  *     console.log(appWords); // contains 'application';
-  *     expect(appWords).not.toContain('apricot');
-    */
+   * Collect words under a prefix up to a maximum count.
+   * @remarks Time O(K·L), Space O(K·L)
+   * @param [prefix] - Prefix to match; default empty string for root.
+   * @param [max] - Maximum number of words to return; default is Number.MAX_SAFE_INTEGER.
+   * @param [isAllWhenEmptyPrefix] - When true, collect from root even if prefix is empty.
+   * @returns Array of collected words (at most max).
+   * @example
+   * // Trie getWords and prefix search
+   *  const trie = new Trie(['apple', 'app', 'apply', 'application', 'apricot']);
+   *
+   *     // Get all words with prefix 'app'
+   *     const appWords = trie.getWords('app');
+   *     console.log(appWords); // contains 'app';
+   *     console.log(appWords); // contains 'apple';
+   *     console.log(appWords); // contains 'apply';
+   *     console.log(appWords); // contains 'application';
+   *     expect(appWords).not.toContain('apricot');
+   */
   getWords(prefix = "", max = Number.MAX_SAFE_INTEGER, isAllWhenEmptyPrefix = false) {
     prefix = this._caseProcess(prefix);
     const words = [];
@@ -1100,111 +731,33 @@ var _Trie = class _Trie extends IterableElementBase {
     return words;
   }
   /**
-    * Deep clone this trie by iterating and inserting all words.
-    * @remarks Time O(ΣL), Space O(ΣL)
-    * @returns A new trie with the same words and options.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Create independent copy
-  *  const trie = new Trie(['hello', 'world']);
-  *     const copy = trie.clone();
-  *     copy.delete('hello');
-  *     console.log(trie.has('hello')); // true;
-    */
+   * Deep clone this trie by iterating and inserting all words.
+   * @remarks Time O(ΣL), Space O(ΣL)
+   * @returns A new trie with the same words and options.
+   * @example
+   * // Create independent copy
+   *  const trie = new Trie(['hello', 'world']);
+   *     const copy = trie.clone();
+   *     copy.delete('hello');
+   *     console.log(trie.has('hello')); // true;
+   */
   clone() {
     const next = this._createInstance();
     for (const x of this) next.add(x);
     return next;
   }
   /**
-    * Filter words into a new trie of the same class.
-    * @remarks Time O(ΣL), Space O(ΣL)
-    * @param predicate - Predicate (word, index, trie) → boolean to keep word.
-    * @param [thisArg] - Value for `this` inside the predicate.
-    * @returns A new trie containing words that satisfy the predicate.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Filter words
-  *  const trie = new Trie(['cat', 'car', 'dog', 'card']);
-  *     const result = trie.filter(w => w.startsWith('ca'));
-  *     console.log(result.size); // 3;
-    */
+   * Filter words into a new trie of the same class.
+   * @remarks Time O(ΣL), Space O(ΣL)
+   * @param predicate - Predicate (word, index, trie) → boolean to keep word.
+   * @param [thisArg] - Value for `this` inside the predicate.
+   * @returns A new trie containing words that satisfy the predicate.
+   * @example
+   * // Filter words
+   *  const trie = new Trie(['cat', 'car', 'dog', 'card']);
+   *     const result = trie.filter(w => w.startsWith('ca'));
+   *     console.log(result.size); // 3;
+   */
   filter(predicate, thisArg) {
     const results = this._createInstance();
     let index = 0;