AbstractRangeTree implements RangeTree<C> { @Override public boolean intersects(final Range<C> query) { return count(query) > 0; }  @Override boolean isEmpty(); @Override boolean contains(final C location); @Override int count(final C location); @Override Iterable<Range<C>> query(final C location); @Override int count(final Range<C> query); @Override boolean intersects(final Range<C> query); @Override Iterable<Set<Range<C>>> intersect(final Iterable<Range<C>> query); @Override boolean intersects(final Iterable<Range<C>> query);  }
@Test(expected=NullPointerException.class) public void testIntersectsNullRange() { create(sparse).intersects((Range<Integer>) null); }
@Test(expected=NullPointerException.class) public void testIntersectsNullRanges() { create(sparse).intersects((Iterable<Range<Integer>>) null); }