| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t047treeparser.py | 64 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
65 nodes.setTokenStream(tStream)
66 walker = self.getWalker(nodes)
113 nodes = antlr3.tree.CommonTreeNodeStream(r.tree)
114 nodes.setTokenStream(tStream)
115 walker = self.getWalker(nodes)
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 40 List<Node> edges; // points at which nodes?
53 protected Map<Object,Node> nodes = new HashMap<Object,Node>(); field in class:Graph
63 Node existing = nodes.get(a);
66 nodes.put(a, n);
84 while ( visited.size() < nodes.size() ) {
87 for (Iterator it = nodes.values().iterator(); it.hasNext();) {
|
| /external/freetype/src/cache/ |
| ftcmanag.h | 29 /* holding a varying number of `cache nodes'. Each cache node */
38 /* All cache nodes are located in a global LRU list, where the oldest */
121 /* will flush as many old cache nodes as possible (ignoring cache */
122 /* nodes with a non-zero reference count). */
138 /* try to flush `count' old nodes from the cache; return the number
139 * of really flushed nodes
|
| /external/iptables/extensions/ |
| libxt_cluster.man | 4 This match requires that all the nodes see the same packets. Thus, the cluster
7 \fB\-\-cluster\-total\-nodes\fP \fInum\fP
8 Set number of total nodes in cluster.
23 \-\-cluster\-total\-nodes 2 \-\-cluster\-local\-node 1
28 \-\-cluster\-total\-nodes 2 \-\-cluster\-local\-node 1
38 And the following commands to make all nodes see the same packets:
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/ |
| ftcmanag.h | 29 /* holding a varying number of `cache nodes'. Each cache node */
38 /* All cache nodes are located in a global LRU list, where the oldest */
121 /* will flush as many old cache nodes as possible (ignoring cache */
122 /* nodes with a non-zero reference count). */
138 /* try to flush `count' old nodes from the cache; return the number
139 * of really flushed nodes
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue150/ |
| YamlLoadAsIssueTest.java | 35 import org.yaml.snakeyaml.nodes.MappingNode;
36 import org.yaml.snakeyaml.nodes.Node;
37 import org.yaml.snakeyaml.nodes.NodeTuple;
38 import org.yaml.snakeyaml.nodes.ScalarNode;
39 import org.yaml.snakeyaml.nodes.SequenceNode;
40 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue60/ |
| SkipBeanTest.java | 25 import org.yaml.snakeyaml.nodes.CollectionNode;
26 import org.yaml.snakeyaml.nodes.MappingNode;
27 import org.yaml.snakeyaml.nodes.Node;
28 import org.yaml.snakeyaml.nodes.NodeTuple;
29 import org.yaml.snakeyaml.nodes.SequenceNode;
30 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/v8/test/unittests/compiler/ |
| node-properties-unittest.cc | 24 Node* nodes[] = {n1}; local
25 return Node::New(zone(), 0, op, arraysize(nodes), nodes, false);
28 Node* nodes[] = {n1, n2}; local
29 return Node::New(zone(), 0, op, arraysize(nodes), nodes, false);
|
| /external/opencv3/3rdparty/jinja2/ |
| ext.py | 13 from jinja2 import nodes
103 list of multiple nodes.
115 return nodes.ExtensionAttribute(self.identifier, name, lineno=lineno)
120 :meth:`attr` + :class:`jinja2.nodes.Call`.
126 return nodes.Call(self.attr(name, lineno=lineno), args, kwargs,
245 variables[name.value] = var = nodes.Name(name.value, 'load')
248 if isinstance(var, nodes.Call):
249 plural_expr = nodes.Name('_trans', 'load')
251 plural_expr_assignment = nodes.Assign(
252 nodes.Name('_trans', 'store'), var
[all...] |
| /external/clang/include/clang/AST/ |
| CMakeLists.txt | 21 clang_tablegen(StmtNodes.inc -gen-clang-stmt-nodes
25 clang_tablegen(DeclNodes.inc -gen-clang-decl-nodes
29 clang_tablegen(CommentNodes.inc -gen-clang-comment-nodes
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| SequenceNode.java | 16 package org.yaml.snakeyaml.nodes;
25 * A sequence is a ordered collection of nodes.
53 * @return Nodes in the specified order.
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue139/ |
| UniqueKeyTest.java | 26 import org.yaml.snakeyaml.nodes.MappingNode;
27 import org.yaml.snakeyaml.nodes.Node;
28 import org.yaml.snakeyaml.nodes.NodeTuple;
|
| /external/testng/src/main/java/org/testng/xml/dom/ |
| DomXmlParser.java | 52 // NodeList nodes = (NodeList) result;
53 // for (int i = 0; i < nodes.getLength(); i++) {
54 // Node node = nodes.item(i);
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| NodeList.java | 17 * collection of nodes, without defining or constraining how this collection
26 * <code>index</code> is greater than or equal to the number of nodes in
36 * The number of nodes in the list. The range of valid child node indices
|
| Text.java | 21 * information items (elements, comments, etc.) and <code>Text</code> nodes
25 * <code>Text</code> nodes that represent the contents of a given element
27 * to represent the separations between these nodes in XML or HTML, so they
42 * Breaks this node into two nodes at the specified <code>offset</code>,
72 * Returns all text of <code>Text</code> nodes logically-adjacent text
73 * nodes to this node, concatenated in document order.
83 * nodes with the specified text. All logically-adjacent text nodes are
103 * <br>Where the nodes to be removed are read-only descendants of an
105 * be removed instead of the read-only nodes. If an
[all...] |
| /packages/services/Car/car_product/sepolicy/ |
| qcom-post-boot.te | 19 # Write access to thermal related sysfs nodes.
27 # Write access to mpdecision related sysfs nodes.
45 # Allow changing the owner of the above sysfs nodes.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/ |
| IUiUpdateListener.java | 21 * Listen to update notifications in UI nodes.
29 /** The node sub-structure (i.e. child nodes) has changed */
34 * Note that mandatory UI nodes are never actually deleted. */
|
| /build/kati/ |
| depgraph.go | 29 nodes []*DepNode
36 // Nodes returns all rules.
37 func (g *DepGraph) Nodes() []*DepNode { return g.nodes }
66 for _, n := range g.nodes {
182 nodes, err := db.Eval(req.Targets)
196 nodes: nodes,
204 err = evalCommands(nodes, vars)
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/ |
| ITreeNodeStream`1.cs | 39 * If you don't want to buffer up nodes, then this method makes no
50 * i<0 indicates nodes in the past. So LT(-1) is previous node, but
66 * Where is this stream pulling nodes from? This is not the name, but
88 * What adaptor can tell me how to interpret/navigate nodes and
98 * As we flatten the tree, we use UP, DOWN nodes to represent
99 * the tree structure. When debugging we need unique nodes
102 * navigation nodes. Default should be false;
112 * Return the text of all nodes from start to stop, inclusive.
113 * If the stream does not buffer all the nodes then it can still
|
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| 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;
|
| 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/boringssl/src/crypto/x509v3/ |
| pcy_node.c | 77 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes,
87 if (!sk_X509_POLICY_NODE_find(nodes, &idx, &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/clang/test/CodeGen/ |
| debug-info-same-line.c | 2 // Here two temporary nodes are identical (but should not get uniqued) while
|
| /external/fio/examples/ |
| numa.fio | 2 ; 'numactl --show' to determine the maximum numa nodes
|
| /external/guava/guava/src/com/google/common/collect/ |
| TreeTraverser.java | 30 * Views elements of a type {@code T} as nodes in a tree, and provides methods to traverse the trees
47 * <p>Null nodes are strictly forbidden.
63 * Returns an unmodifiable iterable over the nodes in a tree structure, using pre-order
66 * <p>No guarantees are made about the behavior of the traversal when nodes change while
113 * Returns an unmodifiable iterable over the nodes in a tree structure, using post-order
116 * <p>No guarantees are made about the behavior of the traversal when nodes change while
173 * Returns an unmodifiable iterable over the nodes in a tree structure, using breadth-first
174 * traversal. That is, all the nodes of depth 0 are returned, then depth 1, then 2, and so on.
176 * <p>No guarantees are made about the behavior of the traversal when nodes change while
|
