Re: cvs: php4 / NEWS /ext/standard string.c
| From: | rasmus at lerdorf dot on dot ca | Date: | Fri, 20 Jul 2001 19:39:00 +0000 |
| Subject: | Re: cvs: php4 / NEWS /ext/standard string.c | ||
| References: | 1 | Groups: | php.cvs |
| Request: | Send a blank email to php-cvs+get-6290@lists.php.net to get a copy of this message | ||
> > On Fri, 20 Jul 2001, Sascha Schumann wrote:
> > > There are a lot cases where the old algorithm is faster (and
> > > there are cases where Boyer is 3x times faster). Thus it is
> > > not really practical to remove the current implementation.
> >
> > How would the user know in which cases to use Boyer-Moore?
>
> There is a simple rule: The longer the pattern, the more
> efficient the algorithm becomes. I've experimented with
> some code which automatically determines which algorithm
> to use, but I have not found a convincing way yet. The old
> naive implementation is faster than I anticipated.
Long live naive implementations! ;)
-Rasmus