log mercurial/revset.py @ 22882:ecd27fee5c2b

age author description
Fri, 10 Oct 2014 13:21:05 -0700 Pierre-Yves David fullreposet: drop custom sets but not smartsets detection
Fri, 10 Oct 2014 12:30:00 -0700 Pierre-Yves David addset: drop `.set()` usage during iteration
Fri, 10 Oct 2014 12:31:22 -0700 Pierre-Yves David baseset: access `_set` directly for containment check
Fri, 10 Oct 2014 12:30:56 -0700 Pierre-Yves David baseset: make `_set` a property cache
Wed, 08 Oct 2014 02:52:10 -0700 Pierre-Yves David revset-_hexlist: remove usage of `set()`
Wed, 08 Oct 2014 02:51:54 -0700 Pierre-Yves David revset-_intlist: remove usage of `set()`
Wed, 08 Oct 2014 02:51:16 -0700 Pierre-Yves David revset-_list: remove usage of `set()`
Wed, 08 Oct 2014 02:50:20 -0700 Pierre-Yves David revset-roots: remove usage of `set()`
Wed, 08 Oct 2014 02:49:17 -0700 Pierre-Yves David revset-origin: remove usage of `set()`
Wed, 08 Oct 2014 02:48:56 -0700 Pierre-Yves David revset-last: remove usage of `set()`
Wed, 08 Oct 2014 02:48:24 -0700 Pierre-Yves David revset-limit: remove usage of `set()`
Wed, 08 Oct 2014 02:47:46 -0700 Pierre-Yves David revset-destination: remove usage of `set()`
Wed, 08 Oct 2014 02:47:24 -0700 Pierre-Yves David revset-children: remove usage of `set()`
Wed, 08 Oct 2014 02:47:00 -0700 Pierre-Yves David revset-branch: remove usage of `set()`
Wed, 08 Oct 2014 02:45:53 -0700 Pierre-Yves David revset-rangeset: remove usage of `set()`
Wed, 08 Oct 2014 02:45:43 -0700 Pierre-Yves David revset-only: remove usage of `set()`
Thu, 09 Oct 2014 22:57:52 -0700 Pierre-Yves David revset: cache most conditions used in `filter`
Thu, 09 Oct 2014 04:12:20 -0700 Pierre-Yves David baseset: empty or one-element sets are ascending and descending
Tue, 07 Oct 2014 01:33:05 -0700 Pierre-Yves David filteredset: drop explicit order management
Thu, 09 Oct 2014 04:24:51 -0700 Pierre-Yves David revset: restore order of `or` operation as in Mercurial 2.9
Thu, 09 Oct 2014 09:12:54 -0700 Pierre-Yves David revset-_descendant: rework the whole sorting and combining logic
Thu, 09 Oct 2014 20:15:41 -0700 Pierre-Yves David addset: do lazy sorting
Thu, 09 Oct 2014 04:29:18 -0700 Pierre-Yves David baseset: drop custom __sub__ method
Thu, 09 Oct 2014 04:27:25 -0700 Pierre-Yves David baseset: drop custom __and__ method
Thu, 09 Oct 2014 04:27:01 -0700 Pierre-Yves David baseset: drop custom __add__ method
Tue, 07 Oct 2014 01:46:53 -0700 Pierre-Yves David smartset: drop infamous ascending, descending
Tue, 07 Oct 2014 01:41:14 -0700 Pierre-Yves David fullreposet: use `isascending` instead of `ascending` to recognise smartsets
Tue, 07 Oct 2014 01:41:26 -0700 Pierre-Yves David fullreposet: use `sort` to enforce the order
Tue, 07 Oct 2014 01:48:34 -0700 Pierre-Yves David revancestors: replace `descending` with `sort(reverse=False)`
Tue, 07 Oct 2014 01:41:02 -0700 Pierre-Yves David _descendants: replace `ascending()` with `sort()`
Tue, 07 Oct 2014 01:36:53 -0700 Pierre-Yves David _descendants: directly use smartset
Fri, 03 Oct 2014 03:29:55 -0500 Pierre-Yves David baseset: explicitly track order of the baseset
Fri, 03 Oct 2014 03:31:05 -0500 Pierre-Yves David baseset: fix isascending and isdescending
Fri, 03 Oct 2014 03:26:18 -0500 Pierre-Yves David baseset: prepare lazy ordering in __iter__
Fri, 03 Oct 2014 03:19:23 -0500 Pierre-Yves David baseset: implement a fastasc and fastdesc
Mon, 06 Oct 2014 11:03:30 -0700 Pierre-Yves David baseset: stop inheriting from built-in list class
Mon, 06 Oct 2014 23:45:07 -0700 Pierre-Yves David rangeset: use `first` and `last` instead of direct indexing
Tue, 07 Oct 2014 00:18:08 -0700 Pierre-Yves David filteredset: implement `first` and `last`
Mon, 06 Oct 2014 14:42:00 -0700 Pierre-Yves David baseset: implement `first` and `last` methods
Mon, 06 Oct 2014 12:52:36 -0700 Pierre-Yves David generatorset: implement first and last methods
Mon, 06 Oct 2014 11:57:59 -0700 Pierre-Yves David addset: implement first and last methods
Mon, 06 Oct 2014 11:54:53 -0700 Pierre-Yves David spanset: implement `first` and `last` methods
Mon, 06 Oct 2014 11:46:53 -0700 Pierre-Yves David smartset: add first and last methods
Wed, 08 Oct 2014 00:55:09 -0700 Pierre-Yves David revset-last: remove user of baseset.append
Mon, 06 Oct 2014 10:57:01 -0700 Pierre-Yves David revset-limit: remove user of baseset.append
Mon, 06 Oct 2014 10:41:43 -0700 Pierre-Yves David baseset: use default value instead of [] when possible
Sat, 04 Oct 2014 06:17:18 -0700 Pierre-Yves David generatorset: implement isascending and isdescending
Fri, 03 Oct 2014 21:11:56 -0700 Pierre-Yves David generatorset: explicitly track iteration order
Fri, 03 Oct 2014 20:23:02 -0700 Pierre-Yves David addset: drop caching through generatorset
Fri, 03 Oct 2014 21:01:30 -0700 Pierre-Yves David generatorset: get list-based fast iterations after the generator is consumed
Fri, 03 Oct 2014 20:48:28 -0700 Pierre-Yves David generatorset: move iteration code into _iterator
Fri, 03 Oct 2014 20:43:48 -0700 Pierre-Yves David generatorset: stop using a base as the _genlist
Fri, 03 Oct 2014 20:12:02 -0700 Pierre-Yves David generatorset: drop the leading underscore in the class name
Fri, 03 Oct 2014 20:14:43 -0700 Pierre-Yves David generatorset: update the docstring now that it is a smartset
Fri, 03 Oct 2014 20:18:48 -0700 Pierre-Yves David addset: drop the leading underscore from the class name
Fri, 03 Oct 2014 20:17:12 -0700 Pierre-Yves David addset: this is a smartset, update the docstring
Thu, 09 Oct 2014 05:27:23 -0700 Pierre-Yves David addset: use the ascending argument in _iterordered
Fri, 03 Oct 2014 12:54:56 -0500 Pierre-Yves David revset: remove the now unused _descgeneratorset class
Fri, 03 Oct 2014 12:53:41 -0500 Pierre-Yves David revset: use _generatorset in _revancestors
Fri, 03 Oct 2014 12:52:49 -0500 Pierre-Yves David revset: remove now unused class _ascgeneratorset
Fri, 03 Oct 2014 12:52:17 -0500 Pierre-Yves David revset: use _generatorset directly in _revdescendant
Fri, 03 Oct 2014 12:46:34 -0500 Pierre-Yves David generatorset: move membership testing on ordered gen to the main class
Fri, 03 Oct 2014 12:36:57 -0500 Pierre-Yves David generatorset: make use of the new mechanism in the subclass
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`