Comment #47 on issue 90 by [email protected]: V8 doesn't stable sort
https://code.google.com/p/v8/issues/detail?id=90
Re #45: That's not regrettable, that's just what you asked for: Your
comparison function just says "I don't care about anything, for me
everything looks equal.", and the result is 100% consistent with that
egalitarian comparator.
Re #46: Replacing "I" with "they" and thereby defining *your* use case as
*the* use case everybody has doesn't really work, but nice try... ;-)
Stable sort is vastly overrated nowadays IMHO (unless you still have to
handle magnetic tapes or punch cards and must do multi-phase sorts): If you
want to sort in a stable manner, just make this requirement explicit, i.e.
make the position in the input part of the sort key. If the position is not
directly available from the objects to be compared, temporarily pair them
with the positions. Note that it's not possible to do this the other way
round: If a stable sorting algorithm using addition O(n) memory would be
used, everybody had to pay the additional costs, even if "stable" is not an
issue at all.
--
You received this message because this project is configured to send all
issue notifications to this address.
You may adjust your notification preferences at:
https://code.google.com/hosting/settings
--
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
---
You received this message because you are subscribed to the Google Groups "v8-dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
