| /third_party/boost/libs/geometry/test/cs_undefined/ |
| D | setops.cpp | 18 inline void set_idsu(G1 const& g1, G2 const& g2, G3 & g3, S const& s) in set_idsu() argument
20 bg::intersection(g1, g2, g3, s); in set_idsu()
21 bg::difference(g1, g2, g3, s); in set_idsu()
22 bg::sym_difference(g1, g2, g3, s); in set_idsu()
23 bg::union_(g1, g2, g3, s); in set_idsu()
27 inline void set_ids(G1 const& g1, G2 const& g2, G3 & g3, S const& s) in set_ids() argument
29 bg::intersection(g1, g2, g3, s); in set_ids()
30 bg::difference(g1, g2, g3, s); in set_ids()
31 bg::sym_difference(g1, g2, g3, s); in set_ids()
35 inline void set_id(G1 const& g1, G2 const& g2, G3 & g3, S const& s) in set_id() argument
[all …]
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_adjacency_list_test.cpp | 184 Graph3 g3(20); in test_main() local
191 for (boost::tie(v, v_end) = vertices(g3); v != v_end; ++v) { in test_main()
195 out_edges(*v, g3); in test_main()
196 out_degree(*v, g3); in test_main()
197 in_edges(*v, g3); in test_main()
198 in_degree(*v, g3); in test_main()
202 if (num_vertices(g3) >= 2) { in test_main()
203 graph_traits<Graph3>::vertex_iterator vi = vertices(g3).first; in test_main()
206 add_edge(u, v, g3); ++added_edges; in test_main()
207 assert(out_degree(u, g3) == 1); in test_main()
[all …]
|
| D | adjlist_build_test.cpp | 158 Graph g3(n, pg); in test_main() local
180 = add_edge(vertex(first->first, g3), vertex(first->second, g3), g3); in test_main()
185 BOOST_CHECK(source(result.first, g3) == vertex(first->first, g3)); in test_main()
186 BOOST_CHECK(target(result.first, g3) == vertex(first->second, g3)); in test_main()
196 synchronize(g3); in test_main()
205 if (num_vertices(g1) != num_vertices(g3)) { in test_main()
207 << " vertices, g3 has " << num_vertices(g3) << " vertices.\n"; in test_main()
212 if (num_edges(g1) != num_edges(g3)) { in test_main()
214 << " edges, g3 has " << num_edges(g3) << " edges.\n"; in test_main()
220 boost::tie(vfirst2, vlast2) = vertices(g3); in test_main()
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | r_c_shortest_paths_test.cpp | 696 SPPRC_Example_Graph g3; in main() local
697 add_vertex(SPPRC_Example_Graph_Vert_Prop(0, 0, 1000), g3); in main()
698 add_vertex(SPPRC_Example_Graph_Vert_Prop(1, 0, 1000), g3); in main()
699 add_vertex(SPPRC_Example_Graph_Vert_Prop(2, 0, 974), g3); in main()
700 add_vertex(SPPRC_Example_Graph_Vert_Prop(3, 0, 972), g3); in main()
701 add_vertex(SPPRC_Example_Graph_Vert_Prop(4, 0, 967), g3); in main()
702 add_vertex(SPPRC_Example_Graph_Vert_Prop(5, 678, 801), g3); in main()
703 add_edge(0, 2, SPPRC_Example_Graph_Arc_Prop(0, 0, 16), g3); in main()
704 add_edge(0, 3, SPPRC_Example_Graph_Arc_Prop(1, 0, 18), g3); in main()
705 add_edge(0, 4, SPPRC_Example_Graph_Arc_Prop(2, 0, 23), g3); in main()
[all …]
|
| D | csr_graph_test.cpp | 213 CSRGraphT g3(boost::edges_are_sorted, in graph_test() local
219 check_consistency(g3); in graph_test()
220 BOOST_TEST((std::size_t)std::distance(edges(g3).first, edges(g3).second) in graph_test()
221 == num_edges(g3)); in graph_test()
222 assert_graphs_equal(g2, boost::identity_property_map(), g3, in graph_test()
341 std::vector< double > vertex_centralities(num_vertices(g3)); in graph_test()
342 std::vector< double > edge_centralities(num_edges(g3)); in graph_test()
343 brandes_betweenness_centrality(g3, in graph_test()
345 vertex_centralities.begin(), get(boost::vertex_index, g3)), in graph_test()
347 edge_centralities.begin(), get(boost::edge_index, g3))); in graph_test()
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | strictFunctionTypesErrors.js | 30 declare let g3: Func<string, Object>;
34 g1 = g3; // Error
38 g2 = g3; // Error
41 g3 = g1; // Ok
42 g3 = g2; // Ok
43 g3 = g4; // Ok
47 g4 = g3; // Error
175 g1 = g3; // Error
178 g2 = g3; // Error
180 g3 = g1; // Ok
[all …]
|
| D | generatorTypeCheck9.symbols | 2 function* g3(): void { }
3 >g3 : Symbol(g3, Decl(generatorTypeCheck9.ts, 0, 0))
|
| D | destructuringWithLiteralInitializers.js | 54 function g3([x, y] = [0, 0]) { } function
55 g3();
56 g3([1, 1]);
131 function g3(_a) {
134 g3();
135 g3([1, 1]);
|
| D | generatorTypeCheck8.symbols | 7 function* g3(): BadGenerator { }
8 >g3 : Symbol(g3, Decl(generatorTypeCheck8.ts, 0, 69))
|
| D | generatorAssignability.types | 11 declare const g3: Generator<number, void, boolean>;
12 >g3 : Generator<number, void, boolean>
119 yield* g3; // ok
120 >yield* g3 : void
121 >g3 : Generator<number, void, boolean>
132 yield* g3; // ok
133 >yield* g3 : void
134 >g3 : Generator<number, void, boolean>
|
| D | generatorAssignability.symbols | 13 declare const g3: Generator<number, void, boolean>;
14 >g3 : Symbol(g3, Decl(generatorAssignability.ts, 3, 13))
111 yield* g3; // ok
112 >g3 : Symbol(g3, Decl(generatorAssignability.ts, 3, 13))
123 yield* g3; // ok
124 >g3 : Symbol(g3, Decl(generatorAssignability.ts, 3, 13))
|
| D | strictFunctionTypesErrors.types | 91 declare let g3: Func<string, Object>;
92 >g3 : Func<string, Object>
102 g1 = g3; // Error
103 >g1 = g3 : Func<string, Object>
105 >g3 : Func<string, Object>
117 g2 = g3; // Error
118 >g2 = g3 : Func<string, Object>
120 >g3 : Func<string, Object>
127 g3 = g1; // Ok
128 >g3 = g1 : Func<Object, Object>
[all …]
|
| D | generatorTypeCheck22.symbols | 15 function* g3() {
16 >g3 : Symbol(g3, Decl(generatorTypeCheck22.ts, 2, 23))
|
| D | generatorTypeCheck9.js | 2 function* g3(): void { }
5 function* g3() { }
|
| D | destructuringWithLiteralInitializers.symbols | 160 function g3([x, y] = [0, 0]) { }
161 >g3 : Symbol(g3, Decl(destructuringWithLiteralInitializers.ts, 49, 11))
165 g3();
166 >g3 : Symbol(g3, Decl(destructuringWithLiteralInitializers.ts, 49, 11))
168 g3([1, 1]);
169 >g3 : Symbol(g3, Decl(destructuringWithLiteralInitializers.ts, 49, 11))
|
| /third_party/typescript/tests/cases/compiler/ |
| D | strictFunctionTypesErrors.ts | 30 declare let g3: Func<string, Object>; variable
34 g1 = g3; // Error
38 g2 = g3; // Error
41 g3 = g1; // Ok
42 g3 = g2; // Ok
43 g3 = g4; // Ok
47 g4 = g3; // Error
|
| /third_party/ltp/testcases/network/multicast/mc_member/ |
| D | mc_member_test.c | 112 unsigned g1, g2, g3, g4; in join_group() local
121 if (sscanf(buf, "%u.%u.%u.%u", &g1, &g2, &g3, &g4) != 4) { in join_group()
127 htonl((g1 << 24) | (g2 << 16) | (g3 << 8) | g4); in join_group()
147 unsigned g1, g2, g3, g4; in leave_group() local
156 if (sscanf(buf, "%u.%u.%u.%u", &g1, &g2, &g3, &g4) != 4) { in leave_group()
162 htonl((g1 << 24) | (g2 << 16) | (g3 << 8) | g4); in leave_group()
|
| /third_party/mingw-w64/mingw-w64-headers/include/ |
| D | codecapi.h | 10 # define DEFINE_CODECAPI_GUID(name, guidstr, g1,g2,g3,g4,g5,g6,g7,g8,g9,g10,g11) \ argument
11 OUR_GUID_ENTRY(CODECAPI_##name, g1,g2,g3,g4,g5,g6,g7,g8,g9,g10,g11)
23 # define DEFINE_CODECAPI_GUID(name, guidstr, g1,g2,g3,g4,g5,g6,g7,g8,g9,g10,g11) \ argument
25 __CRT_UUID_DECL(CODECAPI_##name, g1,g2,g3,g4,g5,g6,g7,g8,g9,g10,g11)
28 # define DEFINE_CODECAPI_GUID(name, guidstr, g1,g2,g3,g4,g5,g6,g7,g8,g9,g10,g11) DEFINE_GUIDSTRU… argument
|
| /third_party/openssl/crypto/perlasm/ |
| D | sparcv9_modes.pl | 943 ldxa [%l7]0x88, %g3 ! %g3:%g2 is tweak
999 movxtod %g3, %f14
1019 srax %g3, 63, %l7 ! next tweak value
1022 addxc %g3, %g3, %g3
1085 movxtod %g3, %f14
1089 srax %g3, 63, %l7 ! next tweak value
1092 addxc %g3, %g3, %g3
1096 movxtod %g3, %f10
1120 movxtod %g3, %f10
1122 srax %g3, 63, %l7 ! next tweak value
[all …]
|
| /third_party/boost/boost/math/special_functions/detail/ |
| D | hypergeometric_rational.hpp | 58 … const T g3 = ((ct2 * z2) * (((z2 / ct1) / (ct1 - two)) * ((ap + xn2)) / (cp + xn3))) * (ap - xn2); in hypergeometric_1F1_rational() local
62 b4 = (g1 * b3) + (g2 * b2) + (g3 * b1); in hypergeometric_1F1_rational()
63 a4 = (g1 * a3) + (g2 * a2) + (g3 * a1); in hypergeometric_1F1_rational()
137 T g3 = (d[2] / d[7]) * (d[1] / d[5]); in hypergeometric_2F1_rational() local
140 g3 *= d[1] / d[6]; in hypergeometric_2F1_rational()
149 b4 = (g1 * b3) + (g2 * b2) + (g3 * b1); in hypergeometric_2F1_rational()
150 a4 = (g1 * a3) + (g2 * a2) + (g3 * a1); in hypergeometric_2F1_rational()
|
| /third_party/typescript/tests/cases/conformance/generators/ |
| D | generatorAssignability.ts | 8 declare const g3: Generator<number, void, boolean>; constant
50 yield* g3; // ok
56 yield* g3; // ok
|
| /third_party/boost/libs/geometry/example/ |
| D | 06_b_transformation_example.cpp | 137 model::polygon<point_2d> g3; in main() local
138 transform(g2, g3, scale); in main()
139 std::clog << "scaled:\t" << boost::geometry::dsv(g3) << std::endl; in main()
140 svg.put(g3, "g3=g2.scale(0.5,0.5)"); in main()
151 transform(g3, g4, combined); in main()
|
| /third_party/typescript/tests/cases/conformance/es6/destructuring/ |
| D | destructuringWithLiteralInitializers.ts | 53 function g3([x, y] = [0, 0]) { } function
54 g3();
55 g3([1, 1]);
|
| /third_party/boost/libs/bind/test/ |
| D | mem_fn_void_test.cpp | 50 void g3(int a1, int a2, int a3) const { g2(a1, a2); g1(a3); } in g3() function
53 void g4(int a1, int a2, int a3, int a4) const { g3(a1, a2, a3); g1(a4); } in g4()
127 mem_fn(&X::g3)(x, 1, 2, 3); in main()
128 mem_fn(&X::g3)(rcx, 1, 2, 3); in main()
129 mem_fn(&X::g3)(&x, 1, 2, 3); in main()
130 mem_fn(&X::g3)(pcx, 1, 2, 3); in main()
131 mem_fn(&X::g3)(sp, 1, 2, 3); in main()
|
| /third_party/boost/libs/math/tools/ |
| D | beta_data.cpp | 21 mp_t g1, g2, g3; in operator ()() local
25 g3 = boost::math::lgamma(a+b, &s3); in operator ()()
26 g1 += g2 - g3; in operator ()()
|