data-structure-typed 1.52.6 → 1.52.7

package/dist/mjs/data-structures/linked-list/doubly-linked-list.js

@@ -242,7 +242,7 @@ export class DoublyLinkedList extends IterableElementBase {
      * or the linked list is empty, it will return undefined.
      */
     at(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return undefined;
         let current = this.head;
         for (let i = 0; i < index; i++) {
@@ -262,7 +262,7 @@ export class DoublyLinkedList extends IterableElementBase {
      * valid range of the linked list, otherwise it returns `undefined`.
      */
     getNodeAt(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return undefined;
         let current = this.head;
         for (let i = 0; i < index; i++) {
@@ -303,13 +303,13 @@ export class DoublyLinkedList extends IterableElementBase {
      * if the index is out of bounds.
      */
     addAt(index, value) {
-        if (index < 0 || index > this.size)
+        if (index < 0 || index > this._size)
             return false;
         if (index === 0) {
             this.unshift(value);
             return true;
         }
-        if (index === this.size) {
+        if (index === this._size) {
             this.push(value);
             return true;
         }
@@ -407,13 +407,13 @@ export class DoublyLinkedList extends IterableElementBase {
      * bounds.
      */
     deleteAt(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return false;
         if (index === 0) {
             this.shift();
             return true;
         }
-        if (index === this.size - 1) {
+        if (index === this._size - 1) {
             this.pop();
             return true;
         }
@@ -469,7 +469,7 @@ export class DoublyLinkedList extends IterableElementBase {
      * @returns A boolean value is being returned.
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * Time Complexity: O(1)

package/dist/mjs/data-structures/linked-list/singly-linked-list.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { ElementCallback, SinglyLinkedListOptions } from '../../types';

package/dist/mjs/data-structures/linked-list/singly-linked-list.js

@@ -211,7 +211,7 @@ export class SinglyLinkedList extends IterableElementBase {
      * `undefined` if the index is out of bounds.
      */
     at(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return undefined;
         let current = this.head;
         for (let i = 0; i < index; i++) {
@@ -247,13 +247,13 @@ export class SinglyLinkedList extends IterableElementBase {
      * bounds.
      */
     deleteAt(index) {
-        if (index < 0 || index >= this.size)
+        if (index < 0 || index >= this._size)
             return false;
         if (index === 0) {
             this.shift();
             return true;
         }
-        if (index === this.size - 1) {
+        if (index === this._size - 1) {
             this.pop();
             return true;
         }
@@ -319,13 +319,13 @@ export class SinglyLinkedList extends IterableElementBase {
      * if the index is out of bounds.
      */
     addAt(index, value) {
-        if (index < 0 || index > this.size)
+        if (index < 0 || index > this._size)
             return false;
         if (index === 0) {
             this.unshift(value);
             return true;
         }
-        if (index === this.size) {
+        if (index === this._size) {
             this.push(value);
             return true;
         }
@@ -342,7 +342,7 @@ export class SinglyLinkedList extends IterableElementBase {
      * @returns A boolean value indicating whether the length of the object is equal to 0.
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.

package/dist/mjs/data-structures/linked-list/skip-linked-list.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { SkipLinkedListOptions } from '../../types';

package/dist/mjs/data-structures/matrix/matrix.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { MatrixOptions } from '../../types';

package/dist/mjs/data-structures/matrix/navigator.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { Direction, NavigatorParams, Turning } from '../../types';

package/dist/mjs/data-structures/matrix/navigator.js

@@ -30,7 +30,8 @@ export class Navigator {
         this._cur = cur;
         this._character = new Character(charDir, turning);
         this.onMove = onMove;
-        this.onMove && this.onMove(this._cur);
+        if (this.onMove)
+            this.onMove(this._cur);
         this._VISITED = VISITED;
         this._matrix[this._cur[0]][this._cur[1]] = this._VISITED;
     }
@@ -103,6 +104,7 @@ export class Navigator {
         }
         const [i, j] = this._cur;
         this._matrix[i][j] = this._VISITED;
-        this.onMove && this.onMove(this._cur);
+        if (this.onMove)
+            this.onMove(this._cur);
     }
 }

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

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { DequeOptions, ElementCallback, IterableWithSizeOrLength } from '../../types';
@@ -287,7 +287,7 @@ export declare class Deque<E = any, R = any> extends IterableElementBase<E, R, D
      * The `shrinkToFit` function reorganizes the elements in an array-like data structure to minimize
      * memory usage.
      * @returns Nothing is being returned. The function is using the `return` statement to exit early if
-     * `this.size` is 0, but it does not return any value.
+     * `this._size` is 0, but it does not return any value.
      */
     shrinkToFit(): void;
     /**

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

@@ -139,7 +139,7 @@ export class Deque extends IterableElementBase {
      * @returns The first element of the collection, of type E, is being returned.
      */
     get first() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         return this._buckets[this._bucketFirst][this._firstInBucket];
     }
@@ -148,7 +148,7 @@ export class Deque extends IterableElementBase {
      * @return The last element in the array
      */
     get last() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         return this._buckets[this._bucketLast][this._lastInBucket];
     }
@@ -162,7 +162,7 @@ export class Deque extends IterableElementBase {
      * @returns The size of the data structure after the element has been pushed.
      */
     push(element) {
-        if (this.size) {
+        if (this._size) {
             if (this._lastInBucket < this._bucketSize - 1) {
                 this._lastInBucket += 1;
             }
@@ -192,10 +192,10 @@ export class Deque extends IterableElementBase {
      * @returns The element that was removed from the data structure is being returned.
      */
     pop() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         const element = this._buckets[this._bucketLast][this._lastInBucket];
-        if (this.size !== 1) {
+        if (this._size !== 1) {
             if (this._lastInBucket > 0) {
                 this._lastInBucket -= 1;
             }
@@ -222,7 +222,7 @@ export class Deque extends IterableElementBase {
      * @returns The size of the data structure after the element has been added.
      */
     unshift(element) {
-        if (this.size) {
+        if (this._size) {
             if (this._firstInBucket > 0) {
                 this._firstInBucket -= 1;
             }
@@ -253,10 +253,10 @@ export class Deque extends IterableElementBase {
      * returned.
      */
     shift() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         const element = this._buckets[this._bucketFirst][this._firstInBucket];
-        if (this.size !== 1) {
+        if (this._size !== 1) {
             if (this._firstInBucket < this._bucketSize - 1) {
                 this._firstInBucket += 1;
             }
@@ -280,7 +280,7 @@ export class Deque extends IterableElementBase {
      * @returns A boolean value indicating whether the size of the object is 0 or not.
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * Time Complexity: O(1)
@@ -300,7 +300,7 @@ export class Deque extends IterableElementBase {
      */
     *begin() {
         let index = 0;
-        while (index < this.size) {
+        while (index < this._size) {
             yield this.at(index);
             index++;
         }
@@ -310,7 +310,7 @@ export class Deque extends IterableElementBase {
      * the last element.
      */
     *reverseBegin() {
-        let index = this.size - 1;
+        let index = this._size - 1;
         while (index >= 0) {
             yield this.at(index);
             index--;
@@ -327,7 +327,7 @@ export class Deque extends IterableElementBase {
      * @returns The element at the specified position in the data structure is being returned.
      */
     at(pos) {
-        rangeCheck(pos, 0, this.size - 1);
+        rangeCheck(pos, 0, this._size - 1);
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
         return this._buckets[bucketIndex][indexInBucket];
     }
@@ -342,7 +342,7 @@ export class Deque extends IterableElementBase {
      * position in the data structure.
      */
     setAt(pos, element) {
-        rangeCheck(pos, 0, this.size - 1);
+        rangeCheck(pos, 0, this._size - 1);
         const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
         this._buckets[bucketIndex][indexInBucket] = element;
         return true;
@@ -363,19 +363,19 @@ export class Deque extends IterableElementBase {
      * @returns The size of the array after the insertion is being returned.
      */
     addAt(pos, element, num = 1) {
-        const length = this.size;
+        const length = this._size;
         rangeCheck(pos, 0, length);
         if (pos === 0) {
             while (num--)
                 this.unshift(element);
         }
-        else if (pos === this.size) {
+        else if (pos === this._size) {
             while (num--)
                 this.push(element);
         }
         else {
             const arr = [];
-            for (let i = pos; i < this.size; ++i) {
+            for (let i = pos; i < this._size; ++i) {
                 arr.push(this.at(i));
             }
             this.cut(pos - 1, true);
@@ -447,7 +447,7 @@ export class Deque extends IterableElementBase {
             const newDeque = new Deque([], { bucketSize: this._bucketSize });
             if (pos < 0)
                 pos = 0;
-            for (let i = pos; i < this.size; i++) {
+            for (let i = pos; i < this._size; i++) {
                 newDeque.push(this.at(i));
             }
             return newDeque;
@@ -465,13 +465,13 @@ export class Deque extends IterableElementBase {
      * @returns The size of the data structure after the deletion operation is performed.
      */
     deleteAt(pos) {
-        rangeCheck(pos, 0, this.size - 1);
+        rangeCheck(pos, 0, this._size - 1);
         if (pos === 0)
             this.shift();
-        else if (pos === this.size - 1)
+        else if (pos === this._size - 1)
             this.pop();
         else {
-            const length = this.size - 1;
+            const length = this._size - 1;
             let { bucketIndex: curBucket, indexInBucket: curPointer } = this._getBucketAndPosition(pos);
             for (let i = pos; i < length; ++i) {
                 const { bucketIndex: nextBucket, indexInBucket: nextPointer } = this._getBucketAndPosition(pos + 1);
@@ -494,7 +494,7 @@ export class Deque extends IterableElementBase {
      * @returns The size of the data structure after the element has been deleted.
      */
     delete(element) {
-        const size = this.size;
+        const size = this._size;
         if (size === 0)
             return false;
         let i = 0;
@@ -539,12 +539,12 @@ export class Deque extends IterableElementBase {
      * @returns The size of the modified array is being returned.
      */
     unique() {
-        if (this.size <= 1) {
+        if (this._size <= 1) {
             return this;
         }
         let index = 1;
         let prev = this.at(0);
-        for (let i = 1; i < this.size; ++i) {
+        for (let i = 1; i < this._size; ++i) {
             const cur = this.at(i);
             if (cur !== prev) {
                 prev = cur;
@@ -566,11 +566,11 @@ export class Deque extends IterableElementBase {
      */
     sort(comparator) {
         const arr = [];
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             arr.push(this.at(i));
         }
         arr.sort(comparator);
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             this.setAt(i, arr[i]);
         }
         return this;
@@ -582,10 +582,10 @@ export class Deque extends IterableElementBase {
      * The `shrinkToFit` function reorganizes the elements in an array-like data structure to minimize
      * memory usage.
      * @returns Nothing is being returned. The function is using the `return` statement to exit early if
-     * `this.size` is 0, but it does not return any value.
+     * `this._size` is 0, but it does not return any value.
      */
     shrinkToFit() {
-        if (this.size === 0)
+        if (this._size === 0)
             return;
         const newBuckets = [];
         if (this._bucketFirst === this._bucketLast)
@@ -619,7 +619,7 @@ export class Deque extends IterableElementBase {
      * in the data structure. If the element is not found, it returns -1.
      */
     indexOf(element) {
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             if (this.at(i) === element) {
                 return i;
             }
@@ -710,7 +710,7 @@ export class Deque extends IterableElementBase {
      * object to be iterated over using a for...of loop.
      */
     *_getIterator() {
-        for (let i = 0; i < this.size; ++i) {
+        for (let i = 0; i < this._size; ++i) {
             yield this.at(i);
         }
     }

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

@@ -1,6 +1,6 @@
 /**
  * @license MIT
- * @copyright Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Pablo Zeng <zrwusa@gmail.com>
  * @class
  */
 import type { ElementCallback, QueueOptions } from '../../types';

package/dist/mjs/data-structures/stack/stack.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { ElementCallback, StackOptions } from '../../types';

package/dist/mjs/data-structures/trie/trie.d.ts

@@ -1,8 +1,8 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Pablo Zeng
+ * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 import type { ElementCallback, TrieOptions } from '../../types';

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

@@ -177,7 +177,7 @@ export class Trie extends IterableElementBase {
      * @return True if the size of the queue is 0
      */
     isEmpty() {
-        return this.size === 0;
+        return this._size === 0;
     }
     /**
      * Time Complexity: O(1)

package/dist/mjs/index.d.ts

@@ -2,3 +2,4 @@ export * from './data-structures';
 export * from './utils';
 export * from './interfaces';
 export * from './types';
+export * from './constants';

package/dist/mjs/index.js

@@ -2,3 +2,4 @@ export * from './data-structures';
 export * from './utils';
 export * from './interfaces';
 export * from './types';
+export * from './constants';

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

@@ -1,9 +1,9 @@
 import { BinaryTree, BinaryTreeNode } from '../data-structures';
-import type { BinaryTreeDeleteResult, BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BTNCallback, BTNKeyOrNodeOrEntry } from '../types';
+import type { BinaryTreeDeleteResult, BinaryTreeNested, BinaryTreeNodeNested, BinaryTreeOptions, BTNKeyOrNodeOrEntry, BTNPredicate } from '../types';
 export interface IBinaryTree<K = any, V = any, R = [K, V], NODE extends BinaryTreeNode<K, V, NODE> = BinaryTreeNodeNested<K, V>, TREE extends BinaryTree<K, V, R, NODE, TREE> = BinaryTreeNested<K, V, R, NODE>> {
     createNode(key: K, value?: NODE['value']): NODE;
     createTree(options?: Partial<BinaryTreeOptions<K, V, R>>): TREE;
     add(keyOrNodeOrEntryOrRawElement: BTNKeyOrNodeOrEntry<K, V, NODE>, value?: V, count?: number): boolean;
     addMany(nodes: Iterable<BTNKeyOrNodeOrEntry<K, V, NODE>>, values?: Iterable<V | undefined>): boolean[];
-    delete<C extends BTNCallback<NODE>>(identifier: ReturnType<C> | null, callback: C): BinaryTreeDeleteResult<NODE>[];
+    delete(predicate: R | BTNKeyOrNodeOrEntry<K, V, NODE> | BTNPredicate<NODE>): BinaryTreeDeleteResult<NODE>[];
 }

package/dist/mjs/types/data-structures/binary-tree/binary-tree.d.ts

@@ -1,5 +1,6 @@
 import { BinaryTree, BinaryTreeNode } from '../../../data-structures';
 import { IterationType, OptValue } from '../../common';
+import { DFSOperation } from "bst-typed";
 export type BinaryTreeNodeNested<K, V> = BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, BinaryTreeNode<K, V, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeNested<K, V, R, NODE extends BinaryTreeNode<K, V, NODE>> = BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, BinaryTree<K, V, R, NODE, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeOptions<K, V, R> = {
@@ -23,10 +24,7 @@ export type BinaryTreeDeleteResult<NODE> = {
     needBalanced: OptBTNOrNull<NODE>;
 };
 export type BTNCallback<NODE, D = any> = (node: NODE) => D;
-export declare enum DFSOperation {
-    VISIT = 0,
-    PROCESS = 1
-}
+export type BTNPredicate<NODE> = (node: NODE) => boolean;
 export type DFSStackItem<NODE> = {
     opt: DFSOperation;
     node: OptBTNOrNull<NODE>;

package/dist/mjs/types/data-structures/binary-tree/binary-tree.js

@@ -1,5 +1 @@
-export var DFSOperation;
-(function (DFSOperation) {
-    DFSOperation[DFSOperation["VISIT"] = 0] = "VISIT";
-    DFSOperation[DFSOperation["PROCESS"] = 1] = "PROCESS";
-})(DFSOperation || (DFSOperation = {}));
+export {};