Your skill will accomplish what the force of many cannot |
|
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
This is the real answer. 46% faster. 200 nanos is 200 more than 0.
I am doing some network monitoring on a 100Mb network. Sharing CPU with the real application (customer too cheap for a dedicated monitoring box). At least 2 threads locking either the total hash, or an element of the hash. I have to minimize the lockout periods to maximize the chance of keeping up with the data stream. Also learned about the benchmark module. Thanks As to the spelling, This is modified code; I hadn't tried the reference to element itself, just winged it for the question. Thanks to all.... In reply to Re^2: Ref to hash entries are faster?
by Wiggins
|
|