data-structure-typed 1.43.3 → 1.44.0

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

@@ -0,0 +1,6 @@
+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/mjs/data-structures/hash/tree-map.js

@@ -0,0 +1,2 @@
+export class TreeMap {
+}

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

@@ -0,0 +1,2 @@
+export class TreeSet {
+}

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

@@ -1,13 +1,10 @@
-"use strict";
 /**
  * data-structure-typed
  * @author Kirk Qi
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.FibonacciHeap = exports.FibonacciHeapNode = exports.Heap = void 0;
-class Heap {
+export class Heap {
     constructor(options) {
         this._comparator = options.comparator;
         if (options.nodes && options.nodes.length > 0) {
@@ -329,8 +326,7 @@ class Heap {
             this.sinkDown(i);
     }
 }
-exports.Heap = Heap;
-class FibonacciHeapNode {
+export class FibonacciHeapNode {
     element;
     degree;
     left;
@@ -344,8 +340,7 @@ class FibonacciHeapNode {
         this.marked = false;
     }
 }
-exports.FibonacciHeapNode = FibonacciHeapNode;
-class FibonacciHeap {
+export class FibonacciHeap {
     constructor(comparator) {
         this.clear();
         this._comparator = comparator || this.defaultComparator;
@@ -685,4 +680,3 @@ class FibonacciHeap {
         }
     }
 }
-exports.FibonacciHeap = FibonacciHeap;

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

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

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

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,10 +5,8 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MaxHeap = void 0;
-const heap_1 = require("./heap");
-class MaxHeap extends heap_1.Heap {
+import { Heap } from './heap';
+export class MaxHeap extends Heap {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MaxHeap extends heap_1.Heap {
         super(options);
     }
 }
-exports.MaxHeap = MaxHeap;

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

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,10 +5,8 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MinHeap = void 0;
-const heap_1 = require("./heap");
-class MinHeap extends heap_1.Heap {
+import { Heap } from './heap';
+export class MinHeap extends Heap {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MinHeap extends heap_1.Heap {
         super(options);
     }
 }
-exports.MinHeap = MinHeap;

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

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

package/dist/mjs/{src/data-structures → data-structures}/linked-list/doubly-linked-list.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class DoublyLinkedListNode {
+export class DoublyLinkedListNode {
     value;
     next;
     prev;
@@ -23,8 +20,7 @@ class DoublyLinkedListNode {
         this.prev = null;
     }
 }
-exports.DoublyLinkedListNode = DoublyLinkedListNode;
-class DoublyLinkedList {
+export class DoublyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -773,4 +769,3 @@ class DoublyLinkedList {
         }
     }
 }
-exports.DoublyLinkedList = DoublyLinkedList;

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

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

package/dist/mjs/{src/data-structures → data-structures}/linked-list/singly-linked-list.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class SinglyLinkedListNode {
+export class SinglyLinkedListNode {
     value;
     next;
     /**
@@ -21,8 +18,7 @@ class SinglyLinkedListNode {
         this.next = null;
     }
 }
-exports.SinglyLinkedListNode = SinglyLinkedListNode;
-class SinglyLinkedList {
+export class SinglyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -717,4 +713,3 @@ class SinglyLinkedList {
         }
     }
 }
-exports.SinglyLinkedList = SinglyLinkedList;

package/dist/mjs/{src/data-structures → data-structures}/linked-list/skip-linked-list.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,9 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SkipList = exports.SkipListNode = void 0;
-class SkipListNode {
+export class SkipListNode {
     key;
     value;
     forward;
@@ -18,8 +15,7 @@ class SkipListNode {
         this.forward = new Array(level);
     }
 }
-exports.SkipListNode = SkipListNode;
-class SkipList {
+export class SkipList {
     /**
      * The constructor initializes a SkipList with a specified maximum level and probability.
      * @param [maxLevel=16] - The `maxLevel` parameter represents the maximum level that a skip list can have. It determines
@@ -255,4 +251,3 @@ class SkipList {
         return level;
     }
 }
-exports.SkipList = SkipList;

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

@@ -0,0 +1,4 @@
+export * from './matrix';
+export * from './vector2d';
+export * from './matrix2d';
+export * from './navigator';

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MatrixNTI2D = void 0;
 /**
  * data-structure-typed
  *
@@ -9,7 +6,7 @@ exports.MatrixNTI2D = void 0;
  * @license MIT License
  */
 // todo need to be improved
-class MatrixNTI2D {
+export class MatrixNTI2D {
     _matrix;
     /**
      * The constructor creates a matrix with the specified number of rows and columns, and initializes all elements to a
@@ -26,4 +23,3 @@ class MatrixNTI2D {
         return this._matrix;
     }
 }
-exports.MatrixNTI2D = MatrixNTI2D;

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Matrix2D = void 0;
 /**
  * data-structure-typed
  *
@@ -8,8 +5,8 @@ exports.Matrix2D = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const vector2d_1 = require("./vector2d");
-class Matrix2D {
+import { Vector2D } from './vector2d';
+export class Matrix2D {
     _matrix;
     /**
      * The constructor function initializes a Matrix2D object with either a default identity matrix, or a provided matrix
@@ -21,7 +18,7 @@ class Matrix2D {
         if (typeof value === 'undefined') {
             this._matrix = Matrix2D.identity;
         }
-        else if (value instanceof vector2d_1.Vector2D) {
+        else if (value instanceof Vector2D) {
             this._matrix = Matrix2D.identity;
             this._matrix[0][0] = value.x;
             this._matrix[1][0] = value.y;
@@ -194,7 +191,6 @@ class Matrix2D {
      * the first column of the matrix.
      */
     toVector() {
-        return new vector2d_1.Vector2D(this._matrix[0][0], this._matrix[1][0]);
+        return new Vector2D(this._matrix[0][0], this._matrix[1][0]);
     }
 }
-exports.Matrix2D = Matrix2D;

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

@@ -1,7 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Navigator = exports.Character = void 0;
-class Character {
+export class Character {
     direction;
     turn;
     /**
@@ -17,8 +14,7 @@ class Character {
         this.turn = () => new Character(turning[direction], turning);
     }
 }
-exports.Character = Character;
-class Navigator {
+export class Navigator {
     onMove;
     _matrix;
     _cur;
@@ -110,4 +106,3 @@ class Navigator {
         this.onMove && this.onMove(this._cur);
     }
 }
-exports.Navigator = Navigator;

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Vector2D = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.Vector2D = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class Vector2D {
+export class Vector2D {
     x;
     y;
     w;
@@ -290,4 +287,3 @@ class Vector2D {
         this.y = 0;
     }
 }
-exports.Vector2D = Vector2D;

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MaxPriorityQueue = void 0;
 /**
  * data-structure-typed
  *
@@ -8,8 +5,8 @@ exports.MaxPriorityQueue = void 0;
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-const priority_queue_1 = require("./priority-queue");
-class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
+import { PriorityQueue } from './priority-queue';
+export class MaxPriorityQueue extends PriorityQueue {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MaxPriorityQueue extends priority_queue_1.PriorityQueue {
         super(options);
     }
 }
-exports.MaxPriorityQueue = MaxPriorityQueue;

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

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MinPriorityQueue = void 0;
 /**
  * data-structure-typed
  *
@@ -8,8 +5,8 @@ exports.MinPriorityQueue = void 0;
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-const priority_queue_1 = require("./priority-queue");
-class MinPriorityQueue extends priority_queue_1.PriorityQueue {
+import { PriorityQueue } from './priority-queue';
+export class MinPriorityQueue extends PriorityQueue {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MinPriorityQueue extends priority_queue_1.PriorityQueue {
         super(options);
     }
 }
-exports.MinPriorityQueue = MinPriorityQueue;

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

@@ -0,0 +1,13 @@
+/**
+ * data-structure-typed
+ *
+ * @author Kirk Qi
+ * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
+ * @license MIT License
+ */
+import { Heap } from '../heap';
+export class PriorityQueue extends Heap {
+    constructor(options) {
+        super(options);
+    }
+}

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.js

@@ -0,0 +1,6 @@
+export var TopologicalProperty;
+(function (TopologicalProperty) {
+    TopologicalProperty["VAL"] = "VAL";
+    TopologicalProperty["NODE"] = "NODE";
+    TopologicalProperty["ID"] = "ID";
+})(TopologicalProperty || (TopologicalProperty = {}));

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.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 {};