Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Data Structure help

by fruiture (Curate)
on Mar 21, 2003 at 20:40 UTC ( #244999=note: print w/replies, xml ) Need Help??


in reply to Data Structure help

Hmmm...

my %all_the_stuff = (); my $current; while( <> ){ chomp; next unless length; if( m/^KEY: (.+)/ ){ $current = { OID => [], #you migth want to put these two NAME => [], # together, i don't know ERROR => undef, }; $all_the_stuff{ $1 } = $current } next unless $current; if( m/^(OID|NAME): (.+)/ ){ push @{$current->{$1}},$2 } elsif( m/^Error Status (.+)/ ){ $current->{ERROR} = $1; $current = undef; #error status is final statement } }

See perlref,perllol, perldsc and perhaps perlre. The code is untested and not to be used without careful analysis.

--
http://fruiture.de

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (5)
As of 2016-10-01 17:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?






    Results (3 votes). Check out past polls.