@procedures/collections 0.46.0 → 0.47.2

package/dist/interfaces/collection.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"collection.d.ts","sourceRoot":"","sources":["../../src/interfaces/collection.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,mBAAmB,CAAC;AAE5C;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB,CAAC,CAAC,CAAE,SAAQ,QAAQ,CAAC,CAAC,CAAC;IACxD;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE9B;;;;OAIG;IACH,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAEzC;;;OAGG;IACH,OAAO,IAAI,CAAC,EAAE,CAAC;IAEf;;;;OAIG;IACH,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC;IAE3D;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACpB;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC,CAAE,SAAQ,kBAAkB,CAAC,CAAC,CAAC;IAC1D;;;;;;;;;OASG;IACH,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAEzB;;;;;OAKG;IACH,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAEpC;;;;;;;OAOG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE5B;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAEvC;;;;;;OAMG;IACH,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAEvC;;;OAGG;IACH,KAAK,IAAI,IAAI,CAAC;CACf;AAED;;GAEG;AACH,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,kBAAkB,CAAC,GAAG,CAAC,GACzD,CAAC,SAAS,UAAU,CAAC,GAAG,CAAC,GACvB,KAAK,GACL,IAAI,GACN,KAAK,CAAC;AAEV;;GAEG;AACH,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,kBAAkB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAE7E;;GAEG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,SAAS,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,UAAU,CAAC,MAAM,CAAC,CAAC,GAC3E,kBAAkB,CAAC,CAAC,CAAC,GACrB,KAAK,CAAC"}

package/dist/interfaces/collection.js

@@ -1,8 +0,0 @@
-/**
- * Base collection interfaces that mirror Java Collections Framework.
- *
- * These form the root of the collection hierarchy and define the
- * fundamental operations common to all collections.
- */
-export {};
-//# sourceMappingURL=collection.js.map

package/dist/interfaces/collection.js.map

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

package/dist/interfaces/list.d.ts

@@ -1,247 +0,0 @@
-/**
- * List interfaces that mirror Java's List interface.
- *
- * Lists are ordered collections that allow duplicate elements
- * and provide positional (indexed) access to elements.
- */
-import type { Collection, ReadonlyCollection } from "./collection.js";
-import type { Compare } from "../core/traits.js";
-/**
- * ReadonlyList<T> - Readonly ordered collection with indexed access.
- *
- * Mirrors java.util.List but without mutation operations.
- * Elements maintain their insertion order and can be accessed by index.
- */
-export interface ReadonlyList<T> extends ReadonlyCollection<T> {
-    /**
-     * Returns the element at the specified position.
-     *
-     * @param index The index of the element to return (0-based)
-     * @returns The element at the specified position
-     * @throws RangeError if index is out of bounds
-     */
-    get(index: number): T;
-    /**
-     * Returns the index of the first occurrence of the specified element,
-     * or -1 if not found.
-     *
-     * @param element The element to search for
-     * @param fromIndex Optional starting index for the search
-     */
-    indexOf(element: T, fromIndex?: number): number;
-    /**
-     * Returns the index of the last occurrence of the specified element,
-     * or -1 if not found.
-     *
-     * @param element The element to search for
-     * @param fromIndex Optional starting index for backwards search
-     */
-    lastIndexOf(element: T, fromIndex?: number): number;
-    /**
-     * Returns a view of the portion of this list between fromIndex (inclusive)
-     * and toIndex (exclusive).
-     *
-     * Changes to the sublist are reflected in the original list.
-     *
-     * @param fromIndex Start index (inclusive)
-     * @param toIndex End index (exclusive)
-     */
-    subList(fromIndex: number, toIndex: number): ReadonlyList<T>;
-    /**
-     * Returns the first element in the list.
-     *
-     * @throws Error if list is empty
-     */
-    first(): T;
-    /**
-     * Returns the last element in the list.
-     *
-     * @throws Error if list is empty
-     */
-    last(): T;
-}
-/**
- * List<T> - Mutable ordered collection with indexed access.
- *
- * Mirrors java.util.List with full mutation capabilities.
- * Provides methods to insert, replace, and remove elements by index.
- */
-export interface List<T> extends ReadonlyList<T>, Collection<T> {
-    /**
-     * Replaces the element at the specified position.
-     *
-     * @param index The index of the element to replace
-     * @param element The new element
-     * @returns The element previously at the specified position
-     * @throws RangeError if index is out of bounds
-     */
-    set(index: number, element: T): T;
-    /**
-     * Inserts an element at the specified position.
-     * Shifts elements at and after the position to the right.
-     *
-     * @param index The index at which to insert
-     * @param element The element to insert
-     * @throws RangeError if index is out of bounds (0 to size inclusive)
-     */
-    insert(index: number, element: T): void;
-    /**
-     * Inserts all elements from the specified collection at the specified position.
-     *
-     * @param index The index at which to insert
-     * @param other The collection whose elements to insert
-     * @returns true if the list changed
-     */
-    insertAll(index: number, other: Iterable<T>): boolean;
-    /**
-     * Removes the element at the specified position.
-     * Shifts elements after the position to the left.
-     *
-     * @param index The index of the element to remove
-     * @returns The element that was removed
-     * @throws RangeError if index is out of bounds
-     */
-    removeAt(index: number): T;
-    /**
-     * Removes elements in the specified index range.
-     *
-     * @param fromIndex Start index (inclusive)
-     * @param toIndex End index (exclusive)
-     */
-    removeRange(fromIndex: number, toIndex: number): void;
-    /**
-     * Sorts this list according to the specified comparator.
-     *
-     * @param compare The comparison function
-     */
-    sort(compare?: Compare<T>): void;
-    /**
-     * Reverses the order of elements in this list.
-     */
-    reverse(): void;
-    /**
-     * Returns a mutable sublist view.
-     *
-     * @param fromIndex Start index (inclusive)
-     * @param toIndex End index (exclusive)
-     */
-    subList(fromIndex: number, toIndex: number): List<T>;
-    /**
-     * Appends an element to the end of this list.
-     * Equivalent to add() but doesn't return boolean.
-     *
-     * @param element The element to append
-     */
-    push(element: T): void;
-    /**
-     * Removes and returns the last element in this list.
-     *
-     * @returns The last element
-     * @throws Error if list is empty
-     */
-    pop(): T;
-    /**
-     * Removes and returns the first element in this list.
-     *
-     * @returns The first element
-     * @throws Error if list is empty
-     */
-    shift(): T;
-    /**
-     * Prepends an element to the beginning of this list.
-     *
-     * @param element The element to prepend
-     */
-    unshift(element: T): void;
-}
-/**
- * RandomAccess - Marker interface for lists with O(1) indexed access.
- *
- * Indicates that the list provides fast (constant-time) random access.
- * Examples: ArrayList (yes), LinkedList (no).
- */
-export interface RandomAccess {
-    /**
-     * Marker property to indicate random access capability.
-     * Always true for collections implementing this interface.
-     */
-    readonly supportsRandomAccess: true;
-}
-/**
- * Stack<T> - LIFO (Last-In-First-Out) collection.
- *
- * A stack of elements with push/pop operations.
- * Can be implemented as a specialized list or standalone.
- */
-export interface Stack<T> extends Iterable<T> {
-    /** Number of elements */
-    readonly size: number;
-    /** True if empty */
-    readonly isEmpty: boolean;
-    /**
-     * Pushes an element onto the stack.
-     */
-    push(element: T): void;
-    /**
-     * Removes and returns the top element.
-     *
-     * @throws Error if stack is empty
-     */
-    pop(): T;
-    /**
-     * Returns the top element without removing it.
-     *
-     * @throws Error if stack is empty
-     */
-    peek(): T;
-    /**
-     * Removes all elements.
-     */
-    clear(): void;
-    /**
-     * Searches for an element and returns its distance from the top.
-     * Returns -1 if not found.
-     */
-    search(element: T): number;
-}
-/**
- * Vector<T> - Synchronized growable array.
- *
- * Like ArrayList but with synchronized access.
- * Legacy interface from Java; in our framework, use compose(synchronized())(arrayList()) instead.
- */
-export interface Vector<T> extends List<T> {
-    /**
-     * Current capacity of the underlying array.
-     */
-    readonly capacity: number;
-    /**
-     * Trims capacity to current size to minimize memory usage.
-     */
-    trimToSize(): void;
-    /**
-     * Increases capacity to ensure it can hold at least the specified number of elements.
-     */
-    ensureCapacity(minCapacity: number): void;
-}
-/**
- * CircularList<T> - List with circular/ring buffer behavior.
- *
- * When capacity is reached, oldest elements are overwritten.
- * Useful for fixed-size buffers like logs or history.
- */
-export interface CircularList<T> extends List<T> {
-    /**
-     * Maximum capacity of the circular list.
-     */
-    readonly capacity: number;
-    /**
-     * Returns true if the list has reached capacity.
-     */
-    readonly isFull: boolean;
-    /**
-     * Number of elements that have been overwritten.
-     */
-    readonly overwriteCount: number;
-}
-//# sourceMappingURL=list.d.ts.map

package/dist/interfaces/list.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../../src/interfaces/list.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACtE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAEjD;;;;;GAKG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,CAAE,SAAQ,kBAAkB,CAAC,CAAC,CAAC;IAC5D;;;;;;OAMG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;IAEtB;;;;;;OAMG;IACH,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAEhD;;;;;;OAMG;IACH,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAEpD;;;;;;;;OAQG;IACH,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAE7D;;;;OAIG;IACH,KAAK,IAAI,CAAC,CAAC;IAEX;;;;OAIG;IACH,IAAI,IAAI,CAAC,CAAC;CACX;AAED;;;;;GAKG;AACH,MAAM,WAAW,IAAI,CAAC,CAAC,CAAE,SAAQ,YAAY,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAC7D;;;;;;;OAOG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;IAElC;;;;;;;OAOG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IAExC;;;;;;OAMG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAEtD;;;;;;;OAOG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,CAAC;IAE3B;;;;;OAKG;IACH,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAEtD;;;;OAIG;IACH,IAAI,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAEjC;;OAEG;IACH,OAAO,IAAI,IAAI,CAAC;IAEhB;;;;;OAKG;IACH,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAIrD;;;;;OAKG;IACH,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IAEvB;;;;;OAKG;IACH,GAAG,IAAI,CAAC,CAAC;IAET;;;;;OAKG;IACH,KAAK,IAAI,CAAC,CAAC;IAEX;;;;OAIG;IACH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,QAAQ,CAAC,oBAAoB,EAAE,IAAI,CAAC;CACrC;AAED;;;;;GAKG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,CAAE,SAAQ,QAAQ,CAAC,CAAC,CAAC;IAC3C,yBAAyB;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,oBAAoB;IACpB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B;;OAEG;IACH,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IAEvB;;;;OAIG;IACH,GAAG,IAAI,CAAC,CAAC;IAET;;;;OAIG;IACH,IAAI,IAAI,CAAC,CAAC;IAEV;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;;OAGG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM,CAAC;CAC5B;AAED;;;;;GAKG;AACH,MAAM,WAAW,MAAM,CAAC,CAAC,CAAE,SAAQ,IAAI,CAAC,CAAC,CAAC;IACxC;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAE1B;;OAEG;IACH,UAAU,IAAI,IAAI,CAAC;IAEnB;;OAEG;IACH,cAAc,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3C;AAED;;;;;GAKG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,CAAE,SAAQ,IAAI,CAAC,CAAC,CAAC;IAC9C;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAE1B;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IAEzB;;OAEG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;CACjC"}

package/dist/interfaces/list.js

@@ -1,8 +0,0 @@
-/**
- * List interfaces that mirror Java's List interface.
- *
- * Lists are ordered collections that allow duplicate elements
- * and provide positional (indexed) access to elements.
- */
-export {};
-//# sourceMappingURL=list.js.map

package/dist/interfaces/list.js.map

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

package/dist/interfaces/map.d.ts

@@ -1,344 +0,0 @@
-/**
- * Map interfaces that mirror Java's Map interface hierarchy.
- *
- * Maps store key-value pairs and provide efficient lookup by key.
- * Keys are unique within a map.
- */
-import type { Eq, Compare } from "../core/traits.js";
-import type { ReadonlyCollection } from "./collection.js";
-/**
- * Entry<K, V> - An immutable key-value pair from a map.
- *
- * Unlike java.util.Map.Entry which has setValue(), our entries are immutable
- * snapshots. To update a value, use map.set(key, newValue) instead.
- *
- * This prevents accidental mutation and makes entries safe to share.
- */
-export interface Entry<K, V> {
-    readonly key: K;
-    readonly value: V;
-}
-/**
- * ReadonlyMapLike<K, V> - Readonly key-value mapping.
- *
- * Provides read-only access to map operations.
- * Note: We use "MapLike" to avoid conflicts with TypeScript's built-in Map type.
- */
-export interface ReadonlyMapLike<K, V> extends Iterable<Entry<K, V>> {
-    /**
-     * Returns the number of key-value pairs in this map.
-     */
-    readonly size: number;
-    /**
-     * Returns true if this map contains no key-value mappings.
-     */
-    readonly isEmpty: boolean;
-    /**
-     * Returns true if this map contains a mapping for the specified key.
-     */
-    has(key: K): boolean;
-    /**
-     * Returns the value to which the specified key is mapped.
-     *
-     * @throws Error if key is not present
-     */
-    get(key: K): V;
-    /**
-     * Returns the value for the key, or undefined if not present.
-     */
-    getOrUndefined(key: K): V | undefined;
-    /**
-     * Returns the value for the key, or the default value if not present.
-     */
-    getOrDefault(key: K, defaultValue: V): V;
-    /**
-     * Returns true if this map maps one or more keys to the specified value.
-     */
-    containsValue(value: V): boolean;
-    /**
-     * Returns an iterable view of the keys in this map.
-     */
-    keys(): Iterable<K>;
-    /**
-     * Returns an iterable view of the values in this map.
-     */
-    values(): Iterable<V>;
-    /**
-     * Returns an iterable view of the key-value pairs in this map.
-     */
-    entries(): Iterable<Entry<K, V>>;
-    /**
-     * Performs the given action for each key-value pair.
-     */
-    forEach(action: (value: V, key: K, map: this) => void): void;
-    /**
-     * Returns the equality function used for keys.
-     */
-    readonly keyEq: Eq<K>;
-    /**
-     * Returns the equality function used for values.
-     */
-    readonly valueEq: Eq<V>;
-}
-/**
- * MapLike<K, V> - Mutable key-value mapping.
- *
- * Mirrors java.util.Map.
- */
-export interface MapLike<K, V> extends ReadonlyMapLike<K, V> {
-    /**
-     * Associates the specified value with the specified key in this map.
-     * If the map previously contained a mapping for the key, the old value is replaced.
-     *
-     * @param key The key
-     * @param value The value
-     * @returns The previous value associated with key, or undefined if none
-     */
-    set(key: K, value: V): V | undefined;
-    /**
-     * Associates value with key only if key is not already present.
-     *
-     * @returns The current value (existing or newly set)
-     */
-    setIfAbsent(key: K, value: V): V;
-    /**
-     * Removes the mapping for a key if it is present.
-     *
-     * @returns The value that was associated with key, or undefined if none
-     */
-    delete(key: K): V | undefined;
-    /**
-     * Removes the entry for key only if currently mapped to the specified value.
-     *
-     * @returns true if the entry was removed
-     */
-    deleteEntry(key: K, value: V): boolean;
-    /**
-     * Replaces the entry for key only if currently mapped to some value.
-     *
-     * @returns The previous value, or undefined if key was not present
-     */
-    replace(key: K, value: V): V | undefined;
-    /**
-     * Replaces the entry for key only if currently mapped to the specified oldValue.
-     *
-     * @returns true if the value was replaced
-     */
-    replaceEntry(key: K, oldValue: V, newValue: V): boolean;
-    /**
-     * If the specified key is not already associated with a value,
-     * computes its value using the given function and enters it into the map.
-     *
-     * @returns The current (existing or computed) value associated with the key
-     */
-    computeIfAbsent(key: K, mappingFunction: (key: K) => V): V;
-    /**
-     * If the value for the specified key is present, attempts to compute
-     * a new mapping given the key and its current mapped value.
-     *
-     * @returns The new value associated with the key, or undefined if none
-     */
-    computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined;
-    /**
-     * Attempts to compute a mapping for the specified key and its current mapped value.
-     *
-     * @returns The new value associated with the key, or undefined if none
-     */
-    compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined;
-    /**
-     * If the specified key is not already associated with a value or is
-     * associated with undefined, associates it with the given non-undefined value.
-     * Otherwise, replaces the value with the results of the given remapping function.
-     *
-     * @returns The new value associated with the key, or undefined if none
-     */
-    merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined;
-    /**
-     * Copies all mappings from the specified map to this map.
-     */
-    putAll(other: ReadonlyMapLike<K, V> | Iterable<Entry<K, V>>): void;
-    /**
-     * Removes all mappings from this map.
-     */
-    clear(): void;
-}
-/**
- * SortedMap<K, V> - Map that maintains keys in sorted order.
- *
- * Mirrors java.util.SortedMap.
- */
-export interface SortedMap<K, V> extends MapLike<K, V> {
-    /**
-     * Returns the comparison function used to order keys.
-     */
-    readonly comparator: Compare<K>;
-    /**
-     * Returns the first (lowest) key in this map.
-     *
-     * @throws Error if map is empty
-     */
-    firstKey(): K;
-    /**
-     * Returns the last (highest) key in this map.
-     *
-     * @throws Error if map is empty
-     */
-    lastKey(): K;
-    /**
-     * Returns a view of the portion of this map whose keys are less than toKey.
-     */
-    headMap(toKey: K): SortedMap<K, V>;
-    /**
-     * Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
-     */
-    tailMap(fromKey: K): SortedMap<K, V>;
-    /**
-     * Returns a view of the portion of this map whose keys range from fromKey to toKey.
-     */
-    subMap(fromKey: K, toKey: K): SortedMap<K, V>;
-}
-/**
- * NavigableMap<K, V> - Extended sorted map with navigation methods.
- *
- * Mirrors java.util.NavigableMap.
- */
-export interface NavigableMap<K, V> extends SortedMap<K, V> {
-    /**
-     * Returns the greatest key less than or equal to the given key, or undefined if none.
-     */
-    floorKey(key: K): K | undefined;
-    /**
-     * Returns the least key greater than or equal to the given key, or undefined if none.
-     */
-    ceilingKey(key: K): K | undefined;
-    /**
-     * Returns the greatest key strictly less than the given key, or undefined if none.
-     */
-    lowerKey(key: K): K | undefined;
-    /**
-     * Returns the least key strictly greater than the given key, or undefined if none.
-     */
-    higherKey(key: K): K | undefined;
-    /**
-     * Returns the entry for the greatest key less than or equal to the given key, or undefined.
-     */
-    floorEntry(key: K): Entry<K, V> | undefined;
-    /**
-     * Returns the entry for the least key greater than or equal to the given key, or undefined.
-     */
-    ceilingEntry(key: K): Entry<K, V> | undefined;
-    /**
-     * Returns the entry for the greatest key strictly less than the given key, or undefined.
-     */
-    lowerEntry(key: K): Entry<K, V> | undefined;
-    /**
-     * Returns the entry for the least key strictly greater than the given key, or undefined.
-     */
-    higherEntry(key: K): Entry<K, V> | undefined;
-    /**
-     * Returns the first (lowest) entry in this map, or undefined if empty.
-     */
-    firstEntry(): Entry<K, V> | undefined;
-    /**
-     * Returns the last (highest) entry in this map, or undefined if empty.
-     */
-    lastEntry(): Entry<K, V> | undefined;
-    /**
-     * Removes and returns the first (lowest) entry, or undefined if empty.
-     */
-    pollFirstEntry(): Entry<K, V> | undefined;
-    /**
-     * Removes and returns the last (highest) entry, or undefined if empty.
-     */
-    pollLastEntry(): Entry<K, V> | undefined;
-    /**
-     * Returns a reverse order view of this map.
-     */
-    descendingMap(): NavigableMap<K, V>;
-    /**
-     * Returns a reverse order iterable of the keys.
-     */
-    descendingKeys(): Iterable<K>;
-}
-/**
- * MultiMap<K, V> - Map that allows multiple values per key.
- *
- * Not in standard Java Collections, but commonly used.
- */
-export interface MultiMap<K, V> {
-    readonly size: number;
-    readonly isEmpty: boolean;
-    /**
-     * Returns true if the map contains at least one value for the key.
-     */
-    has(key: K): boolean;
-    /**
-     * Returns all values associated with the key.
-     */
-    get(key: K): ReadonlyCollection<V>;
-    /**
-     * Adds a value to the collection of values for the key.
-     */
-    put(key: K, value: V): boolean;
-    /**
-     * Adds all values to the collection of values for the key.
-     */
-    putAll(key: K, values: Iterable<V>): boolean;
-    /**
-     * Removes a single occurrence of value from the key's collection.
-     */
-    remove(key: K, value: V): boolean;
-    /**
-     * Removes all values for the key.
-     */
-    removeAll(key: K): ReadonlyCollection<V>;
-    /**
-     * Replaces all values for the key with the given values.
-     */
-    replaceAll(key: K, values: Iterable<V>): ReadonlyCollection<V>;
-    /**
-     * Returns all keys that have at least one value.
-     */
-    keys(): Iterable<K>;
-    /**
-     * Returns all entries (key with one of its values).
-     */
-    entries(): Iterable<Entry<K, V>>;
-    /**
-     * Removes all mappings.
-     */
-    clear(): void;
-}
-/**
- * BiMap<K, V> - Bidirectional map (1:1 mapping).
- *
- * Both keys and values are unique.
- * Allows lookup by key or by value.
- */
-export interface BiMap<K, V> extends MapLike<K, V> {
-    /**
-     * Returns the inverse view of this bimap (swaps keys and values).
-     */
-    inverse(): BiMap<V, K>;
-    /**
-     * Returns the key mapped to the specified value, or undefined if none.
-     */
-    getKey(value: V): K | undefined;
-    /**
-     * Forces the put by removing any existing entry with the same value.
-     */
-    forcePut(key: K, value: V): V | undefined;
-}
-/**
- * WeakMapLike<K extends object, V> - Map with weak key references.
- *
- * Mirrors JavaScript's WeakMap but with our interface conventions.
- * Keys must be objects and are held weakly (allow garbage collection).
- */
-export interface WeakMapLike<K extends object, V> {
-    has(key: K): boolean;
-    get(key: K): V | undefined;
-    set(key: K, value: V): this;
-    delete(key: K): boolean;
-}
-//# sourceMappingURL=map.d.ts.map

package/dist/interfaces/map.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../src/interfaces/map.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAE1D;;;;;;;GAOG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;IACzB,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;IAChB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;CACnB;AAED;;;;;GAKG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAErB;;;;OAIG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IAEf;;OAEG;IACH,cAAc,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEtC;;OAEG;IACH,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC;IAEzC;;OAEG;IACH,aAAa,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAEjC;;OAEG;IACH,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEpB;;OAEG;IACH,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEtB;;OAEG;IACH,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjC;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;IAE7D;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAEtB;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACzB;AAED;;;;GAIG;AACH,MAAM,WAAW,OAAO,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC;IAC1D;;;;;;;OAOG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAErC;;;;OAIG;IACH,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;IAEjC;;;;OAIG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAE9B;;;;OAIG;IACH,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAEvC;;;;OAIG;IACH,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEzC;;;;OAIG;IACH,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,GAAG,OAAO,CAAC;IAExD;;;;;OAKG;IACH,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAE3D;;;;;OAKG;IACH,gBAAgB,CAAC,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC;IAEhG;;;;OAIG;IACH,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC;IAEnG;;;;;;OAMG;IACH,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC;IAEvG;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAEnE;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;CACf;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACpD;;OAEG;IACH,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAEhC;;;;OAIG;IACH,QAAQ,IAAI,CAAC,CAAC;IAEd;;;;OAIG;IACH,OAAO,IAAI,CAAC,CAAC;IAEb;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnC;;OAEG;IACH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAErC;;OAEG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAC/C;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IACzD;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEhC;;OAEG;IACH,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAElC;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEhC;;OAEG;IACH,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEjC;;OAEG;IACH,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAE5C;;OAEG;IACH,YAAY,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAE9C;;OAEG;IACH,UAAU,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAE5C;;OAEG;IACH,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAE7C;;OAEG;IACH,UAAU,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAEtC;;OAEG;IACH,SAAS,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAErC;;OAEG;IACH,cAAc,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAE1C;;OAEG;IACH,aAAa,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;IAEzC;;OAEG;IACH,aAAa,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpC;;OAEG;IACH,cAAc,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;CAC/B;AAED;;;;GAIG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,EAAE,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IAErB;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAEnC;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAE/B;;OAEG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAE7C;;OAEG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC;IAElC;;OAEG;IACH,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAEzC;;OAEG;IACH,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAE/D;;OAEG;IACH,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEpB;;OAEG;IACH,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjC;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC,CAAE,SAAQ,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IAChD;;OAEG;IACH,OAAO,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEvB;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAEhC;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;CAC3C;AAED;;;;;GAKG;AACH,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC;IAC9C,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IACrB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAC3B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5B,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;CACzB"}

package/dist/interfaces/map.js

@@ -1,8 +0,0 @@
-/**
- * Map interfaces that mirror Java's Map interface hierarchy.
- *
- * Maps store key-value pairs and provide efficient lookup by key.
- * Keys are unique within a map.
- */
-export {};
-//# sourceMappingURL=map.js.map

package/dist/interfaces/map.js.map

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