Boost logo

Boost :

From: Martin Adrian (adrianm_at_[hidden])
Date: 2006-04-21 03:02:59

> I cannot agree. Can you imagine an XML or JSON library that would do O(n)
> lookup on keys?

Shouldn't a tree already be approx log N in most cases.

Optimizing it into log log N by adding a multimap to each node seems like an
overkill to me. (at least as default)

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