Searched refs:nodes (Results 1 - 4 of 4) sorted by relevance

/packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/
H A DJJTAddressListParserState.java6 private java.util.Stack<Node> nodes; field in class:JJTAddressListParserState
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack<Node>();
30 nodes.removeAllElements();
39 return nodes.elementAt(0);
44 nodes.push(n);
54 return nodes.pop();
59 return nodes.peek();
85 children. That number of nodes are popped from the stack and
102 the nodes tha
[all...]
/packages/apps/Mms/src/com/android/mms/dom/smil/
H A DElementSequentialTimeContainerImpl.java47 ArrayList<Node> nodes = new ArrayList<Node>();
51 nodes.add(allChildren.item(i));
52 return new NodeListImpl(nodes);
55 return new NodeListImpl(nodes);
/packages/apps/Mms/src/com/android/mms/dom/
H A DNodeListImpl.java53 * @param nodes The static node list.
55 public NodeListImpl(ArrayList<Node> nodes) { argument
56 mStaticNodes = nodes;
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
H A DBinaryDictInputOutput.java464 // This method is responsible for finding a nice ordering of the nodes that favors run-time
468 MakedictLog.i("Counted nodes : " + treeSize);
483 // of the current O(log(n)), where n=number of nodes in the dictionary which is pretty
485 // If no nodes are ever merged, we can't have the same node twice in the list, hence
487 // since `list' is an ArrayList so it's an O(n) operation that runs on all nodes, making
512 * Computes the actual node size, based on the cached addresses of the children nodes.
575 * Computes the byte size of a list of nodes and updates each node cached position.
577 * @param flatNodes the array of nodes.
608 * nodes can be given the addresses of its children and attributes, and store that into
614 * @param flatNodes the ordered array of nodes
1024 showStatistics(ArrayList<Node> nodes) argument
[all...]

Completed in 109 milliseconds