Completed [alg.random.shuffle].

git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@104708 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Howard Hinnant
2010-05-26 17:49:34 +00:00
parent 0bfe8809b4
commit c326721e65
6 changed files with 325 additions and 336 deletions

View File

@@ -15,12 +15,16 @@
// random_shuffle(Iter first, Iter last);
#include <algorithm>
#include "../../iterators.h"
#include <cassert>
int main()
{
int ia[] = {1, 2, 3, 4};
int ia1[] = {1, 4, 3, 2};
int ia2[] = {4, 1, 2, 3};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
std::random_shuffle(ia, ia+sa);
assert(std::equal(ia, ia+sa, ia1));
std::random_shuffle(ia, ia+sa);
assert(std::equal(ia, ia+sa, ia2));
}

View File

@@ -16,21 +16,22 @@
// random_shuffle(Iter first, Iter last, Rand&& rand);
#include <algorithm>
#include "../../iterators.h"
#include <cassert>
struct gen
{
int operator()(int n)
{
return 0;
return n-1;
}
};
int main()
{
int ia[] = {1, 2, 3, 4};
int ia1[] = {4, 1, 2, 3};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
gen r;
std::random_shuffle(ia, ia+sa, r);
assert(std::equal(ia, ia+sa, ia1));
}

View File

@@ -9,14 +9,23 @@
// <algorithm>
// template<RandomAccessIterator Iter, UniformRandomNumberGenerator Rand>
// void
// random_shuffle(Iter first, Iter last, Rand&& g);
// template<class RandomAccessIterator, class UniformRandomNumberGenerator>
// void shuffle(RandomAccessIterator first, RandomAccessIterator last,
// UniformRandomNumberGenerator& g);
#include <algorithm>
#error random_shuffle for UniformRandomNumberGenerator not implemented
#include <random>
#include <cassert>
int main()
{
int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int ia1[] = {2, 7, 1, 4, 3, 6, 5, 10, 9, 8};
int ia2[] = {1, 8, 3, 4, 6, 9, 5, 7, 2, 10};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
std::minstd_rand g;
std::shuffle(ia, ia+sa, g);
assert(std::equal(ia, ia+sa, ia1));
std::shuffle(ia, ia+sa, g);
assert(std::equal(ia, ia+sa, ia2));
}