• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 // template <class InputIterator>
15 //   void insert(InputIterator first, InputIterator last);
16 
17 #include <set>
18 #include <cassert>
19 
20 #include "test_iterators.h"
21 #include "min_allocator.h"
22 
main()23 int main()
24 {
25     {
26         typedef std::multiset<int> M;
27         typedef int V;
28         V ar[] =
29         {
30             1,
31             1,
32             1,
33             2,
34             2,
35             2,
36             3,
37             3,
38             3
39         };
40         M m;
41         m.insert(input_iterator<const V*>(ar),
42                  input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0])));
43         assert(m.size() == 9);
44         assert(*next(m.begin(), 0) == 1);
45         assert(*next(m.begin(), 1) == 1);
46         assert(*next(m.begin(), 2) == 1);
47         assert(*next(m.begin(), 3) == 2);
48         assert(*next(m.begin(), 4) == 2);
49         assert(*next(m.begin(), 5) == 2);
50         assert(*next(m.begin(), 6) == 3);
51         assert(*next(m.begin(), 7) == 3);
52         assert(*next(m.begin(), 8) == 3);
53     }
54 #if TEST_STD_VER >= 11
55     {
56         typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
57         typedef int V;
58         V ar[] =
59         {
60             1,
61             1,
62             1,
63             2,
64             2,
65             2,
66             3,
67             3,
68             3
69         };
70         M m;
71         m.insert(input_iterator<const V*>(ar),
72                  input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0])));
73         assert(m.size() == 9);
74         assert(*next(m.begin(), 0) == 1);
75         assert(*next(m.begin(), 1) == 1);
76         assert(*next(m.begin(), 2) == 1);
77         assert(*next(m.begin(), 3) == 2);
78         assert(*next(m.begin(), 4) == 2);
79         assert(*next(m.begin(), 5) == 2);
80         assert(*next(m.begin(), 6) == 3);
81         assert(*next(m.begin(), 7) == 3);
82         assert(*next(m.begin(), 8) == 3);
83     }
84 #endif
85 }
86