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 // <map> 11 12 // class map 13 14 // map(initializer_list<value_type> il); 15 16 #include <map> 17 #include <cassert> 18 19 #include "min_allocator.h" 20 21 int main() 22 { 23 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 24 { 25 typedef std::pair<const int, double> V; 26 std::map<int, double> m = 27 { 28 {1, 1}, 29 {1, 1.5}, 30 {1, 2}, 31 {2, 1}, 32 {2, 1.5}, 33 {2, 2}, 34 {3, 1}, 35 {3, 1.5}, 36 {3, 2} 37 }; 38 assert(m.size() == 3); 39 assert(distance(m.begin(), m.end()) == 3); 40 assert(*m.begin() == V(1, 1)); 41 assert(*next(m.begin()) == V(2, 1)); 42 assert(*next(m.begin(), 2) == V(3, 1)); 43 } 44 #if __cplusplus >= 201103L 45 { 46 typedef std::pair<const int, double> V; 47 std::map<int, double, std::less<int>, min_allocator<V>> m = 48 { 49 {1, 1}, 50 {1, 1.5}, 51 {1, 2}, 52 {2, 1}, 53 {2, 1.5}, 54 {2, 2}, 55 {3, 1}, 56 {3, 1.5}, 57 {3, 2} 58 }; 59 assert(m.size() == 3); 60 assert(distance(m.begin(), m.end()) == 3); 61 assert(*m.begin() == V(1, 1)); 62 assert(*next(m.begin()) == V(2, 1)); 63 assert(*next(m.begin(), 2) == V(3, 1)); 64 } 65 #endif 66 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 67 } 68
