deque-typed 2.0.4 → 2.1.0

package/dist/data-structures/trie/trie.js

@@ -1,57 +1,76 @@
 "use strict";
+/**
+ * data-structure-typed
+ *
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Trie = exports.TrieNode = void 0;
 const base_1 = require("../base");
+/**
+ * Node used by Trie to store one character and its children.
+ * @remarks Time O(1), Space O(1)
+ */
 class TrieNode {
+    /**
+     * Create a Trie node with a character key.
+     * @remarks Time O(1), Space O(1)
+     * @returns New TrieNode instance.
+     */
     constructor(key) {
         this._key = key;
         this._isEnd = false;
         this._children = new Map();
     }
     /**
-     * The function returns the value of the protected variable _key.
-     * @returns The value of the `_key` property, which is a string.
+     * Get the character key of this node.
+     * @remarks Time O(1), Space O(1)
+     * @returns Character key string.
      */
     get key() {
         return this._key;
     }
     /**
-     * The above function sets the value of a protected variable called "key".
-     * @param {string} value - The value parameter is a string that represents the value to be assigned
-     * to the key.
+     * Set the character key of this node.
+     * @remarks Time O(1), Space O(1)
+     * @param value - New character key.
+     * @returns void
      */
     set key(value) {
         this._key = value;
     }
     /**
-     * The function returns the children of a TrieNode as a Map.
-     * @returns The `children` property of the TrieNode object, which is a Map containing string keys and
-     * TrieNode values.
+     * Get the child map of this node.
+     * @remarks Time O(1), Space O(1)
+     * @returns Map from character to child node.
      */
     get children() {
         return this._children;
     }
     /**
-     * The function sets the value of the `_children` property of a TrieNode object.
-     * @param value - The value parameter is a Map object that represents the children of a TrieNode. The
-     * keys of the map are strings, which represent the characters that are associated with each child
-     * TrieNode. The values of the map are TrieNode objects, which represent the child nodes of the
-     * current TrieNode.
+     * Replace the child map of this node.
+     * @remarks Time O(1), Space O(1)
+     * @param value - New map of character → node.
+     * @returns void
      */
     set children(value) {
         this._children = value;
     }
     /**
-     * The function returns a boolean value indicating whether a certain condition is met.
-     * @returns The method is returning a boolean value, specifically the value of the variable `_isEnd`.
+     * Check whether this node marks the end of a word.
+     * @remarks Time O(1), Space O(1)
+     * @returns True if this node ends a word.
      */
     get isEnd() {
         return this._isEnd;
     }
     /**
-     * The function sets the value of the "_isEnd" property.
-     * @param {boolean} value - The value parameter is a boolean value that indicates whether the current
-     * state is the end state or not.
+     * Mark this node as the end of a word or not.
+     * @remarks Time O(1), Space O(1)
+     * @param value - Whether this node ends a word.
+     * @returns void
      */
     set isEnd(value) {
         this._isEnd = value;
@@ -59,6 +78,9 @@ class TrieNode {
 }
 exports.TrieNode = TrieNode;
 /**
+ * Prefix tree (Trie) for fast prefix queries and word storage.
+ * @remarks Time O(1), Space O(1)
+ * @template R
  * 1. Node Structure: Each node in a Trie represents a string (or a part of a string). The root node typically represents an empty string.
  * 2. Child Node Relationship: Each node's children represent the strings that can be formed by adding one character to the string at the current node. For example, if a node represents the string 'ca', one of its children might represent 'cat'.
  * 3. Fast Retrieval: Trie allows retrieval in O(m) time complexity, where m is the length of the string to be searched.
@@ -154,16 +176,11 @@ exports.TrieNode = TrieNode;
  */
 class Trie extends base_1.IterableElementBase {
     /**
-     * The constructor initializes a Trie data structure with optional options and words provided as
-     * input.
-     * @param {Iterable<string> | Iterable<R>} words - The `words` parameter in the constructor is an
-     * iterable containing either strings or elements of type `R`. It is used to initialize the Trie with
-     * a list of words or elements. If no `words` are provided, an empty iterable is used as the default
-     * value.
-     * @param [options] - The `options` parameter in the constructor is an optional object that can
-     * contain configuration options for the Trie data structure. One of the options it can have is
-     * `caseSensitive`, which is a boolean value indicating whether the Trie should be case-sensitive or
-     * not. If `caseSensitive` is set to `
+     * Create a Trie and optionally bulk-insert words.
+     * @remarks Time O(totalChars), Space O(totalChars)
+     * @param [words] - Iterable of strings (or raw records if toElementFn is provided).
+     * @param [options] - Options such as toElementFn and caseSensitive.
+     * @returns New Trie instance.
      */
     constructor(words = [], options) {
         super(options);
@@ -180,33 +197,42 @@ class Trie extends base_1.IterableElementBase {
         }
     }
     /**
-     * The size function returns the size of the stack.
-     * @return The number of elements in the list
+     * Get the number of stored words.
+     * @remarks Time O(1), Space O(1)
+     * @returns Word count.
      */
     get size() {
         return this._size;
     }
     /**
-     * The caseSensitive function is a getter that returns the value of the protected _caseSensitive property.
-     * @return The value of the _caseSensitive protected variable
+     * Get whether comparisons are case-sensitive.
+     * @remarks Time O(1), Space O(1)
+     * @returns True if case-sensitive.
      */
     get caseSensitive() {
         return this._caseSensitive;
     }
     /**
-     * The root function returns the root node of the tree.
-     * @return The root node
+     * Get the root node.
+     * @remarks Time O(1), Space O(1)
+     * @returns Root TrieNode.
      */
     get root() {
         return this._root;
     }
     /**
-     * Time Complexity: O(l), where l is the length of the word being added.
-     * Space Complexity: O(l) - Each character in the word adds a TrieNode.
-     *
-     * Add a word to the Trie structure.
-     * @param {string} word - The word to add.
-     * @returns {boolean} True if the word was successfully added.
+     * (Protected) Get total count for base class iteration.
+     * @remarks Time O(1), Space O(1)
+     * @returns Total number of elements.
+     */
+    get _total() {
+        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.
      */
     add(word) {
         word = this._caseProcess(word);
@@ -228,16 +254,10 @@ class Trie extends base_1.IterableElementBase {
         return isNewWord;
     }
     /**
-     * Time Complexity: O(n * l)
-     * Space Complexity: O(1)
-     *
-     * The `addMany` function in TypeScript takes an iterable of strings or elements of type R, converts
-     * them using a provided function if available, and adds them to a data structure while returning an
-     * array of boolean values indicating success.
-     * @param {Iterable<string> | Iterable<R>} words - The `words` parameter in the `addMany` function is
-     * an iterable that contains either strings or elements of type `R`.
-     * @returns The `addMany` method returns an array of boolean values indicating whether each word in
-     * the input iterable was successfully added to the data structure.
+     * 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.
      */
     addMany(words) {
         const ans = [];
@@ -252,12 +272,10 @@ class Trie extends base_1.IterableElementBase {
         return ans;
     }
     /**
-     * Time Complexity: O(l), where l is the length of the input word.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * Check if the Trie contains a given word.
-     * @param {string} word - The word to check for.
-     * @returns {boolean} True if the word is present in the Trie.
+     * Check whether a word exists.
+     * @remarks Time O(L), Space O(1)
+     * @param word - Word to search for.
+     * @returns True if present.
      */
     has(word) {
         word = this._caseProcess(word);
@@ -271,32 +289,27 @@ class Trie extends base_1.IterableElementBase {
         return cur.isEnd;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The isEmpty function checks if the size of the queue is 0.
-     * @return True if the size of the queue is 0
+     * Check whether the trie is empty.
+     * @remarks Time O(1), Space O(1)
+     * @returns True if size is 0.
      */
     isEmpty() {
         return this._size === 0;
     }
     /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The clear function resets the size of the Trie to 0 and creates a new root TrieNode.
+     * Remove all words and reset to a fresh root.
+     * @remarks Time O(1), Space O(1)
+     * @returns void
      */
     clear() {
         this._size = 0;
         this._root = new TrieNode('');
     }
     /**
-     * Time Complexity: O(l), where l is the length of the word being deleted.
-     * Space Complexity: O(n) - Due to the recursive DFS approach.
-     *
-     * Remove a word from the Trie structure.
-     * @param{string} word - The word to delete.
-     * @returns {boolean} True if the word was successfully removed.
+     * Delete one word if present.
+     * @remarks Time O(L), Space O(1)
+     * @param word - Word to delete.
+     * @returns True if a word was removed.
      */
     delete(word) {
         word = this._caseProcess(word);
@@ -334,14 +347,9 @@ class Trie extends base_1.IterableElementBase {
         return isDeleted;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function `getHeight` calculates the height of a trie data structure starting from the root
-     * node.
-     * @returns The `getHeight` method returns the maximum depth or height of the trie tree starting from
-     * the root node. It calculates the depth using a breadth-first search (BFS) traversal of the trie
-     * tree and returns the maximum depth found.
+     * Compute the height (max depth) of the trie.
+     * @remarks Time O(N), Space O(H)
+     * @returns Maximum depth from root to a leaf.
      */
     getHeight() {
         const startNode = this.root;
@@ -363,12 +371,10 @@ class Trie extends base_1.IterableElementBase {
         return maxDepth;
     }
     /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * Check if a given input string has an absolute prefix in the Trie, meaning it's not a complete word.
-     * @param {string} input - The input string to check.
-     * @returns {boolean} True if it's an absolute prefix in the Trie.
+     * Check whether input is a proper prefix of at least one word.
+     * @remarks Time O(L), Space O(1)
+     * @param input - String to test as prefix.
+     * @returns True if input is a prefix but not a full word.
      */
     hasPurePrefix(input) {
         input = this._caseProcess(input);
@@ -382,12 +388,10 @@ class Trie extends base_1.IterableElementBase {
         return !cur.isEnd;
     }
     /**
-     * Time Complexity: O(l), where l is the length of the input prefix.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * Check if a given input string is a prefix of any existing word in the Trie, whether as an absolute prefix or a complete word.
-     * @param {string} input - The input string representing the prefix to check.
-     * @returns {boolean} True if it's a prefix in the Trie.
+     * 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.
      */
     hasPrefix(input) {
         input = this._caseProcess(input);
@@ -401,12 +405,10 @@ class Trie extends base_1.IterableElementBase {
         return true;
     }
     /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the input prefix.
-     *
-     * Check if the input string is a common prefix in the Trie, meaning it's a prefix shared by all words in the Trie.
-     * @param {string} input - The input string representing the common prefix to check for.
-     * @returns {boolean} True if it's a common prefix in the Trie.
+     * Check whether the trie’s longest common prefix equals input.
+     * @remarks Time O(min(H,L)), Space O(1)
+     * @param input - Candidate longest common prefix.
+     * @returns True if input equals the common prefix.
      */
     hasCommonPrefix(input) {
         input = this._caseProcess(input);
@@ -426,11 +428,9 @@ class Trie extends base_1.IterableElementBase {
         return commonPre === input;
     }
     /**
-     * Time Complexity: O(n), where n is the total number of nodes in the trie.
-     * Space Complexity: O(l), where l is the length of the longest common prefix.
-     *
-     * Get the longest common prefix among all the words stored in the Trie.
-     * @returns {string} The longest common prefix found in the Trie.
+     * Return the longest common prefix among all words.
+     * @remarks Time O(H), Space O(1)
+     * @returns The longest common prefix string.
      */
     getLongestCommonPrefix() {
         let commonPre = '';
@@ -447,15 +447,12 @@ class Trie extends base_1.IterableElementBase {
         return commonPre;
     }
     /**
-     * Time Complexity: O(w * l), where w is the number of words retrieved, and l is the average length of the words.
-     * Space Complexity: O(w * l) - The space required for the output array.
-     *
-     * The `getAll` function returns an array of all words in a Trie data structure that start with a given prefix.
-     * @param {string} prefix - The `prefix` parameter is a string that represents the prefix that we want to search for in the
-     * trie. It is an optional parameter, so if no prefix is provided, it will default to an empty string.
-     * @param {number} max - The max count of words will be found
-     * @param isAllWhenEmptyPrefix - If true, when the prefix provided as '', returns all the words in the trie.
-     * @returns {string[]} an array of strings.
+     * 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).
      */
     getWords(prefix = '', max = Number.MAX_SAFE_INTEGER, isAllWhenEmptyPrefix = false) {
         prefix = this._caseProcess(prefix);
@@ -483,7 +480,6 @@ class Trie extends base_1.IterableElementBase {
                     startNode = nodeC;
                 }
                 else {
-                    // Early return if the whole prefix is not found
                     return [];
                 }
             }
@@ -493,32 +489,25 @@ class Trie extends base_1.IterableElementBase {
         return words;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `clone` function returns a new instance of the Trie class with the same values and case
-     * sensitivity as the original Trie.
-     * @returns A new instance of the Trie class is being returned.
+     * 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.
      */
     clone() {
-        return new Trie(this, { caseSensitive: this.caseSensitive, toElementFn: this.toElementFn });
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `filter` function takes a predicate function and returns a new array containing all the
-     * elements for which the predicate function returns true.
-     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:
-     * `word`, `index`, and `this`. It should return a boolean value indicating whether the current
-     * element should be included in the filtered results or not.
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that allows you to
-     * specify the value of `this` within the `predicate` function. It is used when you want to bind a
-     * specific object as the context for the `predicate` function. If `thisArg` is provided, it will be
-     * @returns The `filter` method is returning an array of strings (`string[]`).
+        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.
      */
     filter(predicate, thisArg) {
-        const results = new Trie([], { toElementFn: this.toElementFn, caseSensitive: this.caseSensitive });
+        const results = this._createInstance();
         let index = 0;
         for (const word of this) {
             if (predicate.call(thisArg, word, index, this)) {
@@ -528,39 +517,71 @@ class Trie extends base_1.IterableElementBase {
         }
         return results;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The `map` function creates a new Trie by applying a callback function to each element in the
-     * current Trie.
-     * @param callback - The callback parameter is a function that will be called for each element in the
-     * Trie. It takes four arguments:
-     * @param [toElementFn] - The `toElementFn` parameter is an optional function that can be used to
-     * convert the raw element (`RM`) into a string representation. This can be useful if the raw element
-     * is not already a string or if you want to customize how the element is converted into a string. If
-     * this parameter is
-     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that allows you to
-     * specify the value of `this` within the callback function. It is used to set the context or scope
-     * in which the callback function will be executed. If `thisArg` is provided, it will be used as the
-     * value of
-     * @returns a new Trie object.
-     */
-    map(callback, toElementFn, thisArg) {
-        const newTrie = new Trie([], { toElementFn, caseSensitive: this.caseSensitive });
-        let index = 0;
-        for (const word of this) {
-            newTrie.add(callback.call(thisArg, word, index, this));
-            index++;
+    map(callback, options, thisArg) {
+        const newTrie = this._createLike([], options);
+        let i = 0;
+        for (const x of this) {
+            const v = thisArg === undefined ? callback(x, i++, this) : callback.call(thisArg, x, i++, this);
+            if (typeof v !== 'string') {
+                throw new TypeError(`Trie.map callback must return string; got ${typeof v}`);
+            }
+            newTrie.add(v);
         }
         return newTrie;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     *
-     * The function `_getIterator` returns an iterable iterator that performs a depth-first search on a
-     * trie data structure and yields all the paths to the end nodes.
+     * Map words into a new trie of the same element type.
+     * @remarks Time O(ΣL), Space O(ΣL)
+     * @param callback - Mapping function (word, index, trie) → string.
+     * @param [thisArg] - Value for `this` inside the callback.
+     * @returns A new trie with mapped words.
+     */
+    mapSame(callback, thisArg) {
+        const next = this._createInstance();
+        let i = 0;
+        for (const key of this) {
+            const mapped = thisArg === undefined ? callback(key, i++, this) : callback.call(thisArg, key, i++, this);
+            next.add(mapped);
+        }
+        return next;
+    }
+    /**
+     * (Protected) Create an empty instance of the same concrete class.
+     * @remarks Time O(1), Space O(1)
+     * @param [options] - Options forwarded to the constructor.
+     * @returns An empty like-kind trie instance.
+     */
+    _createInstance(options) {
+        const Ctor = this.constructor;
+        const next = new Ctor([], Object.assign({ toElementFn: this.toElementFn, caseSensitive: this.caseSensitive }, (options !== null && options !== void 0 ? options : {})));
+        return next;
+    }
+    /**
+     * (Protected) Create a like-kind trie and seed it from an iterable.
+     * @remarks Time O(ΣL), Space O(ΣL)
+     * @template RM
+     * @param [elements] - Iterable used to seed the new trie.
+     * @param [options] - Options forwarded to the constructor.
+     * @returns A like-kind Trie instance.
+     */
+    _createLike(elements = [], options) {
+        const Ctor = this.constructor;
+        return new Ctor(elements, options);
+    }
+    /**
+     * (Protected) Spawn an empty like-kind trie instance.
+     * @remarks Time O(1), Space O(1)
+     * @template RM
+     * @param [options] - Options forwarded to the constructor.
+     * @returns An empty like-kind Trie instance.
+     */
+    _spawnLike(options) {
+        return this._createLike([], options);
+    }
+    /**
+     * (Protected) Iterate all words in lexicographic order of edges.
+     * @remarks Time O(ΣL), Space O(H)
+     * @returns Iterator of words.
      */
     *_getIterator() {
         function* _dfs(node, path) {
@@ -573,19 +594,15 @@ class Trie extends base_1.IterableElementBase {
         }
         yield* _dfs(this.root, '');
     }
-    get _total() {
-        return this._size;
-    }
     /**
-     * Time Complexity: O(l), where l is the length of the input string.
-     * Space Complexity: O(1) - Constant space.
-     *
-     * @param str
-     * @protected
+     * (Protected) Normalize a string according to case sensitivity.
+     * @remarks Time O(L), Space O(L)
+     * @param str - Input string to normalize.
+     * @returns Normalized string based on caseSensitive.
      */
     _caseProcess(str) {
         if (!this._caseSensitive) {
-            str = str.toLowerCase(); // Convert str to lowercase if case-insensitive
+            str = str.toLowerCase();
         }
         return str;
     }

package/dist/interfaces/binary-tree.d.ts

@@ -1,9 +1,59 @@
 import { BinaryTreeNode } from '../data-structures';
-import type { BinaryTreeDeleteResult, BinaryTreeOptions, BTNRep, NodePredicate } from '../types';
-export interface IBinaryTree<K = any, V = any, R = object, MK = any, MV = any, MR = object> {
-    createNode(key: K, value?: BinaryTreeNode['value']): BinaryTreeNode;
-    createTree(options?: Partial<BinaryTreeOptions<K, V, R>>): IBinaryTree<K, V, R, MK, MV, MR>;
+import type { BinaryTreeDeleteResult, BinaryTreeOptions, BTNRep, DFSOrderPattern, EntryCallback, IterationType, NodeCallback, NodePredicate, OptNodeOrNull, ReduceEntryCallback, ToEntryFn } from '../types';
+/**
+ * Public, implementation-agnostic binary tree API.
+ * K = key, V = value, R = raw/record used with toEntryFn (optional).
+ * Transforming methods like `map` use method-level generics MK/MV/MR.
+ */
+export interface IBinaryTree<K = any, V = any, R extends object = object> {
+    readonly size: number;
+    readonly root: BinaryTreeNode<K, V> | null | undefined;
+    readonly isMapMode: boolean;
+    iterationType: IterationType;
+    readonly NIL: BinaryTreeNode<K, V>;
+    readonly store: Map<K, V | undefined>;
+    readonly toEntryFn?: ToEntryFn<K, V, R>;
+    readonly isDuplicate: boolean;
+    _createNode(key: K, value?: BinaryTreeNode<K, V>['value']): BinaryTreeNode<K, V>;
+    createTree(options?: Partial<BinaryTreeOptions<K, V, R>>): IBinaryTree<K, V, R>;
     add(keyOrNodeOrEntryOrRawElement: BTNRep<K, V, BinaryTreeNode<K, V>>, value?: V, count?: number): boolean;
-    addMany(nodes: Iterable<BTNRep<K, V, BinaryTreeNode<K, V>>>, values?: Iterable<V | undefined>): boolean[];
-    delete(predicate: R | BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V>>): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
+    addMany(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): boolean[];
+    delete(keyNodeEntryRawOrPredicate: R | BTNRep<K, V, BinaryTreeNode<K, V>> | NodePredicate<BinaryTreeNode<K, V> | null>): BinaryTreeDeleteResult<BinaryTreeNode<K, V>>[];
+    clear(): void;
+    isEmpty(): boolean;
+    get(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): V | undefined;
+    has(keyNodeEntryOrPredicate?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BinaryTreeNode<K, V> | null>, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): boolean;
+    hasValue(value: V): boolean;
+    find(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: unknown): [K, V | undefined] | undefined;
+    [Symbol.iterator](): IterableIterator<[K, V | undefined]>;
+    entries(): IterableIterator<[K, V | undefined]>;
+    keys(): IterableIterator<K>;
+    values(): IterableIterator<V | undefined>;
+    forEach(callbackfn: EntryCallback<K, V | undefined, void>, thisArg?: unknown): void;
+    every(callbackfn: EntryCallback<K, V | undefined, boolean>, thisArg?: unknown): boolean;
+    some(callbackfn: EntryCallback<K, V | undefined, boolean>, thisArg?: unknown): boolean;
+    reduce<U>(reducer: ReduceEntryCallback<K, V | undefined, U>, initialValue: U): U;
+    getNode(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BinaryTreeNode<K, V> | null>, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): OptNodeOrNull<BinaryTreeNode<K, V>>;
+    getLeftMost<C extends NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>>(callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): ReturnType<C>;
+    getRightMost<C extends NodeCallback<BinaryTreeNode<K, V> | undefined>>(callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): ReturnType<C>;
+    dfs<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, pattern?: DFSOrderPattern, onlyOne?: boolean, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): ReturnType<C>[];
+    dfs<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, pattern?: DFSOrderPattern, onlyOne?: boolean, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType, includeNull?: boolean): ReturnType<C>[];
+    bfs<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType, includeNull?: false): ReturnType<C>[];
+    bfs<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType, includeNull?: true): ReturnType<C>[];
+    morris<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, pattern?: DFSOrderPattern, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): ReturnType<C>[];
+    leaves<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): ReturnType<C>[];
+    listLevels<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType, includeNull?: false): ReturnType<C>[][];
+    listLevels<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType, includeNull?: true): ReturnType<C>[][];
+    getPathToRoot<C extends NodeCallback<OptNodeOrNull<BinaryTreeNode<K, V>>>>(beginNode: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, callback?: C, isReverse?: boolean): ReturnType<C>[];
+    getDepth(dist: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): number;
+    getHeight(startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): number;
+    getMinHeight(startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): number;
+    isPerfectlyBalanced(startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
+    isBST(startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): boolean;
+    search<C extends NodeCallback<BinaryTreeNode<K, V> | null>>(keyNodeEntryOrPredicate: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | NodePredicate<BinaryTreeNode<K, V> | null>, onlyOne?: boolean, callback?: C, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, iterationType?: IterationType): ReturnType<C>[];
+    clone(): this;
+    filter(predicate: EntryCallback<K, V | undefined, boolean>, thisArg?: unknown): this;
+    map<MK = K, MV = V, MR extends object = object>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): IBinaryTree<MK, MV, MR>;
+    merge(anotherTree: IBinaryTree<K, V, R>): void;
+    refill(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): void;
 }

package/dist/interfaces/graph.d.ts

@@ -2,4 +2,20 @@ import { VertexKey } from '../types';
 export interface IGraph<V, E, VO, EO> {
     createVertex(key: VertexKey, value?: V): VO;
     createEdge(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E): EO;
+    getVertex(vertexKey: VertexKey): VO | undefined;
+    hasVertex(vertexOrKey: VO | VertexKey): boolean;
+    addVertex(vertex: VO): boolean;
+    addVertex(key: VertexKey, value?: V): boolean;
+    deleteVertex(vertexOrKey: VO | VertexKey): boolean;
+    deleteEdge(edge: EO): EO | undefined;
+    getEdge(srcOrKey: VO | VertexKey, destOrKey: VO | VertexKey): EO | undefined;
+    degreeOf(vertexOrKey: VO | VertexKey): number;
+    edgeSet(): EO[];
+    edgesOf(vertexOrKey: VO | VertexKey): EO[];
+    getNeighbors(vertexOrKey: VO | VertexKey): VO[];
+    getEndsOfEdge(edge: EO): [VO, VO] | undefined;
+    isEmpty(): boolean;
+    clear(): void;
+    clone(): this;
+    filter(...args: any[]): this;
 }