data-structure-typed 1.49.5 → 1.49.7

package/test/performance/data-structures/trie/trie.test.ts

@@ -9,14 +9,10 @@ const randomWords = getRandomWords(HUNDRED_THOUSAND, false);
 
 suite
   .add(`${HUNDRED_THOUSAND.toLocaleString()} push`, () => {
-    for (let i = 0; i < randomWords.length; i++) {
-      trie.add(randomWords[i]);
-    }
+    for (let i = 0; i < randomWords.length; i++) trie.add(randomWords[i]);
   })
   .add(`${HUNDRED_THOUSAND.toLocaleString()} getWords`, () => {
-    for (let i = 0; i < randomWords.length; i++) {
-      trie.getWords(randomWords[i]);
-    }
+    for (let i = 0; i < randomWords.length; i++) trie.getWords(randomWords[i]);
   });
 
 export { suite };

package/test/unit/data-structures/binary-tree/binary-tree.test.ts

@@ -106,7 +106,8 @@ describe('BinaryTree', () => {
   it('should delete nodes', () => {
     expect(tree.getHeight(tree.root, IterationType.ITERATIVE)).toBe(-1);
     expect(tree.getMinHeight()).toBe(-1);
-    const node1 = tree.add(1);
+    const node1 = tree.createNode(1);
+    tree.add(node1);
     expect(tree.size).toBe(1);
 
     const leftChild = new BinaryTreeNode<number>(2);
@@ -224,15 +225,15 @@ describe('BinaryTree', () => {
       new BinaryTreeNode(4, 4)
     ]);
 
-    expect(tree.isSubtreeBST(tree.getNode(4), IterationType.RECURSIVE)).toBe(true);
-    expect(tree.isSubtreeBST(tree.getNode(4), IterationType.ITERATIVE)).toBe(true);
+    expect(tree.isBST(tree.getNode(4), IterationType.RECURSIVE)).toBe(true);
+    expect(tree.isBST(tree.getNode(4), IterationType.ITERATIVE)).toBe(true);
   });
 
   it('should isSubtreeBST', () => {
     tree.addMany([4, 2, 6, 1, 3, 5, 7, 4]);
 
-    expect(tree.isSubtreeBST(tree.getNode(4), IterationType.RECURSIVE)).toBe(true);
-    expect(tree.isSubtreeBST(tree.getNode(4), IterationType.ITERATIVE)).toBe(true);
+    expect(tree.isBST(tree.getNode(4), IterationType.RECURSIVE)).toBe(true);
+    expect(tree.isBST(tree.getNode(4), IterationType.ITERATIVE)).toBe(true);
     expect(tree.getNodes(2, undefined, false, null)).toEqual([]);
     expect(tree.getNodes(tree.getNodeByKey(2), undefined, false, tree.root)).toEqual([tree.getNodeByKey(2)]);
   });

package/test/unit/data-structures/binary-tree/bst.test.ts

@@ -1,4 +1,4 @@
-import { BinaryTreeNode, BST, BSTNode, CP, IterationType } from '../../../../src';
+import { BinaryTreeNode, BST, BSTNode, BSTVariant, CP, IterationType } from '../../../../src';
 import { isDebugTest } from '../../../config';
 
 const isDebug = isDebugTest;
@@ -47,6 +47,8 @@ describe('BST operations test', () => {
     const leftMost = bst.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
+    expect(bst.isBST()).toBe(true);
+
     const node15 = bst.getNode(15);
     const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
@@ -795,6 +797,20 @@ describe('BST operations test recursively', () => {
   });
 });
 
+describe('BST isBST', function () {
+  test('isBST', () => {
+    const bst = new BST<number, number>();
+    bst.addMany([1, 2, 3, 9, 8, 5, 6, 7, 4]);
+    expect(bst.isBST()).toBe(true);
+  });
+
+  test('isBST when variant is Max', () => {
+    const bst = new BST<number, number>([1, 2, 3, 9, 8, 5, 6, 7, 4], { variant: BSTVariant.INVERSE });
+    bst.addMany([1, 2, 3, 9, 8, 5, 6, 7, 4]);
+    expect(bst.isBST()).toBe(true);
+  });
+});
+
 describe('BST Performance test', function () {
   const bst = new BST<number, number>();
   const inputSize = 10000; // Adjust input sizes as needed

package/test/unit/data-structures/linked-list/skip-list.test.ts

@@ -32,7 +32,7 @@ describe('SkipList', () => {
 
     skipList.delete(2);
 
-    expect(skipList.get(2)).toBeUndefined(); // 修改这里的断言
+    expect(skipList.get(2)).toBeUndefined();
   });
 
   it('should handle random data correctly', () => {

package/test/unit/data-structures/queue/deque.test.ts

@@ -231,10 +231,10 @@ describe('Deque - Additional Operations', () => {
 });
 describe('Deque - push Method', () => {
   let deque: Deque<number>;
-  const bucketSize = 10; // 假设的 bucket 大小
+  const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], bucketSize);
+    deque = new Deque<number>([], { bucketSize });
   });
 
   test('push should add an element when deque is empty', () => {
@@ -276,7 +276,7 @@ describe('Deque - pop Method', () => {
   const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], bucketSize);
+    deque = new Deque<number>([], { bucketSize });
   });
 
   test('pop should remove and return the last element', () => {
@@ -307,7 +307,7 @@ describe('Deque - unshift Method', () => {
   const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], bucketSize);
+    deque = new Deque<number>([], { bucketSize });
   });
 
   test('unshift should add an element to the beginning when deque is empty', () => {
@@ -339,7 +339,7 @@ describe('Deque - shift Method', () => {
   const bucketSize = 10;
 
   beforeEach(() => {
-    deque = new Deque<number>([], bucketSize);
+    deque = new Deque<number>([], { bucketSize });
   });
 
   test('shift should remove and return the first element', () => {

package/test/unit/data-structures/trie/trie.test.ts

@@ -778,7 +778,7 @@ describe('Trie operations', () => {
   });
 
   it('Case Sensitivity', () => {
-    const caseInsensitiveTrie = new Trie(['apple', 'Banana'], false);
+    const caseInsensitiveTrie = new Trie(['apple', 'Banana'], { caseSensitive: false });
     expect(caseInsensitiveTrie.has('APPLE')).toBe(true);
     expect(caseInsensitiveTrie.has('banana')).toBe(true);
     expect(caseInsensitiveTrie.has('Cherry')).toBe(false);

package/dist/cjs/data-structures/hash/hash-table.d.ts

@@ -1,108 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-import type { HashFunction } from '../../types';
-export declare class HashTableNode<K = any, V = any> {
-    key: K;
-    value: V;
-    next: HashTableNode<K, V> | undefined;
-    constructor(key: K, value: V);
-}
-export declare class HashTable<K = any, V = any> {
-    protected static readonly DEFAULT_CAPACITY = 16;
-    protected static readonly LOAD_FACTOR = 0.75;
-    constructor(capacity?: number, hashFn?: HashFunction<K>);
-    protected _capacity: number;
-    get capacity(): number;
-    protected _size: number;
-    get size(): number;
-    protected _buckets: Array<HashTableNode<K, V> | undefined>;
-    get buckets(): Array<HashTableNode<K, V> | undefined>;
-    protected _hashFn: HashFunction<K>;
-    get hashFn(): HashFunction<K>;
-    /**
-     * The set function adds a key-value pair to the hash table, handling collisions and resizing if necessary.
-     * @param {K} key - The key parameter represents the key of the key-value pair that you want to insert into the hash
-     * table. It is of type K, which is a generic type representing the key's data type.
-     * @param {V} value - The parameter `value` represents the value that you want to associate with the given key in the hash
-     * table.
-     * @returns Nothing is being returned. The return type of the `put` method is `void`, which means it does not return any
-     * value.
-     */
-    set(key: K, value: V): void;
-    /**
-     * The `get` function retrieves the value associated with a given key from a hash table.
-     * @param {K} key - The `key` parameter represents the key of the element that we want to retrieve from the data
-     * structure.
-     * @returns The method is returning the value associated with the given key if it exists in the hash table. If the key is
-     * not found, it returns `undefined`.
-     */
-    get(key: K): V | undefined;
-    /**
-     * The delete function removes a key-value pair from a hash table.
-     * @param {K} key - The `key` parameter represents the key of the key-value pair that needs to be removed from the hash
-     * table.
-     * @returns Nothing is being returned. The `delete` method has a return type of `void`, which means it does not return
-     * any value.
-     */
-    delete(key: K): void;
-    [Symbol.iterator](): Generator<[K, V], void, undefined>;
-    forEach(callback: (entry: [K, V], index: number, table: HashTable<K, V>) => void): void;
-    filter(predicate: (entry: [K, V], index: number, table: HashTable<K, V>) => boolean): HashTable<K, V>;
-    map<T>(callback: (entry: [K, V], index: number, table: HashTable<K, V>) => T): HashTable<K, T>;
-    reduce<T>(callback: (accumulator: T, entry: [K, V], index: number, table: HashTable<K, V>) => T, initialValue: T): T;
-    /**
-     * The function `_defaultHashFn` calculates the hash value of a given key and returns the remainder when divided by the
-     * capacity of the data structure.
-     * @param {K} key - The `key` parameter is the input value that needs to be hashed. It can be of any type, but in this
-     * code snippet, it is checked whether the key is a string or an object. If it is a string, the `_murmurStringHashFn`
-     * function is used to
-     * @returns the hash value of the key modulo the capacity of the data structure.
-     */
-    protected _defaultHashFn(key: K): number;
-    /**
-     * The `_multiplicativeStringHashFn` function calculates a hash value for a given string key using the multiplicative
-     * string hash function.
-     * @param {K} key - The `key` parameter is the input value for which we want to calculate the hash. It can be of any
-     * type, as it is generic (`K`). The function converts the `key` to a string using the `String()` function.
-     * @returns a number, which is the result of the multiplicative string hash function applied to the input key.
-     */
-    protected _multiplicativeStringHashFn<K>(key: K): number;
-    /**
-     * The function `_murmurStringHashFn` calculates a hash value for a given string key using the MurmurHash algorithm.
-     * @param {K} key - The `key` parameter is the input value for which you want to calculate the hash. It can be of any
-     * type, but it will be converted to a string using the `String()` function before calculating the hash.
-     * @returns a number, which is the hash value calculated for the given key.
-     */
-    protected _murmurStringHashFn<K>(key: K): number;
-    /**
-     * The _hash function takes a key and returns a number.
-     * @param {K} key - The parameter "key" is of type K, which represents the type of the key that will be hashed.
-     * @returns The hash function is returning a number.
-     */
-    protected _hash(key: K): number;
-    /**
-     * The function calculates a hash value for a given string using the djb2 algorithm.
-     * @param {string} key - The `key` parameter in the `stringHash` function is a string value that represents the input for
-     * which we want to calculate the hash value.
-     * @returns a number, which is the hash value of the input string.
-     */
-    protected _stringHash(key: string): number;
-    /**
-     * The function `_objectHash` takes a key and returns a hash value, using a custom hash function for objects.
-     * @param {K} key - The parameter "key" is of type "K", which means it can be any type. It could be a string, number,
-     * boolean, object, or any other type of value. The purpose of the objectHash function is to generate a hash value for
-     * the key, which can be used for
-     * @returns a number, which is the hash value of the key.
-     */
-    protected _objectHash(key: K): number;
-    /**
-     * The `expand` function increases the capacity of a hash table by creating a new array of buckets with double the
-     * capacity and rehashing all the existing key-value pairs into the new buckets.
-     */
-    protected _expand(): void;
-}

package/dist/cjs/data-structures/hash/hash-table.js

@@ -1,282 +0,0 @@
-"use strict";
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashTable = exports.HashTableNode = void 0;
-class HashTableNode {
-    constructor(key, value) {
-        this.key = key;
-        this.value = value;
-        this.next = undefined;
-    }
-}
-exports.HashTableNode = HashTableNode;
-class HashTable {
-    constructor(capacity = HashTable.DEFAULT_CAPACITY, hashFn) {
-        this._hashFn = hashFn || this._defaultHashFn;
-        this._capacity = Math.max(capacity, HashTable.DEFAULT_CAPACITY);
-        this._size = 0;
-        this._buckets = new Array(this._capacity).fill(undefined);
-    }
-    get capacity() {
-        return this._capacity;
-    }
-    get size() {
-        return this._size;
-    }
-    get buckets() {
-        return this._buckets;
-    }
-    get hashFn() {
-        return this._hashFn;
-    }
-    /**
-     * The set function adds a key-value pair to the hash table, handling collisions and resizing if necessary.
-     * @param {K} key - The key parameter represents the key of the key-value pair that you want to insert into the hash
-     * table. It is of type K, which is a generic type representing the key's data type.
-     * @param {V} value - The parameter `value` represents the value that you want to associate with the given key in the hash
-     * table.
-     * @returns Nothing is being returned. The return type of the `put` method is `void`, which means it does not return any
-     * value.
-     */
-    set(key, value) {
-        const index = this._hash(key);
-        const newNode = new HashTableNode(key, value);
-        if (!this._buckets[index]) {
-            this._buckets[index] = newNode;
-        }
-        else {
-            // Handle collisions, consider using open addressing, etc.
-            let currentNode = this._buckets[index];
-            while (currentNode) {
-                if (currentNode.key === key) {
-                    // If the key already exists, update the value
-                    currentNode.value = value;
-                    return;
-                }
-                if (!currentNode.next) {
-                    break;
-                }
-                currentNode = currentNode.next;
-            }
-            // Add to the end of the linked list
-            currentNode.next = newNode;
-        }
-        this._size++;
-        // If the load factor is too high, resize the hash table
-        if (this._size / this._capacity >= HashTable.LOAD_FACTOR) {
-            this._expand();
-        }
-    }
-    /**
-     * The `get` function retrieves the value associated with a given key from a hash table.
-     * @param {K} key - The `key` parameter represents the key of the element that we want to retrieve from the data
-     * structure.
-     * @returns The method is returning the value associated with the given key if it exists in the hash table. If the key is
-     * not found, it returns `undefined`.
-     */
-    get(key) {
-        const index = this._hash(key);
-        let currentNode = this._buckets[index];
-        while (currentNode) {
-            if (currentNode.key === key) {
-                return currentNode.value;
-            }
-            currentNode = currentNode.next;
-        }
-        return undefined; // Key not found
-    }
-    /**
-     * The delete function removes a key-value pair from a hash table.
-     * @param {K} key - The `key` parameter represents the key of the key-value pair that needs to be removed from the hash
-     * table.
-     * @returns Nothing is being returned. The `delete` method has a return type of `void`, which means it does not return
-     * any value.
-     */
-    delete(key) {
-        const index = this._hash(key);
-        let currentNode = this._buckets[index];
-        let prevNode = undefined;
-        while (currentNode) {
-            if (currentNode.key === key) {
-                if (prevNode) {
-                    prevNode.next = currentNode.next;
-                }
-                else {
-                    this._buckets[index] = currentNode.next;
-                }
-                this._size--;
-                currentNode.next = undefined; // Release memory
-                return;
-            }
-            prevNode = currentNode;
-            currentNode = currentNode.next;
-        }
-    }
-    *[Symbol.iterator]() {
-        for (const bucket of this._buckets) {
-            let currentNode = bucket;
-            while (currentNode) {
-                yield [currentNode.key, currentNode.value];
-                currentNode = currentNode.next;
-            }
-        }
-    }
-    forEach(callback) {
-        let index = 0;
-        for (const entry of this) {
-            callback(entry, index, this);
-            index++;
-        }
-    }
-    filter(predicate) {
-        const newTable = new HashTable();
-        let index = 0;
-        for (const [key, value] of this) {
-            if (predicate([key, value], index, this)) {
-                newTable.set(key, value);
-            }
-            index++;
-        }
-        return newTable;
-    }
-    map(callback) {
-        const newTable = new HashTable();
-        let index = 0;
-        for (const [key, value] of this) {
-            newTable.set(key, callback([key, value], index, this));
-            index++;
-        }
-        return newTable;
-    }
-    reduce(callback, initialValue) {
-        let accumulator = initialValue;
-        let index = 0;
-        for (const entry of this) {
-            accumulator = callback(accumulator, entry, index, this);
-            index++;
-        }
-        return accumulator;
-    }
-    /**
-     * The function `_defaultHashFn` calculates the hash value of a given key and returns the remainder when divided by the
-     * capacity of the data structure.
-     * @param {K} key - The `key` parameter is the input value that needs to be hashed. It can be of any type, but in this
-     * code snippet, it is checked whether the key is a string or an object. If it is a string, the `_murmurStringHashFn`
-     * function is used to
-     * @returns the hash value of the key modulo the capacity of the data structure.
-     */
-    _defaultHashFn(key) {
-        // Can be replaced with other hash functions as needed
-        const hashValue = typeof key === 'string' ? this._murmurStringHashFn(key) : this._objectHash(key);
-        return hashValue % this._capacity;
-    }
-    /**
-     * The `_multiplicativeStringHashFn` function calculates a hash value for a given string key using the multiplicative
-     * string hash function.
-     * @param {K} key - The `key` parameter is the input value for which we want to calculate the hash. It can be of any
-     * type, as it is generic (`K`). The function converts the `key` to a string using the `String()` function.
-     * @returns a number, which is the result of the multiplicative string hash function applied to the input key.
-     */
-    _multiplicativeStringHashFn(key) {
-        const keyString = String(key);
-        let hash = 0;
-        for (let i = 0; i < keyString.length; i++) {
-            const charCode = keyString.charCodeAt(i);
-            // Some constants for adjusting the hash function
-            const A = 0.618033988749895;
-            const M = 1 << 30; // 2^30
-            hash = (hash * A + charCode) % M;
-        }
-        return Math.abs(hash); // Take absolute value to ensure non-negative numbers
-    }
-    /**
-     * The function `_murmurStringHashFn` calculates a hash value for a given string key using the MurmurHash algorithm.
-     * @param {K} key - The `key` parameter is the input value for which you want to calculate the hash. It can be of any
-     * type, but it will be converted to a string using the `String()` function before calculating the hash.
-     * @returns a number, which is the hash value calculated for the given key.
-     */
-    _murmurStringHashFn(key) {
-        const keyString = String(key);
-        const seed = 0;
-        let hash = seed;
-        for (let i = 0; i < keyString.length; i++) {
-            const char = keyString.charCodeAt(i);
-            hash = (hash ^ char) * 0x5bd1e995;
-            hash = (hash ^ (hash >>> 15)) * 0x27d4eb2d;
-            hash = hash ^ (hash >>> 15);
-        }
-        return Math.abs(hash);
-    }
-    /**
-     * The _hash function takes a key and returns a number.
-     * @param {K} key - The parameter "key" is of type K, which represents the type of the key that will be hashed.
-     * @returns The hash function is returning a number.
-     */
-    _hash(key) {
-        return this.hashFn(key);
-    }
-    /**
-     * The function calculates a hash value for a given string using the djb2 algorithm.
-     * @param {string} key - The `key` parameter in the `stringHash` function is a string value that represents the input for
-     * which we want to calculate the hash value.
-     * @returns a number, which is the hash value of the input string.
-     */
-    _stringHash(key) {
-        let hash = 0;
-        for (let i = 0; i < key.length; i++) {
-            hash = (hash * 31 + key.charCodeAt(i)) & 0xffffffff;
-        }
-        return hash;
-    }
-    /**
-     * The function `_objectHash` takes a key and returns a hash value, using a custom hash function for objects.
-     * @param {K} key - The parameter "key" is of type "K", which means it can be any type. It could be a string, number,
-     * boolean, object, or any other type of value. The purpose of the objectHash function is to generate a hash value for
-     * the key, which can be used for
-     * @returns a number, which is the hash value of the key.
-     */
-    _objectHash(key) {
-        // If the key is an object, you can write a custom hash function
-        // For example, convert the object's properties to a string and use string hashing
-        // This is just an example; you should write a specific object hash function as needed
-        return this._stringHash(JSON.stringify(key));
-    }
-    /**
-     * The `expand` function increases the capacity of a hash table by creating a new array of buckets with double the
-     * capacity and rehashing all the existing key-value pairs into the new buckets.
-     */
-    _expand() {
-        const newCapacity = this._capacity * 2;
-        const newBuckets = new Array(newCapacity).fill(undefined);
-        for (const bucket of this._buckets) {
-            let currentNode = bucket;
-            while (currentNode) {
-                const newIndex = this._hash(currentNode.key);
-                const newNode = new HashTableNode(currentNode.key, currentNode.value);
-                if (!newBuckets[newIndex]) {
-                    newBuckets[newIndex] = newNode;
-                }
-                else {
-                    let currentNewNode = newBuckets[newIndex];
-                    while (currentNewNode.next) {
-                        currentNewNode = currentNewNode.next;
-                    }
-                    currentNewNode.next = newNode;
-                }
-                currentNode = currentNode.next;
-            }
-        }
-        this._buckets = newBuckets;
-        this._capacity = newCapacity;
-    }
-}
-exports.HashTable = HashTable;
-HashTable.DEFAULT_CAPACITY = 16;
-HashTable.LOAD_FACTOR = 0.75;
-//# sourceMappingURL=hash-table.js.map

package/dist/cjs/data-structures/hash/hash-table.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../../../src/data-structures/hash/hash-table.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAIH,MAAa,aAAa;IAKxB,YAAY,GAAM,EAAE,KAAQ;QAC1B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;IACxB,CAAC;CACF;AAVD,sCAUC;AAED,MAAa,SAAS;IAIpB,YAAY,WAAmB,SAAS,CAAC,gBAAgB,EAAE,MAAwB;QACjF,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,cAAc,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,gBAAgB,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAkC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7F,CAAC;IAID,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAID,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAID,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAO,GAAG,EAAE,KAAK,CAAC,CAAC;QAEpD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,0DAA0D;YAC1D,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAE,CAAC;YACxC,OAAO,WAAW,EAAE,CAAC;gBACnB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;oBAC5B,8CAA8C;oBAC9C,WAAW,CAAC,KAAK,GAAG,KAAK,CAAC;oBAC1B,OAAO;gBACT,CAAC;gBACD,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACtB,MAAM;gBACR,CAAC;gBACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;YACjC,CAAC;YACD,oCAAoC;YACpC,WAAW,CAAC,IAAI,GAAG,OAAO,CAAC;QAC7B,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,wDAAwD;QACxD,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;YACzD,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEvC,OAAO,WAAW,EAAE,CAAC;YACnB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;gBAC5B,OAAO,WAAW,CAAC,KAAK,CAAC;YAC3B,CAAC;YACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACjC,CAAC;QACD,OAAO,SAAS,CAAC,CAAC,gBAAgB;IACpC,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,GAAM;QACX,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,QAAQ,GAAoC,SAAS,CAAC;QAE1D,OAAO,WAAW,EAAE,CAAC;YACnB,IAAI,WAAW,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;gBAC5B,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;gBACnC,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC;gBAC1C,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,WAAW,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,iBAAiB;gBAC/C,OAAO;YACT,CAAC;YACD,QAAQ,GAAG,WAAW,CAAC;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;QACjC,CAAC;IACH,CAAC;IAED,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;QACjB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,WAAW,GAAG,MAAM,CAAC;YACzB,OAAO,WAAW,EAAE,CAAC;gBACnB,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;gBAC3C,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,QAAwE;QAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAC7B,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,MAAM,CAAC,SAA4E;QACjF,MAAM,QAAQ,GAAG,IAAI,SAAS,EAAQ,CAAC;QACvC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;YAChC,IAAI,SAAS,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;gBACzC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3B,CAAC;YACD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,GAAG,CAAI,QAAqE;QAC1E,MAAM,QAAQ,GAAG,IAAI,SAAS,EAAQ,CAAC;QACvC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;YAChC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;YACvD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,CAAI,QAAqF,EAAE,YAAe;QAC9G,IAAI,WAAW,GAAG,YAAY,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,WAAW,GAAG,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACxD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;;;;OAOG;IACO,cAAc,CAAC,GAAM;QAC7B,sDAAsD;QACtD,MAAM,SAAS,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAClG,OAAO,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACO,2BAA2B,CAAI,GAAM;QAC7C,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACzC,iDAAiD;YACjD,MAAM,CAAC,GAAG,iBAAiB,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO;YAC1B,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,qDAAqD;IAC9E,CAAC;IAED;;;;;OAKG;IACO,mBAAmB,CAAI,GAAM;QACrC,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,CAAC,CAAC;QACf,IAAI,IAAI,GAAG,IAAI,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,UAAU,CAAC;YAClC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;YAC3C,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACO,KAAK,CAAC,GAAM;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACO,WAAW,CAAC,GAAW;QAC/B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;QACtD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACO,WAAW,CAAC,GAAM;QAC1B,gEAAgE;QAChE,kFAAkF;QAClF,sFAAsF;QACtF,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACO,OAAO;QACf,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,KAAK,CAAkC,WAAW,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAE3F,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,WAAW,GAAG,MAAM,CAAC;YACzB,OAAO,WAAW,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBAC7C,MAAM,OAAO,GAAG,IAAI,aAAa,CAAO,WAAW,CAAC,GAAG,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;gBAE5E,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC1B,UAAU,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC;gBACjC,CAAC;qBAAM,CAAC;oBACN,IAAI,cAAc,GAAG,UAAU,CAAC,QAAQ,CAAE,CAAC;oBAC3C,OAAO,cAAc,CAAC,IAAI,EAAE,CAAC;wBAC3B,cAAc,GAAG,cAAc,CAAC,IAAI,CAAC;oBACvC,CAAC;oBACD,cAAc,CAAC,IAAI,GAAG,OAAO,CAAC;gBAChC,CAAC;gBACD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;YACjC,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC;IAC/B,CAAC;;AAtSH,8BAuSC;AAtS2B,0BAAgB,GAAG,EAAE,CAAC;AACtB,qBAAW,GAAG,IAAI,CAAC"}

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

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

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

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=hash-table.js.map

package/dist/cjs/types/data-structures/hash/hash-table.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hash-table.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/hash/hash-table.ts"],"names":[],"mappings":""}

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

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

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

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=matrix2d.js.map

package/dist/cjs/types/data-structures/matrix/matrix2d.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"matrix2d.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/matrix/matrix2d.ts"],"names":[],"mappings":""}

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

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

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

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=vector2d.js.map

package/dist/cjs/types/data-structures/matrix/vector2d.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"vector2d.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/matrix/vector2d.ts"],"names":[],"mappings":""}