@procedures/client 0.1.0 → 0.2.1

package/dist/collections/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/collections/interfaces/map.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../../src/collections/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/collections/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/collections/interfaces/map.js.map

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

package/dist/collections/interfaces/queue.d.ts

@@ -1,304 +0,0 @@
-/**
- * Queue and Deque interfaces that mirror Java's Queue and Deque.
- *
- * Queues are collections designed for holding elements prior to processing.
- * Deques (double-ended queues) allow efficient insertion/removal at both ends.
- */
-import type { Collection, ReadonlyCollection } from "./collection.js";
-import type { Compare } from "../core/traits.js";
-/**
- * ReadonlyQueue<T> - Readonly FIFO (First-In-First-Out) queue.
- *
- * Provides read-only access to queue operations.
- */
-export interface ReadonlyQueue<T> extends ReadonlyCollection<T> {
-    /**
-     * Retrieves, but does not remove, the head of this queue.
-     *
-     * @returns The head element
-     * @throws Error if queue is empty
-     */
-    peek(): T;
-    /**
-     * Returns the head element without throwing if empty.
-     * Returns undefined if queue is empty.
-     */
-    peekOrUndefined(): T | undefined;
-}
-/**
- * Queue<T> - FIFO (First-In-First-Out) queue.
- *
- * Mirrors java.util.Queue.
- * Elements are processed in the order they were added.
- */
-export interface Queue<T> extends ReadonlyQueue<T>, Collection<T> {
-    /**
-     * Inserts an element into the queue.
-     * For bounded queues with overflow='throw', throws if queue is full.
-     *
-     * @param element The element to add
-     * @returns true if element was added
-     * @throws Error if queue is full (bounded with throw policy)
-     */
-    offer(element: T): boolean;
-    /**
-     * Retrieves and removes the head of this queue.
-     *
-     * @returns The head element
-     * @throws Error if queue is empty
-     */
-    poll(): T;
-    /**
-     * Retrieves and removes the head of this queue, or returns undefined if empty.
-     */
-    pollOrUndefined(): T | undefined;
-    /**
-     * Alias for offer(). Adds element to end of queue.
-     * Included for consistency with standard queue terminology.
-     */
-    enqueue(element: T): boolean;
-    /**
-     * Alias for poll(). Removes and returns element from front of queue.
-     * Included for consistency with standard queue terminology.
-     */
-    dequeue(): T;
-}
-/**
- * Deque<T> - Double-ended queue.
- *
- * Mirrors java.util.Deque.
- * Supports insertion and removal at both ends.
- * Can be used as a queue (FIFO) or stack (LIFO).
- */
-export interface Deque<T> extends Queue<T> {
-    /**
-     * Inserts element at the front of this deque.
-     *
-     * @param element The element to add
-     * @throws Error if deque is full (bounded with throw policy)
-     */
-    addFirst(element: T): void;
-    /**
-     * Inserts element at the front, returning false if full.
-     */
-    offerFirst(element: T): boolean;
-    /**
-     * Retrieves and removes the first element.
-     *
-     * @throws Error if deque is empty
-     */
-    removeFirst(): T;
-    /**
-     * Retrieves and removes the first element, or undefined if empty.
-     */
-    pollFirst(): T | undefined;
-    /**
-     * Retrieves but does not remove the first element.
-     *
-     * @throws Error if deque is empty
-     */
-    peekFirst(): T;
-    /**
-     * Retrieves but does not remove the first element, or undefined if empty.
-     */
-    peekFirstOrUndefined(): T | undefined;
-    /**
-     * Inserts element at the end of this deque.
-     *
-     * @param element The element to add
-     * @throws Error if deque is full (bounded with throw policy)
-     */
-    addLast(element: T): void;
-    /**
-     * Inserts element at the end, returning false if full.
-     */
-    offerLast(element: T): boolean;
-    /**
-     * Retrieves and removes the last element.
-     *
-     * @throws Error if deque is empty
-     */
-    removeLast(): T;
-    /**
-     * Retrieves and removes the last element, or undefined if empty.
-     */
-    pollLast(): T | undefined;
-    /**
-     * Retrieves but does not remove the last element.
-     *
-     * @throws Error if deque is empty
-     */
-    peekLast(): T;
-    /**
-     * Retrieves but does not remove the last element, or undefined if empty.
-     */
-    peekLastOrUndefined(): T | undefined;
-    /**
-     * Pushes element onto the stack represented by this deque.
-     * Equivalent to addFirst().
-     *
-     * @param element The element to push
-     */
-    push(element: T): void;
-    /**
-     * Pops an element from the stack represented by this deque.
-     * Equivalent to removeFirst().
-     *
-     * @returns The popped element
-     * @throws Error if deque is empty
-     */
-    pop(): T;
-}
-/**
- * BlockingQueue<T> - Queue that supports blocking operations.
- *
- * Mirrors java.util.concurrent.BlockingQueue.
- * Useful for producer-consumer patterns.
- */
-export interface BlockingQueue<T> extends Queue<T> {
-    /**
-     * Inserts element, waiting if necessary for space to become available.
-     *
-     * @param element The element to add
-     * @param timeoutMs Optional timeout in milliseconds
-     * @returns Promise that resolves to true when element is added
-     * @throws Error if timeout expires
-     */
-    put(element: T, timeoutMs?: number): Promise<void>;
-    /**
-     * Retrieves and removes the head, waiting if necessary until an element is available.
-     *
-     * @param timeoutMs Optional timeout in milliseconds
-     * @returns Promise that resolves to the head element
-     * @throws Error if timeout expires
-     */
-    take(timeoutMs?: number): Promise<T>;
-    /**
-     * Returns the remaining capacity.
-     * Returns Infinity for unbounded queues.
-     */
-    readonly remainingCapacity: number;
-    /**
-     * Removes all available elements and adds them to the given array.
-     * Returns the number of elements transferred.
-     */
-    drainTo(target: T[], maxElements?: number): number;
-}
-/**
- * PriorityQueue<T> - Queue that orders elements by priority.
- *
- * Mirrors java.util.PriorityQueue.
- * Elements are removed in priority order (not insertion order).
- * Requires a comparison function to determine priority.
- */
-export interface PriorityQueue<T> extends Queue<T> {
-    /**
-     * The comparison function used to determine priority.
-     * Elements with lower compare value have higher priority.
-     */
-    readonly compare: Compare<T>;
-    /**
-     * Returns the comparator used to order elements, or undefined if natural ordering.
-     */
-    readonly comparator: Compare<T> | undefined;
-}
-/**
- * AsyncQueue<T> - Async iterable queue.
- *
- * Designed for async/await patterns and streaming data.
- * Implements AsyncIterable for use with for-await-of loops.
- */
-export interface AsyncQueue<T> extends AsyncIterable<T> {
-    /** Number of elements currently in queue */
-    readonly size: number;
-    /** True if queue is empty */
-    readonly isEmpty: boolean;
-    /**
-     * Adds element to queue.
-     * For bounded queues, may wait for space to become available.
-     */
-    put(element: T): Promise<void>;
-    /**
-     * Removes and returns next element.
-     * Waits for an element if queue is empty.
-     */
-    take(): Promise<T>;
-    /**
-     * Attempts to add element without waiting.
-     * Returns false if queue is full.
-     */
-    tryPut(element: T): boolean;
-    /**
-     * Attempts to remove element without waiting.
-     * Returns undefined if queue is empty.
-     */
-    tryTake(): T | undefined;
-    /**
-     * Returns next element without removing it.
-     * Waits for an element if queue is empty.
-     */
-    peek(): Promise<T>;
-    /**
-     * Closes the queue, preventing further additions.
-     * Allows existing elements to be consumed.
-     */
-    close(): void;
-    /**
-     * Returns true if queue is closed.
-     */
-    readonly isClosed: boolean;
-}
-/**
- * TransferQueue<T> - Queue where producers can wait for consumers.
- *
- * Mirrors java.util.concurrent.TransferQueue.
- * Useful for direct handoff between producer and consumer threads.
- */
-export interface TransferQueue<T> extends BlockingQueue<T> {
-    /**
-     * Transfers element to consumer, waiting if necessary.
-     * Waits for a consumer to receive the element.
-     *
-     * @param element The element to transfer
-     * @returns Promise that resolves when element is received
-     */
-    transfer(element: T): Promise<void>;
-    /**
-     * Attempts to transfer element to waiting consumer.
-     * Returns false immediately if no consumer is waiting.
-     *
-     * @param element The element to transfer
-     * @param timeoutMs Optional timeout in milliseconds
-     */
-    tryTransfer(element: T, timeoutMs?: number): Promise<boolean>;
-    /**
-     * Returns true if there are consumers waiting to receive elements.
-     */
-    readonly hasWaitingConsumer: boolean;
-    /**
-     * Returns an estimate of the number of consumers waiting to receive elements.
-     */
-    readonly waitingConsumerCount: number;
-}
-/**
- * DelayQueue<T> - Queue where elements become available after a delay.
- *
- * Mirrors java.util.concurrent.DelayQueue.
- * Elements can only be removed once their delay has expired.
- */
-export interface DelayQueue<T> extends BlockingQueue<T> {
-    /**
-     * Adds element with specified delay.
-     *
-     * @param element The element to add
-     * @param delayMs Delay in milliseconds before element becomes available (defaults to 0)
-     */
-    offer(element: T, delayMs?: number): boolean;
-    /**
-     * Returns the delay (in ms) until next element becomes available.
-     * Returns 0 if element is ready now.
-     * Returns Infinity if queue is empty.
-     */
-    readonly nextDelay: number;
-}
-//# sourceMappingURL=queue.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../../../src/collections/interfaces/queue.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;;;;GAIG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,CAAE,SAAQ,kBAAkB,CAAC,CAAC,CAAC;IAC7D;;;;;OAKG;IACH,IAAI,IAAI,CAAC,CAAC;IAEV;;;OAGG;IACH,eAAe,IAAI,CAAC,GAAG,SAAS,CAAC;CAClC;AAED;;;;;GAKG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,CAAE,SAAQ,aAAa,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAC/D;;;;;;;OAOG;IACH,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE3B;;;;;OAKG;IACH,IAAI,IAAI,CAAC,CAAC;IAEV;;OAEG;IACH,eAAe,IAAI,CAAC,GAAG,SAAS,CAAC;IAEjC;;;OAGG;IACH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE7B;;;OAGG;IACH,OAAO,IAAI,CAAC,CAAC;CACd;AAED;;;;;;GAMG;AACH,MAAM,WAAW,KAAK,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;IAGxC;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IAE3B;;OAEG;IACH,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAEhC;;;;OAIG;IACH,WAAW,IAAI,CAAC,CAAC;IAEjB;;OAEG;IACH,SAAS,IAAI,CAAC,GAAG,SAAS,CAAC;IAE3B;;;;OAIG;IACH,SAAS,IAAI,CAAC,CAAC;IAEf;;OAEG;IACH,oBAAoB,IAAI,CAAC,GAAG,SAAS,CAAC;IAItC;;;;;OAKG;IACH,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IAE1B;;OAEG;IACH,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE/B;;;;OAIG;IACH,UAAU,IAAI,CAAC,CAAC;IAEhB;;OAEG;IACH,QAAQ,IAAI,CAAC,GAAG,SAAS,CAAC;IAE1B;;;;OAIG;IACH,QAAQ,IAAI,CAAC,CAAC;IAEd;;OAEG;IACH,mBAAmB,IAAI,CAAC,GAAG,SAAS,CAAC;IAIrC;;;;;OAKG;IACH,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IAEvB;;;;;;OAMG;IACH,GAAG,IAAI,CAAC,CAAC;CACV;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;IAChD;;;;;;;OAOG;IACH,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEnD;;;;;;OAMG;IACH,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAErC;;;OAGG;IACH,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IAEnC;;;OAGG;IACH,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACpD;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;IAChD;;;OAGG;IACH,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IAE7B;;OAEG;IACH,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;CAC7C;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC,CAAE,SAAQ,aAAa,CAAC,CAAC,CAAC;IACrD,4CAA4C;IAC5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB,6BAA6B;IAC7B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAE1B;;;OAGG;IACH,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE/B;;;OAGG;IACH,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAEnB;;;OAGG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;IAE5B;;;OAGG;IACH,OAAO,IAAI,CAAC,GAAG,SAAS,CAAC;IAEzB;;;OAGG;IACH,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;IAEnB;;;OAGG;IACH,KAAK,IAAI,IAAI,CAAC;IAEd;;OAEG;IACH,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;CAC5B;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,CAAE,SAAQ,aAAa,CAAC,CAAC,CAAC;IACxD;;;;;;OAMG;IACH,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEpC;;;;;;OAMG;IACH,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAE9D;;OAEG;IACH,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC;IAErC;;OAEG;IACH,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;CACvC;AAED;;;;;GAKG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC,CAAE,SAAQ,aAAa,CAAC,CAAC,CAAC;IACrD;;;;;OAKG;IACH,KAAK,CAAC,OAAO,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAE7C;;;;OAIG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B"}

package/dist/collections/interfaces/queue.js

@@ -1,8 +0,0 @@
-/**
- * Queue and Deque interfaces that mirror Java's Queue and Deque.
- *
- * Queues are collections designed for holding elements prior to processing.
- * Deques (double-ended queues) allow efficient insertion/removal at both ends.
- */
-export {};
-//# sourceMappingURL=queue.js.map

package/dist/collections/interfaces/queue.js.map

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