Searched defs:search (Results 1 - 3 of 3) sorted by relevance
/libcore/ojluni/src/main/java/java/util/ |
H A D | Stack.java | 34 * for whether the stack is <tt>empty</tt>, and a method to <tt>search</tt> 130 public synchronized int search(Object o) { method in class:Stack
|
/libcore/ojluni/src/main/java/java/awt/font/ |
H A D | NumericShaper.java | 400 * If more than BSEARCH_THRESHOLD ranges are specified, binary search is used. 520 // some ranges adjoin or overlap, rethink if we want to do a binary search on this 889 // use a binary search with a cache 896 cachedIndex = search(c, strongTable, 0, cachedIndex); 898 cachedIndex = search(c, strongTable, cachedIndex + 1, 1060 // sort rangeArray for binary search 1461 * fast binary search over subrange of array. 1463 private static int search(int value, int[] array, int start, int length) method in class:NumericShaper
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentHashMap.java | 144 * <li>search: Returns the first available non-null result of 146 * search when a result is found. 204 * there is nothing there now" rule before using them in search or 259 * hashes, and are readily distinguishable during search etc 330 * specialized form of red-black trees), bounding search time to 331 * O(log N). Each search step in a TreeBin is at least twice as 333 * (1<<64) (before running out of addresses) this bounds search 413 * TreeBins use a special form of comparison for search and 423 * hash values. (This corresponds to the full list search that 2098 * @param value a value to search fo 3730 public <U> U search(long parallelismThreshold, method in class:ConcurrentHashMap [all...] |
Completed in 150 milliseconds