| /external/clang/include/clang/AST/ |
| ASTDiagnostic.h | 28 /// involve AST nodes.
30 /// This function formats diagnostic arguments for various AST nodes,
|
| /external/icu/tools/srcgen/currysrc/src/main/java/com/google/currysrc/processors/ |
| BaseJavadocNodeScanner.java | 31 * A base class for processors that process Javadoc nodes and may rewrite the AST. All Javadoc nodes
|
| /external/kernel-headers/original/uapi/linux/ |
| mempolicy.h | 29 MPOL_REBIND_STEP1, /* first step(set all the newly nodes) */
30 MPOL_REBIND_STEP2, /* second step(clean all the disallowed nodes)*/
|
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/model/data/ |
| ModelData.java | 24 /** Returned by a {@link ModelLoader}, contains meshes, materials, nodes and animations. OpenGL resources like textures or vertex
32 public final Array<ModelNode> nodes = new Array<ModelNode>();
field in class:ModelData
|
| /external/libxml2/include/libxml/ |
| pattern.h | 3 * Description: allows to compile and test pattern expressions for nodes
27 * A compiled (XPath based) pattern to select nodes
|
| /external/llvm/utils/ |
| DSAclean.py | 5 #nodes such as %tmp.1.i and %tmp._i.3
9 #10/12/2005: now it only removes nodes and edges for which the label is %tmp.# rather
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| ScalarNode.java | 16 package org.yaml.snakeyaml.nodes;
23 * Scalar nodes form the leaves in the node graph.
|
| /external/snakeyaml/src/patches/android/ |
| Representer.patch | 20 import org.yaml.snakeyaml.nodes.MappingNode;
21 import org.yaml.snakeyaml.nodes.Node;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue111/ |
| LongUriTest.java | 23 import org.yaml.snakeyaml.nodes.Node;
24 import org.yaml.snakeyaml.nodes.ScalarNode;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue127/ |
| NullAliasTest.java | 24 import org.yaml.snakeyaml.nodes.Node;
25 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue48/ |
| SkipJavaBeanPropertyTest.java | 22 import org.yaml.snakeyaml.nodes.NodeTuple;
23 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| TagsTest.java | 16 package org.yaml.snakeyaml.nodes;
27 assertEquals(new Tag("tag:yaml.org,2002:org.yaml.snakeyaml.nodes.TagsTest"), new Tag(
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/serializer/ |
| AnchorGeneratorTest.java | 21 import org.yaml.snakeyaml.nodes.Node;
22 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/squashfs-tools/RELEASE-READMEs/ |
| README-4.0 | 20 This, for example, allows device nodes to be added to the filesystem without
27 Pseudo device nodes are specified using 7 arguments
|
| /external/v8/src/compiler/ |
| control-equivalence.h | 16 // Determines control dependence equivalence classes for control nodes. Any two
17 // nodes having the same set of control dependences land in one class. These
23 // class numbers. Any two nodes are cycle equivalent if they occur in the same
42 // 1) A breadth-first backwards traversal to determine the set of nodes that
45 // numbers for all participating nodes. Takes O(E) time and O(N) space.
104 // Performs and undirected DFS walk of the graph. Conceptually all nodes are
105 // expanded, splitting "input" and "use" out into separate nodes. During the
106 // traversal, edges towards the representative nodes are preferred.
|
| state-values-utils.h | 33 // ValueArray - array of nodes ({node} has to be nullptr).
50 Node* GetValuesNodeFromCache(Node** nodes, size_t count);
|
| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| NodeBuilderTest.java | 56 s -> Nodes.builder(),
57 s -> Nodes.builder(s, LambdaTestHelpers.integerArrayGenerator)
101 s -> Nodes.intBuilder(),
102 s -> Nodes.intBuilder(s)
151 s -> Nodes.longBuilder(),
152 s -> Nodes.longBuilder(s)
201 s -> Nodes.doubleBuilder(),
202 s -> Nodes.doubleBuilder(s)
|
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlDocument.java | 33 * HtmlDocument is a container for a list of html nodes, and represents the
42 private final List<Node> nodes; field in class:HtmlDocument
46 * @param nodes list of html nodes
48 public HtmlDocument(List<Node> nodes) {
49 this.nodes = nodes;
52 /** Gets the list of nodes */
54 return nodes;
59 StringBuilder sb = new StringBuilder(nodes.size() * 10)
1167 private final List<Node> nodes = new ArrayList<Node>(); field in class:HtmlDocument.Builder
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| mempolicy.h | 28 MPOL_REBIND_STEP1, /* first step(set all the newly nodes) */
29 MPOL_REBIND_STEP2, /* second step(clean all the disallowed nodes)*/
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| objectgraph.rst | 55 values for nodes.
89 Yield all nodes that are entirely reachable by *condition*
96 .. method:: ObjectGraph.nodes()
98 Yield all nodes in the graph.
102 Returns two iterators that yield the nodes reaching by
107 Filter the ObjectGraph in-place by removing all edges to nodes that
|
| /external/chromium-trace/catapult/tracing/tracing/extras/tquery/ |
| tquery.html | 76 // List of nodes in order from the current one to the root.
77 var nodes = [];
80 nodes.push(node);
86 for (var i = nodes.length - 1; i >= 0; i--) {
87 var node = nodes[i];
100 var prevNode = nodes[i + 1];
|
| /external/iptables/extensions/ |
| libxt_cluster.c | 17 " --cluster-total-nodes <num> Set number of total nodes in cluster\n"
36 {.name = "cluster-total-nodes", .id = O_CL_TOTAL_NODES,
81 "must be <= `--cluster-total-nodes'");
91 "for `--cluster-total-nodes'");
125 printf(" --cluster-total-nodes %u --cluster-hash-seed 0x%08x",
|
| /external/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 85 std::vector<CallGraphNode*> Nodes;
91 Nodes.assign(I, E);
94 bool isSingular() const { return Nodes.size() == 1; }
95 unsigned size() const { return Nodes.size(); }
102 iterator begin() const { return Nodes.begin(); }
103 iterator end() const { return Nodes.end(); }
|
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 24 // The isScheduleHigh flag allows nodes with wraparound dependencies that
41 // After that, if two nodes have identical latencies, look to see if one will
42 // unblock more other nodes than the other.
74 // Look at all of the successors of this node. Count the number of nodes that
88 // scheduledNode - As nodes are scheduled, we look to see if there are any
89 // successor nodes that have a single unscheduled predecessor. If so, that
|
| /external/regex-re2/re2/ |
| prefilter_tree.h | 55 // nodes of the prefilter of the regexp.
69 // of the parent nodes to trigger. The reason there may be more than
71 // are two different nodes, but they share the atom 'def'. So when
73 // different OR nodes.
83 // prefilter, by looking at if these nodes are already in the
105 // These are all the nodes formed by Compile. Essentially, there is
|
