Subject: Re: RFC: memmem(3)
To: None <firstname.lastname@example.org>
From: der Mouse <mouse@Rodents.Montreal.QC.CA>
Date: 03/02/2003 14:45:28
>> + searching is usually much faster
> That was my first thought too - if something needs this, it would
> probably better use some more clever algorithm, like Rabin/Karp or
> Knuth/Morris/Pratt (with similar interface changes as you describe).
I'm not sure which algorithm I'm using in terms of names like those.
The name Boyer/Moore comes to mind, but I'm not sure exactly what that
is so I could be misled there.
Here's the interface I'm using:
searchstr_maketbl(unsigned char (*table),
const unsigned char *string, unsigned int len,
const unsigned char equiv);
searchstr(const unsigned char *string, unsigned int stringlen,
unsigned char (*table), unsigned int tablelen);
The first function is the overhead call I referred to; the second
actually does the search. The interface is not very general (in terms
of the underlying algorithm) because I wanted to avoid making the
library routines allocate memory.
Hm, the table argument to searchstr really ought to be
const unsigned char (*). And of course 256 should be something
more like UCHAR_MAX....
/~\ The ASCII der Mouse
\ / Ribbon Campaign
X Against HTML email@example.com
/ \ Email! 7D C8 61 52 5D E7 2D 39 4E F1 31 3E E8 B3 27 4B