| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-dump.h | 68 /* The first node in the queue of nodes to be written out. */
72 /* Free queue nodes. */
74 /* The tree nodes which we have already written out. The
75 keys are the addresses of the nodes; the values are the integer
77 splay_tree nodes; member in struct:dump_info
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| DynamicContextMenu.java | 165 List<INode> nodes = new ArrayList<INode>(selections.size()); local
167 nodes.add(item.getNode());
170 List<IContributionItem> menuItems = getMenuItems(nodes);
182 * collection of nodes
184 * @param nodes the collection of nodes to look up actions for
185 * @return a list of contribution items applicable for all the nodes
187 private List<IContributionItem> getMenuItems(List<INode> nodes) {
189 for (INode node : nodes) {
201 // the set of all selected nodes to that first action. Actions are require
[all...] |
| /toolchain/binutils/binutils-2.25/include/ |
| fibheap.h | 54 size_t nodes; member in struct:fibheap
|
| /prebuilts/go/darwin-x86/src/cmd/pprof/internal/report/ |
| source.go | 36 // Group nodes for each matching function.
37 var functions nodes
38 functionNodes := make(map[string]nodes)
55 // Group nodes for each source file.
56 var sourceFiles nodes
57 fileNodes := make(map[string]nodes)
137 var sourceFiles nodes
138 fileNodes := make(map[string]nodes)
183 func sourceCoordinates(asm map[int]nodes) (start, end int) {
198 func assemblyPerSourceLine(objSyms []*objSymbol, rs nodes, src string, obj plugin.ObjTool) map[int]nodes
[all...] |
| /prebuilts/go/linux-x86/src/cmd/pprof/internal/report/ |
| source.go | 36 // Group nodes for each matching function.
37 var functions nodes
38 functionNodes := make(map[string]nodes)
55 // Group nodes for each source file.
56 var sourceFiles nodes
57 fileNodes := make(map[string]nodes)
137 var sourceFiles nodes
138 fileNodes := make(map[string]nodes)
183 func sourceCoordinates(asm map[int]nodes) (start, end int) {
198 func assemblyPerSourceLine(objSyms []*objSymbol, rs nodes, src string, obj plugin.ObjTool) map[int]nodes
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiActions.java | 141 public void doRemove(final List<UiElementNode> nodes, Shell shell) {
143 if (nodes == null || nodes.size() == 0) {
147 final int len = nodes.size();
150 for (UiElementNode node : nodes) {
167 UiElementNode node = nodes.get(i);
374 final List<UiElementNode> nodes,
376 if (nodes == null || nodes.size() < 1) {
388 for (int i = nodes.size() - 1; i >= 0; i--)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
| DebugTreeGrammarHelper.cs | 52 public DebugTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions )
53 : this( nodes )
|
| ProfileTreeGrammarHelper.cs | 52 public ProfileTreeGrammar( CommonTreeNodeStream nodes, List<CommonTree> functionDefinitions )
53 : this( nodes )
|
| /external/jemalloc/test/unit/ |
| rb.c | 86 /* Red nodes must be interleaved with black nodes. */
224 assert_u_gt(*nnodes, 0, "Destruction removed too many nodes");
236 node_t nodes[NNODES]; local
258 /* Initialize tree and nodes. */
261 nodes[k].magic = NODE_MAGIC;
262 nodes[k].key = bag[k];
265 /* Insert nodes. */
267 tree_insert(&tree, &nodes[k]);
288 tree_next(&tree, &nodes[k])
[all...] |
| /external/libdrm/tests/ |
| drmdevice.c | 40 printf("\t\tnodes[%d] %s\n", j, device->nodes[j]);
96 fd = open(devices[i]->nodes[j], O_RDONLY | O_CLOEXEC, 0);
|
| /external/snakeyaml/src/test/java/examples/ |
| IgnoreTagsExampleTest.java | 29 import org.yaml.snakeyaml.nodes.Node;
30 import org.yaml.snakeyaml.nodes.Tag;
|
| SelectiveConstructorTest.java | 25 import org.yaml.snakeyaml.nodes.MappingNode;
26 import org.yaml.snakeyaml.nodes.NodeId;
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/serializer/ |
| SerializerTest.java | 26 import org.yaml.snakeyaml.nodes.ScalarNode;
27 import org.yaml.snakeyaml.nodes.Tag;
|
| /external/snakeyaml/src/test/java8/org/yaml/snakeyaml/issues/issue310/ |
| OptionalTest.java | 26 import org.yaml.snakeyaml.nodes.Node;
27 import org.yaml.snakeyaml.nodes.Tag;
|
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| issue8017.go | 7 // Issues 8017 and 8058: walk modifies nodes generated
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| issue8017.go | 7 // Issues 8017 and 8058: walk modifies nodes generated
|
| /external/chromium-trace/catapult/telemetry/third_party/webpagereplay/third_party/dns/ |
| zone.py | 51 A Zone is a mapping from names to nodes. The zone object may be
62 @ivar nodes: A dictionary mapping the names of nodes in the zone to the
63 nodes themselves.
64 @type nodes: dict
73 __slots__ = ['rdclass', 'origin', 'nodes', 'relativize']
85 self.nodes = {}
90 nodes.
98 self.nodes != other.nodes
[all...] |
| /external/testng/src/main/java/org/testng/internal/ |
| DynamicGraph.java | 35 * Define a comparator for the nodes of this graph, which will be used
36 * to order the free nodes when they are asked.
50 * Add an edge between two nodes.
58 * @return a set of all the nodes that don't depend on any other nodes.
66 // - no other nodes depend on it
74 // Sort the free nodes if requested (e.g. priorities)
78 ppp("Nodes after sorting:" + result.get(0));
86 * @return a list of all the nodes that have a status other than FINISHED.
88 private Collection<? extends T> getUnfinishedNodes(List<T> nodes) {
200 List<T> nodes = m_dependingOn.get(k); local
[all...] |
| /external/v8/test/unittests/compiler/ |
| node-properties-unittest.cc | 24 Node* nodes[] = {n1}; local
25 return Node::New(zone(), 0, op, arraysize(nodes), nodes, false);
28 Node* nodes[] = {n1, n2}; local
29 return Node::New(zone(), 0, op, arraysize(nodes), nodes, false);
|
| /prebuilts/go/darwin-x86/doc/play/ |
| peano.go | 2 // list whose nodes contain no data
3 // (the nodes are the data).
18 // count of the nodes comprising the list.
|
| /prebuilts/go/linux-x86/doc/play/ |
| peano.go | 2 // list whose nodes contain no data
3 // (the nodes are the data).
18 // count of the nodes comprising the list.
|
| /external/opencv3/modules/core/include/opencv2/core/ |
| operations.hpp | 449 int (*nodes)[2] = (int(*)[2])&_nodes[0];
454 nodes[i][PARENT]=-1;
455 nodes[i][RANK] = 0;
464 while( nodes[root][PARENT] >= 0 )
465 root = nodes[root][PARENT];
473 while( nodes[root2][PARENT] >= 0 )
474 root2 = nodes[root2][PARENT];
479 int rank = nodes[root][RANK], rank2 = nodes[root2][RANK];
481 nodes[root2][PARENT] = root
[all...] |
| /build/kati/ |
| depgraph.go | 29 nodes []*DepNode
36 // Nodes returns all rules.
37 func (g *DepGraph) Nodes() []*DepNode { return g.nodes }
66 for _, n := range g.nodes {
182 nodes, err := db.Eval(req.Targets)
196 nodes: nodes,
204 err = evalCommands(nodes, vars)
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_object_graph.py | 212 nodes = graph.nodes()
214 self.assertTrue(hasattr(nodes, 'next'))
216 self.assertTrue(hasattr(nodes, '__next__'))
217 self.assertTrue(hasattr(nodes, '__iter__'))
219 nodes = list(nodes)
220 self.assertEqual(len(nodes), 6)
221 self.assertTrue(n1 in nodes)
222 self.assertTrue(n2 in nodes)
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-js-constant-cache.cc | 205 Node* nodes[] = {T.UndefinedConstant(), T.TheHoleConstant(), T.TrueConstant(), local
210 for (size_t i = 0; i < arraysize(nodes); i++) {
211 for (size_t j = 0; j < arraysize(nodes); j++) {
212 if (i != j) CHECK_NE(nodes[i], nodes[j]);
300 static bool Contains(NodeVector* nodes, Node* n) {
301 for (size_t i = 0; i < nodes->size(); i++) {
302 if (nodes->at(i) == n) return true;
309 NodeVector nodes(T->main_zone());
310 T->GetCachedNodes(&nodes);
[all...] |
