Tags from intervaltree

3.1.0

2020-08-03T08:03:52Z

Merge pull request #101 from chaimleib/v3.1.0

V3.1.0

3.0.2

2018-12-18T03:30:50Z

3.0.1

2018-12-17T20:57:29Z

Merge pull request #78 from chaimleib/dev

Dev -> master (3.0.1)

3.0.0

2018-12-17T15:10:14Z

Merge pull request #76 from chaimleib/dev

Dev -> master (3.0.0)

2.1.0: - Added:

2015-05-11T00:52:26Z

- Added:

- `merge_overlaps()` method and tests
- `merge_equals()` method and tests
- `range()` method
- `span()` method, for returning the difference between `end()` and `begin()`
- Fixes:
- Development version numbering is changing to be compliant with PEP440. Version numbering now contains major, minor and micro release numbers, plus the number of builds following the stable release version, e.g. 2.0.4b34
- Speed improvement: `begin()` and `end()` methods used iterative `min()` and `max()` builtins instead of the more efficient `iloc` member available to `SortedDict`
- `overlaps()` method used to return `True` even if provided null test interval
- Maintainers:
- Added coverage test (`make coverage`) with html report (`htmlcov/index.html`)
- Tests run slightly faster

2.0.4

2015-01-21T18:35:07Z

- Fix: Issue #27: README incorrectly showed using a comma instead of …

…a colon when querying the `IntervalTree`: it showed `tree[begin, end]` instead of `tree[begin:end]`

2.0.3

2015-01-20T00:43:57Z

- Fix: README showed using + operator for setlike union instead of th…

…e correct | operator

- Removed tests from release package to speed up installation; to get the tests, download from GitHub

2.0.2

2015-01-02T14:06:45Z

- Fix: Issue #20: performance enhancement for large trees. `IntervalT…

…ree.search()` made a copy of the entire `boundary_table` resulting in linear search time. The `sortedcollections` package is now the sole install dependency

2.0.1

2015-01-01T06:52:48Z

- Fix: Issue #26: failed to prune empty `Node` after a rotation promo…

…ted contents of `s_center`

2.0.0

2014-12-31T12:31:32Z

- `IntervalTree` now supports the full and `MutableSet` APIs from the…

… `collections` module

- Added:
- `__delitem__` to `IntervalTree`
- comparison methods `lt()`, `gt()`, `le()` and `ge()` to `Interval`, as an alternative to the comparison operators, which are designed for sorting
- `IntervalTree.from_tuples(iterable)`
- `IntervalTree.clear()`
- `IntervalTree.difference(iterable)`
- `IntervalTree.difference_update(iterable)`
- `IntervalTree.union(iterable)`
- `IntervalTree.intersection(iterable)`
- `IntervalTree.intersection_update(iterable)`
- `IntervalTree.symmetric_difference(iterable)`
- `IntervalTree.symmetric_difference_update(iterable)`
- `IntervalTree.chop(a, b)`
- `IntervalTree.slice(point)`
- Deprecated `IntervalTree.extend()` -- use `update()` instead
- Internal improvements:
- More verbose tests with progress bars
- More tests for comparison and sorting behavior
- Code in the README is included in the unit tests
- Fixes
- BACKWARD INCOMPATIBLE: On ranged queries where begin >= end, the query operated on the overlaps of begin. This behavior was documented as expected in 1.x; it is now changed to be more consistent with the definition of `Interval`s, which are half-open.
- Issue #25: pruning empty Nodes with staggered descendants could result in invalid trees
- Sorting `Interval`s and numbers in the same list gathered all the numbers at the beginning and the `Interval`s at the end
- `IntervalTree.overlaps()` and friends returned `None` instead of `False`
- Maintainers: `make install-testpypi` failed because the `pip` was missing a `--pre` flag