/dalvik/libcore/xml/src/main/java/org/apache/harmony/xml/dom/ |
H A D | NodeListImpl.java | 37 private List<NodeImpl> children; field in class:NodeListImpl 40 children = new ArrayList<NodeImpl>(); 44 children = list; 48 children.add(node); 52 return children.size(); 56 if (index >= children.size()) { 59 return children.get(index);
|
H A D | LeafNodeImpl.java | 31 * This class represents a Node that has a parent Node, but no children. 46 if (parent == null || index + 1 >= parent.children.size()) { 50 return parent.children.get(index + 1); 62 return parent.children.get(index - 1);
|
H A D | InnerNodeImpl.java | 37 * (potentially) a number of children. 44 List<LeafNodeImpl> children = new ArrayList<LeafNodeImpl>(); field in class:InnerNodeImpl 51 return insertChildAt(newChild, children.size()); 57 for (NodeImpl node : children) { 65 return (!children.isEmpty() ? children.get(0) : null); 69 return (!children.isEmpty() ? children.get(children.size() - 1) : null); 73 if (parent == null || index + 1 >= parent.children [all...] |
H A D | ElementImpl.java | 165 for (NodeImpl node : children) { 188 for (NodeImpl node : children) { 207 for (NodeImpl node : children) {
|
H A D | DocumentImpl.java | 206 * copying and return a node with no children. 353 for (LeafNodeImpl child : children) { 363 for (LeafNodeImpl child : children) {
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/ |
H A D | PKIXPolicyNode.java | 13 protected List children; field in class:PKIXPolicyNode 36 children = _children; 48 children.add(_child); 54 return children.iterator(); 84 return !children.isEmpty(); 94 children.remove(_child); 119 for(int i = 0; i < children.size(); i++) 121 _buf.append(((PKIXPolicyNode)children.get(i)).toString(_indent + " ")); 158 _iter = children.iterator();
|
/dalvik/libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
H A D | documentcreatedocumentfragment.java | 64 NodeList children; 71 children = newDocFragment.getChildNodes(); 72 length = (int) children.getLength();
|
H A D | hc_documentcreatedocumentfragment.java | 63 NodeList children; 70 children = newDocFragment.getChildNodes(); 71 length = (int) children.getLength();
|
/dalvik/libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
H A D | importNode04.java | 76 NodeList children; 85 children = aNode.getChildNodes(); 86 assertSize("throw_Size", 1, children);
|
/dalvik/libcore/support/src/test/java/tests/support/ |
H A D | Support_Xml.java | 42 NodeList children = doc.getFirstChild().getChildNodes(); 43 assertEquals(1, children.getLength()); 44 return children.item(0).getNodeValue();
|
/dalvik/libcore/xml/src/main/java/org/kxml2/kdom/ |
H A D | Node.java | 41 protected Vector children; field in class:Node 52 if (children == null) { 53 children = new Vector(); 66 children.insertElementAt(child, index); 97 return children.elementAt(index); 103 return children == null ? 0 : children.size(); 275 children.removeElementAt(idx); 291 attributes and children. 317 /** Writes the children o [all...] |
H A D | Element.java | 45 * called when all properties are set, but before children 56 * removes all children and attributes */ 60 children = null; 307 * Writes this element and all children to the given XmlWriter. */
|
/dalvik/libcore/xml/src/test/java/tests/xml/ |
H A D | NodeTest.java | 86 NodeList children = node.getChildNodes(); 87 for (int i = 0; i < children.getLength(); i++) { 88 traverse(children.item(i), sink);
|
H A D | SimpleBuilderTest.java | 152 NodeList children = element.getChildNodes(); 153 for (int i = 0; i < children.getLength(); i++) { 154 Node item = children.item(i);
|
/dalvik/libcore/xml/src/main/java/org/apache/xalan/templates/ |
H A D | ElemExsltFunction.java | 88 NodeList children = this.getChildNodes(); 91 Node child = children.item(i); 92 if (children.item(i) instanceof ElemParam) { 93 ElemParam param = (ElemParam)children.item(i);
|
/dalvik/libcore/xml/src/test/java/org/kxml2/io/ |
H A D | KXmlSerializerTest.java | 112 NodeList children = doc.getFirstChild().getChildNodes(); 114 for (int i = 0; i < children.getLength(); ++i) { 115 text += children.item(i).getNodeValue();
|
/dalvik/libcore/awt-kernel/src/main/java/java/beans/ |
H A D | PropertyChangeSupport.java | 49 private Hashtable<String, List<PropertyChangeListener>> children; field in class:PropertyChangeSupport 398 children = new Hashtable<String, List<PropertyChangeListener>>( 400 children.put("", allSerializedPropertiesChangeListeners); //$NON-NLS-1$ 401 oos.writeObject(children); 415 children = (Hashtable<String, List<PropertyChangeListener>>) ois 419 children);
|
/dalvik/libcore/logging/src/main/java/java/util/logging/ |
H A D | LogManager.java | 118 * "alogger" and for all its children in the naming hierarchy. Log levels 327 // find children 345 oldParent.children.remove(child); 626 newParent.children.add(logger); 652 for (Logger child : logger.children) {
|
H A D | Logger.java | 155 final List<Logger> children = new ArrayList<Logger>(); field in class:Logger 228 for (Logger logger : children) {
|
/dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/lang/ |
H A D | ThreadGroupTest.java | 569 assertEquals("Destroyed child can't have children", 0, child 991 assertTrue("Have to be parentOf all children", testRoot 1152 ThreadGroup[] children = groups(current); 1153 assertEquals("Can only have 1 subgroup", 1, children.length); 1154 current = children[0]; 1627 // No API to get the count of immediate children only ? 1678 ThreadGroup[] children = groups(aGroup); 1679 for (ThreadGroup element : children) { 1705 ThreadGroup[] children = groups(aGroup); 1707 for (ThreadGroup element : children) { [all...] |
/dalvik/libcore/prefs/src/main/java/java/util/prefs/ |
H A D | XMLParser.java | 412 NodeList children = selectNodeList(node, "node"); //$NON-NLS-1$ 415 int childNumber = children.getLength(); 428 // get children preferences node 430 Element child = (Element) children.item(i); 436 // load children nodes after unlock 438 loadNode(prefChildren[i], (Element) children.item(i));
|
/dalvik/dx/src/com/android/dx/ssa/ |
H A D | SsaMethod.java | 750 BitSet children 752 for (int i = children.nextSetBit(0); i >= 0 753 ; i = children.nextSetBit(i + 1)) {
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
H A D | DOMHelper.java | 73 * @return The newly created DOM Document object, with no children, or 127 * @return The newly created DOM Document object, with no children, or 385 NamedNodeMap children = parent.getAttributes(); 386 int nNodes = children.getLength(); 392 Node child = children.item(i); 437 // Node child = children.item(i);
|
/dalvik/libcore/xml/src/test/java/tests/org/w3c/dom/ |
H A D | ImportNode.java | 214 NodeList children; 223 children = aNode.getChildNodes(); 224 assertEquals("throw_Size", 1, children.getLength());
|
/dalvik/tools/dmtracedump/ |
H A D | TraceDump.c | 184 struct TimedMethod *children[2]; /* 0=normal, 1=recursive */ member in struct:MethodEntry 361 method->children[0] = NULL; 362 method->children[1] = NULL; 1391 TimedMethod *children = parent->children[parentIsRecursive]; local 1392 for (pTimed = children; pTimed; pTimed = pTimed->next) { 1407 pTimed->next = children; 1408 parent->children[parentIsRecursive] = pTimed; 1475 /* This prints the inclusive stats for all the parents or children of a 1648 printf("children, sorte [all...] |