rbtree-ts/dist/sorted-array.d.ts

A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.

import { IMap } from '../types/interfaces';
/** A super-inefficient sorted list for testing purposes */
export default class SortedArray<K = any, V = any> implements IMap<K, V> {
    cmp: (a: K, b: K) => number;
    a: [K, V][];
    constructor(compare?: (a: K, b: K) => number, entries?: [K, V][]);
    get size(): number;
    get(key: K, defaultValue?: V): V | undefined;
    set(key: K, value: V, overwrite?: boolean): boolean;
    has(key: K): boolean;
    delete(key: K): boolean;
    clear(): void;
    getArray(): [K, V][];
    minKey(): K | undefined;
    maxKey(): K | undefined;
    forEach(callbackFn: (v: V, k: K, list: SortedArray<K, V>) => void): void;
    [Symbol.iterator](): IterableIterator<[K, V]>;
    entries(): IterableIterator<[K, V]>;
    indexOf(key: K, failXor: number): number;
}