| /external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
| test-tree-wizard.rb | 254 @wizard.visit( tree, B ) do |node, parent, child_index, labels|
266 @wizard.visit( tree, C ) do |node, parent, child_index, labels|
278 @wizard.visit( tree, B ) do |node, parent, child_index, labels|
290 @wizard.visit( tree, A ) do |node, parent, child_index, labels|
305 @wizard.visit( tree, B ) do |node, parent, child_index, labels|
306 elements << context(node, parent, child_index)
317 @wizard.visit( tree, A ) do |node, parent, child_index, labels|
318 elements << context(node, parent, child_index)
328 @wizard.visit(tree, '(A B)') do |node, parent, child_index, labels|
340 @wizard.visit(tree, '(A B)') do |node, parent, child_index, labels
[all...] |
| test-trees.rb | 53 root_0.child_index.should == -1
54 t.child_index.should == 0
55 u.child_index.should == 1
469 t.child_index.should == -1
480 r0.child_index.should == -1
494 r0.child_index.should == -1
496 c0.child_index.should == 0
498 c1.child_index.should == 1
500 c2.child_index.should == 2
517 root.child_index.should == -
[all...] |
| /external/chromium/chrome/browser/accessibility/ |
| browser_accessibility.cc | 101 BrowserAccessibility* BrowserAccessibility::GetChild(uint32 child_index) {
102 DCHECK(child_index < children_.size());
103 return children_[child_index];
|
| browser_accessibility.h | 84 BrowserAccessibility* GetChild(uint32 child_index);
|
| browser_accessibility_win.cc | 1030 unsigned int child_index,
1038 if (child_index < children_.size()) {
1039 *node = children_[child_index]->toBrowserAccessibilityWin()->NewReference();
[all...] |
| browser_accessibility_win.h | 377 unsigned int child_index,
|
| /external/chromium/chrome/browser/ui/webui/ |
| cookies_tree_model_util.cc | 204 int child_index = -1; local
211 child_index = parent->GetIndexOf(child);
212 if (child_index == -1)
218 return child_index >= 0 ? child : NULL;
|
| /external/netperf/ |
| netcpu_looper.c | 177 sit_and_spin(int child_index)
190 child_index,
200 PAGES_PER_CHILD * child_index));
215 bind_to_specific_processor(child_index % lib_num_loc_cpus,1);
|
| /external/v8/src/ |
| profile-generator.cc | 934 int child_index, Type type, const char* name, HeapEntry* to) {
939 child_index_ = child_index;
946 void HeapGraphEdge::Init(int child_index, Type type, int index, HeapEntry* to) {
948 child_index_ = child_index;
955 void HeapGraphEdge::Init(int child_index, int index, HeapEntry* to) {
956 Init(child_index, kElement, index, to);
986 int child_index,
990 children()[child_index].Init(child_index, type, name, entry);
991 entry->retainers()[retainer_index] = children_arr() + child_index;
2993 int child_index, retainer_index; local
3004 int child_index, retainer_index; local
3016 int child_index, retainer_index; local
3027 int child_index, retainer_index; local
[all...] |
| profile-generator.h | 465 void Init(int child_index, Type type, const char* name, HeapEntry* to);
466 void Init(int child_index, Type type, int index, HeapEntry* to);
467 void Init(int child_index, int index, HeapEntry* to);
569 int child_index,
574 int child_index,
578 void SetUnidirElementReference(int child_index, int index, HeapEntry* entry);
[all...] |
| liveedit-debugger.js | 605 var child_index = 0;
611 if (child_index < info_node.children.length) {
612 var child = info_node.children[child_index];
616 child_index++;
631 child_index++;
638 child_index++;
656 while (child_index < info_node.children.length) {
657 var child = info_node.children[child_index];
659 child_index++;
[all...] |
| objects.cc | 5848 int child_index = 2 * parent_index + 1; local
5873 int child_index = parent_index * 2 + 1; local
10212 int child_index = i; local
10233 int child_index = ((parent_index + 1) << 1) - 1; local
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
| wizard.rb | 387 index = @adaptor.child_index( tree )
396 index = @adaptor.child_index( tree )
410 visit( tree, pattern.type ) do | tree, parent, child_index, labels |
412 yield( tree, parent, child_index, labels )
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| error.rb | 571 2. A node has a child at index +n+, but the child's +@child_index+ value is not
|
| tree.rb | 226 attr_accessor :child_index
320 @child_index = 0
339 child.child_index = length + index
343 child_tree.child_index = length
352 @child_index = -1
363 tree.child_index = index
393 node.child_index = i
401 i == @child_index or
402 raise TreeInconsistency.failed_index_check!( i, @child_index )
477 @child_index = -
698 def child_index( tree ) method in class:ANTLR3.CommonTree.TreeAdaptor
[all...] |
