| /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/webkit/Source/WebCore/dom/ |
| SelectorNodeList.cpp | 46 Vector<RefPtr<Node> > nodes; local
56 nodes.append(element);
63 nodes.append(n);
71 return StaticNodeList::adopt(nodes);
|
| /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();
|
| FuncId.java | 43 * Fill in a list with nodes that match a space delimited list if ID
47 * @param docContext The document where the nodes are being looked for.
49 * @param usedrefs List of references for which nodes were found.
50 * @param nodeSet Node set where the nodes will be added to.
51 * @param mayBeMore true if there is another set of nodes to be looked for.
118 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
119 NodeSetDTM nodeSet = nodes.mutableNodeset();
140 return nodes;
149 return nodes;
|
| /build/core/ |
| node_fns.mk | 123 # $(call get-inherited-nodes,PREFIX,A B)
130 define get-inherited-nodes
153 $(eval ### "Get the list of nodes that this variable inherits") \
200 $(call get-inherited-nodes,$(1).$(2),$(3)))
201 $(call _import-nodes-inner,$(1),$($(1).$(2).inherited),$(3))
218 # $(2): list of makefiles representing nodes to import
223 define _import-nodes-inner
240 # $(2): list of makefiles representing nodes to import
243 define import-nodes
250 $(call _import-nodes-inner,$(_node_import_context),$(_in),$(3))
[all...] |
| /external/chromium/chrome/browser/bookmarks/ |
| 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...] |
| 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.push_back(model_->GetBookmarkBarNode()->GetChild(0))
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...] |
| 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/ |
| State.java | 10 ArrayList nodes; field in class:State
12 State(@SuppressWarnings("hiding") int state, @SuppressWarnings("hiding") ArrayList nodes)
15 this.nodes = nodes;
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| DomFront.java | 39 private final ArrayList<SsaBasicBlock> nodes; field in class:DomFront
64 nodes = meth.getBlocks();
66 int szNodes = nodes.size();
80 int szNodes = nodes.size();
84 SsaBasicBlock node = nodes.get(i);
124 int szNodes = nodes.size();
127 SsaBasicBlock node = nodes.get(i);
152 int szNodes = nodes.size();
159 SsaBasicBlock domParent = nodes.get(info.idom);
160 domParent.addDomChild(nodes.get(i))
[all...] |
| /external/antlr/src/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/doclava/src/com/google/doclava/ |
| Hierarchy.java | 27 HashMap<String, TreeSet<String>> nodes = new HashMap<String, TreeSet<String>>(); local
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.keySet()
[all...] |
| /external/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 17 A nodes; member in struct:B
39 List<BinomialNode<T>*> nodes; member in class:BinomialNode
|
| /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/webkit/Source/WebCore/inspector/front-end/ |
| 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/webkit/Source/WebCore/xml/ |
| 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];
|
| 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, Value::adopt)
200 NodeSet& nodes = v.modifiableNodeSet(); local
[all...] |
| 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)
|
| /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());
|
| /packages/apps/Mms/src/com/android/mms/dom/smil/ |
| ElementSequentialTimeContainerImpl.java | 47 ArrayList<Node> nodes = new ArrayList<Node>(); local
51 nodes.add(allChildren.item(i));
52 return new NodeListImpl(nodes);
55 return new NodeListImpl(nodes);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| PropertyCallback.java | 39 * @param targetNodes the nodes to apply the property to, or null to use the
40 * nodes pass into the
64 final List<? extends INode> nodes = selectedNodes; local
67 for (INode targetNode : nodes) {
|
| /packages/apps/Email/emailcommon/src/org/apache/james/mime4j/field/address/parser/ |
| JJTAddressListParserState.java | 6 private java.util.Stack<Node> nodes; field in class:JJTAddressListParserState
9 private int sp; // number of nodes on stack
14 nodes = new java.util.Stack<Node>();
30 nodes.removeAllElements();
39 return nodes.elementAt(0);
44 nodes.push(n);
54 return nodes.pop();
59 return nodes.peek();
85 children. That number of nodes are popped from the stack and
102 the nodes that have been pushed since the node was opened ar
[all...] |
| /external/antlr/src/org/antlr/runtime/ |
| RecognitionException.java | 92 * imaginary nodes w/o line/col info. We now search backwards looking
124 TreeNodeStream nodes = (TreeNodeStream)input; local
125 this.node = nodes.LT(1);
126 TreeAdaptor adaptor = nodes.getTreeAdaptor();
133 Object priorNode = nodes.LT(i);
144 priorNode = nodes.LT(i);
172 TreeNodeStream nodes = (TreeNodeStream)input; local
173 TreeAdaptor adaptor = nodes.getTreeAdaptor();
|
| /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/llvm/lib/CodeGen/ |
| SpillPlacement.h | 46 Node *nodes; member in class:llvm::SpillPlacement
48 // Nodes that are active in the current computation. Owned by the prepare()
52 // Nodes with active links. Populated by scanActiveBundles.
55 // Nodes that went positive during the last call to scanActiveBundles or
65 SpillPlacement() : MachineFunctionPass(ID), nodes(0) {}
120 /// Return true is there are any positive nodes.
|
