| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| nodereplacechild02.js | 80 children, and returns the oldChild node.
|
| /external/webkit/Source/WebCore/accessibility/ |
| AccessibilityTable.cpp | 301 // and add them as children
340 m_children.append(row->children());
431 AccessibilityChildrenVector rowChildren = m_rows[row]->children();
|
| /external/webkit/Source/WebCore/inspector/ |
| InspectorTimelineAgent.cpp | 365 parent.children->pushObject(record.release());
389 entry.record->setArray("children", entry.children);
|
| /libcore/luni/src/test/java/libcore/java/lang/ |
| OldThreadGroupTest.java | 348 // No API to get the count of immediate children only
374 ThreadGroup[] children = groups(group); local
375 for (ThreadGroup element : children) {
|
| /build/tools/releasetools/ |
| ota_from_target_files | 123 self.parent.children.append(self)
127 self.children = []
137 for i in self.children:
175 i.children.sort(key=lambda i: i.name)
184 """Count up the (uid, gid, mode) tuples for all children and
198 for i in self.children:
237 # item (and all its children) have already been set to. We only
249 for i in item.children:
|
| /external/chromium/chrome/browser/sync/engine/ |
| syncer_util.cc | 81 syncable::Directory::ChildHandles* children) {
92 trans->directory()->GetChildHandles(trans, old_id, children);
93 Directory::ChildHandles::iterator i = children->begin();
94 while (i != children->end()) {
100 // among the children will be valid after the loop, since we update all
101 // the children at once.
125 syncable::Directory::ChildHandles children; local
126 ChangeEntryIDAndUpdateChildren(trans, entry, new_id, &children);
283 // If we have still-existing children, then we need to deal with
[all...] |
| /external/v8/src/ |
| profile-generator.cc | 383 return node->children()->at(child_idx_);
386 return child_idx_ < node->children()->length();
995 Vector<HeapGraphEdge> children = entry->children(); local
996 for (int i = 0; i < children.length(); ++i) {
997 if (children[i].type() == HeapGraphEdge::kShortcut) continue;
998 HeapEntry* child = children[i].to();
1037 Vector<HeapGraphEdge> ch = children();
1126 Vector<HeapGraphEdge> children = curr->children(); local
2605 Vector<HeapGraphEdge> children = entry->children(); local
2897 Vector<HeapGraphEdge> children = entry->children(); local
[all...] |
| /external/libxml2/ |
| valid.c | [all...] |
| c14n.c | 928 value = xmlNodeListGetString(attr->doc, attr->children, 1);
[all...] |
| schematron.c | 884 cur = rule->children;
976 cur = pat->children;
1155 cur = root->children;
[all...] |
| entities.c | 105 if ((entity->children) && (entity->owner == 1) &&
106 (entity == (xmlEntityPtr) entity->children->parent))
107 xmlFreeNodeList(entity->children);
325 dtd->children = dtd->last = (xmlNodePtr) ret;
374 dtd->children = dtd->last = (xmlNodePtr) ret;
|
| parser.c | [all...] |
| /external/webkit/Source/WebCore/inspector/front-end/ |
| inspector.css | 1237 .outline-disclosure ol.children {
1241 .outline-disclosure ol.children.expanded {
1458 .event-listener-breakpoints.properties-tree .children li {
[all...] |
| DetailedHeapshotGridNodes.js | 73 atIndex = atIndex || this.children.length;
116 for (var i = 0, childrenCount = this.children.length; i < childrenCount; ++i) {
117 var child = this.children[i];
136 for (var i = 0, l = this.children.length; i < l; ++i) {
137 var child = this.children[i];
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderObject.cpp | 281 RenderObjectChildList* children = virtualChildren(); local
282 ASSERT(children);
283 if (!children)
302 if (needsTable && isTableCell() && !children->firstChild() && !newChild->isTableCell())
308 RenderObject* afterChild = beforeChild ? beforeChild->previousSibling() : children->lastChild();
322 children->insertChildNode(this, newChild, beforeChild);
333 RenderObjectChildList* children = virtualChildren(); local
334 ASSERT(children);
335 if (!children)
344 children->removeChildNode(this, oldChild)
2048 RenderObjectChildList* children = virtualChildren(); local
[all...] |
| /dalvik/tools/dmtracedump/ |
| TraceDump.c | 173 struct TimedMethod *children[2]; /* 0=normal, 1=recursive */ member in struct:MethodEntry
317 method->children[0] = NULL;
318 method->children[1] = NULL;
1315 TimedMethod *children = parent->children[parentIsRecursive]; local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/xml/ |
| Hyperlinks.java | 891 NodeList children = root.getChildNodes(); local
979 NodeList children = root.getChildNodes(); local
1030 NodeList children = root.getChildNodes(); local
[all...] |
| /external/clang/bindings/python/clang/ |
| cindex.py | 506 # expression; one can extract their location information, spelling, children,
530 # one can extract their location information, spelling, children, etc. However,
638 """Return an iterator for accessing the children of this cursor."""
641 def visitor(child, parent, children):
645 children.append(child)
647 children = []
648 Cursor_visit(self, Cursor_visit_callback(visitor), children)
649 return iter(children)
[all...] |
| /external/webkit/Source/WebCore/page/ |
| Page.cpp | 893 const HashSet<RefPtr<Widget> >* children = view->children(); local
894 ASSERT(children);
896 HashSet<RefPtr<Widget> >::const_iterator end = children->end();
897 for (HashSet<RefPtr<Widget> >::const_iterator it = children->begin(); it != end; ++it) {
|
| /external/webkit/Source/WebKit/android/jni/ |
| WebHistory.cpp | 95 // addItem will update the children to match the newly created bridge
111 * children so we do a breadth-first rebuild of the tree.
127 // item, then we do not need to traverse the children since there
193 // 6 empty strings + no document state + children count + 2 scales = 10 unsigned values
205 // Write the top-level history item and then write all the children
446 // Children count
447 unsigned childCount = item->children().size();
454 const WebCore::HistoryItemVector& children = parent->children(); local
455 WebCore::HistoryItemVector::const_iterator end = children.end()
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaMethod.java | 776 BitSet children local
778 for (int i = children.nextSetBit(0); i >= 0
779 ; i = children.nextSetBit(i + 1)) {
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| 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(); local
386 int nNodes = children.getLength();
392 Node child = children.item(i);
437 // Node child = children.item(i);
[all...] |
| /external/chromium/chrome/browser/ui/webui/ |
| gpu_internals_ui.cc | 507 node.children.begin();
508 it != node.children.end();
552 if (gpu_info.dx_diagnostics.children.size())
|
| /external/webkit/Source/WebCore/loader/ |
| HistoryController.cpp | 435 // committed) and its children (which will be replaced).
452 // Ignore it and its children.
503 // Ignore it and its children.
664 const HistoryItemVector& childItems = item->children();
688 const HistoryItemVector& childItems = item->children();
725 const HistoryItemVector& childItems = item->children();
742 // When this function is called with doClip=true we're able to create the whole tree except for the target's children,
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/win/ |
| GraphicsLayerCACF.cpp | 156 bool GraphicsLayerCACF::setChildren(const Vector<GraphicsLayer*>& children)
158 bool childrenChanged = GraphicsLayer::setChildren(children);
479 // Add the primary layer first. Even if we have negative z-order children, the primary layer always comes behind.
482 // FIXME: add the contents layer in the correct order with negative z-order children.
484 // for replaced elements that don't have children.
488 const Vector<GraphicsLayer*>& childLayers = children();
|
