Add hasintersection methods

src/GenomicFeatures.jl

@@ -20,6 +20,7 @@ export
     IntervalCollection,
     eachoverlap,
     coverage,
+	hasintersection,
 
     isfilled,
     hasseqname,

src/intervalcollection.jl

@@ -503,3 +503,32 @@ function Base.iterate(it::IntervalCollectionStreamIterator{F,S,T}, state = ()) w
         end
     end
 end
+
+"""
+    hasintersection(interval::Interval, col::IntervalCollection)::Bool
+
+Query whether an `interval` has an intersection with `col`.
+"""
+function hasintersection(interval::Interval, col::IntervalCollection)
+
+	# Return early if chromosome is not in the interval collection.
+	if !haskey(col.trees, seqname(interval))
+		return false
+	end
+
+	# Setup intersection iterator.
+	iter = IntervalTrees.intersect(col.trees[seqname(interval)], (leftposition(interval), rightposition(interval)))
+
+	# Attempt first iteration.
+	if iterate(iter) === nothing
+		return false
+	end
+
+	# Intersection exists.
+	return true
+
+end
+
+function hasintersection(col::IntervalCollection)
+	return interval -> hasintersection(interval, col)
+end

test/runtests.jl

@@ -219,6 +219,14 @@ end
               sort(simple_intersection(intervals_a, intervals_b))
         @test sort(collect(eachoverlap(ic_a, ic_b, filter=(a,b) -> isodd(first(a))))) ==
               sort(simple_intersection(intervals_a, intervals_b, filter=(a,b) -> isodd(first(a))))
+
+        # Check hasintersection method.
+        @test hasintersection(Interval("test", 1, 1), IntervalCollection([Interval("test", 1,2)])) == true
+        @test hasintersection(Interval("test", 1, 1), IntervalCollection([Interval("test", 2,2)])) == false
+
+        # Check hasintersection currying.
+        @test Interval("test", 1, 1) |> hasintersection(IntervalCollection([Interval("test", 1,2)])) == true
+        @test Interval("test", 1, 1) |> hasintersection(IntervalCollection([Interval("test", 2,2)])) == false
     end
 
     @testset "Show" begin