Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame^] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | // <set> |
| 11 | |
| 12 | // class set |
| 13 | |
| 14 | // void insert(initializer_list<value_type> il); |
| 15 | |
| 16 | #include <set> |
| 17 | #include <cassert> |
| 18 | |
| 19 | int main() |
| 20 | { |
| 21 | #ifdef _LIBCPP_MOVE |
| 22 | typedef std::set<int> C; |
| 23 | typedef C::value_type V; |
| 24 | C m = {10, 8}; |
| 25 | m.insert({1, 2, 3, 4, 5, 6}); |
| 26 | assert(m.size() == 8); |
| 27 | assert(distance(m.begin(), m.end()) == m.size()); |
| 28 | C::const_iterator i = m.cbegin(); |
| 29 | assert(*i == V(1)); |
| 30 | assert(*++i == V(2)); |
| 31 | assert(*++i == V(3)); |
| 32 | assert(*++i == V(4)); |
| 33 | assert(*++i == V(5)); |
| 34 | assert(*++i == V(6)); |
| 35 | assert(*++i == V(8)); |
| 36 | assert(*++i == V(10)); |
| 37 | #endif |
| 38 | } |