IntervalIntersectionIterator Constructor

[CiaranOMara]

The IntervalIntersectionIterator constructor starting at line 1348 doesn't look correct.

IntervalTrees.jl/src/IntervalTrees.jl

Lines 1338 to 1351 in 2f63a6c

	mutable struct IntervalIntersectionIterator{F, K, V, B}
	filter::F
	intersection::Intersection{K, V, B}
	t::IntervalBTree{K, V, B}
	query::AbstractInterval{K}
	function IntervalIntersectionIterator{F,K,V,B}(filter, intersection, t, query) where {F,K,V,B}
	return new{F,K,V,B}(filter, intersection, t, query)
	end
	function IntervalIntersectionIterator{F,K,V,B}() where {F,K,V,B}
	return new{F,K,V,B}(Intersection{F, K, V, B}())
	end
	end

It supplies too many parameters to Intersection.

IntervalTrees.jl/src/IntervalTrees.jl

Lines 1129 to 1135 in 2f63a6c

	mutable struct Intersection{K, V, B}
	index::Int
	node::LeafNode{K, V, B}
	Intersection{K,V,B}(index, node) where {K,V,B} = new{K,V,B}(index, node)
	Intersection{K,V,B}() where {K,V,B} = new{K,V,B}(0)
	end

The following is may be the intended constructor for IntervalIntersectionIterator.

    function IntervalIntersectionIterator{F,K,V,B}() where {F,K,V,B}
         iter = new{F,K,V,B}()
         iter.intersection = Intersection{K,V,B}()
         return iter
    end

[CiaranOMara]

Inspecting the downstream use of IntervalIntersectionIterator, it requires populated fields to supply arguments to firstintersection!. I don't think this package needs to cover the case of iterating over an empty tree that is not supplied. I think the faulty constructor can be removed.