/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/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/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...] |
H A D | BufferedTreeNodeStream.cs | 41 /** <summary>A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.</summary> 43 * This node stream sucks all nodes out of the tree specified in 46 * includes pointers to DOWN and UP and EOF nodes. 80 if (_index < _outer.nodes.Count) 81 return _outer.nodes[_index]; 99 if (_index < _outer.nodes.Count) 102 return _index < _outer.nodes.Count; 112 // all these navigation nodes are shared and hence they 120 * This buffer includes pointers to DOWN, UP, and EOF nodes. 128 protected IList nodes; field in class:Antlr.Runtime.Tree.BufferedTreeNodeStream [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...] |
H A D | BufferedTreeNodeStream.cs | 42 /** <summary>A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.</summary> 44 * This node stream sucks all nodes out of the tree specified in 47 * includes pointers to DOWN and UP and EOF nodes. 86 if ( _index < _outer.nodes.Count ) 87 return _outer.nodes[_index]; 107 if ( _index < _outer.nodes.Count ) 110 return _index < _outer.nodes.Count; 121 // all these navigation nodes are shared and hence they 129 * This buffer includes pointers to DOWN, UP, and EOF nodes. 137 protected IList nodes; field in class:Antlr.Runtime.Tree.BufferedTreeNodeStream [all...] |
/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/webkit/Source/WebCore/dom/ |
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 | 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);
|
/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/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/xml/ |
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...] |
/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 | 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[]) { argument 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[ [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...] |
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...] |
/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
|
/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/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
H A D | CommonTreeNodeStream.js | 1 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind. 3 * This node stream sucks all nodes out of the tree specified in 6 * includes pointers to DOWN and UP and EOF nodes. 30 /** Reuse same DOWN, UP navigation nodes unless this is true */ 33 /** The index into the nodes list of the current node (next node 34 * to consume). If -1, nodes array not filled yet. 41 this.nodes = []; //new ArrayList(initialBufferSize); 57 nodes = this.nodes, 62 return i<nodes [all...] |
/external/openssl/crypto/x509v3/ |
H A D | 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))
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
H A D | Main.java | 15 CommonTreeNodeStream nodes = new CommonTreeNodeStream(r0); 16 nodes.setTokenStream(tokens); 17 LangDumpDecl walker = new LangDumpDecl(nodes);
|
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
H A D | 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 [all...] |