Previously we sorted the array twice. Instead, we use a hash set. This makes the procedure O(N) rather than O(N log N).
https://codereview.appspot.com/583390043
vsize
dan eble
Diff:
Passes make, make check and a full make doc.
Patch on countdown for Jan 29th
Patch counted down - please push.
Issue 5686: Simplify and speed up uniquify author Han-Wen Nienhuys <hanwen@lilypond.org> Wed, 29 Jan 2020 15:28:26 +0000 (16:28 +0100) committer David Kastrup <dak@gnu.org> Wed, 29 Jan 2020 15:28:26 +0000 (16:28 +0100) commit 4f04d8b41fd947d48668c389f9c94e4176127544
vsize
https://codereview.appspot.com/583390043
dan eble
https://codereview.appspot.com/583390043
Diff:
Passes make, make check and a full make doc.
Patch on countdown for Jan 29th
Patch counted down - please push.