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