If x is already sorted

x = x.completeSort(y).uniq.array;

On Friday, 1 May 2015 at 19:30:08 UTC, Ilya Yaroshenko wrote:
Both variants are wrong because uniq needs sorted ranges.

Probably you need something like that:

x = x.chain(y).sort.uniq.array;

On Friday, 1 May 2015 at 19:08:51 UTC, Per Nordlöw wrote:
What's the fastest Phobos-way of doing either

   x ~= y; // append
   x = x.uniq; // remove duplicates

or

   x = (x ~ y).uniq; // append and remove duplicates in one go

provided that

   T[] x, y;

?

Reply via email to