| /external/libxml2/result/XPath/xptr/ |
| chapterschildseq | 5 Set contains 1 nodes:
14 Set contains 1 nodes:
23 Set contains 1 nodes:
32 Set contains 1 nodes:
41 Set contains 0 nodes:
|
| /external/opencv3/3rdparty/jinja2/ |
| optimizer.py | 19 from jinja2 import nodes
39 if node.find(nodes.Block) is not None:
43 except nodes.Impossible:
58 return nodes.Const.from_untrusted(node.as_const(),
61 except nodes.Impossible:
|
| /external/pdfium/xfa/src/fxfa/src/common/ |
| xfa_script.h | 51 ~_XFA_RESOLVENODE_RS() { nodes.RemoveAll(); }
55 for (int32_t i = 0; i < nodes.GetSize(); i++) {
57 (nodes[i]->*(pScriptAttribute->lpfnCallback))(
64 CXFA_ObjArray nodes;
member in struct:_XFA_RESOLVENODE_RS
101 virtual void AddNodesOfRunScript(const CXFA_NodeArray& nodes) = 0;
|
| /external/selinux/libsemanage/man/man3/ |
| semanage_node.3 | 4 semanage_node \- SELinux Network Nodes Management API
163 count the number of nodes defined in the persistent policy
168 count the number of nodes defined in the local store
183 return an array containing all nodes in the persistent policy
188 return an array containing all nodes in the local store
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| TagTest.java | 16 package org.yaml.snakeyaml.nodes;
45 assertEquals(Tag.PREFIX + "org.yaml.snakeyaml.nodes.TagTest", tag.getValue());
58 Tag tag = new Tag(Tag.PREFIX + "org.yaml.snakeyaml.nodes.TagTest");
59 assertEquals("org.yaml.snakeyaml.nodes.TagTest", tag.getClassName());
73 String t = Tag.PREFIX + "org.yaml.snakeyaml.nodes.TagTest";
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-dump.h | 68 /* The first node in the queue of nodes to be written out. */
72 /* Free queue nodes. */
74 /* The tree nodes which we have already written out. The
75 keys are the addresses of the nodes; the values are the integer
77 splay_tree nodes; member in struct:dump_info
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/ |
| basic.rb | 37 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
38 nodes.token_stream = tokens
39 walker = FlatListWalker::TreeParser.new( nodes )
73 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
74 nodes.token_stream = tokens
75 walker = SimpleTreeWalker::TreeParser.new( nodes )
112 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
113 nodes.token_stream = tokens
114 walker = FlatVsTreeDecisionWalker::TreeParser.new( nodes )
150 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| TreeNodeStream.as | 32 /** A stream of tree nodes, accessing nodes from a tree of some kind */
35 * If you don't want to buffer up nodes, then this method makes no
41 * i<0 indicates nodes in the past. So LT(-1) is previous node, but
53 /** Where is this stream pulling nodes from? This is not the name, but
65 /** What adaptor can tell me how to interpret/navigate nodes and
70 /** As we flatten the tree, we use UP, DOWN nodes to represent
71 * the tree structure. When debugging we need unique nodes
74 * navigation nodes. Default should be false;
78 /** Return the text of all nodes from start to stop, inclusive
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| ITreeNodeStream.cs | 34 /** <summary>A stream of tree nodes, accessing nodes from a tree of some kind</summary> */
38 * If you don't want to buffer up nodes, then this method makes no
48 * i<0 indicates nodes in the past. So LT(-1) is previous node, but
64 * Where is this stream pulling nodes from? This is not the name, but
84 * What adaptor can tell me how to interpret/navigate nodes and
93 * As we flatten the tree, we use UP, DOWN nodes to represent
94 * the tree structure. When debugging we need unique nodes
97 * navigation nodes. Default should be false;
106 * Return the text of all nodes from start to stop, inclusive
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| ITreeNodeStream.cs | 35 /** <summary>A stream of tree nodes, accessing nodes from a tree of some kind</summary> */
40 * If you don't want to buffer up nodes, then this method makes no
51 * i<0 indicates nodes in the past. So LT(-1) is previous node, but
67 * Where is this stream pulling nodes from? This is not the name, but
89 * What adaptor can tell me how to interpret/navigate nodes and
99 * As we flatten the tree, we use UP, DOWN nodes to represent
100 * the tree structure. When debugging we need unique nodes
103 * navigation nodes. Default should be false;
113 * Return the text of all nodes from start to stop, inclusive
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeNodeStream.java | 33 /** A stream of tree nodes, accessing nodes from a tree of some kind */
36 * If you don't want to buffer up nodes, then this method makes no
42 * i<0 indicates nodes in the past. So LT(-1) is previous node, but
54 /** Where is this stream pulling nodes from? This is not the name, but
66 /** What adaptor can tell me how to interpret/navigate nodes and
71 /** As we flatten the tree, we use UP, DOWN nodes to represent
72 * the tree structure. When debugging we need unique nodes
75 * navigation nodes. Default should be false;
84 /** Return the text of all nodes from start to stop, inclusive
[all...] |
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/analysis/ |
| CoverageBuilder.java | 25 * {@link IClassCoverage} nodes. The nodes are feed into the builder through its
53 * Returns all class nodes currently contained in this builder.
55 * @return all class nodes
62 * Returns all source file nodes currently contained in this builder.
64 * @return all source file nodes
71 * Creates a bundle from all nodes currently contained in this bundle.
|
| /external/skia/src/core/ |
| SkTTopoSort.h | 31 // Recursively visit a node and all the other nodes it depends on.
41 // (and all the nodes it depends on) are already in 'result'.
44 // nodes it depends on outputing them first.
60 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
74 // static T* Dependency(T* t, int index) { ... } // nodes on which it depends
78 // node and all the nodes on which it depends. This could be used to partially
97 // Output this node after all the nodes it depends on have been output.
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| DocumentFragment.java | 27 * <p>Furthermore, various operations -- such as inserting nodes as children
29 * objects as arguments; this results in all the child nodes of the
32 * nodes representing the tops of any sub-trees defining the structure of
33 * the document. <code>DocumentFragment</code> nodes do not need to be
36 * nodes). For example, a <code>DocumentFragment</code> might have only one
45 * useful when the user wishes to create nodes that are siblings; the
46 * <code>DocumentFragment</code> acts as the parent of these nodes so that
|
| /libcore/luni/src/main/java/org/w3c/dom/ls/ |
| LSSerializerFilter.java | 19 * examine nodes as they are being serialized and decide what nodes should
25 * , and children of <code>Attr</code> nodes are not passed to the filter.
26 * The child nodes of an <code>EntityReference</code> node are only passed
49 * Tells the <code>LSSerializer</code> what types of nodes to show to the
55 * meaningless here, such nodes will never be passed to a
59 * <code>Attr</code> nodes are shown and passed to the filter.
|
| /external/jemalloc/test/unit/ |
| rb.c | 86 /* Red nodes must be interleaved with black nodes. */
224 assert_u_gt(*nnodes, 0, "Destruction removed too many nodes");
236 node_t nodes[NNODES]; local
258 /* Initialize tree and nodes. */
261 nodes[k].magic = NODE_MAGIC;
262 nodes[k].key = bag[k];
265 /* Insert nodes. */
267 tree_insert(&tree, &nodes[k]);
288 tree_next(&tree, &nodes[k])
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/scenes/scene2d/ui/ |
| Tree.java | 32 /** A tree widget where each node has an icon, actor, and child nodes.
34 * The preferred size of the tree is determined by the preferred size of the actors for the expanded nodes.
135 /** Removes all tree nodes. */
164 private void computeSize (Array<Node> nodes, float indent) {
167 for (int i = 0, n = nodes.size; i < n; i++) {
168 Node node = nodes.get(i);
195 private float layout (Array<Node> nodes, float indent, float y) {
197 for (int i = 0, n = nodes.size; i < n; i++) {
198 Node node = nodes.get(i);
219 private void draw (Batch batch, Array<Node> nodes, float indent) {
[all...] |
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
32 /// NodeSubset - A subset of the graph's nodes.
99 /// Nodes - The list of nodes for this graph.
100 NodeType Nodes[N];
106 // the Nodes array given a pointer to any element of it.
108 Nodes[i].first = i;
115 Nodes[FromIdx].second.AddNode(ToIdx);
122 Nodes[FromIdx].second.DeleteNode(ToIdx);
130 return const_cast<NodeType *>(&Nodes[Idx])
[all...] |
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 69 int dim; // split dimension; >=0 for nodes, -1 for leaves
78 node_array nodes; // node storage member in class:CvKDTree
173 int i = nodes.size();
174 node & n = *nodes.insert(nodes.end(), node());
184 int i = nodes.size();
186 node & n = *nodes.insert(nodes.end(), node());
192 nodes[i].left = left;
194 nodes[i].right = right
[all...] |
| /build/kati/ |
| exec.go | 172 var nodes []*DepNode
174 if len(g.nodes) > 0 {
175 nodes = append(nodes, g.nodes[0])
179 for _, n := range g.nodes {
185 nodes = append(nodes, n)
189 for _, root := range nodes {
198 for _, root := range nodes {
[all...] |
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
125 if (!Nodes)
129 const unsigned PerNode = (Elements + Grow) / Nodes;
130 const unsigned Extra = (Elements + Grow) % Nodes;
131 IdxPair PosPair = IdxPair(Nodes, 0);
133 for (unsigned n = 0; n != Nodes; ++n) {
135 if (PosPair.first == Nodes && Sum > Position)
142 assert(PosPair.first < Nodes && "Bad algebra");
149 for (unsigned n = 0; n != Nodes; ++n)
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/ |
| ModelInstance.java | 38 * The ModelInstance creates a full copy of all materials, nodes and animations.
45 /** the materials of the model, used by nodes that have a graphical representation FIXME not sure if superfluous, allows
46 * modification of materials without having to traverse the nodes **/
48 /** root nodes of the model **/
49 public final Array<Node> nodes = new Array();
field in class:ModelInstance
59 /** Constructs a new ModelInstance with all nodes and materials of the given model.
132 this.nodes.add(copy = node.copy());
144 /** Constructs a new ModelInstance with only the specified nodes and materials of the given model. */
149 /** Constructs a new ModelInstance with only the specified nodes and materials of the given model. */
154 copyNodes(model.nodes);
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3commontreenodestream.h | 68 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
80 /// Where is this stream pulling nodes from? This is not the name, but
85 /// What adaptor can tell me how to interpret/navigate nodes and
90 /// As we flatten the tree, we use UP, DOWN nodes to represent
91 /// the tree structure. When debugging we need unique nodes
94 /// navigation nodes. Default should be false;
100 /// Return the text of all nodes from start to stop, inclusive.
101 /// If the stream does not buffer all the nodes then it can still
108 /// Return the text of all nodes from start to stop, inclusive, into the
110 /// If the stream does not buffer all the nodes then it can stil
194 pANTLR3_VECTOR nodes; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
[all...] |
| /external/pdfium/third_party/libopenjpeg20/ |
| tgt.c | 88 tree->nodes = (opj_tgt_node_t*) opj_calloc(tree->numnodes, sizeof(opj_tgt_node_t));
89 if(!tree->nodes) {
90 opj_event_msg(manager, EVT_ERROR, "Not enough memory to create Tag-tree nodes\n");
96 node = tree->nodes;
97 l_parent_node = &tree->nodes[tree->numleafsh * tree->numleafsv];
176 opj_tgt_node_t* new_nodes = (opj_tgt_node_t*) opj_realloc(p_tree->nodes, l_node_size);
182 p_tree->nodes = new_nodes;
183 memset(((char *) p_tree->nodes) + p_tree->nodes_size, 0 , l_node_size - p_tree->nodes_size);
186 l_node = p_tree->nodes;
187 l_parent_node = &p_tree->nodes[p_tree->numleafsh * p_tree->numleafsv]
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| t047treeparser.html | 101 var nodes = new org.antlr.runtime.tree.CommonTreeNodeStream(r.getTree());
102 nodes.setTokenStream(tstream);
103 var walker = new TWalker(nodes);
116 var nodes = new org.antlr.runtime.tree.CommonTreeNodeStream(r.getTree());
117 nodes.setTokenStream(tstream);
118 var walker = new TWalker(nodes);
|
