/** * Finds very first index of given element or negative value if element is not found. */ public int findFirst(E o) { return findFirst(o, 0, getLastIndex()); }
/** * Finds very first index of given element or negative value if element is not found. */ public int findFirst(final E o) { return findFirst(o, 0, getLastIndex()); }
@Test void testFindFirst() { assertEquals(0, listBinarySearch.findFirst("aaa")); assertEquals(1, listBinarySearch.findFirst("bbb")); assertEquals(2, listBinarySearch.findFirst("ccc")); assertEquals(6, listBinarySearch.findFirst("eee")); assertEquals(9, listBinarySearch.findFirst("sss")); assertEquals(6, listBinarySearch.findFirst("eee", 4, 6)); assertTrue(listBinarySearch.findFirst("aaaaa") < 0); assertTrue(listBinarySearch.findFirst("aa") < 0); assertTrue(listBinarySearch.findFirst("aaa", 1, 4) < 0); assertTrue(listBinarySearch.findFirst("eee", 4, 5) < 0); assertEquals(3, listBinarySearch.findFirst("ddd")); assertEquals(7, listBinarySearch.findFirst("iii")); }
@Test void testFindRange() { assertEquals(3, listBinarySearch.findFirst("ddd")); assertEquals(5, listBinarySearch.findLast("ddd", 3, 9)); assertEquals(7, listBinarySearch.findFirst("iii")); assertEquals(8, listBinarySearch.findLast("iii", 7, 9)); assertEquals(2, listBinarySearch.findFirst("ccc")); assertEquals(2, listBinarySearch.findLast("ccc", 2, 9)); } }
/** * Finds very first index of given element or negative value if element is not found. */ public int findFirst(final E o) { return findFirst(o, 0, getLastIndex()); }
/** * Finds very first index of given element or negative value if element is not found. */ public int findFirst(E o) { return findFirst(o, 0, getLastIndex()); }