Thu, 12 Sep 2019 15:22:50 +0700 stack: return from behindcount() early draft
Anton Shestakov <av6@dwimlabs.net> [Thu, 12 Sep 2019 15:22:50 +0700] rev 5222
stack: return from behindcount() early Reduces indentation.
Thu, 12 Sep 2019 14:44:19 +0700 stack: use self._revs in stack.behindcount() draft
Anton Shestakov <av6@dwimlabs.net> [Thu, 12 Sep 2019 14:44:19 +0700] rev 5221
stack: use self._revs in stack.behindcount() This code also doesn't care about the order of revisions, it just wants all revs except stack base, and that's what self._revs is.
Thu, 12 Sep 2019 14:42:38 +0700 stack: use self._revs in stack.heads() draft
Anton Shestakov <av6@dwimlabs.net> [Thu, 12 Sep 2019 14:42:38 +0700] rev 5220
stack: use self._revs in stack.heads() No code cares about the ordering of the heads anyway, so let's use the unordered property that doesn't need to be sliced (because it doesn't include base).
Tue, 04 Sep 2018 19:53:08 +0200 pick: Add a test to check that pick pick the right content draft
Boris Feld <boris.feld@octobus.net> [Tue, 04 Sep 2018 19:53:08 +0200] rev 5219
pick: Add a test to check that pick pick the right content
Thu, 01 Feb 2018 18:26:56 +0100 WIP on handling stacks draft
Boris Feld <boris.feld@octobus.net> [Thu, 01 Feb 2018 18:26:56 +0100] rev 5218
WIP on handling stacks
Mon, 15 Jan 2018 17:46:40 +0100 test: add a test for current behavior of precursors revset draft
Boris Feld <boris.feld@octobus.net> [Mon, 15 Jan 2018 17:46:40 +0100] rev 5217
test: add a test for current behavior of precursors revset The precursors revset currently returns the closest predecessors of a revset. If these predecessors are not known locally, it returns an empty list.
(0) -3000 -1000 -300 -100 -30 -10 -6 +6 +10 +30 +100 tip