Hmm. My KMP implementation turned out to be a real bottleneck in my
ICFP code; I suspected I should have chosen Boyer-Moore (not knowing
anything about the constant factors of each, just stabbing in the
dark)... Maybe it was the average-case O(log n) "get" in my "rope"
implementation...

Chris

On 7/26/07, Jean-Christophe Filliatre <Jean-Christophe.Filliatre@lri.fr> wrote:
>
> As a byproduct of the  last ICFP programming contest, I'm releasing an
> implementation of Knuth-Morris-Pratt string searching algorithm that I
> wrote years ago. You can find it here, in my ocaml bazar:
>
>   http://www.lri.fr/~filliatr/software.en.html
>
> Just in case it may be useful, as it finally happened to be for myself.
>
> --
> Jean-Christophe, a Caml Rider
>
>
> _______________________________________________
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
>
>