/libcore/ojluni/src/main/java/java/net/ |
H A D | InterfaceAddress.java | 105 InterfaceAddress cmp = (InterfaceAddress) obj; 106 if ( !(address == null ? cmp.address == null : address.equals(cmp.address)) ) 108 if ( !(broadcast == null ? cmp.broadcast == null : broadcast.equals(cmp.broadcast)) ) 110 if (maskLength != cmp.maskLength)
|
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 374 private boolean casHead(HeadIndex<K,V> cmp, HeadIndex<K,V> val) { argument 375 return U.compareAndSwapObject(this, HEAD, cmp, val); 417 boolean casValue(Object cmp, Object val) { argument 418 return U.compareAndSwapObject(this, VALUE, cmp, val); 424 boolean casNext(Node<K,V> cmp, Node<K,V> val) { argument 425 return U.compareAndSwapObject(this, NEXT, cmp, val); 550 final boolean casRight(Index<K,V> cmp, Index<K,V> val) { argument 551 return U.compareAndSwapObject(this, RIGHT, cmp, val); 634 private Node<K,V> findPredecessor(Object key, Comparator<? super K> cmp) { argument 648 if (cpr(cmp, ke 1196 findNear(K key, int rel, Comparator<? super K> cmp) argument 2580 tooLow(Object key, Comparator<? super K> cmp) argument 2586 tooHigh(Object key, Comparator<? super K> cmp) argument 2592 inBounds(Object key, Comparator<? super K> cmp) argument 2596 checkKeyBounds(K key, Comparator<? super K> cmp) argument 2606 isBeforeEnd(ConcurrentSkipListMap.Node<K,V> n, Comparator<? super K> cmp) argument 2625 loNode(Comparator<? super K> cmp) argument 2638 hiNode(Comparator<? super K> cmp) argument [all...] |
H A D | PriorityBlockingQueue.java | 301 Comparator<? super E> cmp = comparator; 302 if (cmp == null) 305 siftDownUsingComparator(0, x, array, n, cmp); 340 Comparator<? super T> cmp) { 344 if (cmp.compare(x, (T) e) >= 0) 385 Comparator<? super T> cmp) { 392 if (right < n && cmp.compare((T) c, (T) array[right]) > 0) 394 if (cmp.compare(x, (T) c) <= 0) 411 Comparator<? super E> cmp = comparator; 412 if (cmp 339 siftUpUsingComparator(int k, T x, Object[] array, Comparator<? super T> cmp) argument 383 siftDownUsingComparator(int k, T x, Object[] array, int n, Comparator<? super T> cmp) argument [all...] |
H A D | SynchronousQueue.java | 219 boolean casNext(SNode cmp, SNode val) { argument 220 return cmp == next && 221 U.compareAndSwapObject(this, NEXT, cmp, val); 518 boolean casNext(QNode cmp, QNode val) { argument 519 return next == cmp && 520 U.compareAndSwapObject(this, NEXT, cmp, val); 523 boolean casItem(Object cmp, Object val) { argument 524 return item == cmp && 525 U.compareAndSwapObject(this, ITEM, cmp, val); 531 void tryCancel(Object cmp) { argument 603 casCleanMe(QNode cmp, QNode val) argument [all...] |
H A D | ConcurrentLinkedQueue.java | 167 static <E> boolean casItem(Node<E> node, E cmp, E val) { argument 168 return U.compareAndSwapObject(node, ITEM, cmp, val); 175 static <E> boolean casNext(Node<E> node, Node<E> cmp, Node<E> val) { argument 176 return U.compareAndSwapObject(node, NEXT, cmp, val); 893 private boolean casTail(Node<E> cmp, Node<E> val) { argument 894 return U.compareAndSwapObject(this, TAIL, cmp, val); 897 private boolean casHead(Node<E> cmp, Node<E> val) { argument 898 return U.compareAndSwapObject(this, HEAD, cmp, val);
|
H A D | ConcurrentLinkedDeque.java | 278 boolean casItem(E cmp, E val) { argument 279 return U.compareAndSwapObject(this, ITEM, cmp, val); 286 boolean casNext(Node<E> cmp, Node<E> val) { argument 287 return U.compareAndSwapObject(this, NEXT, cmp, val); 294 boolean casPrev(Node<E> cmp, Node<E> val) { argument 295 return U.compareAndSwapObject(this, PREV, cmp, val); 1572 private boolean casHead(Node<E> cmp, Node<E> val) { argument 1573 return U.compareAndSwapObject(this, HEAD, cmp, val); 1576 private boolean casTail(Node<E> cmp, Node<E> val) { argument 1577 return U.compareAndSwapObject(this, TAIL, cmp, va [all...] |
H A D | LinkedTransferQueue.java | 429 final boolean casNext(Node cmp, Node val) { argument 430 return U.compareAndSwapObject(this, NEXT, cmp, val); 433 final boolean casItem(Object cmp, Object val) { argument 434 // assert cmp == null || cmp.getClass() != Node.class; 435 return U.compareAndSwapObject(this, ITEM, cmp, val); 540 private boolean casTail(Node cmp, Node val) { argument 541 return U.compareAndSwapObject(this, TAIL, cmp, val); 544 private boolean casHead(Node cmp, Node val) { argument 545 return U.compareAndSwapObject(this, HEAD, cmp, va 548 casSweepVotes(int cmp, int val) argument [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | Map.java | 503 * @param cmp the key {@link Comparator} 507 public static <K, V> Comparator<Map.Entry<K, V>> comparingByKey(Comparator<? super K> cmp) { argument 508 Objects.requireNonNull(cmp); 510 (c1, c2) -> cmp.compare(c1.getKey(), c2.getKey()); 522 * @param cmp the value {@link Comparator} 526 public static <K, V> Comparator<Map.Entry<K, V>> comparingByValue(Comparator<? super V> cmp) { argument 527 Objects.requireNonNull(cmp); 529 (c1, c2) -> cmp.compare(c1.getValue(), c2.getValue());
|
H A D | TreeMap.java | 353 int cmp = k.compareTo(p.key); 354 if (cmp < 0) 356 else if (cmp > 0) 377 int cmp = cpr.compare(k, p.key); 378 if (cmp < 0) 380 else if (cmp > 0) 398 int cmp = compare(key, p.key); 399 if (cmp < 0) { 404 } else if (cmp > 0) { 430 int cmp [all...] |
H A D | Collections.java | 299 int cmp = midVal.compareTo(key); 301 if (cmp < 0) 303 else if (cmp > 0) 321 int cmp = midVal.compareTo(key); 323 if (cmp < 0) 325 else if (cmp > 0) 405 int cmp = c.compare(midVal, key); 407 if (cmp < 0) 409 else if (cmp > 0) 425 int cmp 4344 reverseOrder(Comparator<T> cmp) argument 4369 final Comparator<T> cmp; field in class:Collections.ReverseComparator2 4371 ReverseComparator2(Comparator<T> cmp) argument [all...] |
H A D | Arrays.java | 1078 * @param cmp the comparator to determine the order of the array. A 1089 public static <T> void parallelSort(T[] a, Comparator<? super T> cmp) { argument 1090 if (cmp == null) 1091 cmp = NaturalOrder.INSTANCE; 1095 TimSort.sort(a, 0, n, cmp, null, 0, 0); 1101 MIN_ARRAY_SORT_GRAN : g, cmp).invoke(); 1133 * @param cmp the comparator to determine the order of the array. A 1149 Comparator<? super T> cmp) { 1151 if (cmp == null) 1152 cmp 1148 parallelSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp) argument [all...] |
/libcore/ojluni/src/main/java/java/nio/ |
H A D | DoubleBuffer.java | 692 int cmp = Double.compare(this.get(i), that.get(j)); 693 if (cmp != 0) 694 return cmp;
|
H A D | FloatBuffer.java | 691 int cmp = compare(this.get(i), that.get(j)); 692 if (cmp != 0) 693 return cmp;
|
H A D | IntBuffer.java | 693 int cmp = compare(this.get(i), that.get(j)); 694 if (cmp != 0) 695 return cmp;
|
H A D | LongBuffer.java | 691 int cmp = compare(this.get(i), that.get(j)); 692 if (cmp != 0) 693 return cmp;
|
H A D | ShortBuffer.java | 692 int cmp = compare(this.get(i), that.get(j)); 693 if (cmp != 0) 694 return cmp;
|
H A D | CharBuffer.java | 874 int cmp = compare(this.get(i), that.get(j)); 875 if (cmp != 0) 876 return cmp;
|
H A D | ByteBuffer.java | 874 int cmp = compare(this.get(i), that.get(j)); 875 if (cmp != 0) 876 return cmp;
|
/libcore/luni/src/main/java/java/util/concurrent/atomic/ |
H A D | AtomicMarkableReference.java | 175 private boolean casPair(Pair<V> cmp, Pair<V> val) { argument 176 return U.compareAndSwapObject(this, PAIR, cmp, val);
|
H A D | AtomicStampedReference.java | 175 private boolean casPair(Pair<V> cmp, Pair<V> val) { argument 176 return U.compareAndSwapObject(this, PAIR, cmp, val);
|
H A D | Striped64.java | 97 final boolean cas(long cmp, long val) { argument 98 return U.compareAndSwapLong(this, VALUE, cmp, val); 148 final boolean casBase(long cmp, long val) { argument 149 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/sun/misc/ |
H A D | FormattedFloatingDecimal.java | 911 low = (Bval.cmp( Mval ) < 0); 912 high = (Bval.add( Mval ).cmp( tenSval ) > 0 ); 933 low = (Bval.cmp( Mval ) < 0); 934 high = (Bval.add( Mval ).cmp( tenSval ) > 0 ); 939 lowDigitDifference = Bval.cmp(tenSval); 1451 if ( (cmpResult = bigB.cmp( bigD ) ) > 0 ){ 1476 if ( (cmpResult = diff.cmp( halfUlp ) ) < 0 ){
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | PriorityQueueTest.java | 121 MyReverseComparator cmp = new MyReverseComparator(); 122 PriorityQueue q = new PriorityQueue(SIZE, cmp); 123 assertEquals(cmp, q.comparator());
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | FloatingDecimal.java | 844 low = (Bval.cmp( Mval ) < 0); 845 high = (Bval.add( Mval ).cmp( tenSval ) > 0 ); 866 low = (Bval.cmp( Mval ) < 0); 867 high = (Bval.add( Mval ).cmp( tenSval ) > 0 ); 872 lowDigitDifference = Bval.cmp(tenSval); 1610 if ( (cmpResult = bigB.cmp( bigD ) ) > 0 ){ 1635 if ( (cmpResult = diff.cmp( halfUlp ) ) < 0 ){
|