// 2005-10-08  Paolo Carlini  <pcarlini@suse.de>
//
// Copyright (C) 2005-2024 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3.  If not see
// <http://www.gnu.org/licenses/>.

// 6.3.4.4  Class template unordered_map

#include <tr1/unordered_map>
#include <string>
#include <testsuite_hooks.h>

// libstdc++/24061
void test01()
{
  typedef std::tr1::unordered_map<std::string, int> Map;
  typedef Map::iterator       iterator;
  typedef Map::const_iterator const_iterator;
  typedef Map::value_type     value_type;

  Map m1;

  iterator it1 = m1.insert(m1.begin(),
			   value_type("all the love in the world", 1));
  VERIFY( m1.size() == 1 );
  VERIFY( *it1 == value_type("all the love in the world", 1) );

  const_iterator cit1(it1);
  const_iterator cit2 = m1.insert(cit1,
				  value_type("you know what you are?", 2));
  VERIFY( m1.size() == 2 );
  VERIFY( cit2 != cit1 );
  VERIFY( *cit2 == value_type("you know what you are?", 2) );

  iterator it2 = m1.insert(it1, value_type("all the love in the world", 3));
  VERIFY( m1.size() == 2 );
  VERIFY( it2 == it1 );
  VERIFY( *it2 == value_type("all the love in the world", 1) );
}

int main()
{
  test01();
  return 0;
}
