import { Milliseconds } from '@paradoxical-io/types';
import { KeyValueTable } from './keyTable';
/**
 * Wrapper around key value storage that supports append/get for sets (reads the set before appending)
 *
 * @deprecated Use {@link PartitionedKeyValueTable} for all new keys
 */
export declare class KeySetValueTable<K, V extends NonNullable<unknown>> {
    /**
     * key: How to map K to a dynamo key name
     */
    private key;
    /**
     * kv: The wrapper kv table
     */
    private kv;
    /**
     * setIncluder: Determines how to determine if a value is in the set
     * @param v current set of values
     * @param t value to be added
     */
    private setIncluder;
    constructor(
    /**
     * key: How to map K to a dynamo key name
     */
    key: (k: K) => string, 
    /**
     * kv: The wrapper kv table
     */
    kv: KeyValueTable, 
    /**
     * setIncluder: Determines how to determine if a value is in the set
     * @param v current set of values
     * @param t value to be added
     */
    setIncluder?: (values: V[], test: V) => boolean);
    /**
     * Appends value to the set owned by key
     * @param key
     * @param value
     */
    append(key: K, value: V): Promise<void>;
    /**
     * Removes a value from the set owned by key.
     * @param key
     * @param value
     * @param deleteOnEmpty If set, and there are no values left after remove, deletes key. Otherwise sets key to an empty set
     */
    remove(key: K, value: V, { deleteOnEmpty }?: {
        deleteOnEmpty: boolean;
    }): Promise<void>;
    exists(key: K): Promise<boolean>;
    get(key: K): Promise<V[]>;
    set(key: K, value: V[]): Promise<void>;
    streamAll(perPage: number, opts?: {
        minimumDelayBetween?: Milliseconds;
        keyContains?: string;
    }): AsyncGenerator<[K, V[]]>;
}
//# sourceMappingURL=keySetValueTable.d.ts.map