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.
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 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 } } } }
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 } } }
In reply to Re: Search Algorithm
by lhoward
in thread Search Algorithm
by tenfourty
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |