| Mon, 13 Mar 2017 12:40:14 -0700 |
Gregory Szorc |
py3: add __bool__ to every class defining __nonzero__
|
| Mon, 16 May 2016 21:30:53 +0000 |
timeless |
py3: convert to next() function
|
| Fri, 07 Aug 2015 19:45:48 -0700 |
Gregory Szorc |
ancestor: use absolute_import
|
| Wed, 24 Jun 2015 12:37:55 -0500 |
Pierre-Yves David |
ancestors: prefetch method outside of the loop
|
| Sat, 16 May 2015 11:28:04 -0700 |
Martin von Zweigbergk |
util: drop alias for collections.deque
|
| 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
|
| Tue, 18 Dec 2012 12:47:20 -0800 |
Siddharth Agarwal |
ancestor: add lazy membership testing to lazyancestors
|
| Tue, 18 Dec 2012 10:14:01 -0800 |
Siddharth Agarwal |
revlog: move ancestor generation out to a new class
|
| Tue, 11 Dec 2012 14:47:33 -0800 |
Siddharth Agarwal |
ancestor: move missingancestors doctest out into a separate file
|
| Wed, 28 Nov 2012 10:35:12 -0800 |
Siddharth Agarwal |
ancestor: fix a comment (followup to 0b03454abae7)
|
| Mon, 26 Nov 2012 11:46:51 -0800 |
Siddharth Agarwal |
ancestor: faster algorithm for difference of ancestor sets
|
| Wed, 01 Jun 2011 12:38:46 +0200 |
Martin Geisler |
check-code: flag 0/1 used as constant Boolean expression
|
| Mon, 07 Mar 2011 15:45:10 -0600 |
Matt Mackall |
ancestor: improve description
|
| Fri, 24 Sep 2010 12:46:54 -0500 |
Matt Mackall |
backout most of 4f8067c94729
|
| Thu, 23 Sep 2010 00:02:31 -0500 |
Brodie Rao |
cleanup: use x in (a, b) instead of x == a or x == b
|
| Mon, 21 Jun 2010 13:25:42 -0500 |
Matt Mackall |
merge: sort arguments to stabilize the ancestor search
|
