/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRStreamEnumerator.h | 39 NSMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 48 ANTLRFastQueue *nodes; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRStreamEnumerator.h | 39 AMutableArray *nodes; variable 47 @property (retain) AMutableArray *nodes; variable
|
H A D | ANTLRTreeIterator.h | 45 __strong ANTLRFastQueue *nodes; variable 55 @property(retain) ANTLRFastQueue *nodes; variable
|
/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/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
H A D | DebugTreeGrammarHelper.cs | 52 public DebugTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions ) argument 53 : this( nodes )
|
H A D | ProfileTreeGrammarHelper.cs | 52 public ProfileTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions ) argument 53 : this( 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...] |
/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/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/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/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...] |
/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/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstInOrderPathTest.java | 180 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) { 183 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes); 188 BstInOrderPath<SimpleNode> path, SimpleNode... nodes) { 191 ASSERT.that(pathToList(path)).hasContentsInOrder(nodes); 179 testNextPathIs( BstInOrderPath<SimpleNode> path, SimpleNode... nodes) argument 187 testPrevPathIs( BstInOrderPath<SimpleNode> path, SimpleNode... nodes) argument
|
/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;
|