I can see a simpler string-based version as being applicable to StringUtils
(char sequence)
On Apr 7, 2012 5:41 AM, "Luc Maisonobe" wrote:
> Hi Gary,
>
> Le 07/04/2012 04:30, Gary Gregory a écrit :
> > On Apr 6, 2012, at 16:05, Luc Maisonobe wrote:
> >
> >> Hi Gary,
> >>
> >> Le 06/04/2012 21:50
Am 07.04.2012 12:37, schrieb Gary Gregory:
On Apr 7, 2012, at 5:41, Luc Maisonobe wrote:
Hi Gary,
Le 07/04/2012 04:30, Gary Gregory a écrit :
On Apr 6, 2012, at 16:05, Luc Maisonobe wrote:
Hi Gary,
Le 06/04/2012 21:50, Gary Gregory a écrit :
On Fri, Apr 6, 2012 at 11:14 AM, luc wrote:
On Apr 7, 2012, at 5:41, Luc Maisonobe wrote:
> Hi Gary,
>
> Le 07/04/2012 04:30, Gary Gregory a écrit :
>> On Apr 6, 2012, at 16:05, Luc Maisonobe wrote:
>>
>>> Hi Gary,
>>>
>>> Le 06/04/2012 21:50, Gary Gregory a écrit :
On Fri, Apr 6, 2012 at 11:14 AM, luc wrote:
> Hello,
>
Hi Gary,
Le 07/04/2012 04:30, Gary Gregory a écrit :
> On Apr 6, 2012, at 16:05, Luc Maisonobe wrote:
>
>> Hi Gary,
>>
>> Le 06/04/2012 21:50, Gary Gregory a écrit :
>>> On Fri, Apr 6, 2012 at 11:14 AM, luc wrote:
>>>
Hello,
Some times ago, Thomas proposed an implementation of a
On Apr 6, 2012, at 16:05, Luc Maisonobe wrote:
> Hi Gary,
>
> Le 06/04/2012 21:50, Gary Gregory a écrit :
>> On Fri, Apr 6, 2012 at 11:14 AM, luc wrote:
>>
>>> Hello,
>>>
>>> Some times ago, Thomas proposed an implementation of a Longest Commons
>>> Substring algorithm. At
>>> that time I said I
Hi Gary,
Le 06/04/2012 21:50, Gary Gregory a écrit :
> On Fri, Apr 6, 2012 at 11:14 AM, luc wrote:
>
>> Hello,
>>
>> Some times ago, Thomas proposed an implementation of a Longest Commons
>> Substring algorithm. At
>> that time I said I had another algorithm in the same spirit for the Myers
>> d
On Fri, Apr 6, 2012 at 11:14 AM, luc wrote:
> Hello,
>
> Some times ago, Thomas proposed an implementation of a Longest Commons
> Substring algorithm. At
> that time I said I had another algorithm in the same spirit for the Myers
> difference algorithm.
>
> I got the green light to provide this c
Hello,
Some times ago, Thomas proposed an implementation of a Longest Commons
Substring algorithm. At
that time I said I had another algorithm in the same spirit for the
Myers difference algorithm.
I got the green light to provide this code base to the Apache Software
Foundation. I will send