| /external/cronet/tot/third_party/libc++/src/test/libcxx/containers/containers.adaptors/flat.map/ |
| D | assert.sorted_unique.pass.cpp | 34 TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {2, 2, 3}, {4, 5, 6}); }()), in main()
37 TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {4, 2, 3}, {4, 5, 6}); }()), in main()
40 …TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {2, 2, 3}, {4, 5, 6}, std::less<int>{}); … in main()
43 …TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {4, 2, 3}, {4, 5, 6}, std::less<int>{}); … in main()
51 M m(std::sorted_unique, keys, values, alloc); in main()
60 M m(std::sorted_unique, keys, values, alloc); in main()
70 M m(std::sorted_unique, keys, values, comp, alloc); in main()
80 M m(std::sorted_unique, keys, values, comp, alloc); in main()
88 M m(std::sorted_unique, v.begin(), v.end(), comp); in main()
96 M m(std::sorted_unique, v.begin(), v.end(), comp); in main()
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/libcxx/containers/containers.adaptors/flat.map/ |
| D | assert.sorted_unique.pass.cpp | 34 TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {2, 2, 3}, {4, 5, 6}); }()), in main()
37 TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {4, 2, 3}, {4, 5, 6}); }()), in main()
40 …TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {2, 2, 3}, {4, 5, 6}, std::less<int>{}); … in main()
43 …TEST_LIBCPP_ASSERT_FAILURE(([] { M m(std::sorted_unique, {4, 2, 3}, {4, 5, 6}, std::less<int>{}); … in main()
51 M m(std::sorted_unique, keys, values, alloc); in main()
60 M m(std::sorted_unique, keys, values, alloc); in main()
70 M m(std::sorted_unique, keys, values, comp, alloc); in main()
80 M m(std::sorted_unique, keys, values, comp, alloc); in main()
88 M m(std::sorted_unique, v.begin(), v.end(), comp); in main()
96 M m(std::sorted_unique, v.begin(), v.end(), comp); in main()
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/flat.map.cons/ |
| D | sorted_iter_iter.pass.cpp | 63 …auto m = M(std::sorted_unique, cpp17_input_iterator<const P*>(ar), cpp17_input_iterator<con… in main()
68 …M m2 = {std::sorted_unique, cpp17_input_iterator<const P*>(ar), cpp17_input_iterator<const P*>(ar … in main()
77 auto m = M(std::sorted_unique, ar, ar + 4); in main()
87 auto m = M(std::sorted_unique, in main()
95 M m2 = {std::sorted_unique, in main()
107 auto m = M(std::sorted_unique, in main()
119 auto m = M(std::sorted_unique, ar, ar, C(5)); in main()
130 auto m = M(std::sorted_unique, ar, ar + 4, A1(5)); in main()
137 M m2 = {std::sorted_unique, ar, ar + 4, A1(5)}; in main()
150 auto m = M(std::sorted_unique, ar, ar + 4, C(3), A1(5)); in main()
[all …]
|
| D | sorted_container.pass.cpp | 68 auto m = M(std::sorted_unique, ks, vs); in main()
70 m = M(std::sorted_unique, std::move(ks), std::move(vs)); in main()
76 M m2 = {std::sorted_unique, std::move(ks2), std::move(vs2)}; in main()
87 auto m = M(std::sorted_unique, ks, vs); in main()
89 m = M(std::sorted_unique, std::move(ks), std::move(vs)); in main()
101 auto m = M(std::sorted_unique, std::move(ks), std::move(vs)); in main()
115 auto m = M(std::sorted_unique, ks, vs, C(4)); in main()
120 M m2 = {std::sorted_unique, ks, vs, C(4)}; in main()
131 auto m = M(std::sorted_unique, ks, vs, C(4), A(5)); in main()
150 auto m = M(std::sorted_unique, ks, vs, A(6)); // replaces the allocators in main()
[all …]
|
| D | sorted_initializer_list.pass.cpp | 110 auto m = M(std::sorted_unique, il1); in main()
115 M m2 = {std::sorted_unique, il1}; in main()
121 auto m = M(std::sorted_unique, il1, std::less<int>()); in main()
126 M m2 = {std::sorted_unique, il1, std::less<int>()}; in main()
134 auto m = M(std::sorted_unique, il4, std::greater<int>()); in main()
142 auto m = M(std::sorted_unique, il2, A1(5)); in main()
149 M m2 = {std::sorted_unique, il2, A1(5)}; in main()
160 auto m = M(std::sorted_unique, il2, C(3), A1(5)); in main()
172 M m = {std::sorted_unique, il3, {}, A1(5)}; // implicit ctor in main()
|
| D | deduct.pass.cpp | 68 std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs); in test_containers()
84 std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs, test_allocator<long>(0, 44)); in test_containers()
108 std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs, std::greater<int>()); in test_containers_compare()
124 …std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs, std::greater<int>(), test_allocator<long… in test_containers_compare()
151 std::flat_map m(std::sorted_unique, std::begin(sorted_arr), std::end(sorted_arr)); in test_iter_iter()
157 std::flat_map m(std::sorted_unique, std::begin(sorted_arrc), std::end(sorted_arrc)); in test_iter_iter()
193 std::flat_map m(std::sorted_unique, std::begin(sorted_arr), std::end(sorted_arr), C()); in test_iter_iter_compare()
199 std::flat_map m(std::sorted_unique, std::begin(sorted_arrc), std::end(sorted_arrc), C()); in test_iter_iter_compare()
225 std::flat_map m(std::sorted_unique, {std::pair{1, 1L}, {2, 2L}, {3, 1L}, {INT_MAX, 1L}}); in test_initializer_list()
242 std::flat_map m(std::sorted_unique, {std::pair{INT_MAX, 1L}, {3, 1L}, {2, 2L}, {1, 1L}}, C()); in test_initializer_list_compare()
[all …]
|
| /external/cronet/tot/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/flat.map.cons/ |
| D | sorted_iter_iter.pass.cpp | 63 …auto m = M(std::sorted_unique, cpp17_input_iterator<const P*>(ar), cpp17_input_iterator<con… in main()
68 …M m2 = {std::sorted_unique, cpp17_input_iterator<const P*>(ar), cpp17_input_iterator<const P*>(ar … in main()
77 auto m = M(std::sorted_unique, ar, ar + 4); in main()
87 auto m = M(std::sorted_unique, in main()
95 M m2 = {std::sorted_unique, in main()
107 auto m = M(std::sorted_unique, in main()
119 auto m = M(std::sorted_unique, ar, ar, C(5)); in main()
130 auto m = M(std::sorted_unique, ar, ar + 4, A1(5)); in main()
137 M m2 = {std::sorted_unique, ar, ar + 4, A1(5)}; in main()
150 auto m = M(std::sorted_unique, ar, ar + 4, C(3), A1(5)); in main()
[all …]
|
| D | sorted_container.pass.cpp | 68 auto m = M(std::sorted_unique, ks, vs); in main()
70 m = M(std::sorted_unique, std::move(ks), std::move(vs)); in main()
76 M m2 = {std::sorted_unique, std::move(ks2), std::move(vs2)}; in main()
87 auto m = M(std::sorted_unique, ks, vs); in main()
89 m = M(std::sorted_unique, std::move(ks), std::move(vs)); in main()
101 auto m = M(std::sorted_unique, std::move(ks), std::move(vs)); in main()
115 auto m = M(std::sorted_unique, ks, vs, C(4)); in main()
120 M m2 = {std::sorted_unique, ks, vs, C(4)}; in main()
131 auto m = M(std::sorted_unique, ks, vs, C(4), A(5)); in main()
150 auto m = M(std::sorted_unique, ks, vs, A(6)); // replaces the allocators in main()
[all …]
|
| D | sorted_initializer_list.pass.cpp | 110 auto m = M(std::sorted_unique, il1); in main()
115 M m2 = {std::sorted_unique, il1}; in main()
121 auto m = M(std::sorted_unique, il1, std::less<int>()); in main()
126 M m2 = {std::sorted_unique, il1, std::less<int>()}; in main()
134 auto m = M(std::sorted_unique, il4, std::greater<int>()); in main()
142 auto m = M(std::sorted_unique, il2, A1(5)); in main()
149 M m2 = {std::sorted_unique, il2, A1(5)}; in main()
160 auto m = M(std::sorted_unique, il2, C(3), A1(5)); in main()
172 M m = {std::sorted_unique, il3, {}, A1(5)}; // implicit ctor in main()
|
| D | deduct.pass.cpp | 68 std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs); in test_containers()
84 std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs, test_allocator<long>(0, 44)); in test_containers()
108 std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs, std::greater<int>()); in test_containers_compare()
124 …std::flat_map s(std::sorted_unique, sorted_ks, sorted_vs, std::greater<int>(), test_allocator<long… in test_containers_compare()
151 std::flat_map m(std::sorted_unique, std::begin(sorted_arr), std::end(sorted_arr)); in test_iter_iter()
157 std::flat_map m(std::sorted_unique, std::begin(sorted_arrc), std::end(sorted_arrc)); in test_iter_iter()
193 std::flat_map m(std::sorted_unique, std::begin(sorted_arr), std::end(sorted_arr), C()); in test_iter_iter_compare()
199 std::flat_map m(std::sorted_unique, std::begin(sorted_arrc), std::end(sorted_arrc), C()); in test_iter_iter_compare()
225 std::flat_map m(std::sorted_unique, {std::pair{1, 1L}, {2, 2L}, {3, 1L}, {INT_MAX, 1L}}); in test_initializer_list()
242 std::flat_map m(std::sorted_unique, {std::pair{INT_MAX, 1L}, {3, 1L}, {2, 2L}, {1, 1L}}, C()); in test_initializer_list_compare()
[all …]
|
| /external/cronet/stable/base/containers/ |
| D | fixed_flat_set_nocompile.nc | 13 // Constructing a fixed flat set with the sorted_unique tag but unsorted keys
15 auto kNotActuallySorted = base::MakeFixedFlatSet<int>(base::sorted_unique, {3, 2, 1}); // expected…
17 // Constructing a fixed flat set with the sorted_unique tag but duplicate keys
19 auto kSortedButDuplicates = base::MakeFixedFlatSet<int>(base::sorted_unique, {1, 1, 2}); // expect…
|
| D | fixed_flat_set.h | 101 sorted_unique, internal::ToArray<const Key>(data), comp);
124 return MakeFixedFlatSet<Key>(sorted_unique, std::move(data), comp);
|
| /external/cronet/tot/base/containers/ |
| D | fixed_flat_set_nocompile.nc | 13 // Constructing a fixed flat set with the sorted_unique tag but unsorted keys
15 auto kNotActuallySorted = base::MakeFixedFlatSet<int>(base::sorted_unique, {3, 2, 1}); // expected…
17 // Constructing a fixed flat set with the sorted_unique tag but duplicate keys
19 auto kSortedButDuplicates = base::MakeFixedFlatSet<int>(base::sorted_unique, {1, 1, 2}); // expect…
|
| D | fixed_flat_set.h | 101 sorted_unique, internal::ToArray<const Key>(data), comp);
124 return MakeFixedFlatSet<Key>(sorted_unique, std::move(data), comp);
|
| /external/sdv/vsomeip/third_party/boost/container/bench/ |
| D | bench_set.hpp | 131 static type &sorted_unique() in sorted_unique() function
149 static type &sorted_unique() in sorted_unique() function
409 cpu_times boost_set_time = copy_destroy_time< BoostClass >(get_range_t::sorted_unique()); in launch_tests()
412 cpu_times std_set_time = copy_destroy_time< StdClass >(get_range_t::sorted_unique()); in launch_tests()
419 …cpu_times boost_set_time = construct_time< BoostClass >(get_range_t::sorted_unique(), get_range_t:… in launch_tests()
422 …cpu_times std_set_time = construct_time< StdClass >(get_range_t::sorted_unique(), get_range_t::sor… in launch_tests()
439 …cpu_times boost_set_time = insert_time< BoostClass >(get_range_t::sorted_unique(), get_range_t::so… in launch_tests()
442 …cpu_times std_set_time = insert_time< StdClass >(get_range_t::sorted_unique(), get_range_t::sorted… in launch_tests()
459 cpu_times boost_set_time = search_time< BoostClass >(get_range_t::sorted_unique(), "(ord)"); in launch_tests()
462 cpu_times std_set_time = search_time< StdClass >(get_range_t::sorted_unique(), "(ord)"); in launch_tests()
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/flat.map.modifiers/ |
| D | insert_sorted_iter_iter.pass.cpp | 60 …std::sorted_unique, cpp17_input_iterator<P*>(ar1), cpp17_input_iterator<P*>(ar1 + sizeof(ar1) / si… in test()
66 …std::sorted_unique, cpp17_input_iterator<P*>(ar2), cpp17_input_iterator<P*>(ar2 + sizeof(ar2) / si… in test()
80 m.insert(std::sorted_unique, newValues.begin(), newValues.end()); in main()
|
| D | insert_sorted_initializer_list.pass.cpp | 33 m.insert(std::sorted_unique, in test()
60 m.insert(std::sorted_unique, il); in main()
|
| /external/cronet/tot/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/flat.map.modifiers/ |
| D | insert_sorted_iter_iter.pass.cpp | 60 …std::sorted_unique, cpp17_input_iterator<P*>(ar1), cpp17_input_iterator<P*>(ar1 + sizeof(ar1) / si… in test()
66 …std::sorted_unique, cpp17_input_iterator<P*>(ar2), cpp17_input_iterator<P*>(ar2 + sizeof(ar2) / si… in test()
80 m.insert(std::sorted_unique, newValues.begin(), newValues.end()); in main()
|
| D | insert_sorted_initializer_list.pass.cpp | 33 m.insert(std::sorted_unique, in test()
60 m.insert(std::sorted_unique, il); in main()
|
| /external/cronet/stable/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/ |
| D | helpers.h | 194 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
216 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
240 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
263 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
286 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
310 M m(std::sorted_unique, std::move(a), std::move(b)); in test_insert_range_exception_guarantee()
336 M m(std::sorted_unique, std::move(a), std::move(b)); in test_erase_exception_guarantee()
354 M m(std::sorted_unique, std::move(a), std::move(b)); in test_erase_exception_guarantee()
|
| D | op_compare.pass.cpp | 83 C s2 = C(std::sorted_unique, {{std::numeric_limits<double>::quiet_NaN(), 2}}); in main()
91 C s2 = C(std::sorted_unique, {{2, std::numeric_limits<double>::quiet_NaN()}}); in main()
95 s2 = C(std::sorted_unique, {{1, std::numeric_limits<double>::quiet_NaN()}}); in main()
|
| /external/cronet/tot/third_party/libc++/src/test/std/containers/container.adaptors/flat.map/ |
| D | helpers.h | 194 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
216 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
240 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
263 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
286 M m(std::sorted_unique, std::move(a), std::move(b)); in test_emplace_exception_guarantee()
310 M m(std::sorted_unique, std::move(a), std::move(b)); in test_insert_range_exception_guarantee()
336 M m(std::sorted_unique, std::move(a), std::move(b)); in test_erase_exception_guarantee()
354 M m(std::sorted_unique, std::move(a), std::move(b)); in test_erase_exception_guarantee()
|
| D | op_compare.pass.cpp | 83 C s2 = C(std::sorted_unique, {{std::numeric_limits<double>::quiet_NaN(), 2}}); in main()
91 C s2 = C(std::sorted_unique, {{2, std::numeric_limits<double>::quiet_NaN()}}); in main()
95 s2 = C(std::sorted_unique, {{1, std::numeric_limits<double>::quiet_NaN()}}); in main()
|
| /external/cronet/tot/third_party/libc++/src/test/std/containers/container.adaptors/flat.map.syn/ |
| D | sorted_unique.pass.cpp | 33 …maybe_unused]] std::same_as<const std::sorted_unique_t&> decltype(auto) s = (std::sorted_unique); } in test()
34 …maybe_unused]] std::same_as<const std::sorted_unique_t> decltype(auto) copy = std::sorted_unique; } in test()
|
| /external/cronet/stable/third_party/libc++/src/test/std/containers/container.adaptors/flat.map.syn/ |
| D | sorted_unique.pass.cpp | 33 …maybe_unused]] std::same_as<const std::sorted_unique_t&> decltype(auto) s = (std::sorted_unique); } in test()
34 …maybe_unused]] std::same_as<const std::sorted_unique_t> decltype(auto) copy = std::sorted_unique; } in test()
|