Re: [boost] [mpl] sort algorithm complexity

From: Felipe Magno de Almeida (felipe.m.almeida_at_[hidden])
Date: 2005-08-05 18:49:15

On 8/5/05, David Abrahams <dave_at_[hidden]> wrote:
> Felipe Magno de Almeida <felipe.m.almeida_at_[hidden]> writes:
> 
> I don't think that's a valid strict weak ordering criterion, because
> for two classes unrelated by inheritance it produces true in either
> argument order.
> 

Is it possible to use a non-strict weak ordering criterion with
mpl::sort and have it sorted?
All that I care is that the deriveds be after its bases in this
sequence. Or is there any better way to accomplish this?

Thanks,
Felipe.

> 
> HTH,
> 
> --
> Dave Abrahams
> Boost Consulting
> www.boost-consulting.com
> 
> _______________________________________________
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
> 

-- 
   Felipe Magno de Almeida
Developer from synergy and Computer Science student from State
University of Campinas(UNICAMP).
Unicamp: http://www.ic.unicamp.br
Synergy: http://www.synergy.com.br
"There is no dark side of the moon really. Matter of fact it's all dark."