AbstractRangeTree implements RangeTree<C> { @Override public boolean isEmpty() { return size() == 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 testIsEmptyEmpty() { assertTrue(create(Collections.<Range<Integer>>emptyList()).isEmpty()); }
@Test public void testIsEmptyEmptyRange() { assertFalse(create(empty).isEmpty()); }
@Test public void testIsEmptySingleton() { assertFalse(create(singleton).isEmpty()); }
@Test public void testIsEmptySparse() { assertFalse(create(sparse).isEmpty()); }
@Test public void testIsEmptyDense() { assertFalse(create(dense).isEmpty()); }