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

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. <b