/libcore/ojluni/src/test/java/nio/file/attribute/ |
H A D | FileTimeTest.java | 67 cmp(now, MILLISECONDS, now, MILLISECONDS, 0); 68 cmp(now, MILLISECONDS, now*1000L, MICROSECONDS, 0); 69 cmp(now, MILLISECONDS, now-1234, MILLISECONDS, 1); 70 cmp(now, MILLISECONDS, now+1234, MILLISECONDS, -1); 72 cmp(tomorrowInDays, DAYS, now, MILLISECONDS, 1); 73 cmp(now, MILLISECONDS, tomorrowInDays, DAYS, -1); 74 cmp(yesterdayInDays, DAYS, now, MILLISECONDS, -1); 75 cmp(now, MILLISECONDS, yesterdayInDays, DAYS, 1); 76 cmp(yesterdayInDays, DAYS, now, MILLISECONDS, -1); 78 cmp(Lon 265 static void cmp(long v1, TimeUnit u1, long v2, TimeUnit u2, int expected) { method in class:FileTimeTest 271 static void cmp(Instant ins, long v2, TimeUnit u2, int expected) { method in class:FileTimeTest [all...] |
/libcore/ojluni/src/main/java/java/util/concurrent/atomic/ |
H A D | AtomicMarkableReference.java | 204 private boolean casPair(Pair<V> cmp, Pair<V> val) { argument 205 return U.compareAndSwapObject(this, PAIR, cmp, val);
|
H A D | AtomicStampedReference.java | 204 private boolean casPair(Pair<V> cmp, Pair<V> val) { argument 205 return U.compareAndSwapObject(this, PAIR, cmp, val);
|
H A D | Striped64.java | 126 final boolean cas(long cmp, long val) { argument 127 return U.compareAndSwapLong(this, VALUE, cmp, val); 177 final boolean casBase(long cmp, long val) { argument 178 return U.compareAndSwapLong(this, BASE, cmp, val);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | RefSortedMap.java | 253 cmp = createCmp(); 355 transient private Comparator<MapEntry<K, V>> cmp = createCmp(); field in class:RefSortedMap 369 return Collections.binarySearch(entries, new MapEntry<K, V>((K) arg0, null), cmp); 393 cmp = createCmp();
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | Map.java | 501 * @param cmp the key {@link Comparator} 505 public static <K, V> Comparator<Map.Entry<K, V>> comparingByKey(Comparator<? super K> cmp) { argument 506 Objects.requireNonNull(cmp); 508 (c1, c2) -> cmp.compare(c1.getKey(), c2.getKey()); 520 * @param cmp the value {@link Comparator} 524 public static <K, V> Comparator<Map.Entry<K, V>> comparingByValue(Comparator<? super V> cmp) { argument 525 Objects.requireNonNull(cmp); 527 (c1, c2) -> cmp.compare(c1.getValue(), c2.getValue());
|
H A D | Arrays.java | 1113 * @param cmp the comparator to determine the order of the array. A 1124 public static <T> void parallelSort(T[] a, Comparator<? super T> cmp) { argument 1125 if (cmp == null) 1126 cmp = NaturalOrder.INSTANCE; 1130 TimSort.sort(a, 0, n, cmp, null, 0, 0); 1136 MIN_ARRAY_SORT_GRAN : g, cmp).invoke(); 1168 * @param cmp the comparator to determine the order of the array. A 1184 Comparator<? super T> cmp) { 1186 if (cmp == null) 1187 cmp 1183 parallelSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp) argument [all...] |
H A D | Collections.java | 268 int cmp = midVal.compareTo(key); 270 if (cmp < 0) 272 else if (cmp > 0) 290 int cmp = midVal.compareTo(key); 292 if (cmp < 0) 294 else if (cmp > 0) 374 int cmp = c.compare(midVal, key); 376 if (cmp < 0) 378 else if (cmp > 0) 394 int cmp 5193 reverseOrder(Comparator<T> cmp) argument 5218 final Comparator<T> cmp; field in class:Collections.ReverseComparator2 5220 ReverseComparator2(Comparator<T> cmp) argument [all...] |
/libcore/luni/src/main/java/java/math/ |
H A D | BigInt.java | 60 static int cmp(BigInt a, BigInt b) { method in class:BigInt
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentLinkedQueue.java | 196 static <E> boolean casItem(Node<E> node, E cmp, E val) { argument 197 return U.compareAndSwapObject(node, ITEM, cmp, val); 204 static <E> boolean casNext(Node<E> node, Node<E> cmp, Node<E> val) { argument 205 return U.compareAndSwapObject(node, NEXT, cmp, val); 922 private boolean casTail(Node<E> cmp, Node<E> val) { argument 923 return U.compareAndSwapObject(this, TAIL, cmp, val); 926 private boolean casHead(Node<E> cmp, Node<E> val) { argument 927 return U.compareAndSwapObject(this, HEAD, cmp, val);
|
H A D | PriorityBlockingQueue.java | 330 Comparator<? super E> cmp = comparator; 331 if (cmp == null) 334 siftDownUsingComparator(0, x, array, n, cmp); 369 Comparator<? super T> cmp) { 373 if (cmp.compare(x, (T) e) >= 0) 414 Comparator<? super T> cmp) { 421 if (right < n && cmp.compare((T) c, (T) array[right]) > 0) 423 if (cmp.compare(x, (T) c) <= 0) 440 Comparator<? super E> cmp = comparator; 441 if (cmp 368 siftUpUsingComparator(int k, T x, Object[] array, Comparator<? super T> cmp) argument 412 siftDownUsingComparator(int k, T x, Object[] array, int n, Comparator<? super T> cmp) argument [all...] |
H A D | ConcurrentLinkedDeque.java | 307 boolean casItem(E cmp, E val) { argument 308 return U.compareAndSwapObject(this, ITEM, cmp, val); 315 boolean casNext(Node<E> cmp, Node<E> val) { argument 316 return U.compareAndSwapObject(this, NEXT, cmp, val); 323 boolean casPrev(Node<E> cmp, Node<E> val) { argument 324 return U.compareAndSwapObject(this, PREV, cmp, val); 1601 private boolean casHead(Node<E> cmp, Node<E> val) { argument 1602 return U.compareAndSwapObject(this, HEAD, cmp, val); 1605 private boolean casTail(Node<E> cmp, Node<E> val) { argument 1606 return U.compareAndSwapObject(this, TAIL, cmp, va [all...] |
H A D | LinkedTransferQueue.java | 458 final boolean casNext(Node cmp, Node val) { argument 459 return U.compareAndSwapObject(this, NEXT, cmp, val); 462 final boolean casItem(Object cmp, Object val) { argument 463 // assert cmp == null || cmp.getClass() != Node.class; 464 return U.compareAndSwapObject(this, ITEM, cmp, val); 569 private boolean casTail(Node cmp, Node val) { argument 570 return U.compareAndSwapObject(this, TAIL, cmp, val); 573 private boolean casHead(Node cmp, Node val) { argument 574 return U.compareAndSwapObject(this, HEAD, cmp, va 577 casSweepVotes(int cmp, int val) argument [all...] |
H A D | SynchronousQueue.java | 248 boolean casNext(SNode cmp, SNode val) { argument 249 return cmp == next && 250 U.compareAndSwapObject(this, NEXT, cmp, val); 547 boolean casNext(QNode cmp, QNode val) { argument 548 return next == cmp && 549 U.compareAndSwapObject(this, NEXT, cmp, val); 552 boolean casItem(Object cmp, Object val) { argument 553 return item == cmp && 554 U.compareAndSwapObject(this, ITEM, cmp, val); 560 void tryCancel(Object cmp) { argument 632 casCleanMe(QNode cmp, QNode val) argument [all...] |
H A D | CompletableFuture.java | 227 final boolean casStack(Completion cmp, Completion val) { argument 228 return U.compareAndSwapObject(this, STACK, cmp, val);
|
H A D | ConcurrentSkipListMap.java | 403 private boolean casHead(HeadIndex<K,V> cmp, HeadIndex<K,V> val) { argument 404 return U.compareAndSwapObject(this, HEAD, cmp, val); 446 boolean casValue(Object cmp, Object val) { argument 447 return U.compareAndSwapObject(this, VALUE, cmp, val); 453 boolean casNext(Node<K,V> cmp, Node<K,V> val) { argument 454 return U.compareAndSwapObject(this, NEXT, cmp, val); 579 final boolean casRight(Index<K,V> cmp, Index<K,V> val) { argument 580 return U.compareAndSwapObject(this, RIGHT, cmp, val); 663 private Node<K,V> findPredecessor(Object key, Comparator<? super K> cmp) { argument 677 if (cpr(cmp, ke 1225 findNear(K key, int rel, Comparator<? super K> cmp) argument 2609 tooLow(Object key, Comparator<? super K> cmp) argument 2615 tooHigh(Object key, Comparator<? super K> cmp) argument 2621 inBounds(Object key, Comparator<? super K> cmp) argument 2625 checkKeyBounds(K key, Comparator<? super K> cmp) argument 2635 isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n, Comparator<? super K> cmp) argument 2654 loNode(Comparator<? super K> cmp) argument 2667 hiNode(Comparator<? super K> cmp) argument [all...] |
/libcore/ojluni/src/main/java/sun/misc/ |
H A D | FDBigInteger.java | 947 public /*@ pure @*/ int cmp(FDBigInteger other) { method in class:FDBigInteger 1008 return this.cmp(big5pow(p5).leftShift(p2)); 1049 return this.cmp(big); 1090 return this.cmp(big.add(small));
|