Msg: 6667 *Conference*

07-15-96 21:56:08

From: JAMES KENNEY

To : RICHARD HANSON

Subj: FINDALL/FNDALL


It occurred to me that CHECKALL/CHKALL could be modified to do string searches
in multiple files.  FINDALL/FNDALL go through files on a list in a way similar
to CHECKALL/CHKALL but instead of numerically processing bytes they search for
multiple strings; instead of creating a file of filenames with numerical data
for each file, they create a file of filenames with the strings that each file
contains (of those entered).

Operation is the same as with CHECKALL/CHKALL except that you first enter the
strings to search for.  The number you can enter depends on their length,
ranging from a single string of 240 bytes to 80 strings of one byte each.  For
example, you can enter up to 24 eight-byte strings, or up to 40 four-byte
strings, to be searched for in a single run.  (The strings need not be the same
length.)  Boolean searches can be automated by using the data file produced by
one run as the filename file for the next.

Find something else to do while the search is running (especially when using
FNDALL.BA) unless you're the type that enjoys watching grass grow (or America
Cup races, or baseball).

Perhaps you could suggest specific modifications for special versions, such as
making some immediate use of the strings found.

Jim