mercurial/revset.py
Fri, 03 Oct 2014 12:36:08 -0500 Pierre-Yves David generatorset: make it possible to use gen as fastasc or fastdesc
Fri, 03 Oct 2014 03:19:00 -0500 Pierre-Yves David baseset: rely on the abstractsmartset implementation for filter
Thu, 02 Oct 2014 19:48:14 -0500 Pierre-Yves David _orderedsetmixin: drop this now unused class
Thu, 02 Oct 2014 19:47:33 -0500 Pierre-Yves David spanset: drop _orderedsetmixin inheritance
Fri, 03 Oct 2014 01:44:52 -0500 Pierre-Yves David orderedlazyset: drop this now unused class
Thu, 02 Oct 2014 19:43:42 -0500 Pierre-Yves David _descendant: use filteredset instead of orderedlazyset
Fri, 03 Oct 2014 01:37:13 -0500 Pierre-Yves David addset: use the base implementation for ascending and descending
Fri, 03 Oct 2014 01:34:25 -0500 Pierre-Yves David addset: use base implementation for __filter__
Fri, 03 Oct 2014 01:33:32 -0500 Pierre-Yves David addset: use base implementation for __add__
Fri, 03 Oct 2014 01:32:50 -0500 Pierre-Yves David addset: use base implementation for __sub__
Fri, 03 Oct 2014 01:31:46 -0500 Pierre-Yves David addset: use base implementation for __and__
Thu, 02 Oct 2014 19:42:06 -0500 Pierre-Yves David addset: promote to real smartset
Fri, 03 Oct 2014 00:12:22 -0500 Pierre-Yves David addset: add a __nonzero__ method
Thu, 02 Oct 2014 23:38:30 -0500 Pierre-Yves David addset: offer a fastasc and fastdesc methods
Thu, 02 Oct 2014 23:28:18 -0500 Pierre-Yves David addset: split simple and ordered iteration
Fri, 03 Oct 2014 01:55:09 -0500 Pierre-Yves David generatorset: promote to smartset
Fri, 03 Oct 2014 01:56:57 -0500 Pierre-Yves David generatorset: implement __nonzero__
Fri, 03 Oct 2014 00:31:33 -0500 Pierre-Yves David spanset: use base implementation for __add__
Fri, 03 Oct 2014 00:31:18 -0500 Pierre-Yves David spanset: use base implementation for __sub__
Fri, 03 Oct 2014 00:30:58 -0500 Pierre-Yves David spanset: use base implementation for __and__
Fri, 03 Oct 2014 00:39:57 -0500 Pierre-Yves David spanset: use base implementation for filter
Fri, 03 Oct 2014 01:27:00 -0500 Pierre-Yves David filteredset: use base implementation for filter
Fri, 03 Oct 2014 01:25:35 -0500 Pierre-Yves David filteredset: use base implementation for __add__
Fri, 03 Oct 2014 01:24:30 -0500 Pierre-Yves David filteredset: use base implementation for __sub__
Fri, 03 Oct 2014 01:23:12 -0500 Pierre-Yves David filteredset: use base implementation for __and__
Thu, 02 Oct 2014 19:22:17 -0500 Pierre-Yves David abstractsmartset: add default implementation for __sub__
Thu, 02 Oct 2014 19:22:03 -0500 Pierre-Yves David abstractsmartset: add default implementation for __add__
Thu, 02 Oct 2014 19:21:40 -0500 Pierre-Yves David abstractsmartset: add default implementation for __and__
Wed, 01 Oct 2014 00:26:50 -0500 Pierre-Yves David abstractsmartset: add default implementation for filter
Fri, 03 Oct 2014 01:16:23 -0500 Pierre-Yves David lazyset: rename the class to filteredset
Thu, 02 Oct 2014 19:14:03 -0500 Pierre-Yves David lazyset: add order awareness to the class
Thu, 02 Oct 2014 19:03:14 -0500 Pierre-Yves David lazyset: remove min/max
Thu, 02 Oct 2014 19:02:50 -0500 Pierre-Yves David baseset: remove min/max methods
Thu, 02 Oct 2014 18:59:41 -0500 Pierre-Yves David abstractsmartset: add a default implementation for min and max
Thu, 02 Oct 2014 18:52:09 -0500 Pierre-Yves David lazyset: drop now useless ascending/descending definition
Tue, 30 Sep 2014 23:36:57 -0500 Pierre-Yves David lazyset: inherit the fastasc and fastdesc method from subset
Thu, 02 Oct 2014 18:25:37 -0500 Pierre-Yves David lazyset: split the iteration logic from the condition filtering logic
Thu, 02 Oct 2014 17:53:55 -0500 Pierre-Yves David spanset: do a single range check in __contains__
Thu, 02 Oct 2014 18:02:17 -0500 Pierre-Yves David spanset: enforce the order lazily to gain `fastasc` and `fastdesc` methods
Tue, 30 Sep 2014 22:26:34 -0500 Pierre-Yves David abstractsmartset: document the `fastasc` and `fastdesc` attributes/methods
Thu, 02 Oct 2014 18:35:56 -0500 Pierre-Yves David spanset: remove ascending/descending implementation
Thu, 02 Oct 2014 18:35:00 -0500 Pierre-Yves David baseset: remove ascending/descending redefinition
Thu, 02 Oct 2014 18:34:18 -0500 Pierre-Yves David abstractsmartset: default implementation for `ascending` and `descending`
Wed, 17 Sep 2014 04:55:55 -0700 Pierre-Yves David revert: bring back usage of `subset & ps` in `parents`
Wed, 01 Oct 2014 15:14:36 -0500 Pierre-Yves David revset: introduce an abstractsmartset class
Wed, 01 Oct 2014 15:03:16 -0500 Pierre-Yves David revset: add a `__nonzero__` to baseset
Wed, 01 Oct 2014 15:50:54 -0500 Pierre-Yves David revset: drop isinstance(baseset) in spanset.__sub__
Wed, 01 Oct 2014 15:50:40 -0500 Pierre-Yves David revset: drop isinstance(baseset) in spanset.__and__
Tue, 30 Sep 2014 23:09:59 -0500 Pierre-Yves David revset: drop isinstance(baseset) from baseset.__and__
Wed, 01 Oct 2014 15:53:42 -0500 Pierre-Yves David revset: use direct access to __contains__ in spanset.__sub__
Tue, 30 Sep 2014 12:39:21 -0500 Pierre-Yves David revset: use a single return statement in matcher function
Wed, 30 Apr 2014 16:56:23 -0700 Pierre-Yves David revset: rely on built in iterator when possible in _generatorset.__iter__
Thu, 18 Sep 2014 15:52:45 -0700 Pierre-Yves David revset: prefetch an attribute in _generatorset.__iter__
Wed, 17 Sep 2014 11:00:03 -0700 Pierre-Yves David revset: use `subset &` in bare `p2()`
Wed, 17 Sep 2014 10:59:52 -0700 Pierre-Yves David revset: use `subset &` in bare `p1()`
Wed, 17 Sep 2014 11:00:09 -0700 Pierre-Yves David revset: use `subset &` in `rev`
Wed, 17 Sep 2014 19:52:34 -0700 Pierre-Yves David revset: use `subset &` in `origin`
Wed, 17 Sep 2014 10:59:16 -0700 Pierre-Yves David revset: use `subset &` in `follow`
Wed, 17 Sep 2014 10:58:50 -0700 Pierre-Yves David revset: use `subset &` in `filelog`
Wed, 17 Sep 2014 10:58:39 -0700 Pierre-Yves David revset: use `subset &` in `divergent`
less more (0) -300 -100 -60 tip