2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
2010-11-16 23:09:02 +01: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 21:42:16 +02:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <set>
|
|
|
|
|
|
|
|
// class multiset
|
|
|
|
|
|
|
|
// size_type size() const;
|
|
|
|
|
|
|
|
#include <set>
|
|
|
|
#include <cassert>
|
|
|
|
|
2013-06-19 23:29:40 +02:00
|
|
|
#include "../../min_allocator.h"
|
|
|
|
|
2010-05-11 21:42:16 +02:00
|
|
|
int main()
|
|
|
|
{
|
2013-06-19 23:29:40 +02:00
|
|
|
{
|
2010-05-11 21:42:16 +02:00
|
|
|
typedef std::multiset<int> M;
|
|
|
|
M m;
|
|
|
|
assert(m.size() == 0);
|
|
|
|
m.insert(M::value_type(2));
|
|
|
|
assert(m.size() == 1);
|
|
|
|
m.insert(M::value_type(1));
|
|
|
|
assert(m.size() == 2);
|
|
|
|
m.insert(M::value_type(2));
|
|
|
|
assert(m.size() == 3);
|
|
|
|
m.erase(m.begin());
|
|
|
|
assert(m.size() == 2);
|
|
|
|
m.erase(m.begin());
|
|
|
|
assert(m.size() == 1);
|
|
|
|
m.erase(m.begin());
|
|
|
|
assert(m.size() == 0);
|
2013-06-19 23:29:40 +02:00
|
|
|
}
|
|
|
|
#if __cplusplus >= 201103L
|
|
|
|
{
|
|
|
|
typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
|
|
|
|
M m;
|
|
|
|
assert(m.size() == 0);
|
|
|
|
m.insert(M::value_type(2));
|
|
|
|
assert(m.size() == 1);
|
|
|
|
m.insert(M::value_type(1));
|
|
|
|
assert(m.size() == 2);
|
|
|
|
m.insert(M::value_type(2));
|
|
|
|
assert(m.size() == 3);
|
|
|
|
m.erase(m.begin());
|
|
|
|
assert(m.size() == 2);
|
|
|
|
m.erase(m.begin());
|
|
|
|
assert(m.size() == 1);
|
|
|
|
m.erase(m.begin());
|
|
|
|
assert(m.size() == 0);
|
|
|
|
}
|
|
|
|
#endif
|
2010-05-11 21:42:16 +02:00
|
|
|
}
|