sonic-forest/lib/red-black/RbMap.d.ts

High-performance (binary) tree and sorted map implementation (AVL, Splay, Radix, Red-Black)

import type { Comparator, HeadlessNode, ITreeNode, SonicMap } from '../types';
import type { IRbTreeNode } from './types';
export declare class RbNode<K, V> implements IRbTreeNode<K, V> {
    readonly k: K;
    v: V;
    p: RbNode<K, V> | undefined;
    l: RbNode<K, V> | undefined;
    r: RbNode<K, V> | undefined;
    b: boolean;
    constructor(k: K, v: V);
}
export declare const RbMap: {
    new <K, V>(comparator?: Comparator<K>): {
        min: ITreeNode<K, V> | undefined;
        root: ITreeNode<K, V> | undefined;
        max: ITreeNode<K, V> | undefined;
        readonly comparator: Comparator<K>;
        set(k: K, v: V): import("../types").SonicNodePublicReference<ITreeNode<K, V>>;
        find(k: K): import("../types").SonicNodePublicReference<ITreeNode<K, V>> | undefined;
        get(k: K): V | undefined;
        del(k: K): boolean;
        clear(): void;
        has(k: K): boolean;
        _size: number;
        size(): number;
        isEmpty(): boolean;
        getOrNextLower(k: K): ITreeNode<K, V> | undefined;
        forEach(fn: (node: ITreeNode<K, V>) => void): void;
        first(): ITreeNode<K, V> | undefined;
        last(): ITreeNode<K, V> | undefined;
        readonly next: <N extends HeadlessNode>(curr: N) => N | undefined;
        iterator0(): () => undefined | ITreeNode<K, V>;
        iterator(): Iterator<ITreeNode<K, V>>;
        entries(): IterableIterator<ITreeNode<K, V>>;
        toString(tab: string): string;
    };
};
export type RbMap<K, V> = SonicMap<K, V, RbNode<K, V>>;