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

Re: removal of dupes using a hash

by pizza_milkshake (Monk)
on May 20, 2004 at 21:09 UTC ( [id://355080]=note: print w/replies, xml ) Need Help??


in reply to removal of dupes using a hash

assuming everything's already in the right order, just keep assigning the latest value to the key and at the end you'll have all your values in a hash. this is the quick and dirty way which assumes you don't have 100Ks to Ms of keys. if so, write it a little more C-like.
#!perl -wl use strict; my %h; $h{substr($_, 0, 1)} = substr($_, 2, 1) while <DATA>; print "$_.$h{$_}" for sort keys %h; __DATA__ 1.1 1.2 1.3 2.0 2.1 2.2 3.4 4.5 4.6

perl -e"\$_=qq/nwdd\x7F^n\x7Flm{{llql0}qs\x14/;s/./chr(ord$&^30)/ge;print"

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others romping around the Monastery: (3)
As of 2024-04-24 01:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found