HomeSort by relevance Sort by last modified time
    Searched refs:nodes (Results 176 - 200 of 1616) sorted by null

1 2 3 4 5 6 78 91011>>

  /prebuilts/go/linux-x86/src/go/types/
initorder.go 20 // of graph nodes
38 // repeatedly, until there are no nodes left.
39 // In a valid Go program, those nodes always have zero dependencies (after
48 // if n still depends on other nodes, we have a cycle
50 mark++ // mark nodes using a different value each time
60 // reduce dependency count of all dependent nodes
100 // findPath returns the (reversed) list of nodes z, ... c, b, a,
103 // Nodes marked with the value mark are considered "visited";
104 // unvisited nodes are marked during the graph search.
154 // Nodes may be marked for cycle detection. A node n is marke
    [all...]
  /external/snakeyaml/src/main/java/org/yaml/snakeyaml/serializer/
Serializer.java 40 import org.yaml.snakeyaml.nodes.AnchorNode;
41 import org.yaml.snakeyaml.nodes.CollectionNode;
42 import org.yaml.snakeyaml.nodes.MappingNode;
43 import org.yaml.snakeyaml.nodes.Node;
44 import org.yaml.snakeyaml.nodes.NodeId;
45 import org.yaml.snakeyaml.nodes.NodeTuple;
46 import org.yaml.snakeyaml.nodes.ScalarNode;
47 import org.yaml.snakeyaml.nodes.SequenceNode;
48 import org.yaml.snakeyaml.nodes.Tag;
  /external/autotest/client/cros/multimedia/
audio_extension_handler.py 107 def _get_active_id_from_nodes(self, nodes):
108 """Gets active node id from nodes.
112 @param nodes: A list of input/output nodes got from get_audio_info().
119 active_ids = [x['id'] for x in nodes if x['isActive']]
122 'Node info contains multiple active nodes: %s', nodes)
212 nodes.
  /external/snakeyaml/src/test/java/examples/jodatime/
JodaTimeExampleTest.java 29 import org.yaml.snakeyaml.nodes.Node;
30 import org.yaml.snakeyaml.nodes.NodeId;
31 import org.yaml.snakeyaml.nodes.Tag;
  /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])
  /external/icu/icu4c/source/i18n/
collationbuilder.cpp 210 rootPrimaryIndexes(errorCode), nodes(errorCode) {
322 int64_t node = nodes.elementAti(index);
324 // then skip backwards over this and further "weaker" nodes.
327 node = nodes.elementAti(index);
357 // Tailor after the last node between adjacent root nodes.
359 node = nodes.elementAti(index);
372 node = nodes.elementAti(index);
394 node = nodes.elementAti(i);
408 // Skip weaker nodes and same-level tailored nodes
    [all...]
  /build/kati/
dep.h 59 vector<DepNode*>* nodes);
  /external/chromium-trace/catapult/telemetry/telemetry/internal/backends/chrome_inspector/
inspector_memory.py 31 A dictionary containing the counts associated with "nodes", "documents",
43 'nodes' not in res['result'] or
50 'nodes': res['result']['nodes'],
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/
GraphUtil.py 13 Generates and returns a :py:class:`~altgraph.Graph.Graph` instance with *node_num* nodes
27 nodes = range(node_num)
29 for node in nodes:
33 head = random.choice(nodes)
34 tail = random.choice(nodes)
53 Generates and returns a :py:class:`~altgraph.Graph.Graph` instance that will have *steps* \* *growth_num* nodes
54 and a scale free (powerlaw) connectivity. Starting with a fully connected graph with *growth_num* nodes
55 at every step *growth_num* nodes are added to the graph and are connected to existing nodes with
56 a probability proportional to the degree of these existing nodes
    [all...]
  /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/pdfium/third_party/libopenjpeg20/
tgt.h 72 opj_tgt_node_t *nodes; member in struct:opj_tgt_tree
73 OPJ_UINT32 nodes_size; /* maximum size taken by nodes */
  /external/selinux/libsemanage/src/
nodes_policydb.c 30 #include <sepol/nodes.h>
  /external/selinux/libsepol/include/sepol/
sepol.h 20 #include <sepol/nodes.h>
  /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.
SequenceNode.java 16 package org.yaml.snakeyaml.nodes;
25 * A sequence is a ordered collection of nodes.
53 * @return Nodes in the specified order.
  /external/snakeyaml/src/test/java/examples/staticstate/
StaticFieldsTest.java 28 import org.yaml.snakeyaml.nodes.MappingNode;
29 import org.yaml.snakeyaml.nodes.Node;
30 import org.yaml.snakeyaml.nodes.NodeTuple;
31 import org.yaml.snakeyaml.nodes.ScalarNode;
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue29/
FlexibleScalarStylesInJavaBeanTest.java 33 import org.yaml.snakeyaml.nodes.NodeTuple;
34 import org.yaml.snakeyaml.nodes.ScalarNode;
35 import org.yaml.snakeyaml.nodes.SequenceNode;
36 import org.yaml.snakeyaml.nodes.Tag;
  /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/
NodeTest.java 16 package org.yaml.snakeyaml.nodes;
NodeTupleTest.java 16 package org.yaml.snakeyaml.nodes;
28 assertEquals("Nodes must be provided.", e.getMessage());
38 assertEquals("Nodes must be provided.", e.getMessage());
47 "<NodeTuple keyNode=<org.yaml.snakeyaml.nodes.ScalarNode (tag=tag:yaml.org,2002:str, value=key1)>; valueNode=<org.yaml.snakeyaml.nodes.ScalarNode (tag=tag:yaml.org,2002:str, value=value1)>>",
TagsTest.java 16 package org.yaml.snakeyaml.nodes;
27 assertEquals(new Tag("tag:yaml.org,2002:org.yaml.snakeyaml.nodes.TagsTest"), new Tag(
  /external/v8/src/compiler/
node-cache.h 26 // A cache for nodes based on a key. Useful for implementing canonicalization of
27 // nodes such as constants, parameters, etc.
46 // Appends all nodes from this cache to {nodes}.
47 void GetCachedNodes(ZoneVector<Node*>* nodes);
  /hardware/ti/omap3/omx/ti_omx_config_parser/
Android.mk 23 $(PV_TOP)/nodes/pvmediaoutputnode/include \
24 $(PV_TOP)/nodes/pvdownloadmanagernode/config/opencore \

Completed in 627 milliseconds

1 2 3 4 5 6 78 91011>>