Searched defs:pred (Results 1 – 12 of 12) sorted by relevance
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/lang/invoke/ |
D | SerializedLambdaTest.java | 102 Predicate<String> pred = (Predicate<String> & Serializable) s -> true; in testSimpleSerializedInstantiation() local 128 Predicate<String> pred = (Predicate<String>) s -> true; in testNonserializableInstantiation() local 145 Predicate<String> pred = new Moo().foo(3); in testSerializeCapturingInt() local 160 Predicate<String> pred = new Moo().foo("goo"); in testSerializeCapturingString() local 180 Predicate<String> pred = new Moo().foo(new Box("goo")); in testSerializeCapturingNonSerializable() local
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | LinkedTransferQueue.java | 636 Node pred = tryAppend(s, haveData); in xfer() local 693 private E awaitMatch(Node s, Node pred, E e, boolean timed, long nanos) { in awaitMatch() 739 private static int spinsFor(Node pred, boolean haveData) { in spinsFor() 1135 final void unsplice(Node pred, Node s) { in unsplice()
|
D | ConcurrentLinkedQueue.java | 477 Node<E> next, pred = null; in remove() local 732 final Node<E> pred = nextNode; in next() local
|
D | ForkJoinTask.java | 527 ExceptionNode pred = null; in clearExceptionalCompletion() local 610 ExceptionNode pred = null; in expungeStaleExceptions() local
|
D | ArrayBlockingQueue.java | 201 int pred = i; in removeAt() local
|
D | SynchronousQueue.java | 769 void clean(QNode pred, QNode s) { in clean()
|
D | ConcurrentLinkedDeque.java | 731 final Node<E> pred(Node<E> p) { in pred() method in ConcurrentLinkedDeque
|
D | ConcurrentHashMap.java | 1049 Node<K,V> pred = e; in putVal() local 1742 Node<K,V> pred = e; in computeIfAbsent() local 3000 TreeNode<K,V> pred = p.prev; // unlink traversal pointers in removeTreeNode() local
|
/libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
D | AbstractQueuedLongSynchronizer.java | 316 Node pred = node.prev; in cancelAcquire() local 361 private static boolean shouldParkAfterFailedAcquire(Node pred, Node node) { in shouldParkAfterFailedAcquire()
|
D | AbstractQueuedSynchronizer.java | 782 Node pred = node.prev; in cancelAcquire() local 827 private static boolean shouldParkAfterFailedAcquire(Node pred, Node node) { in shouldParkAfterFailedAcquire()
|
/libcore/ojluni/src/main/java/java/util/ |
D | LinkedList.java | 157 final Node<E> pred = succ.prev; in linkBefore() local
|
D | HashMap.java | 2034 TreeNode<K,V> succ = (TreeNode<K,V>)next, pred = prev; in removeTreeNode() local
|