/libcore/json/src/main/java/org/json/ |
H A D | JSONStringer.java | 111 * Unlike the original implementation, this stack isn't limited to 20 114 private final List<Scope> stack = new ArrayList<Scope>(); field in class:JSONStringer 175 if (stack.isEmpty() && out.length() > 0) { 179 stack.add(empty); 194 stack.remove(stack.size() - 1); 203 * Returns the value on the top of the stack. 206 if (stack.isEmpty()) { 209 return stack.get(stack [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | StackTest.java | 40 assertTrue("New stack answers non-empty", s.empty()); 96 "a) Pop threw EmptyStackException when stack should not have been empty"); 104 "b) Pop threw EmptyStackException when stack should not have been empty"); 113 "c) Pop threw EmptyStackException when stack should not have been empty"); 119 "d) Pop did not throw EmptyStackException when stack should have been empty"); 133 Stack<Object> stack = new Stack<Object>(); 135 stack.push(array[i]); 138 assertEquals(array.length - i, stack.search(array[i])); 158 assertEquals("Search returned incorrect value for equivalent object at top of stack", 160 assertEquals("Search returned incorrect value for equal object at top of stack", [all...] |
/libcore/ojluni/src/main/java/java/util/logging/ |
H A D | LogRecord.java | 46 * getSourceClassName) by analyzing the call stack. Therefore, 296 * stack frame. 327 * stack frame. 532 StackTraceElement[] stack = VMStack.getThreadStackTrace(Thread.currentThread()); 533 int depth = stack.length; 538 // from paying the cost of building the entire stack frame. 541 StackTraceElement frame = stack[ix];
|
H A D | Logger.java | 112 * SystemClassLoader the Logger will also search up the class stack 114 * (This call stack search is to allow containers to transition to 155 * JITing and may entirely remove stack frames, making it impossible 1463 // does stack walk to search for the resource bundle 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/ |
H A D | CollectionAndMapModifyStreamTest.java | 69 Stack<Integer> stack = new Stack<>(); 70 stack.addAll(content); 71 collections.add(stack);
|
/libcore/ojluni/src/main/java/java/io/ |
H A D | ObjectOutputStream.java | 2504 private final List<String> stack; field in class:ObjectOutputStream.DebugTraceInfoStack 2507 stack = new ArrayList<>(); 2514 stack.clear(); 2521 stack.remove(stack.size()-1); 2528 stack.add("\t- " + entry); 2536 if (!stack.isEmpty()) { 2537 for(int i = stack.size(); i > 0; i-- ) { 2538 buffer.append(stack.get(i-1) + ((i != 1) ? "\n" : ""));
|
/libcore/ojluni/src/test/java/util/stream/bootlib/java/util/stream/ |
H A D | SpliteratorTestHelper.java | 518 * Set the maximum stack capacity to 0.25MB. This should be more than enough to detect a bad spliterator 525 // Use an explicit stack to avoid a StackOverflowException when testing a Spliterator 528 Deque<SplitNode<T>> stack = new ArrayDeque<>(); 529 stack.push(e); 532 while (!stack.isEmpty()) { 533 assertTrue(iteration++ < MAXIMUM_STACK_CAPACITY, "Exceeded maximum stack modification count of 1 << 18"); 535 e = stack.pop(); 577 // Add right side to stack first so left side is popped off first 578 stack.push(e.fromSplit(parentAndRightSplit)); 579 stack [all...] |
/libcore/ojluni/src/test/java/util/stream/testlib/org/openjdk/testlib/java/util/stream/ |
H A D | SpliteratorTestHelper.java | 518 * Set the maximum stack capacity to 0.25MB. This should be more than enough to detect a bad spliterator 525 // Use an explicit stack to avoid a StackOverflowException when testing a Spliterator 528 Deque<SplitNode<T>> stack = new ArrayDeque<>(); 529 stack.push(e); 532 while (!stack.isEmpty()) { 533 assertTrue(iteration++ < MAXIMUM_STACK_CAPACITY, "Exceeded maximum stack modification count of 1 << 18"); 535 e = stack.pop(); 577 // Add right side to stack first so left side is popped off first 578 stack.push(e.fromSplit(parentAndRightSplit)); 579 stack [all...] |
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | Nodes.java | 947 // node stack used when traversing to search and find leaf nodes 956 * Initiate a stack containing, in left-to-right order, the child nodes 963 Deque<N> stack = new ArrayDeque<>(8); 965 stack.addFirst((N) curNode.getChild(i)); 966 return stack; 971 * an explicit stack, to find the next non-empty leaf node. 974 protected final N findNextLeafNode(Deque<N> stack) { argument 976 while ((n = stack.pollFirst()) != null) { 982 stack.addFirst((N) n.getChild(i)); 996 // Initiate the node stack [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | CompletableFuture.java | 92 * collected in a linked stack. It atomically completes by CASing 110 * as Treiber stacks headed by field "stack". There are Completion 152 * x's stack (unless done), and started or triggered via 175 * Treiber stack wait-nodes used in FutureTask, Phaser, and 192 volatile Completion stack; // Top of Treiber stack of dependent actions field in class:CompletableFuture 202 /** Returns true if successfully pushed c onto stack. */ 204 Completion h = stack; 209 /** Unconditionally pushes c onto stack, retrying if necessary. */ 408 volatile Completion next; // Treiber stack lin [all...] |
H A D | ConcurrentHashMap.java | 378 * a stack (see class TableStack) is created on first encounter of 385 * suggesting use of a stack here.) 3324 TableStack<K,V> stack, spare; // to save/restore on ForwardingNodes field in class:ConcurrentHashMap.Traverser 3364 if (stack != null) 3383 s.next = stack; 3384 stack = s; 3394 while ((s = stack) != null && (index += (len = s.length)) >= n) { 3401 stack = next; 4849 TableStack<K,V> stack, spare; field in class:ConcurrentHashMap.BulkTask 4896 if (stack ! [all...] |
/libcore/support/src/test/java/tests/resources/ |
H A D | junit4-4.3.1.jar | META-INF/ META-INF/MANIFEST.MF junit/ junit/extensions/ junit/framework/ junit/runner/ junit/textui/ org/ ... |