2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <algorithm>
|
|
|
|
|
2010-05-26 19:49:34 +02:00
|
|
|
// template<class RandomAccessIterator, class UniformRandomNumberGenerator>
|
|
|
|
// void shuffle(RandomAccessIterator first, RandomAccessIterator last,
|
|
|
|
// UniformRandomNumberGenerator& g);
|
2010-05-11 21:42:16 +02:00
|
|
|
|
|
|
|
#include <algorithm>
|
2010-05-26 19:49:34 +02:00
|
|
|
#include <random>
|
|
|
|
#include <cassert>
|
2010-05-11 21:42:16 +02:00
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
2010-05-26 19:49:34 +02:00
|
|
|
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));
|
2010-05-11 21:42:16 +02:00
|
|
|
}
|