On Mon, Jun 27, 2011 at 12:14 AM, Johan Corveleyn wrote:
[]
>
> Hi Morten,
>
> Thanks for explaining.
>
> Maybe you can start a feature branch for this optimization (and maybe
> other further LCS/diff-optimizations). That would give it some more
> visibility, and would allow for some more experime
On Sun, Jun 26, 2011 at 11:23 AM, Morten Kloster wrote:
> On Tue, Jun 14, 2011 at 11:12 PM, Johan Corveleyn wrote:
>> On Tue, Jun 14, 2011 at 7:32 PM, Morten Kloster wrote:
>>> On Tue, Jun 14, 2011 at 2:49 AM, Johan Corveleyn wrote:
On Tue, Jun 7, 2011 at 10:16 PM, Morten Kloster wrote:
>
On Tue, Jun 14, 2011 at 11:12 PM, Johan Corveleyn wrote:
> On Tue, Jun 14, 2011 at 7:32 PM, Morten Kloster wrote:
>> On Tue, Jun 14, 2011 at 2:49 AM, Johan Corveleyn wrote:
>>> On Tue, Jun 7, 2011 at 10:16 PM, Morten Kloster wrote:
>> []
Here's an updated patch based on the current HE
On Tue, Jun 14, 2011 at 7:32 PM, Morten Kloster wrote:
> On Tue, Jun 14, 2011 at 2:49 AM, Johan Corveleyn wrote:
>> On Tue, Jun 7, 2011 at 10:16 PM, Morten Kloster wrote:
>>>
> []
>>> Here's an updated patch based on the current HEAD, and with
>>> one or two minor improvements. While, as stated,
On Tue, Jun 14, 2011 at 2:49 AM, Johan Corveleyn wrote:
> On Tue, Jun 7, 2011 at 10:16 PM, Morten Kloster wrote:
>>
[]
>> Here's an updated patch based on the current HEAD, and with
>> one or two minor improvements. While, as stated, the patch
>> can give many-fold speed increases for ideal cases
On Tue, Jun 7, 2011 at 10:16 PM, Morten Kloster wrote:
> On Fri, May 27, 2011 at 11:00 PM, Morten Kloster wrote:
>> [[[
>> Speeds up LCS algorithm for well-separated sections of change
>> By exploiting unique matches between the two files, it is possible to
>> "restart" the LCS algorithm at tim
Here's an updated patch based on the current HEAD, and with
one or two minor improvements. While, as stated, the patch
can give many-fold speed increases for ideal cases, it also slows
down the LCS algorithm significantly for poorly matching files; I
got about 18% increase in running time on my sys
[[[
Speeds up LCS algorithm for well-separated sections of change
By exploiting unique matches between the two files, it is possible to
"restart" the LCS algorithm at times and reset the buildup of square
computational complexity.
* subversion/libsvn_diff/lcs.c
(svn_diff__snake_t): Added u
8 matches
Mail list logo