Home
last modified time | relevance | path

Searched refs:stack (Results 1 – 14 of 14) sorted by relevance

/libcore/json/src/main/java/org/json/
DJSONStringer.java114 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/ojluni/src/main/java/java/nio/file/
DFileTreeWalker.java61 private final ArrayDeque<DirectoryNode> stack = new ArrayDeque<>(); field in FileTreeWalker
239 for (DirectoryNode ancestor: stack) { in wouldLoop()
286 int depth = stack.size(); in visit()
310 stack.push(new DirectoryNode(entry, attrs.fileKey(), stream)); in visit()
334 DirectoryNode top = stack.peek(); in next()
367 stack.pop(); in next()
388 if (!stack.isEmpty()) { in pop()
389 DirectoryNode node = stack.pop(); in pop()
401 if (!stack.isEmpty()) { in skipRemainingSiblings()
402 stack.peek().skip(); in skipRemainingSiblings()
[all …]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
DStackTest.java133 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/
DLogRecord.java549 StackTraceElement[] stack = VMStack.getThreadStackTrace(Thread.currentThread()); in inferCaller() local
550 int depth = stack.length; in inferCaller()
558 StackTraceElement frame = stack[ix]; in inferCaller()
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
DCollectionAndMapModifyStreamTest.java69 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/
DObjectOutputStream.java2517 private final List<String> stack; field in ObjectOutputStream.DebugTraceInfoStack
2520 stack = new ArrayList<>(); in DebugTraceInfoStack()
2527 stack.clear(); in clear()
2534 stack.remove(stack.size()-1); in pop()
2541 stack.add("\t- " + entry); in push()
2549 if (!stack.isEmpty()) { in toString()
2550 for(int i = stack.size(); i > 0; i-- ) { in toString()
2551 buffer.append(stack.get(i-1) + ((i != 1) ? "\n" : "")); in toString()
/libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/
DSpliteratorTestHelper.java528 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/testlib/org/openjdk/testlib/java/util/stream/
DSpliteratorTestHelper.java528 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/
DNodes.java963 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/test/java/libcore/java/lang/reflect/
DMethodTest.java648 StackTraceElement[] stack = Thread.currentThread().getStackTrace(); in identifyCaller() local
650 while (!stack[i++].getMethodName().equals("identifyCaller")) {} in identifyCaller()
651 return stack[i].getClassName(); in identifyCaller()
/libcore/ojluni/src/main/java/java/util/concurrent/
DCompletableFuture.java221 volatile Completion stack; // Top of Treiber stack of dependent actions field in CompletableFuture
233 Completion h = stack; in tryPushStack()
471 while ((h = f.stack) != null || in postComplete()
472 (f != this && (h = (f = this).stack) != null)) { in postComplete()
489 for (Completion p = null, q = stack; q != null;) { in cleanStack()
497 q = stack; in cleanStack()
505 q = stack; in cleanStack()
559 if (a != null && a.stack != null) { in postFire()
565 if (result != null && stack != null) { in postFire()
1083 if (b != null && b.stack != null) { // clean second source in postFire()
[all …]
DConcurrentHashMap.java3353 TableStack<K,V> stack, spare; // to save/restore on ForwardingNodes field in ConcurrentHashMap.Traverser
3393 if (stack != null) in advance()
3412 s.next = stack; in pushState()
3413 stack = s; in pushState()
3423 while ((s = stack) != null && (index += (len = s.length)) >= n) { in recoverState()
3430 stack = next; in recoverState()
4878 TableStack<K,V> stack, spare; field in ConcurrentHashMap.BulkTask
4925 if (stack != null) in advance()
4941 s.next = stack; in pushState()
4942 stack = s; in pushState()
[all …]
/libcore/support/src/test/java/tests/resources/
Djunit4-4.3.1.jarMETA-INF/ META-INF/MANIFEST.MF junit/ junit/extensions/ junit/ ...
/libcore/expectations/
Dknownfailures.txt1441 description: "Recursive calls to Charset.forName from within providers will overflow the stack.",