Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Re: Re: Re: (ar0n) Re: Storing Info

by BrentDax (Hermit)
on Jan 21, 2002 at 11:55 UTC ( #140342=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Re: (ar0n) Re: Storing Info
in thread Storing Info

Either answer or go away.

Excuse me, but this guy went out of his way to give you a few pointers and you just insulted him. Any help is better than no help at all. Further, you probably haven't really looked at grep. If you had, the solution would quickly become obvious.

Nobody here is going to hand you the code--you have to do it for yourself or you'll never learn. I will, however, hand you part of the code. @results=grep {SOMETHING} @friends{sort keys %friends};
All you have to do is figure out what goes in place of the SOMETHING. It's not that difficult.

=cut
--Brent Dax
There is no sig.


Comment on Re: Re: Re: Re: (ar0n) Re: Storing Info
Download Code
Re: Re: Re: Re: Re: (ar0n) Re: Storing Info
by demerphq (Chancellor) on Jan 21, 2002 at 14:52 UTC
    I really dont understand why everybody wants to sort the keys of the hash. I mean OP didnt say he cares about the keys...
    print join "\n",map{ (CONDITION) ? join(",",values %$_) : () } values +%hash;
    But I cant seem to work out what the CONDITION should be. Maybe the OP can work it out...

    Yves / DeMerphq
    --
    When to use Prototypes?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (8)
As of 2014-08-02 02:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Who would be the most fun to work for?















    Results (53 votes), past polls