| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/resolver/ |
| ImplicitResolverTest.java | 29 import org.yaml.snakeyaml.nodes.Node;
30 import org.yaml.snakeyaml.nodes.ScalarNode;
31 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/v8/src/ast/ |
| prettyprinter.h | 27 // Individual nodes
70 // Individual nodes
107 // Individual nodes
|
| /external/v8/src/compiler/ |
| basic-block-instrumentor.cc | 21 // Find the first place to insert new nodes in a block that's already been
91 // Insert the new nodes.
98 // Tell the scheduler about the new nodes.
|
| /external/v8/test/unittests/compiler/ |
| state-values-utils-unittest.cc | 19 Node* StateValuesFromVector(NodeVector* nodes) {
20 int count = static_cast<int>(nodes->size());
22 count == 0 ? nullptr : &(nodes->front()));
|
| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| wpd_tree.cc | 40 // Variables used to create the rest of the nodes.
48 // not branched (all the nodes of that level are leaves).
87 // Variables used to update the rest of the nodes.
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_textsplittextone.java | 32 * two Text nodes at the specified offset keeping each node
38 * Text nodes keeping both of them in the tree. This test
40 * to ensure that the two nodes are indeed siblings.
|
| textsplittextone.java | 32 * two Text nodes at the specified offset keeping each node
38 * Text nodes keeping both of them in the tree. This test
40 * to ensure that the two nodes are indeed siblings.
|
| /libcore/luni/src/main/java/javax/xml/parsers/ |
| DocumentBuilderFactory.java | 163 * expand entity reference nodes. By default the value of this is set to
167 * reference nodes; false otherwise.
188 * convert CDATA nodes to Text nodes and append it to the
192 * @param coalescing true if the parser produced will convert CDATA nodes
193 * to Text nodes and append it to the adjacent (if any)
240 * parsers which expand entity reference nodes.
243 * which expand entity reference nodes; false otherwise.
264 * parsers which converts CDATA nodes to Text nodes and appends it t
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_except.py | 30 def find_excepts(nodes):
31 for i, n in enumerate(nodes):
34 yield (n, nodes[i+2])
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_except.py | 30 def find_excepts(nodes):
31 for i, n in enumerate(nodes):
34 yield (n, nodes[i+2])
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_except.py | 30 def find_excepts(nodes):
31 for i, n in enumerate(nodes):
34 yield (n, nodes[i+2])
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_except.py | 30 def find_excepts(nodes):
31 for i, n in enumerate(nodes):
34 yield (n, nodes[i+2])
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| ExplodedRenderingHelper.java | 127 if (type == Node.ELEMENT_NODE) { // ignore TEXT/CDATA nodes.
350 * Nodes with no id are ignored and not put in the map.
351 * @param nodes the nodes to fill the map with.
354 private Map<String, Node> computeIdNodeMap(Set<Node> nodes) {
356 for (Node node : nodes) {
377 * Returns a list of nodes for which a given attribute contains a reference to a given ID.
379 * @param nodes the list of nodes to search through
382 * @return a newly allocated, non-null, list of nodes. Could be empty
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlParser.java | 60 // The entire array of nodes
61 private List<HtmlDocument.Node> nodes; field in class:HtmlParser
189 // Use a LinkedList because we don't know the number of nodes ahead of
191 nodes = Lists.newLinkedList();
235 nodes = coalesceTextNodes(nodes);
237 HtmlDocument doc = new HtmlDocument(nodes);
238 nodes = null;
244 * During the course of parsing, we may have multiple adjacent Text nodes,
245 * due to the sanitizer stripping out nodes between Text nodes. It i
[all...] |
| /external/clang/utils/TableGen/ |
| TableGen.cpp | 104 clEnumValN(GenClangCommentNodes, "gen-clang-comment-nodes",
105 "Generate Clang AST comment nodes"),
106 clEnumValN(GenClangDeclNodes, "gen-clang-decl-nodes",
107 "Generate Clang AST declaration nodes"),
108 clEnumValN(GenClangStmtNodes, "gen-clang-stmt-nodes",
109 "Generate Clang AST statement nodes"),
|
| /external/deqp/framework/common/ |
| tcuTestHierarchyIterator.hpp | 87 * For group nodes the iterator will next enter first matching child node.
88 * For executable (test case) nodes STATE_LEAVE_NODE will always be reported
91 * STATE_LEAVE_NODE: Iterator is leaving a node. In case of group nodes this
92 * means that all child nodes and their children have been processed. For
93 * executable nodes the iterator will either move on to the next sibling,
102 * inflater is called to construct the list of child nodes for that group.
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdater.h | 43 /// insert PHI nodes, we keep track of them here.
50 /// PHI nodes are given a name based on ProtoName.
53 /// If this is non-null, the SSAUpdater adds all PHI nodes that it creates to
59 /// in with all PHI Nodes created by rewriting.
66 /// PHI nodes get a name based on 'Name'.
105 /// This handles PHI nodes, which use their value in the corresponding
|
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.h | 49 Node *nodes; member in class:llvm::SpillPlacement
51 // Nodes that are active in the current computation. Owned by the prepare()
55 // Nodes with active links. Populated by scanActiveBundles.
58 // Nodes that went positive during the last call to scanActiveBundles or
72 SpillPlacement() : MachineFunctionPass(ID), nodes(nullptr) {}
127 /// Return true is there are any positive nodes.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| DeletionHandler.java | 42 * deleted nodes
60 * @param deleted the deleted nodes
61 * @param moved nodes that were moved (e.g. deleted, but also inserted elsewhere)
62 * @param layout the parent layout of the deleted nodes
117 * nodes. This ensures that any constraints pointing to one of the deleted
118 * nodes are changed properly to point to a non-deleted node with similar
|
| /art/compiler/optimizing/ |
| instruction_simplifier_arm64.h | 20 #include "nodes.h"
56 * (1) No need to visit Phi nodes.
|
| /art/test/utils/python/testgen/ |
| utils.py | 64 nodes for a tree with a total of 'n' leaf nodes.
|
| /developers/build/prebuilts/gradle/DataLayer/Wearable/src/main/java/com/example/android/wearable/datalayer/ |
| MainActivity.java | 189 * Find the connected nodes that provide at least one of the given capabilities
211 Set<Node> nodes = new HashSet<>();
214 showDiscoveredNodes(nodes);
220 nodes.addAll(capabilityInfo.getNodes());
223 showDiscoveredNodes(nodes);
226 private void showDiscoveredNodes(Set<Node> nodes) {
228 for (Node node : nodes) {
231 LOGD(TAG, "Connected Nodes: " + (nodesList.isEmpty()
|
| /developers/samples/android/wearable/wear/DataLayer/Wearable/src/main/java/com/example/android/wearable/datalayer/ |
| MainActivity.java | 189 * Find the connected nodes that provide at least one of the given capabilities
211 Set<Node> nodes = new HashSet<>();
214 showDiscoveredNodes(nodes);
220 nodes.addAll(capabilityInfo.getNodes());
223 showDiscoveredNodes(nodes);
226 private void showDiscoveredNodes(Set<Node> nodes) {
228 for (Node node : nodes) {
231 LOGD(TAG, "Connected Nodes: " + (nodesList.isEmpty()
|
| /development/samples/browseable/DataLayer/Wearable/src/com.example.android.wearable.datalayer/ |
| MainActivity.java | 189 * Find the connected nodes that provide at least one of the given capabilities
211 Set<Node> nodes = new HashSet<>();
214 showDiscoveredNodes(nodes);
220 nodes.addAll(capabilityInfo.getNodes());
223 showDiscoveredNodes(nodes);
226 private void showDiscoveredNodes(Set<Node> nodes) {
228 for (Node node : nodes) {
231 LOGD(TAG, "Connected Nodes: " + (nodesList.isEmpty()
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeWizard.cs | 52 * In order to create nodes and navigate, this class needs a TreeAdaptor.
55 * iterating over the various nodes with a particular type.
133 * nodes such as function definition nodes (you'll want to seek
135 * dynamic searches; i.e., go find me all PLUS nodes.
205 * Walk the entire tree and make a node name to nodes mapping.
242 public FindTreeWizardVisitor(IList nodes) {
243 _nodes = nodes;
266 /** <summary>Return a List of tree nodes with token type ttype</summary> */
268 IList nodes = new List<object>()
[all...] |
