| /external/testng/src/test/java/test/ |
| GraphTest.java | 133 // predecessors in certain kinds of graphs where many nodes have the
135 // would explore the same nodes repeatedly. This situation could
159 // Add maxDepth groups of new nodes, where each group contains nodesPerDepth
160 // nodes, and each node in a group a depth N has each node in the group
177 // Finally, make all of the nodes in the group at depth maxDepth
186 // nodes. rootNode has all of the other nodes except independentNode
|
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| nodenormalize01.java | 34 * The method "normalize" puts all Text nodes in the full depth of the sub-tree underneath
35 * this Node, including attribute nodes, into a "normal" form where only structure
37 * separates Text nodes, i.e., there are neither adjacent Text nodes nor empty Text nodes.
40 * and entity references nodes seperated by text nodes. Check the length of the node list of each
|
| /libcore/luni/src/test/java/tests/org/w3c/dom/ |
| NodeNormalize.java | 39 * The method "normalize" puts all Text nodes in the full depth of the sub-tree
40 * underneath this Node, including attribute nodes, into a "normal" form where
42 * sections, and entity references) separates Text nodes, i.e., there are
43 * neither adjacent Text nodes nor empty Text nodes.
46 * CDATA sections, and entity references nodes seperated by text nodes. Check
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/ |
| Serializer.java | 40 import org.yaml.snakeyaml.nodes.AnchorNode;
41 import org.yaml.snakeyaml.nodes.CollectionNode;
42 import org.yaml.snakeyaml.nodes.MappingNode;
43 import org.yaml.snakeyaml.nodes.Node;
44 import org.yaml.snakeyaml.nodes.NodeId;
45 import org.yaml.snakeyaml.nodes.NodeTuple;
46 import org.yaml.snakeyaml.nodes.ScalarNode;
47 import org.yaml.snakeyaml.nodes.SequenceNode;
48 import org.yaml.snakeyaml.nodes.Tag;
|
| /prebuilts/go/darwin-x86/src/compress/bzip2/ |
| huffman.go | 12 // nodes contains all the non-leaf nodes in the tree. nodes[0] is the
14 // of nodes to use when the tree is being constructed.
15 nodes []huffmanNode
20 // nodes slice of the tree. If left or right is invalidNodeValue then the child
40 node := &t.nodes[nodeIndex]
117 t.nodes = make([]huffmanNode, len(codes))
227 node := &t.nodes[t.nextNode]
|
| /prebuilts/go/linux-x86/src/compress/bzip2/ |
| huffman.go | 12 // nodes contains all the non-leaf nodes in the tree. nodes[0] is the
14 // of nodes to use when the tree is being constructed.
15 nodes []huffmanNode
20 // nodes slice of the tree. If left or right is invalidNodeValue then the child
40 node := &t.nodes[nodeIndex]
117 t.nodes = make([]huffmanNode, len(codes))
227 node := &t.nodes[t.nextNode]
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| NodeSequence.java | 53 * A cache of a list of nodes obtained from the iterator so far.
62 * If this iterator needs to cache nodes that are fetched, they
71 * Get the cache (if any) of nodes obtained from
81 * Set the vector where nodes will be cached.
90 * If the iterator needs to cache nodes as they are fetched,
127 * The functional iterator that fetches nodes.
132 * Set the functional iterator that fetches nodes.
141 * Get the functional iterator that fetches nodes.
198 * nodeset to which random nodes may be added.
358 // it must have all nodes in it by now, so let the cach
[all...] |
| /external/icu/icu4c/source/common/ |
| rbbinode.h | 58 UnicodeSet *fInputSet; // For uset nodes only.
74 int32_t fVal; // For leafChar nodes, the value.
79 UBool fLookAheadEnd; // For endMark nodes, set TRUE if
|
| /external/snakeyaml/src/test/java/examples/ |
| CustomBeanResolverTest.java | 25 import org.yaml.snakeyaml.nodes.Node;
26 import org.yaml.snakeyaml.nodes.NodeId;
27 import org.yaml.snakeyaml.nodes.ScalarNode;
|
| CustomImplicitResolverTest.java | 27 import org.yaml.snakeyaml.nodes.Node;
28 import org.yaml.snakeyaml.nodes.ScalarNode;
29 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/composer/ |
| ComposerImplTest.java | 23 import org.yaml.snakeyaml.nodes.MappingNode;
24 import org.yaml.snakeyaml.nodes.Node;
25 import org.yaml.snakeyaml.nodes.NodeId;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue64/ |
| ParameterizedTypeTest.java | 26 import org.yaml.snakeyaml.nodes.Node;
27 import org.yaml.snakeyaml.nodes.ScalarNode;
28 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue97/ |
| YamlSortedSetTest.java | 29 import org.yaml.snakeyaml.nodes.Node;
30 import org.yaml.snakeyaml.nodes.NodeId;
31 import org.yaml.snakeyaml.nodes.SequenceNode;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/representer/ |
| RepresentTest.java | 23 import org.yaml.snakeyaml.nodes.Node;
24 import org.yaml.snakeyaml.nodes.ScalarNode;
25 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/v8/src/compiler/ |
| js-native-context-specialization.h | 33 // folding some {LoadGlobal} nodes or strength reducing some {StoreGlobal}
34 // nodes. And also specializes {LoadNamed} and {StoreNamed} nodes according
|
| /external/zopfli/src/zopfli/ |
| katajainen.c | 33 Nodes forming chains. Also used to represent leaves.
43 Memory pool for nodes.
46 Node* nodes; /* The pool. */ member in struct:NodePool
63 lists: If given, used to mark in-use nodes during garbage collection.
69 if (pool->next >= &pool->nodes[pool->size]) {
73 pool->nodes[i].inuse = 0;
83 pool->next = &pool->nodes[0];
228 pool.nodes = (Node*)malloc(pool.size * sizeof(*pool.nodes));
229 pool.next = pool.nodes;
[all...] |
| /prebuilts/go/darwin-x86/doc/play/ |
| peano.go | 2 // list whose nodes contain no data
3 // (the nodes are the data).
18 // count of the nodes comprising the list.
|
| /prebuilts/go/linux-x86/doc/play/ |
| peano.go | 2 // list whose nodes contain no data
3 // (the nodes are the data).
18 // count of the nodes comprising the list.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| DependencyGraph.java | 42 * <li> Quickly determine not just the dependencies on other nodes, but which nodes
63 INode[] nodes = layout.getChildren(); local
80 for (INode child : nodes) {
153 * @param nodes the set of nodes that we want to compute the transitive dependencies
157 * @return the set of nodes that directly or indirectly depend on the given nodes in
160 public Set<INode> dependsOn(Collection<? extends INode> nodes, boolean vertical) {
163 // Traverse the graph of constraints and determine all nodes affected b
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| NodeSet.java | 40 * nextNode() is called, in order that nodes can be added
87 * @param nodelist List of Nodes to be made members of the new set.
101 * @param nodelist Set of Nodes to be made members of the new set.
115 * @param ni Iterator which yields Nodes to be made members of the new set.
179 * hardcoded to show all nodes except EntityReference nodes, which have
193 * The filter object used to screen nodes. Filters are applied to
203 * not going to return all nodes selected by whatToShow.
212 * reference nodes are visible to the iterator. If false, they will be
218 * a view of the document that has entity reference nodes but no entit
[all...] |
| NodeSetDTM.java | 41 * nextNode() is called, in order that nodes can be added
92 // * @param nodelist List of Nodes to be made members of the new set.
106 * @param nodelist Set of Nodes to be made members of the new set.
122 * @param ni Iterator which yields Nodes to be made members of the new set.
138 * @param iterator Iterator which yields Nodes to be made members of the new set.
172 // Do not reorder or strip duplicate nodes from the given DOM nodelist
292 * hardcoded to show all nodes except EntityReference nodes, which have
306 * The filter object used to screen nodes. Filters are applied to
316 * not going to return all nodes selected by whatToShow
[all...] |
| /external/libxml2/doc/devhelp/ |
| libxml2-c14n.html | 48 int <a href="#xmlC14NDocSaveTo">xmlC14NDocSaveTo</a> (<a href="libxml2-tree.html#xmlDocPtr">xmlDocPtr</a> doc, <br/> <a href="libxml2-xpath.html#xmlNodeSetPtr">xmlNodeSetPtr</a> nodes, <br/> int mode, <br/> <a href="libxml2-xmlstring.html#xmlChar">xmlChar</a> ** inclusive_ns_prefixes, <br/> int with_comments, <br/> <a href="libxml2-tree.html#xmlOutputBufferPtr">xmlOutputBufferPtr</a> buf);
50 int <a href="#xmlC14NDocSave">xmlC14NDocSave</a> (<a href="libxml2-tree.html#xmlDocPtr">xmlDocPtr</a> doc, <br/> <a href="libxml2-xpath.html#xmlNodeSetPtr">xmlNodeSetPtr</a> nodes, <br/> int mode, <br/> <a href="libxml2-xmlstring.html#xmlChar">xmlChar</a> ** inclusive_ns_prefixes, <br/> int with_comments, <br/> const char * filename, <br/> int compression);
51 int <a href="#xmlC14NDocDumpMemory">xmlC14NDocDumpMemory</a> (<a href="libxml2-tree.html#xmlDocPtr">xmlDocPtr</a> doc, <br/> <a href="libxml2-xpath.html#xmlNodeSetPtr">xmlNodeSetPtr</a> nodes, <br/> int mode, <br/> <a href="libxml2-xmlstring.html#xmlChar">xmlChar</a> ** inclusive_ns_prefixes, <br/> int with_comments, <br/> <a href="libxml2-xmlstring.html#xmlChar">xmlChar</a> ** doc_txt_ptr);
69 </pre><p>Signature for a C14N callback on visible nodes</p>
72 <div class="refsect2" lang="en"><h3><a name="xmlC14NDocDumpMemory"/>xmlC14NDocDumpMemory ()</h3><pre class="programlisting">int xmlC14NDocDumpMemory (<a href="libxml2-tree.html#xmlDocPtr">xmlDocPtr</a> doc, <br/> <a href="libxml2-xpath.html#xmlNodeSetPtr">xmlNodeSetPtr</a> nodes, <br/> int mode, <br/> <a href="libxml2-xmlstring.html#xmlChar">xmlChar</a> ** inclusive_ns_prefixes, <br/> int with_comments, <br/> <a href="libxml2-xmlstring.html#xmlChar">xmlChar</a> ** doc_txt_ptr)<br/>
74 <div class="variablelist"><table border="0"><col align="left"/><tbody><tr><td><span class="term"><i><tt>doc</tt></i>:</span></td><td>the XML document for canonization</td></tr><tr><td><span class="term"><i><tt>nodes</tt></i>:</span></td><td>the nodes set to be included in the canonized image or NULL if all document nodes should be included</td></tr><tr><td><span class="term"><i><tt>mode</tt></i>:</span></td><td>the c14n mode (see @xmlC14NMode)</td></tr><tr><td><span class="term"><i><tt>inclusive_ns_prefixes</tt></i>:</span></td><td>the list of inclusive namespace prefixes ended with a NULL or NULL if there is no inclusive namespaces (only for exclusive canonicalization, ignored otherwise)</td></tr><tr><td><span class="term"><i><tt>with_comments</tt></i>:</span></td><td>include comments in the result (!=0) or not (==0)</td></tr><tr><td><span class="term"><i><tt>doc_txt_ptr</tt></i>:</span></td><td>the memory pointer for allocated canonical XML text; the caller of this functions is responsible for calling xmlFree() to free allocated memory</td></tr><tr><td><span class="term"><i><tt>Returns</tt></i>:</span></td><td>the number of bytes written on success or a negative value on fail</td></tr></tbody></table></div></div>
76 <div class="refsect2" lang="en"><h3><a name="xmlC14NDocSave"/>xmlC14NDocSave ()</h3><pre class="programlisting">int xmlC14NDocSave (<a href="libxml2-tree.html#xmlDocPtr">xmlDocPtr</a> doc, <br/> <a href="libxml2-xpath.html#xmlNodeSetPtr">xmlNodeSetPtr</a> nodes, <br/> int mode, <br/> <a href="libxml2-xmlstring.html#xmlChar">xmlChar</a> ** inclusive_ns_prefixes, <br/> int with_comments, <br/> const char * filename, <br/> int compression)<br/>
78 <div class="variablelist"><table border="0"><col align="left"/><tbody><tr><td><span class="term"><i><tt>doc</tt></i>:</span></td><td>the XML document for canonization</td></tr><tr><td><span class="term"><i><tt>nodes</tt></i>:</span></td><td>the nodes set to be included in the canonized image or NULL if all docume (…)
[all...] |
| /external/opencv3/3rdparty/jinja2/ |
| nodes.py | 3 jinja2.nodes
6 This module implements additional nodes derived from the ast base node.
10 python and jinja nodes.
60 """A metaclass for nodes that handles the field and attribute
108 """Baseclass for all Jinja2 nodes. There are a number of nodes available
113 - :class:`Helper`: helper nodes
116 All nodes have fields and attributes. Fields may be other nodes, lists,
121 all nodes automatically
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| tree.py | 100 @brief Abstract baseclass for tree nodes.
343 """Is tree considered a nil node used to make lists of child nodes?"""
386 constructing these nodes so we should have this control for
415 How to identify nodes so we can say "add node to a prior node"?
492 all children? Each rule that creates AST nodes will call this
820 # if same number of nodes, do direct replace
977 If you specify your own kind of tree nodes, you will likely have to
1062 constructing these nodes so we should have this control for
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/webpagereplay/third_party/dns/ |
| zone.py | 51 A Zone is a mapping from names to nodes. The zone object may be
62 @ivar nodes: A dictionary mapping the names of nodes in the zone to the
63 nodes themselves.
64 @type nodes: dict
73 __slots__ = ['rdclass', 'origin', 'nodes', 'relativize']
85 self.nodes = {}
90 nodes.
98 self.nodes != other.nodes
[all...] |
