Tue, 16 Apr 2013 10:08:20 -0700 Bryan O'Sullivan revlog: don't cross-check ancestor result against Python version
Tue, 16 Apr 2013 10:08:20 -0700 Bryan O'Sullivan parsers: a C implementation of the new ancestors algorithm
Tue, 16 Apr 2013 10:08:19 -0700 Bryan O'Sullivan revlog: choose a consistent ancestor when there's a tie
Tue, 16 Apr 2013 10:08:18 -0700 Bryan O'Sullivan ancestor: a new algorithm that is faster for nodes near tip
Tue, 16 Apr 2013 15:33:18 +0200 Pierre-Yves David update: allow dirty update to foreground (successors)
Tue, 16 Apr 2013 15:16:33 +0200 Pierre-Yves David obsolete: extract foreground computation from bookmark.validdest
(0) -10000 -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip