There are several possible ways, depending on whether the array is ordered and whether you wish to preserve the ordering. a)
If @in is sorted, and you want @out to be sorted: (this assumes all true values in the array)
$prev = "not equal to $in[0]"; @out = grep($_ ne $prev && ($prev = $_, 1), @in);This is nice in that it doesn't use much extra memory, simulating uniq(1)'s behavior of removing only adjacent duplicates. The ", 1" guarantees that the expression is true (so that grep picks it up) even if the $_ is 0, "", or undef.
b)
If you don't know whether @in is sorted:
undef %saw; @out = grep(!$saw{$_}++, @in);
c)
Like (b), but @in contains only small integers:
@out = grep(!$saw[$_]++, @in);
d)
A way to do (b) without any loops or greps:
undef %saw; @saw{@in} = (); @out = sort keys %saw; # remove sort if undesired
e)
Like (d), but @in contains only small positive integers:
undef @ary; @ary[@in] = @in; @out = grep {defined} @ary;
But perhaps you should have been using a hash all along, eh?