| /frameworks/support/navigation/common/src/test/java/androidx/navigation/ |
| NavGraphTest.java | 69 NavGraph graph = mNavGraphNavigator.createDestination(); local
70 graph.addDestination(destination);
71 return graph;
75 NavGraph graph = mNavGraphNavigator.createDestination(); local
76 graph.addDestinations(destinations);
77 return graph;
82 NavGraph graph = mNavGraphNavigator.createDestination(); local
84 graph.addDestination(destination);
90 NavGraph graph = createGraphWithDestination(destination); local
92 assertThat(destination.getParent(), is(graph));
98 NavGraph graph = mNavGraphNavigator.createDestination(); local
113 NavGraph graph = createGraphWithDestinations(destination, secondDestination); local
124 NavGraph graph = createGraphWithDestination(destination); local
149 NavGraph graph = mNavGraphNavigator.createDestination(); local
160 NavGraph graph = createGraphWithDestination(destination); local
172 NavGraph graph = createGraphWithDestinations(destination, secondDestination); local
185 NavGraph graph = createGraphWithDestination(destination); local
195 NavGraph graph = createGraphWithDestination(destination); local
208 NavGraph graph = createGraphWithDestinations(destination, secondDestination); local
223 NavGraph graph = createGraphWithDestinations(destination, secondDestination); local
235 NavGraph graph = createGraphWithDestinations(destination, secondDestination); local
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| costmodel_manager.h | 22 #include "tensorflow/core/graph/costmodel.h"
23 #include "tensorflow/core/graph/graph.h"
34 typedef std::unordered_map<const Graph*, CostModel*> CostModelMap;
42 CostModel* FindOrCreateCostModel(const Graph* graph);
44 bool RemoveCostModelForGraph(const Graph* graph);
46 Status AddToCostGraphDef(const Graph* graph, CostGraphDef* cost_graph)
[all...] |
| /external/v8/src/compiler/ |
| tail-call-optimization.h | 8 #include "src/compiler/graph-reducer.h"
17 class Graph;
24 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph)
25 : common_(common), graph_(graph) {}
31 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
34 Graph* const graph_;
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| graph_to_functiondef.h | 20 #include "tensorflow/core/graph/graph.h"
25 // Converts 'graph' to a FunctionDef 'fdef', with name 'name'.
28 Status GraphToFunctionDef(const Graph& graph, const string& name,
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| const_analysis.h | 21 #include "tensorflow/core/graph/graph.h"
26 // Backwards dataflow analysis that finds arguments (_Arg nodes) to a graph that
28 Status BackwardsConstAnalysis(const Graph& graph,
|
| /external/tensorflow/tensorflow/core/graph/ |
| graph_def_builder_test.cc | 16 #include "tensorflow/core/graph/graph_def_builder.h"
19 #include "tensorflow/core/graph/graph.h"
20 #include "tensorflow/core/graph/graph_def_builder_util.h"
36 // Check version when we convert to a Graph
37 Graph graph(OpRegistry::Global());
38 TF_EXPECT_OK(GraphDefBuilderToGraph(builder, &graph));
39 ASSERT_EQ(graph.versions().producer(), TF_GRAPH_DEF_VERSION);
40 ASSERT_EQ(graph.versions().min_consumer(), TF_GRAPH_DEF_VERSION_MIN_CONSUMER)
[all...] |
| node_builder_test.cc | 16 #include "tensorflow/core/graph/node_builder.h"
19 #include "tensorflow/core/graph/graph.h"
31 Graph graph(OpRegistry::Global());
35 .Finalize(&graph, &source_node));
41 .Finalize(&graph, nullptr));
44 .Finalize(&graph, nullptr));
49 .Finalize(&graph, nullptr)
53 .Finalize(&graph, nullptr
[all...] |
| /system/update_engine/payload_generator/ |
| topological_sort.h | 26 // Performs a topological sort on the directed graph 'graph' and stores
28 // For example, this graph:
37 // Note: results are undefined if there is a cycle in the graph.
38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
|
| topological_sort_unittest.cc | 64 const Graph::size_type kNodeCount = counter++;
66 Graph graph(kNodeCount);
68 graph[n_i].out_edges.insert(make_pair(n_j, EdgeProperties()));
69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties()));
70 graph[n_i].out_edges.insert(make_pair(n_e, EdgeProperties()));
71 graph[n_i].out_edges.insert(make_pair(n_h, EdgeProperties()));
72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties()));
73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
74 graph[n_e].out_edges.insert(make_pair(n_d, EdgeProperties()))
[all...] |
| cycle_breaker_unittest.cc | 39 void SetOpForNodes(Graph* graph) {
40 for (Vertex& vertex : *graph) {
58 const Graph::size_type kNodeCount = counter++;
60 Graph graph(kNodeCount);
61 SetOpForNodes(&graph);
63 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties()));
64 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties()));
65 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()))
[all...] |
| /external/tensorflow/tensorflow/contrib/predictor/ |
| predictor_factories.py | 33 graph=None):
45 graph: Optional. The Tensorflow `graph` in which prediction should be
65 graph=graph)
71 graph=None):
80 graph: Optional. The Tensorflow `graph` in which prediction should be
96 estimator, serving_input_receiver_fn, output_key=output_key, graph=graph)
[all...] |
| /external/v8/tools/turbolizer/ |
| graph-view.js | 10 var graph = this;
13 graph.svg = svg;
15 graph.nodes = nodes || [];
16 graph.edges = edges || [];
18 graph.minGraphX = 0;
19 graph.maxGraphX = 1;
20 graph.minGraphY = 0;
21 graph.maxGraphY = 1;
23 graph.state = {
54 var selection = graph.node
[all...] |
| /art/compiler/optimizing/ |
| graph_test.cc | 29 HBasicBlock* CreateIfBlock(HGraph* graph);
30 HBasicBlock* CreateGotoBlock(HGraph* graph);
31 HBasicBlock* CreateEntryBlock(HGraph* graph);
32 HBasicBlock* CreateReturnBlock(HGraph* graph);
33 HBasicBlock* CreateExitBlock(HGraph* graph);
36 HBasicBlock* GraphTest::CreateIfBlock(HGraph* graph) {
37 HBasicBlock* if_block = new (GetAllocator()) HBasicBlock(graph);
38 graph->AddBlock(if_block);
39 HInstruction* instr = graph->GetIntConstant(4);
47 HBasicBlock* GraphTest::CreateGotoBlock(HGraph* graph) {
81 HGraph* graph = CreateGraph(); local
113 HGraph* graph = CreateGraph(); local
145 HGraph* graph = CreateGraph(); local
177 HGraph* graph = CreateGraph(); local
209 HGraph* graph = CreateGraph(); local
245 HGraph* graph = CreateGraph(); local
278 HGraph* graph = CreateGraph(); local
[all...] |
| code_sinking.h | 31 CodeSinking(HGraph* graph,
34 : HOptimization(graph, name, stats) {}
|
| constructor_fence_redundancy_elimination.h | 50 ConstructorFenceRedundancyElimination(HGraph* graph,
53 : HOptimization(graph, name, stats) {}
|
| dead_code_elimination.h | 32 HDeadCodeElimination(HGraph* graph, OptimizingCompilerStats* stats, const char* name)
33 : HOptimization(graph, name, stats) {}
|
| gvn.h | 29 GVNOptimization(HGraph* graph,
32 : HOptimization(graph, pass_name), side_effects_(side_effects) {}
|
| instruction_simplifier_mips.h | 32 InstructionSimplifierMips(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats)
33 : HOptimization(graph, kInstructionSimplifierMipsPassName, stats),
|
| licm.h | 29 LICM(HGraph* graph,
33 : HOptimization(graph, name, stats),
|
| pc_relative_fixups_mips.h | 31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats)
32 : HOptimization(graph, kPcRelativeFixupsMipsPassName, stats),
|
| pc_relative_fixups_x86.h | 31 PcRelativeFixups(HGraph* graph, CodeGenerator* codegen, OptimizingCompilerStats* stats)
32 : HOptimization(graph, kPcRelativeFixupsX86PassName, stats),
|
| /external/tensorflow/tensorflow/contrib/tensorrt/segment/ |
| segment_test.cc | 18 #include "tensorflow/core/framework/graph.pb.h"
32 bool GetGraphDef(TF_Graph* graph, tensorflow::GraphDef* graph_def);
34 TF_Operation* Placeholder(TF_Graph* graph, TF_Status* s, const char* name);
35 TF_Operation* Add(TF_Operation* l, TF_Operation* r, TF_Graph* graph,
42 void PlaceholderHelper(TF_Graph* graph, TF_Status* s, const char* name,
44 void AddHelper(TF_Operation* l, TF_Operation* r, TF_Graph* graph,
50 bool SegmentTest::GetGraphDef(TF_Graph* graph,
54 TF_GraphToGraphDef(graph, buffer, s);
70 void SegmentTest::PlaceholderHelper(TF_Graph* graph, TF_Status* s,
72 TF_OperationDescription* desc = TF_NewOperation(graph, "Placeholder", name)
108 TF_Graph* graph = TF_NewGraph(); local
125 TF_Graph* graph = TF_NewGraph(); local
177 TF_Graph* graph = TF_NewGraph(); local
226 TF_Graph* graph = TF_NewGraph(); local
296 TF_Graph* graph = TF_NewGraph(); local
[all...] |
| /external/tensorflow/tensorflow/python/summary/ |
| plugin_asset.py | 21 This module contains methods that allow plugin assets to be specified at graph
23 singleton on a per-graph basis. The PluginAsset has an assets method which
40 def get_plugin_asset(plugin_asset_cls, graph=None):
41 """Acquire singleton PluginAsset instance from a graph.
43 PluginAssets are always singletons, and are stored in tf Graph collections.
44 This way, they can be defined anywhere the graph is being constructed, and
50 graph: (optional) The graph to retrieve the instance from. If not specified,
51 the default graph is used.
60 if graph is None
[all...] |
| /external/trappy/trappy/plotter/js/ |
| ILinePlot.js | 40 syncGraphs.push(graphs[div_name].graph);
43 var xR = graphs[div_name].graph.xAxisRange();
44 var yR = graphs[div_name].graph.yAxisRange();
77 var graph = syncGraphs[g];
79 graph.updateOptions({
84 if (graph.padFront_ == undefined) {
85 graph.padFront_ = true;
86 var _decoy_elem = new Array(graph.rawData_[0].length);
87 graph.rawData_.unshift(_decoy_elem);
89 graph.rawData_[0][0] = xRange[0]
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| InjectorGrapher.java | 26 * Guice injector grapher. Renders the guice dependency graph for an injector. It can render the
27 * whole dependency graph or just transitive dependencies of a given set of nodes.
35 * Graphs the guice dependency graph for the given injector using default starting keys.
37 void graph(Injector injector) throws IOException; method in interface:InjectorGrapher
40 * Graphs the guice dependency graph for the given injector using the given starting keys and
43 void graph(Injector injector, Set<Key<?>> root) throws IOException; method in interface:InjectorGrapher
|
