| Fri, 14 Nov 2014 19:40:30 -0800 |
Siddharth Agarwal |
ancestor: add a way to remove ancestors of bases from a given set
|
| Fri, 14 Nov 2014 17:21:00 -0800 |
Siddharth Agarwal |
ancestor: add a way to add to bases of a missing ancestor object
|
| Sun, 16 Nov 2014 00:39:29 -0800 |
Siddharth Agarwal |
ancestor: add a way to test whether a missing ancestor object has bases
|
| Fri, 14 Nov 2014 16:53:40 -0800 |
Siddharth Agarwal |
ancestor: remove now-unused missingancestors function
|
| Fri, 14 Nov 2014 23:44:38 -0800 |
Siddharth Agarwal |
ancestor.missingancestors: turn into a state-keeping class
|
| Fri, 14 Nov 2014 13:47:25 -0800 |
Siddharth Agarwal |
ancestor.missingancestors: calculate start point after filtering revsvisit
|
| Fri, 14 Nov 2014 11:33:52 -0800 |
Siddharth Agarwal |
ancestor.missingancestors: don't discard from basesvisit
|
| Fri, 14 Nov 2014 14:36:25 -0800 |
Siddharth Agarwal |
ancestor.lazyancestors: take parentrevs function rather than changelog
|
| Fri, 15 Aug 2014 15:57:50 -0700 |
Pierre-Yves David |
ancestors: add a __nonzero__ method
|
| Thu, 17 Apr 2014 19:49:56 +0200 |
Mads Kiilerich |
ancestors: extract candidates function as commonancestorsheads
|
| Thu, 20 Mar 2014 01:35:07 +0100 |
Mads Kiilerich |
ancestor: remove unused genericancestor
|
| Mon, 24 Feb 2014 22:42:13 +0100 |
Mads Kiilerich |
ancestors: remove unnecessary handling of 'left'
|
| Wed, 06 Nov 2013 16:48:06 -0500 |
Augie Fackler |
cleanup: move stdlib imports to their own import statement
|
| 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
|
