Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Search Algorithm

by lhoward (Vicar)
on Aug 10, 2000 at 17:38 UTC ( #27283=note: print w/replies, xml ) Need Help??


in reply to Search Algorithm

Two ideas come to mind. I don't think that either of these would be spectacularly faster than what you are doing now, but they may provide some modest improvement.

The following idea relies on you being able to break each line up into "words" to match against your list. If that is not possible ignore this suggestion.

read in all the keywords from a file into a hash as keys get a listing of all the files I want to search into an array, for each file { for each line { for each word in the line { if word is in hash of wanted words{ log existance of the word } } } }
You may also be able to get it going faster by putting all the words into a single regular-expression, compiling the RE once and then checking each line of each file against that RE. (this will only work if you want to know if "at least one" of the words is in a line and don't care exactly which one it was).
read in all the keywords from a file and make them into a regular expr +ession get a listing of all the files I want to search into an array, for each file { for each line { if line match RE { log it } } }

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://27283]
help
Chatterbox?
[choroba]: o'nest
[Eily]: yes we're pretty prawn to making puns around here
Eily went to the wiktionary to check that the pronunciations of prawn and prone are actually similar. Turns out prawn can be an alternative form of porn...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (5)
As of 2017-06-29 12:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (662 votes). Check out past polls.