2010-05-11 19:42:16 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 21:36:01 +00:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 19:42:16 +00:00
|
|
|
//
|
2010-11-16 22:09:02 +00:00
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
2010-05-11 19:42:16 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <map>
|
|
|
|
|
|
|
|
// class multimap
|
|
|
|
|
|
|
|
// iterator insert(const_iterator position, const value_type& v);
|
|
|
|
|
|
|
|
#include <map>
|
|
|
|
#include <cassert>
|
|
|
|
|
2013-06-19 21:29:40 +00:00
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
|
2010-05-11 19:42:16 +00:00
|
|
|
int main()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
typedef std::multimap<int, double> M;
|
|
|
|
typedef M::iterator R;
|
|
|
|
M m;
|
|
|
|
R r = m.insert(m.end(), M::value_type(2, 2.5));
|
|
|
|
assert(r == m.begin());
|
|
|
|
assert(m.size() == 1);
|
|
|
|
assert(r->first == 2);
|
|
|
|
assert(r->second == 2.5);
|
|
|
|
|
|
|
|
r = m.insert(m.end(), M::value_type(1, 1.5));
|
|
|
|
assert(r == m.begin());
|
|
|
|
assert(m.size() == 2);
|
|
|
|
assert(r->first == 1);
|
|
|
|
assert(r->second == 1.5);
|
|
|
|
|
|
|
|
r = m.insert(m.end(), M::value_type(3, 3.5));
|
|
|
|
assert(r == prev(m.end()));
|
|
|
|
assert(m.size() == 3);
|
|
|
|
assert(r->first == 3);
|
|
|
|
assert(r->second == 3.5);
|
|
|
|
|
|
|
|
r = m.insert(prev(m.end()), M::value_type(3, 4.5));
|
|
|
|
assert(r == prev(m.end(), 2));
|
|
|
|
assert(m.size() == 4);
|
|
|
|
assert(r->first == 3);
|
|
|
|
assert(r->second == 4.5);
|
|
|
|
}
|
2013-06-19 21:29:40 +00:00
|
|
|
#if __cplusplus >= 201103L
|
|
|
|
{
|
|
|
|
typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
|
|
|
|
typedef M::iterator R;
|
|
|
|
M m;
|
|
|
|
R r = m.insert(m.end(), M::value_type(2, 2.5));
|
|
|
|
assert(r == m.begin());
|
|
|
|
assert(m.size() == 1);
|
|
|
|
assert(r->first == 2);
|
|
|
|
assert(r->second == 2.5);
|
|
|
|
|
|
|
|
r = m.insert(m.end(), M::value_type(1, 1.5));
|
|
|
|
assert(r == m.begin());
|
|
|
|
assert(m.size() == 2);
|
|
|
|
assert(r->first == 1);
|
|
|
|
assert(r->second == 1.5);
|
|
|
|
|
|
|
|
r = m.insert(m.end(), M::value_type(3, 3.5));
|
|
|
|
assert(r == prev(m.end()));
|
|
|
|
assert(m.size() == 3);
|
|
|
|
assert(r->first == 3);
|
|
|
|
assert(r->second == 3.5);
|
|
|
|
|
|
|
|
r = m.insert(prev(m.end()), M::value_type(3, 4.5));
|
|
|
|
assert(r == prev(m.end(), 2));
|
|
|
|
assert(m.size() == 4);
|
|
|
|
assert(r->first == 3);
|
|
|
|
assert(r->second == 4.5);
|
|
|
|
}
|
|
|
|
#endif
|
2010-05-11 19:42:16 +00:00
|
|
|
}
|