Boost logo

Boost :

From: David Abrahams (david.abrahams_at_[hidden])
Date: 2001-07-05 08:58:50

----- Original Message -----
From: <ltmarrie_at_[hidden]>

> Anyway, I hope the above is clear enough. It seems that for
> set_intersection et al with random access iterators, the linear bound
> given by the standard can be improved upon... Actually, for that
> matter Brown and Tarjan describe a data structure called level-linked
> 2-3 trees (I believe the binary node form of this can be used to
> implement std::set and friends) which similarly allows for fast set
> intersections.

I would like to see something like this at boost. It is a shame that the
usual set implementation is not good for typical set operations like


Boost list run by bdawes at, gregod at, cpdaniel at, john at