insert_initializer_list.pass.cpp (1544B)
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 // UNSUPPORTED: c++98, c++03 11 12 // <set> 13 14 // class set 15 16 // void insert(initializer_list<value_type> il); 17 18 #include <set> 19 #include <cassert> 20 #include <cstddef> 21 22 #include "min_allocator.h" 23 24 int main() 25 { 26 { 27 typedef std::set<int> C; 28 typedef C::value_type V; 29 C m = {10, 8}; 30 m.insert({1, 2, 3, 4, 5, 6}); 31 assert(m.size() == 8); 32 assert(static_cast<std::size_t>(distance(m.begin(), m.end())) == m.size()); 33 C::const_iterator i = m.cbegin(); 34 assert(*i == V(1)); 35 assert(*++i == V(2)); 36 assert(*++i == V(3)); 37 assert(*++i == V(4)); 38 assert(*++i == V(5)); 39 assert(*++i == V(6)); 40 assert(*++i == V(8)); 41 assert(*++i == V(10)); 42 } 43 { 44 typedef std::set<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(static_cast<std::size_t>(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 }