| Sun, 29 May 2022 15:17:27 +0200 |
Manuel Jacob |
py3: replace `pycompat.xrange` by `range`
|
| Mon, 21 Feb 2022 13:08:28 -0700 |
Gregory Szorc |
py3: use class X: instead of class X(object):
|
| Thu, 03 Mar 2022 17:34:00 +0100 |
Gregory Szorc |
py2: remove simple from __future__ statements
|
| Thu, 25 Mar 2021 18:02:08 +0100 |
Raphaël Gomès |
contributor: change mentions of mpm to olivia
|
| Fri, 27 Nov 2020 17:03:29 -0500 |
Augie Fackler |
formating: upgrade to black 20.8b1
|
| Tue, 10 Mar 2020 14:24:08 +0100 |
Pierre-Yves David |
rust: clean remains of direct-ffi code
|
| Fri, 06 Mar 2020 13:27:41 -0500 |
Augie Fackler |
cleanup: run pyupgrade on our source tree to clean up varying things
|
| Fri, 27 Dec 2019 13:11:22 -0500 |
Matt Harbison |
ancestor: drop another unused variable assignment
|
| Fri, 27 Dec 2019 13:05:22 -0500 |
Matt Harbison |
ancestor: drop an unused local variable assignment
|
| Fri, 08 Nov 2019 11:19:20 -0800 |
Augie Fackler |
cleanup: remove pointless r-prefixes on single-quoted strings
|
| Sun, 06 Oct 2019 09:45:02 -0400 |
Augie Fackler |
formatting: blacken the codebase
|
| Mon, 14 Jan 2019 18:36:09 +0100 |
Georges Racinet |
ancestor: incrementalmissingancestors.basesheads()
|
| Mon, 08 Oct 2018 19:11:41 +0200 |
Georges Racinet |
rust: rustlazyancestors.__contains__
|
| Thu, 27 Sep 2018 16:55:44 +0200 |
Georges Racinet |
rust: hooking into Python code
|
| Mon, 10 Sep 2018 20:57:18 +0900 |
Yuya Nishihara |
ancestor: remove extra generator from lazyancestors.__iter__()
|
| Mon, 10 Sep 2018 22:34:19 +0900 |
Yuya Nishihara |
ancestor: use heapreplace() in place of heappop/heappush()
|
| Tue, 11 Sep 2018 22:36:51 +0900 |
Yuya Nishihara |
ancestor: rename local aliases of heapq functions in _lazyancestorsiter()
|
| Mon, 10 Sep 2018 21:58:59 +0900 |
Yuya Nishihara |
ancestor: optimize _lazyancestorsiter() for contiguous chains
|
| Mon, 10 Sep 2018 21:54:40 +0900 |
Yuya Nishihara |
ancestor: unroll loop of parents in _lazyancestorsiter()
|
| Mon, 10 Sep 2018 21:46:19 +0900 |
Yuya Nishihara |
ancestor: return early from _lazyancestorsiter() when reached to stoprev
|
| Tue, 11 Sep 2018 22:38:32 +0900 |
Yuya Nishihara |
ancestor: remove alias of initrevs from _lazyancestorsiter()
|
| Fri, 07 Sep 2018 23:36:09 -0700 |
Martin von Zweigbergk |
lazyancestors: reuse __iter__ implementation in __contains__
|
| Sun, 09 Sep 2018 23:16:55 -0700 |
Martin von Zweigbergk |
lazyancestors: extract __iter__ to free function
|
| Fri, 07 Sep 2018 14:48:38 -0700 |
Martin von Zweigbergk |
ancestors: add nullrev to set from the beginning
|
| Sat, 08 Sep 2018 10:59:24 +0900 |
Yuya Nishihara |
ancestor: filter out initial revisions lower than stoprev
|
| Thu, 06 Sep 2018 19:37:38 -0400 |
Boris Feld |
ancestors: ensure a consistent order even in the "inclusive" case
|
| Thu, 06 Sep 2018 17:00:28 -0400 |
Boris Feld |
ancestors: actually iterate over ancestors in topological order (issue5979)
|
| Wed, 01 Aug 2018 13:00:45 -0700 |
Gregory Szorc |
global: use pycompat.xrange()
|
| Sun, 08 Jul 2018 17:17:54 +0900 |
Yuya Nishihara |
py3: make 'None in lazyancestors' not crash
|
| Fri, 10 Feb 2017 16:56:29 -0800 |
Martin von Zweigbergk |
cleanup: use set literals
|
| 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
|
| Tue, 19 Jan 2010 22:45:09 -0600 |
Matt Mackall |
Merge with stable
|
| Tue, 19 Jan 2010 22:20:08 -0600 |
Matt Mackall |
Update license to GPLv2+
stable
|
| Tue, 24 Nov 2009 09:49:23 +0100 |
Sune Foldager |
ancestor: improve docstring
|
| Sun, 17 May 2009 03:53:13 +0200 |
Benoit Boissinot |
ancestor: use set instead of dict
|
| Sun, 26 Apr 2009 01:08:54 +0200 |
Martin Geisler |
updated license to be explicit about GPL version 2
|
| Mon, 23 Mar 2009 15:36:30 +0100 |
Nicolas Dumazet |
ancestor: caching the parent list to improve performance
|
| Sat, 29 Mar 2008 12:39:47 -0500 |
Matt Mackall |
symmetricdifference: move back to copies
|
| Sat, 29 Mar 2008 12:39:47 -0500 |
Matt Mackall |
symmetricdifference: change colors to sides
|
| Sat, 29 Mar 2008 12:39:47 -0500 |
Matt Mackall |
ancestors: simplify symmetric difference
|
| Sat, 15 Mar 2008 10:02:31 -0500 |
Matt Mackall |
diff: use copy smarts from copies.py
|
| Sat, 15 Mar 2008 10:02:31 -0500 |
Matt Mackall |
merge: move symmetricdifferences to ancestor.py
|
| Fri, 17 Nov 2006 08:06:54 +0100 |
Thomas Arendsen Hein |
white space and line break cleanups
|
| Wed, 20 Sep 2006 16:50:50 -0500 |
Matt Mackall |
Abstract ancestor algorithm into generic function
|
