rbi-tree 0.1.2

Cython-wrapped C++ red-black interval tree implementation

# Interval Tree for Python #

This is a Cython-wrapped red-black interval tree from [IvanPinezhaninov/IntervalTree/](https://github.com/IvanPinezhaninov/IntervalTree).

To install:

pip install rbi-tree

Example usage:

>>> from rbi_tree.tree import ITree
>>> t = ITree()
>>> id1 = t.insert(60, 80) # start stop are integers
>>> id1
0
>>> id2 = t.insert(20, 40)
>>> id2
1

Ids are automatically generated and are incrementing integers starting from zero reflecting number of insertion events. These ids are returned by find method.

>>> t.find(10, 30)
[1]
>>> t.get_ivl(1) # get interval by id
[20, 40]
>>> t.find(40, 50) # half open so it should give nothing
[]

Ids of intervals can be used to remove them:

>>> t.remove(1)
>>> t.find(10, 30) # now it finds nothing
[]
>>> t.find_at(70) # search at point
[0]
>>> list(t.iter_ivl())
[(60, 80, 0)]