Howard Hinnant | 3e51952 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
Howard Hinnant | 5b08a8a | 2010-05-11 21:36:01 +0000 | [diff] [blame^] | 3 | // The LLVM Compiler Infrastructure |
Howard Hinnant | 3e51952 | 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 | // pair<iterator, bool> insert(const value_type& v); |
| 15 | |
| 16 | #include <set> |
| 17 | #include <cassert> |
| 18 | |
| 19 | int main() |
| 20 | { |
| 21 | { |
| 22 | typedef std::set<int> M; |
| 23 | typedef std::pair<M::iterator, bool> R; |
| 24 | M m; |
| 25 | R r = m.insert(M::value_type(2)); |
| 26 | assert(r.second); |
| 27 | assert(r.first == m.begin()); |
| 28 | assert(m.size() == 1); |
| 29 | assert(*r.first == 2); |
| 30 | |
| 31 | r = m.insert(M::value_type(1)); |
| 32 | assert(r.second); |
| 33 | assert(r.first == m.begin()); |
| 34 | assert(m.size() == 2); |
| 35 | assert(*r.first == 1); |
| 36 | |
| 37 | r = m.insert(M::value_type(3)); |
| 38 | assert(r.second); |
| 39 | assert(r.first == prev(m.end())); |
| 40 | assert(m.size() == 3); |
| 41 | assert(*r.first == 3); |
| 42 | |
| 43 | r = m.insert(M::value_type(3)); |
| 44 | assert(!r.second); |
| 45 | assert(r.first == prev(m.end())); |
| 46 | assert(m.size() == 3); |
| 47 | assert(*r.first == 3); |
| 48 | } |
| 49 | } |