text: //===----------------------------------------------------------------------===//
  //
  //                     The LLVM Compiler Infrastructure
  //
  // This file is dual licensed under the MIT and the University of Illinois Open
  // Source Licenses. See LICENSE.TXT for details.
  //
  //===----------------------------------------------------------------------===//
  
  // <map>
  
  // class multimap
  
  // iterator erase(const_iterator position);
  
  #include <map>
  #include <cassert>
  
  #include "../../../min_allocator.h"
  
  int main()
  {
      {
          typedef std::multimap<int, double> M;
          typedef std::pair<int, double> P;
          typedef M::iterator I;
          P ar[] =
          {
              P(1, 1),
              P(1, 1.5),
              P(1, 2),
              P(2, 1),
              P(2, 1.5),
              P(2, 2),
              P(3, 1),
              P(3, 1.5),
              P(3, 2),
          };
          M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
          assert(m.size() == 9);
          I i = m.erase(next(m.cbegin(), 3));
          assert(m.size() == 8);
          assert(i == next(m.begin(), 3));
          assert(m.begin()->first == 1);
          assert(m.begin()->second == 1);
          assert(next(m.begin())->first == 1);
          assert(next(m.begin())->second == 1.5);
          assert(next(m.begin(), 2)->first == 1);
          assert(next(m.begin(), 2)->second == 2);
          assert(next(m.begin(), 3)->first == 2);
          assert(next(m.begin(), 3)->second == 1.5);
          assert(next(m.begin(), 4)->first == 2);
          assert(next(m.begin(), 4)->second == 2);
          assert(next(m.begin(), 5)->first == 3);
          assert(next(m.begin(), 5)->second == 1);
          assert(next(m.begin(), 6)->first == 3);
          assert(next(m.begin(), 6)->second == 1.5);
          assert(next(m.begin(), 7)->first == 3);
          assert(next(m.begin(), 7)->second == 2);
  
          i = m.erase(next(m.cbegin(), 0));
          assert(m.size() == 7);
          assert(i == m.begin());
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 1);
          assert(next(m.begin(), 1)->second == 2);
          assert(next(m.begin(), 2)->first == 2);
          assert(next(m.begin(), 2)->second == 1.5);
          assert(next(m.begin(), 3)->first == 2);
          assert(next(m.begin(), 3)->second == 2);
          assert(next(m.begin(), 4)->first == 3);
          assert(next(m.begin(), 4)->second == 1);
          assert(next(m.begin(), 5)->first == 3);
          assert(next(m.begin(), 5)->second == 1.5);
          assert(next(m.begin(), 6)->first == 3);
          assert(next(m.begin(), 6)->second == 2);
  
          i = m.erase(next(m.cbegin(), 5));
          assert(m.size() == 6);
          assert(i == prev(m.end()));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 1);
          assert(next(m.begin(), 1)->second == 2);
          assert(next(m.begin(), 2)->first == 2);
          assert(next(m.begin(), 2)->second == 1.5);
          assert(next(m.begin(), 3)->first == 2);
          assert(next(m.begin(), 3)->second == 2);
          assert(next(m.begin(), 4)->first == 3);
          assert(next(m.begin(), 4)->second == 1);
          assert(next(m.begin(), 5)->first == 3);
          assert(next(m.begin(), 5)->second == 2);
  
          i = m.erase(next(m.cbegin(), 1));
          assert(m.size() == 5);
          assert(i == next(m.begin()));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 2);
          assert(next(m.begin(), 1)->second == 1.5);
          assert(next(m.begin(), 2)->first == 2);
          assert(next(m.begin(), 2)->second == 2);
          assert(next(m.begin(), 3)->first == 3);
          assert(next(m.begin(), 3)->second == 1);
          assert(next(m.begin(), 4)->first == 3);
          assert(next(m.begin(), 4)->second == 2);
  
          i = m.erase(next(m.cbegin(), 2));
          assert(m.size() == 4);
          assert(i == next(m.begin(), 2));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 2);
          assert(next(m.begin(), 1)->second == 1.5);
          assert(next(m.begin(), 2)->first == 3);
          assert(next(m.begin(), 2)->second == 1);
          assert(next(m.begin(), 3)->first == 3);
          assert(next(m.begin(), 3)->second == 2);
  
          i = m.erase(next(m.cbegin(), 2));
          assert(m.size() == 3);
          assert(i == next(m.begin(), 2));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 2);
          assert(next(m.begin(), 1)->second == 1.5);
          assert(next(m.begin(), 2)->first == 3);
          assert(next(m.begin(), 2)->second == 2);
  
          i = m.erase(next(m.cbegin(), 0));
          assert(m.size() == 2);
          assert(i == next(m.begin(), 0));
          assert(next(m.begin(), 0)->first == 2);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 3);
          assert(next(m.begin(), 1)->second == 2);
  
          i = m.erase(next(m.cbegin(), 1));
          assert(m.size() == 1);
          assert(i == m.end());
          assert(next(m.begin(), 0)->first == 2);
          assert(next(m.begin(), 0)->second == 1.5);
  
          i = m.erase(m.cbegin());
          assert(m.size() == 0);
          assert(i == m.begin());
          assert(i == m.end());
      }
  #if __cplusplus >= 201103L
      {
          typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
          typedef std::pair<int, double> P;
          typedef M::iterator I;
          P ar[] =
          {
              P(1, 1),
              P(1, 1.5),
              P(1, 2),
              P(2, 1),
              P(2, 1.5),
              P(2, 2),
              P(3, 1),
              P(3, 1.5),
              P(3, 2),
          };
          M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
          assert(m.size() == 9);
          I i = m.erase(next(m.cbegin(), 3));
          assert(m.size() == 8);
          assert(i == next(m.begin(), 3));
          assert(m.begin()->first == 1);
          assert(m.begin()->second == 1);
          assert(next(m.begin())->first == 1);
          assert(next(m.begin())->second == 1.5);
          assert(next(m.begin(), 2)->first == 1);
          assert(next(m.begin(), 2)->second == 2);
          assert(next(m.begin(), 3)->first == 2);
          assert(next(m.begin(), 3)->second == 1.5);
          assert(next(m.begin(), 4)->first == 2);
          assert(next(m.begin(), 4)->second == 2);
          assert(next(m.begin(), 5)->first == 3);
          assert(next(m.begin(), 5)->second == 1);
          assert(next(m.begin(), 6)->first == 3);
          assert(next(m.begin(), 6)->second == 1.5);
          assert(next(m.begin(), 7)->first == 3);
          assert(next(m.begin(), 7)->second == 2);
  
          i = m.erase(next(m.cbegin(), 0));
          assert(m.size() == 7);
          assert(i == m.begin());
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 1);
          assert(next(m.begin(), 1)->second == 2);
          assert(next(m.begin(), 2)->first == 2);
          assert(next(m.begin(), 2)->second == 1.5);
          assert(next(m.begin(), 3)->first == 2);
          assert(next(m.begin(), 3)->second == 2);
          assert(next(m.begin(), 4)->first == 3);
          assert(next(m.begin(), 4)->second == 1);
          assert(next(m.begin(), 5)->first == 3);
          assert(next(m.begin(), 5)->second == 1.5);
          assert(next(m.begin(), 6)->first == 3);
          assert(next(m.begin(), 6)->second == 2);
  
          i = m.erase(next(m.cbegin(), 5));
          assert(m.size() == 6);
          assert(i == prev(m.end()));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 1);
          assert(next(m.begin(), 1)->second == 2);
          assert(next(m.begin(), 2)->first == 2);
          assert(next(m.begin(), 2)->second == 1.5);
          assert(next(m.begin(), 3)->first == 2);
          assert(next(m.begin(), 3)->second == 2);
          assert(next(m.begin(), 4)->first == 3);
          assert(next(m.begin(), 4)->second == 1);
          assert(next(m.begin(), 5)->first == 3);
          assert(next(m.begin(), 5)->second == 2);
  
          i = m.erase(next(m.cbegin(), 1));
          assert(m.size() == 5);
          assert(i == next(m.begin()));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 2);
          assert(next(m.begin(), 1)->second == 1.5);
          assert(next(m.begin(), 2)->first == 2);
          assert(next(m.begin(), 2)->second == 2);
          assert(next(m.begin(), 3)->first == 3);
          assert(next(m.begin(), 3)->second == 1);
          assert(next(m.begin(), 4)->first == 3);
          assert(next(m.begin(), 4)->second == 2);
  
          i = m.erase(next(m.cbegin(), 2));
          assert(m.size() == 4);
          assert(i == next(m.begin(), 2));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 2);
          assert(next(m.begin(), 1)->second == 1.5);
          assert(next(m.begin(), 2)->first == 3);
          assert(next(m.begin(), 2)->second == 1);
          assert(next(m.begin(), 3)->first == 3);
          assert(next(m.begin(), 3)->second == 2);
  
          i = m.erase(next(m.cbegin(), 2));
          assert(m.size() == 3);
          assert(i == next(m.begin(), 2));
          assert(next(m.begin(), 0)->first == 1);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 2);
          assert(next(m.begin(), 1)->second == 1.5);
          assert(next(m.begin(), 2)->first == 3);
          assert(next(m.begin(), 2)->second == 2);
  
          i = m.erase(next(m.cbegin(), 0));
          assert(m.size() == 2);
          assert(i == next(m.begin(), 0));
          assert(next(m.begin(), 0)->first == 2);
          assert(next(m.begin(), 0)->second == 1.5);
          assert(next(m.begin(), 1)->first == 3);
          assert(next(m.begin(), 1)->second == 2);
  
          i = m.erase(next(m.cbegin(), 1));
          assert(m.size() == 1);
          assert(i == m.end());
          assert(next(m.begin(), 0)->first == 2);
          assert(next(m.begin(), 0)->second == 1.5);
  
          i = m.erase(m.cbegin());
          assert(m.size() == 0);
          assert(i == m.begin());
          assert(i == m.end());
      }
  #endif
  }
  