/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/debug/ |
H A D | cbegin_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.cbegin(um.bucket_count());
|
H A D | cend_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.cend(um.bucket_count());
|
H A D | end1_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.end(um.bucket_count());
|
H A D | bucket_size_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.bucket_size(um.bucket_count());
|
H A D | begin1_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.begin(um.bucket_count());
|
H A D | max_load_factor_neg.cc | 26 std::unordered_multimap<int, int> um; local 27 um.max_load_factor(-1.0f);
|
H A D | end2_neg.cc | 26 std::unordered_map<int, int> um; local 27 const std::unordered_map<int, int>& cum = um; 28 cum.end(um.bucket_count());
|
H A D | begin2_neg.cc | 26 std::unordered_map<int, int> um; local 27 const std::unordered_map<int, int>& cum = um; 28 cum.begin(um.bucket_count());
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/debug/ |
H A D | begin1_neg.cc | 26 std::unordered_multimap<int, int> um; local 27 um.begin(um.bucket_count());
|
H A D | bucket_size_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.bucket_size(um.bucket_count());
|
H A D | cbegin_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.cbegin(um.bucket_count());
|
H A D | cend_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.cend(um.bucket_count());
|
H A D | end1_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.end(um.bucket_count());
|
H A D | max_load_factor_neg.cc | 26 std::unordered_map<int, int> um; local 27 um.max_load_factor(-1.0f);
|
H A D | begin2_neg.cc | 26 std::unordered_map<int, int> um; local 27 const std::unordered_map<int, int>& cum = um; 28 cum.begin(um.bucket_count());
|
H A D | end2_neg.cc | 26 std::unordered_map<int, int> um; local 27 const std::unordered_map<int, int>& cum = um; 28 cum.end(um.bucket_count());
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/ |
H A D | range_access.cc | 28 std::unordered_map<int, double> um{{1, 1.0}, {2, 2.0}, {3, 3.0}}; 29 std::begin(um); 30 std::end(um);
|
H A D | observers.cc | 26 std::unordered_map<int, int> um; local 28 auto ke __attribute__((unused)) = um.key_eq(); 29 auto h __attribute__((unused)) = um.hash_function();
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/modifiers/ |
H A D | 61667.cc | 27 std::unordered_map<int, int> um(20); 29 std::size_t bkt_count = um.bucket_count(); 31 um.max_load_factor(um.max_load_factor()); 33 VERIFY( um.bucket_count() >= bkt_count ); 35 um.max_load_factor(um.max_load_factor() * 2.f); 37 VERIFY( um.bucket_count() >= bkt_count );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/ |
H A D | observers.cc | 26 std::unordered_multimap<int, int> um; local 28 auto ke __attribute__((unused)) = um.key_eq(); 29 auto h __attribute__((unused)) = um.hash_function();
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/6_containers/unordered_map/capacity/ |
H A D | 29134-map.cc | 28 std::tr1::unordered_map<int, int> um; local 30 VERIFY( (um.max_size() == std::allocator<std::tr1::__detail::_Hash_node<
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/libstdc++-xmethods/ |
H A D | associative-containers.cc | 35 std::unordered_map<char, int> um, um1; local 47 um.insert(std::pair<char, int> ('a' + i % 7, i)); 69 // { dg-final { note-test um.size() 7 } } 70 // { dg-final { note-test um.empty() false } }
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/erase/ |
H A D | 2.cc | 27 get_nb_bucket_elems(const std::unordered_multimap<std::string, int>& um) argument 30 for (std::size_t b = 0; b != um.bucket_count(); ++b) 31 nb += um.bucket_size(b);
|
/haiku-buildtools/binutils/gas/testsuite/gas/ia64/ |
H A D | dv-waw-err.s | 464 mov psr.um = r10 481 mov psr.um = r10 522 mov psr.um = r0
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/ia64/ |
H A D | dv-waw-err.s | 450 mov psr.um = r10 467 mov psr.um = r10 508 mov psr.um = r0
|