index.d.ts

export type Node<Key extends any, Value extends any> = {
  parent?:       Node<Key, Value>,
  left?:         Node<Key, Value>,
  right?:        Node<Key, Value>,
  balanceFactor: number,
  key?:          Key,
  data?:         Value
};
export type Comparator<Key> = (a: Key, b: Key) => number
export type ForEachCallback<Key, Value> = (node: Node<Key, Value>, index: number) => void
export type TraverseCallback<Key, Value> = (node: Node<Key, Value>) => (void | boolean)

export default class RBTree<Key extends any, Value extends any> {
  constructor (comparator?: Comparator<Key>, noDuplicates?: boolean);
  size: number;
  insert(key: Key, data?: Value): Node<Key, Value>;
  remove(key: Key): boolean;
  removeNode(node: Node<Key, Value>): boolean;
  find(key: Key): Node<Key, Value>;
  at(index: number): Node<Key, Value>;
  contains(key: Key): boolean;
  isEmpty(): boolean;
  keys(): Array<Key>;
  values(): Array<Value>;
  range(minKey:Key, maxKey:Key, visit:TraverseCallback<Key, Value>, context?:any);
  pop(): Node<Key, Value>;
  min(): Key;
  max(): Key;
  minNode(): Node<Key, Value>;
  maxNode(): Node<Key, Value>;
  forEach(callback: ForEachCallback<Key, Value>): RBTree<Key, Value>;
  load(keys: Array<Key>, values?:Array<Value>, presort?:Boolean): RBTree<Key, Value>;
  prev(node: Node<Key, Value>): Node<Key, Value>;
  next(node: Node<Key, Value>): Node<Key, Value>;
  isBalanced(): boolean;
  toString(): string;
  destroy(): RBTree<Key, Value>;
  static createTree(keys: Array<any>, values?:Array<any>, comparator?: Comparator<any>, presort?:Boolean,  noDuplicates?: boolean):RBTree<any,any>
}