| /external/chromium_org/tools/gyp/pylib/gyp/ |
| input_test.py | 16 self.nodes = {}
18 self.nodes[x] = gyp.input.DependencyGraphNode(x)
25 for label, node in self.nodes.iteritems():
29 self._create_dependency(self.nodes['a'], self.nodes['b'])
30 self._create_dependency(self.nodes['b'], self.nodes['c'])
31 self._create_dependency(self.nodes['c'], self.nodes['d'])
33 for label, node in self.nodes.iteritems()
[all...] |
| /external/chromium_org/ui/accessibility/ |
| ax_tree_serializer_unittest.cc | 66 treedata0_.nodes.resize(3);
67 treedata0_.nodes[0].id = 1;
68 treedata0_.nodes[0].role = AX_ROLE_ROOT_WEB_AREA;
69 treedata0_.nodes[0].child_ids.push_back(2);
70 treedata0_.nodes[0].child_ids.push_back(3);
71 treedata0_.nodes[1].id = 2;
72 treedata0_.nodes[2].id = 3;
75 treedata1_.nodes.resize(4);
76 treedata1_.nodes[0].id = 1;
77 treedata1_.nodes[0].role = AX_ROLE_ROOT_WEB_AREA
[all...] |
| ax_tree_update.cc | 25 // The challenge here is that we want to indent the nodes being updated
28 // relative indentation of child nodes in this update relative to their
31 for (size_t i = 0; i < nodes.size(); ++i) {
32 int indent = id_to_indentation[nodes[i].id];
34 result += nodes[i].ToString() + "\n";
35 for (size_t j = 0; j < nodes[i].child_ids.size(); ++j)
36 id_to_indentation[nodes[i].child_ids[j]] = indent + 1;
|
| ax_tree_unittest.cc | 83 initial_state.nodes.push_back(root);
84 initial_state.nodes.push_back(button);
85 initial_state.nodes.push_back(checkbox);
144 update.nodes.push_back(list);
145 update.nodes.push_back(list_item_2);
146 update.nodes.push_back(list_item_3);
147 update.nodes.push_back(button);
163 initial_state.nodes.push_back(root);
170 update.nodes.resize(1);
171 update.nodes[0].id = 1
[all...] |
| tree_generator.cc | 42 // Build an AXTreeUpdate. The first two nodes of the tree always
45 update.nodes.resize(node_count_);
46 update.nodes[0].id = permuted[0];
47 update.nodes[0].role = AX_ROLE_ROOT_WEB_AREA;
48 update.nodes[0].state = AX_STATE_NONE;
49 update.nodes[0].child_ids.push_back(permuted[1]);
50 update.nodes[1].id = permuted[1];
51 update.nodes[1].state = AX_STATE_NONE;
53 // The remaining nodes are assigned based on their parent
56 update.nodes[i].id = permuted[i]
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| State.java | 10 ArrayList nodes; field in class:State
12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes)
15 this.nodes = nodes;
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| dom_predicates.js | 7 * nodes with the unique ancestors of a node. They output true if a
17 * @param {Array.<Node>} nodes An array of nodes to check.
20 cvox.DomPredicates.checkboxPredicate = function(nodes) {
21 for (var i = 0; i < nodes.length; i++) {
22 if ((nodes[i].getAttribute &&
23 nodes[i].getAttribute('role') == 'checkbox') ||
24 (nodes[i].tagName == 'INPUT' && nodes[i].type == 'checkbox')) {
25 return nodes[i]
[all...] |
| /external/chromium_org/extensions/browser/ |
| content_hash_tree_unittest.cc | 27 std::vector<std::string> nodes; local
29 EXPECT_EQ(std::string(), ComputeTreeHashRoot(nodes, 16));
33 nodes.push_back(node1);
34 EXPECT_EQ(node1, ComputeTreeHashRoot(nodes, 16));
36 // Two nodes.
38 nodes.push_back(node2);
45 EXPECT_EQ(expected, ComputeTreeHashRoot(nodes, 16));
49 std::vector<std::string> nodes; local
52 nodes.push_back(FakeSignatureWithSeed(i));
61 crypto::SHA256HashString(nodes[0] + nodes[1] + nodes[2])
[all...] |
| /external/chromium_org/content/public/browser/ |
| ax_event_notification_details.cc | 11 const std::vector<ui::AXNodeData>& nodes,
17 nodes(nodes),
|
| ax_event_notification_details.h | 21 const std::vector<ui::AXNodeData>& nodes,
30 std::vector<ui::AXNodeData> nodes; member in struct:content::AXEventNotificationDetails
|
| /external/chromium_org/chrome/browser/ui/bookmarks/ |
| bookmark_ui_utils_unittest.cc | 23 std::vector<const BookmarkNode*> nodes; local
25 // This tests that |nodes| contains an URL.
30 nodes.push_back(page1);
31 EXPECT_TRUE(chrome::HasBookmarkURLs(nodes));
33 nodes.clear();
35 // This tests that |nodes| does not contain any URL.
38 nodes.push_back(folder1);
39 EXPECT_FALSE(chrome::HasBookmarkURLs(nodes));
43 EXPECT_TRUE(chrome::HasBookmarkURLs(nodes));
58 EXPECT_FALSE(chrome::HasBookmarkURLs(nodes));
66 std::vector<const BookmarkNode*> nodes; local
[all...] |
| bookmark_context_menu_controller_unittest.cc | 104 std::vector<const BookmarkNode*> nodes; local
105 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
107 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
146 std::vector<const BookmarkNode*> nodes; local
147 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
149 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
165 std::vector<const BookmarkNode*> nodes; local
166 nodes.push_back(model_->bookmark_bar_node()->GetChild(0))
185 std::vector<const BookmarkNode*> nodes; local
204 std::vector<const BookmarkNode*> nodes; local
224 std::vector<const BookmarkNode*> nodes; local
251 std::vector<const BookmarkNode*> nodes; local
262 std::vector<const BookmarkNode*> nodes; local
291 std::vector<const BookmarkNode*> nodes; local
309 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_expanded_state_tracker.cc | 27 void BookmarkExpandedStateTracker::SetExpandedNodes(const Nodes& nodes) {
28 UpdatePrefs(nodes);
31 BookmarkExpandedStateTracker::Nodes
33 Nodes nodes; local
35 return nodes;
38 return nodes;
43 return nodes;
54 nodes.insert(node)
[all...] |
| bookmark_utils_unittest.cc | 89 std::vector<const BookmarkNode*> nodes; local
92 // No nodes are returned for empty string.
94 GetBookmarksMatchingProperties(model.get(), query, 100, string(), &nodes);
95 EXPECT_TRUE(nodes.empty());
96 nodes.clear();
98 // No nodes are returned for space-only string.
100 GetBookmarksMatchingProperties(model.get(), query, 100, string(), &nodes);
101 EXPECT_TRUE(nodes.empty());
102 nodes.clear();
106 GetBookmarksMatchingProperties(model.get(), query, 100, string(), &nodes);
148 std::vector<const BookmarkNode*> nodes; local
185 std::vector<const BookmarkNode*> nodes; local
222 std::vector<const BookmarkNode*> nodes; local
299 std::vector<const BookmarkNode*> nodes; local
328 std::vector<const BookmarkNode*> nodes; local
371 std::vector<const BookmarkNode*> nodes; local
401 std::vector<const BookmarkNode*> nodes; local
420 std::vector<const BookmarkNode*> nodes; local
510 std::vector<const BookmarkNode*> nodes; local
[all...] |
| bookmark_expanded_state_tracker_unittest.cc | 80 BookmarkExpandedStateTracker::Nodes nodes; local
81 nodes.insert(model_->bookmark_bar_node());
82 tracker->SetExpandedNodes(nodes);
83 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
88 nodes.insert(n1);
89 tracker->SetExpandedNodes(nodes);
90 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
92 // Remove the folder, which should remove it from the list of expanded nodes.
94 nodes.erase(n1)
105 BookmarkExpandedStateTracker::Nodes nodes; local
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeIterator.java | 36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected FastQueue nodes; field in class:TreeIterator
65 nodes = new FastQueue();
74 nodes.clear();
79 if ( nodes!=null && nodes.size()>0 ) return true
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| graph.h | 30 // Factories for nodes with static input counts.
36 Node* nodes[] = {n1, n2}; local
37 return NewNode(op, arraysize(nodes), nodes);
40 Node* nodes[] = {n1, n2, n3}; local
41 return NewNode(op, arraysize(nodes), nodes);
44 Node* nodes[] = {n1, n2, n3, n4}; local
45 return NewNode(op, arraysize(nodes), nodes);
49 Node* nodes[] = {n1, n2, n3, n4, n5}; local
54 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 53 List nodes = g.sort(); local
54 String result = nodes.toString();
67 List nodes = g.sort(); local
68 String result = nodes.toString();
81 List nodes = g.sort(); local
82 String result = nodes.toString();
95 List nodes = g.sort(); local
96 String result = nodes.toString();
109 List nodes = g.sort(); local
110 String result = nodes.toString()
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| meta.py | 12 from jinja2 import nodes namespace
72 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import,
73 nodes.Include)):
74 if not isinstance(node.template, nodes.Const):
76 if isinstance(node.template, (nodes.Tuple, nodes.List)):
80 if isinstance(template_name, nodes.Const):
96 elif isinstance(node, nodes.Include) and
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 36 /** Return a node stream from a doubly-linked tree whose nodes
39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
47 // navigation nodes to return during walk and at end
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
55 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
65 nodes = new Queue<object>();
95 nodes.Enqueue(eof);
100 if (nodes != null && nodes.Count > 0)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeIterator.cs | 37 /** Return a node stream from a doubly-linked tree whose nodes
40 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
50 // navigation nodes to return during walk and at end
55 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
58 protected Queue<object> nodes; field in class:Antlr.Runtime.Tree.TreeIterator
70 nodes = new Queue<object>();
105 nodes.Enqueue( eof );
112 if ( nodes != null && nodes.Count > 0
[all...] |
| /external/llvm/utils/ |
| DSAextract.py | 3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
35 <output_file> [list of nodes to extract]'
66 #for the node (it will be Node(hex number)) to our set of nodes
96 #check to make sure that both nodes are in the node list
98 nodes = arrowexp.split(buffer) variable
99 nodes[0] = string.strip(nodes[0])
100 nodes[1] = string.strip(nodes[1]
[all...] |
| /external/chromium_org/chrome/browser/ui/views/bookmarks/ |
| bookmark_context_menu_unittest.cc | 125 std::vector<const BookmarkNode*> nodes; local
126 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
128 NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes, false);
177 std::vector<const BookmarkNode*> nodes; local
178 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
180 NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes, false);
195 std::vector<const BookmarkNode*> nodes; local
196 nodes.push_back(model_->bookmark_bar_node()->GetChild(0))
214 std::vector<const BookmarkNode*> nodes; local
233 std::vector<const BookmarkNode*> nodes; local
253 std::vector<const BookmarkNode*> nodes; local
271 std::vector<const BookmarkNode*> nodes; local
283 std::vector<const BookmarkNode*> nodes; local
311 std::vector<const BookmarkNode*> nodes; local
344 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 90 /// value can change when linked nodes change, but convergence is very fast
115 // Undecided nodes (Value==0) go on the stack.
169 bool update(const Node nodes[]) {
174 if (nodes[I->second].Value == -1)
176 else if (nodes[I->second].Value == 1)
204 assert(!nodes && "Leaking node array");
205 nodes = new Node[bundles->getNumBundles()];
221 delete[] nodes;
222 nodes = nullptr;
230 nodes[n].clear()
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncSum.java | 49 DTMIterator nodes = m_arg0.asIterator(xctxt, xctxt.getCurrentNode()); local
53 while (DTM.NULL != (pos = nodes.nextNode()))
55 DTM dtm = nodes.getDTM(pos);
61 nodes.detach();
|
