log mercurial/revset.py @ 22729:f7b0ebe6ad42

age author description
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`
Wed, 17 Sep 2014 10:57:57 -0700 Pierre-Yves David revset: use `subset &` in `bisect`
Wed, 17 Sep 2014 10:57:47 -0700 Pierre-Yves David revset: use `subset &` in `ancestorspec`
Wed, 17 Sep 2014 19:57:09 -0700 Pierre-Yves David revset: use `subset &` in `bookmark`
Wed, 17 Sep 2014 10:59:40 -0700 Pierre-Yves David revset: use `subset &` in `outgoing`
Wed, 30 Apr 2014 16:56:48 -0700 Pierre-Yves David revset: avoid in loop lookup in _generatorset._consumegen
Fri, 25 Apr 2014 14:51:24 -0700 Pierre-Yves David revset: reduce dict lookup in lazyset.__contains__
Fri, 25 Apr 2014 17:53:58 -0700 Pierre-Yves David revset: do less lookup during spanset.__contains__
Wed, 24 Sep 2014 20:11:36 -0700 Pierre-Yves David revset: fast implementation for fullreposet.__and__
Thu, 18 Sep 2014 13:04:02 -0700 Pierre-Yves David revset: turn spanset into a factory function
Tue, 29 Apr 2014 19:06:15 -0700 Pierre-Yves David revert: add a fullreposet class
Sat, 27 Sep 2014 13:18:10 -0500 Matt Mackall merge with stable
Tue, 16 Sep 2014 23:59:29 -0700 Pierre-Yves David revset: add an optimised baseset.__contains__ (issue4371) stable
Wed, 17 Sep 2014 19:56:59 -0700 Pierre-Yves David revset: remove nullrev from the bookmark computation
Wed, 17 Sep 2014 10:58:25 -0700 Pierre-Yves David revset: unify code flow in `bookmark`
Wed, 17 Sep 2014 10:59:30 -0700 Pierre-Yves David revset: remove invalid value in the origin set
Wed, 17 Sep 2014 19:49:26 -0700 Pierre-Yves David revset: remove nullrev from set computed in parents()
Wed, 17 Sep 2014 19:44:03 -0700 Pierre-Yves David revset: refactor parents() into a single return point
Wed, 17 Sep 2014 04:40:30 -0700 Pierre-Yves David revset: remove nullrev from set computed in p1() and p2()
Tue, 16 Sep 2014 23:42:41 -0700 Pierre-Yves David revset: document the choice made in __generatorset.__iter__
Tue, 16 Sep 2014 22:55:49 -0700 Pierre-Yves David revset: stop using a baseset instead of a plain list in _revsbetween
Tue, 16 Sep 2014 23:47:34 -0700 Pierre-Yves David revset: simplify orderedlazyset creation in spanset method
Tue, 16 Sep 2014 23:37:03 -0700 Pierre-Yves David revset: use spanset.isdescending in multiple simple places
Tue, 16 Sep 2014 23:34:18 -0700 Pierre-Yves David revset: wider definition of ascending and descending for spanset
Fri, 12 Sep 2014 14:21:18 -0700 Durham Goode revset: lower weight for _intlist function
Fri, 12 Sep 2014 15:00:51 -0700 Durham Goode revset: make parents() O(number of parents)
Fri, 12 Sep 2014 16:21:13 -0700 Durham Goode revset: make descendants() lazier