Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Super Search

( #3989=superdoc: print w/replies, xml ) Need Help??


Found 1 node roughly between 2017-05-29 and 1999-10-04 (searched 100.00% of DB).


where title contains all of "Visit", "Reaped", "Nodes"

Date:Author/owner:Title:Node type:
2006-05-03 ysth Visit Reaped Nodes misbehavior PMD

Finished searching database.


Reset search form

Match text containing
(separate strings with -- default is spaces)
titles against above.

Please be patient after submitting your search.

Match titles containing
(separate strings with -- default is spaces)

authors
(use "[one] [two]" to list multiple authors)
(Searching by author doesn't work for Categorized Questions and Answers yet.)

Search ,
starting at - - .

Search
the following sections:

Skip text containing
(separate strings with -- default is spaces)
(Does not exclude based on titles)

Skip titles containing
(separate strings with -- default is spaces)






parent node's author
(use "[one] [two]" to list multiple authors)
(This doesn't work for Categorized Questions and Answers yet.)

Please be patient after submitting your search.

Log In?
Username:
Password:

What's my password?
Create A New User
Chatterbox?
[Lady_Aleena]: Good morning Corion, I hope you have a wonderful day as well. 8)
[Corion]: Yesterday I encountered an interesting data structure problem. I have a remote program that emits events, and my client listens for these events with one-shot callbacks, that is, I register the callback and if the event gets generated that callback ...
[Lady_Aleena]: robby_dobby, every day. Chaos is my life with few controls.
[Corion]: ... gets called once. The data structure for that is just a hash of arrays, mapping the event type to a queue of registered one-shots, and the first one-shot from the queue gets removed and called.
[Corion]: But now I want to register a one-shot for two events, of which only one will arrive, so my data structure doesn't work anymore...
[Lady_Aleena]: Corion, ouchy.
[Corion]: (maybe I should write this up as a SoPW) - currently, the "most efficient" data structure I come up with is a single array which I scan for the first fitting one-shot. Not efficient but I don't expect more than five outstanding one-shots anyway
[choroba]: can't you create a meta-key corresponding to the disjunction of the events?
[robby_dobby]: Corion: Heh. This whole thing smells of Strategy Pattern or MVC pattern.
[Corion]: And performance linear to the number of registered one-shots doesn't feel that bad. Maybe I should collect statistics on how many callbacks are outstanding ;)

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (9)
As of 2017-05-29 07:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?