Searched refs:um (Results 1 - 25 of 33) sorted by relevance

12

/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/debug/
H A Dcbegin_neg.cc26 std::unordered_map<int, int> um; local
27 um.cbegin(um.bucket_count());
H A Dcend_neg.cc26 std::unordered_map<int, int> um; local
27 um.cend(um.bucket_count());
H A Dend1_neg.cc26 std::unordered_map<int, int> um; local
27 um.end(um.bucket_count());
H A Dbucket_size_neg.cc26 std::unordered_map<int, int> um; local
27 um.bucket_size(um.bucket_count());
H A Dbegin1_neg.cc26 std::unordered_map<int, int> um; local
27 um.begin(um.bucket_count());
H A Dmax_load_factor_neg.cc26 std::unordered_multimap<int, int> um; local
27 um.max_load_factor(-1.0f);
H A Dend2_neg.cc26 std::unordered_map<int, int> um; local
27 const std::unordered_map<int, int>& cum = um;
28 cum.end(um.bucket_count());
H A Dbegin2_neg.cc26 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 Dbegin1_neg.cc26 std::unordered_multimap<int, int> um; local
27 um.begin(um.bucket_count());
H A Dbucket_size_neg.cc26 std::unordered_map<int, int> um; local
27 um.bucket_size(um.bucket_count());
H A Dcbegin_neg.cc26 std::unordered_map<int, int> um; local
27 um.cbegin(um.bucket_count());
H A Dcend_neg.cc26 std::unordered_map<int, int> um; local
27 um.cend(um.bucket_count());
H A Dend1_neg.cc26 std::unordered_map<int, int> um; local
27 um.end(um.bucket_count());
H A Dmax_load_factor_neg.cc26 std::unordered_map<int, int> um; local
27 um.max_load_factor(-1.0f);
H A Dbegin2_neg.cc26 std::unordered_map<int, int> um; local
27 const std::unordered_map<int, int>& cum = um;
28 cum.begin(um.bucket_count());
H A Dend2_neg.cc26 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 Drange_access.cc28 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 Dobservers.cc26 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 D61667.cc27 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 Dobservers.cc26 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 D29134-map.cc28 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 Dassociative-containers.cc35 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 D2.cc27 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 Ddv-waw-err.s464 mov psr.um = r10
481 mov psr.um = r10
522 mov psr.um = r0
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/ia64/
H A Ddv-waw-err.s450 mov psr.um = r10
467 mov psr.um = r10
508 mov psr.um = r0

Completed in 114 milliseconds

12