| /third_party/boost/boost/move/algo/detail/ |
| D | insertion_sort.hpp | 47 BirdirectionalIterator j2 = last2; in insertion_sort_op() local
48 BirdirectionalIterator i2 = j2; in insertion_sort_op()
50 op(i2, j2); in insertion_sort_op()
51 for (--j2; i2 != first2 && comp(*first1, *--i2); --j2) { in insertion_sort_op()
52 op(i2, j2); in insertion_sort_op()
55 op(first1, j2); in insertion_sort_op()
108 BirdirectionalRawIterator j2 = last2; in insertion_sort_uninitialized_copy() local
109 BirdirectionalRawIterator k2 = j2; in insertion_sort_uninitialized_copy()
111 ::new((iterator_to_raw_pointer)(j2), boost_move_new_t()) value_type(::boost::move(*k2)); in insertion_sort_uninitialized_copy()
113 for (--j2; k2 != first2 && comp(*first1, *--k2); --j2) in insertion_sort_uninitialized_copy()
[all …]
|
| /third_party/boost/libs/serialization/test/ |
| D | test_cyclic_ptrs.cpp | 71 J j2; member in K
80 ar & BOOST_SERIALIZATION_NVP(j2); in serialize()
89 : j1(&j2), j2(&j3), j3(&j1) in K()
96 j1.j == & j2 in operator ==()
97 && j2.j == & j3 in operator ==()
100 && j2 == rhs.j2 in operator ==()
109 J j1, j2; in test1() local
119 ia >> BOOST_SERIALIZATION_NVP(j2); in test1()
121 BOOST_CHECK(j1 == j2); in test1()
132 J *j2 = reinterpret_cast<J *>(0xBAADF00D); in test2() local
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | recursiveTypesWithTypeof.js | 34 var j2: new <T extends typeof j2>(x: T) => T; variable
35 var j2 = new j2(j2); variable
84 var j2; variable
85 var j2 = new j2(j2); variable
|
| D | recursiveTypesWithTypeof.types | 113 var j2: new <T extends typeof j2>(x: T) => T;
114 >j2 : new <T extends any>(x: T) => T
115 >j2 : new <T extends any>(x: T) => T
118 var j2 = new j2(j2);
119 >j2 : new <T extends any>(x: T) => T
120 >new j2(j2) : new <T extends any>(x: T) => T
121 >j2 : new <T extends any>(x: T) => T
122 >j2 : new <T extends any>(x: T) => T
|
| D | recursiveTypesWithTypeof.symbols | 117 var j2: new <T extends typeof j2>(x: T) => T;
118 >j2 : Symbol(j2, Decl(recursiveTypesWithTypeof.ts, 32, 3), Decl(recursiveTypesWithTypeof.ts, 33, 3))
120 >j2 : Symbol(j2, Decl(recursiveTypesWithTypeof.ts, 32, 3), Decl(recursiveTypesWithTypeof.ts, 33, 3))
125 var j2 = new j2(j2);
126 >j2 : Symbol(j2, Decl(recursiveTypesWithTypeof.ts, 32, 3), Decl(recursiveTypesWithTypeof.ts, 33, 3))
127 >j2 : Symbol(j2, Decl(recursiveTypesWithTypeof.ts, 32, 3), Decl(recursiveTypesWithTypeof.ts, 33, 3))
128 >j2 : Symbol(j2, Decl(recursiveTypesWithTypeof.ts, 32, 3), Decl(recursiveTypesWithTypeof.ts, 33, 3))
|
| /third_party/openssl/crypto/modes/asm/ |
| D | ghashv8-armx.pl | 411 my ($I0,$j1,$j2,$j3,
429 vrev64.8 $j2,$j2
434 vext.8 $I2,$j2,$j2,#8
443 veor $j2,$j2,$I2
445 vpmull2.p64 $j2,$Hhl,$j2
449 veor $Ym,$Ym,$j2
472 vrev64.8 $j2,$j2
485 vext.8 $I2,$j2,$j2,#8
502 veor $j2,$j2,$I2
505 vpmull2.p64 $j2,$Hhl,$j2
[all …]
|
| /third_party/json/test/src/ |
| D | unit-algorithms.cpp | 264 json j2 = {1, 2, 3, 5, 7}; variable
267 std::merge(j1.begin(), j1.end(), j2.begin(), j2.end(), std::back_inserter(j3));
275 json j2 = {1, 2, 3, 5, 7}; variable
278 std::set_difference(j1.begin(), j1.end(), j2.begin(), j2.end(), std::back_inserter(j3));
285 json j2 = {1, 2, 3, 5, 7}; variable
288 … std::set_intersection(j1.begin(), j1.end(), j2.begin(), j2.end(), std::back_inserter(j3));
295 json j2 = {1, 2, 3, 5, 7}; variable
298 std::set_union(j1.begin(), j1.end(), j2.begin(), j2.end(), std::back_inserter(j3));
305 json j2 = {1, 2, 3, 5, 7}; variable
308 … std::set_symmetric_difference(j1.begin(), j1.end(), j2.begin(), j2.end(), std::back_inserter(j3));
|
| D | unit-noexcept.cpp | 91 json j2; variable
92 to_json(j2, pod());
93 to_json(j2, pod_bis());
94 from_json(j2, pod());
95 from_json(j2, pod_bis());
|
| D | unit-udt_macro.cpp | 279 nlohmann::json j2 = nlohmann::json::parse(s); variable
281 j2.get_to(obj2);
290 nlohmann::json j2 = nlohmann::json::from_msgpack(buf); variable
292 j2.get_to(obj2);
301 nlohmann::json j2 = nlohmann::json::from_bson(buf); variable
303 j2.get_to(obj2);
312 nlohmann::json j2 = nlohmann::json::from_cbor(buf); variable
314 j2.get_to(obj2);
323 nlohmann::json j2 = nlohmann::json::from_ubjson(buf); variable
325 j2.get_to(obj2);
|
| /third_party/boost/libs/utility/test/ |
| D | operators_test.cpp | 684 MyLong j2(2); in main() local
688 BOOST_TEST( j2.value() == 2 ); in main()
693 PRIVATE_EXPR_TEST( (j = j2), (j.value() == 2) ); in main()
695 BOOST_TEST( static_cast<bool>(j2 == j) ); in main()
697 BOOST_TEST( static_cast<bool>(j2 == 2) ); in main()
698 BOOST_TEST( static_cast<bool>(j == j2) ); in main()
699 BOOST_TEST( static_cast<bool>(j1 != j2) ); in main()
701 BOOST_TEST( static_cast<bool>(1 != j2) ); in main()
702 BOOST_TEST( static_cast<bool>(j1 < j2) ); in main()
703 BOOST_TEST( static_cast<bool>(1 < j2) ); in main()
[all …]
|
| /third_party/json/doc/examples/ |
| D | insert__range_object.cpp | 10 json j2 = {{"eleven", "elf"}, {"seventeen", "siebzehn"}}; in main() local
14 std::cout << j2 << '\n'; in main()
17 j1.insert(j2.begin(), j2.end()); in main()
|
| D | swap__reference.cpp | 10 json j2 = {{"pi", 3.141592653589793}, {"e", 2.718281828459045}}; in main() local
13 j1.swap(j2); in main()
17 std::cout << "j2 = " << j2 << '\n'; in main()
|
| D | basic_json__basic_json.cpp | 12 json j2(j1); in main() local
15 std::cout << j1 << " = " << j2 << '\n'; in main()
16 std::cout << std::boolalpha << (j1 == j2) << '\n'; in main()
|
| D | basic_json__nullptr_t.cpp | 12 json j2(nullptr); in main() local
15 std::cout << j1 << '\n' << j2 << '\n'; in main()
|
| /third_party/typescript/tests/cases/conformance/types/specifyingTypes/typeQueries/ |
| D | recursiveTypesWithTypeof.ts | 33 var j2: new <T extends typeof j2>(x: T) => T; variable
34 var j2 = new j2(j2); variable
|
| /third_party/boost/libs/container_hash/test/ |
| D | hash_sequence_test.hpp | 53 for(int j2 = i2 + 1; j2 < number_of_containers; ++j2) {
55 (containers[i2] == containers[j2]) ==
56 (hasher(containers[i2]) == hasher(containers[j2]))
|
| D | hash_map_test.hpp | 51 for(int j2 = i2 + 1; j2 < number_of_containers; ++j2) {
53 (containers[i2] == containers[j2]) ==
54 (hasher(containers[i2]) == hasher(containers[j2]))
|
| D | hash_set_test.hpp | 56 for(int j2 = i2 + 1; j2 < number_of_containers; ++j2) {
58 (containers[i2] == containers[j2]) ==
59 (hasher(containers[i2]) == hasher(containers[j2]))
|
| /third_party/boost/libs/multi_array/test/ |
| D | access.cpp | 51 for (index j2 = idx1; j2 != idx1+3; ++j2) in access() local
54 indices[0] = i2; indices[1] = j2; indices[2] = k2; in access()
55 BOOST_TEST(A(indices) == A[i2][j2][k2]); in access()
|
| /third_party/mesa3d/src/mesa/program/ |
| D | prog_noise.c | 353 unsigned int i2, j2, k2; /* Offsets for third corner of simplex in (i,j,k) coords */ in _mesa_noise3() local
362 j2 = 1; in _mesa_noise3()
370 j2 = 0; in _mesa_noise3()
378 j2 = 0; in _mesa_noise3()
388 j2 = 1; in _mesa_noise3()
396 j2 = 1; in _mesa_noise3()
404 j2 = 1; in _mesa_noise3()
419 y2 = y0 - j2 + 2.0f * G3; in _mesa_noise3()
455 t2 * t2 * grad3(perm[ii + i2 + perm[jj + j2 + perm[kk + k2]]], x2, in _mesa_noise3()
526 unsigned int i2, j2, k2, l2; /* The integer offsets for the third simplex corner */ in _mesa_noise4() local
[all …]
|
| /third_party/boost/tools/bcp/ |
| D | output_licence_info.cpp | 232 std::set<fs::path, path_less>::const_iterator i2, j2; in output_license_info() local
234 j2 = m_unknown_licenses.end(); in output_license_info()
235 while(i2 != j2) in output_license_info()
247 j2 = m_unknown_authors.end(); in output_license_info()
248 while(i2 != j2) in output_license_info()
286 j2 = m_can_migrate_to_bsl.end(); in output_license_info()
287 while(i2 != j2) in output_license_info()
299 j2 = m_cannot_migrate_to_bsl.end(); in output_license_info()
300 while(i2 != j2) in output_license_info()
|
| /third_party/gettext/gettext-runtime/src/ |
| D | envsubst.c | 376 size_t j1, j2; in sorted_string_list_member() local
379 j2 = slp->nitems; in sorted_string_list_member()
380 if (j2 > 0) in sorted_string_list_member()
383 while (j2 - j1 > 1) in sorted_string_list_member()
387 size_t j = (j1 + j2) >> 1; in sorted_string_list_member()
391 j2 = j; in sorted_string_list_member()
397 if (j2 > j1) in sorted_string_list_member()
|
| /third_party/boost/boost/math/special_functions/ |
| D | airy.hpp | 31 T j2 = boost::math::cyl_bessel_j(-v, p, pol); in airy_ai_imp() local
32 T ai = sqrt(-x) * (j1 + j2) / 3; in airy_ai_imp()
69 T j2 = boost::math::cyl_bessel_j(-v, p, pol); in airy_bi_imp() local
71 T bi = sqrt(-x / 3) * (j2 - j1); in airy_bi_imp()
86 T j2 = boost::math::cyl_bessel_i(v, p, pol); in airy_bi_imp() local
87 T bi = sqrt(x / 3) * (j1 + j2); in airy_bi_imp()
102 T j2 = boost::math::cyl_bessel_j(-v, p, pol); in airy_ai_prime_imp() local
103 T aip = -x * (j1 - j2) / 3; in airy_ai_prime_imp()
137 T j2 = boost::math::cyl_bessel_j(-v, p, pol); in airy_bi_prime_imp() local
138 T aip = -x * (j1 + j2) / constants::root_three<T>(); in airy_bi_prime_imp()
[all …]
|
| /third_party/boost/boost/qvm/detail/ |
| D | determinant_impl.hpp | 50 int j2 = 0; in determinant_impl_() local
55 m[i-1][j2] = mat_traits<M>::read_element_idx(i,j,a); in determinant_impl_()
56 ++j2; in determinant_impl_()
|
| /third_party/libusb/.private/ |
| D | bm.sh | 31 make -j2
37 make clean -j2
48 make -j2
|