| /external/webkit/Source/WebCore/inspector/front-end/ |
| ShowMoreDataGridNode.js | 35 var index = this.parent.children.indexOf(this);
|
| /ndk/sources/host-tools/make-3.81/ |
| job.h | 67 extern struct child *children;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/ |
| ExplodeRenderingHelperTest.java | 103 * Children of the relative layouts, one below the other.
136 * Children of the relative layouts, one above the other.
242 private MockXmlNode createLinearLayout(boolean horizontal, MockXmlNode[] children) {
243 MockXmlNode layout = new MockXmlNode(null, "LinearLayout", Node.ELEMENT_NODE, children);
251 private MockXmlNode createRelativeLayout(MockXmlNode[] children) {
252 MockXmlNode layout = new MockXmlNode(null, "RelativeLayout", Node.ELEMENT_NODE, children);
|
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| LayoutRenderer.java | 114 for (ViewNode node : root.children) {
119 if (node.children.size() > 0) {
160 for (ViewNode node : root.children) {
169 if (node.children.size() > 0) {
|
| /external/libxslt/libxslt/ |
| xslt.c | 892 if (cur->children) {
893 cur = cur->children;
[all...] |
| /frameworks/base/test-runner/src/android/test/ |
| TestRunner.java | 286 String[] children = getChildren(method); local
287 run(children);
376 + " children method: " + className);
541 return clazz.getMethod("children", (Class[]) null);
560 throw new RuntimeException("couldn't get children method for "
564 String[] children = getChildren(m); local
566 String[] allChildren = new String[testChildren.length + children.length];
567 System.arraycopy(children, 0, allChildren, 0, children.length);
568 System.arraycopy(testChildren, 0, allChildren, children.length, testChildren.length)
692 String[] children = getChildren(method); local
[all...] |
| /external/libxml2/ |
| xmlreader.c | 258 ID = xmlNodeListGetString(doc, attr->children, 1);
295 if (cur->children != NULL)
296 xmlTextReaderFreeNodeList(reader, cur->children);
314 * Free a property and all its siblings, all the children are freed too.
333 * the children are freed too.
356 if ((cur->children != NULL) &&
358 if (cur->children->parent == cur)
359 xmlTextReaderFreeNodeList(reader, cur->children);
360 cur->children = NULL;
410 * Free a node, this is a recursive behaviour, all the children are freed too
[all...] |
| xinclude.c | 872 cur = cur->children;
1011 cur = cur->children;
2095 xmlNodePtr children; local
[all...] |
| /external/chromium/webkit/glue/ |
| webkit_glue.cc | 225 const WebVector<WebHistoryItem>& children = item.children(); local
226 if (!children.isEmpty()) {
231 for (size_t i = 0; i < children.size(); ++i)
232 sorted_children.push_back(children[i]);
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| ExpandableDictionary.java | 160 private void addWordRec(NodeArray children, final String word, final int depth,
165 // Does children have the current character?
166 final int childrenLength = children.mLength;
169 final Node node = children.mData[i];
179 children.add(childNode);
256 * @param roots node whose children have to be search for matches
291 final NodeArray children = node.mChildren; local
307 if (children != null) {
308 getWordsRec(children, codes, word, depth + 1, true, snr, inputIndex,
315 if (children != null)
[all...] |
| /external/v8/src/ |
| liveedit-debugger.js | 93 for (var i = 0; i < node.children.length; i++) {
94 CollectDamaged(node.children[i]);
103 CollectNew(node_list[i].children);
119 for (var i = 0; i < old_node.children.length; i++) {
120 HarvestTodo(old_node.children[i]);
240 // nested functions serialized as parent followed by serialized children.
278 // The recursive function, that goes over all children of a particular
319 for (var i = 0; i < old_node.children.length; i++) {
320 if (old_node.children[i].corresponding_node) {
322 old_node.children[i].corresponding_node.info
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
| ChangeLayoutRefactoring.java | 185 // overlay children are replaced by their first element children
195 NodeList children = e.getChildNodes(); local
197 for (int i = 0, n = children.getLength(); i < n; i++) {
198 Node node = children.item(i);
282 // Layout attributes on children have already been removed as part of conversion
352 // conversion) and then convert all the children into <TableRow> elements.
357 NodeList children = layout.getChildNodes(); local
358 for (int i = 0, n = children.getLength(); i < n; i++) {
359 Node node = children.item(i)
404 NodeList children = layout.getChildNodes(); local
420 NodeList children = layout.getChildNodes(); local
522 NodeList children = layout.getChildNodes(); local
[all...] |
| /external/dbus/dbus/ |
| dbus-marshal-recursive-util.c | 355 DBusList *children; member in struct:TestTypeNodeContainer
789 1, /* number of times children appear as fields */
803 2, /* number of times children appear as fields */
[all...] |
| /external/valgrind/main/massif/ |
| ms_main.c | 79 // keeping XPt children sorted by 'ip' and use binary search in get_XCon.
555 // Children.
559 UInt n_children; // number of children
560 UInt max_children; // capacity of children array
561 XPt** children; // pointers to children XPts member in struct:_XPt
581 SXPt** children; member in struct:_SXPt::__anon12796::__anon12797
623 // Note that we cannot use perm_malloc for the 'children' array, because
630 // We don't initially allocate any space for children. We let that
632 // children anyway
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/lang/ |
| ThreadGroupTest.java | 178 assertEquals("Destroyed child can't have children", 0, child
463 assertTrue("Have to be parentOf all children", testRoot
565 ThreadGroup[] children = groups(current); local
566 assertEquals("Can only have 1 subgroup", 1, children.length);
567 current = children[0];
847 // No API to get the count of immediate children only ?
899 ThreadGroup[] children = groups(aGroup); local
900 for (ThreadGroup element : children) {
928 ThreadGroup[] children = groups(aGroup); local
930 for (ThreadGroup element : children) {
1036 ThreadGroup[] children = groups(aGroup); local
[all...] |
| /external/chromium/chrome/browser/extensions/ |
| extension_menu_manager_unittest.cc | 252 ASSERT_EQ(item3, item1->children()[0]);
257 ASSERT_EQ(item3, item2->children()[0]);
262 ASSERT_EQ(item2, item1->children()[0]);
264 ASSERT_EQ(item3, item2->children()[0]);
275 ASSERT_EQ(item2, item1->children()[0]);
276 ASSERT_EQ(item3, item1->children()[1]);
282 ASSERT_EQ(item2, item1->children()[0]);
283 ASSERT_EQ(item3, item1->children()[1]);
295 ASSERT_EQ(item3, item1->children()[0]);
|
| /external/webkit/Source/WebCore/history/ |
| HistoryItem.cpp | 533 const HistoryItemVector& HistoryItem::children() const function in class:WebCore::HistoryItem
572 if (children().size() != otherItem->children().size())
575 for (size_t i = 0; i < children().size(); i++) {
576 HistoryItem* child = children()[i].get();
585 // Does a non-recursive check that this item and its immediate children have the
592 if (children().size() != otherItem->children().size())
595 for (size_t i = 0; i < children().size(); i++) {
596 if (!otherItem->childItemWithTarget(children()[i]->target())
[all...] |
| /external/collada/src/dae/ |
| daeElement.cpp | 150 // Notify our children
156 // children of this element.
438 daeElementRefArray children; local
439 _meta->getChildren( this, children );
440 for ( size_t x = 0; x < children.getCount(); x++ ) {
441 ret->placeElement( children.get(x)->clone( idSuffix, nameSuffix ) );
590 // Compare children
626 // Compare children
679 daeElementRefArray children; local
680 getChildren(children);
[all...] |
| /external/llvm/lib/Analysis/ |
| RegionInfo.cpp | 325 To->children.push_back(*I);
327 children.clear();
332 assert(std::find(begin(), end(), SubRegion) == children.end()
336 children.push_back(SubRegion);
341 assert(SubRegion->children.size() == 0
342 && "SubRegions that contain children are not supported");
355 SubRegion->children.push_back(*I);
360 children.clear();
361 children.insert(children.begin(), Keep.begin(), Keep.end())
[all...] |
| /external/quake/quake/src/QW/server/ |
| model.c | 77 node = node->children[0];
79 node = node->children[1];
760 Mod_SetParent (node->children[0], node);
761 Mod_SetParent (node->children[1], node);
800 p = LittleShort (in->children[j]);
802 out->children[j] = loadmodel->nodes + p;
804 out->children[j] = (mnode_t *)(loadmodel->leafs + (-1 - p));
905 out->children[0] = LittleShort(in->children[0]);
906 out->children[1] = LittleShort(in->children[1])
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| ContainerNode.cpp | 81 NodeVector children; local
82 collectNodes(oldParent, children);
85 for (unsigned i = 0; i < children.size(); ++i) {
87 if (children[i]->attached())
88 children[i]->detach();
90 RefPtr<Node> child = document()->adoptNode(children[i].release(), ec);
168 // Send notification about the children change.
289 // For a fragment we have more children to do.
390 NodeVector children; local
391 collectNodes(container, children);
753 NodeVector children; local
[all...] |
| /external/clang/utils/ |
| FindSpecRefs | 789 def flatten((key, children, data)):
790 children = sorted(map(flatten,children.values()))
791 return (key, children, sorted(data))
796 (key,children,data) = node
799 for c in children:
[all...] |
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_documentcreatedocumentfragment.js | 92 var children;
104 children = newDocFragment.childNodes;
106 length = children.length;
|
| hc_nodereplacechildinvalidnodetype.js | 80 a type that does not allow children of the type "newChild"
84 one of its children with a newly created Attr node.
85 An Element node cannot have children of the "Attr"
|
| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_documentcreatedocumentfragment.js | 92 var children;
104 children = newDocFragment.childNodes;
106 length = children.length;
|
