AbstractRangeTree implements RangeTree<C> { @Override public boolean contains(final C location) { return count(location) > 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 public void testContainsEmpty() { assertFalse(create(empty).contains(0)); }
@Test public void testContainsSingletonMiss() { assertFalse(create(singleton).contains(0)); }
@Test public void testContainsSingletonHit() { assertTrue(create(singleton).contains(1)); }
@Test public void testContainsSparse() { assertTrue(create(sparse).contains(4)); }
@Test public void testContainsDense() { assertTrue(create(dense).contains(4)); }