From: Alan Bellingham (alan_at_[hidden])
Date: 2002-01-20 13:11:14
>Not even. Well, that sounds like a nice approach, but I also want a way to
>say "just put it here", and its up to me to make sure things are sorted
>before the next lookup. The standard associative containers cause me lots of
>grief by trying too hard to protect me from the low-level details.
So (for example) you could dump a load of elements into the middle,
knowing they're already sorted and in the right place, and avoid the
sort at all? Seems reasonable to me.
At the moment, it appears that this gives us three policies:
1) Sort immediately.
2) Sort automatically when examined.
3) Sort only when user demands it. (The progammer is always right.)
I'll go away for a bit while looking at that previous submisson.
>It's not that I don't want a library to provide safe "always correct"
>interfaces; I do. It should also be flexible enough to be used for new
>"always correct" interfaces built on the same low-level components.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk