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

Re^3: compare arrays numbers

by ikegami (Pope)
on Feb 16, 2010 at 19:13 UTC ( #823533=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    $a[$_] -= $b[$_] for 0..$#a;
    
  2. or download this
    $a[$_] -= $b[$_] for (),0..$#a;  
    
  3. or download this
    $ perl -MO=Concise,-exec -e'1 for (),$x..$y'
    1  <0> enter
    ...
    c  <2> leaveloop vK/2
    d  <@> leave[1 ref] vKP/REFC
    -e syntax OK
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://823533]
help
Chatterbox?
[ambrus]: I think the minimal implementation here is just a timer and io function, plus pushing to the @REGISTRY.
[Corion]: ambrus: Yeah, at least that's what I think I'll start with. A timer and potentially the dummy IO function that never is ready
[ambrus]: That only lets you invoke the main loop from Prima->run;, not from AnyEvent->condvar- >recv; but that shouldn't matter
[Corion]: ambrus: Details ;)

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (7)
As of 2016-12-08 12:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (141 votes). Check out past polls.