From: David Abrahams (david.abrahams_at_[hidden])
Date: 2001-07-26 07:50:04
----- Original Message -----
From: "Philip Nash" <philip.nash_at_[hidden]>
Sent: Thursday, July 26, 2001 7:02 AM
Subject: [boost] RE: Boost algorithm library
> .. adding to the debate of container interface vs range iterator
> Could another benefit of providing a container interface wrapper be that,
> for those algorithms for which an optimised version is available as a
> of the container (or is _only_ available in member form, such as
> list::sort() ), the optimised member version could be selected
> (via specialisation)...?
Maybe not, since the user is allowed to completely replace the
implementation of std::list<T> via specialization when T is a UDT.
And also, the same specialization argument could be made for
list<T>::iterator (but I guess not vector<T>::iterator ;-( ).
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk