Peter_Gutmann@kcbbs.gen.nz (Peter Gutmann) (05/08/91)
I'm looking for a string matcher for a somewhat specialised application which
requires finding "words" (words being defined as strings of a minimum length
of, say, 10 chars) in a buffer. The standard way to do it is using a trie, bu
perhaps there's some more efficient way of doing it if the minimum string
length is quite high (for example I'm not really interested in the standard
LZSS minimum length of about 3 chars, so using a trie may be overkill; there
may be a faster, easier way to do it for longer strings). Anyone have any
ideas?
--
Peter_Gutmann@kcbbs.gen.nz || peter@nacjack.gen.nz || pgut1@cs.aukuni.ac.nz
(In order of decreasing reliability)
Warning!
Something large, scaly, and with fangs a foot long lives between <yoursite>
and <mysite>. Every now and then it kills and eats messages. If you don't
receive a reply within a week, try resending...