alchemist-collections 0.0.1

package/LICENSE

@@ -0,0 +1,20 @@
+MIT License
+
+Copyright (c) 2026 Tu Nombre
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.

package/README.md

@@ -0,0 +1,313 @@
+# 🧪 Alchemist Collections
+
+A high-performance collections library for TypeScript, inspired by Java collections. Provides efficient and well-tested data structures for your TypeScript/JavaScript applications.
+
+[![npm version](https://img.shields.io/npm/v/alchemist-collections)](https://www.npmjs.com/package/alchemist-collections)
+[![npm downloads](https://img.shields.io/npm/dm/alchemist-collections)](https://www.npmjs.com/package/alchemist-collections)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+
+## 🚀 Features
+
+- ✅ **ArrayList** - Dynamic list with optimized automatic growth
+- ✅ **HashMap** - Hash table implementation with collision handling
+- ✅ **Type-safe with full TypeScript generics** - Complete type inference and IDE support
+- ✅ **High performance** - Optimized native methods (copyWithin, fill)
+- ✅ **Iterable** - Compatible with `for...of` and spread operator
+- ✅ **Familiar interface** - Methods similar to Java collections
+- ✅ **Fully tested** - Complete test coverage
+- ✅ **Zero dependencies** - Pure library with no external packages required
+
+## 📦 Installation
+
+```bash
+npm install alchemist-collections
+```
+
+```bash
+yarn add alchemist-collections
+```
+
+```bash
+pnpm add alchemist-collections
+```
+
+## 🎯 Quick Start
+
+### ArrayList
+
+```typescript
+import { ArrayList } from 'alchemist-collections';
+
+// Create a list
+const numbers = new ArrayList<number>();
+
+// Add elements
+numbers.add(10);
+numbers.add(20);
+numbers.add(30);
+
+// Access elements
+console.log(numbers.get(0)); // 10
+console.log(numbers.size()); // 3
+
+// Search elements
+console.log(numbers.contains(20)); // true
+console.log(numbers.indexOf(30)); // 2
+
+// Modify elements
+numbers.set(1, 25); // change index 1 to 25
+
+// Insert at specific position
+numbers.addAt(1, 15); // [10, 15, 20, 25, 30]
+
+// Remove elements
+numbers.remove(2); // remove at index 2
+
+// Iterate
+for (const num of numbers) {
+  console.log(num);
+}
+
+// Convert to array
+const arr = numbers.toArray();
+
+// Clear list
+numbers.clear();
+console.log(numbers.isEmpty()); // true
+```
+
+### HashMap
+
+```typescript
+import { HashMap } from 'alchemist-collections';
+
+// Create a map
+const map = new HashMap<string, number>();
+
+// Add key-value pairs
+map.put('apple', 5);
+map.put('banana', 3);
+map.put('cherry', 8);
+
+// Get values
+console.log(map.get('apple')); // 5
+console.log(map.size()); // 3
+
+// Check if key exists
+console.log(map.containsKey('banana')); // true
+
+// Check if value exists
+console.log(map.containsValue(3)); // true
+
+// Get all keys
+const keys = map.keys(); // ['apple', 'banana', 'cherry']
+
+// Get all values
+const values = map.values(); // [5, 3, 8]
+
+// Get all entries
+const entries = map.entries(); // [['apple', 5], ['banana', 3], ['cherry', 8]]
+
+// Update a value
+const oldValue = map.put('apple', 10); // returns 5
+
+// Remove a key
+const removed = map.remove('banana'); // returns 3
+
+// Iterate
+for (const [key, value] of map) {
+  console.log(`${key}: ${value}`);
+}
+
+// Clear map
+map.clear();
+console.log(map.isEmpty()); // true
+```
+
+## 📚 Complete API
+
+### ArrayList<E>
+
+#### Constructor
+
+```typescript
+// Default initial capacity (10)
+const list = new ArrayList<string>();
+
+// Specify initial capacity
+const list = new ArrayList<string>(20);
+```
+
+#### Methods
+
+| Method | Description | Example |
+|--------|-------------|---------|
+| `add(element: E): boolean` | Adds element at the end | `list.add('hello')` |
+| `addAt(index: number, element: E): void` | Adds element at specific position | `list.addAt(0, 'first')` |
+| `get(index: number): E` | Gets element at index | `list.get(0)` |
+| `set(index: number, element: E): E` | Sets element and returns previous | `list.set(0, 'new')` |
+| `remove(index: number): E` | Removes and returns element | `list.remove(0)` |
+| `contains(element: E): boolean` | Checks if element exists | `list.contains('hello')` |
+| `indexOf(element: E): number` | Gets index of element | `list.indexOf('hello')` |
+| `size(): number` | Returns number of elements | `list.size()` |
+| `isEmpty(): boolean` | Checks if empty | `list.isEmpty()` |
+| `clear(): void` | Removes all elements | `list.clear()` |
+| `toArray(): E[]` | Converts to native array | `const arr = list.toArray()` |
+
+### HashMap<K, V>
+
+#### Constructor
+
+```typescript
+// Default initial capacity (16)
+const map = new HashMap<string, number>();
+
+// Specify initial capacity
+const map = new HashMap<string, number>(32);
+```
+
+#### Methods
+
+| Method | Description | Example |
+|--------|-------------|---------|
+| `put(key: K, value: V): V \| undefined` | Adds/updates entry, returns old value | `map.put('name', 'John')` |
+| `get(key: K): V \| undefined` | Gets value for key | `map.get('name')` |
+| `remove(key: K): V \| undefined` | Removes and returns value | `map.remove('name')` |
+| `containsKey(key: K): boolean` | Checks if key exists | `map.containsKey('name')` |
+| `containsValue(value: V): boolean` | Checks if value exists | `map.containsValue('John')` |
+| `size(): number` | Returns number of entries | `map.size()` |
+| `isEmpty(): boolean` | Checks if empty | `map.isEmpty()` |
+| `keys(): K[]` | Returns all keys | `const keys = map.keys()` |
+| `values(): V[]` | Returns all values | `const vals = map.values()` |
+| `entries(): [K, V][]` | Returns all key-value pairs | `const entries = map.entries()` |
+| `clear(): void` | Removes all entries | `map.clear()` |
+
+## 💡 Advanced Examples
+
+### Working with objects
+
+```typescript
+interface User {
+  id: number;
+  name: string;
+}
+
+const users = new ArrayList<User>();
+
+users.add({ id: 1, name: 'Alice' });
+users.add({ id: 2, name: 'Bob' });
+
+const user = users.get(0);
+console.log(user.name); // Alice
+```
+
+### Working with HashMap
+
+```typescript
+interface Product {
+  id: string;
+  name: string;
+  price: number;
+}
+
+const products = new HashMap<string, Product>();
+
+// Add products
+products.put('PROD001', { id: 'PROD001', name: 'Laptop', price: 999 });
+products.put('PROD002', { id: 'PROD002', name: 'Mouse', price: 29 });
+
+// Find a product
+const product = products.get('PROD001');
+if (product) {
+  console.log(`${product.name}: $${product.price}`);
+}
+
+// Check inventory
+console.log(products.size()); // 2
+
+// List all product names
+const names = products.values().map(p => p.name);
+console.log(names); // ['Laptop', 'Mouse']
+```
+
+### HashMap with number keys
+
+
+```typescript
+const list = new ArrayList<number>();
+list.add(1);
+list.add(2);
+list.add(3);
+
+// Spread
+const arr = [...list]; // [1, 2, 3]
+
+// Destructuring
+const [first, second] = list; // first = 1, second = 2
+```
+
+### Automatic capacity growth
+
+```typescript
+const list = new ArrayList<number>(2);
+console.log(list.size()); // 0 (initial capacity 2)
+
+// Add more elements than capacity - grows automatically
+for (let i = 0; i < 100; i++) {
+  list.add(i);
+}
+console.log(list.size()); // 100
+```
+
+## ⚡ Performance
+
+The library uses native optimizations:
+
+- **`copyWithin()`** for efficient element movement in add/remove
+- **`fill()`** for clearing elements in clear()
+- **Dynamic growth** with 1.5x factor to minimize reallocations
+
+Compared to native JavaScript arrays, ArrayList is ideal when you need:
+- Frequent insert/remove operations at specific positions
+- Type safety with TypeScript generics
+- Familiar API for Java developers
+
+## 🧪 Testing
+
+Run tests:
+
+```bash
+npm run test
+```
+
+With coverage:
+
+```bash
+npm run test:coverage
+```
+
+## 📝 License
+
+MIT © 2026
+
+## Legal
+This project provides a TypeScript implementation of data structures inspired by the Java Collections Framework.
+
+Java and JDK are trademarks or registered trademarks of Oracle and/or its affiliates.
+
+This project is not affiliated with, endorsed by, or sponsored by Oracle.
+
+## 🤝 Contributing
+
+Contributions are welcome! Please:
+
+1. Fork the project
+2. Create a feature branch (`git checkout -b feature/AmazingFeature`)
+3. Commit your changes (`git commit -m 'Add AmazingFeature'`)
+4. Push to the branch (`git push origin feature/AmazingFeature`)
+5. Open a Pull Request
+
+
+---
+
+⚠️ Note: This library is currently in Alpha. Interfaces may change, and I am actively working on adding new structures

package/dist/src/core/exceptions/IndexOutOfBoundsException.d.ts

@@ -0,0 +1,4 @@
+export declare class IndexOutOfBoundsException extends Error {
+    constructor(index: number, size: number);
+}
+//# sourceMappingURL=IndexOutOfBoundsException.d.ts.map

package/dist/src/core/exceptions/IndexOutOfBoundsException.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"IndexOutOfBoundsException.d.ts","sourceRoot":"","sources":["../../../../src/core/exceptions/IndexOutOfBoundsException.ts"],"names":[],"mappings":"AAAA,qBAAa,yBAA0B,SAAQ,KAAK;gBACtC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;CASxC"}

package/dist/src/core/exceptions/IndexOutOfBoundsException.js

@@ -0,0 +1,11 @@
+export class IndexOutOfBoundsException extends Error {
+    constructor(index, size) {
+        const message = `Index: ${index}, Size ${size}`;
+        super(message);
+        this.name = 'IndexOutOfBoundsException';
+        if (Error.captureStackTrace) {
+            Error.captureStackTrace(this, IndexOutOfBoundsException);
+        }
+    }
+}
+//# sourceMappingURL=IndexOutOfBoundsException.js.map

package/dist/src/core/exceptions/IndexOutOfBoundsException.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"IndexOutOfBoundsException.js","sourceRoot":"","sources":["../../../../src/core/exceptions/IndexOutOfBoundsException.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClD,YAAY,KAAa,EAAE,IAAY;QACrC,MAAM,OAAO,GAAG,UAAU,KAAK,UAAU,IAAI,EAAE,CAAC;QAChD,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;QAExC,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAC5B,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,yBAAyB,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;CACF"}

package/dist/src/core/interfaces/List.d.ts

@@ -0,0 +1,13 @@
+export interface List<E> extends Iterable<E> {
+    size(): number;
+    isEmpty(): boolean;
+    add(element: E): boolean;
+    contains(element: E): boolean;
+    addAt(index: number, element: E): void;
+    get(index: number): E;
+    set(index: number, element: E): E;
+    remove(index: number): E;
+    clear(): void;
+    toArray(): E[];
+}
+//# sourceMappingURL=List.d.ts.map

package/dist/src/core/interfaces/List.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"List.d.ts","sourceRoot":"","sources":["../../../../src/core/interfaces/List.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,IAAI,CAAC,CAAC,CAAE,SAAQ,QAAQ,CAAC,CAAC,CAAC;IAC1C,IAAI,IAAI,MAAM,CAAC;IACf,OAAO,IAAI,OAAO,CAAC;IACnB,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAC9B,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IACvC,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;IACtB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;IACzB,KAAK,IAAI,IAAI,CAAC;IACd,OAAO,IAAI,CAAC,EAAE,CAAC;CAChB"}

package/dist/src/core/interfaces/List.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=List.js.map

package/dist/src/core/interfaces/List.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"List.js","sourceRoot":"","sources":["../../../../src/core/interfaces/List.ts"],"names":[],"mappings":""}

package/dist/src/core/interfaces/Map.d.ts

@@ -0,0 +1,14 @@
+export interface Map<K, V> extends Iterable<[K, V]> {
+    size(): number;
+    isEmpty(): boolean;
+    put(key: K, value: V): V | undefined;
+    get(key: K): V | undefined;
+    containsKey(key: K): boolean;
+    containsValue(value: V): boolean;
+    remove(key: K): V | undefined;
+    clear(): void;
+    keys(): K[];
+    values(): V[];
+    entries(): [K, V][];
+}
+//# sourceMappingURL=Map.d.ts.map

package/dist/src/core/interfaces/Map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Map.d.ts","sourceRoot":"","sources":["../../../../src/core/interfaces/Map.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,IAAI,IAAI,MAAM,CAAC;IACf,OAAO,IAAI,OAAO,CAAC;IACnB,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IACrC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAC3B,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAC7B,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IACjC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAC9B,KAAK,IAAI,IAAI,CAAC;IACd,IAAI,IAAI,CAAC,EAAE,CAAC;IACZ,MAAM,IAAI,CAAC,EAAE,CAAC;IACd,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;CACrB"}

package/dist/src/core/interfaces/Map.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=Map.js.map

package/dist/src/core/interfaces/Map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Map.js","sourceRoot":"","sources":["../../../../src/core/interfaces/Map.ts"],"names":[],"mappings":""}

package/dist/src/index.d.ts

@@ -0,0 +1,6 @@
+export type { List } from './core/interfaces/List.js';
+export type { Map } from './core/interfaces/Map.js';
+export { ArrayList } from './modules/lists/ArrayList.js';
+export { HashMap } from './modules/maps/HashMap.js';
+export { IndexOutOfBoundsException } from './core/exceptions/IndexOutOfBoundsException.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,YAAY,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AACrD,YAAY,EAAE,GAAG,EAAE,MAAM,yBAAyB,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,yBAAyB,EAAE,MAAM,+CAA+C,CAAC"}

package/dist/src/index.js

@@ -0,0 +1,4 @@
+export { ArrayList } from './modules/lists/ArrayList.js';
+export { HashMap } from './modules/maps/HashMap.js';
+export { IndexOutOfBoundsException } from './core/exceptions/IndexOutOfBoundsException.js';
+//# sourceMappingURL=index.js.map

package/dist/src/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,SAAS,EAAE,MAAM,6BAA6B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,yBAAyB,EAAE,MAAM,+CAA+C,CAAC"}

package/dist/src/modules/lists/ArrayList.d.ts

@@ -0,0 +1,24 @@
+import type { List } from '../../core/interfaces/List.js';
+export declare class ArrayList<E> implements List<E> {
+    private elementData;
+    private _size;
+    private static readonly DEFAULT_CAPACITY;
+    constructor(initialCapacity?: number);
+    private rangeCheck;
+    private rangeCheckForAdd;
+    size(): number;
+    isEmpty(): boolean;
+    get(index: number): E;
+    indexOf(element: E): number;
+    contains(element: E): boolean;
+    add(element: E): boolean;
+    addAt(index: number, element: E): void;
+    set(index: number, element: E): E;
+    remove(index: number): E;
+    clear(): void;
+    toArray(): E[];
+    [Symbol.iterator](): Iterator<E>;
+    ensureCapacity(minCapacity: number): void;
+    private grow;
+}
+//# sourceMappingURL=ArrayList.d.ts.map

package/dist/src/modules/lists/ArrayList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ArrayList.d.ts","sourceRoot":"","sources":["../../../../src/modules/lists/ArrayList.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AAGrD,qBAAa,SAAS,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAM;gBAElC,eAAe,GAAE,MAAmC;IAKhE,OAAO,CAAC,UAAU;IAMlB,OAAO,CAAC,gBAAgB;IAMxB,IAAI,IAAI,MAAM;IAId,OAAO,IAAI,OAAO;IAIlB,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAKrB,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM;IAO3B,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAI7B,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAMxB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI;IAUtC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC;IAOjC,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAaxB,KAAK,IAAI,IAAI;IAKb,OAAO,IAAI,CAAC,EAAE;IAIb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAM1B,cAAc,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IAMhD,OAAO,CAAC,IAAI;CAWb"}

package/dist/src/modules/lists/ArrayList.js

@@ -0,0 +1,94 @@
+import { IndexOutOfBoundsException } from '../../core/exceptions/IndexOutOfBoundsException.js';
+export class ArrayList {
+    elementData;
+    _size;
+    static DEFAULT_CAPACITY = 10;
+    constructor(initialCapacity = ArrayList.DEFAULT_CAPACITY) {
+        this.elementData = new Array(initialCapacity);
+        this._size = 0;
+    }
+    rangeCheck(index) {
+        if (index >= this._size || index < 0) {
+            throw new IndexOutOfBoundsException(index, this._size);
+        }
+    }
+    rangeCheckForAdd(index) {
+        if (index > this._size || index < 0) {
+            throw new IndexOutOfBoundsException(index, this._size);
+        }
+    }
+    size() {
+        return this._size;
+    }
+    isEmpty() {
+        return this._size === 0;
+    }
+    get(index) {
+        this.rangeCheck(index);
+        return this.elementData[index];
+    }
+    indexOf(element) {
+        for (let i = 0; i < this._size; i++) {
+            if (this.elementData[i] === element)
+                return i;
+        }
+        return -1;
+    }
+    contains(element) {
+        return this.indexOf(element) >= 0;
+    }
+    add(element) {
+        this.ensureCapacity(this._size + 1);
+        this.elementData[this._size++] = element;
+        return true;
+    }
+    addAt(index, element) {
+        this.rangeCheckForAdd(index);
+        this.ensureCapacity(this._size + 1);
+        this.elementData.copyWithin(index + 1, index, this._size);
+        this.elementData[index] = element;
+        this._size++;
+    }
+    set(index, element) {
+        this.rangeCheck(index);
+        const oldElement = this.elementData[index];
+        this.elementData[index] = element;
+        return oldElement;
+    }
+    remove(index) {
+        this.rangeCheck(index);
+        const oldValue = this.elementData[index];
+        const numMoved = this._size - index - 1;
+        if (numMoved > 0) {
+            this.elementData.copyWithin(index, index + 1, this._size);
+        }
+        this.elementData[--this._size] = undefined;
+        return oldValue;
+    }
+    clear() {
+        this.elementData.fill(undefined, 0, this._size);
+        this._size = 0;
+    }
+    toArray() {
+        return this.elementData.slice(0, this._size);
+    }
+    *[Symbol.iterator]() {
+        for (let i = 0; i < this._size; i++) {
+            yield this.elementData[i];
+        }
+    }
+    ensureCapacity(minCapacity) {
+        if (minCapacity > this.elementData.length) {
+            this.grow(minCapacity);
+        }
+    }
+    grow(minCapacity) {
+        const oldCapacity = this.elementData.length;
+        let newCapacity = oldCapacity === 0 ? 1 : oldCapacity + (oldCapacity >> 1);
+        if (newCapacity < minCapacity) {
+            newCapacity = minCapacity;
+        }
+        this.elementData = this.elementData.slice(0, this._size).concat(new Array(newCapacity - this._size));
+    }
+}
+//# sourceMappingURL=ArrayList.js.map

package/dist/src/modules/lists/ArrayList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ArrayList.js","sourceRoot":"","sources":["../../../../src/modules/lists/ArrayList.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,yBAAyB,EAAE,MAAM,+CAA+C,CAAC;AAE1F,MAAM,OAAO,SAAS;IACZ,WAAW,CAAoB;IAC/B,KAAK,CAAS;IACd,MAAM,CAAU,gBAAgB,GAAG,EAAE,CAAC;IAE9C,YAAY,kBAA0B,SAAS,CAAC,gBAAgB;QAC9D,IAAI,CAAC,WAAW,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAEO,UAAU,CAAC,KAAa;QAC9B,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,yBAAyB,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAEO,gBAAgB,CAAC,KAAa;QACpC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACpC,MAAM,IAAI,yBAAyB,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAM,CAAC;IACtC,CAAC;IAED,OAAO,CAAC,OAAU;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,OAAO;gBAAE,OAAO,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,QAAQ,CAAC,OAAU;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,GAAG,CAAC,OAAU;QACZ,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,KAAa,EAAE,OAAU;QAC7B,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAEpC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAE1D,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QAClC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,OAAU;QAC3B,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAM,CAAC;QAChD,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QAClC,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAM,CAAC;QAE9C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;QACxC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QAC3C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAQ,CAAC;IACtD,CAAC;IAED,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,CAAC,WAAW,CAAC,CAAC,CAAM,CAAC;QACjC,CAAC;IACH,CAAC;IAEM,cAAc,CAAC,WAAmB;QACvC,IAAI,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAEO,IAAI,CAAC,WAAmB;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAE5C,IAAI,WAAW,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;QAE3E,IAAI,WAAW,GAAG,WAAW,EAAE,CAAC;YAC9B,WAAW,GAAG,WAAW,CAAC;QAC5B,CAAC;QAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACvG,CAAC"}

package/dist/src/modules/maps/HashMap.d.ts

@@ -0,0 +1,26 @@
+import type { Map } from '../../core/interfaces/Map.js';
+export declare class HashMap<K, V> implements Map<K, V> {
+    private buckets;
+    private _size;
+    private static readonly DEFAULT_CAPACITY;
+    private static readonly LOAD_FACTOR;
+    constructor(initialCapacity?: number);
+    private hash;
+    private getBucketIndex;
+    private findEntry;
+    private keysEqual;
+    private resize;
+    size(): number;
+    isEmpty(): boolean;
+    put(key: K, value: V): V | undefined;
+    get(key: K): V | undefined;
+    containsKey(key: K): boolean;
+    containsValue(value: V): boolean;
+    remove(key: K): V | undefined;
+    clear(): void;
+    keys(): K[];
+    values(): V[];
+    entries(): [K, V][];
+    [Symbol.iterator](): Iterator<[K, V]>;
+}
+//# sourceMappingURL=HashMap.d.ts.map

package/dist/src/modules/maps/HashMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"HashMap.d.ts","sourceRoot":"","sources":["../../../../src/modules/maps/HashMap.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,yBAAyB,CAAC;AAQnD,qBAAa,OAAO,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7C,OAAO,CAAC,OAAO,CAAgC;IAC/C,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAM;IAC9C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAQ;gBAE/B,eAAe,GAAE,MAAiC;IAK9D,OAAO,CAAC,IAAI;IAWZ,OAAO,CAAC,cAAc;IAItB,OAAO,CAAC,SAAS;IAkBjB,OAAO,CAAC,SAAS;IAUjB,OAAO,CAAC,MAAM;IAcd,IAAI,IAAI,MAAM;IAId,OAAO,IAAI,OAAO;IAIlB,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IA4BpC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAK1B,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAI5B,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAiBhC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAqB7B,KAAK,IAAI,IAAI;IAKb,IAAI,IAAI,CAAC,EAAE;IAYX,MAAM,IAAI,CAAC,EAAE;IAYb,OAAO,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;IAYlB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CASvC"}

package/dist/src/modules/maps/HashMap.js

@@ -0,0 +1,170 @@
+export class HashMap {
+    buckets;
+    _size;
+    static DEFAULT_CAPACITY = 16;
+    static LOAD_FACTOR = 0.75;
+    constructor(initialCapacity = HashMap.DEFAULT_CAPACITY) {
+        this.buckets = new Array(initialCapacity);
+        this._size = 0;
+    }
+    hash(key) {
+        const stringKey = String(key);
+        let hash = 0;
+        for (let i = 0; i < stringKey.length; i++) {
+            const char = stringKey.charCodeAt(i);
+            hash = (hash << 5) - hash + char;
+            hash = hash & hash; // Convert to 32bit integer
+        }
+        return Math.abs(hash);
+    }
+    getBucketIndex(hash) {
+        return hash % this.buckets.length;
+    }
+    findEntry(key) {
+        const hash = this.hash(key);
+        const bucketIndex = this.getBucketIndex(hash);
+        const bucket = this.buckets[bucketIndex];
+        if (!bucket) {
+            return undefined;
+        }
+        for (const entry of bucket) {
+            if (this.keysEqual(entry.key, key)) {
+                return entry;
+            }
+        }
+        return undefined;
+    }
+    keysEqual(key1, key2) {
+        if (key1 === key2) {
+            return true;
+        }
+        if (typeof key1 === 'object' && typeof key2 === 'object' && key1 !== null && key2 !== null) {
+            return JSON.stringify(key1) === JSON.stringify(key2);
+        }
+        return false;
+    }
+    resize() {
+        const oldBuckets = this.buckets;
+        this.buckets = new Array(oldBuckets.length * 2);
+        this._size = 0;
+        for (const bucket of oldBuckets) {
+            if (bucket) {
+                for (const entry of bucket) {
+                    this.put(entry.key, entry.value);
+                }
+            }
+        }
+    }
+    size() {
+        return this._size;
+    }
+    isEmpty() {
+        return this._size === 0;
+    }
+    put(key, value) {
+        const hash = this.hash(key);
+        const bucketIndex = this.getBucketIndex(hash);
+        if (!this.buckets[bucketIndex]) {
+            this.buckets[bucketIndex] = [];
+        }
+        const bucket = this.buckets[bucketIndex];
+        for (const entry of bucket) {
+            if (this.keysEqual(entry.key, key)) {
+                const oldValue = entry.value;
+                entry.value = value;
+                return oldValue;
+            }
+        }
+        bucket.push({ key, value, hash });
+        this._size++;
+        if (this._size / this.buckets.length > HashMap.LOAD_FACTOR) {
+            this.resize();
+        }
+        return undefined;
+    }
+    get(key) {
+        const entry = this.findEntry(key);
+        return entry?.value;
+    }
+    containsKey(key) {
+        return this.findEntry(key) !== undefined;
+    }
+    containsValue(value) {
+        for (const bucket of this.buckets) {
+            if (bucket) {
+                for (const entry of bucket) {
+                    if (entry.value === value ||
+                        (typeof entry.value === 'object' &&
+                            JSON.stringify(entry.value) === JSON.stringify(value))) {
+                        return true;
+                    }
+                }
+            }
+        }
+        return false;
+    }
+    remove(key) {
+        const hash = this.hash(key);
+        const bucketIndex = this.getBucketIndex(hash);
+        const bucket = this.buckets[bucketIndex];
+        if (!bucket) {
+            return undefined;
+        }
+        for (let i = 0; i < bucket.length; i++) {
+            const entry = bucket[i];
+            if (entry && this.keysEqual(entry.key, key)) {
+                const removedEntry = bucket.splice(i, 1)[0];
+                this._size--;
+                return removedEntry?.value;
+            }
+        }
+        return undefined;
+    }
+    clear() {
+        this.buckets = new Array(HashMap.DEFAULT_CAPACITY);
+        this._size = 0;
+    }
+    keys() {
+        const keys = [];
+        for (const bucket of this.buckets) {
+            if (bucket) {
+                for (const entry of bucket) {
+                    keys.push(entry.key);
+                }
+            }
+        }
+        return keys;
+    }
+    values() {
+        const values = [];
+        for (const bucket of this.buckets) {
+            if (bucket) {
+                for (const entry of bucket) {
+                    values.push(entry.value);
+                }
+            }
+        }
+        return values;
+    }
+    entries() {
+        const entries = [];
+        for (const bucket of this.buckets) {
+            if (bucket) {
+                for (const entry of bucket) {
+                    entries.push([entry.key, entry.value]);
+                }
+            }
+        }
+        return entries;
+    }
+    *[Symbol.iterator]() {
+        for (const bucket of this.buckets) {
+            if (bucket) {
+                for (const entry of bucket) {
+                    yield [entry.key, entry.value];
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=HashMap.js.map

package/dist/src/modules/maps/HashMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HashMap.js","sourceRoot":"","sources":["../../../../src/modules/maps/HashMap.ts"],"names":[],"mappings":"AAQA,MAAM,OAAO,OAAO;IACV,OAAO,CAAgC;IACvC,KAAK,CAAS;IACd,MAAM,CAAU,gBAAgB,GAAG,EAAE,CAAC;IACtC,MAAM,CAAU,WAAW,GAAG,IAAI,CAAC;IAE3C,YAAY,kBAA0B,OAAO,CAAC,gBAAgB;QAC5D,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAEO,IAAI,CAAC,GAAM;QACjB,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,IAAI,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;YACjC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,2BAA2B;QACjD,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAEO,cAAc,CAAC,IAAY;QACjC,OAAO,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IACpC,CAAC;IAEO,SAAS,CAAC,GAAM;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAEzC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,SAAS,CAAC,IAAO,EAAE,IAAO;QAChC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAC3F,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,MAAM;QACZ,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAEf,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;YAChC,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAE9C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;QACjC,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAE,CAAC;QAE1C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC7B,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;gBACpB,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;YAC3D,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAClC,OAAO,KAAK,EAAE,KAAK,CAAC;IACtB,CAAC;IAED,WAAW,CAAC,GAAM;QAChB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IAC3C,CAAC;IAED,aAAa,CAAC,KAAQ;QACpB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,IACE,KAAK,CAAC,KAAK,KAAK,KAAK;wBACrB,CAAC,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ;4BAC9B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EACxD,CAAC;wBACD,OAAO,IAAI,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAEzC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5C,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,OAAO,YAAY,EAAE,KAAK,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,IAAI;QACF,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM;QACJ,MAAM,MAAM,GAAQ,EAAE,CAAC;QACvB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO;QACL,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC"}

package/package.json

@@ -0,0 +1,62 @@
+{
+  "name": "alchemist-collections",
+  "version": "0.0.1",
+  "description": "A Java-like collections framework for TypeScript.",
+  "main": "dist/src/index.js",
+  "module": "./dist/src/index.js",
+  "types": "./dist/src/index.js",
+  "exports": {
+    ".": {
+      "types": "./dist/src/index.js",
+      "import": "./dist/src/index.js"
+    }
+  },
+  "scripts": {
+    "dev": "npm run test:watch",
+    "build": "rm -rf dist && tsc && tsc-alias",
+    "prepublishOnly": "npm run build && npm run test",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:ui": "vitest --ui",
+    "test:coverage": "vitest run --coverage",
+    "lint": "eslint .",
+    "lint:fix": "eslint . --fix",
+    "format": "prettier --write \"src/**/*.ts\""
+  },
+  "keywords": [
+    "arraylist",
+    "collections",
+    "typescript",
+    "data-structures",
+    "java-like",
+    "framework",
+    "library",
+    "typescript-collections"
+  ],
+  "author": "Andrés Duarte <andres.duarte.marquez@gmail.com>",
+  "license": "MIT",
+  "type": "module",
+  "files": [
+    "dist/src",
+    "dist/index.js",
+    "dist/index.d.ts",
+    "README.md",
+    "LICENSE"
+  ],
+  "devDependencies": {
+    "@eslint/js": "^10.0.1",
+    "@types/node": "^25.6.1",
+    "@vitest/coverage-v8": "^4.1.5",
+    "eslint": "^10.3.0",
+    "eslint-config-prettier": "^10.1.8",
+    "eslint-plugin-prettier": "^5.5.5",
+    "globals": "^17.6.0",
+    "pino-pretty": "^13.1.3",
+    "prettier": "^3.8.3",
+    "tsc-alias": "^1.8.17",
+    "tsx": "^4.21.0",
+    "typescript": "^6.0.3",
+    "typescript-eslint": "^8.59.2",
+    "vitest": "^4.1.5"
+  }
+}