text: //===----------------------------------------------------------------------===//
  //
  // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  // See https://llvm.org/LICENSE.txt for license information.
  // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  //
  //===----------------------------------------------------------------------===//
  
  // <list>
  
  // iterator erase(const_iterator position);
  
  #include <list.hxx>
  #include <cassert.hxx>
  
  #include "test_macros.h"
  #include "min_allocator.h"
  
  int main(int, char**)
  {
      {
      int a1[] = {1, 2, 3};
      std::list<int> l1(a1, a1+3);
      std::list<int>::const_iterator i = l1.begin();
      ++i;
      std::list<int>::iterator j = l1.erase(i);
      assert(l1.size() == 2);
      assert(distance(l1.begin(), l1.end()) == 2);
      assert(*j == 3);
      assert(*l1.begin() == 1);
      assert(*next(l1.begin()) == 3);
      j = l1.erase(j);
      assert(j == l1.end());
      assert(l1.size() == 1);
      assert(distance(l1.begin(), l1.end()) == 1);
      assert(*l1.begin() == 1);
      j = l1.erase(l1.begin());
      assert(j == l1.end());
      assert(l1.size() == 0);
      assert(distance(l1.begin(), l1.end()) == 0);
      }
  #if TEST_STD_VER >= 11
      {
      int a1[] = {1, 2, 3};
      std::list<int, min_allocator<int>> l1(a1, a1+3);
      std::list<int, min_allocator<int>>::const_iterator i = l1.begin();
      ++i;
      std::list<int, min_allocator<int>>::iterator j = l1.erase(i);
      assert(l1.size() == 2);
      assert(distance(l1.begin(), l1.end()) == 2);
      assert(*j == 3);
      assert(*l1.begin() == 1);
      assert(*next(l1.begin()) == 3);
      j = l1.erase(j);
      assert(j == l1.end());
      assert(l1.size() == 1);
      assert(distance(l1.begin(), l1.end()) == 1);
      assert(*l1.begin() == 1);
      j = l1.erase(l1.begin());
      assert(j == l1.end());
      assert(l1.size() == 0);
      assert(distance(l1.begin(), l1.end()) == 0);
      }
  #endif
  
    return 0;
  }
  