@procedures/client 0.0.0-stage → 0.1.0

package/dist/collections/async/channels.js

@@ -0,0 +1,312 @@
+/**
+ * Go-style channels for CSP (Communicating Sequential Processes).
+ *
+ * Provides typed, bidirectional communication channels inspired by Go.
+ * Perfect for coordinating async operations and implementing concurrent patterns.
+ *
+ * @example
+ * const ch = channel<number>()
+ *
+ * // Sender
+ * await ch.send(42)
+ *
+ * // Receiver
+ * const value = await ch.receive()
+ *
+ * // Select from multiple channels
+ * const result = await select(
+ *   ch1.case((v) => console.log('ch1:', v)),
+ *   ch2.case((v) => console.log('ch2:', v))
+ * )
+ */
+import { asyncQueue } from "./async-queue.js";
+/**
+ * Channel<T> - Bidirectional communication channel.
+ *
+ * Inspired by Go channels. Provides send/receive operations
+ * that can block until the other side is ready.
+ */
+export class Channel {
+    queue;
+    _isClosed = false;
+    constructor(bufferSize = 0) {
+        this.queue = asyncQueue({ capacity: bufferSize || 1 });
+    }
+    /**
+     * Sends a value through the channel.
+     * Blocks if channel buffer is full.
+     *
+     * @throws Error if channel is closed
+     */
+    async send(value) {
+        if (this._isClosed) {
+            throw new Error("Cannot send on closed channel");
+        }
+        await this.queue.put(value);
+    }
+    /**
+     * Receives a value from the channel.
+     * Blocks if no value is available.
+     *
+     * @throws Error if channel is closed and empty
+     */
+    async receive() {
+        return await this.queue.take();
+    }
+    /**
+     * Attempts to send without blocking.
+     * Returns false if channel is full.
+     */
+    trySend(value) {
+        if (this._isClosed)
+            return false;
+        return this.queue.tryPut(value);
+    }
+    /**
+     * Attempts to receive without blocking.
+     * Returns undefined if no value is available.
+     */
+    tryReceive() {
+        return this.queue.tryTake();
+    }
+    /**
+     * Closes the channel. No more values can be sent.
+     * Receivers can still drain remaining values.
+     */
+    close() {
+        this._isClosed = true;
+        this.queue.close();
+    }
+    get isClosed() {
+        return this._isClosed;
+    }
+    get size() {
+        return this.queue.size;
+    }
+    /**
+     * Creates a select case for this channel.
+     * Used with the select() function for multiplexing.
+     */
+    case(handler) {
+        return {
+            channel: this,
+            handler,
+            tryReceive: () => this.tryReceive(),
+            receive: () => this.receive(),
+        };
+    }
+    /**
+     * Async iteration over channel values.
+     * Stops when channel is closed and empty.
+     */
+    async *[Symbol.asyncIterator]() {
+        while (true) {
+            try {
+                yield await this.receive();
+            }
+            catch (e) {
+                // Channel closed
+                break;
+            }
+        }
+    }
+}
+/**
+ * Selects from multiple channels (like Go's select statement).
+ *
+ * Waits for the first channel to have a value available,
+ * then calls its handler and returns the result.
+ *
+ * @example
+ * const result = await select(
+ *   ch1.case((v) => `ch1: ${v}`),
+ *   ch2.case((v) => `ch2: ${v}`),
+ *   timeout(1000).case(() => 'timeout')
+ * )
+ */
+export async function select(...cases) {
+    // First, try non-blocking receive on all channels
+    for (const c of cases) {
+        const value = c.tryReceive();
+        if (value !== undefined) {
+            return c.handler(value);
+        }
+    }
+    // If no immediate value, race all receive operations
+    const promises = cases.map((c, index) => c.receive().then((value) => ({ index, value })));
+    const { index, value } = await Promise.race(promises);
+    return cases[index].handler(value);
+}
+/**
+ * Creates a timeout channel that sends after the specified duration.
+ *
+ * @example
+ * const result = await select(
+ *   dataChannel.case((v) => v),
+ *   timeout(5000).case(() => 'timeout!')
+ * )
+ */
+export function timeout(ms) {
+    const ch = new Channel();
+    setTimeout(() => {
+        ch.send(undefined).catch(() => { }); // Ignore if closed
+        ch.close();
+    }, ms);
+    return ch;
+}
+/**
+ * Creates a ticker channel that sends at regular intervals.
+ *
+ * @example
+ * const tick = ticker(1000) // Every second
+ * for await (const t of tick) {
+ *   console.log('Tick:', t)
+ * }
+ */
+export function ticker(ms) {
+    const ch = new Channel(1);
+    let count = 0;
+    const intervalId = setInterval(() => {
+        ch.trySend(count++);
+    }, ms);
+    return Object.assign(ch, {
+        stop: () => {
+            clearInterval(intervalId);
+            ch.close();
+        },
+    });
+}
+/**
+ * Pipeline: pipes values from input channel through transform to output channel.
+ *
+ * @example
+ * const input = channel<number>()
+ * const output = pipeline(input, (x) => x * 2)
+ *
+ * await input.send(5)
+ * const result = await output.receive() // 10
+ */
+export function pipeline(input, transform, bufferSize = 0) {
+    const output = new Channel(bufferSize);
+    (async () => {
+        for await (const value of input) {
+            const transformed = await transform(value);
+            await output.send(transformed);
+        }
+        output.close();
+    })();
+    return output;
+}
+/**
+ * Fan-out: distributes values from one input channel to multiple output channels.
+ *
+ * @example
+ * const input = channel<number>()
+ * const [out1, out2, out3] = fanOut(input, 3)
+ *
+ * // Each output gets a copy of every input value
+ */
+export function fanOut(input, count, bufferSize = 0) {
+    const outputs = Array.from({ length: count }, () => new Channel(bufferSize));
+    (async () => {
+        for await (const value of input) {
+            await Promise.all(outputs.map((ch) => ch.send(value)));
+        }
+        outputs.forEach((ch) => ch.close());
+    })();
+    return outputs;
+}
+/**
+ * Fan-in: merges multiple input channels into one output channel.
+ *
+ * @example
+ * const ch1 = channel<number>()
+ * const ch2 = channel<number>()
+ * const merged = fanIn(ch1, ch2)
+ *
+ * // merged receives values from both ch1 and ch2
+ */
+export function fanIn(...inputs) {
+    const output = new Channel();
+    const workers = inputs.map(async (input) => {
+        for await (const value of input) {
+            await output.send(value);
+        }
+    });
+    Promise.all(workers).then(() => output.close());
+    return output;
+}
+/**
+ * Merge: like fanIn but closes output when first input closes.
+ */
+export function merge(...inputs) {
+    const output = new Channel();
+    (async () => {
+        const iterators = inputs.map((ch) => ch[Symbol.asyncIterator]());
+        while (true) {
+            const results = await Promise.race(iterators.map(async (it, idx) => {
+                const result = await it.next();
+                return { idx, result };
+            }));
+            if (results.result.done) {
+                output.close();
+                break;
+            }
+            await output.send(results.result.value);
+        }
+    })();
+    return output;
+}
+/**
+ * Buffered channel with specified capacity.
+ */
+export function buffered(capacity) {
+    return new Channel(capacity);
+}
+/**
+ * Unbuffered channel (rendezvous point).
+ * Sends block until receiver is ready.
+ */
+export function unbuffered() {
+    return new Channel(0);
+}
+/**
+ * Factory function to create a channel.
+ *
+ * @example
+ * const ch = channel<number>()
+ * const bufferedCh = channel<string>(10)
+ */
+export function channel(bufferSize = 0) {
+    return new Channel(bufferSize);
+}
+/**
+ * WorkerPool: distributes work across multiple workers.
+ *
+ * @example
+ * const pool = workerPool(
+ *   jobChannel,
+ *   async (job) => await processJob(job),
+ *   { workers: 4 }
+ * )
+ *
+ * // 4 workers concurrently process jobs from jobChannel
+ */
+export function workerPool(jobs, worker, options = { workers: 1 }) {
+    const results = new Channel(options.bufferSize || 0);
+    const { workers: workerCount } = options;
+    const workers = Array.from({ length: workerCount }, async () => {
+        for await (const job of jobs) {
+            try {
+                const result = await worker(job);
+                await results.send(result);
+            }
+            catch (error) {
+                console.error("Worker error:", error);
+            }
+        }
+    });
+    Promise.all(workers).then(() => results.close());
+    return results;
+}
+//# sourceMappingURL=channels.js.map

package/dist/collections/async/channels.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"channels.js","sourceRoot":"","sources":["../../../src/collections/async/channels.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,UAAU,EAAmB,MAAM,kBAAkB,CAAC;AAE/D;;;;;GAKG;AACH,MAAM,OAAO,OAAO;IACV,KAAK,CAAgB;IACrB,SAAS,GAAG,KAAK,CAAC;IAE1B,YAAY,aAAqB,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,UAAU,CAAI,EAAE,QAAQ,EAAE,UAAU,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,IAAI,CAAC,KAAQ;QACjB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACnD,CAAC;QACD,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO;QACX,OAAO,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,KAAQ;QACd,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,KAAK,CAAC;QACjC,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,IAAI,CAAI,OAAwB;QAC9B,OAAO;YACL,OAAO,EAAE,IAAI;YACb,OAAO;YACP,UAAU,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE;YACnC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE;SAC9B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC;QAC3B,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,CAAC;gBACH,MAAM,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,iBAAiB;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAYD;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAI,GAAG,KAAsB;IACvD,kDAAkD;IAClD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;QAC7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CACtC,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAChD,CAAC;IAEF,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtD,OAAO,KAAK,CAAC,KAAK,CAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AACtC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,OAAO,CAAC,EAAU;IAChC,MAAM,EAAE,GAAG,IAAI,OAAO,EAAQ,CAAC;IAC/B,UAAU,CAAC,GAAG,EAAE;QACd,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB;QACvD,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC,EAAE,EAAE,CAAC,CAAC;IACP,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,MAAM,CAAC,EAAU;IAC/B,MAAM,EAAE,GAAG,IAAI,OAAO,CAAS,CAAC,CAAC,CAAC;IAClC,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE;QAClC,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;IACtB,CAAC,EAAE,EAAE,CAAC,CAAC;IAEP,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE;QACvB,IAAI,EAAE,GAAG,EAAE;YACT,aAAa,CAAC,UAAU,CAAC,CAAC;YAC1B,EAAE,CAAC,KAAK,EAAE,CAAC;QACb,CAAC;KACF,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CACtB,KAAiB,EACjB,SAAuC,EACvC,aAAqB,CAAC;IAEtB,MAAM,MAAM,GAAG,IAAI,OAAO,CAAI,UAAU,CAAC,CAAC;IAE1C,CAAC,KAAK,IAAI,EAAE;QACV,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACjC,CAAC;QACD,MAAM,CAAC,KAAK,EAAE,CAAC;IACjB,CAAC,CAAC,EAAE,CAAC;IAEL,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,MAAM,CAAI,KAAiB,EAAE,KAAa,EAAE,aAAqB,CAAC;IAChF,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,OAAO,CAAI,UAAU,CAAC,CAAC,CAAC;IAEhF,CAAC,KAAK,IAAI,EAAE;QACV,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAChC,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,EAAE,CAAC;IAEL,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,KAAK,CAAI,GAAG,MAAoB;IAC9C,MAAM,MAAM,GAAG,IAAI,OAAO,EAAK,CAAC;IAEhC,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACzC,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAChC,MAAM,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;IAEhD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CAAI,GAAG,MAAoB;IAC9C,MAAM,MAAM,GAAG,IAAI,OAAO,EAAK,CAAC;IAEhC,CAAC,KAAK,IAAI,EAAE;QACV,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAEjE,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,IAAI,CAChC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC9B,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;gBAC/B,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;YACzB,CAAC,CAAC,CACH,CAAC;YAEF,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBACxB,MAAM,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM;YACR,CAAC;YAED,MAAM,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,EAAE,CAAC;IAEL,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAI,QAAgB;IAC1C,OAAO,IAAI,OAAO,CAAI,QAAQ,CAAC,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU;IACxB,OAAO,IAAI,OAAO,CAAI,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAI,aAAqB,CAAC;IAC/C,OAAO,IAAI,OAAO,CAAI,UAAU,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,UAAU,CACxB,IAAgB,EAChB,MAA8B,EAC9B,UAAoD,EAAE,OAAO,EAAE,CAAC,EAAE;IAElE,MAAM,OAAO,GAAG,IAAI,OAAO,CAAI,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;IACxD,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;IAEzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,KAAK,IAAI,EAAE;QAC7D,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjC,MAAM,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;IAEjD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/collections/behaviors/bounded.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Bounded behavior - Enforces capacity limits on collections.
+ *
+ * Wraps collections to prevent them from exceeding a maximum size.
+ * Provides various overflow policies to handle full collections.
+ *
+ * @example
+ * const list = compose(
+ *   boundedList({ capacity: 100, policy: 'drop-oldest' })
+ * )(arrayList<number>())
+ *
+ * // Add 101 elements - first element will be dropped
+ * for (let i = 0; i < 101; i++) {
+ *   list.add(i)
+ * }
+ */
+import type { Middleware } from "../core/middleware.js";
+import type { List } from "../interfaces/list.js";
+import type { Queue, Deque } from "../interfaces/queue.js";
+import type { MapLike } from "../interfaces/map.js";
+import type { Collection } from "../interfaces/collection.js";
+import type { OverflowPolicy, OverflowHandler, OverflowContext } from "../core/policies.js";
+/**
+ * Options for bounded behavior.
+ */
+export interface BoundedOptions<T> {
+    /**
+     * Maximum number of elements the collection can hold.
+     */
+    capacity: number;
+    /**
+     * Policy for handling overflow when collection is full.
+     * @default 'throw'
+     */
+    policy?: OverflowPolicy;
+    /**
+     * Optional callback invoked when overflow occurs.
+     * Called before the policy is applied.
+     */
+    onOverflow?: OverflowHandler<T>;
+}
+/**
+ * Marker interface for bounded collections.
+ */
+export interface BoundedCollection {
+    readonly capacity: number;
+    readonly isFull: boolean;
+    readonly remainingCapacity: number;
+}
+/**
+ * Creates a bounded List middleware.
+ *
+ * Intercepts add operations to enforce capacity limits.
+ * Supports multiple overflow policies.
+ */
+export declare function boundedList<T>(options: BoundedOptions<T>): Middleware<List<T>, List<T> & BoundedCollection>;
+/**
+ * Creates a bounded Queue middleware.
+ */
+export declare function boundedQueue<T>(options: BoundedOptions<T>): Middleware<Queue<T>, Queue<T> & BoundedCollection>;
+/**
+ * Creates a bounded Deque middleware.
+ */
+export declare function boundedDeque<T>(options: BoundedOptions<T>): Middleware<Deque<T>, Deque<T> & BoundedCollection>;
+/**
+ * Creates a bounded Map middleware.
+ */
+export declare function boundedMap<K, V>(options: Omit<BoundedOptions<V>, "onOverflow"> & {
+    onOverflow?: (context: Omit<OverflowContext<V>, "newElement"> & {
+        key: K;
+        value: V;
+    }) => void;
+}): Middleware<MapLike<K, V>, MapLike<K, V> & BoundedCollection>;
+/**
+ * Generic bounded collection middleware.
+ * Works with any collection type.
+ */
+export declare function bounded<C extends Collection<any>>(options: BoundedOptions<any>): Middleware<C, C & BoundedCollection>;
+//# sourceMappingURL=bounded.d.ts.map

package/dist/collections/behaviors/bounded.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded.d.ts","sourceRoot":"","sources":["../../../src/collections/behaviors/bounded.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AACpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,KAAK,EACV,cAAc,EACd,eAAe,EACf,eAAe,EAChB,MAAM,qBAAqB,CAAC;AAE7B;;GAEG;AACH,MAAM,WAAW,cAAc,CAAC,CAAC;IAC/B;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,MAAM,CAAC,EAAE,cAAc,CAAC;IAExB;;;OAGG;IACH,UAAU,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;CACjC;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;CACpC;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,GACzB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CA0JlD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,GACzB,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAgEpD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,GACzB,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAoEpD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAC7B,OAAO,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG;IAC/C,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG;QAAE,GAAG,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,KAAK,IAAI,CAAC;CAC/F,GACA,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,iBAAiB,CAAC,CA0F9D;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,UAAU,CAAC,GAAG,CAAC,EAC/C,OAAO,EAAE,cAAc,CAAC,GAAG,CAAC,GAC3B,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,CAEtC"}