Hi,

On Tue, May 22, 2012 at 12:29 PM, Michael Dürig <[email protected]> wrote:
> Have a look at RootImplTest.largeChildList() which adds 10000 child nodes
> flat. The test case is easily extended to demonstrate that adding child
> nodes leads to linear performance drop.

Thanks!

See OAK-109 and revision 1341534 for the more efficient diffing
algorithm I mentioned. It dramatically speeds up the largeChildList()
test at high loop counts.

BR,

Jukka Zitting

Reply via email to