insert_hint_rvalue.pass.cpp [plain text]
#include <unordered_map>
#include <cassert>
#include "../../../MoveOnly.h"
int main()
{
{
typedef std::unordered_map<double, int> C;
typedef C::iterator R;
typedef std::pair<double, short> P;
C c;
C::const_iterator e = c.end();
R r = c.insert(e, P(3.5, 3));
assert(c.size() == 1);
assert(r->first == 3.5);
assert(r->second == 3);
r = c.insert(e, P(3.5, 4));
assert(c.size() == 1);
assert(r->first == 3.5);
assert(r->second == 3);
r = c.insert(e, P(4.5, 4));
assert(c.size() == 2);
assert(r->first == 4.5);
assert(r->second == 4);
r = c.insert(e, P(5.5, 4));
assert(c.size() == 3);
assert(r->first == 5.5);
assert(r->second == 4);
}
#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
{
typedef std::unordered_map<MoveOnly, MoveOnly> C;
typedef C::iterator R;
typedef std::pair<MoveOnly, MoveOnly> P;
C c;
C::const_iterator e = c.end();
R r = c.insert(e, P(3, 3));
assert(c.size() == 1);
assert(r->first == 3);
assert(r->second == 3);
r = c.insert(e, P(3, 4));
assert(c.size() == 1);
assert(r->first == 3);
assert(r->second == 3);
r = c.insert(e, P(4, 4));
assert(c.size() == 2);
assert(r->first == 4);
assert(r->second == 4);
r = c.insert(e, P(5, 4));
assert(c.size() == 3);
assert(r->first == 5);
assert(r->second == 4);
}
#endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
}