[boost] Re: RB Trees with extra information

From: ch00k (xchookx_at_[hidden])
Date: 2003-09-15 11:35:30

"John Fuller" <jfuller_at_[hidden]> wrote in message
news:E794F9BC-E76B-11D7-85F2-000393B3C0BA_at_wernervas.com...
> representing dimensions like a 2k tree used in image processing and
> constraint programming
> for interval domains?

This is not 2k tree

I mean data structure that is container of intervals  (1,6), (3,8) etc,
which are considered ordered by the first value and offers such an
operations:
1. Standard sorted container operations: min, max, search
2. Search the minimal interval overlapping give interval (O(log n))