// { dg-options "-std=gnu++0x" } // // Copyright (C) 2012-2014 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License along // with this library; see the file COPYING3. If not see // . #include #include #include #include namespace { struct pair_hash { std::size_t operator()(const std::pair& p) const noexcept { return std::hash()(p.first); } }; struct pair_equal_to { bool operator()(const std::pair& x, const std::pair& y) const noexcept { return x.first == y.first; } }; } void test01() { using namespace std; bool test __attribute__((unused)) = true; unordered_multiset, pair_hash, pair_equal_to> mset; vector values; size_t nb_bkts = mset.bucket_count(); int i = 0; for (;; ++i) { mset.insert(make_pair(0, i)); if (mset.bucket_count() != nb_bkts) // Container got rehash break; values.clear(); transform(mset.begin(), mset.end(), back_inserter(values), [](const pair& p) { return p.second; }); } vector rehash_values; transform(mset.begin(), mset.end(), back_inserter(rehash_values), [](const pair& p) { return p.second; }); // Remove the value that result in a rehash rehash_values.erase(remove(rehash_values.begin(), rehash_values.end(), i)); VERIFY( rehash_values == values ); } int main() { test01(); return 0; }