sorting hidden data.

[Andrei Alexandrescu]

On 9/29/10 10:43 PDT, Steven Schveighoffer wrote:
> What I mean is, why is it automatically assumed that if front does not
> return a ref, the only way to swap is via moveX? If T == int, why must
> we have a moveFront to deal with it? IMO, all algorithms should default
> to copying unless alternatives exist.

Good point. We should arrange things such that all types without 
elaborate copy constructors allow swapping by copying.

Could you please bugzillize this so it's not forgotten?


Thanks,

Andrei