in reply to 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]
--
<http://www.dave.org.uk>

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

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]
[reply]
        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
[reply]

In Section Seekers of Perl Wisdom