/**
 * A Map with a hard upper bound on entry count. When a new key would exceed
 * the cap, the oldest-inserted entry is evicted first (insertion-order ≈ LRU
 * for caches that re-`set` on refresh).
 *
 * Drop-in for `Map` — same get/set/delete/has API — so it can back caches that
 * are keyed by an unbounded dimension (per-chat, per-session) and would
 * otherwise grow for the whole process lifetime.
 */
export declare class BoundedMap<K, V> extends Map<K, V> {
    private readonly maxEntries;
    constructor(maxEntries: number, entries?: Iterable<readonly [K, V]>);
    set(key: K, value: V): this;
}
//# sourceMappingURL=bounded-map.d.ts.map