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__
|