Searched refs:umm (Results 1 - 4 of 4) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/insert/
H A D53115.cc40 std::unordered_multimap<int, int> umm; local
41 umm.insert(make_pair(10, 1));
42 VERIFY( umm.size() == 1 );
43 VERIFY( distance(umm.begin(), umm.end()) - umm.size() == 0 );
44 VERIFY( get_nb_bucket_elems(umm) == umm.size() );
46 umm.insert(make_pair(10, 2));
47 VERIFY( umm
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/
H A Drange_access.cc28 std::unordered_multimap<int, double> umm{{1, 1.0}, {2, 2.0}, {3, 3.0}};
29 std::begin(umm);
30 std::end(umm);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/6_containers/unordered_multimap/capacity/
H A D29134-multimap.cc28 std::tr1::unordered_multimap<int, int> umm; local
30 VERIFY( (umm.max_size() == std::allocator<std::tr1::__detail::_Hash_node<
/haiku-buildtools/gcc/libstdc++-v3/testsuite/libstdc++-xmethods/
H A Dassociative-containers.cc36 std::unordered_multimap<char, int> umm, umm1; local
48 umm.insert(std::pair<char, int> ('a' + i % 7, i));
72 // { dg-final { note-test umm.size() 100 } }
73 // { dg-final { note-test umm.empty() false } }

Completed in 45 milliseconds