import type { BetterMapLike } from "./better-map-like.js";
/**
 * A Map structure which has a tuple key.
 */
export declare class TupleMap<K extends unknown[], V> implements BetterMapLike<K, V> {
    /**
     * Create a map which uses tuples of the specified length for keys.
     */
    static forKeyLength<KeyT extends unknown[] & {
        length: N;
    }, ValueT, N extends number>(keyLength: N): TupleMap<KeyT, ValueT>;
    /**
     * Create a map from the given tuple length and iterable initial entries.
     */
    static from<KeyT extends unknown[] & {
        length: N;
    }, ValueT, N extends number>(keyLength: N, entries: Iterable<readonly [KeyT, ValueT]>): TupleMap<KeyT, ValueT>;
    private readonly _keyLength;
    private _size;
    private readonly root;
    private readonly tailIndex;
    protected constructor(keyLength: number);
    clear(): void;
    copy(valueDuplicator?: ((value: V, key: K) => V) | undefined): TupleMap<K, V>;
    delete(key: K): boolean;
    entries(): [K, V][];
    entryIterator(): Generator<[K, V], undefined, undefined>;
    private find;
    get(key: K): V | undefined;
    getOrCompute(key: K, supplier: (k: K) => V): V;
    has(key: K): boolean;
    keyIterator(): Generator<K, undefined, undefined>;
    get keyLength(): number;
    private keyTail;
    keys(): K[];
    private mapsForKey;
    replaceIf(key: K, value: V, predicate: (existingValue: V, existingKey: K) => boolean): boolean;
    replaceIfPresent(key: K, value: V): boolean;
    set(key: K, value: V): void;
    setEach(iterable: Iterable<Readonly<[K, V]>>): void;
    setEachIfAbsent(iterable: Iterable<Readonly<[K, V]>>): void;
    setIfAbsent(key: K, value: V): V;
    get size(): number;
    toMap(valueDuplicator?: ((value: V, key: K) => V) | undefined): Map<K, V>;
    upsert(key: K, combine: (maybeValue: (V | undefined)) => V): void;
    valueIterator(): Generator<V, undefined, undefined>;
    values(): V[];
}
//# sourceMappingURL=tuple-map.d.ts.map