| /third_party/skia/tests/ |
| D | TopoSortTest.cpp | 25 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0()
46 static void create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph1()
61 static void create_graph2(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph2()
84 static void create_graph3(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph3()
107 static void create_graph4(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph4()
130 static void create_graph5(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph5()
150 static void create_graph6(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph6()
179 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; in DEF_TEST() local
|
| D | GrRenderTaskClusterTest.cpp | 35 static void create_graph0(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph0()
55 static void create_graph1(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph1()
79 static void create_graph2(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph2()
102 static void create_graph3(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph3()
131 SkTArray<sk_sp<GrMockRenderTask>> graph; in DEF_TEST() local
|
| /third_party/flutter/skia/tests/ |
| D | TopoSortTest.cpp | 23 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0()
41 static void create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph1()
54 static void create_graph2(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph2()
73 static void create_graph3(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph3()
94 static void create_graph4(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph4()
123 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; in DEF_TEST() local
|
| /third_party/boost/boost/graph/ |
| D | property_iter_range.hpp | 58 Graph& graph, const Tag& tag, const vertex_property_tag&) in get_property_iter_range_kind()
68 const Graph& graph, const Tag& tag, const vertex_property_tag&) in get_property_iter_range_kind()
79 Graph& graph, const Tag& tag, const edge_property_tag&) in get_property_iter_range_kind()
89 const Graph& graph, const Tag& tag, const edge_property_tag&) in get_property_iter_range_kind()
104 Graph& graph, const Tag& tag) in get_property_iter_range()
112 get_property_iter_range(const Graph& graph, const Tag& tag) in get_property_iter_range()
|
| D | grid_graph.hpp | 798 vertices(const type& graph) in vertices()
811 const type& graph) in num_vertices()
817 typename type::vertices_size_type vertex_index, const type& graph) in vertex()
829 out_edges(typename type::vertex_descriptor vertex, const type& graph) in out_edges()
842 typename type::vertex_descriptor vertex, const type& graph) in out_degree()
849 typename type::degree_size_type out_edge_index, const type& graph) in out_edge_at()
861 typename type::vertex_descriptor vertex, const type& graph) in adjacent_vertices()
878 friend inline typename type::edges_size_type num_edges(const type& graph) in num_edges()
884 typename type::edges_size_type edge_index, const type& graph) in edge_at()
891 edges(const type& graph) in edges()
[all …]
|
| D | dijkstra_shortest_paths_no_color_map.hpp | 28 void dijkstra_shortest_paths_no_color_map_no_init(const Graph& graph, in dijkstra_shortest_paths_no_color_map_no_init()
133 void dijkstra_shortest_paths_no_color_map(const Graph& graph, in dijkstra_shortest_paths_no_color_map()
170 inline void dijkstra_no_color_map_dispatch2(const Graph& graph, in dijkstra_no_color_map_dispatch2()
198 inline void dijkstra_no_color_map_dispatch1(const Graph& graph, in dijkstra_no_color_map_dispatch1()
220 inline void dijkstra_shortest_paths_no_color_map(const Graph& graph, in dijkstra_shortest_paths_no_color_map()
|
| D | bipartite.hpp | 201 const Graph& graph, const IndexMap index_map, PartitionMap partition_map) in is_bipartite()
243 bool is_bipartite(const Graph& graph, const IndexMap index_map) in is_bipartite()
260 template < typename Graph > bool is_bipartite(const Graph& graph) in is_bipartite()
282 OutputIterator find_odd_cycle(const Graph& graph, const IndexMap index_map, in find_odd_cycle()
377 const Graph& graph, const IndexMap index_map, OutputIterator result) in find_odd_cycle()
398 OutputIterator find_odd_cycle(const Graph& graph, OutputIterator result) in find_odd_cycle()
|
| D | gursoy_atun_layout.hpp | 135 void gursoy_atun_step(const VertexListAndIncidenceGraph& graph, in gursoy_atun_step()
202 void gursoy_atun_refine(const VertexListAndIncidenceGraph& graph, in gursoy_atun_refine()
246 void gursoy_atun_layout(const VertexListAndIncidenceGraph& graph, in gursoy_atun_layout()
267 void gursoy_atun_layout(const VertexListAndIncidenceGraph& graph, in gursoy_atun_layout()
280 void gursoy_atun_layout(const VertexListAndIncidenceGraph& graph, in gursoy_atun_layout()
293 void gursoy_atun_layout(const VertexListAndIncidenceGraph& graph, in gursoy_atun_layout()
306 void gursoy_atun_layout(const VertexListAndIncidenceGraph& graph, in gursoy_atun_layout()
314 void gursoy_atun_layout(const VertexListAndIncidenceGraph& graph, in gursoy_atun_layout()
|
| D | hawick_circuits.hpp | 294 void call_hawick_circuits(Graph const& graph, in call_hawick_circuits()
336 Graph const& graph, BOOST_FWD_REF(Visitor) visitor) in call_hawick_circuits()
345 void hawick_circuits(BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor, in hawick_circuits()
355 void hawick_circuits(BOOST_FWD_REF(Graph) graph, BOOST_FWD_REF(Visitor) visitor) in hawick_circuits()
367 void hawick_unique_circuits(BOOST_FWD_REF(Graph) graph, in hawick_unique_circuits()
378 void hawick_unique_circuits( in hawick_unique_circuits()
|
| /third_party/ffmpeg/libavfilter/ |
| D | avfiltergraph.c | 71 void ff_graph_thread_free(AVFilterGraph *graph) in ff_graph_thread_free()
75 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init()
102 void ff_filter_graph_remove_filter(AVFilterGraph *graph, AVFilterContext *filter) in ff_filter_graph_remove_filter()
120 void avfilter_graph_free(AVFilterGraph **graph) in avfilter_graph_free()
165 void avfilter_graph_set_auto_convert(AVFilterGraph *graph, unsigned flags) in avfilter_graph_set_auto_convert()
170 AVFilterContext *avfilter_graph_alloc_filter(AVFilterGraph *graph, in avfilter_graph_alloc_filter()
214 static int graph_check_validity(AVFilterGraph *graph, AVClass *log_ctx) in graph_check_validity()
252 static int graph_config_links(AVFilterGraph *graph, AVClass *log_ctx) in graph_config_links()
269 static int graph_check_links(AVFilterGraph *graph, AVClass *log_ctx) in graph_check_links()
290 AVFilterContext *avfilter_graph_get_filter(AVFilterGraph *graph, const char *name) in avfilter_graph_get_filter()
[all …]
|
| D | pthread.c | 37 AVFilterGraph *graph; member
84 int ff_graph_thread_init(AVFilterGraph *graph) in ff_graph_thread_init()
111 void ff_graph_thread_free(AVFilterGraph *graph) in ff_graph_thread_free()
|
| /third_party/harfbuzz/src/ |
| D | test-repacker.cc | 197 graph_t graph (c.object_graph ()); in test_sort_kahn_1() local
225 graph_t graph (c.object_graph ()); in test_sort_kahn_2() local
259 graph_t graph (c.object_graph ()); in test_sort_shortest() local
292 graph_t graph (c.object_graph ()); in test_duplicate_leaf() local
328 graph_t graph (c.object_graph ()); in test_duplicate_interior() local
374 graph_t graph (c1.object_graph ()); in test_serialize() local
392 graph_t graph (c.object_graph ()); in test_will_overflow_1() local
405 graph_t graph (c.object_graph ()); in test_will_overflow_2() local
418 graph_t graph (c.object_graph ()); in test_will_overflow_3() local
431 graph_t graph (c.object_graph ()); in test_resolve_overflows_via_sort() local
[all …]
|
| /third_party/flutter/skia/src/core/ |
| D | SkTTopoSort.h | 16 void SkTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) { in SkTTopoSort_CheckAllUnmarked()
24 void SkTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { in SkTTopoSort_CleanExit()
82 bool SkTTopoSort(SkTArray<sk_sp<T>>* graph) { in SkTTopoSort()
|
| /third_party/skia/third_party/externals/spirv-tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); in TEST() local
365 const auto graph = CallGraph(context.get()); in TEST() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/ |
| D | call_graph_test.cpp | 284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); in TEST() local
365 const auto graph = CallGraph(context.get()); in TEST() local
|
| /third_party/skia/src/gpu/ |
| D | GrTTopoSort.h | 16 void GrTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CheckAllUnmarked()
24 void GrTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { in GrTTopoSort_CleanExit()
85 bool GrTTopoSort(SkTArray<sk_sp<T>>* graph) { in GrTTopoSort()
|
| /third_party/boost/libs/parameter/test/literate/ |
| D | defining-the-keywords1.cpp | 8 struct graph struct
10 typedef boost::parameter::forward_reference qualifier;
|
| /third_party/boost/libs/graph/test/ |
| D | bidir_remove_edge.cpp | 21 graph; in main() typedef
38 graph; in main() typedef
|
| /third_party/node/deps/npm/node_modules/color-convert/ |
| D | route.js | 20 graph[models[i]] = { variable
63 function wrapConversion(toModel, graph) { argument
|
| /third_party/node/test/async-hooks/ |
| D | verify-graph.js | 7 function findInGraph(graph, type, n) { argument
59 module.exports = function verifyGraph(hooks, graph) { argument
|
| /third_party/boost/libs/geometry/example/ |
| D | 07_a_graph_route_example.cpp | 137 …e typename boost::graph_traits<G>::vertex_descriptor find_or_insert(M& map, K const& key, G& graph) in find_or_insert()
163 void add_roads_and_connect_cities(Graph& graph, in add_roads_and_connect_cities()
208 inline void add_edge_to_route(Graph const& graph, in add_edge_to_route()
243 inline void build_route(Graph const& graph, in build_route()
298 graph_type graph; in main() local
|
| D | 07_b_graph_route_example.cpp | 126 …e typename boost::graph_traits<G>::vertex_descriptor find_or_insert(M& map, K const& key, G& graph) in find_or_insert()
148 void add_roads_and_connect_cities(Graph& graph, in add_roads_and_connect_cities()
193 inline void add_edge_to_route(Graph const& graph, in add_edge_to_route()
228 inline void build_route(Graph const& graph, in build_route()
274 graph_type graph; in main() local
|
| /third_party/node/src/ |
| D | memory_tracker.h | 252 inline v8::EmbedderGraph* graph() { return graph_; } in graph() function
256 v8::EmbedderGraph* graph) in MemoryTracker()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | test-repacker.cc | 75 graph_t graph (overflowing.object_graph ()); in run_resolve_overflow_test() local
791 graph_t graph (c.object_graph ()); in test_sort_kahn_1() local
819 graph_t graph (c.object_graph ()); in test_sort_kahn_2() local
853 graph_t graph (c.object_graph ()); in test_sort_shortest() local
886 graph_t graph (c.object_graph ()); in test_duplicate_leaf() local
922 graph_t graph (c.object_graph ()); in test_duplicate_interior() local
968 graph_t graph (c1.object_graph ()); in test_serialize() local
986 graph_t graph (c.object_graph ()); in test_will_overflow_1() local
999 graph_t graph (c.object_graph ()); in test_will_overflow_2() local
1012 graph_t graph (c.object_graph ()); in test_will_overflow_3() local
[all …]
|
| /third_party/boost/tools/build/src/engine/modules/ |
| D | order.cpp | 50 void do_ts( int * * graph, int current_vertex, int * colors, int * * result_ptr in do_ts()
73 void topological_sort( int * * graph, int num_vertices, int * result ) in topological_sort()
100 int * * graph = ( int * * )BJAM_CALLOC( length, sizeof( int * ) ); in order() local
|