| /dalvik/libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| setNamedItemNS04.java | 39 * which contains an ENTITY_REFERENCE child node. Get access to the node's
83 Node child; local
94 child = nList.item(0);
95 nodeType = (int) child.getNodeType();
98 child = doc.createEntityReference("ent4");
99 assertNotNull("createdEntRefNotNull", child);
101 n2List = child.getChildNodes();
|
| /cts/tools/utils/cts/ |
| tools.py | 56 child = doc.createElement('TestSuite')
57 child.setAttribute('name', suite_name)
58 parent.appendChild(child)
59 # recurse into child suites
60 suite.WriteDescription(doc, child)
62 child = doc.createElement('TestCase')
63 child.setAttribute('name', case_name)
64 parent.appendChild(child)
68 child.appendChild(test)
|
| /external/bluetooth/glib/gio/fen/ |
| fen-helper.c | 238 GFile* child; local
240 child = g_file_new_for_path (FN_NAME(f));
242 child, NULL, events);
243 g_object_unref (child);
257 GFile* child; local
258 child = g_file_new_for_path (FN_NAME(f));
266 child, NULL, events);
274 child, NULL, events);
277 g_object_unref (child);
|
| /external/qemu/elff/ |
| dwarf_die.cc | 104 /* For CU DIEs address range may be zero size, even though its child DIEs
113 * Lets iterate through child DIEs to find the leaf (last DIE) that contains
115 DIEObject* child = last_child();
local
116 while (child != NULL) {
117 DIEObject* leaf = child->get_leaf_for_address(address);
121 child = child->prev_sibling();
123 /* No child DIE contains this address. This DIE is the leaf. */
234 printf("\n-----------> CHILD OF:\n");
|
| /external/v8/tools/ |
| splaytree.py | 94 # No left child, so the new tree is just the right child.
97 # Left child exists.
99 # Make the original left child the new root.
101 # Splay to make sure that the new root has an empty right child.
103 # Insert the original right child as the right child of the new
182 # counter-intuitive: The right child of the dummy node will hold
183 # the L tree of the algorithm. The left child of the dummy node
|
| /frameworks/base/media/libdrm/mobile2/include/util/domcore/ |
| NodeImpl.h | 79 * node have first child node,it will replace with the <code>childNode</code>.
88 * node have last child node,it will replace with the <code>childNode</code>.
146 * The first child of this node. If there is no such node, this returns
153 * The last child of this node. If there is no such node, this returns
174 * Inserts the node <code>newChild</code> before the existing child node
194 * <br>NOT_FOUND_ERR: Raised if <code>refChild</code> is not a child of
200 * Removes the child node indicated by <code>oldChild</code> from the list
206 * <br>NOT_FOUND_ERR: Raised if <code>oldChild</code> is not a child of
217 * document fragment are moved into the child list of this node
|
| /dalvik/libcore/xml/src/test/java/tests/org/w3c/dom/ |
| GetElementsByTagNameNS.java | 122 Node child; local
145 child = (Node) elementList.item(indexN10076);
146 childName = child.getNodeName();
160 Node child; local
174 child = (Node) elementList.item(indexN10059);
175 childName = child.getNodeName();
271 Node child; local
296 child = (Node) elementList.item(indexN1007E);
297 childName = child.getNodeName();
312 Node child; local
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/view/ |
| ExpandableList3.java | 55 curChildMap.put(NAME, "Child " + j);
56 curChildMap.put(IS_EVEN, (j % 2 == 0) ? "This child is even" : "This child is odd");
|
| /external/webkit/WebCore/inspector/front-end/ |
| ProfileDataGridTree.js | 270 _merge: function(child, shouldAbsorb)
272 this.selfTime += child.selfTime;
275 this.totalTime += child.totalTime;
276 this.numberOfCalls += child.numberOfCalls;
286 if (!shouldAbsorb || children[index] !== child)
290 children = child.children.slice();
326 appendChild: function(child)
328 this.insertChild(child, this.children.length);
331 insertChild: function(child, index)
333 this.children.splice(index, 0, child);
[all...] |
| /frameworks/base/core/java/android/widget/ |
| FrameLayout.java | 37 * Children are drawn in a stack, with the most recently added child on top.
38 * The size of the frame layout is the size of its largest child (plus padding), visible
176 * Supply a Drawable that is to be rendered on top of all of the child
241 // Find rightmost and bottommost child
243 final View child = getChildAt(i); local
244 if (mMeasureAllChildren || child.getVisibility() != GONE) {
245 measureChildWithMargins(child, widthMeasureSpec, 0, heightMeasureSpec, 0);
246 maxWidth = Math.max(maxWidth, child.getMeasuredWidth());
247 maxHeight = Math.max(maxHeight, child.getMeasuredHeight());
286 final View child = getChildAt(i) local
[all...] |
| /frameworks/base/tools/localize/ |
| XMLHandler.cpp | 266 const XMLNode* child = m_children[i]; local
267 switch (child->Type()) {
274 result += child->to_string(nspaces, indent);
399 XMLNode* child = m_children[i]; local
400 if (child->m_type == ELEMENT && child->m_ns == ns && child->m_name == name) {
401 result.push_back(child);
413 XMLNode* child = m_children[i]; local
414 if (child->m_type == ELEMENT && child->m_ns == ns && child->m_name == name)
431 XMLNode* child = m_children[i]; local
[all...] |
| /packages/apps/Phone/src/com/android/phone/ |
| InCallMenuView.java | 187 // Finally, add this item as a child.
240 * computes positions for each child, and then stores them in the
241 * child's layout params.
261 InCallMenuItemView child; local
297 child = mItems[row][itemIndex];
299 if (!child.isVisible()) continue;
301 if (DBG) log("==> child [" + row + "][" + itemIndex + "]: " + child);
303 // Tell the child to be exactly this size
304 child.measure(MeasureSpec.makeMeasureSpec((int) itemWidth, MeasureSpec.EXACTLY)
368 View child; local
[all...] |
| /external/webkit/WebCore/inspector/ |
| InspectorDOMAgent.cpp | 186 Node* child = innerFirstChild(node); local
187 while (child) {
188 unbind(child, nodesMap);
189 child = innerNextSibling(child);
254 Node* child = innerFirstChild(node);
256 for (size_t j = 0; child && j < childNumber; ++j)
257 child = innerNextSibling(child);
259 if (!child || child->nodeName() != childName
519 Node *child = innerFirstChild(container); local
581 Node* child = innerFirstChild(node); local
[all...] |
| /external/webkit/WebCore/rendering/ |
| RenderCounter.cpp | 156 // hence we must be a child of that reset counter.
203 // previousSibling if it is a reset counter and hence the current previousSibling is its child.
308 CounterNode* child = m_counterNode; local
309 int value = child->actsAsReset() ? child->value() : child->countInParent();
314 if (!child->actsAsReset())
315 child = child->parent();
316 while (CounterNode* parent = child->parent())
[all...] |
| /external/dbus/dbus/ |
| dbus-spawn.c | 94 "Failed to read from child pipe (%s)",
148 "Failed to read from child pipe (%s)",
166 /* The implementation uses an intermediate child between the main process
168 * child is a babysitter process; it keeps track of when the grandchild
203 unsigned int have_child_status : 1; /**< True if child status has been reaped */
256 * zero, the babysitter is killed and the child that was being
300 /* If we couldn't reap the child then kill it, and
418 _dbus_verbose ("recorded child status exited = %d signaled = %d exitstatus = %d termsig = %d\n",
480 _dbus_verbose ("Closing child error\n");
511 _dbus_verbose ("Reading data from child error\n")
[all...] |
| /cts/tools/utils/ |
| DescriptionGenerator.java | 305 Node child = suiteChildren.iterator().next(); local
309 + getAttribute(child, ATTRIBUTE_NAME);
310 setAttribute(child, ATTRIBUTE_NAME, newName);
315 parentNode.appendChild(child);
317 mergeEmptySuites(child);
322 * Get the unmuatable child nodes for specified node.
325 * @return A collection of copied child node.
352 for (Node child : children) {
353 String childName = child.getAttributes().getNamedItem(ATTRIBUTE_NAME)
359 appendTestCases(child, testSuite.mCases)
384 Node child = children.item(i); local
[all...] |
| /cts/tools/vm-tests/src/util/build/ |
| BuildStep.java | 80 for (BuildStep child : children) {
81 if (!child.build()) {
99 public void addChild(BuildStep child) {
103 children.add(child);
|
| /dalvik/libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| cdatasectiongetdata.java | 32 * second child of the second employee and examine its
71 Node child; local
77 child = nameList.item(1);
78 lastChild = child.getLastChild();
|
| characterdatagetlength.java | 34 * child of the first employee and examine the
66 CharacterData child; local
72 child = (CharacterData) nameNode.getFirstChild();
73 childValue = child.getData();
|
| characterdatasubstringexceedsvalue.java | 35 * Retrieve the character data from the second child
70 CharacterData child; local
75 child = (CharacterData) nameNode.getFirstChild();
76 substring = child.substringData(9, 10);
|
| characterdatasubstringvalue.java | 34 * Retrieve the character data from the second child
69 CharacterData child; local
74 child = (CharacterData) nameNode.getFirstChild();
75 substring = child.substringData(0, 8);
|
| hc_characterdatagetlength.java | 34 * child of the first employee and examine the
65 CharacterData child; local
71 child = (CharacterData) nameNode.getFirstChild();
72 childValue = child.getData();
|
| hc_characterdatasubstringexceedsvalue.java | 35 * Retrieve the character data from the second child
69 CharacterData child; local
74 child = (CharacterData) nameNode.getFirstChild();
75 substring = child.substringData(9, 10);
|
| hc_characterdatasubstringvalue.java | 34 * Retrieve the character data from the second child
68 CharacterData child; local
73 child = (CharacterData) nameNode.getFirstChild();
74 substring = child.substringData(0, 8);
|
| hc_nodeinsertbeforenewchildexists.java | 72 Node child; local
94 child = (Node) childList.item(indexN1008C);
95 nodeType = (int) child.getNodeType();
98 childName = child.getNodeName();
|
