/external/chromium_org/chrome/browser/ui/gtk/bookmarks/ |
H A D | bookmark_drag_drop_gtk.cc | 12 const std::vector<const BookmarkNode*>& nodes, 14 DCHECK(!nodes.empty()); 16 BookmarkDrag::BeginDrag(profile, nodes); 11 DragBookmarks(Profile* profile, const std::vector<const BookmarkNode*>& nodes, gfx::NativeView view) argument
|
H A D | bookmark_utils_gtk_unittest.cc | 14 std::vector<const BookmarkNode*> nodes; local 15 nodes = bookmark_utils::GetNodesFromSelection(NULL, NULL, 0, NULL, NULL, 17 EXPECT_EQ(0u, nodes.size()); 22 nodes = bookmark_utils::GetNodesFromSelection(NULL, &data, 0, NULL, NULL, 24 EXPECT_EQ(0u, nodes.size()); 26 nodes = bookmark_utils::GetNodesFromSelection(NULL, NULL, 28 EXPECT_EQ(0u, nodes.size()); 32 nodes = bookmark_utils::GetNodesFromSelection(NULL, &data, 34 EXPECT_EQ(0u, nodes.size()); 39 nodes [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
H A D | State.java | 10 ArrayList nodes; field in class:State 12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes) argument 15 this.nodes = nodes;
|
/external/chromium_org/chrome/browser/ui/bookmarks/ |
H A D | 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...] |
H A D | bookmark_context_menu_controller_unittest.cc | 101 std::vector<const BookmarkNode*> nodes; local 102 nodes.push_back(model_->bookmark_bar_node()->GetChild(0)); 104 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes); 143 std::vector<const BookmarkNode*> nodes; local 144 nodes.push_back(model_->bookmark_bar_node()->GetChild(0)); 146 NULL, NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes); 162 std::vector<const BookmarkNode*> nodes; local 163 nodes 182 std::vector<const BookmarkNode*> nodes; local 201 std::vector<const BookmarkNode*> nodes; local 221 std::vector<const BookmarkNode*> nodes; local 240 std::vector<const BookmarkNode*> nodes; local 252 std::vector<const BookmarkNode*> nodes; local 281 std::vector<const BookmarkNode*> nodes; local 299 std::vector<const BookmarkNode*> nodes; local [all...] |
/external/chromium/chrome/browser/ui/gtk/bookmarks/ |
H A D | 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 [all...] |
/external/chromium_org/third_party/jinja2/ |
H A D | meta.py | 12 from jinja2 import nodes namespace 71 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import, 72 nodes.Include)): 73 if not isinstance(node.template, nodes.Const): 75 if isinstance(node.template, (nodes.Tuple, nodes.List)): 79 if isinstance(template_name, nodes.Const): 95 elif isinstance(node, nodes [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | 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 [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | 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 [all...] |
/external/chromium_org/chrome/browser/bookmarks/ |
H A D | 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); 72 EXPECT_EQ(nodes, tracke 82 BookmarkExpandedStateTracker::Nodes nodes; local [all...] |
H A D | bookmark_expanded_state_tracker.cc | 25 void BookmarkExpandedStateTracker::SetExpandedNodes(const Nodes& nodes) { argument 26 UpdatePrefs(nodes); 31 Nodes nodes; local 33 return nodes; 36 return nodes; 41 return nodes; 51 nodes.insert(node); 57 UpdatePrefs(nodes); 58 return nodes; 86 // Ask for the nodes agai 96 UpdatePrefs(const Nodes& nodes) argument [all...] |
H A D | bookmark_utils.cc | 48 // Comparison function that compares based on date modified of the two nodes. 97 const std::vector<const BookmarkNode*>& nodes, 99 if (nodes.empty()) 102 BookmarkNodeData(nodes).WriteToClipboard(); 105 for (size_t i = 0; i < nodes.size(); ++i) { 106 int index = nodes[i]->parent()->GetIndexOf(nodes[i]); 108 model->Remove(nodes[i]->parent(), index); 142 std::vector<const BookmarkNode*> nodes; local 150 nodes 96 CopyToClipboard(BookmarkModel* model, const std::vector<const BookmarkNode*>& nodes, bool remove_nodes) argument 184 GetMostRecentlyAddedEntries(BookmarkModel* model, size_t count, std::vector<const BookmarkNode*>* nodes) argument 207 GetBookmarksContainingText(BookmarkModel* model, const string16& text, size_t max_count, const std::string& languages, std::vector<const BookmarkNode*>* nodes) argument [all...] |
H A D | bookmark_utils_unittest.cc | 43 std::vector<const BookmarkNode*> nodes; local 45 &model, ASCIIToUTF16("foo"), 100, string(), &nodes); 46 ASSERT_EQ(1U, nodes.size()); 47 EXPECT_TRUE(nodes[0] == n1); 49 nodes.clear(); 52 &model, ASCIIToUTF16("cnn"), 100, string(), &nodes); 53 ASSERT_EQ(1U, nodes.size()); 54 EXPECT_TRUE(nodes[0] == n2); 56 nodes.clear(); 59 &model, ASCIIToUTF16("foo bar"), 100, string(), &nodes); 140 std::vector<const BookmarkNode*> nodes; local 163 std::vector<const BookmarkNode*> nodes; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | NamedNodesCollection.h | 44 static PassRefPtr<NodeList> create(const Vector<RefPtr<Node> >& nodes) argument 46 return adoptRef(new NamedNodesCollection(nodes)); 54 explicit NamedNodesCollection(const Vector<RefPtr<Node> >& nodes) argument 55 : m_nodes(nodes) { }
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | 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 [all...] |
/external/chromium/chrome/browser/ui/views/bookmarks/ |
H A D | 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 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/chrome/test/pyautolib/ |
H A D | bookmark_model.py | 36 """Return a count of bookmark nodes, including folders. 53 def FindByID(self, id, nodes=None): 58 nodes: an iterable of nodes to start with. If not specified, search all. 63 if nodes == None: 64 nodes = self.bookdict['roots'].values() 67 for node in nodes: 77 def FindByTitle(self, title, nodes=None): 78 """Return a tuple of all nodes which have |title| in their title. 82 node: an iterable of nodes t [all...] |
/external/llvm/utils/ |
H A D | 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[ [all...] |
/external/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathPath.cpp | 57 NodeSet& nodes = v.modifiableNodeSet(); local 58 nodes.sort(); 63 evaluationContext.size = nodes.size(); 66 for (unsigned j = 0; j < nodes.size(); j++) { 67 Node* node = nodes[j]; 75 nodes.swap(newNodes); 112 NodeSet nodes; local 113 nodes.append(context); 114 evaluate(nodes); 117 return Value(nodes, Valu 208 NodeSet& nodes = v.modifiableNodeSet(); local [all...] |
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestTopologicalSort.java | 53 List nodes = g.sort(); 54 String result = nodes.toString(); 67 List nodes = g.sort(); 68 String result = nodes.toString(); 81 List nodes = g.sort(); 82 String result = nodes.toString(); 95 List nodes = g.sort(); 96 String result = nodes.toString(); 109 List nodes = g.sort(); 110 String result = nodes [all...] |
/external/llvm/lib/CodeGen/ |
H A D | 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[]) { argument 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[ [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/functions/ |
H A D | FuncSum.java | 49 DTMIterator nodes = m_arg0.asIterator(xctxt, xctxt.getCurrentNode()); 53 while (DTM.NULL != (pos = nodes.nextNode())) 55 DTM dtm = nodes.getDTM(pos); 61 nodes.detach();
|
/external/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_utils_unittest.cc | 32 std::vector<const BookmarkNode*> nodes; local 34 &model, ASCIIToUTF16("foo"), 100, std::string(), &nodes); 35 ASSERT_EQ(1U, nodes.size()); 36 EXPECT_TRUE(nodes[0] == n1); 39 nodes.clear(); 42 &model, ASCIIToUTF16("cnn"), 100, std::string(), &nodes); 43 ASSERT_EQ(1U, nodes.size()); 44 EXPECT_TRUE(nodes[0] == n2); 47 nodes.clear(); 50 &model, ASCIIToUTF16("foo bar"), 100, std::string(), &nodes); 115 std::vector<const BookmarkNode*> nodes; local [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable 47 @property (retain) AMutableArray *nodes; variable
|
/external/clang/test/CodeGenCXX/ |
H A D | constructor-template.cpp | 17 A nodes; member in struct:B 39 List<BinomialNode<T>*> nodes; member in class:BinomialNode
|