From: Toon Knapen (toon.knapen_at_[hidden])
Date: 2001-11-24 13:08:26
> BTW, in the above design, the iterator in the Policies class is never
> changed unless the iterator is assigned to. A hybrid scheme wherein the Base
> iterator is never changed, but the Policies class embeds an iterator over
> the permutation idices might be the simplest of all,
but this will increase the memory footprint since you need to keep track
of the index you're at (so that you can use this to find the right
index in the reorder sequence in the derefence function)
> since you can take
> advantage of more compile-time defaults.
which specifically are you thinking of ?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk