@Test public void tree_ins_2_05() { int[] keys = {0, 18, 4, 14, 8, 10, 12, 6, 16, 2}; RangeIndex rIndex = makeRangeIndex(2); testInsert(rIndex, keys); assertFalse(rIndex.contains(r(1))); assertFalse(rIndex.contains(r(999))); assertFalse(rIndex.contains(r(-9))); assertFalse(rIndex.contains(r(7))); assertEquals(0, r(rIndex.minKey())); assertEquals(18, r(rIndex.maxKey())); }