> 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 pointer in hash
>
> 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.
Werner
_______________________________________________
bug-lilypond mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/bug-lilypond
