| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 292 Comparator<? super E> cmp = comparator; in dequeue() local
293 if (cmp == null) in dequeue()
296 siftDownUsingComparator(0, x, array, n, cmp); in dequeue()
331 Comparator<? super T> cmp) { in siftUpUsingComparator() argument
335 if (cmp.compare(x, (T) e) >= 0) in siftUpUsingComparator()
376 Comparator<? super T> cmp) { in siftDownUsingComparator() argument
383 if (right < n && cmp.compare((T) c, (T) array[right]) > 0) in siftDownUsingComparator()
385 if (cmp.compare(x, (T) c) <= 0) in siftDownUsingComparator()
402 Comparator<? super E> cmp = comparator; in heapify() local
403 if (cmp == null) { in heapify()
[all …]
|
| D | SynchronousQueue.java | 215 boolean casNext(SNode cmp, SNode val) { in casNext() argument
216 return cmp == next && in casNext()
217 UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); in casNext()
517 boolean casNext(QNode cmp, QNode val) { in casNext() argument
518 return next == cmp && in casNext()
519 UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); in casNext()
522 boolean casItem(Object cmp, Object val) { in casItem() argument
523 return item == cmp && in casItem()
524 UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); in casItem()
530 void tryCancel(Object cmp) { in tryCancel() argument
[all …]
|
| D | ConcurrentLinkedQueue.java | 160 boolean casItem(E cmp, E val) { in casItem() argument
161 return UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); in casItem()
168 boolean casNext(Node<E> cmp, Node<E> val) { in casNext() argument
169 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); in casNext()
776 private boolean casTail(Node<E> cmp, Node<E> val) { in casTail() argument
777 return UNSAFE.compareAndSwapObject(this, tailOffset, cmp, val); in casTail()
780 private boolean casHead(Node<E> cmp, Node<E> val) { in casHead() argument
781 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, val); in casHead()
|
| D | LinkedTransferQueue.java | 426 final boolean casNext(Node cmp, Node val) { in casNext() argument
427 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); in casNext()
430 final boolean casItem(Object cmp, Object val) { in casItem() argument
432 return UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); in casItem()
539 private boolean casTail(Node cmp, Node val) { in casTail() argument
540 return UNSAFE.compareAndSwapObject(this, tailOffset, cmp, val); in casTail()
543 private boolean casHead(Node cmp, Node val) { in casHead() argument
544 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, val); in casHead()
547 private boolean casSweepVotes(int cmp, int val) { in casSweepVotes() argument
548 return UNSAFE.compareAndSwapInt(this, sweepVotesOffset, cmp, val); in casSweepVotes()
|
| D | ConcurrentLinkedDeque.java | 278 boolean casItem(E cmp, E val) { in casItem() argument
279 return UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val); in casItem()
286 boolean casNext(Node<E> cmp, Node<E> val) { in casNext() argument
287 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); in casNext()
294 boolean casPrev(Node<E> cmp, Node<E> val) { in casPrev() argument
295 return UNSAFE.compareAndSwapObject(this, prevOffset, cmp, val); in casPrev()
1406 private boolean casHead(Node<E> cmp, Node<E> val) { in casHead() argument
1407 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, val); in casHead()
1410 private boolean casTail(Node<E> cmp, Node<E> val) { in casTail() argument
1411 return UNSAFE.compareAndSwapObject(this, tailOffset, cmp, val); in casTail()
|
| D | ConcurrentSkipListMap.java | 352 private boolean casHead(HeadIndex<K,V> cmp, HeadIndex<K,V> val) { in casHead() argument
353 return UNSAFE.compareAndSwapObject(this, headOffset, cmp, val); in casHead()
395 boolean casValue(Object cmp, Object val) { in casValue() argument
396 return UNSAFE.compareAndSwapObject(this, valueOffset, cmp, val); in casValue()
402 boolean casNext(Node<K,V> cmp, Node<K,V> val) { in casNext() argument
403 return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val); in casNext()
528 final boolean casRight(Index<K,V> cmp, Index<K,V> val) { in casRight() argument
529 return UNSAFE.compareAndSwapObject(this, rightOffset, cmp, val); in casRight()
612 final Comparator<? super K> cmp; field in ConcurrentSkipListMap.ComparableUsingComparator
613 ComparableUsingComparator(K key, Comparator<? super K> cmp) { in ComparableUsingComparator() argument
[all …]
|
| /libcore/luni/src/main/java/java/util/concurrent/atomic/ |
| D | AtomicStampedReference.java | 168 private boolean casPair(Pair<V> cmp, Pair<V> val) { in casPair() argument
169 return UNSAFE.compareAndSwapObject(this, pairOffset, cmp, val); in casPair()
|
| D | AtomicMarkableReference.java | 168 private boolean casPair(Pair<V> cmp, Pair<V> val) { in casPair() argument
169 return UNSAFE.compareAndSwapObject(this, pairOffset, cmp, val); in casPair()
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| D | RefSortedMap.java | 253 cmp = createCmp();
355 transient private Comparator<MapEntry<K, V>> cmp = createCmp();
369 return Collections.binarySearch(entries, new MapEntry<K, V>((K) arg0, null), cmp);
393 cmp = createCmp();
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | PriorityQueueTest.java | 111 MyReverseComparator cmp = new MyReverseComparator(); in testConstructor7() local
112 PriorityQueue q = new PriorityQueue(SIZE, cmp); in testConstructor7()
113 assertEquals(cmp, q.comparator()); in testConstructor7()
|
| D | PriorityBlockingQueueTest.java | 123 MyReverseComparator cmp = new MyReverseComparator(); in testConstructor7() local
124 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp); in testConstructor7()
125 assertEquals(cmp, q.comparator()); in testConstructor7()
|
| D | TreeSetTest.java | 123 MyReverseComparator cmp = new MyReverseComparator(); in testConstructor7() local
124 TreeSet q = new TreeSet(cmp); in testConstructor7()
125 assertEquals(cmp, q.comparator()); in testConstructor7()
|
| D | ConcurrentSkipListSetTest.java | 119 MyReverseComparator cmp = new MyReverseComparator(); in testConstructor7() local
120 ConcurrentSkipListSet q = new ConcurrentSkipListSet(cmp); in testConstructor7()
121 assertEquals(cmp, q.comparator()); in testConstructor7()
|
| /libcore/luni/src/main/java/java/math/ |
| D | BigInt.java | 62 static int cmp(BigInt a, BigInt b) { in cmp() method in BigInt
|
| D | BigInteger.java | 803 return BigInt.cmp(getBigInt(), value.getBigInt()); in compareTo()
|
| /libcore/luni/src/main/java/java/util/ |
| D | Collections.java | 203 private final Comparator<T> cmp; field in Collections.ReverseComparator2
206 this.cmp = comparator; in ReverseComparator2()
210 return cmp.compare(o2, o1); in compare()
215 && ((ReverseComparator2) o).cmp.equals(cmp); in equals()
219 return ~cmp.hashCode(); in hashCode()
1760 return ((ReverseComparator2<T>) c).cmp;
|
| /libcore/benchmarks/libs/ |
| D | caliper.jar | META-INF/
META-INF/MANIFEST.MF
com/
com/google/
com/ ... |