| /external/skia/tests/ |
| D | TopoSortTest.cpp | 23 static void create_graph0(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { in create_graph0()
41 static void create_graph1(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { in create_graph1()
54 static void create_graph2(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { in create_graph2()
73 static void create_graph3(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { in create_graph3()
94 static void create_graph4(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { in create_graph4()
123 SkTDArray<sk_tool_utils::TopoTestNode*> graph; in DEF_TEST() local
|
| /external/ceres-solver/internal/ceres/ |
| D | graph_test.cc | 41 Graph<int> graph; in TEST() local
46 Graph<int> graph; in TEST() local
62 Graph<int> graph; in TEST() local
87 Graph<int> graph; in TEST() local
97 Graph<int> graph; in TEST() local
|
| D | graph_algorithms_test.cc | 44 Graph<int> graph; in TEST() local
74 Graph<int> graph; in TEST() local
105 Graph<int> graph; in TEST() local
122 Graph<int> graph; in TEST() local
169 Graph<int> graph; in TEST() local
201 Graph<int> graph; in TEST() local
|
| D | single_linkage_clustering_test.cc | 46 Graph<int> graph; in TEST() local
73 Graph<int> graph; in TEST() local
102 Graph<int> graph; in TEST() local
|
| D | graph_algorithms.h | 51 explicit VertexTotalOrdering(const Graph<Vertex>& graph) in VertexTotalOrdering()
68 explicit VertexDegreeLessThan(const Graph<Vertex>& graph) in VertexDegreeLessThan()
96 int IndependentSetOrdering(const Graph<Vertex>& graph, in IndependentSetOrdering()
172 int StableIndependentSetOrdering(const Graph<Vertex>& graph, in StableIndependentSetOrdering()
274 Degree2MaximumSpanningForest(const Graph<Vertex>& graph) { in Degree2MaximumSpanningForest()
|
| D | parameter_block_ordering.cc | 49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeStableSchurOrdering() local
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeSchurOrdering() local
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeRecursiveIndependentSetOrdering() local
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); in CreateHessianGraph() local
|
| D | parameter_block_ordering_test.cc | 86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
140 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
|
| /external/skia/src/core/ |
| D | SkTTopoSort.h | 15 void SkTTopoSort_CheckAllUnmarked(const SkTDArray<T*>& graph) { in SkTTopoSort_CheckAllUnmarked()
23 void SkTTopoSort_CleanExit(const SkTDArray<T*>& graph) { in SkTTopoSort_CleanExit()
81 bool SkTTopoSort(SkTDArray<T*>* graph) { in SkTTopoSort()
|
| /external/fio/ |
| D | graph.c | 77 struct graph { struct
86 graph_axis_unit_change_callback x_axis_unit_change_callback; argument
87 graph_axis_unit_change_callback y_axis_unit_change_callback; argument
89 unsigned int dont_graph_all_zeroes; argument
105 void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim) in graph_set_size() argument
|
| /external/v8/test/cctest/compiler/ |
| D | test-node.cc | 146 Graph graph(&zone); in TEST() local
172 Graph graph(&zone); in TEST() local
197 Graph graph(&zone); in TEST() local
224 Graph graph(&zone); in TEST() local
275 Graph graph(&zone); in TEST() local
298 Graph graph(&zone); in TEST() local
327 Graph graph(&zone); in TEST() local
358 Graph graph(&zone); in TEST() local
381 Graph graph(&zone); in TEST() local
409 Graph graph(&zone); in TEST() local
[all …]
|
| D | test-graph-visualizer.cc | 30 Graph graph(scope.main_zone()); in TEST() local
49 Graph graph(scope.main_zone()); in TEST() local
68 Graph graph(scope.main_zone()); in TEST() local
87 Graph graph(scope.main_zone()); in TEST() local
104 Graph graph(scope.main_zone()); in TEST() local
|
| /external/skia/tools/ |
| D | sk_tool_utils.h | 181 static void AllocNodes(SkTDArray<TopoTestNode*>* graph, int num) { in AllocNodes()
189 static void DeallocNodes(SkTDArray<TopoTestNode*>* graph) { in DeallocNodes()
191 delete (*graph)[i]; in DeallocNodes() local
196 static void Print(const SkTDArray<TopoTestNode*>& graph) { in Print()
205 static void Shuffle(SkTDArray<TopoTestNode*>* graph, SkRandom* rand) { in Shuffle()
|
| /external/v8/src/crankshaft/ |
| D | hydrogen-mark-deoptimize.h | 21 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph) in HMarkDeoptimizeOnUndefinedPhase()
40 explicit HComputeChangeUndefinedToNaN(HGraph* graph) in HComputeChangeUndefinedToNaN()
|
| D | hydrogen-removable-simulates.h | 16 explicit HMergeRemovableSimulatesPhase(HGraph* graph) in HMergeRemovableSimulatesPhase()
|
| D | hydrogen-canonicalize.h | 16 explicit HCanonicalizePhase(HGraph* graph) in HCanonicalizePhase()
|
| D | hydrogen-load-elimination.h | 15 explicit HLoadEliminationPhase(HGraph* graph) in HLoadEliminationPhase()
|
| D | hydrogen-dehoist.h | 16 explicit HDehoistIndexComputationsPhase(HGraph* graph) in HDehoistIndexComputationsPhase()
|
| D | hydrogen-mark-unreachable.h | 16 explicit HMarkUnreachableBlocksPhase(HGraph* graph) in HMarkUnreachableBlocksPhase()
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| D | InjectorGrapher.java | 37 void graph(Injector injector) throws IOException; in graph() method
43 void graph(Injector injector, Set<Key<?>> root) throws IOException; in graph() method
|
| /external/v8/src/compiler/ |
| D | tail-call-optimization.h | 23 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph) in TailCallOptimization()
30 Graph* graph() const { return graph_; } in graph() function
|
| D | load-elimination.h | 19 explicit LoadElimination(Editor* editor, Graph* graph, in LoadElimination()
28 Graph* graph() const { return graph_; } in graph() function
|
| /external/v8/tools/turbolizer/ |
| D | edge.js | 28 Edge.prototype.getInputHorizontalPosition = function(graph) { argument
48 Edge.prototype.generatePath = function(graph) { argument
|
| /external/testng/src/main/java/org/testng/internal/ |
| D | Tarjan.java | 22 public Tarjan(Graph<T> graph, T start) { in Tarjan()
27 private void run(Graph<T> graph, T v) { in run()
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| D | GraphAlgo.py | 7 def dijkstra(graph, start, end=None): argument
46 def shortest_path(graph, start, end): argument
|
| /external/regex-re2/benchlog/ |
| D | mktable | 34 sub graph() { subroutine
|