alexbol99 / flatten-interval-tree

Interval binary search tree
MIT License
41 stars 21 forks source link

Some useful functions that could be included #32

Closed iSplasher closed 1 year ago

iSplasher commented 2 years ago

I think functions like these are useful

export default class IntervalTree<T = any> extends BaseIntervalTree<T> {

  removeInterval(interval: [number, number]) {
    let search_node = new Node(interval);
    let resp_nodes = [];
    this.tree_search_interval(this.root, search_node, resp_nodes);

    for (let n of resp_nodes ) {
      this.tree_delete(n);
    }
    return resp_nodes as Node<T>[];
  }

  clear() {
    this.root = null;
  }
}
jeremy-rifkin commented 2 years ago

.clear() would be very helpful

alexbol99 commented 2 years ago

Added method clear version v1.0.19