Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

It's a bug (was: When does while() test for defined vs truth)

by robin (Chaplain)
on Dec 17, 2001 at 20:23 UTC ( #132548=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    --- op.c.orig   Mon Dec 17 13:51:32 2001
    +++ op.c        Mon Dec 17 13:55:47 2001
    @@ -4073,7 +4073,7 @@
    ...
                          || k1->op_type == OP_EACH)
                        expr = newUNOP(OP_DEFINED, 0, expr);
                    break;
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://132548]
help
Chatterbox?
[ambrus]: Corion: what I don't understand is, if you make a one-shot AnyEvent timer with short timeout, does this code guarantee that the Prima timer can't queue two timeout events before invoking any of them?
[ambrus]: Because that could break AnyEvent code, which is why I added a guard.
[ambrus]: (It might be easier to use the callback scalar as a guard, as in $c and &$c(); $c = ();)
[Corion]: ambrus: Hurr - yes, that might happen, as Prima will queue lots of stuff (Well, Windows will)
[Corion]: But I'm really amazed that it just took this little code (plus the idle handler I have in mind and something else dk suggested)

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













    Results (150 votes). Check out past polls.