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_set>

#include <testsuite_hooks.h>

#include <testsuite_rvalref.h>

namespace

{

  template <typename _Tp>

    std::size_t

    get_nb_bucket_elems(const std::unordered_multiset<_Tp>& us)

    {

      std::size_t nb = 0;

      for (std::size_t b = 0; b != us.bucket_count(); ++b)

        nb += us.bucket_size(b);

      return nb;

    }

}

void test01()

{

  bool test __attribute__((unused)) = true;

  using __gnu_test::rvalstruct;

  typedef std::unordered_multiset<rvalstruct> Set;

  Set s;

  VERIFY( s.empty() );

  Set::iterator i = s.insert(rvalstruct(1));

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

  VERIFY( get_nb_bucket_elems(s) == 1 );

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

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

  VERIFY( (*i).val == 1 );

}

void test02()

{

  bool test __attribute__((unused)) = true;

  using __gnu_test::rvalstruct;

  typedef std::unordered_multiset<rvalstruct> Set;

  Set s;

  VERIFY( s.empty() );

  s.insert(rvalstruct(2));

  Set::iterator i = s.insert(rvalstruct(2));

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

  VERIFY( get_nb_bucket_elems(s) == 2 );

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

  VERIFY( (*i).val == 2 );

  Set::iterator i2 = s.begin();

  ++i2;

  VERIFY( i == s.begin() || i == i2 );

  VERIFY( (*(s.begin())).val == 2 && (*i2).val == 2 );

}

int main()

{

  test01();

  test02();

  return 0;

}