in reply to
Re^4: lsearch for perl?
in thread
lsearch for perl?
I'm pretty sure
undef
uses less mem, and it's probably a bit faster, but
++
allows you to check which items had duplicates.
undef @unique{@list};
is actually fastest.
Comment on
Re^5: lsearch for perl?
Select
or
Download
Code
In Section
Seekers of Perl Wisdom