| /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_unittest.cc | 32 initial_state.nodes.push_back(root);
33 initial_state.nodes.push_back(button);
34 initial_state.nodes.push_back(checkbox);
68 initial_state.nodes.push_back(root);
75 update.nodes.resize(1);
76 update.nodes[0].id = 1;
77 update.nodes[0].id = AX_ROLE_ROOT_WEB_AREA;
84 initial_state.nodes.resize(3);
85 initial_state.nodes[0].id = 1;
86 initial_state.nodes[0].role = AX_ROLE_ROOT_WEB_AREA
[all...] |
| ax_tree_update.h | 44 // or 0 if no nodes should be cleared. Clearing a node means deleting
50 // A vector of nodes to update, according to the rules above.
51 std::vector<AXNodeData> nodes; member in struct:ui::AXTreeUpdate
|
| /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/third_party/WebKit/Source/core/dom/ |
| NamedNodesCollection.h | 44 static PassRefPtr<NodeList> create(const Vector<RefPtr<Node> >& nodes)
46 return adoptRef(new NamedNodesCollection(nodes));
54 explicit NamedNodesCollection(const Vector<RefPtr<Node> >& nodes)
55 : m_nodes(nodes) { }
|
| /external/chromium_org/chrome/browser/ui/bookmarks/ |
| bookmark_ui_utils_unittest.cc | 19 std::vector<const BookmarkNode*> nodes; local
21 // This tests that |nodes| contains an URL.
25 nodes.push_back(page1);
26 EXPECT_TRUE(chrome::HasBookmarkURLs(nodes));
28 nodes.clear();
30 // This tests that |nodes| does not contain any URL.
33 nodes.push_back(folder1);
34 EXPECT_FALSE(chrome::HasBookmarkURLs(nodes));
38 EXPECT_TRUE(chrome::HasBookmarkURLs(nodes));
53 EXPECT_FALSE(chrome::HasBookmarkURLs(nodes));
60 std::vector<const BookmarkNode*> nodes; local
[all...] |
| bookmark_context_menu_controller_unittest.cc | 108 std::vector<const BookmarkNode*> nodes; local
109 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
111 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
150 std::vector<const BookmarkNode*> nodes; local
151 nodes.push_back(model_->bookmark_bar_node()->GetChild(0));
153 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
169 std::vector<const BookmarkNode*> nodes; local
170 nodes.push_back(model_->bookmark_bar_node()->GetChild(0))
189 std::vector<const BookmarkNode*> nodes; local
208 std::vector<const BookmarkNode*> nodes; local
228 std::vector<const BookmarkNode*> nodes; local
249 std::vector<const BookmarkNode*> nodes; local
260 std::vector<const BookmarkNode*> nodes; local
289 std::vector<const BookmarkNode*> nodes; local
307 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /external/chromium/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_utils_gtk_unittest.cc | 10 std::vector<const BookmarkNode*> nodes; local
11 nodes = bookmark_utils::GetNodesFromSelection(NULL, NULL, 0, NULL, NULL,
13 EXPECT_EQ(0u, nodes.size());
18 nodes = bookmark_utils::GetNodesFromSelection(NULL, &data, 0, NULL, NULL,
20 EXPECT_EQ(0u, nodes.size());
22 nodes = bookmark_utils::GetNodesFromSelection(NULL, NULL,
24 EXPECT_EQ(0u, nodes.size());
28 nodes = bookmark_utils::GetNodesFromSelection(NULL, &data,
30 EXPECT_EQ(0u, nodes.size());
35 nodes = bookmark_utils::GetNodesFromSelection(NULL, &data
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_utils_unittest.cc | 48 std::vector<const BookmarkNode*> nodes; local
50 &model, ASCIIToUTF16("foo"), 100, string(), &nodes);
51 ASSERT_EQ(2U, nodes.size());
52 EXPECT_TRUE(nodes[0] == folder1);
53 EXPECT_TRUE(nodes[1] == node1);
54 nodes.clear();
57 &model, ASCIIToUTF16("cnn"), 100, string(), &nodes);
58 ASSERT_EQ(1U, nodes.size());
59 EXPECT_TRUE(nodes[0] == node2);
60 nodes.clear()
77 std::vector<const BookmarkNode*> nodes; local
100 std::vector<const BookmarkNode*> nodes; local
[all...] |
| bookmark_expanded_state_tracker_unittest.cc | 56 BookmarkExpandedStateTracker::Nodes nodes; local
57 nodes.insert(model->bookmark_bar_node());
58 tracker->SetExpandedNodes(nodes);
59 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
64 nodes.insert(n1);
65 tracker->SetExpandedNodes(nodes);
66 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
68 // Remove the folder, which should remove it from the list of expanded nodes.
70 nodes.erase(n1)
82 BookmarkExpandedStateTracker::Nodes nodes; local
[all...] |
| bookmark_expanded_state_tracker.cc | 25 void BookmarkExpandedStateTracker::SetExpandedNodes(const Nodes& nodes) {
26 UpdatePrefs(nodes);
29 BookmarkExpandedStateTracker::Nodes
31 Nodes nodes; local
33 return nodes;
36 return nodes;
41 return nodes;
51 nodes.insert(node)
[all...] |
| bookmark_utils.cc | 58 // Comparison function that compares based on date modified of the two nodes.
114 const std::vector<const BookmarkNode*>& nodes,
116 if (nodes.empty())
119 BookmarkNodeData(nodes).WriteToClipboard(ui::CLIPBOARD_TYPE_COPY_PASTE);
122 for (size_t i = 0; i < nodes.size(); ++i) {
123 int index = nodes[i]->parent()->GetIndexOf(nodes[i]);
125 model->Remove(nodes[i]->parent(), index);
154 std::vector<const BookmarkNode*> nodes; local
162 nodes.push_back(parent)
[all...] |
| /external/chromium_org/chrome/browser/ui/gtk/bookmarks/ |
| bookmark_drag_drop_gtk.cc | 21 BookmarkDrag(Profile* profile, const std::vector<const BookmarkNode*>& nodes);
41 const std::vector<const BookmarkNode*>& nodes)
44 nodes_(nodes) {}
51 const std::vector<const BookmarkNode*>& nodes,
53 DCHECK(!nodes.empty());
57 new BookmarkDrag(profile, nodes);
|
| bookmark_utils_gtk_unittest.cc | 16 std::vector<const BookmarkNode*> nodes; local
17 nodes = GetNodesFromSelection(NULL, NULL, 0, NULL, NULL, NULL);
18 EXPECT_EQ(0u, nodes.size());
23 nodes = GetNodesFromSelection(NULL, &data, 0, NULL, NULL, NULL);
24 EXPECT_EQ(0u, nodes.size());
26 nodes = GetNodesFromSelection(
28 EXPECT_EQ(0u, nodes.size());
32 nodes = GetNodesFromSelection(
34 EXPECT_EQ(0u, nodes.size());
39 nodes = GetNodesFromSelection
[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/chrome/browser/ui/views/bookmarks/ |
| bookmark_context_menu_test.cc | 112 std::vector<const BookmarkNode*> nodes; local
113 nodes.push_back(model_->GetBookmarkBarNode()->GetChild(0));
115 NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
155 std::vector<const BookmarkNode*> nodes; local
156 nodes.push_back(model_->GetBookmarkBarNode()->GetChild(0));
158 NULL, profile_.get(), NULL, nodes[0]->parent(), nodes);
173 std::vector<const BookmarkNode*> nodes; local
174 nodes.push_back(model_->GetBookmarkBarNode()->GetChild(0))
192 std::vector<const BookmarkNode*> nodes; local
211 std::vector<const BookmarkNode*> nodes; local
231 std::vector<const BookmarkNode*> nodes; local
249 std::vector<const BookmarkNode*> nodes; local
261 std::vector<const BookmarkNode*> nodes; local
287 std::vector<const BookmarkNode*> nodes; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathPath.cpp | 56 NodeSet& nodes = v.modifiableNodeSet(); local
57 nodes.sort();
62 evaluationContext.size = nodes.size();
65 for (unsigned j = 0; j < nodes.size(); j++) {
66 Node* node = nodes[j];
74 nodes.swap(newNodes);
111 NodeSet nodes; local
112 nodes.append(context);
113 evaluate(nodes);
116 return Value(nodes, Value::adopt)
207 NodeSet& nodes = v.modifiableNodeSet(); 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...] |
| /libcore/luni/src/main/java/java/util/prefs/ |
| NodeSet.java | 12 public NodeSet(Iterator<Node> nodes) {
13 while(nodes.hasNext()) {
14 list.add(nodes.next());
|
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 72 /// value can change when linked nodes change, but convergence is very fast
97 // Undecided nodes (Value==0) go on the stack.
151 bool update(const Node nodes[]) {
156 if (nodes[I->second].Value == -1)
158 else if (nodes[I->second].Value == 1)
186 assert(!nodes && "Leaking node array");
187 nodes = new Node[bundles->getNumBundles()];
202 delete[] nodes;
203 nodes = 0;
211 nodes[n].clear()
[all...] |
