| /libcore/json/src/main/java/org/json/ |
| D | JSONStringer.java | 114 private final List<Scope> stack = new ArrayList<Scope>(); field in JSONStringer
175 if (stack.isEmpty() && out.length() > 0) { in open()
179 stack.add(empty); in open()
194 stack.remove(stack.size() - 1); in close()
206 if (stack.isEmpty()) { in peek()
209 return stack.get(stack.size() - 1); in peek()
216 stack.set(stack.size() - 1, topOfStack); in replaceTop()
228 if (stack.isEmpty()) { in value()
264 if (stack.isEmpty()) { in value()
280 if (stack.isEmpty()) { in value()
[all …]
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| D | StackTest.java | 133 Stack<Object> stack = new Stack<Object>(); in test_pushLjava_lang_Object() local
135 stack.push(array[i]); in test_pushLjava_lang_Object()
138 assertEquals(array.length - i, stack.search(array[i])); in test_pushLjava_lang_Object()
|
| /libcore/ojluni/src/main/java/java/util/logging/ |
| D | LogRecord.java | 532 StackTraceElement[] stack = VMStack.getThreadStackTrace(Thread.currentThread()); in inferCaller() local
533 int depth = stack.length; in inferCaller()
541 StackTraceElement frame = stack[ix]; in inferCaller()
|
| D | Logger.java | 1481 StackTraceElement[] stack = VMStack.getThreadStackTrace(Thread.currentThread());
1485 clz = Class.forName(stack[ix].getClassName());
|
| /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
| D | CollectionAndMapModifyStreamTest.java | 69 Stack<Integer> stack = new Stack<>(); in createCollections() local
70 stack.addAll(content); in createCollections()
71 collections.add(stack); in createCollections()
|
| /libcore/ojluni/src/main/java/java/io/ |
| D | ObjectOutputStream.java | 2504 private final List<String> stack; field in ObjectOutputStream.DebugTraceInfoStack
2507 stack = new ArrayList<>(); in DebugTraceInfoStack()
2514 stack.clear(); in clear()
2521 stack.remove(stack.size()-1); in pop()
2528 stack.add("\t- " + entry); in push()
2536 if (!stack.isEmpty()) { in toString()
2537 for(int i = stack.size(); i > 0; i-- ) { in toString()
2538 buffer.append(stack.get(i-1) + ((i != 1) ? "\n" : "")); in toString()
|
| /libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
| D | SpliteratorTestHelper.java | 528 Deque<SplitNode<T>> stack = new ArrayDeque<>(); in testSplitUntilNull() local
529 stack.push(e); in testSplitUntilNull()
532 while (!stack.isEmpty()) { in testSplitUntilNull()
535 e = stack.pop(); in testSplitUntilNull()
578 stack.push(e.fromSplit(parentAndRightSplit)); in testSplitUntilNull()
579 stack.push(e.fromSplit(leftSplit)); in testSplitUntilNull()
|
| /libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/ |
| D | SpliteratorTestHelper.java | 528 Deque<SplitNode<T>> stack = new ArrayDeque<>(); in testSplitUntilNull() local
529 stack.push(e); in testSplitUntilNull()
532 while (!stack.isEmpty()) { in testSplitUntilNull()
535 e = stack.pop(); in testSplitUntilNull()
578 stack.push(e.fromSplit(parentAndRightSplit)); in testSplitUntilNull()
579 stack.push(e.fromSplit(leftSplit)); in testSplitUntilNull()
|
| /libcore/ojluni/src/main/java/java/util/stream/ |
| D | Nodes.java | 963 Deque<N> stack = new ArrayDeque<>(8); in initStack() local
965 stack.addFirst((N) curNode.getChild(i)); in initStack()
966 return stack; in initStack()
974 protected final N findNextLeafNode(Deque<N> stack) { in findNextLeafNode() argument
976 while ((n = stack.pollFirst()) != null) { in findNextLeafNode()
982 stack.addFirst((N) n.getChild(i)); in findNextLeafNode()
1094 Deque<Node<T>> stack = initStack(); in forEachRemaining() local
1096 while ((leaf = findNextLeafNode(stack)) != null) { in forEachRemaining()
1148 Deque<N> stack = initStack(); in forEachRemaining() local
1150 while ((leaf = findNextLeafNode(stack)) != null) { in forEachRemaining()
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | CompletableFuture.java | 192 volatile Completion stack; // Top of Treiber stack of dependent actions field in CompletableFuture
204 Completion h = stack; in tryPushStack()
442 while ((h = f.stack) != null || in postComplete()
443 (f != this && (h = (f = this).stack) != null)) { in postComplete()
460 for (Completion p = null, q = stack; q != null;) { in cleanStack()
468 q = stack; in cleanStack()
476 q = stack; in cleanStack()
530 if (a != null && a.stack != null) { in postFire()
536 if (result != null && stack != null) { in postFire()
1054 if (b != null && b.stack != null) { // clean second source in postFire()
[all …]
|
| D | ConcurrentHashMap.java | 3324 TableStack<K,V> stack, spare; // to save/restore on ForwardingNodes field in ConcurrentHashMap.Traverser
3364 if (stack != null) in advance()
3383 s.next = stack; in pushState()
3384 stack = s; in pushState()
3394 while ((s = stack) != null && (index += (len = s.length)) >= n) { in recoverState()
3401 stack = next; in recoverState()
4849 TableStack<K,V> stack, spare; field in ConcurrentHashMap.BulkTask
4896 if (stack != null) in advance()
4912 s.next = stack; in pushState()
4913 stack = s; in pushState()
[all …]
|
| /libcore/expectations/ |
| D | knownfailures.txt | 1481 description: "Recursive calls to Charset.forName from within providers will overflow the stack.",
|