Searched defs:children (Results 1 - 25 of 388) sorted by relevance

1234567891011>>

/external/chromium_org/gpu/config/
H A Ddx_diag_node.h22 std::map<std::string, DxDiagNode> children; member in struct:gpu::DxDiagNode
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRBaseTree.h31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRBaseTree.h31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRBaseTree.h31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRBaseTree.h42 - (AMutableArray *)children;
48 // is nil, add all children of t to this' children.
58 // Indicates the node is a nil node but may still have children, meaning
79 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
98 @property (retain) AMutableArray *children; variable
105 __strong AMutableArray *children; variable
117 - (AMutableArray *)children;
125 // is nil, add all children of t to this' children
173 @property (retain) AMutableArray *children; variable
[all...]
/external/chromium_org/third_party/WebKit/Source/web/painting/
H A DContinuousPainter.cpp55 const Vector<GraphicsLayer*>& children = layer->children(); local
57 for (it = children.begin(); it != children.end(); ++it)
/external/chromium/chrome/browser/accessibility/
H A Dbrowser_accessibility_cocoa.h35 // Invalidate children for a non-ignored ancestor (including self).
39 // the accessibility children of this object.
40 @property(nonatomic, readonly) NSArray* children; variable
/external/chromium/chrome/browser/extensions/
H A Dextension_bookmarks_unittest.cc38 ListValue* children; local
39 tree->GetList(keys::kChildrenKey, &children);
40 ASSERT_EQ(3U, children->GetSize());
48 ListValue* children; local
49 tree->GetList(keys::kChildrenKey, &children);
50 ASSERT_EQ(1U, children->GetSize());
58 ListValue* children; local
59 tree->GetList(keys::kChildrenKey, &children);
60 ASSERT_EQ(4U, children->GetSize());
62 ASSERT_TRUE(children
73 ListValue* children; local
[all...]
H A Dbrowser_action_test_util_gtk.cc23 GList* children = gtk_container_get_children(GTK_CONTAINER(toolbar)); local
25 static_cast<GtkWidget*>(g_list_nth(children, index)->data);
27 g_list_free(children);
40 GList* children = gtk_container_get_children(GTK_CONTAINER(toolbar)); local
41 count = g_list_length(children);
42 g_list_free(children);
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DParentNode.h40 static PassRefPtr<HTMLCollection> children(ContainerNode* node) function in class:WebCore::ParentNode
42 return node->children();
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DMergeIdenticalElementsCommand.cpp52 Vector<RefPtr<Node> > children; local
54 children.append(child);
56 size_t size = children.size();
58 m_element2->insertBefore(children[i].release(), m_atChild.get(), IGNORE_EXCEPTION);
80 Vector<RefPtr<Node> > children;
82 children.append(child);
84 size_t size = children.size();
86 m_element1->appendChild(children[i].release(), exceptionState);
H A DRemoveNodePreservingChildrenCommand.cpp44 Vector<RefPtr<Node> > children; local
46 children.append(child);
48 size_t size = children.size();
50 RefPtr<Node> child = children[i].release();
H A DReplaceNodeWithSpanCommand.cpp57 NodeVector children; local
58 getChildNodes(nodeToReplace, children);
59 for (size_t i = 0; i < children.size(); ++i)
60 newNode->appendChild(children[i]);
H A DWrapContentsInDummySpanCommand.cpp44 Vector<RefPtr<Node> > children; local
46 children.append(child);
48 size_t size = children.size();
50 m_dummySpan->appendChild(children[i].release(), IGNORE_EXCEPTION);
69 Vector<RefPtr<Node> > children;
71 children.append(child);
73 size_t size = children.size();
75 m_element->appendChild(children[i].release(), IGNORE_EXCEPTION);
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderMedia.h40 RenderObject* firstChild() const { ASSERT(children() == virtualChildren()); return children()->firstChild(); }
41 RenderObject* lastChild() const { ASSERT(children() == virtualChildren()); return children()->lastChild(); }
43 const RenderObjectChildList* children() const { return &m_children; } function in class:WebCore::RenderMedia
44 RenderObjectChildList* children() { return &m_children; } function in class:WebCore::RenderMedia
52 virtual RenderObjectChildList* virtualChildren() OVERRIDE FINAL { return children(); }
53 virtual const RenderObjectChildList* virtualChildren() const OVERRIDE FINAL { return children(); }
55 // FIXME: RenderMedia::layout makes assumptions about what children are allowed
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/
H A DDOMStorageItemsView.js93 var children = rootNode.children; variable
97 for (var i = 0; i < children.length; ++i) {
98 var childNode = children[i];
101 this.deleteButton.visible = (children.length > 1);
117 var children = rootNode.children; variable
122 for (var i = 0; i < children.length; ++i)
123 if (children[i].data.key === storageData.key)
127 rootNode.insertChild(childNode, children
140 var children = rootNode.children; variable
243 var children = rootNode.children; variable
[all...]
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_node_data.h58 std::vector<Element> children; member in struct:BookmarkNodeData::Element
/external/chromium_org/chrome/browser/ui/gtk/bookmarks/
H A Dbookmark_bar_gtk_unittest.cc91 // We should expect two children to the bookmark bar's toolbar.
92 GList* children = gtk_container_get_children( local
94 EXPECT_EQ(2U, g_list_length(children));
95 g_list_free(children);
/external/chromium_org/third_party/WebKit/Source/core/accessibility/
H A DAXARIAGrid.cpp65 unsigned rowCellCount = row->children().size();
73 // otherwise add its children (the cells) as the grid's children.
77 m_children.append(row->children());
105 // in case the render tree doesn't match the expected ARIA hierarchy, look at the children
109 // The children of this non-row will contain all non-ignored elements (recursing to find them).
111 AccessibilityChildrenVector children = child->children(); local
112 size_t length = children.size();
114 addTableCellChild(children[
[all...]
/external/chromium_org/ui/accessibility/
H A Dax_node.cc26 void AXNode::SwapChildren(std::vector<AXNode*>& children) { argument
27 children.swap(children_);
H A Dax_node.h26 const std::vector<AXNode*>& children() const { return children_; } function in class:ui::AXNode
38 // Swap the internal children vector with |children|. This instance
39 // now owns all of the passed children.
40 virtual void SwapChildren(std::vector<AXNode*>& children);
/external/chromium_org/ui/events/
H A Devent_target_iterator.h27 explicit EventTargetIteratorImpl(const std::vector<T*>& children) argument
28 : begin_(children.rbegin()),
29 end_(children.rend()) {
/external/eigen/debug/gdb/
H A Dprinters.py122 def children(self): member in class:EigenMatrixPrinter
167 def children(self): member in class:EigenQuaternionPrinter
/external/junit/src/org/junit/runners/model/
H A DRunnerBuilder.java75 * {@code children}. Care is taken to avoid infinite recursion:
79 public List<Runner> runners(Class<?> parent, Class<?>[] children) argument
84 return runners(children);
90 public List<Runner> runners(Class<?> parent, List<Class<?>> children) argument
92 return runners(parent, children.toArray(new Class<?>[0]));
95 private List<Runner> runners(Class<?>[] children) { argument
97 for (Class<?> each : children) {
/external/oprofile/libpp/
H A Dcallgraph_container.h68 * allow quick lookup of children (we'll do this several times
75 typedef std::map<symbol_entry, count_array_t, less_symbol> children; typedef in struct:arc_recorder::cg_data
78 children callers;
80 children callees;

Completed in 5033 milliseconds

1234567891011>>