From: "Geo" 

"Mike N."  wrote in message
news:79q8n01d1c56fm6g2mcs9ckifsgqdhhk41{at}4ax.com...

>   An efficient grep algorithm has its own interesting quirks that are
> outside of typical C++ libraries: things like searching on the character
of
> least frequency before trying a string match, all the while being able to
> span buffer boundaries.

I don't think that's quite correct. For example how do you determine the
least frequent character? The letter 'e' may be the least frequent in my
search string but it may be the most common in the base I'm searching. It's
much better imo to just search for the first character, when found see if
the second is next, etc..

>   The only thing I hate about online help is that it's so slow.

that's ok by me, I'm in learning mode so slow is plenty fast .

Geo.

--- BBBS/NT v4.01 Flag-5