Re: [Boost-users] sort implementation based on swap

From: Tim Rowe (digitig_at_[hidden])
Date: 2004-09-15 17:47:12

One solution is to sort a set of pointers to the objects. Any sort
routine that lets you specify a sort function will let you sort the
pointers into the referenced objects' ordering.

On Wed, 15 Sep 2004 17:28:54 -0400, Russell Mok <rmok_at_[hidden]> wrote:
> I know this is kinda off topic.
> 
> I am trying to sort some objects which are expensive to copy.  Does anyone know a sort
> implementation that uses neither copier nor assignment?  The STLport version I have is
> using both.  Worse, some routines are passing arguments as T instead of const T &.  I did
> search boost and google but I couldn't find what I want.
> 
> Thanks in advance.
> 
> Russell
> 
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
> 

-- 
Tim Rowe