Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:
I wrote a module which implements a kind of binary search for intervals. Given a collection of ranges and associated items (like (1,5,"foo") and (-1, 3,"bar")), you can search by a query range to get everything which overlaps it (like an R-tree in 1 dimension). I wrote it at work to efficiently query genes and other features on chromosomes by location. Snippet below shows it's interface.
Two questions: Does something like this already exist on CPAN? (I didn't find anything). And if not, what should I name it, if I were to upload it? I'm thinking Tree::Interval, Tree::Range, Tree::Binary::Range, Tree::Binary::Interval, Search::Range or Search::Internal... Tree describes what it is, but Search describes what it does.
Thankya.use Tree::Range; my $tr = Tree::Range->new(); $tr->add(10,20,"a"); $tr->add(15,25,"b"); $tr->add(50,67,"c"); $tr->add(22,49,"d"); $tr->finalize(); print join ",", $tr->search(19,23); # "a,b,d"
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: What should I name my binary range tree module?
by JavaFan (Canon) on May 29, 2011 at 09:33 UTC | |
by Anonymous Monk on May 29, 2011 at 11:49 UTC | |
|
Re: What should I name my binary range tree module?
by Gulliver (Monk) on May 29, 2011 at 12:14 UTC |