linked-list-typed 1.51.9 → 1.52.1

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

@@ -18,30 +18,36 @@ const base_1 = require("../base");
  * 5. Managing Dynamic Data Sets: Heaps effectively manage dynamic data sets, especially when frequent access to the largest or smallest elements is required.
  * 6. Non-linear Search: While a heap allows rapid access to its largest or smallest element, it is less efficient for other operations, such as searching for a specific element, as it is not designed for these tasks.
  * 7. Efficient Sorting Algorithms: For example, heap sort. Heap sort uses the properties of a heap to sort elements.
- * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm, which use heaps to improve performance.
+ * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prime's minimum-spanning tree algorithm, which use heaps to improve performance.
  */
 class Heap extends base_1.IterableElementBase {
     /**
      * The constructor initializes a heap data structure with optional elements and options.
      * @param elements - The `elements` parameter is an iterable object that contains the initial
-     * elements to be added to the heap. It is an optional parameter and if not provided, the heap will
+     * elements to be added to the heap.
+     * It is an optional parameter, and if not provided, the heap will
      * be initialized as empty.
      * @param [options] - The `options` parameter is an optional object that can contain additional
-     * configuration options for the heap. In this case, it is used to specify a custom comparator
-     * function for comparing elements in the heap. The comparator function is used to determine the
+     * configuration options for the heap.
+     * In this case, it is used to specify a custom comparator
+     * function for comparing elements in the heap.
+     * The comparator function is used to determine the
      * order of elements in the heap.
      */
     constructor(elements = [], options) {
-        super();
-        this._comparator = (a, b) => {
-            if (!(typeof a === 'number' && typeof b === 'number')) {
-                throw new Error('The a, b params of compare function must be number');
-            }
-            else {
-                return a - b;
+        super(options);
+        this._elements = [];
+        this._DEFAULT_COMPARATOR = (a, b) => {
+            if (typeof a === 'object' || typeof b === 'object') {
+                throw TypeError(`When comparing object types, a custom comparator must be defined in the constructor's options parameter.`);
             }
+            if (a > b)
+                return 1;
+            if (a < b)
+                return -1;
+            return 0;
         };
-        this._elements = [];
+        this._comparator = this._DEFAULT_COMPARATOR;
         if (options) {
             const { comparator } = options;
             if (comparator)
@@ -49,20 +55,16 @@ class Heap extends base_1.IterableElementBase {
         }
         if (elements) {
             for (const el of elements) {
-                this.add(el);
+                if (this.toElementFn)
+                    this.add(this.toElementFn(el));
+                else
+                    this.add(el);
             }
         }
     }
-    /**
-     * The function returns the value of the _comparator property.
-     * @returns The `_comparator` property is being returned.
-     */
-    get comparator() {
-        return this._comparator;
-    }
     /**
      * The function returns an array of elements.
-     * @returns The elements array is being returned.
+     * @returns The element array is being returned.
      */
     get elements() {
         return this._elements;
@@ -90,11 +92,6 @@ class Heap extends base_1.IterableElementBase {
     static heapify(elements, options) {
         return new Heap(elements, options);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the heap.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -106,16 +103,11 @@ class Heap extends base_1.IterableElementBase {
         this._elements.push(element);
         return this._bubbleUp(this.elements.length - 1);
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     * where n is the number of elements in the heap.
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * Remove and return the top element (smallest or largest element) from the heap.
+     * Remove and return the top element (the smallest or largest element) from the heap.
      * @returns The top element or undefined if the heap is empty.
      */
     poll() {
@@ -129,10 +121,6 @@ class Heap extends base_1.IterableElementBase {
         }
         return value;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -156,10 +144,6 @@ class Heap extends base_1.IterableElementBase {
     clear() {
         this._elements = [];
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -171,10 +155,6 @@ class Heap extends base_1.IterableElementBase {
         this._elements = elements;
         return this.fix();
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -187,12 +167,7 @@ class Heap extends base_1.IterableElementBase {
         return this.elements.includes(element);
     }
     /**
-     * Time Complexity:  O(n)
-     * Space Complexity: O(1)
-     * The worst-case  O(n) This is because, in the worst case, the element to be deleted is located at the end of the heap (not the root), and after deletion, we may need to reorganize the elements by performing a sinkDown operation.
-     */
-    /**
-     * Time Complexity:  O(n)
+     * Time Complexity: O(n)
      * Space Complexity: O(1)
      *
      * The `delete` function removes an element from an array-like data structure, maintaining the order
@@ -219,11 +194,6 @@ class Heap extends base_1.IterableElementBase {
         }
         return true;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(log n)
-     * where log n is the height of the heap.
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(log n)
@@ -258,10 +228,6 @@ class Heap extends base_1.IterableElementBase {
         _dfs(0); // Traverse starting from the root node
         return result;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -272,10 +238,6 @@ class Heap extends base_1.IterableElementBase {
     toArray() {
         return [...this.elements];
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -284,14 +246,8 @@ class Heap extends base_1.IterableElementBase {
      * @returns A new Heap instance containing the same elements.
      */
     clone() {
-        const clonedHeap = new Heap([], { comparator: this.comparator });
-        clonedHeap._elements = [...this.elements];
-        return clonedHeap;
+        return new Heap(this, { comparator: this.comparator, toElementFn: this.toElementFn });
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)
@@ -301,18 +257,14 @@ class Heap extends base_1.IterableElementBase {
      */
     sort() {
         const visitedNode = [];
-        const cloned = this.clone();
+        const cloned = new Heap(this, { comparator: this.comparator });
         while (cloned.size !== 0) {
             const top = cloned.poll();
-            if (top)
+            if (top !== undefined)
                 visitedNode.push(top);
         }
         return visitedNode;
     }
-    /**
-     * Time Complexity: O(n log n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)
@@ -325,10 +277,6 @@ class Heap extends base_1.IterableElementBase {
             results.push(this._sinkDown(i, this.elements.length >> 1));
         return results;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(n)
@@ -346,7 +294,7 @@ class Heap extends base_1.IterableElementBase {
      * the filter condition specified by the `callback` function.
      */
     filter(callback, thisArg) {
-        const filteredList = new Heap();
+        const filteredList = new Heap([], { toElementFn: this.toElementFn, comparator: this.comparator });
         let index = 0;
         for (const current of this) {
             if (callback.call(thisArg, current, index, this)) {
@@ -357,31 +305,28 @@ class Heap extends base_1.IterableElementBase {
         return filteredList;
     }
     /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(n)
-     */
-    /**
-     * Time Complexity: O(n)
+     * Time Complexity: O(n log n)
      * Space Complexity: O(n)
      *
      * The `map` function creates a new heap by applying a callback function to each element of the
      * original heap.
-     * @param callback - The callback parameter is a function that will be called for each element in the
-     * original heap. It takes three arguments: the current element, the index of the current element,
-     * and the original heap itself. The callback function should return a value of type T, which will be
-     * added to the mapped heap.
-     * @param comparator - The `comparator` parameter is a function that is used to compare elements in
-     * the heap. It takes two arguments, `a` and `b`, and returns a negative number if `a` is less than
-     * `b`, a positive number if `a` is greater than `b`, or
+     * @param callback - The `callback` parameter is a function that will be called for each element in
+     * the heap. It takes three arguments: `el` (the current element), `index` (the index of the current
+     * element), and `this` (the heap itself). The callback function should return a value of
+     * @param comparator - The `comparator` parameter is a function that defines the order of the
+     * elements in the heap. It takes two elements `a` and `b` as arguments and returns a negative number
+     * if `a` should be placed before `b`, a positive number if `a` should be placed after
+     * @param [toElementFn] - The `toElementFn` parameter is an optional function that converts the raw
+     * element `RR` to the desired type `T`. It takes a single argument `rawElement` of type `RR` and
+     * returns a value of type `T`. This function is used to transform the elements of the original
      * @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 when you want to bind a
-     * specific object as the context for the callback function. If `thisArg` is not provided,
-     * `undefined` is used as
-     * @returns a new instance of the Heap class, which is created using the mapped elements from the
-     * original Heap.
-     */
-    map(callback, comparator, thisArg) {
-        const mappedHeap = new Heap([], { comparator: comparator });
+     * 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 instance of the `Heap` class with the mapped elements.
+     */
+    map(callback, comparator, toElementFn, thisArg) {
+        const mappedHeap = new Heap([], { comparator, toElementFn });
         let index = 0;
         for (const el of this) {
             mappedHeap.add(callback.call(thisArg, el, index, this));
@@ -389,6 +334,13 @@ class Heap extends base_1.IterableElementBase {
         }
         return mappedHeap;
     }
+    /**
+     * The function returns the value of the _comparator property.
+     * @returns The `_comparator` property is being returned.
+     */
+    get comparator() {
+        return this._comparator;
+    }
     /**
      * The function `_getIterator` returns an iterable iterator for the elements in the class.
      */
@@ -397,10 +349,6 @@ class Heap extends base_1.IterableElementBase {
             yield element;
         }
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -421,10 +369,6 @@ class Heap extends base_1.IterableElementBase {
         this.elements[index] = element;
         return true;
     }
-    /**
-     * Time Complexity: O(log n)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
@@ -525,10 +469,6 @@ class FibonacciHeap {
         this._min = undefined;
         this._size = 0;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -540,10 +480,6 @@ class FibonacciHeap {
     add(element) {
         return this.push(element);
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -563,10 +499,6 @@ class FibonacciHeap {
         this._size++;
         return this;
     }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -635,7 +567,7 @@ class FibonacciHeap {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * Remove and return the top element (smallest or largest element) from the heap.
+     * Remove and return the top element (the smallest or largest element) from the heap.
      * @returns The top element or undefined if the heap is empty.
      */
     poll() {
@@ -649,7 +581,7 @@ class FibonacciHeap {
      * Time Complexity: O(log n)
      * Space Complexity: O(1)
      *
-     * Remove and return the top element (smallest or largest element) from the heap.
+     * Remove and return the top element (the smallest or largest element) from the heap.
      * @returns The top element or undefined if the heap is empty.
      */
     pop() {
@@ -760,8 +692,8 @@ class FibonacciHeap {
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
-     *.
-     * Remove and return the top element (smallest or largest element) from the heap.
+     *
+     * Remove and return the top element (the smallest or largest element) from the heap.
      * @param node - The node to be removed.
      * @protected
      */
@@ -781,7 +713,7 @@ class FibonacciHeap {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * Remove and return the top element (smallest or largest element) from the heap.
+     * Remove and return the top element (the smallest or largest element) from the heap.
      * @param y
      * @param x
      * @protected
@@ -802,7 +734,7 @@ class FibonacciHeap {
      * Time Complexity: O(n log n)
      * Space Complexity: O(n)
      *
-     * Remove and return the top element (smallest or largest element) from the heap.
+     * Remove and return the top element (the smallest or largest element) from the heap.
      * @protected
      */
     _consolidate() {

package/dist/data-structures/heap/max-heap.d.ts

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import type { HeapOptions } from '../../types';
+import type { Comparator, ElementCallback, HeapOptions } from '../../types';
 import { Heap } from './heap';
 /**
  * 1. Complete Binary Tree: Heaps are typically complete binary trees, meaning every level is fully filled except possibly for the last level, which has nodes as far left as possible.
@@ -15,8 +15,54 @@ import { Heap } from './heap';
  * 5. Managing Dynamic Data Sets: Heaps effectively manage dynamic data sets, especially when frequent access to the largest or smallest elements is required.
  * 6. Non-linear Search: While a heap allows rapid access to its largest or smallest element, it is less efficient for other operations, such as searching for a specific element, as it is not designed for these tasks.
  * 7. Efficient Sorting Algorithms: For example, heap sort. Heap sort uses the properties of a heap to sort elements.
- * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm, which use heaps to improve performance.
+ * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prim's minimum-spanning tree algorithm, which use heaps to improve performance.
  */
-export declare class MaxHeap<E = any> extends Heap<E> {
-    constructor(elements?: Iterable<E>, options?: HeapOptions<E>);
+export declare class MaxHeap<E = any, R = any> extends Heap<E, R> {
+    constructor(elements?: Iterable<E> | Iterable<R>, options?: HeapOptions<E, R>);
+    /**
+     * The `clone` function returns a new instance of the `MaxHeap` class with the same properties as the
+     * current instance.
+     * @returns The `clone()` method is returning a new instance of the `MaxHeap` class with the same
+     * properties as the current instance.
+     */
+    clone(): MaxHeap<E, R>;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `filter` function creates a new MaxHeap object containing elements that pass a given callback
+     * function.
+     * @param callback - The `callback` parameter is a function that will be called for each element in
+     * the heap. It takes three arguments: the current element, the index of the current element, and the
+     * heap itself. The callback function should return a boolean value indicating whether the current
+     * element should be included in the filtered list
+     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+     * to be used as `this` when executing the `callback` function. If `thisArg` is provided, it will be
+     * passed as the `this` value to the `callback` function. If `thisArg` is
+     * @returns The `filter` method is returning a new `MaxHeap` object that contains the elements that pass
+     * the filter condition specified by the `callback` function.
+     */
+    filter(callback: ElementCallback<E, R, boolean, MaxHeap<E, R>>, thisArg?: any): MaxHeap<E, R>;
+    /**
+     * Time Complexity: O(n log n)
+     * Space Complexity: O(n)
+     *
+     * The `map` function creates a new heap by applying a callback function to each element of the
+     * original heap.
+     * @param callback - The `callback` parameter is a function that will be called for each element in
+     * the heap. It takes three arguments: `el` (the current element), `index` (the index of the current
+     * element), and `this` (the heap itself). The callback function should return a value of
+     * @param comparator - The `comparator` parameter is a function that defines the order of the
+     * elements in the heap. It takes two elements `a` and `b` as arguments and returns a negative number
+     * if `a` should be placed before `b`, a positive number if `a` should be placed after
+     * @param [toElementFn] - The `toElementFn` parameter is an optional function that converts the raw
+     * element `RR` to the desired type `T`. It takes a single argument `rawElement` of type `RR` and
+     * returns a value of type `T`. This function is used to transform the elements of the original
+     * @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 instance of the `MaxHeap` class with the mapped elements.
+     */
+    map<EM, RM>(callback: ElementCallback<E, R, EM, MaxHeap<E, R>>, comparator: Comparator<EM>, toElementFn?: (rawElement: RM) => EM, thisArg?: any): MaxHeap<EM, RM>;
 }

package/dist/data-structures/heap/max-heap.js

@@ -10,20 +10,86 @@ const heap_1 = require("./heap");
  * 5. Managing Dynamic Data Sets: Heaps effectively manage dynamic data sets, especially when frequent access to the largest or smallest elements is required.
  * 6. Non-linear Search: While a heap allows rapid access to its largest or smallest element, it is less efficient for other operations, such as searching for a specific element, as it is not designed for these tasks.
  * 7. Efficient Sorting Algorithms: For example, heap sort. Heap sort uses the properties of a heap to sort elements.
- * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm, which use heaps to improve performance.
+ * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prim's minimum-spanning tree algorithm, which use heaps to improve performance.
  */
 class MaxHeap extends heap_1.Heap {
-    constructor(elements = [], options = {
-        comparator: (a, b) => {
-            if (!(typeof a === 'number' && typeof b === 'number')) {
-                throw new Error('The a, b params of compare function must be number');
-            }
-            else {
-                return b - a;
+    constructor(elements = [], options) {
+        super(elements, Object.assign({ comparator: (a, b) => {
+                if (typeof a === 'object' || typeof b === 'object') {
+                    throw TypeError(`When comparing object types, a custom comparator must be defined in the constructor's options parameter.`);
+                }
+                if (a < b)
+                    return 1;
+                if (a > b)
+                    return -1;
+                return 0;
+            } }, options));
+    }
+    /**
+     * The `clone` function returns a new instance of the `MaxHeap` class with the same properties as the
+     * current instance.
+     * @returns The `clone()` method is returning a new instance of the `MaxHeap` class with the same
+     * properties as the current instance.
+     */
+    clone() {
+        return new MaxHeap(this, { comparator: this.comparator, toElementFn: this.toElementFn });
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `filter` function creates a new MaxHeap object containing elements that pass a given callback
+     * function.
+     * @param callback - The `callback` parameter is a function that will be called for each element in
+     * the heap. It takes three arguments: the current element, the index of the current element, and the
+     * heap itself. The callback function should return a boolean value indicating whether the current
+     * element should be included in the filtered list
+     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+     * to be used as `this` when executing the `callback` function. If `thisArg` is provided, it will be
+     * passed as the `this` value to the `callback` function. If `thisArg` is
+     * @returns The `filter` method is returning a new `MaxHeap` object that contains the elements that pass
+     * the filter condition specified by the `callback` function.
+     */
+    filter(callback, thisArg) {
+        const filteredList = new MaxHeap([], { toElementFn: this.toElementFn, comparator: this.comparator });
+        let index = 0;
+        for (const current of this) {
+            if (callback.call(thisArg, current, index, this)) {
+                filteredList.add(current);
             }
+            index++;
+        }
+        return filteredList;
+    }
+    /**
+     * Time Complexity: O(n log n)
+     * Space Complexity: O(n)
+     *
+     * The `map` function creates a new heap by applying a callback function to each element of the
+     * original heap.
+     * @param callback - The `callback` parameter is a function that will be called for each element in
+     * the heap. It takes three arguments: `el` (the current element), `index` (the index of the current
+     * element), and `this` (the heap itself). The callback function should return a value of
+     * @param comparator - The `comparator` parameter is a function that defines the order of the
+     * elements in the heap. It takes two elements `a` and `b` as arguments and returns a negative number
+     * if `a` should be placed before `b`, a positive number if `a` should be placed after
+     * @param [toElementFn] - The `toElementFn` parameter is an optional function that converts the raw
+     * element `RR` to the desired type `T`. It takes a single argument `rawElement` of type `RR` and
+     * returns a value of type `T`. This function is used to transform the elements of the original
+     * @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 instance of the `MaxHeap` class with the mapped elements.
+     */
+    map(callback, comparator, toElementFn, thisArg) {
+        const mappedHeap = new MaxHeap([], { comparator, toElementFn });
+        let index = 0;
+        for (const el of this) {
+            mappedHeap.add(callback.call(thisArg, el, index, this));
+            index++;
         }
-    }) {
-        super(elements, options);
+        return mappedHeap;
     }
 }
 exports.MaxHeap = MaxHeap;

package/dist/data-structures/heap/min-heap.d.ts

@@ -5,18 +5,64 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import type { HeapOptions } from '../../types';
+import type { Comparator, ElementCallback, HeapOptions } from '../../types';
 import { Heap } from './heap';
 /**
  * 1. Complete Binary Tree: Heaps are typically complete binary trees, meaning every level is fully filled except possibly for the last level, which has nodes as far left as possible.
- * 2. Heap Properties:  The value of each parent node is less than or equal to the value of its children.
+ * 2. MinHeap Properties:  The value of each parent node is less than or equal to the value of its children.
  * 3. Root Node Access: In a heap, the largest element (in a max heap) or the smallest element (in a min heap) is always at the root of the tree.
  * 4. Efficient Insertion and Deletion: Due to its structure, a heap allows for insertion and deletion operations in logarithmic time (O(log n)).
  * 5. Managing Dynamic Data Sets: Heaps effectively manage dynamic data sets, especially when frequent access to the largest or smallest elements is required.
  * 6. Non-linear Search: While a heap allows rapid access to its largest or smallest element, it is less efficient for other operations, such as searching for a specific element, as it is not designed for these tasks.
- * 7. Efficient Sorting Algorithms: For example, heap sort. Heap sort uses the properties of a heap to sort elements.
+ * 7. Efficient Sorting Algorithms: For example, heap sort. MinHeap sort uses the properties of a heap to sort elements.
  * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prim's minimum spanning tree algorithm, which use heaps to improve performance.
  */
-export declare class MinHeap<E = any> extends Heap<E> {
-    constructor(elements?: Iterable<E>, options?: HeapOptions<E>);
+export declare class MinHeap<E = any, R = any> extends Heap<E, R> {
+    constructor(elements?: Iterable<E> | Iterable<R>, options?: HeapOptions<E, R>);
+    /**
+     * The `clone` function returns a new instance of the `MinHeap` class with the same comparator and
+     * toElementFn as the original instance.
+     * @returns The `clone()` method is returning a new instance of the `MinHeap` class with the same
+     * properties as the current instance.
+     */
+    clone(): MinHeap<E, R>;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     *
+     * The `filter` function creates a new MinHeap object containing elements that pass a given callback
+     * function.
+     * @param callback - The `callback` parameter is a function that will be called for each element in
+     * the heap. It takes three arguments: the current element, the index of the current element, and the
+     * heap itself. The callback function should return a boolean value indicating whether the current
+     * element should be included in the filtered list
+     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value
+     * to be used as `this` when executing the `callback` function. If `thisArg` is provided, it will be
+     * passed as the `this` value to the `callback` function. If `thisArg` is
+     * @returns The `filter` method is returning a new `MinHeap` object that contains the elements that pass
+     * the filter condition specified by the `callback` function.
+     */
+    filter(callback: ElementCallback<E, R, boolean, MinHeap<E, R>>, thisArg?: any): MinHeap<E, R>;
+    /**
+     * Time Complexity: O(n log n)
+     * Space Complexity: O(n)
+     *
+     * The `map` function creates a new heap by applying a callback function to each element of the
+     * original heap.
+     * @param callback - The `callback` parameter is a function that will be called for each element in
+     * the heap. It takes three arguments: `el` (the current element), `index` (the index of the current
+     * element), and `this` (the heap itself). The callback function should return a value of
+     * @param comparator - The `comparator` parameter is a function that defines the order of the
+     * elements in the heap. It takes two elements `a` and `b` as arguments and returns a negative number
+     * if `a` should be placed before `b`, a positive number if `a` should be placed after
+     * @param [toElementFn] - The `toElementFn` parameter is an optional function that converts the raw
+     * element `RR` to the desired type `T`. It takes a single argument `rawElement` of type `RR` and
+     * returns a value of type `T`. This function is used to transform the elements of the original
+     * @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 instance of the `MinHeap` class with the mapped elements.
+     */
+    map<EM, RM>(callback: ElementCallback<E, R, EM, MinHeap<E, R>>, comparator: Comparator<EM>, toElementFn?: (rawElement: RM) => EM, thisArg?: any): MinHeap<EM, RM>;
 }