| /third_party/boost/libs/graph/test/ |
| D | boykov_kolmogorov_max_flow_test.cpp | 55 typename graph_traits< Graph >::edges_size_type n_edges, std::size_t seed) in fill_random_max_flow_graph()
65 generate_random_graph(g, n_verts, n_edges, gen); in fill_random_max_flow_graph()
106 long test_adjacency_list_vecS(int n_verts, int n_edges, std::size_t seed) in test_adjacency_list_vecS() argument
123 g, get(edge_capacity, g), get(edge_reverse, g), n_verts, n_edges, seed); in test_adjacency_list_vecS()
131 long test_adjacency_list_listS(int n_verts, int n_edges, std::size_t seed) in test_adjacency_list_listS() argument
148 g, get(edge_capacity, g), get(edge_reverse, g), n_verts, n_edges, seed); in test_adjacency_list_listS()
177 long test_bundled_properties(int n_verts, int n_edges, std::size_t seed) in test_bundled_properties() argument
190 get(&tEdge::edge_reverse, g), n_verts, n_edges, seed); in test_bundled_properties()
197 long test_overloads(int n_verts, int n_edges, std::size_t seed) in test_overloads() argument
211 g, get(edge_capacity, g), get(edge_reverse, g), n_verts, n_edges, seed); in test_overloads()
[all …]
|
| D | max_flow_test.cpp | 79 graph_traits< Graph >::edges_size_type n_edges = 1000; in main() local
85 n_edges = lexical_cast< std::size_t >(argv[2]); in main()
96 generate_random_graph(g, n_verts, n_edges, gen); in main()
|
| /third_party/boost/libs/graph/example/ |
| D | bellman-example.cpp | 61 const int n_edges = 10; in main() local
64 int weight[n_edges] = { -4, 8, 5, -2, 9, -3, 7, 2, 6, 7 }; in main()
71 for (std::size_t j = 0; j < n_edges; ++j) in main()
74 Graph g(edge_array, edge_array + n_edges, N); in main()
|
| D | bfs-example.cpp | 56 const int n_edges = sizeof(edge_array) / sizeof(E); in main() local
60 for (std::size_t j = 0; j < n_edges; ++j) in main()
64 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
|
| D | bfs-example2.cpp | 64 const int n_edges = sizeof(edge_array) / sizeof(E); in main() local
71 for (std::size_t j = 0; j < n_edges; ++j) in main()
75 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
|
| D | bellman-ford-internet.cpp | 28 const int n_edges = 11; in main() local
40 Graph g(edges, edges + n_edges); in main()
|
| D | min_max_paths.cpp | 58 const int n_edges = sizeof(edges) / sizeof(E); in main() local
71 Graph G(edges, edges + n_edges, weights, num_nodes); in main()
|
| /third_party/boost/boost/graph/ |
| D | make_biconnected_planar.hpp | 39 edge_size_t n_edges(num_edges(g)); in make_biconnected_planar() local
41 std::vector< edge_size_t > component_vector(n_edges); in make_biconnected_planar()
54 edge_size_t previous_component(n_edges + 1); in make_biconnected_planar()
|
| D | metis.hpp | 122 edges_size_type num_edges() const { return n_edges; } in num_edges()
141 edges_size_type n_edges; member in boost::graph::metis_reader
304 if (!(line_in >> n_vertices >> n_edges)) in start()
|
| D | dimacs.hpp | 168 inline vertices_size_type n_edges() { return num_edges; } in n_edges() function in boost::graph::dimacs_basic_reader
|
| /third_party/freetype/src/autofit/ |
| D | afcjk.c | 1819 FT_PtrDist n_edges; in af_cjk_hint_edges() local
2070 n_edges = edge_limit - edges; in af_cjk_hint_edges()
2071 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_cjk_hint_edges()
2077 if ( n_edges == 6 ) in af_cjk_hint_edges()
2107 if ( n_edges == 12 ) in af_cjk_hint_edges()
|
| D | aflatin2.c | 2183 FT_Int n_edges = edge_limit - edges; in af_latin2_hint_edges()
2186 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_latin2_hint_edges()
2192 if ( n_edges == 6 ) in af_latin2_hint_edges()
2220 if ( n_edges == 12 ) in af_latin2_hint_edges()
|
| D | aflatin.c | 2988 FT_PtrDist n_edges; in af_latin_hint_edges() local
3346 n_edges = edge_limit - edges; in af_latin_hint_edges()
3347 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_latin_hint_edges()
3353 if ( n_edges == 6 ) in af_latin_hint_edges()
3381 if ( n_edges == 12 ) in af_latin_hint_edges()
|
| /third_party/flutter/skia/third_party/externals/freetype/src/autofit/ |
| D | afcjk.c | 1820 FT_PtrDist n_edges; in af_cjk_hint_edges() local
2071 n_edges = edge_limit - edges; in af_cjk_hint_edges()
2072 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_cjk_hint_edges()
2078 if ( n_edges == 6 ) in af_cjk_hint_edges()
2108 if ( n_edges == 12 ) in af_cjk_hint_edges()
|
| D | aflatin2.c | 2183 FT_Int n_edges = edge_limit - edges; in af_latin2_hint_edges()
2186 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_latin2_hint_edges()
2192 if ( n_edges == 6 ) in af_latin2_hint_edges()
2220 if ( n_edges == 12 ) in af_latin2_hint_edges()
|
| D | aflatin.c | 2989 FT_PtrDist n_edges; in af_latin_hint_edges() local
3347 n_edges = edge_limit - edges; in af_latin_hint_edges()
3348 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_latin_hint_edges()
3354 if ( n_edges == 6 ) in af_latin_hint_edges()
3382 if ( n_edges == 12 ) in af_latin_hint_edges()
|
| /third_party/skia/third_party/externals/freetype/src/autofit/ |
| D | afcjk.c | 1802 FT_PtrDist n_edges; in af_cjk_hint_edges() local
2053 n_edges = edge_limit - edges; in af_cjk_hint_edges()
2054 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_cjk_hint_edges()
2060 if ( n_edges == 6 ) in af_cjk_hint_edges()
2090 if ( n_edges == 12 ) in af_cjk_hint_edges()
|
| D | aflatin.c | 2997 FT_PtrDist n_edges; in af_latin_hint_edges() local
3355 n_edges = edge_limit - edges; in af_latin_hint_edges()
3356 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_latin_hint_edges()
3362 if ( n_edges == 6 ) in af_latin_hint_edges()
3390 if ( n_edges == 12 ) in af_latin_hint_edges()
|
| /third_party/skia/third_party/externals/freetype/docs/oldlogs/ |
| D | ChangeLog.23 | 1318 number of edges `n_edges' should be counted by
2337 `n_edges' into `#if' block.
|
| /third_party/flutter/skia/third_party/externals/freetype/ |
| D | ChangeLog.23 | 1318 number of edges `n_edges' should be counted by
2337 `n_edges' into `#if' block.
|
| /third_party/freetype/ |
| D | ChangeLog.23 | 1318 number of edges `n_edges' should be counted by
2337 `n_edges' into `#if' block.
|