insert_initializer_list.pass.cpp revision 70342b99e227912742972b754ad86e75c5d7eefb 
1//===----------------------------------------------------------------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10// <set>
11
12// class multiset
13
14// void insert(initializer_list<value_type> il);
15
16#include <set>
17#include <cassert>
18
19#include "../../min_allocator.h"
20
21int main()
22{
23#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
24    {
25    typedef std::multiset<int> C;
26    typedef C::value_type V;
27    C m = {10, 8};
28    m.insert({1, 2, 3, 4, 5, 6});
29    assert(m.size() == 8);
30    assert(distance(m.begin(), m.end()) == m.size());
31    C::const_iterator i = m.cbegin();
32    assert(*i == V(1));
33    assert(*++i == V(2));
34    assert(*++i == V(3));
35    assert(*++i == V(4));
36    assert(*++i == V(5));
37    assert(*++i == V(6));
38    assert(*++i == V(8));
39    assert(*++i == V(10));
40    }
41#endif  // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
42#if __cplusplus >= 201103L
43    {
44    typedef std::multiset<int, std::less<int>, min_allocator<int>> C;
45    typedef C::value_type V;
46    C m = {10, 8};
47    m.insert({1, 2, 3, 4, 5, 6});
48    assert(m.size() == 8);
49    assert(distance(m.begin(), m.end()) == m.size());
50    C::const_iterator i = m.cbegin();
51    assert(*i == V(1));
52    assert(*++i == V(2));
53    assert(*++i == V(3));
54    assert(*++i == V(4));
55    assert(*++i == V(5));
56    assert(*++i == V(6));
57    assert(*++i == V(8));
58    assert(*++i == V(10));
59    }
60#endif
61}
62