| /external/libxml2/result/XPath/tests/ |
| simplebase | 5 Set contains 1 nodes:
17 Set contains 1 nodes:
29 Set contains 1 nodes:
35 Set contains 2 nodes:
42 Set contains 1 nodes:
48 Set contains 1 nodes:
55 Set contains 3 nodes:
65 Set contains 1 nodes:
73 Set contains 0 nodes:
78 Set contains 1 nodes
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeFilter.java | 18 * Filters are objects that know how to "filter out" nodes. If a
64 * Show all <code>Nodes</code>.
68 * Show <code>Element</code> nodes.
72 * Show <code>Attr</code> nodes. This is meaningful only when creating an
76 * or traversal. Since attributes are never children of other nodes,
81 * Show <code>Text</code> nodes.
85 * Show <code>CDATASection</code> nodes.
89 * Show <code>EntityReference</code> nodes.
93 * Show <code>Entity</code> nodes. This is meaningful only when creating
103 * Show <code>ProcessingInstruction</code> nodes
[all...] |
| /external/testng/src/main/java/org/testng/internal/ |
| Graph.java | 25 // A map of nodes that are not the predecessors of any node
33 // Initially, all the nodes are put in the independent list as well
56 // Remove these two nodes from the independent list
86 * @return All the nodes that don't have any order with each other.
93 * @return All the nodes that have an order with each other, sorted
106 // Clone the list of nodes but only keep those that are
121 // Sort the nodes alphabetically to make sure that methods of the same class
132 // Find all the nodes that don't have any predecessors, add
161 // dependent nodes. Therefore, all the nodes were mostly sorted alphabetically. So we need to kee
[all...] |
| /external/v8/src/compiler/ |
| scheduler.h | 26 // Computes a schedule from a graph, placing nodes into basic blocks and
35 // nodes from the graph into it.
67 NodeVectorVector scheduled_nodes_; // Per-block list of nodes in reverse.
68 NodeVector schedule_root_nodes_; // Fixed root nodes seed the worklist.
69 ZoneQueue<Node*> schedule_queue_; // Worklist of schedulable nodes.
70 ZoneVector<SchedulerData> node_data_; // Per-node data for all nodes.
98 // Phase 3: Prepare use counts for nodes.
102 // Phase 4: Schedule nodes early.
106 // Phase 5: Schedule nodes late.
|
| graph-replay.cc | 7 #include "src/compiler/all-nodes.h"
24 AllNodes nodes(&zone, graph);
26 // Allocate the nodes first.
27 for (Node* node : nodes.live) {
36 // Connect the nodes to their inputs.
37 for (Node* node : nodes.live) {
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| lfstack_test.go | 33 // Need to keep additional references to nodes, the stack is not all that type-safe.
34 var nodes []*MyNode
43 nodes = append(nodes, node)
48 nodes = append(nodes, node)
89 // Need to keep additional references to nodes,
132 t.Fatalf("Wrong number of nodes %d/%d", cnt, K)
138 // Let nodes be collected now.
|
| /prebuilts/go/linux-x86/src/runtime/ |
| lfstack_test.go | 33 // Need to keep additional references to nodes, the stack is not all that type-safe.
34 var nodes []*MyNode
43 nodes = append(nodes, node)
48 nodes = append(nodes, node)
89 // Need to keep additional references to nodes,
132 t.Fatalf("Wrong number of nodes %d/%d", cnt, K)
138 // Let nodes be collected now.
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| graph.rst | 8 represents a directed graph with *N* nodes and *E* edges.
19 edge data. The source and destination nodes are added to the graph
57 Restores all hidden nodes.
61 Return the number of visible nodes in the graph.
65 Return the number of hidden nodes in the graph.
69 Return a list with all visible nodes in the graph.
73 Return a list with all hidden nodes in the graph.
97 Yield all nodes in the graph.
145 referring to hidden nodes.
200 Return a list of all nodes connected by outgoing edges
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
| ast.py | 21 nodes = {} variable
24 """Abstract base class for ast nodes."""
40 nodes["expression"] = "Expression"
69 def __init__(self, nodes, lineno=None):
70 self.nodes = nodes
74 return tuple(flatten(self.nodes))
78 nodelist.extend(flatten_nodes(self.nodes))
82 return "And(%s)" % (repr(self.nodes),)
101 def __init__(self, nodes, lineno=None)
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
| ast.py | 21 nodes = {} variable
24 """Abstract base class for ast nodes."""
40 nodes["expression"] = "Expression"
69 def __init__(self, nodes, lineno=None):
70 self.nodes = nodes
74 return tuple(flatten(self.nodes))
78 nodelist.extend(flatten_nodes(self.nodes))
82 return "And(%s)" % (repr(self.nodes),)
101 def __init__(self, nodes, lineno=None)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| ast.py | 21 nodes = {} variable
24 """Abstract base class for ast nodes."""
40 nodes["expression"] = "Expression"
69 def __init__(self, nodes, lineno=None):
70 self.nodes = nodes
74 return tuple(flatten(self.nodes))
78 nodelist.extend(flatten_nodes(self.nodes))
82 return "And(%s)" % (repr(self.nodes),)
101 def __init__(self, nodes, lineno=None)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| ast.py | 21 nodes = {} variable
24 """Abstract base class for ast nodes."""
40 nodes["expression"] = "Expression"
69 def __init__(self, nodes, lineno=None):
70 self.nodes = nodes
74 return tuple(flatten(self.nodes))
78 nodelist.extend(flatten_nodes(self.nodes))
82 return "And(%s)" % (repr(self.nodes),)
101 def __init__(self, nodes, lineno=None)
[all...] |
| /external/libxml2/doc/examples/ |
| xpath1.c | 27 void print_xpath_nodes(xmlNodeSetPtr nodes, FILE* output);
199 * @nodes: the nodes set.
202 * Prints the @nodes content to @output.
205 print_xpath_nodes(xmlNodeSetPtr nodes, FILE* output) {
211 size = (nodes) ? nodes->nodeNr : 0;
213 fprintf(output, "Result (%d nodes):\n", size);
215 assert(nodes->nodeTab[i]);
217 if(nodes->nodeTab[i]->type == XML_NAMESPACE_DECL)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 11 // represents a set of CFG nodes and is a portion of an interval partition.
33 /// Interval Class - An Interval is a set of nodes defined such that every node
48 Nodes.push_back(Header);
53 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes;
57 /// Successors - List of BasicBlocks that are reachable directly from nodes in
59 /// These nodes necessarily must be header nodes for other intervals.
70 for (unsigned i = 0; i < Nodes.size(); ++i)
71 if (Nodes[i] == BB) return true
[all...] |
| /external/llvm/unittests/Analysis/ |
| LazyCallGraphTest.cpp | 127 // The order of the entry nodes should be stable w.r.t. the source order of
159 std::vector<std::string> Nodes;
162 Nodes.push_back(N.getFunction().getName());
163 std::sort(Nodes.begin(), Nodes.end());
164 EXPECT_EQ("a2", Nodes[0]);
165 EXPECT_EQ("b2", Nodes[1]);
166 EXPECT_EQ("c3", Nodes[2]);
167 Nodes.clear();
175 Nodes.push_back(N.getFunction().getName())
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/ |
| tree-rewrite.rb | 1010 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1011 nodes.token_stream = tokens
1012 walker = FlatListWalker::TreeParser.new( nodes )
1024 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1025 nodes.token_stream = tokens
1026 walker = SimpleTreeWalker::TreeParser.new( nodes )
1038 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree )
1039 nodes.token_stream = tokens
1040 walker = CombinedRewriteAndAutoWalker::TreeParser.new( nodes )
1048 nodes = ANTLR3::AST::CommonTreeNodeStream.new( result.tree
[all...] |
| /external/curl/tests/unit/ |
| unit1309.c | 70 /* number of nodes to add to the splay tree */
74 struct Curl_tree nodes[NUM_NODES]; variable in typeref:struct:Curl_tree
85 nodes[i].payload = (void *)key.tv_usec; /* for simplicity */
86 root = Curl_splayinsert(key, root, &nodes[i]);
97 (long)(nodes[rem].payload));
98 rc = Curl_splayremovebyaddr(root, &nodes[rem], &root);
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| MappingNode.java | 16 package org.yaml.snakeyaml.nodes;
65 for (NodeTuple nodes : value) {
66 nodes.getKeyNode().setType(keyType);
71 for (NodeTuple nodes : value) {
72 nodes.getValueNode().setType(valueType);
73 nodes.getKeyNode().setType(keyType);
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| EntityReference.java | 16 * <code>EntityReference</code> nodes may be used to represent an entity
23 * nodes. If it does provide such nodes, then for an
34 * <p>As for <code>Entity</code> nodes, <code>EntityReference</code> nodes and
36 * <p ><b>Note:</b> <code>EntityReference</code> nodes may cause element
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRBufferedTreeNodeStream.m | 49 nodes = [theStream getNodes];
56 return idx < [nodes count];
63 if (current < [nodes count]) {
65 return [nodes getEof];
70 @throw [ANTLRRuntimeException newException:@"cannot remove nodes from stream"];
81 @synthesize nodes;
116 nodes = [[AMutableArray arrayWithCapacity:DEFAULT_INITIAL_BUFFER_SIZE] retain];
133 nodes = [[AMutableArray arrayWithCapacity:DEFAULT_INITIAL_BUFFER_SIZE] retain];
150 nodes = [[AMutableArray arrayWithCapacity:DEFAULT_INITIAL_BUFFER_SIZE] retain];
170 nodes = [[AMutableArray arrayWithCapacity:bufferSize] retain]
[all...] |
| /external/opencv3/modules/objdetect/src/ |
| haar.cpp | 647 CvHidHaarTreeNode* nodes[8]; local
653 nodes[0] = (classifier+0)->node + idxV[0];
654 nodes[1] = (classifier+1)->node + idxV[1];
655 nodes[2] = (classifier+2)->node + idxV[2];
656 nodes[3] = (classifier+3)->node + idxV[3];
657 nodes[4] = (classifier+4)->node + idxV[4];
658 nodes[5] = (classifier+5)->node + idxV[5];
659 nodes[6] = (classifier+6)->node + idxV[6];
660 nodes[7] = (classifier+7)->node + idxV[7];
664 t = _mm256_mul_ps(t, _mm256_set_ps(nodes[7]->threshold
907 CvHidHaarTreeNode* nodes[8]; local
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| Graph.py | 21 The Graph class represents a directed graph with *N* nodes and *E* edges.
45 self.nodes, self.edges = {}, {}
61 return '<Graph: %d nodes, %d edges>' % (
73 # the nodes will contain tuples that will store incoming edges,
83 if node not in self.nodes:
84 self.nodes[node] = ([], [], node_data)
90 It may create the nodes if adding edges between nonexisting ones.
100 # add nodes if on automatic node creation
105 # update the corresponding incoming and outgoing lists in the nodes
110 self.nodes[tail_id][0].append(edge
[all...] |
| /external/llvm/utils/ |
| 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[1] = string.strip(nodes[1]
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/level2/core/ |
| documentimportnode21.java | 40 * second element node whose tagName is address and import these nodes into another document.
41 * Verify if the nodes have been imported correctly by checking the nodeNames of the
42 * imported nodes, since they are imported into a new document which doesnot have thes defined,
43 * the imported nodes should not have any children.
44 * Now import the entityRef nodes into the same document and verify if the nodes have been
45 * imported correctly by checking the nodeNames of the imported nodes, and by checking the
46 * value of the replacement text of the imported nodes.
97 NodeList nodes; local
120 nodes = entRefImp2.getChildNodes()
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/ |
| pytree.py | 57 Compare two nodes for equality.
69 Compare two nodes for inequality.
79 Compare two nodes for equality.
81 This is called by __eq__ and __ne__. It is only called if the two nodes
83 Nodes should be considered equal if they have the same structure,
241 """Concrete implementation for interior nodes."""
251 child nodes, and an optional context keyword argument.
286 """Compare two nodes for equality."""
353 """Concrete implementation for leaf nodes."""
397 """Compare two nodes for equality.""
[all...] |
