| /external/libxml2/result/XPath/xptr/ |
| vidparts | 5 Set contains 1 nodes:
14 Set contains 1 nodes:
23 Set contains 1 nodes:
|
| /external/llvm/test/Linker/ |
| unique-fwd-decl-order.ll | 4 ; This test exercises MDNode hashing. For the nodes to be correctly uniqued,
8 ; Note that these two assembly files number the nodes identically, even though
9 ; the nodes are in a different order. This is for the reader's convenience.
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| statvfs.py | 14 F_FILES = 5 # Total number of file nodes
15 F_FFREE = 6 # Total number of free file nodes
16 F_FAVAIL = 7 # Free nodes available to non-superuser
|
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| statvfs.py | 14 F_FILES = 5 # Total number of file nodes
15 F_FFREE = 6 # Total number of free file nodes
16 F_FAVAIL = 7 # Free nodes available to non-superuser
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| statvfs.py | 14 F_FILES = 5 # Total number of file nodes
15 F_FFREE = 6 # Total number of free file nodes
16 F_FAVAIL = 7 # Free nodes available to non-superuser
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| statvfs.py | 14 F_FILES = 5 # Total number of file nodes
15 F_FFREE = 6 # Total number of free file nodes
16 F_FAVAIL = 7 # Free nodes available to non-superuser
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/ |
| main.m | 24 CommonTreeNodeStream nodes = new CommonTreeNodeStream(r0);
25 nodes.setTokenStream(tokens);
26 LangDumpDecl walker = new LangDumpDecl(nodes);
48 ANTLRCommonTreeNodeStream *nodes = [ANTLRCommonTreeNodeStream newANTLRCommonTreeNodeStream:r0];
49 [nodes setTokenStream:tokens];
50 LangDumpDecl *walker = [LangDumpDecl newLangDumpDecl:nodes];
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ |
| handler.py | 31 self.nodes = [('root', root_node)]
36 new_node = self.nodes[-1][1].startElement(name, attrs, self.connection)
38 self.nodes.append((name, new_node))
41 self.nodes[-1][1].endElement(name, self.current_text, self.connection)
42 if self.nodes[-1][0] == name:
43 if hasattr(self.nodes[-1][1], 'endNode'):
44 self.nodes[-1][1].endNode(self.connection)
45 self.nodes.pop()
|
| /external/valgrind/massif/tests/ |
| insig.c | 3 // In this test, the size of the insignificant nodes is greater than the
4 // size of two of the significant nodes. This is quite common in big
|
| /prebuilts/go/darwin-x86/src/cmd/gofmt/testdata/ |
| rewrite3.golden | 9 // Field tags are *ast.BasicLit nodes that are nil when the tag is
10 // absent. These nil nodes must not be mistaken for expressions,
|
| rewrite3.input | 9 // Field tags are *ast.BasicLit nodes that are nil when the tag is
10 // absent. These nil nodes must not be mistaken for expressions,
|
| rewrite5.golden | 7 // Rewriting of expressions containing nodes with associated comments to
8 // expressions without those nodes must also eliminate the associated
|
| rewrite5.input | 7 // Rewriting of expressions containing nodes with associated comments to
8 // expressions without those nodes must also eliminate the associated
|
| /prebuilts/go/linux-x86/src/cmd/gofmt/testdata/ |
| rewrite3.golden | 9 // Field tags are *ast.BasicLit nodes that are nil when the tag is
10 // absent. These nil nodes must not be mistaken for expressions,
|
| rewrite3.input | 9 // Field tags are *ast.BasicLit nodes that are nil when the tag is
10 // absent. These nil nodes must not be mistaken for expressions,
|
| rewrite5.golden | 7 // Rewriting of expressions containing nodes with associated comments to
8 // expressions without those nodes must also eliminate the associated
|
| rewrite5.input | 7 // Rewriting of expressions containing nodes with associated comments to
8 // expressions without those nodes must also eliminate the associated
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| LintTooltipManager.java | 75 List<UiViewElementNode> nodes = computeNodes(event); local
76 if (nodes != null && !nodes.isEmpty()) {
77 if (nodes.equals(mShowingNodes)) {
80 show(nodes);
112 List<UiViewElementNode> nodes = computeNodes(event); local
113 if (nodes != null && !nodes.isEmpty()) {
114 show(nodes);
118 /** Show a tooltip listing the lint errors for the given nodes */
161 List<UiViewElementNode> nodes = new ArrayList<UiViewElementNode>(); local
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| 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/ |
| 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/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| BufferedTreeNodeStream.java | 35 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
37 * This node stream sucks all nodes out of the tree specified in
40 * includes pointers to DOWN and UP and EOF nodes.
64 return i<nodes.size();
70 if ( current < nodes.size() ) {
71 return nodes.get(current);
77 throw new RuntimeException("cannot remove nodes from stream");
81 // all these navigation nodes are shared and hence they
89 * This buffer includes pointers to DOWN, UP, and EOF nodes
97 protected List nodes; field in class:BufferedTreeNodeStream
[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/testng/src/main/java/org/testng/internal/ |
| DynamicGraph.java | 35 * Define a comparator for the nodes of this graph, which will be used
36 * to order the free nodes when they are asked.
50 * Add an edge between two nodes.
58 * @return a set of all the nodes that don't depend on any other nodes.
66 // - no other nodes depend on it
74 // Sort the free nodes if requested (e.g. priorities)
78 ppp("Nodes after sorting:" + result.get(0));
86 * @return a list of all the nodes that have a status other than FINISHED.
88 private Collection<? extends T> getUnfinishedNodes(List<T> nodes) {
200 List<T> nodes = m_dependingOn.get(k); local
[all...] |
| /prebuilts/eclipse/maven/apache-maven-3.2.1/lib/ |
| jsoup-1.7.2.jar | |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| CommonTreeNodeStream.as | 34 /** A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.
36 * This node stream sucks all nodes out of the tree specified in
39 * includes pointers to DOWN and UP and EOF nodes.
54 // all these navigation nodes are shared and hence they
62 * This buffer includes pointers to DOWN, UP, and EOF nodes.
70 protected var nodes:Array;
72 /** Pull nodes from which tree? */
81 /** Reuse same DOWN, UP navigation nodes unless this is true */
84 /** The index into the nodes list of the current node (next nod
[all...] |
