partition(range, leftsubrange) or partition(range, rightsubrange)

[Andrei Alexandrescu]

Sean Kelly wrote:
> superdan wrote:
>> got a question on this range stuff. in stl partition is 
>> partition(begin, mid, end). neat. in std.algorithm partition is 
>> partition(range, mid). so-so. never like it mucho. in the new stuff 
>> with ranges n all there are two choices partition(range, leftsubrange) 
>> or partition(range, rightsubrange). question is, is there a better 
>> choice between the two or are they just the same. would be cool to 
>> have a clear rule with some advantage. and that's easy to remember too.
>>
>> like steve i think ranges are cool n all but fraid iterators are still 
>> good at sumthin'. either-way choices ain't a good sign.
> 
> To throw another version into the mix, Tango's partition routine is 
> declared as partition(range, pred) and uses the result of pred to 
> determine what to do with each element.  In std.algorithm parlance, that 
> would be equivalent to partition!("a < 5")(range), for example.

Ours too. I think superdan is making a slight confusion somewhere. But 
the question is valid if you s/partition/partialSort or 
s/partition/rotate in his message.

Still thinking of it.

Andrei