247d807571
2010-03-19 Paolo Carlini <paolo.carlini@oracle.com> * include/bits/stl_algo.h (shuffle): Add, per D3056. (random_shuffle): Fix signature in C++0x mode. (lower_bound, __lg): Move... * include/bits/stl_algobase.h: ... here. * include/bits/algorithmfwd.h: Adjust. * include/parallel/algorithmfwd.h: Likewise. * include/parallel/algo.h: Likewise. * include/bits/hashtable_policy.h (__lower_bound): Remove, adjust callers. * include/tr1/hashtable_policy.h (__lower_bound): Likewise. * include/bits/random.tcc (__detail::__transform): Add, adjust std::transform callers; don't include <algorithm>. * testsuite/25_algorithms/shuffle/1.cc: Add. * testsuite/25_algorithms/shuffle/requirements/ explicit_instantiation/2.cc: Likewise. * testsuite/25_algorithms/shuffle/requirements/ explicit_instantiation/pod.cc: Likewise. * include/bits/random.h: Add comments. From-SVN: r157564
68 lines
1.9 KiB
C++
68 lines
1.9 KiB
C++
// { dg-options "-std=gnu++0x" }
|
|
// { dg-require-cstdint "" }
|
|
|
|
// 2010-03-19 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/>.
|
|
|
|
#include <algorithm>
|
|
#include <random>
|
|
#include <vector>
|
|
#include <testsuite_hooks.h>
|
|
|
|
void test01()
|
|
{
|
|
bool test __attribute__((unused)) = true;
|
|
|
|
for (unsigned size = 0; size < 50; ++size)
|
|
{
|
|
std::vector<int> vref(size);
|
|
std::iota(vref.begin(), vref.end(), 0);
|
|
std::vector<int> v1(vref), v2(vref);
|
|
|
|
std::ranlux48_base g1(size), g2(size + 1);
|
|
std::shuffle(v1.begin(), v1.end(), g1);
|
|
std::shuffle(v2.begin(), v2.end(), g2);
|
|
|
|
if (size >= 10)
|
|
{
|
|
VERIFY( !std::equal(v1.begin(), v1.end(), vref.begin()) );
|
|
VERIFY( !std::equal(v2.begin(), v2.end(), vref.begin()) );
|
|
VERIFY( !std::equal(v1.begin(), v1.end(), v2.begin()) );
|
|
}
|
|
|
|
for (unsigned ind = 0; ind < size; ++ind)
|
|
{
|
|
auto it1 = std::find(v1.begin(), v1.end(), vref[ind]);
|
|
auto it2 = std::find(v2.begin(), v2.end(), vref[ind]);
|
|
VERIFY( it1 != v1.end() );
|
|
VERIFY( it2 != v2.end() );
|
|
v1.erase(it1);
|
|
v2.erase(it2);
|
|
}
|
|
VERIFY( v1.empty() );
|
|
VERIFY( v2.empty() );
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test01();
|
|
return 0;
|
|
}
|