BioJulia / IntervalTrees.jl

A data structure for efficient manipulation of sets of intervals
MIT License
44 stars 17 forks source link

Add optional filter predicates to intersect, and a findfirst function #28

Closed dcjones closed 7 years ago

dcjones commented 7 years ago

See https://github.com/BioJulia/Bio.jl/issues/471 for discussion.

Let's intersection iterators be arbitrarily filtered, e.g. intersect(t1, t2, (a,b) -> a.value == b.value).

codecov-io commented 7 years ago

Codecov Report

Merging #28 into master will increase coverage by 1.54%. The diff coverage is 92.1%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master      #28      +/-   ##
==========================================
+ Coverage   91.61%   93.15%   +1.54%     
==========================================
  Files           3        3              
  Lines         775      789      +14     
==========================================
+ Hits          710      735      +25     
+ Misses         65       54      -11
Impacted Files Coverage Δ
src/IntervalTrees.jl 94.5% <92.1%> (+1.78%) :arrow_up:

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update 3a668a1...d9fa790. Read the comment docs.

TransGirlCodes commented 7 years ago

LGTM! :+1: