Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Efficent Text Checking

by archfool (Monk)
on Aug 27, 2007 at 13:50 UTC ( [id://635298]=note: print w/replies, xml ) Need Help??


in reply to Efficent Text Checking

Having the text itself as a key is probably very memory inefficient. Have you tried md5sum() on the text to make smaller keys. This will take extra time, but less memory.

Also, you could store your hash to disk if you repeatedly run this many times, and the files don't change very much. You'd just need to read-in the md5sums and filenames rather than check them again and again and again...

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://635298]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (1)
As of 2024-04-25 04:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found