HomeSort by relevance Sort by last modified time
    Searched full:child (Results 276 - 300 of 1967) sorted by null

<<11121314151617181920>>

  /dalvik/libcore/dom/src/test/java/org/w3c/domts/level1/core/
hc_nodelistindexequalzero.java 32 * employee and access its first child by using an index
68 Node child; local
76 child = employeeList.item(0);
77 childName = child.getNodeName();
hc_nodelistindexnotzero.java 36 * employee and access its fourth child by using an index
69 Node child; local
75 child = employeeList.item(3);
76 childName = child.getNodeName();
hc_nodelistreturnfirstitem.java 32 * employee and access its first child by invoking the
65 Node child; local
71 child = employeeList.item(0);
72 childName = child.getNodeName();
hc_nodelistreturnlastitem.java 32 * employee and access its last child by invoking the
65 Node child; local
74 child = employeeList.item(((int) /*int */index));
75 childName = child.getNodeName();
namednodemapreturnfirstitem.java 35 * listing of the attributes of the last child. Since the
70 Node child; local
76 child = attributes.item(0);
77 name = child.getNodeName();
namednodemapreturnlastitem.java 35 * listing of the attributes of the last child. Since the
70 Node child; local
76 child = attributes.item(1);
77 name = child.getNodeName();
nodeappendchildchildexists.java 34 * Retrieve the first child of the second employee and
35 * append the first child to the end of the list. After
37 * child should be the one that was second and the last
38 * child should be the one that was first.
nodeappendchilddocfragment.java 69 Node child; local
96 child = (Node) childList.item(indexN1009F);
97 nodeType = (int) child.getNodeType();
100 childName = child.getNodeName();
nodehaschildnodesfalse.java 34 * Retrieve the Text node inside the first child of the
66 Node child; local
73 child = elementList.item(1);
74 employeeIdList = child.getChildNodes();
nodelistreturnfirstitem.java 31 * Get the first child of the third employee using NodeList.item(0)
63 Node child; local
70 child = employeeList.item(0);
71 childName = child.getNodeName();
  /dalvik/libcore/dom/src/test/java/org/w3c/domts/level2/core/
importNode12.java 79 Node child; local
94 child = entity1.getFirstChild();
95 assertNotNull("notnull", child);
96 childName = child.getNodeName();
  /dalvik/libcore/xml/src/main/java/org/w3c/dom/
DocumentFragment.java 29 * objects as arguments; this results in all the child nodes of the
30 * <code>DocumentFragment</code> being moved to the child list of this node.
37 * child and that child node could be a <code>Text</code> node. Such a
  /external/clearsilver/util/
neo_server.h 17 /* hmm, this callback might need a mechanism for telling the child to
  /external/icu4c/i18n/
ucln_in.h 26 It's usually best to have child dependencies called first. */
  /external/webkit/WebCore/accessibility/
AccessibilityMenuListPopup.cpp 111 AccessibilityObject* child = m_children[i - 1].get(); local
112 if (child->actionElement() && !child->actionElement()->attached()) {
113 m_menuList->renderer()->document()->axObjectCache()->remove(child->axObjectID());
  /external/webkit/WebCore/rendering/
RenderRuby.h 60 virtual void addChild(RenderObject* child, RenderObject* beforeChild = 0);
61 virtual void removeChild(RenderObject* child);
77 virtual void addChild(RenderObject* child, RenderObject* beforeChild = 0);
78 virtual void removeChild(RenderObject* child);
  /frameworks/base/core/java/android/widget/
BaseExpandableListAdapter.java 73 * <li> bit 0: Whether this ID points to a child (unset) or group (set), so for this method
88 * <li> bit 0: Whether this ID points to a child (unset) or group (set), so for this method
109 * @return 0 for any group or child position, since only one child type count is declared.
  /frameworks/base/core/tests/coretests/src/android/widget/gridview/touch/
GridTouchStackFromBottomTest.java 62 assertEquals("Last item not the last child in the grid",
79 assertEquals("Last item not the last child in the grid",
96 assertEquals("Last item not the last child in the grid",
113 assertEquals("Last item not the last child in the grid",
  /frameworks/base/docs/html/guide/topics/ui/
layout-objects.jd 29 All child elements of the FrameLayout are pinned to the top left corner of the screen; you cannot
30 specify a different location for a child view. Subsequent child views will simply be drawn over previous ones,
39 stacked one after the other, so a vertical list will only have one child per
41 high (the height of the tallest child, plus padding). A {@link
43 and the <em>gravity</em> (right, center, or left alignment) of each child. </p>
48 Child views can specify an integer weight value, and then any remaining space in the view group is
65 to each child, depending on what proportion of the screen each should
96 <p>{@link android.widget.TableRow} objects are the child views of a TableLayout
148 <p>{@link android.widget.RelativeLayout} lets child views specify thei
    [all...]
  /frameworks/base/media/libdrm/mobile2/include/util/xml/
XMLElementImpl.h 79 * Find the first child node in element by its tag name.
82 * @return NULL if not found otherwise the child node.
87 * Get the first text containted in first child of the element.
94 * Get the first child xml element containted in the element.
  /frameworks/base/tools/preload/
Proc.java 43 /** Child processes. */
155 * Prints a child proc to standard out.
159 for (Proc child : children) {
160 child.print(prefix + " ");
  /development/tools/makedict/src/com/android/tools/dict/
MakeBinaryDictionary.java 170 CharNode child = null; local
178 child = node;
183 if (child == null) {
184 child = new CharNode();
185 parent.children.add(child);
187 child.data = data;
188 if (child.freq == 0) child.freq = occur;
190 addWordRec(child, word, charAt + 1, occur);
192 child.terminal = true
    [all...]
  /external/dbus/dbus/
dbus-marshal-recursive-util.c 1556 TestTypeNode *child; local
1682 TestTypeNode *child; local
1890 TestTypeNode *child; local
1936 TestTypeNode *child; local
1974 TestTypeNode *child; local
2884 TestTypeNode *child = link->data; local
2933 TestTypeNode *child = link->data; local
3002 TestTypeNode *child = link->data; local
3037 TestTypeNode *child; local
3078 TestTypeNode *child = link->data; local
3113 TestTypeNode *child; local
3142 TestTypeNode *child = link->data; local
3228 TestTypeNode *child; local
3272 TestTypeNode *child; local
3330 TestTypeNode *child; local
3425 TestTypeNode *child; local
3552 TestTypeNode *child = link->data; local
    [all...]
  /external/tinyxml/
tinyxml.h 486 const TiXmlNode* FirstChild() const { return firstChild; } ///< The first child of this node. Will be null if there are no children.
488 const TiXmlNode* FirstChild( const char * value ) const; ///< The first child of this node with the matching 'value'. Will be null if none found.
489 TiXmlNode* FirstChild( const char * value ); ///< The first child of this node with the matching 'value'. Will be null if none found.
491 const TiXmlNode* LastChild() const { return lastChild; } /// The last child of this node. Will be null if there are no children.
493 const TiXmlNode* LastChild( const char * value ) const; /// The last child of this node matching 'value'. Will be null if there are no children.
506 for( child = parent->FirstChild(); child; child = child->NextSibling() )
511 child = 0
    [all...]
  /bionic/libc/bionic/
fork.c 37 /* Posix mandates that the timers of a fork child process be
44 if (ret != 0) { /* not a child process */

Completed in 2092 milliseconds

<<11121314151617181920>>