| /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/webkit/Source/WebCore/dom/ |
| StaticHashSetNodeList.h | 47 // Adopts the contents of the nodes ListHashSet.
48 static PassRefPtr<StaticHashSetNodeList> adopt(const ListHashSet<RefPtr<Node> >& nodes)
50 return adopt(const_cast<ListHashSet<RefPtr<Node> >&>(nodes));
53 static PassRefPtr<StaticHashSetNodeList> adopt(ListHashSet<RefPtr<Node> >& nodes)
55 return adoptRef(new StaticHashSetNodeList(nodes));
63 StaticHashSetNodeList(ListHashSet<RefPtr<Node> >& nodes);
|
| StaticNodeList.h | 43 // Adopts the contents of the nodes vector.
44 static PassRefPtr<StaticNodeList> adopt(Vector<RefPtr<Node> >& nodes)
46 return adoptRef(new StaticNodeList(nodes));
54 StaticNodeList(Vector<RefPtr<Node> >& nodes)
56 m_nodes.swap(nodes);
|
| /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/bindings/v8/custom/ |
| V8NamedNodesCollection.h | 44 static PassRefPtr<NodeList> create(const Vector<RefPtr<Node> >& nodes)
46 return adoptRef(new V8NamedNodesCollection(nodes));
54 explicit V8NamedNodesCollection(const Vector<RefPtr<Node> >& nodes)
55 : m_nodes(nodes) { }
|
| /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/webkit/Source/WebCore/xml/ |
| 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...] |
| /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/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/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 66 /// value can change when linked nodes change, but convergence is very fast
90 /// from ingoing and outgoing nodes separately add up to a most 1. The weight
97 // Undecided nodes (Value==0) go on the stack.
146 bool update(const Node nodes[]) {
150 Sum += I->first * nodes[I->second].Value;
175 assert(!nodes && "Leaking node array");
176 nodes = new Node[bundles->getNumBundles()];
185 nodes[bundles->getBundle(Num, 1)].Scale[0] += Freq;
186 nodes[bundles->getBundle(Num, 0)].Scale[1] += Freq;
192 if (nodes[i].Scale[d] > 0
[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/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();
|
| /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...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable
47 @property (retain) AMutableArray *nodes; variable
|
| /external/clang/test/CodeGenCXX/ |
| 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/ |
| 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...] |
| /packages/apps/Email/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/openssl/crypto/x509v3/ |
| pcy_node.c | 76 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes,
86 idx = sk_X509_POLICY_NODE_find(nodes, &l);
90 return sk_X509_POLICY_NODE_value(nodes, idx);
100 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++)
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
135 if (!level->nodes)
136 level->nodes = policy_node_cmp_new();
137 if (!level->nodes)
139 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
|
| /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/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| Main.java | 15 CommonTreeNodeStream nodes = new CommonTreeNodeStream(r0); local
16 nodes.setTokenStream(tokens);
17 LangDumpDecl walker = new LangDumpDecl(nodes);
|
| /external/dexmaker/src/dx/java/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...] |
