Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re: Efficient code.

by NiJo (Friar)
on Jan 30, 2006 at 20:40 UTC ( #526557=note: print w/replies, xml ) Need Help??


in reply to Efficient code.

Bloom filters are very efficient, especially with low hit rates.

Speed, linear time behavior and low memory are major advantages. Disadvantages include a tunable rate of false positives and not telling which line did match.

Reimplement the algorithm using Bit::Vector if you need more speed.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://526557]
help
Chatterbox?
[tye]: because s/// doesn't support an 'r' option?
[tye]: (in your version of Perl?)
[tye]: no, thankfully (at least my version of Perl) has a different error for that.
[tye]: could be an unclosed m//, qr//, s///, or even q// (etc.) from earlier

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













    Results (131 votes). Check out past polls.