Re: Detecting duplicate entries

The hash solutions that have already been given have the right idea, but you can use hash slices to make it look a bit simpler.

my %uniq;

@uniq{@orig_list} = @orig_list;

my @unique_list = keys %uniq;
[download]

"Perl makes the fun jobs fun
and the boring jobs bearable" - me

Comment on Re: Detecting duplicate entries Download Code

Replies are listed 'Best First'.
Re: Re: Detecting duplicate entries by japhy (Canon) on Mar 01, 2001 at 22:24 UTC
Don't assign values, just assign `()`. Or use: `$seen{$_}++ or push @uniq, $_ for @orig; # or @uniq = grep !$seen{$_}++, @orig;` [download] `japhy` -- Perl and Regex Hacker	[reply] [d/l]
Re: Re: Detecting duplicate entries by petral (Curate) on Mar 01, 2001 at 23:48 UTC
And probably even slower, but it avoids the %temp and it's cute: `sort keys %{ { map { $_ => 1 } @orig_list }` [download] p	[reply] [d/l]
Re: Re: Re: Detecting duplicate entries by japhy (Canon) on Mar 01, 2001 at 23:50 UTC
That's a needless `sort()`, unless the original data list was sorted. `japhy` -- Perl and Regex Hacker	[reply]
Re: Re: Re: Re: Detecting duplicate entries by petral (Curate) on Mar 02, 2001 at 01:43 UTC
Ok, but it keeps up with `sort -u` above. p	[reply] [d/l]
Re: Re: Detecting duplicate entries by merlyn (Sage) on Mar 01, 2001 at 22:11 UTC
"look a bit simpler", but run slower if I remember the benchmarks properly. -- Randal L. Schwartz, Perl hacker	[reply]