min-heap-typed 1.46.2 → 1.46.5

package/dist/data-structures/hash/index.d.ts

@@ -1,6 +1,2 @@
 export * from './hash-table';
-export * from './coordinate-map';
-export * from './coordinate-set';
-export * from './tree-map';
-export * from './tree-set';
 export * from './hash-map';

package/dist/data-structures/hash/index.js

@@ -15,8 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./hash-table"), exports);
-__exportStar(require("./coordinate-map"), exports);
-__exportStar(require("./coordinate-set"), exports);
-__exportStar(require("./tree-map"), exports);
-__exportStar(require("./tree-set"), exports);
 __exportStar(require("./hash-map"), exports);

package/dist/data-structures/queue/deque.d.ts

@@ -5,39 +5,13 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import { IterableWithSizeOrLength, IterateDirection } from "../../types";
+import { IterableWithSizeOrLength } from "../../types";
 /**
  * Deque can provide random access with O(1) time complexity
  * Deque is usually more compact and efficient in memory usage because it does not require additional space to store pointers.
  * Deque may experience performance jitter, but DoublyLinkedList will not
  * Deque is implemented using a dynamic array. Inserting or deleting beyond both ends of the array may require moving elements or reallocating space.
  */
-export declare class DequeIterator<E> {
-    iterateDirection: IterateDirection;
-    index: number;
-    readonly deque: Deque<E>;
-    /**
-     * The constructor initializes the index, iterate direction, and prev/next functions for a
-     * DequeIterator object.
-     * @param {number} index - The index parameter represents the current index position of the iterator
-     * within the deque. It is a number that indicates the position of the element that the iterator is
-     * currently pointing to.
-     * @param deque - The `deque` parameter is an instance of the `Deque` class. It represents a
-     * double-ended queue data structure, which allows elements to be added or removed from both ends.
-     * @param iterateDirection - The `iterateDirection` parameter is an optional parameter that specifies
-     * the direction in which the iterator should iterate over the elements of the `deque`. It has a
-     * default value of `IterateDirection.DEFAULT`.
-     * @returns The constructor is not returning anything. It is used to initialize the properties of the
-     * object being created.
-     */
-    constructor(index: number, deque: Deque<E>, iterateDirection?: IterateDirection);
-    get current(): E;
-    set current(newElement: E);
-    isAccessible(): boolean;
-    prev(): DequeIterator<E>;
-    next(): DequeIterator<E>;
-    clone(): DequeIterator<E>;
-}
 export declare class Deque<E> {
     protected _bucketFirst: number;
     protected _firstInBucket: number;
@@ -120,28 +94,14 @@ export declare class Deque<E> {
      */
     clear(): void;
     /**
-     * The `begin()` function returns a new iterator for a deque starting from the first element.
-     * @returns A new instance of the DequeIterator class is being returned.
-     */
-    begin(): DequeIterator<E>;
-    /**
-     * The `end()` function returns a new `DequeIterator` object with the size and reference to the
-     * current deque.
-     * @returns A new instance of the DequeIterator class is being returned.
+     * The below function is a generator that yields elements from a collection one by one.
      */
-    end(): DequeIterator<E>;
+    begin(): Generator<E>;
     /**
-     * The reverseBegin function returns a new DequeIterator object that starts at the last element of
-     * the deque and iterates in reverse direction.
-     * @returns A new instance of the DequeIterator class is being returned.
+     * The function `reverseBegin()` is a generator that yields elements in reverse order starting from
+     * the last element.
      */
-    reverseBegin(): DequeIterator<E>;
-    /**
-     * The reverseEnd() function returns a new DequeIterator object that iterates over the elements of a
-     * Deque in reverse order.
-     * @returns A new instance of the DequeIterator class is being returned.
-     */
-    reverseEnd(): DequeIterator<E>;
+    reverseBegin(): Generator<E>;
     /**
      * Time Complexity - Amortized O(1) (possible reallocation)
      * Space Complexity - O(n) (due to potential resizing).
@@ -294,34 +254,6 @@ export declare class Deque<E> {
      * @returns The size of the data structure after the element has been deleted.
      */
     delete(element: E): number;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function deletes an element from a deque using an iterator and returns the next iterator.
-     * @param iter - The parameter `iter` is of type `DequeIterator<E>`. It represents an iterator object
-     * that is used to iterate over elements in a deque (double-ended queue).
-     * @returns the updated iterator after deleting an element from the deque.
-     */
-    deleteByIterator(iter: DequeIterator<E>): DequeIterator<E>;
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function `findIterator` searches for an element in a deque and returns an iterator pointing to
-     * the element if found, otherwise it returns an iterator pointing to the end of the deque.
-     * @param {E} element - The `element` parameter is the element that you want to find in the deque.
-     * @returns The method `findIterator(element: E)` returns a `DequeIterator<E>` object.
-     */
-    findIterator(element: E): DequeIterator<E>;
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)

package/dist/data-structures/queue/deque.js

@@ -7,7 +7,7 @@
  * @license MIT License
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.ObjectDeque = exports.Deque = exports.DequeIterator = void 0;
+exports.ObjectDeque = exports.Deque = void 0;
 const utils_1 = require("../../utils");
 /**
  * Deque can provide random access with O(1) time complexity
@@ -15,78 +15,6 @@ const utils_1 = require("../../utils");
  * Deque may experience performance jitter, but DoublyLinkedList will not
  * Deque is implemented using a dynamic array. Inserting or deleting beyond both ends of the array may require moving elements or reallocating space.
  */
-class DequeIterator {
-    /**
-     * The constructor initializes the index, iterate direction, and prev/next functions for a
-     * DequeIterator object.
-     * @param {number} index - The index parameter represents the current index position of the iterator
-     * within the deque. It is a number that indicates the position of the element that the iterator is
-     * currently pointing to.
-     * @param deque - The `deque` parameter is an instance of the `Deque` class. It represents a
-     * double-ended queue data structure, which allows elements to be added or removed from both ends.
-     * @param iterateDirection - The `iterateDirection` parameter is an optional parameter that specifies
-     * the direction in which the iterator should iterate over the elements of the `deque`. It has a
-     * default value of `IterateDirection.DEFAULT`.
-     * @returns The constructor is not returning anything. It is used to initialize the properties of the
-     * object being created.
-     */
-    constructor(index, deque, iterateDirection = 0 /* IterateDirection.DEFAULT */) {
-        this.index = index;
-        this.iterateDirection = iterateDirection;
-        if (this.iterateDirection === 0 /* IterateDirection.DEFAULT */) {
-            this.prev = function () {
-                if (this.index === 0) {
-                    (0, utils_1.throwRangeError)();
-                }
-                this.index -= 1;
-                return this;
-            };
-            this.next = function () {
-                if (this.index === this.deque.size) {
-                    (0, utils_1.throwRangeError)();
-                }
-                this.index += 1;
-                return this;
-            };
-        }
-        else {
-            this.prev = function () {
-                if (this.index === this.deque.size - 1) {
-                    (0, utils_1.throwRangeError)();
-                }
-                this.index += 1;
-                return this;
-            };
-            this.next = function () {
-                if (this.index === -1) {
-                    (0, utils_1.throwRangeError)();
-                }
-                this.index -= 1;
-                return this;
-            };
-        }
-        this.deque = deque;
-    }
-    get current() {
-        return this.deque.getAt(this.index);
-    }
-    set current(newElement) {
-        this.deque.setAt(this.index, newElement);
-    }
-    isAccessible() {
-        return this.index !== this.deque.size;
-    }
-    prev() {
-        return this;
-    }
-    next() {
-        return this;
-    }
-    clone() {
-        return new DequeIterator(this.index, this.deque, this.iterateDirection);
-    }
-}
-exports.DequeIterator = DequeIterator;
 class Deque {
     /**
      * The constructor initializes a data structure with a specified bucket size and populates it with
@@ -220,35 +148,25 @@ class Deque {
         this._firstInBucket = this._lastInBucket = this._bucketSize >> 1;
     }
     /**
-     * The `begin()` function returns a new iterator for a deque starting from the first element.
-     * @returns A new instance of the DequeIterator class is being returned.
-     */
-    begin() {
-        return new DequeIterator(0, this);
-    }
-    /**
-     * The `end()` function returns a new `DequeIterator` object with the size and reference to the
-     * current deque.
-     * @returns A new instance of the DequeIterator class is being returned.
+     * The below function is a generator that yields elements from a collection one by one.
      */
-    end() {
-        return new DequeIterator(this.size, this);
-    }
-    /**
-     * The reverseBegin function returns a new DequeIterator object that starts at the last element of
-     * the deque and iterates in reverse direction.
-     * @returns A new instance of the DequeIterator class is being returned.
-     */
-    reverseBegin() {
-        return new DequeIterator(this.size - 1, this, 1 /* IterateDirection.REVERSE */);
+    *begin() {
+        let index = 0;
+        while (index < this.size) {
+            yield this.getAt(index);
+            index++;
+        }
     }
     /**
-     * The reverseEnd() function returns a new DequeIterator object that iterates over the elements of a
-     * Deque in reverse order.
-     * @returns A new instance of the DequeIterator class is being returned.
+     * The function `reverseBegin()` is a generator that yields elements in reverse order starting from
+     * the last element.
      */
-    reverseEnd() {
-        return new DequeIterator(-1, this, 1 /* IterateDirection.REVERSE */);
+    *reverseBegin() {
+        let index = this.size - 1;
+        while (index >= 0) {
+            yield this.getAt(index);
+            index--;
+        }
     }
     /**
      * Time Complexity - Amortized O(1) (possible reallocation)
@@ -399,7 +317,7 @@ class Deque {
      * @returns The element at the specified position in the data structure is being returned.
      */
     getAt(pos) {
-        utils_1.rangeCheck(pos, 0, this.size - 1);
+        (0, utils_1.rangeCheck)(pos, 0, this.size - 1);
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
         return this._buckets[bucketIndex][indexInBucket];
     }
@@ -418,7 +336,7 @@ class Deque {
      * position in the data structure.
      */
     setAt(pos, element) {
-        utils_1.rangeCheck(pos, 0, this.size - 1);
+        (0, utils_1.rangeCheck)(pos, 0, this.size - 1);
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
         this._buckets[bucketIndex][indexInBucket] = element;
     }
@@ -443,7 +361,7 @@ class Deque {
      */
     insertAt(pos, element, num = 1) {
         const length = this.size;
-        utils_1.rangeCheck(pos, 0, length);
+        (0, utils_1.rangeCheck)(pos, 0, length);
         if (pos === 0) {
             while (num--)
                 this.unshift(element);
@@ -506,7 +424,7 @@ class Deque {
      * @returns The size of the data structure after the deletion operation is performed.
      */
     deleteAt(pos) {
-        utils_1.rangeCheck(pos, 0, this.size - 1);
+        (0, utils_1.rangeCheck)(pos, 0, this.size - 1);
         if (pos === 0)
             this.shift();
         else if (pos === this.size - 1)
@@ -555,46 +473,6 @@ class Deque {
         this.cut(index - 1);
         return this.size;
     }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function deletes an element from a deque using an iterator and returns the next iterator.
-     * @param iter - The parameter `iter` is of type `DequeIterator<E>`. It represents an iterator object
-     * that is used to iterate over elements in a deque (double-ended queue).
-     * @returns the updated iterator after deleting an element from the deque.
-     */
-    deleteByIterator(iter) {
-        const index = iter.index;
-        this.deleteAt(index);
-        iter = iter.next();
-        return iter;
-    }
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(n)
-     * Space Complexity: O(1)
-     *
-     * The function `findIterator` searches for an element in a deque and returns an iterator pointing to
-     * the element if found, otherwise it returns an iterator pointing to the end of the deque.
-     * @param {E} element - The `element` parameter is the element that you want to find in the deque.
-     * @returns The method `findIterator(element: E)` returns a `DequeIterator<E>` object.
-     */
-    findIterator(element) {
-        for (let i = 0; i < this.size; ++i) {
-            if (this.getAt(i) === element) {
-                return new DequeIterator(i, this);
-            }
-        }
-        return this.end();
-    }
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)

package/dist/types/data-structures/hash/hash-map.d.ts

@@ -4,3 +4,8 @@ export type HashMapLinkedNode<K, V> = {
     next: HashMapLinkedNode<K, V>;
     prev: HashMapLinkedNode<K, V>;
 };
+export type HashMapOptions<K, V> = {
+    elements: Iterable<[K, V]>;
+    hashFn: (key: K) => string;
+    objHashFn: (key: K) => object;
+};

package/dist/types/data-structures/hash/index.d.ts

@@ -1,7 +1,3 @@
-export * from './coordinate-map';
-export * from './coordinate-set';
 export * from './hash-map';
 export * from './hash-table';
-export * from './tree-map';
-export * from './tree-set';
 export type HashFunction<K> = (key: K) => number;

package/dist/types/data-structures/hash/index.js

@@ -14,9 +14,5 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./coordinate-map"), exports);
-__exportStar(require("./coordinate-set"), exports);
 __exportStar(require("./hash-map"), exports);
 __exportStar(require("./hash-table"), exports);
-__exportStar(require("./tree-map"), exports);
-__exportStar(require("./tree-set"), exports);

package/dist/utils/utils.d.ts

@@ -20,5 +20,5 @@ export declare const trampolineAsync: (fn: TrlAsyncFn) => ((...args: [...Paramet
 export declare const getMSB: (value: number) => number;
 export declare const rangeCheck: (index: number, min: number, max: number, message?: string) => void;
 export declare const throwRangeError: (message?: string) => void;
-export declare const isObjOrFunc: (input: unknown) => input is Record<string, unknown> | ((...args: any[]) => any);
+export declare const isWeakKey: (input: unknown) => input is object;
 export declare const calcMinUnitsRequired: (totalQuantity: number, unitSize: number) => number;

package/dist/utils/utils.js

@@ -9,7 +9,7 @@ var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, ge
     });
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.calcMinUnitsRequired = exports.isObjOrFunc = exports.throwRangeError = exports.rangeCheck = exports.getMSB = exports.trampolineAsync = exports.trampoline = exports.toThunk = exports.isThunk = exports.THUNK_SYMBOL = exports.arrayRemove = exports.uuidV4 = void 0;
+exports.calcMinUnitsRequired = exports.isWeakKey = exports.throwRangeError = exports.rangeCheck = exports.getMSB = exports.trampolineAsync = exports.trampoline = exports.toThunk = exports.isThunk = exports.THUNK_SYMBOL = exports.arrayRemove = exports.uuidV4 = void 0;
 const uuidV4 = function () {
     return 'xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx'.replace(/[x]/g, function (c) {
         const r = (Math.random() * 16) | 0, v = c == 'x' ? r : (r & 0x3) | 0x8;
@@ -80,10 +80,10 @@ const throwRangeError = (message = 'The value is off-limits.') => {
     throw new RangeError(message);
 };
 exports.throwRangeError = throwRangeError;
-const isObjOrFunc = (input) => {
+const isWeakKey = (input) => {
     const inputType = typeof input;
     return (inputType === 'object' && input !== null) || inputType === 'function';
 };
-exports.isObjOrFunc = isObjOrFunc;
+exports.isWeakKey = isWeakKey;
 const calcMinUnitsRequired = (totalQuantity, unitSize) => Math.floor((totalQuantity + unitSize - 1) / unitSize);
 exports.calcMinUnitsRequired = calcMinUnitsRequired;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.46.2",
+  "version": "1.46.5",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -132,6 +132,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.46.2"
+    "data-structure-typed": "^1.46.5"
   }
 }