Howard Hinnant | bbdf669 | 2013-07-04 19:46:35 +0000 | [diff] [blame] | 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 | // template <class Key, class T, class Compare = less<Key>, |
| 13 | // class Allocator = allocator<pair<const Key, T>>> |
| 14 | // class map |
| 15 | |
| 16 | // http://llvm.org/bugs/show_bug.cgi?id=16538 |
Howard Hinnant | abb160e | 2013-07-05 18:06:00 +0000 | [diff] [blame^] | 17 | // http://llvm.org/bugs/show_bug.cgi?id=16549 |
Howard Hinnant | bbdf669 | 2013-07-04 19:46:35 +0000 | [diff] [blame] | 18 | |
| 19 | #include <map> |
| 20 | |
| 21 | struct Key { |
| 22 | template <typename T> Key(const T&) {} |
| 23 | bool operator< (const Key&) const { return false; } |
| 24 | }; |
| 25 | |
| 26 | int |
| 27 | main() |
| 28 | { |
| 29 | std::map<Key, int>::iterator it = std::map<Key, int>().find(Key(0)); |
Howard Hinnant | abb160e | 2013-07-05 18:06:00 +0000 | [diff] [blame^] | 30 | std::pair<std::map<Key, int>::iterator, bool> result = |
| 31 | std::map<Key, int>().insert(std::make_pair(Key(0), 0)); |
Howard Hinnant | bbdf669 | 2013-07-04 19:46:35 +0000 | [diff] [blame] | 32 | } |