70342b99e2
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@184358 91177308-0d34-0410-b5e6-96231b3b80d8
74 lines
1.8 KiB
C++
74 lines
1.8 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <set>
|
|
|
|
// class multiset
|
|
|
|
// iterator insert(const value_type& v);
|
|
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef std::multiset<int> M;
|
|
typedef M::iterator R;
|
|
M m;
|
|
R r = m.insert(M::value_type(2));
|
|
assert(r == m.begin());
|
|
assert(m.size() == 1);
|
|
assert(*r == 2);
|
|
|
|
r = m.insert(M::value_type(1));
|
|
assert(r == m.begin());
|
|
assert(m.size() == 2);
|
|
assert(*r == 1);
|
|
|
|
r = m.insert(M::value_type(3));
|
|
assert(r == prev(m.end()));
|
|
assert(m.size() == 3);
|
|
assert(*r == 3);
|
|
|
|
r = m.insert(M::value_type(3));
|
|
assert(r == prev(m.end()));
|
|
assert(m.size() == 4);
|
|
assert(*r == 3);
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
|
|
typedef M::iterator R;
|
|
M m;
|
|
R r = m.insert(M::value_type(2));
|
|
assert(r == m.begin());
|
|
assert(m.size() == 1);
|
|
assert(*r == 2);
|
|
|
|
r = m.insert(M::value_type(1));
|
|
assert(r == m.begin());
|
|
assert(m.size() == 2);
|
|
assert(*r == 1);
|
|
|
|
r = m.insert(M::value_type(3));
|
|
assert(r == prev(m.end()));
|
|
assert(m.size() == 3);
|
|
assert(*r == 3);
|
|
|
|
r = m.insert(M::value_type(3));
|
|
assert(r == prev(m.end()));
|
|
assert(m.size() == 4);
|
|
assert(*r == 3);
|
|
}
|
|
#endif
|
|
}
|