Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Order-Preserving and Unique: List Cleanup

by Intrepid (Deacon)
on Jul 30, 2003 at 09:01 UTC ( #279122=note: print w/ replies, xml ) Need Help??


in reply to Re: Order-Preserving and Unique: List Cleanup
in thread Order-Preserving and Unique: List Cleanup

If that's the case, then why not just use the (much simpler, and easier to read) solution from this reply to the orriginal thread...
my %seen =() ;
@unique_array = grep { ! $seen{$_}++ } @non_unique_array ;

Oh my, that is nicer! Well, that's what's great about Perl Monks. I think I may not have understood the thread referred to: I thought there was some issue with this solution where it would fail in some case. If I misunderstood, thanks for setting it straight for me!

Update (Wed Jul 30 2003 18:02 UTC):

So the rendition of this code which can act like a *NIX filter as well as handle input as @ARGV, is (using -l to put a final NL on):

*nixprompt$ perl -le ' my %seen = (); my @ayin = $ARGV[0]? @ARGV : (<STDIN>); chomp @ayin; print join "\n", grep { !$seen{$_}++ } @ayin;'

Beautiful!


Comment on Re: Order-Preserving and Unique: List Cleanup
Download Code
Re: Re: Order-Preserving and Unique: List Cleanup
by Chady (Priest) on Jul 30, 2003 at 11:59 UTC

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://279122]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (12)
As of 2015-07-03 13:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (53 votes), past polls