@procedures/collections 0.0.0-stage → 0.1.0

package/dist/fx/iter.js

@@ -0,0 +1,421 @@
+/**
+ * Functional operations for iterables (lazy sync transforms).
+ *
+ * Provides Stream-like operations with lazy evaluation.
+ * All operations return generators for composability.
+ *
+ * @example
+ * const result = pipe(
+ *   [1, 2, 3, 4, 5],
+ *   map(x => x * 2),
+ *   filter(x => x > 5),
+ *   take(2),
+ *   toArray
+ * ) // [6, 8]
+ */
+// ============================================================================
+// Mapping and transformation
+// ============================================================================
+/**
+ * Maps each element through a function.
+ *
+ * @example
+ * const doubled = map([1, 2, 3], x => x * 2) // [2, 4, 6]
+ */
+export function* map(iterable, fn) {
+    let index = 0;
+    for (const value of iterable) {
+        yield fn(value, index++);
+    }
+}
+/**
+ * Filters elements based on a predicate.
+ */
+export function* filter(iterable, predicate) {
+    let index = 0;
+    for (const value of iterable) {
+        if (predicate(value, index++)) {
+            yield value;
+        }
+    }
+}
+/**
+ * FlatMaps each element to an iterable and flattens.
+ */
+export function* flatMap(iterable, fn) {
+    let index = 0;
+    for (const value of iterable) {
+        yield* fn(value, index++);
+    }
+}
+/**
+ * Flattens a nested iterable.
+ */
+export function* flatten(iterable) {
+    for (const inner of iterable) {
+        yield* inner;
+    }
+}
+// ============================================================================
+// Limiting and skipping
+// ============================================================================
+/**
+ * Takes the first n elements.
+ */
+export function* take(iterable, n) {
+    let count = 0;
+    for (const value of iterable) {
+        if (count++ >= n)
+            break;
+        yield value;
+    }
+}
+/**
+ * Skips the first n elements.
+ */
+export function* skip(iterable, n) {
+    let count = 0;
+    for (const value of iterable) {
+        if (count++ >= n) {
+            yield value;
+        }
+    }
+}
+/**
+ * Takes elements while predicate is true.
+ */
+export function* takeWhile(iterable, predicate) {
+    for (const value of iterable) {
+        if (!predicate(value))
+            break;
+        yield value;
+    }
+}
+/**
+ * Skips elements while predicate is true.
+ */
+export function* skipWhile(iterable, predicate) {
+    let skipping = true;
+    for (const value of iterable) {
+        if (skipping && predicate(value))
+            continue;
+        skipping = false;
+        yield value;
+    }
+}
+// ============================================================================
+// Combining
+// ============================================================================
+/**
+ * Concatenates multiple iterables.
+ */
+export function* concat(...iterables) {
+    for (const iterable of iterables) {
+        yield* iterable;
+    }
+}
+/**
+ * Zips multiple iterables together.
+ */
+export function* zip(...iterables) {
+    const iterators = iterables.map((it) => it[Symbol.iterator]());
+    while (true) {
+        const results = iterators.map((it) => it.next());
+        if (results.some((r) => r.done))
+            break;
+        yield results.map((r) => r.value);
+    }
+}
+/**
+ * Zips with index.
+ */
+export function* enumerate(iterable) {
+    let index = 0;
+    for (const value of iterable) {
+        yield [index++, value];
+    }
+}
+// ============================================================================
+// Partitioning
+// ============================================================================
+/**
+ * Chunks elements into arrays of specified size.
+ */
+export function* chunk(iterable, size) {
+    let chunk = [];
+    for (const value of iterable) {
+        chunk.push(value);
+        if (chunk.length === size) {
+            yield chunk;
+            chunk = [];
+        }
+    }
+    if (chunk.length > 0) {
+        yield chunk;
+    }
+}
+/**
+ * Creates a sliding window of specified size.
+ */
+export function* window(iterable, size) {
+    const window = [];
+    for (const value of iterable) {
+        window.push(value);
+        if (window.length > size) {
+            window.shift();
+        }
+        if (window.length === size) {
+            yield [...window];
+        }
+    }
+}
+/**
+ * Partitions elements into two arrays based on predicate.
+ */
+export function partition(iterable, predicate) {
+    const truthy = [];
+    const falsy = [];
+    for (const value of iterable) {
+        if (predicate(value)) {
+            truthy.push(value);
+        }
+        else {
+            falsy.push(value);
+        }
+    }
+    return [truthy, falsy];
+}
+// ============================================================================
+// Reducing and folding
+// ============================================================================
+/**
+ * Reduces iterable to a single value.
+ */
+export function reduce(iterable, fn, initial) {
+    let acc = initial;
+    let index = 0;
+    for (const value of iterable) {
+        acc = fn(acc, value, index++);
+    }
+    return acc;
+}
+/**
+ * Scans (like reduce but emits intermediate results).
+ */
+export function* scan(iterable, fn, initial) {
+    let acc = initial;
+    yield acc;
+    for (const value of iterable) {
+        acc = fn(acc, value);
+        yield acc;
+    }
+}
+// ============================================================================
+// Sorting and ordering
+// ============================================================================
+/**
+ * Sorts elements (materializes the iterable).
+ */
+export function* sort(iterable, compare) {
+    const array = Array.from(iterable);
+    array.sort(compare);
+    yield* array;
+}
+/**
+ * Reverses elements (materializes the iterable).
+ */
+export function* reverse(iterable) {
+    const array = Array.from(iterable);
+    array.reverse();
+    yield* array;
+}
+// ============================================================================
+// Distinct and uniqueness
+// ============================================================================
+/**
+ * Removes duplicate elements (by reference or key function).
+ */
+export function* distinct(iterable, keyFn) {
+    const seen = new Set();
+    for (const value of iterable) {
+        const key = (keyFn ? keyFn(value) : value);
+        if (!seen.has(key)) {
+            seen.add(key);
+            yield value;
+        }
+    }
+}
+/**
+ * Removes consecutive duplicates.
+ */
+export function* distinctConsecutive(iterable, keyFn) {
+    let lastKey;
+    let first = true;
+    for (const value of iterable) {
+        const key = (keyFn ? keyFn(value) : value);
+        if (first || key !== lastKey) {
+            yield value;
+            lastKey = key;
+            first = false;
+        }
+    }
+}
+// ============================================================================
+// Peeking and side effects
+// ============================================================================
+/**
+ * Performs a side effect for each element without modifying the stream.
+ */
+export function* tap(iterable, fn) {
+    let index = 0;
+    for (const value of iterable) {
+        fn(value, index++);
+        yield value;
+    }
+}
+// ============================================================================
+// Predicates and checks
+// ============================================================================
+/**
+ * Returns true if any element matches the predicate.
+ */
+export function some(iterable, predicate) {
+    for (const value of iterable) {
+        if (predicate(value))
+            return true;
+    }
+    return false;
+}
+/**
+ * Returns true if all elements match the predicate.
+ */
+export function every(iterable, predicate) {
+    for (const value of iterable) {
+        if (!predicate(value))
+            return false;
+    }
+    return true;
+}
+/**
+ * Returns true if no elements match the predicate.
+ */
+export function none(iterable, predicate) {
+    return !some(iterable, predicate);
+}
+/**
+ * Finds the first element matching the predicate.
+ */
+export function find(iterable, predicate) {
+    for (const value of iterable) {
+        if (predicate(value))
+            return value;
+    }
+    return undefined;
+}
+/**
+ * Counts elements (optionally matching a predicate).
+ */
+export function count(iterable, predicate) {
+    let count = 0;
+    for (const value of iterable) {
+        if (!predicate || predicate(value)) {
+            count++;
+        }
+    }
+    return count;
+}
+// ============================================================================
+// Min/Max
+// ============================================================================
+/**
+ * Returns the minimum element.
+ */
+export function min(iterable, compare) {
+    const cmp = compare || ((a, b) => a - b);
+    let minValue;
+    for (const value of iterable) {
+        if (minValue === undefined || cmp(value, minValue) < 0) {
+            minValue = value;
+        }
+    }
+    return minValue;
+}
+/**
+ * Returns the maximum element.
+ */
+export function max(iterable, compare) {
+    const cmp = compare || ((a, b) => a - b);
+    let maxValue;
+    for (const value of iterable) {
+        if (maxValue === undefined || cmp(value, maxValue) > 0) {
+            maxValue = value;
+        }
+    }
+    return maxValue;
+}
+/**
+ * Returns the sum of elements.
+ */
+export function sum(iterable) {
+    let total = 0;
+    for (const value of iterable) {
+        total += value;
+    }
+    return total;
+}
+/**
+ * Returns the average of elements.
+ */
+export function average(iterable) {
+    let total = 0;
+    let count = 0;
+    for (const value of iterable) {
+        total += value;
+        count++;
+    }
+    return count === 0 ? undefined : total / count;
+}
+// ============================================================================
+// Terminal operations (materialization)
+// ============================================================================
+/**
+ * Collects elements into an array.
+ */
+export function toArray(iterable) {
+    return Array.from(iterable);
+}
+/**
+ * Collects elements into a Set.
+ */
+export function toSet(iterable) {
+    return new Set(iterable);
+}
+/**
+ * Collects elements into a Map.
+ */
+export function toMap(iterable, keyFn, valueFn) {
+    const map = new Map();
+    for (const value of iterable) {
+        map.set(keyFn(value), valueFn(value));
+    }
+    return map;
+}
+// ============================================================================
+// Pipe utility for composition
+// ============================================================================
+/**
+ * Pipes a value through a series of transformations.
+ *
+ * @example
+ * const result = pipe(
+ *   [1, 2, 3, 4, 5],
+ *   (it) => map(it, x => x * 2),
+ *   (it) => filter(it, x => x > 5),
+ *   (it) => take(it, 2),
+ *   toArray
+ * ) // [6, 8]
+ */
+export function pipe(value, ...fns) {
+    return fns.reduce((acc, fn) => fn(acc), value);
+}
+//# sourceMappingURL=iter.js.map

package/dist/fx/iter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iter.js","sourceRoot":"","sources":["../../src/fx/iter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,+EAA+E;AAC/E,6BAA6B;AAC7B,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,SAAS,CAAC,CAAC,GAAG,CAClB,QAAqB,EACrB,EAAkC;IAElC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,MAAM,CACrB,QAAqB,EACrB,SAA+C;IAE/C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAC9B,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,OAAO,CACtB,QAAqB,EACrB,EAA4C;IAE5C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,OAAO,CAAI,QAA+B;IACzD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,CAAC,CAAC,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,IAAI,CAAI,QAAqB,EAAE,CAAS;IACvD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,KAAK,EAAE,IAAI,CAAC;YAAE,MAAM;QACxB,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,IAAI,CAAI,QAAqB,EAAE,CAAS;IACvD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;YACjB,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,SAAS,CACxB,QAAqB,EACrB,SAAgC;IAEhC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;YAAE,MAAM;QAC7B,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,SAAS,CACxB,QAAqB,EACrB,SAAgC;IAEhC,IAAI,QAAQ,GAAG,IAAI,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,QAAQ,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,SAAS;QAC3C,QAAQ,GAAG,KAAK,CAAC;QACjB,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,MAAM,CAAI,GAAG,SAAwB;IACpD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,KAAK,CAAC,CAAC,QAAQ,CAAC;IAClB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,GAAG,CAClB,GAAG,SAA6C;IAEhD,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAE/D,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;QACjD,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,MAAM;QACvC,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAM,CAAC;IACzC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,SAAS,CAAI,QAAqB;IACjD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,eAAe;AACf,+EAA+E;AAE/E;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,KAAK,CAAI,QAAqB,EAAE,IAAY;IAC3D,IAAI,KAAK,GAAQ,EAAE,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC1B,MAAM,KAAK,CAAC;YACZ,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,MAAM,CAAI,QAAqB,EAAE,IAAY;IAC5D,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;YACzB,MAAM,CAAC,KAAK,EAAE,CAAC;QACjB,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CACvB,QAAqB,EACrB,SAAgC;IAEhC,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,MAAM,KAAK,GAAQ,EAAE,CAAC;IAEtB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACzB,CAAC;AAED,+EAA+E;AAC/E,uBAAuB;AACvB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,MAAM,CACpB,QAAqB,EACrB,EAA0C,EAC1C,OAAU;IAEV,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,IAAI,CACnB,QAAqB,EACrB,EAA2B,EAC3B,OAAU;IAEV,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,MAAM,GAAG,CAAC;IACV,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACrB,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,uBAAuB;AACvB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,IAAI,CACnB,QAAqB,EACrB,OAAgC;IAEhC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpB,KAAK,CAAC,CAAC,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,OAAO,CAAI,QAAqB;IAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnC,KAAK,CAAC,OAAO,EAAE,CAAC;IAChB,KAAK,CAAC,CAAC,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,QAAQ,CACvB,QAAqB,EACrB,KAAuB;IAEvB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;IAC1B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAM,CAAC;QAChD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,mBAAmB,CAClC,QAAqB,EACrB,KAAuB;IAEvB,IAAI,OAAsB,CAAC;IAC3B,IAAI,KAAK,GAAG,IAAI,CAAC;IAEjB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAM,CAAC;QAChD,IAAI,KAAK,IAAI,GAAG,KAAK,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,CAAC;YACZ,OAAO,GAAG,GAAG,CAAC;YACd,KAAK,GAAG,KAAK,CAAC;QAChB,CAAC;IACH,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,2BAA2B;AAC3B,+EAA+E;AAE/E;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,GAAG,CAClB,QAAqB,EACrB,EAAqC;IAErC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QACnB,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,IAAI,CAClB,QAAqB,EACrB,SAAgC;IAEhC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;IACpC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CACnB,QAAqB,EACrB,SAAgC;IAEhC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IACtC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,IAAI,CAClB,QAAqB,EACrB,SAAgC;IAEhC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,IAAI,CAClB,QAAqB,EACrB,SAAgC;IAEhC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IACrC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CACnB,QAAqB,EACrB,SAAiC;IAEjC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,GAAG,CACjB,QAAqB,EACrB,OAAgC;IAEhC,MAAM,GAAG,GAAG,OAAO,IAAI,CAAC,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,IAAI,QAAuB,CAAC;IAE5B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACvD,QAAQ,GAAG,KAAK,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,GAAG,CACjB,QAAqB,EACrB,OAAgC;IAEhC,MAAM,GAAG,GAAG,OAAO,IAAI,CAAC,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnD,IAAI,QAAuB,CAAC;IAE5B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,IAAI,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACvD,QAAQ,GAAG,KAAK,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,GAAG,CAAC,QAA0B;IAC5C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,IAAI,KAAK,CAAC;IACjB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,QAA0B;IAChD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,KAAK,IAAI,KAAK,CAAC;QACf,KAAK,EAAE,CAAC;IACV,CAAC;IAED,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC;AACjD,CAAC;AAED,+EAA+E;AAC/E,wCAAwC;AACxC,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,OAAO,CAAI,QAAqB;IAC9C,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CAAI,QAAqB;IAC5C,OAAO,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CACnB,QAAqB,EACrB,KAAsB,EACtB,OAAwB;IAExB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAQ,CAAC;IAC5B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+EAA+E;AAC/E,+BAA+B;AAC/B,+EAA+E;AAE/E;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,IAAI,CAClB,KAAQ,EACR,GAAG,GAA+B;IAElC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;AACjD,CAAC"}

package/dist/impl/array-deque.d.ts

@@ -0,0 +1,112 @@
+/**
+ * ArrayDeque implementation - A ring buffer backed double-ended queue.
+ *
+ * Provides O(1) insertion and removal at both ends.
+ * More efficient than ArrayList for queue/stack operations.
+ * Mirrors java.util.ArrayDeque.
+ *
+ * @example
+ * const deque = arrayDeque<number>()
+ * deque.addFirst(1)
+ * deque.addLast(2)
+ * deque.removeFirst() // 1
+ */
+import type { Deque } from "../interfaces/queue.js";
+import type { Eq } from "../core/traits.js";
+/**
+ * Options for creating an ArrayDeque.
+ */
+export interface ArrayDequeOptions<T> {
+    /**
+     * Initial capacity of the underlying array.
+     * Must be a power of 2 for efficient modulo operations.
+     * @default 16
+     */
+    initialCapacity?: number;
+    /**
+     * Equality function for comparing elements.
+     * @default defaultEq (===)
+     */
+    eq?: Eq<T>;
+}
+/**
+ * ArrayDeque<T> - Ring buffer implementation of Deque.
+ *
+ * Uses a circular array to provide O(1) operations at both ends.
+ * The array grows automatically when full.
+ *
+ * Not thread-safe. Use synchronized() behavior for concurrent access.
+ */
+export declare class ArrayDeque<T> implements Deque<T> {
+    private _elements;
+    private _head;
+    private _tail;
+    private readonly _eq;
+    constructor(options?: ArrayDequeOptions<T>);
+    get size(): number;
+    get isEmpty(): boolean;
+    get eq(): Eq<T>;
+    addFirst(element: T): void;
+    offerFirst(element: T): boolean;
+    removeFirst(): T;
+    pollFirst(): T | undefined;
+    peekFirst(): T;
+    peekFirstOrUndefined(): T | undefined;
+    addLast(element: T): void;
+    offerLast(element: T): boolean;
+    removeLast(): T;
+    pollLast(): T | undefined;
+    peekLast(): T;
+    peekLastOrUndefined(): T | undefined;
+    push(element: T): void;
+    pop(): T;
+    offer(element: T): boolean;
+    poll(): T;
+    peek(): T;
+    peekOrUndefined(): T | undefined;
+    pollOrUndefined(): T | undefined;
+    enqueue(element: T): boolean;
+    dequeue(): T;
+    add(element: T): boolean;
+    addAll(other: Iterable<T>): boolean;
+    contains(element: T): boolean;
+    containsAll(other: Iterable<T>): boolean;
+    remove(element: T): boolean;
+    /**
+     * Removes the element at a position from the head. The shorter side moves one place.
+     * (Before, a bitwise expression chose the side, and it was not a valid test.)
+     */
+    private removeAtOffset;
+    removeAll(other: Iterable<T>): boolean;
+    retainAll(other: Iterable<T>): boolean;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    forEach(action: (element: T, index: number) => void): void;
+    toArray(): T[];
+    /**
+     * Doubles the capacity of the deque.
+     */
+    private grow;
+    /**
+     * Returns the next power of 2 >= n.
+     */
+    private nextPowerOfTwo;
+    /**
+     * Returns the current capacity of the underlying array.
+     */
+    get capacity(): number;
+    /**
+     * Returns a string representation for debugging.
+     */
+    toString(): string;
+}
+/**
+ * Factory function to create an ArrayDeque.
+ *
+ * @example
+ * const deque = arrayDeque<number>()
+ * const dequeFromArray = arrayDeque([1, 2, 3])
+ * const dequeWithOptions = arrayDeque<string>({ initialCapacity: 32 })
+ */
+export declare function arrayDeque<T>(optionsOrElements?: ArrayDequeOptions<T> | Iterable<T>): ArrayDeque<T>;
+//# sourceMappingURL=array-deque.d.ts.map

package/dist/impl/array-deque.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-deque.d.ts","sourceRoot":"","sources":["../../src/impl/array-deque.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,KAAK,EAAE,EAAE,EAAE,MAAM,mBAAmB,CAAC;AAG5C;;GAEG;AACH,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAClC;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;OAGG;IACH,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;CACZ;AAED;;;;;;;GAOG;AACH,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,KAAK,CAAC,CAAC,CAAC;IAC5C,OAAO,CAAC,SAAS,CAAoB;IACrC,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAE5B,YAAY,OAAO,GAAE,iBAAiB,CAAC,CAAC,CAAM,EAQ7C;IAMD,IAAI,IAAI,IAAI,MAAM,CAGjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAEd;IAMD,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAMzB;IAED,UAAU,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAG9B;IAED,WAAW,IAAI,CAAC,CAKf;IAED,SAAS,IAAI,CAAC,GAAG,SAAS,CAQzB;IAED,SAAS,IAAI,CAAC,CAKb;IAED,oBAAoB,IAAI,CAAC,GAAG,SAAS,CAEpC;IAMD,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAMxB;IAED,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAG7B;IAED,UAAU,IAAI,CAAC,CAKd;IAED,QAAQ,IAAI,CAAC,GAAG,SAAS,CAQxB;IAED,QAAQ,IAAI,CAAC,CAMZ;IAED,mBAAmB,IAAI,CAAC,GAAG,SAAS,CAMnC;IASD,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAErB;IAED,GAAG,IAAI,CAAC,CAEP;IAMD,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAEzB;IAED,IAAI,IAAI,CAAC,CAER;IAED,IAAI,IAAI,CAAC,CAER;IAED,eAAe,IAAI,CAAC,GAAG,SAAS,CAE/B;IAED,eAAe,IAAI,CAAC,GAAG,SAAS,CAE/B;IAED,OAAO,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAE3B;IAED,OAAO,IAAI,CAAC,CAEX;IAMD,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAGvB;IAED,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAOlC;IAED,QAAQ,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAO5B;IAED,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAOvC;IAED,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO,CAW1B;IAED;;;OAGG;IACH,OAAO,CAAC,cAAc;IAqBtB,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAarC;IAED,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,OAAO,CAuBrC;IAED,KAAK,IAAI,IAAI,CASZ;IAMA,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAMhC;IAED,OAAO,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAQzD;IAED,OAAO,IAAI,CAAC,EAAE,CAMb;IAMD;;OAEG;IACH,OAAO,CAAC,IAAI;IA6BZ;;OAEG;IACH,OAAO,CAAC,cAAc;IAetB;;OAEG;IACH,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED;;OAEG;IACH,QAAQ,IAAI,MAAM,CAEjB;CACF;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,iBAAiB,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GACrD,UAAU,CAAC,CAAC,CAAC,CASf"}