Wed, 04 Feb 2015 21:37:06 +0900 |
Yuya Nishihara |
revset: have rev() validate input by repo.changelog.__contains__()
|
Tue, 03 Feb 2015 17:54:01 -0600 |
Matt Mackall |
merge with stable
|
Tue, 03 Feb 2015 21:56:29 +0900 |
FUJIWARA Katsunori |
revset: get revision number of each node from target namespaces
stable
|
Mon, 02 Feb 2015 23:07:04 +0900 |
FUJIWARA Katsunori |
revset: replace parsing alias definition by _parsealiasdefn to parse strictly
|
Mon, 02 Feb 2015 23:07:04 +0900 |
FUJIWARA Katsunori |
revset: introduce _parsealiasdefn to parse alias definitions strictly
|
Sat, 31 Jan 2015 01:00:50 +0900 |
FUJIWARA Katsunori |
revset: raise RepoLookupError to make present() predicate continue the query
stable
|
Sun, 25 Jan 2015 20:20:27 +0900 |
Yuya Nishihara |
revset: fix ancestors(null) to include null revision (issue4512)
stable
|
Sat, 10 Jan 2015 12:56:38 +0900 |
Yuya Nishihara |
revset: allow rev(-1) to indicate null revision (BC)
stable
|
Wed, 21 Jan 2015 15:23:13 -0800 |
Martin von Zweigbergk |
log: evaluate filesets on working copy, not its parent
stable
|
Sat, 10 Jan 2015 23:18:11 +0900 |
FUJIWARA Katsunori |
revset: check for collisions between alias argument names in the declaration
|
Sat, 10 Jan 2015 23:18:11 +0900 |
FUJIWARA Katsunori |
revset: parse alias declaration strictly by _parsealiasdecl
|
Sat, 10 Jan 2015 23:18:11 +0900 |
FUJIWARA Katsunori |
revset: introduce "_parsealiasdecl" to parse alias declarations strictly
|
Sat, 10 Jan 2015 23:18:11 +0900 |
FUJIWARA Katsunori |
revset: store full detail into revsetalias.error for error source distinction
|
Sat, 10 Jan 2015 23:18:11 +0900 |
FUJIWARA Katsunori |
revset: factor out composing error message for ParseError to reuse
|
Sat, 10 Jan 2015 23:18:11 +0900 |
FUJIWARA Katsunori |
revset: make tokenize extensible to parse alias declarations and definitions
|
Tue, 13 Jan 2015 15:07:08 -0800 |
Sean Farley |
namespaces: add revset for 'named(namespace)'
|
Wed, 14 Jan 2015 12:50:46 -0800 |
Matt Mackall |
merge with stable
|
Sat, 10 Jan 2015 21:36:42 +0900 |
Yuya Nishihara |
revset: simplify fullreposet.__and__ to call sort() with boolean flag
|
Sat, 10 Jan 2015 21:31:59 +0900 |
Yuya Nishihara |
revset: fix spanset.isascending() to honor sort() or reverse() request
stable
|
Mon, 12 Jan 2015 09:46:56 -0800 |
Martin von Zweigbergk |
filelog: fix backwards comment for 'backrevref'
|
Mon, 12 Jan 2015 09:49:25 -0800 |
Martin von Zweigbergk |
filelog: remove trailing "form feed" character
|
Mon, 12 Jan 2015 09:48:05 -0800 |
Martin von Zweigbergk |
filelog: remove unused variable 'lkr'
|
Thu, 08 Jan 2015 00:01:03 +0100 |
Mads Kiilerich |
revset: use localrepo revbranchcache for branch name filtering
|
Thu, 06 Nov 2014 14:55:18 -0800 |
Sean Farley |
revset: use '%' as an operator for 'only'
|
Tue, 06 Jan 2015 23:46:18 +0900 |
FUJIWARA Katsunori |
revset: introduce new operator "##" to concatenate strings/symbols at runtime
|
Tue, 06 Jan 2015 11:23:38 -0800 |
Pierre-Yves David |
revset-filelog: handle hidden linkrev for file missing for head (issue4490)
|
Mon, 05 Jan 2015 15:46:14 -0600 |
Matt Mackall |
merge with stable
|
Sat, 03 Jan 2015 10:25:08 +0900 |
Yuya Nishihara |
revset: drop pre-lazyset optimization for stringset of subset == entire repo
stable
|
Mon, 05 Jan 2015 11:02:04 +0900 |
FUJIWARA Katsunori |
revset: delay showing parse error for the revset alias until it is referred
|
Mon, 29 Dec 2014 18:35:23 -0800 |
Pierre-Yves David |
linkrev-filelog: handle filtered linkrev with no visible children (issue4307)
|
Mon, 29 Dec 2014 17:23:16 -0800 |
Pierre-Yves David |
linkrev: work around linkrev to filtered entry in 'filelog' revset
|
Mon, 29 Dec 2014 23:40:24 -0800 |
Pierre-Yves David |
linkrev: also adjust linkrev when bootstrapping 'follow' revset
|
Wed, 03 Dec 2014 22:56:42 +0900 |
Yuya Nishihara |
revset: add 'only' to DoS-safe symbols
|
Wed, 03 Dec 2014 22:52:54 +0900 |
Yuya Nishihara |
revset: move 'only' so that functions are sorted alphabetically
|
Mon, 01 Dec 2014 19:34:11 -0600 |
Matt Mackall |
merge with stable
|
Mon, 01 Dec 2014 05:18:12 -0800 |
Pierre-Yves David |
revset: fix first and last for generatorset (issue4465)
stable
|
Fri, 14 Nov 2014 16:38:58 -0800 |
Siddharth Agarwal |
revset.only: use cl.findmissingrevs
|
Thu, 16 Oct 2014 23:15:35 -0700 |
Pierre-Yves David |
revset-matching: call 'getset' on a 'fullreposet'
|
Thu, 16 Oct 2014 23:15:06 -0700 |
Pierre-Yves David |
revset-parentspec: call 'getset' on a 'fullreposet'
|
Thu, 16 Oct 2014 23:14:17 -0700 |
Pierre-Yves David |
revset-children: call 'getset' on a 'fullreposet'
|
Thu, 16 Oct 2014 23:11:25 -0700 |
Pierre-Yves David |
revset-ancestorspec: call 'getset' on a 'fullreposet'
|
Thu, 16 Oct 2014 23:10:44 -0700 |
Pierre-Yves David |
revset-rangeset: call 'getset' on a 'fullreposet'
|
Thu, 17 Apr 2014 22:47:38 +0200 |
Mads Kiilerich |
spelling: fixes from proofreading of spell checker issues
|
Sat, 01 Nov 2014 22:58:30 +0000 |
Pierre-Yves David |
addset: fix `first` and `last` on sorted addset (issue4426)
stable
|
Fri, 31 Oct 2014 10:41:36 -0700 |
Martin von Zweigbergk |
revset: don't recreate matcher for every revision
stable
|
Tue, 28 Oct 2014 14:06:06 -0700 |
Durham Goode |
revset: fix O(2^n) perf regression in addset
stable
|
Thu, 23 Oct 2014 21:53:37 +0900 |
Yuya Nishihara |
revset: avoid O(n) lookup of invalid revision in rev()
stable
|
Sun, 19 Oct 2014 16:48:33 +0900 |
Yuya Nishihara |
revset: have rev() drop out-of-range or filtered rev explicitly (issue4396)
stable
|
Wed, 22 Oct 2014 15:47:27 -0500 |
Matt Mackall |
revset: avoid recalculating filesets
stable
|
Thu, 16 Oct 2014 17:46:58 -0700 |
Pierre-Yves David |
revset-phases: prefetch attributes in phasesrelated revsets
|
Sat, 11 Oct 2014 01:21:47 -0700 |
Pierre-Yves David |
revset-phases: do not cache phase-related filters
|
Sat, 11 Oct 2014 01:39:20 -0700 |
Pierre-Yves David |
revset-node: speedup by a few hundred fold
|
Fri, 10 Oct 2014 17:28:18 -0700 |
Pierre-Yves David |
revset-only: use `subset &` instead of filtering
|
Tue, 30 Sep 2014 15:03:54 -0500 |
Pierre-Yves David |
revset-_ancestor: use & instead of filter
|
Wed, 08 Oct 2014 02:45:21 -0700 |
Pierre-Yves David |
revset-only: use __nonzero__ to check if a revset is empty
|
Wed, 15 Oct 2014 12:38:47 -0700 |
Pierre-Yves David |
_spanset: drop __getitem__ implementation
|
Wed, 15 Oct 2014 12:38:32 -0700 |
Pierre-Yves David |
filteredset: drop __getitem__ implementation
|
Wed, 15 Oct 2014 04:28:55 -0700 |
Pierre-Yves David |
generatorset: implement __len__
|
Wed, 15 Oct 2014 04:26:23 -0700 |
Pierre-Yves David |
revset: make __len__ part of the offical API
|
Wed, 15 Oct 2014 04:08:06 +0200 |
Mads Kiilerich |
revset: better naming of variables containing the value of a single argument
|
Fri, 10 Oct 2014 13:09:22 -0700 |
Pierre-Yves David |
spanset: remove `.set()` definition
|
Fri, 10 Oct 2014 13:08:49 -0700 |
Pierre-Yves David |
generatorset: remove `.set()` definition
|
Fri, 10 Oct 2014 13:08:28 -0700 |
Pierre-Yves David |
addset: remove `.set()` definition
|
Fri, 10 Oct 2014 13:08:10 -0700 |
Pierre-Yves David |
filteredset: remove `.set()` definition
|
Fri, 10 Oct 2014 13:07:35 -0700 |
Pierre-Yves David |
baseset: remove `set()` definition
|
Fri, 10 Oct 2014 11:27:57 -0700 |
Pierre-Yves David |
abstractsmartset: remove `set()` method definition
|
Fri, 10 Oct 2014 14:27:05 -0700 |
Pierre-Yves David |
match: check if an object is a baseset using `isascending` instead of `set`
|
Fri, 10 Oct 2014 14:22:23 -0700 |
Pierre-Yves David |
getset: check if an object is a baseset using `isascending` instead of `set`
|
Fri, 10 Oct 2014 13:24:57 -0700 |
Pierre-Yves David |
fullreposet: detect smartset using "isascending" instead of "set"
|
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`
|
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
|
Mon, 11 Aug 2014 23:45:08 -0400 |
Michael O'Connor |
revset: bookmark revset interprets 'literal:' prefix correctly (issue4329)
stable
|
Thu, 24 Jul 2014 12:12:12 -0700 |
Gregory Szorc |
revset: optimize baseset.__sub__ (issue4313)
stable
|
Fri, 18 Jul 2014 19:46:56 -0400 |
Matt Harbison |
revset: avoid a ValueError when 'only()' is given an empty set
|
Sat, 12 Jul 2014 00:37:08 -0700 |
Siddharth Agarwal |
revset: remove no longer used _missingancestors revset
|
Sat, 12 Jul 2014 00:31:36 -0700 |
Siddharth Agarwal |
revset: replace _missingancestors optimization with only revset
|
Mon, 14 Jul 2014 17:55:31 -0500 |
Matt Mackall |
revset: maintain ordering when subtracting from a baseset (issue4289)
|
Mon, 28 Apr 2014 15:14:11 -0700 |
Pierre-Yves David |
revset: cosmetic changes in spanset range comparison
|
Fri, 25 Apr 2014 23:38:24 -0700 |
Pierre-Yves David |
revset: drop spanset._contained
|
Thu, 01 May 2014 14:07:04 -0700 |
Pierre-Yves David |
revset: directly use __contains__ instead of a lambda
stable 3.0
|
Thu, 01 May 2014 12:15:28 -0700 |
Pierre-Yves David |
orderedlazyset: directly use __contains__ instead of a lambda
stable
|
Thu, 01 May 2014 12:15:00 -0700 |
Pierre-Yves David |
lazyset: directly use __contains__ instead of a lambda
stable
|
Sat, 26 Apr 2014 00:38:02 -0700 |
Pierre-Yves David |
spanset: directly use __contains__ instead of a lambda
stable
|
Fri, 25 Apr 2014 18:00:07 -0700 |
Pierre-Yves David |
revset: also inline spanset._contained in __len__
stable
|
Mon, 28 Apr 2014 15:15:36 -0700 |
Pierre-Yves David |
revset: inline spanset containment check (fix perf regression)
stable
|
Mon, 28 Apr 2014 16:28:52 -0700 |
Pierre-Yves David |
revset: fix revision filtering in spanset.contains (regression)
stable
|
Mon, 28 Apr 2014 15:09:23 -0700 |
Greg Hurrell |
help: clarify distinction among `contains`/`file`/`filelog`
stable
|
Tue, 22 Apr 2014 10:12:13 -0300 |
Wagner Bruna |
revset, i18n: add translator comment to "only"
stable
|
Sun, 13 Apr 2014 19:01:00 +0200 |
Mads Kiilerich |
spelling: fixes from spell checker
|
Mon, 07 Apr 2014 23:17:51 +0200 |
Mads Kiilerich |
revlog: use context ancestor instead of changelog ancestor
|
Mon, 31 Mar 2014 16:03:34 -0700 |
Durham Goode |
revset: improve roots revset performance
|
Tue, 25 Mar 2014 14:10:01 -0700 |
Durham Goode |
revset: improve _descendants performance
|
Fri, 28 Mar 2014 17:00:13 -0700 |
Pierre-Yves David |
revset: raise ValueError when calling min or max on empty smartset
|