A Ruby implementation of augmented interval tree
Ruby
Pull request Compare This branch is 13 commits ahead, 33 commits behind misshie:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
debian
lib
spec
.document
.gitignore
.rspec
.travis.yml
LICENSE
README.rdoc
Rakefile
interval-tree.gemspec

README.rdoc

IntervalTree

An implementation of the agumented interval tree algorithm in Ruby

See also

Usage

require "interval_tree"

itv = [(0...3), (1...4), (3...5),]
t = IntervalTree::Tree.new(itv)
p t.search(2) => [0...3, 1...4]
p t.search(1...3) => [0...3, 1...4, 3...5]

Note

Result intervals are always returned in the “left-closed and right-open” style that can be expressed by three-dotted Range object literals (first…last)

Full-closed intervals “(first..last)” for tree are internally converted to half-closed intervals.

Copyright

Author

MISHIMA, Hiroyuki ( github.com/misshie )

Copyright

© 2011, MISHIMA, Hiroyuki

License

The MIT/X11 license