| /external/chromium_org/tools/memory_inspector/memory_inspector/classification/ |
| rules_unittest.py | 16 'children': [
20 'children': []
31 'children': [
39 'children': [
64 self.assertEqual(len(rt.children), 3)
65 node1 = rt.children[0]
66 node2 = rt.children[1]
67 node3 = rt.children[2]
77 # Check 2-nd level leaves and their children.
78 self.assertEqual(len(node1.children), 3
[all...] |
| results_unittest.py | 18 'children': [
34 self.assertEqual(len(result.total.children), 3)
35 self.assertEqual(result.total.children[0].name, 'a*')
36 self.assertEqual(result.total.children[1].name, 'b*')
37 self.assertEqual(result.total.children[2].name, 'Total-other')
38 self.assertEqual(result.total.children[0].children[0].name, 'az*')
39 self.assertEqual(result.total.children[0].children[1].name, 'a*-other')
50 self.assertEqual(result.total.children[0].values, [9, 12]
[all...] |
| /external/chromium_org/tools/grit/grit/tool/ |
| rc2grd_unittest.py | 121 result.children[2].children[2].children[0].attrs['desc'] == '')
123 result.children[2].children[2].children[0].children[0].attrs['name'] == 'USERNAME')
125 result.children[2].children[2].children[1].attrs['desc'] == 'The other description'
[all...] |
| postprocess_unittest.py | 42 result.children[2].children[2].children[0].attrs['name'] == 'SMART_STRING_1')
44 result.children[2].children[2].children[1].attrs['name'] == 'SMART_STRING_2')
53 messages = grdnode.children[2].children[2]
54 for node in messages.children:
|
| /external/chromium_org/ui/compositor/ |
| layer_tree_owner.cc | 15 std::vector<Layer*> children = layer->children(); local
16 for (std::vector<Layer*>::const_iterator it = children.begin();
17 it != children.end();
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| BaseTree.java | 34 * actually have any user data. ANTLR v3 uses a list of children approach
36 * an empty node whose children represent the list. An empty, but
40 protected List children; field in class:BaseTree
46 * as there are no fields other than the children list, which cannot
47 * be copied as the children are not considered part of this node.
53 if ( children==null || i>=children.size() ) {
56 return (Tree)children.get(i);
59 /** Get the children internal List; note that if you directly mess with
63 return children;
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| BaseTree.js | 2 * actually have any user data. ANTLR v3 uses a list of children approach
4 * an empty node whose children represent the list. An empty, but
13 if ( !this.children || i>=this.children.length ) {
16 return this.children[i];
19 /** Get the children internal List; note that if you directly mess with
23 return this.children;
28 for (i = 0; this.children && i < this.children.length; i++) {
29 t = this.children[i]
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
| CPUProfileTopDownDataGrid.js | 34 var hasChildren = !!(profileNode.children && profileNode.children.length);
38 this._remainingChildren = profileNode.children;
59 var children = container._remainingChildren;
60 var childrenLength = children.length;
63 container.appendChild(new WebInspector.TopDownProfileDataGridNode(children[i], /** @type {!WebInspector.TopDownProfileDataGridTree} */(container.tree)));
79 var children = container.children;
80 var index = container.children.length;
83 WebInspector.TopDownProfileDataGridNode._excludeRecursively(children[index], aCallUID)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| AntlrRuntime_BaseTreeDebugView.cs | 47 public ITree[] Children
51 if (_tree == null || _tree.Children == null)
54 ITree[] children = new ITree[_tree.Children.Count];
55 _tree.Children.CopyTo(children, 0);
56 return children;
|
| /external/chromium_org/third_party/WebKit/Source/web/painting/ |
| ContinuousPainter.cpp | 55 const Vector<GraphicsLayer*>& children = layer->children(); local
57 for (it = children.begin(); it != children.end(); ++it)
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| merger.h | 14 // children[0,n-1]. Takes ownership of the child iterators and
22 const Comparator* comparator, Iterator** children, int n);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| CompositeGrammarTree.java | 35 protected List<CompositeGrammarTree> children; field in class:CompositeGrammarTree
50 if ( children==null ) {
51 children = new ArrayList<CompositeGrammarTree>();
53 children.add(t);
62 for (int i = 0; r==null && children!=null && i < children.size(); i++) {
63 CompositeGrammarTree child = children.get(i);
93 for (int i = 0; n==null && children!=null && i < children.size(); i++) {
94 CompositeGrammarTree child = children.get(i)
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3basetree.c | 75 tree->children = NULL;
101 if (tree->children != NULL)
103 cs = tree->children->size(tree->children);
106 t = (pANTLR3_BASE_TREE) (tree->children->get(tree->children, i));
121 if ( tree->children == NULL
122 || i >= tree->children->size(tree->children))
126 return tree->children->get(tree->children, i)
[all...] |
| /external/chromium_org/sync/syncable/ |
| parent_child_index.cc | 60 OrderedChildSet* children = NULL; local
63 children = i->second;
65 children = new OrderedChildSet();
66 parent_children_map_.insert(std::make_pair(parent_id, children));
69 return children->insert(entry).second;
80 OrderedChildSet* children = parent->second; local
81 OrderedChildSet::iterator j = children->find(e);
82 DCHECK(j != children->end());
84 children->erase(j);
85 if (children->empty())
98 const OrderedChildSet* children = parent->second; local
[all...] |
| /external/chromium_org/chrome/browser/ui/ash/accessibility/ |
| ax_root_obj_wrapper.cc | 19 std::vector<views::AXAuraObjWrapper*> children; local
20 GetChildren(&children);
21 return std::find(children.begin(), children.end(), child) != children.end();
33 // Only on ash is there a notion of a root with children.
34 aura::Window::Windows children =
36 for (size_t i = 0; i < children.size(); ++i) {
38 views::AXAuraObjCache::GetInstance()->GetOrCreate(children[i]));
|
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| WrapContentsInDummySpanCommand.cpp | 44 NodeVector children; local
45 getChildNodes(*m_element, children);
47 size_t size = children.size();
49 m_dummySpan->appendChild(children[i].release(), IGNORE_EXCEPTION);
68 NodeVector children;
69 getChildNodes(*m_dummySpan, children);
71 size_t size = children.size();
73 m_element->appendChild(children[i].release(), IGNORE_EXCEPTION);
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderMedia.h | 41 RenderObject* firstChild() const { ASSERT(children() == virtualChildren()); return children()->firstChild(); }
42 RenderObject* lastChild() const { ASSERT(children() == virtualChildren()); return children()->lastChild(); }
48 const RenderObjectChildList* children() const { return &m_children; } function in class:blink::RenderMedia
49 RenderObjectChildList* children() { return &m_children; } function in class:blink::RenderMedia
57 virtual RenderObjectChildList* virtualChildren() OVERRIDE FINAL { return children(); }
58 virtual const RenderObjectChildList* virtualChildren() const OVERRIDE FINAL { return children(); }
62 // FIXME: RenderMedia::layout makes assumptions about what children are allowed
|
| /external/chromium_org/ui/compositor/test/ |
| test_layers.cc | 14 for (std::vector<Layer*>::const_iterator it = parent.children().begin();
15 it != parent.children().end(); ++it) {
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| BaseTree.cs | 41 * actually have any user data. ANTLR v3 uses a list of children approach
43 * an empty node whose children represent the list. An empty, but
49 List<ITree> children; field in class:Antlr.Runtime.Tree.BaseTree
56 * as there are no fields other than the children list, which cannot
57 * be copied as the children are not considered part of this node.
64 * Get the children internal List; note that if you directly mess with
68 public virtual IList<ITree> Children {
70 return children;
78 if (Children == null)
81 return Children.Count
[all...] |
| /cts/tests/tests/view/src/android/view/animation/cts/ |
| AnimationSetTest.java | 78 List<Animation> children = animationSet.getAnimations(); local
79 assertEquals(SHORT_CHILD_DURATION, children.get(0).getDuration());
80 assertEquals(MEDIUM_CHILD_DURATION, children.get(1).getDuration());
81 assertEquals(LONG_CHILD_DURATION, children.get(2).getDuration());
87 children = animationSet.getAnimations();
88 assertEquals(ANIMATIONSET_DURATION, children.get(0).getDuration());
89 assertEquals(ANIMATIONSET_DURATION, children.get(1).getDuration());
90 assertEquals(ANIMATIONSET_DURATION, children.get(2).getDuration());
115 List<Animation> children = animationSet.getAnimations(); local
116 children.get(0).setFillAfter(true)
132 List<Animation> children = animationSet.getAnimations(); local
153 final List<Animation> children = animationSet.getAnimations(); local
176 final List<Animation> children = animationSet.getAnimations(); local
193 final List<Animation> children = animationSet.getAnimations(); local
203 List<Animation> children = animationSet.getAnimations(); local
222 List<Animation> children = animationSet.getAnimations(); local
239 List<Animation> children = animationSet.getAnimations(); local
266 List<Animation> children = animationSet.getAnimations(); local
307 final List<Animation> children = animationSet.getAnimations(); local
337 final List<Animation> children = animationSet.getAnimations(); local
377 final List<Animation> children = animationSet.getAnimations(); local
[all...] |
| /external/chromium_org/ui/wm/core/ |
| window_util_unittest.cc | 28 ASSERT_EQ(2u, window1->layer()->children().size());
39 ASSERT_EQ(1u, tree->root()->children().size());
41 EXPECT_NE(window11->layer(), tree->root()->children()[0]);
42 EXPECT_NE(window12->layer(), tree->root()->children()[0]);
45 ASSERT_EQ(2u, window1->layer()->children().size());
46 EXPECT_EQ(window11->layer(), window1->layer()->children()[0]);
47 EXPECT_EQ(window12->layer(), window1->layer()->children()[1]);
|
| /external/chromium_org/tools/telemetry/telemetry/core/platform/ |
| ps_util.py | 13 pid: The pid for which to get children.
28 children = child_dict[parent]
29 queue.extend(children)
30 child_ids.extend(children)
|
| /external/chromium_org/ui/events/ |
| event_target_iterator.h | 27 explicit EventTargetIteratorImpl(const std::vector<T*>& children)
28 : begin_(children.rbegin()),
29 end_(children.rend()) {
|
| /external/chromium_org/v8/src/ |
| heap-snapshot-generator-inl.h | 39 SLOW_DCHECK(children_index_ < snapshot_->children().length() ||
40 (children_index_ == snapshot_->children().length() &&
42 return &snapshot_->children().first() + children_index_;
|
| /external/deqp/modules/gles2/functional/ |
| es2fShaderExecuteTest.cpp | 58 vector<TestNode*> children = shaderLibrary.loadShaderFile(fileName.c_str()); local
60 for (int i = 0; i < (int)children.size(); i++)
61 addChild(children[i]);
|
