| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NodeVector.java | 28 * A very simple table that stores a list of Nodes.
42 * Array of nodes this points to.
48 * Number of nodes in this NodeVector.
104 * @return Number of nodes in this NodeVector
237 * Push a pair of nodes into the stack.
272 * Pop a pair of nodes from the tail of the stack.
392 * Append the nodes to the list.
394 * @param nodes NodeVector to append to this list
396 public void appendNodes(NodeVector nodes)
399 int nNodes = nodes.size()
[all...] |
| /external/autotest/client/cros/audio/ |
| cras_dbus_utils.py | 187 same. This happens when there is change in unplugged nodes,
205 logging.debug('nodes = %s', pprint.pformat(self._nodes))
230 logging.debug('Getting nodes.')
231 nodes = cras_utils.get_cras_nodes()
232 logging.debug('nodes = %s', pprint.pformat(nodes))
233 if self._ignore_redundant and self._nodes == nodes:
234 logging.debug('Nodes did not change. Ignore redundant signal')
277 """Error for unexpected nodes changed."""
282 """Waits for unexpected nodes changed signal in this blocking call
[all...] |
| /external/snakeyaml/src/test/java/examples/ |
| DiceExampleTest.java | 29 import org.yaml.snakeyaml.nodes.Node;
30 import org.yaml.snakeyaml.nodes.ScalarNode;
31 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/ |
| Chapter2_4Test.java | 31 import org.yaml.snakeyaml.nodes.Node;
32 import org.yaml.snakeyaml.nodes.ScalarNode;
33 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/emitter/ |
| EventConstructor.java | 38 import org.yaml.snakeyaml.nodes.MappingNode;
39 import org.yaml.snakeyaml.nodes.Node;
40 import org.yaml.snakeyaml.nodes.ScalarNode;
|
| /external/v8/src/compiler/ |
| js-graph.cc | 200 void JSGraph::GetCachedNodes(NodeVector* nodes) {
201 cache_.GetCachedNodes(nodes);
204 if (!node->IsDead()) nodes->push_back(node);
|
| /external/v8/test/cctest/compiler/ |
| test-osr.cc | 6 #include "src/compiler/all-nodes.h"
118 AllNodes nodes(main_zone(), &graph);
120 CHECK(!nodes.IsLive(osr_normal_entry));
121 CHECK(!nodes.IsLive(osr_loop_entry));
122 // No dangling nodes should be left over.
123 for (Node* const node : nodes.live) {
125 CHECK(std::find(nodes.live.begin(), nodes.live.end(), use) !=
126 nodes.live.end());
183 AllNodes nodes(T.main_zone(), &T.graph)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_cpickle.py | 204 nodes = [Node() for i in range(500)]
205 for n in nodes:
206 n.connections = list(nodes)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_cpickle.py | 204 nodes = [Node() for i in range(500)]
205 for n in nodes:
206 n.connections = list(nodes)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_cpickle.py | 204 nodes = [Node() for i in range(500)]
205 for n in nodes:
206 n.connections = list(nodes)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_cpickle.py | 204 nodes = [Node() for i in range(500)]
205 for n in nodes:
206 n.connections = list(nodes)
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionOverlay.java | 157 private void paintSelectionFeedback(GCWrapper gcWrapper, List<NodeProxy> nodes,
161 // Group nodes into parent/child groups
163 for (INode node : nodes) {
173 for (INode node : nodes) {
|
| /external/ImageMagick/MagickCore/ |
| quantize.c | 89 % prohibitive because the tree's total number of nodes is 1 +
92 % A complete tree would require 19,173,961 nodes for k = 8, Cmax = 255.
94 % Initializes data structures for nodes only as they are needed; (2)
108 % lower depth in the tree; initially, n2 = 0 for all nodes except
117 % within a node and the nodes' center. This represents the
120 % Reduction repeatedly prunes the tree until the number of nodes with n2
123 % those nodes whose E count is minimal for pruning and merges their color
128 % while number of nodes with (n2 > 0) > required maximum number of colors
129 % prune all nodes such that E <= Ep
130 % Set Ep to minimum E in remaining nodes
253 *nodes; member in struct:_Nodes
283 nodes, member in struct:_CubeInfo
1343 *nodes; local
2112 *nodes; local
[all...] |
| statistic.c | 2513 *nodes; member in struct:_SkipList
[all...] |
| /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...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeWizard.cs | 53 * In order to create nodes and navigate, this class needs a TreeAdaptor.
56 * iterating over the various nodes with a particular type.
151 * nodes such as function definition nodes (you'll want to seek
153 * dynamic searches; i.e., go find me all PLUS nodes.
232 * Walk the entire tree and make a node name to nodes mapping.
275 public FindTreeWizardVisitor( IList nodes )
277 _nodes = nodes;
305 /** <summary>Return a List of tree nodes with token type ttype</summary> */
308 IList nodes = new List<object>()
[all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_find.c | 47 enum cil_flavor f1 = ((struct cil_tree_node*)d1->nodes->head->data)->flavor;
48 enum cil_flavor f2 = ((struct cil_tree_node*)d2->nodes->head->data)->flavor;
80 enum cil_flavor f1 = ((struct cil_tree_node*)d1->nodes->head->data)->flavor;
81 enum cil_flavor f2 = ((struct cil_tree_node*)d2->nodes->head->data)->flavor;
117 struct cil_tree_node *n1 = s1->nodes->head->data;
|
| /external/snakeyaml/src/test/java/org/pyyaml/ |
| PyStructureTest.java | 34 import org.yaml.snakeyaml.nodes.MappingNode;
35 import org.yaml.snakeyaml.nodes.Node;
36 import org.yaml.snakeyaml.nodes.NodeTuple;
37 import org.yaml.snakeyaml.nodes.ScalarNode;
38 import org.yaml.snakeyaml.nodes.SequenceNode;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| MoveHandler.java | 65 // Compute list of nodes being dragged within the layout, if any
66 List<INode> nodes = new ArrayList<INode>(); local
70 nodes.add(view.node);
73 mDraggedNodes = nodes;
75 mHorizontalDeps = mDependencyGraph.dependsOn(nodes, false /* verticalEdge */);
76 mVerticalDeps = mDependencyGraph.dependsOn(nodes, true /* verticalEdge */);
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2DynamicTree.cpp | 699 int32* nodes = (int32*)b2Alloc(m_nodeCount * sizeof(int32)); local
714 nodes[count] = i;
729 b2AABB aabbi = m_nodes[nodes[i]].aabb;
733 b2AABB aabbj = m_nodes[nodes[j]].aabb;
746 int32 index1 = nodes[iMin];
747 int32 index2 = nodes[jMin];
762 nodes[jMin] = nodes[count-1];
763 nodes[iMin] = parentIndex;
767 m_root = nodes[0]
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/loader/ |
| G3dModelLoader.java | 277 JsonValue nodes = json.get("nodes");
local
278 if (nodes != null) {
279 model.nodes.ensureCapacity(nodes.size);
280 for (JsonValue node = nodes.child; node != null; node = node.next) {
281 model.nodes.add(parseNodesRecursively(node));
285 return model.nodes;
377 JsonValue nodes = anim.get("bones");
local
378 if (nodes == null) continue;
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
| SafeConstructor.java | 36 import org.yaml.snakeyaml.nodes.MappingNode;
37 import org.yaml.snakeyaml.nodes.Node;
38 import org.yaml.snakeyaml.nodes.NodeId;
39 import org.yaml.snakeyaml.nodes.NodeTuple;
40 import org.yaml.snakeyaml.nodes.ScalarNode;
41 import org.yaml.snakeyaml.nodes.SequenceNode;
42 import org.yaml.snakeyaml.nodes.Tag;
71 // perform merging only on nodes containing merge node(s)
|
| /prebuilts/sdk/tools/jacks/ |
| jack-2.28.RELEASE.jar | |
| /frameworks/base/libs/hwui/ |
| FrameBuilder.cpp | 134 void FrameBuilder::deferRenderNodeScene(const std::vector< sp<RenderNode> >& nodes,
136 if (nodes.size() < 1) return;
137 if (nodes.size() == 1) {
138 if (!nodes[0]->nothingToDraw()) {
139 deferRenderNode(*nodes[0]);
143 // It there are multiple render nodes, they are laid out as follows:
146 // #2 - additional overlay nodes
152 // Additional nodes will be drawn on top with no particular clipping semantics.
159 const Rect backdrop = nodeBounds(*nodes[0]);
164 if (!content.contains(backdrop) && !nodes[0]->nothingToDraw())
[all...] |
| /build/kati/ |
| ninja.go | 73 nodes []*DepNode
84 n.nodes = g.nodes
720 for _, node := range n.nodes {
728 // emit phony targets for visited nodes that are
731 var nodes []string
736 nodes = append(nodes, node)
738 if len(nodes) > 0 {
740 sort.Strings(nodes)
[all...] |
