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

Re: Storing Info

by c (Hermit)
on Jan 22, 2002 at 02:32 UTC ( #140509=note: print w/ replies, xml ) Need Help??

in reply to Storing Info

hey man you're edging back up to the positive side of XP. hang in there ;-)

i'm taking the newbie approach to looking through your data for criteria that fit your demands. how about a hash of hashes. i mentioned it before, but i didnt have a good example of it. here is my take on it:

#!/usr/bin/perl -w use strict; my %friends = ( c => { hair => "brown", eyes => "brown", }, g => { hair => "blonde", eyes => "green", } ); print "$friends{g}{eyes}\n";

i've got a simple print function, but you can easily put in an if statement that loops over your hash and prints output based on the matches that you would have been grepping out before. in your example, you were looking for every friend that had a name beginning with J and brown eyes:

for my $i(keys %friends) { print $i if ($friends{$i}{eyes} eq "brown" && $i =~ /^J/); }

no guarantees on that if statement, but if you're not planning on using DBI, then this might provide the output, if not the speed you're looking for.


Comment on Re: Storing Info
Select or Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (17)
As of 2015-07-29 16:26 GMT
Find Nodes?
    Voting Booth?

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

    Results (265 votes), past polls