Searched defs:stack (Results 1 - 7 of 7) sorted by relevance
/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/ojluni/src/main/java/java/nio/file/ |
H A D | FileTreeWalker.java | 61 private final ArrayDeque<DirectoryNode> stack = new ArrayDeque<>(); field in class:FileTreeWalker 65 * The element on the walking stack corresponding to a directory node. 239 for (DirectoryNode ancestor: stack) { 286 int depth = stack.size(); 309 // push a directory node to the stack and return an event 310 stack.push(new DirectoryNode(entry, attrs.fileKey(), stream)); 334 DirectoryNode top = stack.peek(); 336 return null; // stack is empty, we are done 338 // continue iteration of the directory at the top of the stack 367 stack [all...] |
/libcore/ojluni/src/main/java/java/io/ |
H A D | ObjectOutputStream.java | 2533 private final List<String> stack; field in class:ObjectOutputStream.DebugTraceInfoStack 2536 stack = new ArrayList<>(); 2543 stack.clear(); 2550 stack.remove(stack.size()-1); 2557 stack.add("\t- " + entry); 2565 if (!stack.isEmpty()) { 2566 for(int i = stack.size(); i > 0; i-- ) { 2567 buffer.append(stack.get(i-1) + ((i != 1) ? "\n" : ""));
|
/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/ojluni/src/main/java/java/util/concurrent/ |
H A D | CompletableFuture.java | 121 * collected in a linked stack. It atomically completes by CASing 139 * as Treiber stacks headed by field "stack". There are Completion 181 * x's stack (unless done), and started or triggered via 204 * Treiber stack wait-nodes used in FutureTask, Phaser, and 221 volatile Completion stack; // Top of Treiber stack of dependent actions field in class:CompletableFuture 231 /** Returns true if successfully pushed c onto stack. */ 233 Completion h = stack; 238 /** Unconditionally pushes c onto stack, retrying if necessary. */ 437 volatile Completion next; // Treiber stack lin [all...] |
H A D | ConcurrentHashMap.java | 407 * a stack (see class TableStack) is created on first encounter of 414 * suggesting use of a stack here.) 3353 TableStack<K,V> stack, spare; // to save/restore on ForwardingNodes field in class:ConcurrentHashMap.Traverser 3393 if (stack != null) 3412 s.next = stack; 3413 stack = s; 3423 while ((s = stack) != null && (index += (len = s.length)) >= n) { 3430 stack = next; 4878 TableStack<K,V> stack, spare; field in class:ConcurrentHashMap.BulkTask 4925 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/ ... |
Completed in 186 milliseconds