| 1 | //===----------------------------------------------------------------------===// |
| 2 | // |
| 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | // See https://llvm.org/LICENSE.txt for license information. |
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
| 8 | |
| 9 | // <list> |
| 10 | |
| 11 | // iterator erase(const_iterator position); |
| 12 | |
| 13 | #include <list> |
| 14 | #include <cassert> |
| 15 | |
| 16 | #include "test_macros.h" |
| 17 | #include "min_allocator.h" |
| 18 | |
| 19 | int main(int, char**) { |
| 20 | { |
| 21 | int a1[] = {1, 2, 3}; |
| 22 | std::list<int> l1(a1, a1 + 3); |
| 23 | std::list<int>::const_iterator i = l1.begin(); |
| 24 | ++i; |
| 25 | std::list<int>::iterator j = l1.erase(position: i); |
| 26 | assert(l1.size() == 2); |
| 27 | assert(std::distance(l1.begin(), l1.end()) == 2); |
| 28 | assert(*j == 3); |
| 29 | assert(*l1.begin() == 1); |
| 30 | assert(*std::next(l1.begin()) == 3); |
| 31 | j = l1.erase(position: j); |
| 32 | assert(j == l1.end()); |
| 33 | assert(l1.size() == 1); |
| 34 | assert(std::distance(l1.begin(), l1.end()) == 1); |
| 35 | assert(*l1.begin() == 1); |
| 36 | j = l1.erase(position: l1.begin()); |
| 37 | assert(j == l1.end()); |
| 38 | assert(l1.size() == 0); |
| 39 | assert(std::distance(l1.begin(), l1.end()) == 0); |
| 40 | } |
| 41 | #if TEST_STD_VER >= 11 |
| 42 | { |
| 43 | int a1[] = {1, 2, 3}; |
| 44 | std::list<int, min_allocator<int>> l1(a1, a1 + 3); |
| 45 | std::list<int, min_allocator<int>>::const_iterator i = l1.begin(); |
| 46 | ++i; |
| 47 | std::list<int, min_allocator<int>>::iterator j = l1.erase(i); |
| 48 | assert(l1.size() == 2); |
| 49 | assert(std::distance(l1.begin(), l1.end()) == 2); |
| 50 | assert(*j == 3); |
| 51 | assert(*l1.begin() == 1); |
| 52 | assert(*std::next(l1.begin()) == 3); |
| 53 | j = l1.erase(j); |
| 54 | assert(j == l1.end()); |
| 55 | assert(l1.size() == 1); |
| 56 | assert(std::distance(l1.begin(), l1.end()) == 1); |
| 57 | assert(*l1.begin() == 1); |
| 58 | j = l1.erase(l1.begin()); |
| 59 | assert(j == l1.end()); |
| 60 | assert(l1.size() == 0); |
| 61 | assert(std::distance(l1.begin(), l1.end()) == 0); |
| 62 | } |
| 63 | #endif |
| 64 | |
| 65 | return 0; |
| 66 | } |
| 67 | |