/external/chromium_org/tools/memory_inspector/memory_inspector/classification/ |
H A D | 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), [all...] |
H A D | 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[ [all...] |
/external/chromium_org/tools/grit/grit/tool/ |
H A D | 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[ [all...] |
H A D | 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/ |
H A D | 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/chromium-trace/trace-viewer/src/tcmalloc/ |
H A D | heap_test.js | 78 var childKeys = Object.keys(heap.children); 80 // Both methods exist as children. 85 var trace = heap.children['TestObject::TestMethod']; 89 assertEquals(1, Object.keys(trace.children).length); 90 assertNotNull(trace.children['(here)']); 93 trace = heap.children['TestObject2::TestMethod2']; 97 // Two children, "(here)" and another stack. 98 assertEquals(2, Object.keys(trace.children).length); 99 assertNotNull(trace.children['TestObject3::TestMethod3']); 100 assertNotNull(trace.children['(her [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | 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/ |
H A D | 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[ [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
H A D | 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[inde [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | 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 70 return children; 145 if (children == null || i >= children.Count) 148 return children[ [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | AntlrRuntime_BaseTreeDebugView.cs | 54 ITree[] children = new ITree[_tree.Children.Count]; 55 _tree.Children.CopyTo(children, 0); 56 return children;
|
/external/chromium_org/tools/telemetry/telemetry/core/platform/ |
H A D | 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/third_party/WebKit/Source/web/painting/ |
H A D | ContinuousPainter.cpp | 55 const Vector<GraphicsLayer*>& children = layer->children(); local 57 for (it = children.begin(); it != children.end(); ++it)
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | 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 [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | 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 [all...] |
/external/chromium_org/sync/syncable/ |
H A D | 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 98 const OrderedChildSet* children = parent->second; local [all...] |
/external/chromium_org/chrome/browser/ui/ash/accessibility/ |
H A D | 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/ |
H A D | 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/ |
H A D | 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/ |
H A D | test_layers.cc | 14 for (std::vector<Layer*>::const_iterator it = parent.children().begin(); 15 it != parent.children().end(); ++it) {
|
/external/chromium-trace/trace-viewer/src/tracing/analysis/ |
H A D | analysis_results_test.js | 37 assertEquals('false_value', node.children[0].innerText); 38 assertEquals('false', node.children[1].innerText); 43 assertEquals('true_value', node.children[0].innerText); 44 assertEquals('true', node.children[1].innerText); 49 assertEquals('string_value', node.children[0].innerText); 50 assertEquals('"a string"', node.children[1].innerText); 55 assertEquals('number_value', node.children[0].innerText); 56 assertEquals('12345', node.children[1].innerText); 61 assertEquals('undefined', node.children[0].innerText); 62 assertEquals('', node.children[ [all...] |
/external/chromium_org/ui/wm/core/ |
H A D | 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/valgrind/main/memcheck/tests/ |
H A D | threadname.c | 11 static pthread_t children[3]; variable 40 r = pthread_create(&children[2], NULL, child_fn_2, NULL); 43 r = pthread_join(children[2], NULL); 55 r = pthread_create(&children[1], NULL, child_fn_1, NULL); 58 r = pthread_join(children[1], NULL); 70 r = pthread_create(&children[0], NULL, child_fn_0, NULL); 73 r = pthread_join(children[0], NULL);
|
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
H A D | menu-view.js | 47 if ('children' in origin) { 48 target.children = []; 49 origin.children.forEach(function(originChild) { 51 target.children.push(targetChild); 58 if (!('children' in origin)) 60 if (!('children' in target)) { 61 target.children = origin.children; 65 origin.children.forEach(function(child) { 67 var index = target.children [all...] |
/external/chromium_org/v8/src/ |
H A D | 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_;
|