data-structure-typed 1.43.3 → 1.44.1

package/dist/mjs/{src/data-structures → data-structures}/queue/deque.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
 /**
  * data-structure-typed
  *
@@ -8,16 +5,15 @@ exports.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const linked_list_1 = require("../linked-list");
+import { DoublyLinkedList } from '../linked-list';
 // O(n) time complexity of obtaining the value
 // O(1) time complexity of adding at the beginning and the end
-class Deque extends linked_list_1.DoublyLinkedList {
+export class Deque extends DoublyLinkedList {
 }
-exports.Deque = Deque;
 // O(1) time complexity of obtaining the value
 // O(n) time complexity of adding at the beginning and the end
 // todo tested slowest one
-class ObjectDeque {
+export class ObjectDeque {
     constructor(capacity) {
         if (capacity !== undefined)
             this._capacity = capacity;
@@ -184,10 +180,9 @@ class ObjectDeque {
         return this.size <= 0;
     }
 }
-exports.ObjectDeque = ObjectDeque;
 // O(1) time complexity of obtaining the value
 // O(n) time complexity of adding at the beginning and the end
-class ArrayDeque {
+export class ArrayDeque {
     _nodes = [];
     get nodes() {
         return this._nodes;
@@ -364,4 +359,3 @@ class ArrayDeque {
         return this.nodes.length === 0;
     }
 }
-exports.ArrayDeque = ArrayDeque;

package/dist/mjs/{src/data-structures → data-structures}/queue/queue.js

@@ -1,13 +1,10 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Queue = exports.LinkedListQueue = void 0;
 /**
  * @license MIT
  * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
-const linked_list_1 = require("../linked-list");
-class LinkedListQueue extends linked_list_1.SinglyLinkedList {
+import { SinglyLinkedList } from '../linked-list';
+export class LinkedListQueue extends SinglyLinkedList {
     /**
      * The enqueue function adds a value to the end of an array.
      * @param {E} value - The value parameter represents the value that you want to add to the queue.
@@ -37,8 +34,7 @@ class LinkedListQueue extends linked_list_1.SinglyLinkedList {
         return this.getFirst();
     }
 }
-exports.LinkedListQueue = LinkedListQueue;
-class Queue {
+export class Queue {
     /**
      * The constructor initializes an instance of a class with an optional array of elements and sets the offset to 0.
      * @param {E[]} [elements] - The `elements` parameter is an optional array of elements of type `E`. If provided, it
@@ -272,4 +268,3 @@ class Queue {
         }
     }
 }
-exports.Queue = Queue;

package/dist/mjs/{src/data-structures → data-structures}/stack/stack.js

@@ -1,12 +1,9 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Stack = void 0;
 /**
  * @license MIT
  * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
-class Stack {
+export class Stack {
     /**
      * The constructor initializes an array of elements, which can be provided as an optional parameter.
      * @param {E[]} [elements] - The `elements` parameter is an optional parameter of type `E[]`, which represents an array
@@ -134,4 +131,3 @@ class Stack {
         return new Stack(this.elements.slice());
     }
 }
-exports.Stack = Stack;

package/dist/mjs/{src/data-structures → data-structures}/tree/tree.js

@@ -1,7 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TreeNode = void 0;
-class TreeNode {
+export class TreeNode {
     key;
     value;
     children;
@@ -40,4 +37,3 @@ class TreeNode {
         return maxDepth;
     }
 }
-exports.TreeNode = TreeNode;

package/dist/mjs/{src/data-structures → data-structures}/trie/trie.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,13 +5,11 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Trie = exports.TrieNode = void 0;
 /**
  * TrieNode represents a node in the Trie data structure. It holds a character key, a map of children nodes,
  * and a flag indicating whether it's the end of a word.
  */
-class TrieNode {
+export class TrieNode {
     key;
     children;
     isEnd;
@@ -22,11 +19,10 @@ class TrieNode {
         this.children = new Map();
     }
 }
-exports.TrieNode = TrieNode;
 /**
  * Trie represents a Trie data structure. It provides basic Trie operations and additional methods.
  */
-class Trie {
+export class Trie {
     constructor(words, caseSensitive = true) {
         this._root = new TrieNode('');
         this._caseSensitive = caseSensitive;
@@ -328,4 +324,3 @@ class Trie {
         return str;
     }
 }
-exports.Trie = Trie;

package/dist/mjs/index.js

@@ -0,0 +1,4 @@
+export * from './data-structures';
+export * from './utils';
+export * from './interfaces';
+export * from './types';

package/dist/mjs/interfaces/index.js

@@ -0,0 +1,8 @@
+export * from './graph';
+export * from './binary-tree';
+export * from './doubly-linked-list';
+export * from './heap';
+export * from './navigator';
+export * from './priority-queue';
+export * from './segment-tree';
+export * from './singly-linked-list';

package/dist/mjs/{src/types → types}/data-structures/binary-tree/binary-tree.js

@@ -1,18 +1,15 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.FamilyPosition = exports.IterationType = void 0;
 /**
  * Enum representing different loop types.
  *
  * - `iterative`: Indicates the iterative loop type (with loops that use iterations).
  * - `recursive`: Indicates the recursive loop type (with loops that call themselves).
  */
-var IterationType;
+export var IterationType;
 (function (IterationType) {
     IterationType["ITERATIVE"] = "ITERATIVE";
     IterationType["RECURSIVE"] = "RECURSIVE";
-})(IterationType || (exports.IterationType = IterationType = {}));
-var FamilyPosition;
+})(IterationType || (IterationType = {}));
+export var FamilyPosition;
 (function (FamilyPosition) {
     FamilyPosition["ROOT"] = "ROOT";
     FamilyPosition["LEFT"] = "LEFT";
@@ -21,7 +18,7 @@ var FamilyPosition;
     FamilyPosition["ROOT_RIGHT"] = "ROOT_RIGHT";
     FamilyPosition["ISOLATED"] = "ISOLATED";
     FamilyPosition["MAL_NODE"] = "MAL_NODE";
-})(FamilyPosition || (exports.FamilyPosition = FamilyPosition = {}));
+})(FamilyPosition || (FamilyPosition = {}));
 //
 // export type BTNIdentifierOrNU<N> = BTNKey | N | null | undefined;
 //

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

@@ -0,0 +1,6 @@
+export * from './binary-tree';
+export * from './bst';
+export * from './avl-tree';
+export * from './segment-tree';
+export * from './tree-multimap';
+export * from './rb-tree';

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

@@ -0,0 +1,5 @@
+export var RBTNColor;
+(function (RBTNColor) {
+    RBTNColor[RBTNColor["RED"] = 1] = "RED";
+    RBTNColor[RBTNColor["BLACK"] = 0] = "BLACK";
+})(RBTNColor || (RBTNColor = {}));

package/dist/mjs/types/data-structures/graph/directed-graph.d.ts

@@ -0,0 +1 @@
+export type TopologicalStatus = 0 | 1 | 2;

package/dist/mjs/types/data-structures/graph/index.js

@@ -0,0 +1,3 @@
+export * from './abstract-graph';
+export * from './map-graph';
+export * from './directed-graph';

package/dist/mjs/types/data-structures/hash/hash-table.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/hash/hash-table.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/hash/tree-map.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/hash/tree-set.js

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/heap/heap.d.ts

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/heap/index.js

@@ -0,0 +1 @@
+export * from './heap';

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/heap/min-heap.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1,11 @@
+export * from './binary-tree';
+export * from './graph';
+export * from './linked-list';
+export * from './heap';
+export * from './matrix';
+export * from './hash';
+export * from './priority-queue';
+export * from './queue';
+export * from './stack';
+export * from './tree';
+export * from './trie';

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/linked-list/index.js

@@ -0,0 +1,2 @@
+export * from './singly-linked-list';
+export * from './doubly-linked-list';

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/linked-list/skip-linked-list.js

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/matrix/index.js

@@ -0,0 +1 @@
+export * from './navigator';

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/matrix/matrix2d.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/matrix/vector2d.js

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/priority-queue/index.d.ts

@@ -0,0 +1,3 @@
+export * from './priority-queue';
+export * from './min-priority-queue';
+export * from './max-priority-queue';

package/dist/mjs/types/data-structures/priority-queue/index.js

@@ -0,0 +1,3 @@
+export * from './priority-queue';
+export * from './min-priority-queue';
+export * from './max-priority-queue';

package/dist/mjs/types/data-structures/priority-queue/max-priority-queue.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/priority-queue/max-priority-queue.js

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/priority-queue/min-priority-queue.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/priority-queue/min-priority-queue.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/priority-queue/priority-queue.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1,2 @@
+export * from './queue';
+export * from './deque';

package/dist/mjs/types/data-structures/queue/index.js

@@ -0,0 +1,2 @@
+export * from './queue';
+export * from './deque';

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export * from './stack';

package/dist/mjs/types/data-structures/stack/index.js

@@ -0,0 +1 @@
+export * from './stack';

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/data-structures/stack/stack.js

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export * from './tree';

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

@@ -0,0 +1 @@
+export * from './tree';

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export * from './trie';

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

@@ -0,0 +1 @@
+export * from './trie';

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

@@ -0,0 +1 @@
+export {};

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

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/helpers.js

@@ -0,0 +1,6 @@
+export var CP;
+(function (CP) {
+    CP["lt"] = "lt";
+    CP["eq"] = "eq";
+    CP["gt"] = "gt";
+})(CP || (CP = {}));

package/dist/mjs/types/index.js

@@ -0,0 +1,3 @@
+export * from './data-structures';
+export * from './helpers';
+export * from './utils';

package/dist/mjs/types/utils/index.js

@@ -0,0 +1,2 @@
+export * from './utils';
+export * from './validate-type';

package/dist/mjs/types/utils/utils.js

@@ -0,0 +1 @@
+export {};

package/dist/mjs/types/utils/validate-type.js

@@ -0,0 +1 @@
+export {};

package/dist/mjs/utils/index.js

@@ -0,0 +1 @@
+export * from './utils';

package/dist/mjs/utils/utils.js

@@ -0,0 +1,54 @@
+export 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;
+        return v.toString(16);
+    });
+};
+export const arrayRemove = function (array, predicate) {
+    let i = -1, len = array ? array.length : 0;
+    const result = [];
+    while (++i < len) {
+        const value = array[i];
+        if (predicate(value, i, array)) {
+            result.push(value);
+            Array.prototype.splice.call(array, i--, 1);
+            len--;
+        }
+    }
+    return result;
+};
+export const THUNK_SYMBOL = Symbol('thunk');
+export const isThunk = (fnOrValue) => {
+    return typeof fnOrValue === 'function' && fnOrValue.__THUNK__ === THUNK_SYMBOL;
+};
+export const toThunk = (fn) => {
+    const thunk = () => fn();
+    thunk.__THUNK__ = THUNK_SYMBOL;
+    return thunk;
+};
+export const trampoline = (fn) => {
+    const cont = (...args) => toThunk(() => fn(...args));
+    return Object.assign((...args) => {
+        let result = fn(...args);
+        while (isThunk(result) && typeof result === 'function') {
+            result = result();
+        }
+        return result;
+    }, { cont });
+};
+export const trampolineAsync = (fn) => {
+    const cont = (...args) => toThunk(() => fn(...args));
+    return Object.assign(async (...args) => {
+        let result = await fn(...args);
+        while (isThunk(result) && typeof result === 'function') {
+            result = await result();
+        }
+        return result;
+    }, { cont });
+};
+export const getMSB = (value) => {
+    if (value <= 0) {
+        return 0;
+    }
+    return 1 << (31 - Math.clz32(value));
+};