From: John Fuller (jfuller_at_[hidden])
Date: 2003-09-15 06:01:06
representing dimensions like a 2k tree used in image processing and
for interval domains?
On Tuesday, September 16, 2003, at 02:42 AM, ch00k wrote:
> Will it be useful to add such a data structure to boost library?
> by addming extra info in tree node we could increase speed on some
> insert, search, delete are still O(log n)
> next, prev - O(1) min, max - O(1), (instead of O(log(n)),
> It will be useful to design a template, that enables developer to add
> info to RB-Tree.- this can be useful to build such data structures as
> intervals tree, for example
> For present moment I have ugly C rb-trees implementation and want to
> make a
> template on the base of it.
> Maybe, such data structure is already included in boost or can be
> implemented by STL means?
> Unsubscribe & other changes:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk