data-structure-typed 1.37.4 → 1.37.5

package/lib/data-structures/binary-tree/binary-indexed-tree.js

@@ -5,65 +5,253 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
+import { getMSB } from '../../utils';
 export class BinaryIndexedTree {
     /**
-     * The constructor initializes an array with a specified length and fills it with zeros.
-     * @param {number} n - The parameter `n` represents the size of the array that will be used to store the sum tree. The
-     * sum tree is a binary tree data structure used to efficiently calculate the sum of a range of elements in an array.
-     * The size of the sum tree array is `n + 1` because
+     * The constructor initializes the properties of an object, including default frequency, maximum
+     * value, a freqMap data structure, the most significant bit, and the count of negative frequencies.
+     * @param  - - `frequency`: The default frequency value. It is optional and has a default
+     * value of 0.
      */
-    constructor(n) {
-        this._sumTree = new Array(n + 1).fill(0);
+    constructor({ frequency = 0, max }) {
+        this._freq = frequency;
+        this._max = max;
+        this._freqMap = { 0: 0 };
+        this._msb = getMSB(max);
+        this._negativeCount = frequency < 0 ? max : 0;
     }
-    get sumTree() {
-        return this._sumTree;
+    get freqMap() {
+        return this._freqMap;
     }
-    static lowBit(x) {
-        return x & -x;
+    set freqMap(value) {
+        this._freqMap = value;
+    }
+    get msb() {
+        return this._msb;
+    }
+    set msb(value) {
+        this._msb = value;
+    }
+    get negativeCount() {
+        return this._negativeCount;
+    }
+    set negativeCount(value) {
+        this._negativeCount = value;
+    }
+    get freq() {
+        return this._freq;
+    }
+    get max() {
+        return this._max;
+    }
+    /**
+     * The function "readSingle" reads a single number from a specified index.
+     * @param {number} index - The `index` parameter is a number that represents the index of an element in a
+     * collection or array.
+     * @returns a number.
+     */
+    readSingle(index) {
+        this._checkIndex(index);
+        return this._readSingle(index);
     }
     /**
-     * The update function updates the values in a binary indexed tree by adding a delta value to the specified index and
-     * its ancestors.
-     * @param {number} i - The parameter `i` represents the index of the element in the `_sumTree` array that needs to be
-     * updated.
-     * @param {number} delta - The "delta" parameter represents the change in value that needs to be added to the element
-     * at index "i" in the "_sumTree" array.
+     * The "update" function updates the value at a given index by adding a delta and triggers a callback
+     * to notify of the change.
+     * @param {number} position - The `index` parameter represents the index of the element that needs to be
+     * updated in the data structure.
+     * @param {number} change - The "delta" parameter represents the change in value that needs to be
+     * applied to the frequency at the specified index.
      */
-    update(i, delta) {
-        while (i < this._sumTree.length) {
-            this._sumTree[i] += delta;
-            i += BinaryIndexedTree.lowBit(i);
+    update(position, change) {
+        this._checkIndex(position);
+        const freqCur = this._readSingle(position);
+        this._update(position, change);
+        this._updateNegativeCount(freqCur, freqCur + change);
+    }
+    /**
+     * The function "writeSingle" checks the index and writes a single value with a given frequency.
+     * @param {number} index - The `index` parameter is a number that represents the index of an element. It
+     * is used to identify the specific element that needs to be written.
+     * @param {number} freq - The `freq` parameter represents the frequency value that needs to be
+     * written.
+     */
+    writeSingle(index, freq) {
+        this._checkIndex(index);
+        this._writeSingle(index, freq);
+    }
+    /**
+     * The read function takes a count parameter, checks if it is an integer, and returns the result of
+     * calling the _read function with the count parameter clamped between 0 and the maximum value.
+     * @param {number} count - The `count` parameter is a number that represents the number of items to
+     * read.
+     * @returns a number.
+     */
+    read(count) {
+        if (!Number.isInteger(count)) {
+            throw new Error('Invalid count');
         }
+        return this._read(Math.max(Math.min(count, this.max), 0));
     }
     /**
-     * The function calculates the prefix sum of an array using a binary indexed tree.
-     * @param {number} i - The parameter "i" in the function "getPrefixSum" represents the index of the element in the
-     * array for which we want to calculate the prefix sum.
-     * @returns The function `getPrefixSum` returns the prefix sum of the elements in the binary indexed tree up to index
-     * `i`.
+     * The function returns the lower bound of a non-descending sequence that sums up to a given number.
+     * @param {number} sum - The `sum` parameter is a number that represents the target sum that we want
+     * to find in the sequence.
+     * @returns The lowerBound function is returning a number.
      */
-    getPrefixSum(i) {
-        let sum = 0;
-        while (i > 0) {
-            sum += this._sumTree[i];
-            i -= BinaryIndexedTree.lowBit(i);
+    lowerBound(sum) {
+        if (this.negativeCount > 0) {
+            throw new Error('Sequence is not non-descending');
+        }
+        return this._binarySearch(sum, (x, y) => x < y);
+    }
+    /**
+     * The upperBound function returns the index of the first element in a sequence that is greater than
+     * or equal to a given sum.
+     * @param {number} sum - The "sum" parameter is a number that represents the target sum that we want
+     * to find in the sequence.
+     * @returns The upperBound function is returning a number.
+     */
+    upperBound(sum) {
+        if (this.negativeCount > 0) {
+            throw new Error('Must not be descending');
+        }
+        return this._binarySearch(sum, (x, y) => x <= y);
+    }
+    /**
+     * The function returns the value of a specific index in a freqMap data structure, or a default value if
+     * the index is not found.
+     * @param {number} index - The `index` parameter is a number that represents the index of a node in a
+     * freqMap data structure.
+     * @returns a number.
+     */
+    _getFrequency(index) {
+        if (index in this.freqMap) {
+            return this.freqMap[index];
+        }
+        return this.freq * (index & -index);
+    }
+    /**
+     * The function _updateFrequency adds a delta value to the element at the specified index in the freqMap array.
+     * @param {number} index - The index parameter is a number that represents the index of the freqMap
+     * element that needs to be updated.
+     * @param {number} delta - The `delta` parameter represents the change in value that needs to be
+     * added to the freqMap at the specified `index`.
+     */
+    _updateFrequency(index, delta) {
+        this.freqMap[index] = this._getFrequency(index) + delta;
+    }
+    /**
+     * The function checks if the given index is valid and within the range.
+     * @param {number} index - The parameter "index" is of type number and represents the index value
+     * that needs to be checked.
+     */
+    _checkIndex(index) {
+        if (!Number.isInteger(index)) {
+            throw new Error('Invalid index: Index must be an integer.');
+        }
+        if (index < 0 || index >= this.max) {
+            throw new Error('Index out of range: Index must be within the range [0, this.max).');
+        }
+    }
+    /**
+     * The function calculates the sum of elements in an array up to a given index using a binary indexed
+     * freqMap.
+     * @param {number} index - The `index` parameter is a number that represents the index of an element in a
+     * data structure.
+     * @returns a number.
+     */
+    _readSingle(index) {
+        index = index + 1;
+        let sum = this._getFrequency(index);
+        const z = index - (index & -index);
+        index--;
+        while (index !== z) {
+            sum -= this._getFrequency(index);
+            index -= index & -index;
         }
         return sum;
     }
     /**
-     * The function `getRangeSum` calculates the sum of a range of numbers in an array.
-     * @param {number} start - The start parameter is the starting index of the range for which we want to calculate the
-     * sum.
-     * @param {number} end - The "end" parameter represents the ending index of the range for which we want to calculate
-     * the sum.
-     * @returns the sum of the elements in the range specified by the start and end indices.
+     * The function `_updateNegativeCount` updates a counter based on changes in frequency values.
+     * @param {number} freqCur - The current frequency value.
+     * @param {number} freqNew - The freqNew parameter represents the new frequency value.
      */
-    getRangeSum(start, end) {
-        if (!(0 <= start && start <= end && end <= this._sumTree.length))
-            throw 'Index out of bounds';
-        return this.getPrefixSum(end) - this.getPrefixSum(start);
+    _updateNegativeCount(freqCur, freqNew) {
+        if (freqCur < 0 && freqNew >= 0) {
+            this.negativeCount--;
+        }
+        else if (freqCur >= 0 && freqNew < 0) {
+            this.negativeCount++;
+        }
     }
-    _setSumTree(value) {
-        this._sumTree = value;
+    /**
+     * The `_update` function updates the values in a binary indexed freqMap starting from a given index and
+     * propagating the changes to its parent nodes.
+     * @param {number} index - The `index` parameter is a number that represents the index of the element in
+     * the data structure that needs to be updated.
+     * @param {number} delta - The `delta` parameter represents the change in value that needs to be
+     * applied to the elements in the data structure.
+     */
+    _update(index, delta) {
+        index = index + 1;
+        while (index <= this.max) {
+            this._updateFrequency(index, delta);
+            index += index & -index;
+        }
+    }
+    /**
+     * The `_writeSingle` function updates the frequency at a specific index and triggers a callback if
+     * the frequency has changed.
+     * @param {number} index - The `index` parameter is a number that represents the index of the element
+     * being modified or accessed.
+     * @param {number} freq - The `freq` parameter represents the new frequency value that needs to be
+     * written to the specified index `index`.
+     */
+    _writeSingle(index, freq) {
+        const freqCur = this._readSingle(index);
+        this._update(index, freq - freqCur);
+        this._updateNegativeCount(freqCur, freq);
+    }
+    /**
+     * The `_read` function calculates the sum of values in a binary freqMap up to a given count.
+     * @param {number} count - The `count` parameter is a number that represents the number of elements
+     * to read from the freqMap.
+     * @returns the sum of the values obtained from calling the `_getFrequency` method for each index in the
+     * range from `count` to 1.
+     */
+    _read(count) {
+        let index = count;
+        let sum = 0;
+        while (index) {
+            sum += this._getFrequency(index);
+            index -= index & -index;
+        }
+        return sum;
+    }
+    /**
+     * The function `_binarySearch` performs a binary search to find the largest number that satisfies a given
+     * condition.
+     * @param {number} sum - The sum parameter is a number that represents the target sum value.
+     * @param before - The `before` parameter is a function that takes two numbers `x` and `y` as
+     * arguments and returns a boolean value. It is used to determine if `x` is less than or equal to
+     * `y`. The purpose of this function is to compare two numbers and determine their order.
+     * @returns the value of the variable "left".
+     */
+    _binarySearch(sum, before) {
+        let left = 0;
+        let right = this.msb << 1;
+        let sumT = sum;
+        while (right > left + 1) {
+            const middle = (left + right) >> 1;
+            const sumM = this._getFrequency(middle);
+            if (middle <= this.max && before(sumM, sumT)) {
+                sumT -= sumM;
+                left = middle;
+            }
+            else {
+                right = middle;
+            }
+        }
+        return left;
     }
 }

package/{dist/types/data-structures → lib/types/data-structures/binary-tree}/avl-tree.d.ts

@@ -1,4 +1,4 @@
-import { AVLTreeNode } from '../../data-structures';
+import { AVLTreeNode } from '../../../data-structures';
 import { BSTOptions } from './bst';
 export type AVLTreeNodeNested<T> = AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type AVLTreeOptions = BSTOptions & {};

package/lib/types/data-structures/binary-tree/avl-tree.js

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

package/lib/types/data-structures/binary-tree/binary-indexed-tree.d.ts

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

package/lib/types/data-structures/binary-tree/binary-indexed-tree.js

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

package/lib/types/data-structures/{binary-tree.d.ts → binary-tree/binary-tree.d.ts}

@@ -1,4 +1,4 @@
-import { BinaryTreeNode } from '../../data-structures/binary-tree';
+import { BinaryTreeNode } from '../../../data-structures';
 /**
  * Enum representing different loop types.
  *
@@ -18,17 +18,13 @@ export declare enum FamilyPosition {
     ISOLATED = "ISOLATED",
     MAL_NODE = "MAL_NODE"
 }
-export type BinaryTreeNodePropertyName = 'key' | 'val';
-export type NodeOrPropertyName = 'node' | BinaryTreeNodePropertyName;
 export type BinaryTreeNodeKey = number;
 export type BFSCallback<N> = (node: N, level?: number) => any;
 export type BFSCallbackReturn<N> = ReturnType<BFSCallback<N>>;
-export type BinaryTreeNodeProperty<N extends BinaryTreeNode<N['val'], N>> = N['val'] | N | number | BinaryTreeNodeKey;
 export type BinaryTreeDeletedResult<N> = {
     deleted: N | null | undefined;
     needBalanced: N | null;
 };
-export type BinaryTreeNodeProperties<N extends BinaryTreeNode<N['val'], N>> = BinaryTreeNodeProperty<N>[];
 export type BinaryTreeNodeNested<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeOptions = {
     iterationType?: IterationType;

package/lib/types/data-structures/{bst.d.ts → binary-tree/bst.d.ts}

@@ -1,4 +1,4 @@
-import { BSTNode } from '../../data-structures/binary-tree';
+import { BSTNode } from '../../../data-structures';
 import type { BinaryTreeNodeKey, BinaryTreeOptions } from './binary-tree';
 export type BSTComparator = (a: BinaryTreeNodeKey, b: BinaryTreeNodeKey) => number;
 export type BSTNodeNested<T> = BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;

package/lib/types/data-structures/binary-tree/index.d.ts

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

package/lib/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-multiset';
+export * from './rb-tree';

package/lib/types/data-structures/{rb-tree.d.ts → binary-tree/rb-tree.d.ts}

@@ -1,5 +1,5 @@
 import { BinaryTreeOptions } from './binary-tree';
-import { RBTreeNode } from '../../data-structures/binary-tree';
+import { RBTreeNode } from '../../../data-structures';
 export declare enum RBColor {
     RED = "RED",
     BLACK = "BLACK"

package/lib/types/data-structures/binary-tree/segment-tree.js

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

package/lib/types/data-structures/{tree-multiset.d.ts → binary-tree/tree-multiset.d.ts}

@@ -1,4 +1,4 @@
-import { TreeMultisetNode } from '../../data-structures/binary-tree';
+import { TreeMultisetNode } from '../../../data-structures';
 import { AVLTreeOptions } from './avl-tree';
 export type TreeMultisetNodeNested<T> = TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type TreeMultisetOptions = Omit<AVLTreeOptions, 'isMergeDuplicatedNodeByKey'> & {};

package/lib/types/data-structures/binary-tree/tree-multiset.js

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

package/lib/types/data-structures/graph/abstract-graph.js

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

package/lib/types/data-structures/graph/index.d.ts

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

package/lib/types/data-structures/graph/index.js

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

package/lib/types/data-structures/graph/map-graph.js

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

package/lib/types/data-structures/graph/undirected-graph.d.ts

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

package/lib/types/data-structures/graph/undirected-graph.js

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

package/lib/types/data-structures/hash/coordinate-map.d.ts

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

package/lib/types/data-structures/hash/coordinate-map.js

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

package/lib/types/data-structures/hash/coordinate-set.d.ts

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

package/lib/types/data-structures/hash/coordinate-set.js

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

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

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

package/lib/types/data-structures/hash/hash-map.js

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

package/lib/types/data-structures/hash/hash-table.d.ts

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

package/lib/types/data-structures/hash/hash-table.js

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

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

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

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

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

package/lib/types/data-structures/hash/tree-map.js

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

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

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

package/lib/types/data-structures/hash/tree-set.js

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

package/lib/types/data-structures/heap/heap.d.ts

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

package/lib/types/data-structures/heap/heap.js

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

package/lib/types/data-structures/heap/index.d.ts

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

package/lib/types/data-structures/heap/index.js

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

package/lib/types/data-structures/heap/max-heap.d.ts

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

package/lib/types/data-structures/heap/max-heap.js

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

package/lib/types/data-structures/heap/min-heap.d.ts

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

package/lib/types/data-structures/heap/min-heap.js

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

package/lib/types/data-structures/index.d.ts

@@ -1,16 +1,11 @@
 export * from './binary-tree';
-export * from './bst';
-export * from './avl-tree';
-export * from './segment-tree';
-export * from './tree-multiset';
-export * from './abstract-graph';
-export * from './map-graph';
-export * from './rb-tree';
-export * from './directed-graph';
+export * from './graph';
+export * from './linked-list';
 export * from './heap';
-export * from './singly-linked-list';
-export * from './doubly-linked-list';
-export * from './navigator';
+export * from './matrix';
 export * from './hash';
-export type MapCallback<N> = (node: N) => any;
-export type MapCallbackReturn<N> = ReturnType<MapCallback<N>>;
+export * from './priority-queue';
+export * from './queue';
+export * from './stack';
+export * from './tree';
+export * from './trie';

package/lib/types/data-structures/index.js

@@ -1,14 +1,11 @@
 export * from './binary-tree';
-export * from './bst';
-export * from './avl-tree';
-export * from './segment-tree';
-export * from './tree-multiset';
-export * from './abstract-graph';
-export * from './map-graph';
-export * from './rb-tree';
-export * from './directed-graph';
+export * from './graph';
+export * from './linked-list';
 export * from './heap';
-export * from './singly-linked-list';
-export * from './doubly-linked-list';
-export * from './navigator';
+export * from './matrix';
 export * from './hash';
+export * from './priority-queue';
+export * from './queue';
+export * from './stack';
+export * from './tree';
+export * from './trie';

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

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

package/lib/types/data-structures/linked-list/doubly-linked-list.js

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

package/lib/types/data-structures/linked-list/index.d.ts

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

package/lib/types/data-structures/linked-list/index.js

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

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

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

package/lib/types/data-structures/linked-list/singly-linked-list.js

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

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

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

package/lib/types/data-structures/linked-list/skip-linked-list.js

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

package/lib/types/data-structures/matrix/index.d.ts

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

package/lib/types/data-structures/matrix/index.js

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

package/lib/types/data-structures/matrix/matrix.d.ts

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

package/lib/types/data-structures/matrix/matrix.js

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

package/lib/types/data-structures/matrix/matrix2d.d.ts

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

package/lib/types/data-structures/matrix/matrix2d.js

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

package/lib/types/data-structures/matrix/navigator.js

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

package/lib/types/data-structures/matrix/vector2d.d.ts

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

package/lib/types/data-structures/matrix/vector2d.js

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

package/lib/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/lib/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/lib/types/data-structures/priority-queue/max-priority-queue.d.ts

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

package/lib/types/data-structures/priority-queue/max-priority-queue.js

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

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

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

package/lib/types/data-structures/priority-queue/min-priority-queue.js

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

package/lib/types/data-structures/priority-queue/priority-queue.d.ts

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

package/lib/types/data-structures/priority-queue/priority-queue.js

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