| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTMdefaultNamespaceDeclarationNode.java | 192 * Tests whether two nodes are equal.
193 * <br>This method tests for equality of nodes, not sameness (i.e.,
194 * whether the two nodes are references to the same object) which can be
195 * tested with <code>Node.isSameNode</code>. All nodes that are the same
197 * <br>Two nodes are equal if and only if the following conditions are
198 * satisfied: The two nodes are of the same type.The following string
209 * same length and contain equal nodes at the same index. This is true
210 * for <code>Attr</code> nodes as for any other type of node. Note that
211 * normalization can affect equality; to avoid this, nodes should be
213 * <br>For two <code>DocumentType</code> nodes to be equal, the followin
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 184 NodeVector Nodes;
195 assert(NId < Nodes.size() && "Out of bound NodeId");
196 return Nodes[NId];
199 assert(NId < Nodes.size() && "Out of bound NodeId");
200 return Nodes[NId];
211 Nodes[NId] = std::move(N);
213 NId = Nodes.size();
214 Nodes.push_back(std::move(N));
234 // Add the edge to the adjacency sets of its nodes.
255 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds)
[all...] |
| /prebuilts/tools/linux-x86_64/kythe/proto/ |
| xref.proto | 49 // TODO(schroederc): break off Nodes/Edges into a separate service
51 // Nodes returns a subset of the facts for each of the requested nodes.
52 rpc Nodes(NodesRequest) returns (NodesReply) {}
55 // requested nodes.
58 // Decorations returns an index of the nodes and edges associated with a
63 // documentation of a set of requested nodes.
83 // nodes in the graph.
88 // The tickets of the nodes to be looked up.
94 // nodes. For different filters per node, the client must issue separat
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 190 // Both leaf and branch nodes store vectors of pairs.
197 // The nodes don't know how many elements they contain - that information is
202 // wasted space when nodes are sized to fit in three cache lines (192 bytes):
325 /// IntervalMapImpl::adjustSiblingSizes - Move elements between sibling nodes.
326 /// @param Node Array of pointers to sibling nodes.
327 /// @param Nodes Number of nodes.
331 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes,
334 for (int n = Nodes - 1; n; --n) {
348 if (Nodes == 0
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarAST.java | 50 * class to track variables for many different kinds of nodes. It wastes
51 * space for nodes that don't need the values and OO principles cry out
75 /** This is used for TREE_BEGIN nodes to point into
81 /** Rule ref nodes, token refs, set, and NOT set refs need to track their
402 List<GrammarAST> nodes = new ArrayList<GrammarAST>(); local
403 _findAllType(ttype, nodes);
404 return nodes;
407 public void _findAllType(int ttype, List<GrammarAST> nodes) {
409 if ( this.getType()==ttype ) nodes.add(this);
413 child._findAllType(ttype, nodes);
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMIterator.java | 26 * filtered) set of nodes. Their API is modeled largely after the DOM
136 * Nodes not accepted by
146 * reference nodes are visible to the iterator. If false, they and
155 * nodes but no entity expansion, use the <code>whatToShow</code> flags
205 * nodes (as part of the maintain-relative-position semantic).
223 * If setShouldCacheNodes(true) is called, then nodes will
230 * @param b true if the nodes should be cached.
235 * Tells if this iterator can have nodes added to it or set via
272 * <code>index</code> is greater than or equal to the number of nodes in
298 * The number of nodes in the list. The range of valid child node indice
[all...] |
| /external/regex-re2/re2/ |
| prefilter_tree.cc | 98 // Identify nodes that are too common among prefilters and are
108 // nodes and have other things guarding them, then get rid of
110 // make it a function of total number of nodes?
144 // Adding the operation disambiguates AND/OR/atom nodes.
161 // Build vector of all filter nodes, sorted topologically
165 // Add the top level nodes of each regexp prefilter.
172 // mapping of index==regexpid for level=0 prefilter nodes.
176 // Now add all the descendant nodes.
188 // Identify unique nodes.
197 // Any further nodes that have the same node strin
[all...] |
| /external/autotest/client/common_lib/ |
| control_data.py | 242 for value in expr.nodes:
270 assert(n.nodes.__class__ == list)
271 assert(len(n.nodes) == 1)
272 assert(n.nodes[0].__class__ == compiler.ast.AssName)
273 assert(n.nodes[0].flags.__class__ == str)
274 assert(n.nodes[0].name.__class__ == str)
277 key = n.nodes[0].name.lower()
302 assert(mod.node.nodes.__class__ == list)
305 for n in mod.node.nodes:
|
| /external/conscrypt/src/test/java/org/conscrypt/ |
| ChainStrengthAnalyzerTest.java | 29 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
55 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
72 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
95 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
121 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
146 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
171 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
188 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
210 //openssl req -x509 -nodes -days 365 -subj '/C=US/ST=Testsota/L=Testville/CN=test.com' \
|
| /prebuilts/go/darwin-x86/src/syscall/ |
| syscall_netbsd.go | 31 func sysctlNodes(mib []_C_int) (nodes []Sysctlnode, err error) {
34 // Get a list of all sysctl nodes below the given MIB by performing
44 // Now that we know the size, get the actual nodes.
45 nodes = make([]Sysctlnode, olen/sz)
46 np := (*byte)(unsafe.Pointer(&nodes[0]))
51 return nodes, nil
67 // Discover the nodes and construct the MIB OID.
69 nodes, err := sysctlNodes(mib)
73 for _, node := range nodes {
|
| /prebuilts/go/linux-x86/src/syscall/ |
| syscall_netbsd.go | 31 func sysctlNodes(mib []_C_int) (nodes []Sysctlnode, err error) {
34 // Get a list of all sysctl nodes below the given MIB by performing
44 // Now that we know the size, get the actual nodes.
45 nodes = make([]Sysctlnode, olen/sz)
46 np := (*byte)(unsafe.Pointer(&nodes[0]))
51 return nodes, nil
67 // Discover the nodes and construct the MIB OID.
69 nodes, err := sysctlNodes(mib)
73 for _, node := range nodes {
|
| /toolchain/binutils/binutils-2.25/libiberty/ |
| fibheap.c | 118 heap->nodes++;
161 /* Merge them to the next nodes on the opposite chain. */
167 heapa->nodes += heapb->nodes;
184 /* If we don't have a min set, it means we have no nodes. */
287 return heap->nodes == 0;
310 heap->nodes--;
312 /* If we are left with no nodes, then the min is NULL. */
313 if (heap->nodes == 0)
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| CommonTreeAdaptor.as | 12 * To get your parser to build nodes of a different type, override
14 * dupNode is called to duplicate nodes during rewrite operations.
34 /** Tell me how to create a token for use with imaginary token nodes.
46 /** Tell me how to create a token for use with imaginary token nodes.
65 * Only works with Tree nodes. For rules that match nothing,
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| CommonTreeAdaptor.cs | 44 * To get your parser to build nodes of a different type, override
46 * dupNode is called to duplicate nodes during rewrite operations.
72 * Tell me how to create a token for use with imaginary token nodes.
88 * Tell me how to create a token for use with imaginary token nodes.
111 * Only works with Tree nodes. For rules that match nothing,
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| CommonTreeAdaptor.java | 39 * To get your parser to build nodes of a different type, override
41 * dupNode is called to duplicate nodes during rewrite operations.
59 /** Tell me how to create a token for use with imaginary token nodes.
71 /** Tell me how to create a token for use with imaginary token nodes.
90 * Only works with Tree nodes. For rules that match nothing,
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| dot.rb | 43 Abstract Syntax Tree nodes.
78 | <%= @nodes.join("\n ") %>
109 tree_template = Context.new( tree_template, :nodes => [], :edges => [] )
125 tree_template[ :nodes ] << parent_node_template
134 tree_template[ :nodes ] << node_template
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| FuncKey.java | 61 XNodeSet nodes = null; local
138 nodes = new XNodeSet(upi);
143 nodes = kmgr.getNodeSetDTMByKey(xctxt, docContext, keyname,
146 nodes.setRoot(xctxt.getCurrentNode(), xctxt);
149 return nodes;
|
| /external/boringssl/src/crypto/x509v3/ |
| pcy_int.h | 132 /* This structure represents the relationship between nodes */
140 /* Number of child nodes */
148 /* nodes at this level */
149 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st
162 /* Extra policy data when additional nodes (not from the certificate)
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| DefaultNodeCreator.java | 41 List<Node> nodes = Lists.newArrayList(); local
44 nodes.addAll(binding.acceptTargetVisitor(visitor));
46 return nodes;
50 * {@link BindingTargetVisitor} that adds nodes to the graph based on the visited {@link Binding}.
109 * Visitor for {@link InstanceBinding}. We render two nodes in this case: an interface node for
|
| /external/libweave/src/notification/ |
| xml_node.h | 36 // Returns the list of child nodes, if any.
57 // Finds all the child nodes matching the |name_path|. This returns the list
58 // of pointers to the child nodes matching the criteria. If |recursive| is
70 // Then recursively searching for nodes will produce the following results
104 // If |children| parameter is not nullptr, found nodes are added to the
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.h | 30 /// nodes into a single SUnit so that they are scheduled together.
85 /// excludes nodes that aren't interesting to scheduling, and represents
86 /// flagged together nodes with a single SUnit.
100 /// Schedule - Order nodes according to selected style, filling
167 /// ClusterNodes - Cluster certain nodes which should be scheduled together.
|
| /external/mesa3d/src/glsl/ |
| loop_unroll.cpp | 55 int nodes; member in class:loop_unroll_count
60 nodes = 0;
68 nodes++;
74 nodes++;
117 if (count.fail || count.nodes * iterations > (int)max_iterations * 5)
|
| /external/snakeyaml/src/test/java/examples/jodatime/ |
| JodaTimeFlowStylesTest.java | 32 import org.yaml.snakeyaml.nodes.Node;
33 import org.yaml.snakeyaml.nodes.NodeId;
34 import org.yaml.snakeyaml.nodes.Tag;
50 // compare Nodes with flow style AUTO and flow style BLOCK
72 // Nodes and Events are the same. Only emitter may influence the output.
|
| /external/v8/src/compiler/ |
| osr.h | 12 // special control nodes that are added at graph building time. In particular,
40 // {OsrValue} nodes that merge into any phis associated with the OSR loop.
41 // In the above diagram, nodes {A} and {B} represent values in the "normal"
70 // Other than the presences of the OsrValue nodes, this is a normal, schedulable
71 // graph. OsrValue nodes are handled specially in the instruction selector to
|
| /frameworks/support/design/src/android/support/design/widget/ |
| DirectedAcyclicGraph.java | 61 * <p>Both the given nodes should already have been added to the graph through
69 throw new IllegalArgumentException("All nodes must be present in the graph before"
94 * Get any outgoing edges for the given node (i.e. nodes which have an incoming edge
138 * Returns a topologically sorted list of the nodes in this graph. This uses the DFS algorithm
143 * of the graph. The node at the end of the list will have no dependencies on other nodes.</p>
|
