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

mojodaddy's scratchpad

by mojodaddy (Pilgrim)
on Mar 11, 2007 at 21:44 UTC ( #604254=scratchpad: print w/replies, xml ) Need Help??

Document 1

foo 47789
bar 61453
baz 1701
Document 2

blort 4711
plugh 49374
xyzzy 715517
Document 3

arfle 17
barfle 37
gloop 42
<tr><td>foo</td><td>47789</td></tr> <tr><td>bar</td><td>61453</td></tr> <tr><td>baz</td><td>1701</td></tr>
<tr><td>blort</td><td>4711</td></tr> <tr><td>plugh</td><td>49374</td></tr> <tr><td>xyzzy</td><td>715517</td></tr>
<tr><td>arfle</td><td>17</td></tr> <tr><td>barfle</td><td>37</td></tr> <tr><td>gloop</td><td>42</td></tr>

Log In?

What's my password?
Create A New User
[Lady_Aleena]: My biggest problem with hashes at the moment is one with 2,501 keys.
[choroba]: how many event types are there?
[Corion]: Also I found that I can't conveniently weaken an array slot, which also is inconvenient, as I want my one-shots to disappear if the caller discards them
[Corion]: choroba: Currently two or three that my program handles (WWW::Mechanize:: Chrome), but there might be more that become interesting
[Corion]: But I don't expect more than 100 to be active at the same time, so I'm not really sure if there is a not-too-fancy data structure that is maintained with few lines of code where the performance is better than the linear scan ;)
[Corion]: But I should do a mock-up program so that others can see what I'm talking about ;)
[robby_dobby]: Corion: I hope you know all too well that passing around "fancy" datastructures is a recipe for disaster :-)
[robby_dobby]: As in, it's-too-fancy- that-it-will-be- messy-to-handle
[choroba]: bit vectors as keys?
[robby_dobby]: Hmm, I keep falling asleep at my desk, while maintaining an active appearance. Am I getting old?

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (10)
As of 2017-05-29 08:01 GMT
Find Nodes?
    Voting Booth?