data-structure-typed 1.40.0-rc → 1.40.0

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

@@ -0,0 +1,36 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+export declare class CoordinateSet extends Set<any> {
+    constructor(joint?: string);
+    protected _joint: string;
+    get joint(): string;
+    /**
+     * The "has" function overrides the "has" method of the superclass and checks if a value exists in an array after
+     * joining its elements with a specified separator.
+     * @param {number[]} value - The parameter "value" is an array of numbers.
+     * @returns The overridden `has` method is returning the result of calling the `has` method of the superclass, passing
+     * in the joined value as an argument.
+     */
+    has(value: number[]): boolean;
+    /**
+     * The "add" function overrides the parent class's "add" function by joining the elements of the input array with a
+     * specified delimiter before calling the parent class's "add" function.
+     * @param {number[]} value - An array of numbers
+     * @returns The overridden `add` method is returning the result of calling the `add` method of the superclass
+     * (`super.add`) with the joined string representation of the `value` array (`value.join(this._joint)`).
+     */
+    add(value: number[]): this;
+    /**
+     * The function overrides the delete method and deletes an element from a Set by joining the elements of the input
+     * array with a specified joint and then calling the delete method of the parent class.
+     * @param {number[]} value - An array of numbers
+     * @returns The `delete` method is returning the result of calling the `delete` method of the superclass, with the
+     * `value` array joined together using the `_joint` property.
+     */
+    delete(value: number[]): boolean;
+}

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

@@ -0,0 +1,52 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CoordinateSet = void 0;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+class CoordinateSet extends Set {
+    constructor(joint) {
+        super();
+        if (joint !== undefined)
+            this._joint = joint;
+    }
+    _joint = '_';
+    get joint() {
+        return this._joint;
+    }
+    /**
+     * The "has" function overrides the "has" method of the superclass and checks if a value exists in an array after
+     * joining its elements with a specified separator.
+     * @param {number[]} value - The parameter "value" is an array of numbers.
+     * @returns The overridden `has` method is returning the result of calling the `has` method of the superclass, passing
+     * in the joined value as an argument.
+     */
+    has(value) {
+        return super.has(value.join(this._joint));
+    }
+    /**
+     * The "add" function overrides the parent class's "add" function by joining the elements of the input array with a
+     * specified delimiter before calling the parent class's "add" function.
+     * @param {number[]} value - An array of numbers
+     * @returns The overridden `add` method is returning the result of calling the `add` method of the superclass
+     * (`super.add`) with the joined string representation of the `value` array (`value.join(this._joint)`).
+     */
+    add(value) {
+        return super.add(value.join(this._joint));
+    }
+    /**
+     * The function overrides the delete method and deletes an element from a Set by joining the elements of the input
+     * array with a specified joint and then calling the delete method of the parent class.
+     * @param {number[]} value - An array of numbers
+     * @returns The `delete` method is returning the result of calling the `delete` method of the superclass, with the
+     * `value` array joined together using the `_joint` property.
+     */
+    delete(value) {
+        return super.delete(value.join(this._joint));
+    }
+}
+exports.CoordinateSet = CoordinateSet;

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

@@ -0,0 +1,50 @@
+import { HashFunction } from '../../types';
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+export declare class HashMap<K, V> {
+    /**
+     * The constructor initializes the properties of a hash table, including the initial capacity, load factor, capacity
+     * multiplier, size, table array, and hash function.
+     * @param [initialCapacity=16] - The initial capacity is the initial size of the hash table. It determines the number of
+     * buckets or slots available for storing key-value pairs. The default value is 16.
+     * @param [loadFactor=0.75] - The load factor is a measure of how full the hash table can be before it is resized. It is
+     * a value between 0 and 1, where 1 means the hash table is completely full and 0 means it is completely empty. When the
+     * load factor is reached, the hash table will
+     * @param [hashFn] - The `hashFn` parameter is an optional parameter that represents the hash function used to calculate
+     * the index of a key in the hash table. If a custom hash function is not provided, a default hash function is used. The
+     * default hash function converts the key to a string, calculates the sum of the
+     */
+    constructor(initialCapacity?: number, loadFactor?: number, hashFn?: HashFunction<K>);
+    protected _initialCapacity: number;
+    get initialCapacity(): number;
+    protected _loadFactor: number;
+    get loadFactor(): number;
+    protected _capacityMultiplier: number;
+    get capacityMultiplier(): number;
+    protected _size: number;
+    get size(): number;
+    protected _table: Array<Array<[K, V]>>;
+    get table(): Array<Array<[K, V]>>;
+    protected _hashFn: HashFunction<K>;
+    get hashFn(): HashFunction<K>;
+    set(key: K, value: V): void;
+    get(key: K): V | undefined;
+    delete(key: K): void;
+    entries(): IterableIterator<[K, V]>;
+    [Symbol.iterator](): IterableIterator<[K, V]>;
+    clear(): void;
+    isEmpty(): boolean;
+    protected _hash(key: K): number;
+    /**
+     * The `resizeTable` function resizes the table used in a hash map by creating a new table with a specified capacity and
+     * rehashing the key-value pairs from the old table into the new table.
+     * @param {number} newCapacity - The newCapacity parameter is the desired capacity for the resized table. It represents
+     * the number of buckets that the new table should have.
+     */
+    protected resizeTable(newCapacity: number): void;
+}

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

@@ -0,0 +1,159 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.HashMap = void 0;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+class HashMap {
+    /**
+     * The constructor initializes the properties of a hash table, including the initial capacity, load factor, capacity
+     * multiplier, size, table array, and hash function.
+     * @param [initialCapacity=16] - The initial capacity is the initial size of the hash table. It determines the number of
+     * buckets or slots available for storing key-value pairs. The default value is 16.
+     * @param [loadFactor=0.75] - The load factor is a measure of how full the hash table can be before it is resized. It is
+     * a value between 0 and 1, where 1 means the hash table is completely full and 0 means it is completely empty. When the
+     * load factor is reached, the hash table will
+     * @param [hashFn] - The `hashFn` parameter is an optional parameter that represents the hash function used to calculate
+     * the index of a key in the hash table. If a custom hash function is not provided, a default hash function is used. The
+     * default hash function converts the key to a string, calculates the sum of the
+     */
+    constructor(initialCapacity = 16, loadFactor = 0.75, hashFn) {
+        this._initialCapacity = initialCapacity;
+        this._loadFactor = loadFactor;
+        this._capacityMultiplier = 2;
+        this._size = 0;
+        this._table = new Array(initialCapacity);
+        this._hashFn =
+            hashFn ||
+                ((key) => {
+                    const strKey = String(key);
+                    let hash = 0;
+                    for (let i = 0; i < strKey.length; i++) {
+                        hash += strKey.charCodeAt(i);
+                    }
+                    return hash % this.table.length;
+                });
+    }
+    _initialCapacity;
+    get initialCapacity() {
+        return this._initialCapacity;
+    }
+    _loadFactor;
+    get loadFactor() {
+        return this._loadFactor;
+    }
+    _capacityMultiplier;
+    get capacityMultiplier() {
+        return this._capacityMultiplier;
+    }
+    _size;
+    get size() {
+        return this._size;
+    }
+    _table;
+    get table() {
+        return this._table;
+    }
+    _hashFn;
+    get hashFn() {
+        return this._hashFn;
+    }
+    set(key, value) {
+        const loadFactor = this.size / this.table.length;
+        if (loadFactor >= this.loadFactor) {
+            this.resizeTable(this.table.length * this.capacityMultiplier);
+        }
+        const index = this._hash(key);
+        if (!this.table[index]) {
+            this.table[index] = [];
+        }
+        // Check if the key already exists in the bucket
+        for (let i = 0; i < this.table[index].length; i++) {
+            if (this.table[index][i][0] === key) {
+                this.table[index][i][1] = value;
+                return;
+            }
+        }
+        this.table[index].push([key, value]);
+        this._size++;
+    }
+    get(key) {
+        const index = this._hash(key);
+        if (!this.table[index]) {
+            return undefined;
+        }
+        for (const [k, v] of this.table[index]) {
+            if (k === key) {
+                return v;
+            }
+        }
+        return undefined;
+    }
+    delete(key) {
+        const index = this._hash(key);
+        if (!this.table[index]) {
+            return;
+        }
+        for (let i = 0; i < this.table[index].length; i++) {
+            if (this.table[index][i][0] === key) {
+                this.table[index].splice(i, 1);
+                this._size--;
+                // Check if the table needs to be resized down
+                const loadFactor = this.size / this.table.length;
+                if (loadFactor < this.loadFactor / this.capacityMultiplier) {
+                    this.resizeTable(this.table.length / this.capacityMultiplier);
+                }
+                return;
+            }
+        }
+    }
+    *entries() {
+        for (const bucket of this.table) {
+            if (bucket) {
+                for (const [key, value] of bucket) {
+                    yield [key, value];
+                }
+            }
+        }
+    }
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+    clear() {
+        this._size = 0;
+        this._table = new Array(this.initialCapacity);
+    }
+    isEmpty() {
+        return this.size === 0;
+    }
+    _hash(key) {
+        return this._hashFn(key);
+    }
+    /**
+     * The `resizeTable` function resizes the table used in a hash map by creating a new table with a specified capacity and
+     * rehashing the key-value pairs from the old table into the new table.
+     * @param {number} newCapacity - The newCapacity parameter is the desired capacity for the resized table. It represents
+     * the number of buckets that the new table should have.
+     */
+    resizeTable(newCapacity) {
+        const newTable = new Array(newCapacity);
+        for (const bucket of this._table) {
+            // Note that this is this._table
+            if (bucket) {
+                for (const [key, value] of bucket) {
+                    const newIndex = this._hash(key) % newCapacity;
+                    if (!newTable[newIndex]) {
+                        newTable[newIndex] = [];
+                    }
+                    newTable[newIndex].push([key, value]);
+                }
+            }
+        }
+        this._table = newTable; // Again, here is this._table
+    }
+}
+exports.HashMap = HashMap;

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

@@ -0,0 +1,103 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+export declare class HashTableNode<K, V> {
+    key: K;
+    value: V;
+    next: HashTableNode<K, V> | null;
+    constructor(key: K, value: V);
+}
+import { HashFunction } from '../../types';
+export declare class HashTable<K, V> {
+    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> | null>;
+    get buckets(): Array<HashTableNode<K, V> | null>;
+    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;
+    /**
+     * 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/mjs/data-structures/hash/hash-table.js

@@ -0,0 +1,243 @@
+"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 {
+    key;
+    value;
+    next;
+    constructor(key, value) {
+        this.key = key;
+        this.value = value;
+        this.next = null;
+    }
+}
+exports.HashTableNode = HashTableNode;
+class HashTable {
+    static DEFAULT_CAPACITY = 16;
+    static LOAD_FACTOR = 0.75;
+    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(null);
+    }
+    _capacity;
+    get capacity() {
+        return this._capacity;
+    }
+    _size;
+    get size() {
+        return this._size;
+    }
+    _buckets;
+    get buckets() {
+        return this._buckets;
+    }
+    _hashFn;
+    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 = null;
+        while (currentNode) {
+            if (currentNode.key === key) {
+                if (prevNode) {
+                    prevNode.next = currentNode.next;
+                }
+                else {
+                    this._buckets[index] = currentNode.next;
+                }
+                this._size--;
+                currentNode.next = null; // Release memory
+                return;
+            }
+            prevNode = currentNode;
+            currentNode = currentNode.next;
+        }
+    }
+    /**
+     * 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(null);
+        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;

package/dist/mjs/data-structures/hash/index.d.ts

@@ -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/index.js

@@ -0,0 +1,22 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./hash-table"), exports);
+__exportStar(require("./coordinate-map"), exports);
+__exportStar(require("./coordinate-set"), exports);
+__exportStar(require("./tree-map"), exports);
+__exportStar(require("./tree-set"), exports);
+__exportStar(require("./hash-map"), exports);

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

@@ -0,0 +1,6 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeMap = void 0;
+class TreeMap {
+}
+exports.TreeMap = TreeMap;