/**
 * A Map implementation using an array of arguments (`any[]`) as its key.
 * Uses a nested Map structure, allowing keys with any JavaScript value.
 * Performance is typically proportional to the number of arguments in the key.
 *
 * @template K - The type of the key (array of any).
 * @template V - The type of the value.
 */
export declare class ArgsMap<K extends any[], V> {
    private readonly root;
    private _size;
    private static readonly END_MARKER;
    /** Returns the number of key/value pairs in the ArgsMap object. */
    get size(): number;
    /** Sets the value for the key in the ArgsMap object. Returns the value. */
    setReturnValue(key: K, value: V): V;
    /** Sets the value for the key in the ArgsMap object. Returns the ArgsMap object. */
    set(key: K, value: V): this;
    /** Returns the value associated with the key, or undefined if there is none. */
    get(key: K): V | undefined;
    /** Returns a boolean indicating whether an element with the specified key exists or not. */
    has(key: K): boolean;
    /** Returns true if an element in the ArgsMap object existed and has been removed, or false if the element does not exist. */
    delete(key: K): boolean;
    /** Recursive helper for delete, cleaning up empty parent maps. */
    private _deleteRecursive;
    /** Removes all key/value pairs from the ArgsMap object. */
    clear(): void;
    /** Returns a new Iterator object that contains the [key, value] pairs for each element in the ArgsMap object in insertion order. */
    entries(): IterableIterator<[K, V]>;
    /** Recursive helper for depth-first entry iteration. */
    private _traverseEntries;
    /** Returns a new Iterator object that contains the [key, value] pairs for each element in the ArgsMap object in insertion order. */
    [Symbol.iterator](): IterableIterator<[K, V]>;
    /** Returns a string representing the object. */
    get [Symbol.toStringTag](): string;
}
//# sourceMappingURL=ArgsMap.d.ts.map