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

Re: finding matches in the same array

by RazorbladeBidet (Friar)
on Apr 13, 2005 at 13:06 UTC ( [id://447509]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to finding matches in the same array

Here's another idea... a little convoluted...there's probably a nicer way to write it 
$hash{$_} = [
  ( $hash{$_}->[0] || 0 ) + $numbers[$i++],
  ( $hash{$_}->[1] || 0 ) + 1
]  foreach @sequence;

print $_, ( $hash{$_}->[0] / $hash{$_}->[1] ) foreach keys %hash;

[download]
--------------
"But what of all those sweet words you spoke in private?"
"Oh that's just what we call pillow talk, baby, that's all."

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://447509]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    • hippo‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.