From: Howard Hinnant (hinnant_at_[hidden])
Date: 2001-12-31 15:22:39
On Monday, December 31, 2001, at 11:16 AM, Nathan Myers wrote:
> BTW, RB-trees are far from the last word in balanced tree design. I
> hope
> that someday our STL containers can be built with better tree designs.
> Some, e.g., don't require evaluating Compare()(a,b) during rebalance
> operations, for example.
Hmm... not in the Metrowerks tree containers. We use RB-trees and the
rebalance code is independent of the Compare() operation. Indeed it is
not even templated on Compare (nor T nor Allocator) to save on code
bloat.
-Howard