[Haskell-cafe] Re: [ANN] An efficient lazy suffix tree library

Gleb Alexeyev gleb.alexeev at gmail.com
Tue Aug 28 03:57:19 EDT 2007

Bryan O'Sullivan wrote:
> ChrisK wrote:
>> That is almost certainly because the algorithm expects the source 
>> string to have
>> a unique character at its end.
> Chris is correct.  I'll ensure that the docs make this clear.
Apologies, I should have thought of this myself.


More information about the Haskell-Cafe mailing list