/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/webkit/Source/WebCore/dom/ |
H A D | StaticHashSetNodeList.h | 47 // Adopts the contents of the nodes ListHashSet. 48 static PassRefPtr<StaticHashSetNodeList> adopt(const ListHashSet<RefPtr<Node> >& nodes) argument 50 return adopt(const_cast<ListHashSet<RefPtr<Node> >&>(nodes)); 53 static PassRefPtr<StaticHashSetNodeList> adopt(ListHashSet<RefPtr<Node> >& nodes) argument 55 return adoptRef(new StaticHashSetNodeList(nodes)); 63 StaticHashSetNodeList(ListHashSet<RefPtr<Node> >& nodes);
|
H A D | StaticNodeList.h | 43 // Adopts the contents of the nodes vector. 44 static PassRefPtr<StaticNodeList> adopt(Vector<RefPtr<Node> >& nodes) argument 46 return adoptRef(new StaticNodeList(nodes)); 54 StaticNodeList(Vector<RefPtr<Node> >& nodes) argument 56 m_nodes.swap(nodes);
|
H A D | SelectorNodeList.cpp | 46 Vector<RefPtr<Node> > nodes; local 56 nodes.append(element); 63 nodes.append(n); 71 return StaticNodeList::adopt(nodes);
|
H A D | StaticHashSetNodeList.cpp | 37 StaticHashSetNodeList::StaticHashSetNodeList(ListHashSet<RefPtr<Node> >& nodes) argument 39 m_nodes.swap(nodes);
|
/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...] |
H A D | bookmark_context_menu_controller_unittest.cc | 107 std::vector<const BookmarkNode*> nodes; local 108 nodes.push_back(model_->GetBookmarkBarNode()->GetChild(0)); 110 NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes); 150 std::vector<const BookmarkNode*> nodes; local 151 nodes.push_back(model_->GetBookmarkBarNode()->GetChild(0)); 153 NULL, NULL, profile_.get(), NULL, nodes[0]->parent(), nodes); 169 std::vector<const BookmarkNode*> nodes; local 170 nodes 189 std::vector<const BookmarkNode*> nodes; local 208 std::vector<const BookmarkNode*> nodes; local 228 std::vector<const BookmarkNode*> nodes; local 247 std::vector<const BookmarkNode*> nodes; local 259 std::vector<const BookmarkNode*> nodes; local 286 std::vector<const BookmarkNode*> nodes; local [all...] |
H A D | bookmark_node_data_unittest.cc | 193 // Tests reading/writing of multiple nodes. 208 // Write the nodes to the clipboard. 209 std::vector<const BookmarkNode*> nodes; local 210 nodes.push_back(folder); 211 nodes.push_back(url_node); 212 BookmarkNodeData drag_data(nodes);
|
/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/webkit/Source/WebCore/bindings/v8/custom/ |
H A D | V8NamedNodesCollection.h | 44 static PassRefPtr<NodeList> create(const Vector<RefPtr<Node> >& nodes) argument 46 return adoptRef(new V8NamedNodesCollection(nodes)); 54 explicit V8NamedNodesCollection(const Vector<RefPtr<Node> >& nodes) argument 55 : m_nodes(nodes) { }
|
/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
|
/external/doclava/src/com/google/doclava/ |
H A D | Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); 32 TreeSet<String> me = nodes.get(name); 35 nodes.put(name, me); 41 TreeSet<String> s = nodes.get(sname); 44 nodes.put(sname, s); 51 * Set<String> keys = nodes.keySet(); for (String n: keys) { System.out.println("class: " + n); 53 * TreeSet<String> values = nodes.get(n); for (String v: values) { 57 int depth = depth(nodes, "java.lang.Object"); 62 recurse(nodes, "java.lang.Object", hdf.getChild("classes.0"), depth, depth); 65 Set<String> keys = nodes 76 depth(HashMap<String, TreeSet<String>> nodes, String name) argument 94 recurse(HashMap<String, TreeSet<String>> nodes, String name, Data hdf, int totalDepth, int remainingDepth) argument [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/webkit/Source/WebCore/inspector/front-end/ |
H A D | DOMStorageItemsView.js | 92 var nodes = []; variable 105 nodes.push(node); 110 var length = nodes.length; 112 dataGrid.appendChild(nodes[i]); 115 nodes[0].selected = true;
|
/external/antlr/src/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/llvm/lib/CodeGen/ |
H A D | SpillPlacement.h | 46 Node *nodes; member in class:llvm::SpillPlacement 65 SpillPlacement() : MachineFunctionPass(ID), nodes(0) {} 120 /// Return true is there are any positive nodes.
|
/external/webkit/Source/WebCore/xml/ |
H A D | XPathResult.cpp | 157 const NodeSet& nodes = m_value.toNodeSet(); local 159 return nodes.firstNode(); 161 return nodes.anyNode(); 212 const NodeSet& nodes = m_value.toNodeSet(); local 213 if (index >= nodes.size()) 216 return nodes[index];
|
H A D | XPathPath.cpp | 59 NodeSet& nodes = v.modifiableNodeSet(); local 60 nodes.sort(); 65 evaluationContext.size = nodes.size(); 68 for (unsigned j = 0; j < nodes.size(); j++) { 69 Node* node = nodes[j]; 77 nodes.swap(newNodes); 104 NodeSet nodes; local 105 nodes.append(context); 106 evaluate(nodes); 109 return Value(nodes, Valu 200 NodeSet& nodes = v.modifiableNodeSet(); local [all...] |
H A D | XPathPredicate.cpp | 115 // performing the comparison on the string-values of the two nodes is true. 240 HashSet<Node*> nodes; local 242 nodes.add(resultSet[i]); 246 if (nodes.add(node).second)
|
/external/chromium/chrome/browser/ui/gtk/ |
H A D | custom_drag.cc | 122 const std::vector<const BookmarkNode*>& nodes) 127 nodes_(nodes) { 142 const std::vector<const BookmarkNode*>& nodes) { 143 new BookmarkDrag(profile, nodes); 121 BookmarkDrag(Profile* profile, const std::vector<const BookmarkNode*>& nodes) argument 141 BeginDrag(Profile* profile, const std::vector<const BookmarkNode*>& nodes) argument
|
/external/openssl/crypto/x509v3/ |
H A D | pcy_int.h | 132 /* This structure represents the relationship between nodes */ 140 /* Number of child nodes */ 148 /* nodes at this level */ 149 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st 162 /* Extra policy data when additional nodes (not from the certificate)
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | NodeVector.java | 42 * Array of nodes this points to. 48 * Number of nodes in this NodeVector. 104 * @return Number of nodes in this NodeVector 237 * Push a pair of nodes into the stack. 272 * Pop a pair of nodes from the tail of the stack. 392 * Append the nodes to the list. 394 * @param nodes NodeVector to append to this list 396 public void appendNodes(NodeVector nodes) argument 399 int nNodes = nodes.size(); 417 System.arraycopy(nodes [all...] |
/external/bluetooth/glib/glib/ |
H A D | gbsearcharray.h | 153 guint8 *check = NULL, *nodes = G_BSEARCH_ARRAY_NODES (barray); local 162 check = nodes + i * sizeof_node;
|
/external/chromium/chrome/browser/accessibility/ |
H A D | browser_accessibility.cc | 76 std::vector<BrowserAccessibility*>* nodes) { 77 nodes->push_back(this); 79 children_[i]->DetachTree(nodes); 75 DetachTree( std::vector<BrowserAccessibility*>* nodes) argument
|