Re: What should I name my binary range tree module?

I'd use an Algorithm:: or DataStructure:: prefix. I cannot determine from your description whether you are implementing a segment tree, an interval tree, or something else. If for instance of the first, I'd name it DataStructure::SegmentTree, or DataStructure::Tree::Segment.

I would not go for a top level Tree::

Comment on Re: What should I name my binary range tree module?

Replies are listed 'Best First'.
Re^2: What should I name my binary range tree module? by Anonymous Monk on May 29, 2011 at 11:49 UTC
I think I'll go for the Algorithm:: namespace, b/c I'm not really sure what structure it is, though it seems closer to a Segment tree from wikipedia'ing. (What I do is, given a list of intervals, I sort them by midpoint, and join adjacent intervals into parent nodes with interval (min(children's starts), max(children's ends)). The idea being that every node encompasses it's descendants, so that you can query by traversing nodes overlapping the query interval.)	[reply]

Replies are listed 'Best First'.

Re^2: What should I name my binary range tree module?
by Anonymous Monk on May 29, 2011 at 11:49 UTC

I think I'll go for the Algorithm:: namespace, b/c I'm not really sure what structure it is, though it seems closer to a Segment tree from wikipedia'ing.

(What I do is, given a list of intervals, I sort them by midpoint, and join adjacent intervals into parent nodes with interval (min(children's starts), max(children's ends)). The idea being that every node encompasses it's descendants, so that you can query by traversing nodes overlapping the query interval.)

[reply]