Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re: Data managing problem

by vinoth.ree (Monsignor)
on Feb 22, 2013 at 07:29 UTC ( #1020092=note: print w/replies, xml ) Need Help??


in reply to Data managing problem

Use hash and save each line with the second field as key of each record. So you will get the latest record if the key get duplicated.

use strict; use warnings; use Data::Dumper; use utf8; my %hash ; while(<DATA>) { my @arr = split(/\s+/, $_); $hash{$arr[1]}= $_; } print Dumper \%hash; __DATA__ 1/2/2013 cgoo nreuiheru 1/4/2013 doow reiqrqueih 1/5/2013 hellio ruieqrhfuepqh 1/20/2013 cgoo 3rhquh4ureyh 1/30/2013 yetil jerqohgqrij 2/13/2013 hellio rueqipheruh 2/14/2013 cgoo wehrig4r74378

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1020092]
help
Chatterbox?
[marto]: breakin' up is hard to do
[LanX]: 123456789012345678 90 123456789012345678 901234567890
LanX should break up with false friends ;)
[Discipulus]: last hour of cb breaks it differently..
[LanX]: I think I've send one whitespace by myself at 20
[Discipulus]: are you polluting tests? grin..
[LanX]: 123456789012345678 901234567890123456 789012345678901234 567890
[LanX]: yep

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (11)
As of 2017-07-24 10:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (350 votes). Check out past polls.