Werner LEMBERG w...@gnu.org writes:
It would appear that the main application is the removal of
duplicates, with the idiom
sort
uniq
in some form or other. This can be replaced by
make map/hash of pointers
iterate through list
if pointer in hash, delete list element, else put
On Sat, Sep 15, 2012 at 12:28:21PM +0300, Mike Solomon wrote:
Hey all,
In my quest to debug issue 2801, I stumbled upon behavior in LilyPond that is
non-deterministic.
Thanks for the report, Mike. We don't usually accept bug reports
against unreleased code but I can see from other dev
On Sun, Sep 16, 2012 at 5:06 AM, David Kastrup d...@gnu.org wrote:
in order to a stable O(n lg n) uniq for which the structure of the
final list does not depend on the memory order of the original
elements.
This certainly sounds like a better solution.
However, rethinking this, it seems
