+2019-05-08 François Dumont <fdumont@gcc.gnu.org>
+
+ PR libstdc++/90277
+ * testsuite/23_containers/unordered_multiset/insert/24061-multiset.cc
+ (test01): Reserve for number of insertions to avoid rehash during test.
+ * testsuite/23_containers/unordered_multimap/insert/24061-multimap.cc
+ (test01): Likewise.
+ * testsuite/23_containers/unordered_multimap/insert/24061-multimap.cc
+ (test01): Likewise.
+ (test02): Likewise.
+ (test03): Likewise.
+
2019-05-08 Jonathan Wakely <jwakely@redhat.com>
* include/experimental/bits/fs_path.h: Improve docs.
2019-05-04 François Dumont <fdumont@gcc.gnu.org>
- PR libstdc++/90277
* include/bits/hashtable.h (_Hashtable<>::rehash): Review comment.
* include/bits/hashtable_policy.h
(_Prime_rehash_policy::_M_bkt_for_elements): Use __builtin_ceill.
typedef Mmap::value_type value_type;
Mmap mm1;
-
+ mm1.reserve(3);
+
iterator it1 = mm1.insert(mm1.begin(),
value_type("all the love in the world", 1));
VERIFY( mm1.size() == 1 );
typedef typename Map::value_type Pair;
Map m;
+ m.reserve(3);
auto it1 = m.insert(Pair(0, 0));
VERIFY( it1 != m.end() );
typedef typename Map::value_type Pair;
Map m;
+ m.reserve(5);
auto it1 = m.insert(Pair(0, 0));
auto it2 = m.insert(it1, Pair(1, 0));
typedef typename Map::value_type Pair;
Map m;
+ m.reserve(3);
auto it1 = m.insert(Pair(0, 0));
VERIFY( it1 != m.end() );
typedef Mset::const_iterator const_iterator;
Mset ms1;
+ ms1.reserve(3);
iterator it1 = ms1.insert(ms1.begin(), "all the love in the world");
VERIFY( ms1.size() == 1 );