| /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 | 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 | 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 | 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
|
| D | visibility_test.cc | 111 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility)); in TEST() local
187 scoped_ptr<Graph<int> > graph(CreateSchurComplementGraph(visibility)); in TEST() local
|
| /external/v8/test/cctest/compiler/ |
| D | test-node.cc | 145 Graph graph(&zone); in TEST() local
170 Graph graph(&zone); in TEST() local
194 Graph graph(&zone); in TEST() local
220 Graph graph(&zone); in TEST() local
270 Graph graph(&zone); in TEST() local
292 Graph graph(&zone); in TEST() local
320 Graph graph(&zone); in TEST() local
350 Graph graph(&zone); in TEST() local
372 Graph graph(&zone); in TEST() local
399 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
|
| D | function-tester.h | 38 FunctionTester(Graph* graph, int param_count) in FunctionTester()
195 static Handle<JSFunction> ForMachineGraph(Graph* graph, int param_count) { in ForMachineGraph()
228 Handle<JSFunction> CompileGraph(Graph* graph) { in CompileGraph()
|
| /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/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/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()
|
| /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 | escape-analysis.h | 66 Graph* graph() const { return graph_; } in graph() function
146 Graph* graph() const { return graph_; } in graph() function
|
| D | graph-visualizer.h | 29 const Graph& graph; member
37 const Graph& graph; member
|
| /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/opencv3/modules/core/test/ |
| D | test_ds.cpp | 175 static void cvTsClearSimpleGraph( CvTsSimpleGraph* graph ) in cvTsClearSimpleGraph()
186 CvTsSimpleGraph* graph; in cvTsCreateSimpleGraph() local
201 static void cvTsReleaseSimpleGraph( CvTsSimpleGraph** graph ) in cvTsReleaseSimpleGraph()
211 static int cvTsSimpleGraphAddVertex( CvTsSimpleGraph* graph, void* vertex ) in cvTsSimpleGraphAddVertex()
217 static void cvTsSimpleGraphRemoveVertex( CvTsSimpleGraph* graph, int index ) in cvTsSimpleGraphRemoveVertex()
232 static void cvTsSimpleGraphAddEdge( CvTsSimpleGraph* graph, int idx1, int idx2, void* edge ) in cvTsSimpleGraphAddEdge()
252 static void cvTsSimpleGraphRemoveEdge( CvTsSimpleGraph* graph, int idx1, int idx2 ) in cvTsSimpleGraphRemoveEdge()
269 static schar* cvTsSimpleGraphFindVertex( CvTsSimpleGraph* graph, int index ) in cvTsSimpleGraphFindVertex()
275 static char* cvTsSimpleGraphFindEdge( CvTsSimpleGraph* graph, int idx1, int idx2 ) in cvTsSimpleGraphFindEdge()
287 static int cvTsSimpleGraphVertexDegree( CvTsSimpleGraph* graph, int index ) in cvTsSimpleGraphVertexDegree()
[all …]
|
| /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/opencv3/modules/core/src/ |
| D | datastructs.cpp | 2573 CvGraph *graph = 0; in cvCreateGraph() local
2597 cvClearGraph( CvGraph * graph ) in cvClearGraph()
2609 cvGraphAddVtx( CvGraph* graph, const CvGraphVtx* _vertex, CvGraphVtx** _inserted_vertex ) in cvGraphAddVtx()
2635 cvGraphRemoveVtxByPtr( CvGraph* graph, CvGraphVtx* vtx ) in cvGraphRemoveVtxByPtr()
2662 cvGraphRemoveVtx( CvGraph* graph, int index ) in cvGraphRemoveVtx()
2693 cvFindGraphEdgeByPtr( const CvGraph* graph, in cvFindGraphEdgeByPtr()
2727 cvFindGraphEdge( const CvGraph* graph, int start_idx, int end_idx ) in cvFindGraphEdge()
2747 cvGraphAddEdgeByPtr( CvGraph* graph, in cvGraphAddEdgeByPtr()
2815 cvGraphAddEdge( CvGraph* graph, in cvGraphAddEdge()
2835 cvGraphRemoveEdgeByPtr( CvGraph* graph, CvGraphVtx* start_vtx, CvGraphVtx* end_vtx ) in cvGraphRemoveEdgeByPtr()
[all …]
|
| /external/opencv/cxcore/src/ |
| D | cxdatastructs.cpp | 2880 CvGraph *graph = 0; in cvCreateGraph() local
2911 cvClearGraph( CvGraph * graph ) in cvClearGraph()
2929 cvGraphAddVtx( CvGraph* graph, const CvGraphVtx* _vertex, CvGraphVtx** _inserted_vertex ) in cvGraphAddVtx()
2962 cvGraphRemoveVtxByPtr( CvGraph* graph, CvGraphVtx* vtx ) in cvGraphRemoveVtxByPtr()
2995 cvGraphRemoveVtx( CvGraph* graph, int index ) in cvGraphRemoveVtx()
3032 cvFindGraphEdgeByPtr( const CvGraph* graph, in cvFindGraphEdgeByPtr()
3073 cvFindGraphEdge( const CvGraph* graph, int start_idx, int end_idx ) in cvFindGraphEdge()
3102 cvGraphAddEdgeByPtr( CvGraph* graph, in cvGraphAddEdgeByPtr()
3175 cvGraphAddEdge( CvGraph* graph, in cvGraphAddEdge()
3204 cvGraphRemoveEdgeByPtr( CvGraph* graph, CvGraphVtx* start_vtx, CvGraphVtx* end_vtx ) in cvGraphRemoveEdgeByPtr()
[all …]
|
| /external/svox/pico/lib/ |
| D | picoklex.c | 359 const picoos_uint8 *graph, in klex_lexMatch()
419 const picoos_uint8 *graph, in klex_lexblockLookup()
483 const picoos_uint8 *graph, in picoklex_lexLookup()
|