| /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 | 590 private boolean tryCasSuccessor(Node pred, Node c, Node p) { in tryCasSuccessor()
611 private Node skipDeadNodes(Node pred, Node c, Node p, Node q) { in skipDeadNodes()
703 private E awaitMatch(Node s, Node pred, E e, boolean timed, long nanos) { in awaitMatch()
752 private static int spinsFor(Node pred, boolean haveData) { in spinsFor()
953 private void advance(Node pred) { in advance()
1173 final void unsplice(Node pred, Node s) { in unsplice()
|
| D | SubmissionPublisher.java | 467 BufferedSubscription<T> pred = null, next; in cleanAndCount() local
746 BufferedSubscription<T> pred = null, next; in getSubscribers() local
776 BufferedSubscription<T> pred = null, next; in isSubscribed() local
807 BufferedSubscription<T> pred = null, next; in estimateMinimumDemand() local
838 BufferedSubscription<T> pred = null, next; in estimateMaximumLag() local
|
| D | ConcurrentLinkedQueue.java | 311 private boolean tryCasSuccessor(Node<E> pred, Node<E> c, Node<E> p) { in tryCasSuccessor()
332 private Node<E> skipDeadNodes(Node<E> pred, Node<E> c, Node<E> p, Node<E> q) { in skipDeadNodes()
776 final Node<E> pred = nextNode; in next() local
|
| D | ForkJoinTask.java | 544 ExceptionNode pred = null; in clearExceptionalCompletion() local
626 ExceptionNode pred = null; in expungeStaleExceptions() local
|
| D | LinkedBlockingQueue.java | 511 void unlink(Node<E> p, Node<E> pred) { in unlink()
|
| D | SynchronousQueue.java | 770 void clean(QNode pred, QNode s) { in clean()
|
| D | ArrayBlockingQueue.java | 230 int pred = i; in removeAt() local
|
| D | ConcurrentLinkedDeque.java | 697 final Node<E> pred(Node<E> p) { in pred() method in ConcurrentLinkedDeque
|
| D | ConcurrentHashMap.java | 1045 Node<K,V> pred = e; in putVal() local
1740 Node<K,V> pred = e; in computeIfAbsent() local
2990 TreeNode<K,V> pred = p.prev; // unlink traversal pointers in removeTreeNode() local
|
| /libcore/ojluni/src/test/java/lang/invoke/ |
| D | LoopCombinatorTest.java | 427 public static void testWhileNullArgs(MethodHandle pred, MethodHandle body) { in testWhileNullArgs()
432 public static void testDoWhileNullArgs(MethodHandle body, MethodHandle pred) { in testDoWhileNullArgs()
882 static boolean pred() { in pred() method in LoopCombinatorTest.Empty
921 static boolean pred(int i, int acc, int k) { in pred() method in LoopCombinatorTest.Fac
980 static boolean pred(int i, int k) { in pred() method in LoopCombinatorTest.Loop
1026 boolean pred(int i, int acc, int k) { in pred() method in LoopCombinatorTest.LoopWithVirtuals
1078 static boolean pred(int i, int limit) { in pred() method in LoopCombinatorTest.While
|
| D | JavaDocExamplesTest.java | 692 static boolean pred(int i, int acc, int k) { return i < k; } in pred() method in JavaDocExamplesTest
747 boolean pred(int i) { return i < k; } in pred() method in JavaDocExamplesTest.FacLoop
804 static boolean pred(int i, int limit) { return i < limit; } in pred() method in JavaDocExamplesTest
|
| /libcore/ojluni/src/main/java/java/lang/invoke/ |
| D | MethodHandles.java | 4298 List<MethodHandle> pred = new ArrayList<>(); in loop() local
4419 …ldCommonSuffix(List<MethodHandle> init, List<MethodHandle> step, List<MethodHandle> pred, List<Met… in buildCommonSuffix()
4433 …private static void loopChecks1cd(List<MethodHandle> pred, List<MethodHandle> fini, Class<?> loopR… in loopChecks1cd()
4449 …private static void loopChecks2(List<MethodHandle> step, List<MethodHandle> pred, List<MethodHandl… in loopChecks2()
4575 public static MethodHandle whileLoop(MethodHandle init, MethodHandle pred, MethodHandle body) { in whileLoop()
4679 … public static MethodHandle doWhileLoop(MethodHandle init, MethodHandle body, MethodHandle pred) { in doWhileLoop()
4686 private static void whileLoopChecks(MethodHandle init, MethodHandle pred, MethodHandle body) { in whileLoopChecks()
4996 MethodHandle pred = getConstantHandle(MH_countedLoopPred); in countedLoop() local
|
| D | Transformers.java | 3092 private boolean doPredicate(final MethodHandle pred, in doPredicate()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| D | AbstractQueuedLongSynchronizer.java | 317 Node pred = node.prev; in cancelAcquire() local
364 private static boolean shouldParkAfterFailedAcquire(Node pred, Node node) { in shouldParkAfterFailedAcquire()
|
| D | AbstractQueuedSynchronizer.java | 797 Node pred = node.prev; in cancelAcquire() local
844 private static boolean shouldParkAfterFailedAcquire(Node pred, Node node) { in shouldParkAfterFailedAcquire()
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | LinkedList.java | 161 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
|