v1.1.0

IntervalTrees v1.1.0

Diff since v1.0.0

Closed issues:

• Package should belong to JuliaCollections (#48)
• IntervalIntersectionIterator Constructor (#54)

Merged pull requests:

• modernize inbounds style (#44) (@bicycle1885)
• run CI on Julia 1.0 as well (#45) (@bicycle1885)
• feature/ci (#52) (@CiaranOMara)
• Use first and last accessors for downstream flexibility (#53) (@CiaranOMara)
• Add Pkg to documentation’s package requirements (#57) (@CiaranOMara)
• Remove erroneous constructor (#58) (@CiaranOMara)
• Release v1.1.0 (#59) (@CiaranOMara)

The Julia v0.7 / v1.0 Release

This release marks the first release of IntervalTrees for julia v0.7 / v1.0. the API for IntervalTrees has been stable for a long time, and with julia 1.0, so is this release for IntervalTrees, a v1.0.0 release.

IntervalTrees.jl 0.4.1

Fixes a critical bug where intersecting two trees with intersect(t1, t2) can miss intersections. #34

IntervalTrees.jl 0.4

• Fix a couple bugs in findfirst. #29
• More precise issorted check. #30
• Drop julia 0.5 support #31
• Fix README.md #33

IntervalTrees.jl 0.3

• Add optional filter predicates to intersect, and a findfirst function (#28).

Performance improvement

• Performance optimization (#25).
• Fix constructor syntax (#26).

Support Julia 0.6

• Drop Julia 0.4 support.
• Fix some deprecated syntaxes on Julia 0.6.
• Fix some iterator traits.

Minor refactor and optimisation release

Adds a convert method for Intervals from Range objects.
Includes optimisations to intersect.
Removal of Compat dependency.
Some minor code refactoring.