Subversion Repositories openrisc

// { dg-options "-std=gnu++0x" }

// 2010-10-27  Paolo Carlini  <paolo.carlini@oracle.com> 

//

// Copyright (C) 2010 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/>.

// Single-element insert

#include <iterator>

#include <unordered_map>

#include <testsuite_hooks.h>

#include <testsuite_rvalref.h>

void test01()

{

  bool test __attribute__((unused)) = true;

  using __gnu_test::rvalstruct;

  typedef std::unordered_multimap<int, rvalstruct> Map;

  typedef std::pair<const int, rvalstruct> Pair;

  Map m;

  VERIFY( m.empty() );

  Map::iterator i = m.insert(Pair(1, rvalstruct(3)));

  VERIFY( m.size() == 1 );

  VERIFY( std::distance(m.begin(), m.end()) == 1 );

  VERIFY( i == m.begin() );

  VERIFY( i->first == 1 );

  VERIFY( (i->second).val == 3 );

}

void test02()

{

  bool test __attribute__((unused)) = true;

  using __gnu_test::rvalstruct;

  typedef std::unordered_multimap<int, rvalstruct> Map;

  typedef std::pair<const int, rvalstruct> Pair;

  Map m;

  VERIFY( m.empty() );

  m.insert(Pair(2, rvalstruct(3)));

  m.insert(Pair(2, rvalstruct(7)));

  VERIFY( m.size() == 2 );

  VERIFY( std::distance(m.begin(), m.end()) == 2 );

  Map::iterator i1 = m.begin();

  Map::iterator i2 = i1;

  ++i2;

  VERIFY( i1->first == 2 );

  VERIFY( i2->first == 2 );

  VERIFY( ((i1->second).val == 3 && (i2->second).val == 7)

          || ((i1->second).val == 7 && (i2->second).val == 3) );

}

int main()

{

  test01();

  test02();

  return 0;

}