mirror of
https://github.com/llvm-mirror/libcxx.git
synced 2025-10-23 10:07:41 +08:00
17c38db650
Libc++'s implementation of shuffle and sample already support lvalue and rvalue RNG's. This patch adds tests for both categories and marks the issue as complete. This patch also contains drive-by change for std::experimental::sample which improves the diagnostics produced when the correct iterator categories are not supplied. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@279947 91177308-0d34-0410-b5e6-96231b3b80d8
36 lines
1.1 KiB
C++
36 lines
1.1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <algorithm>
|
|
|
|
// template<class RandomAccessIterator, class UniformRandomNumberGenerator>
|
|
// void shuffle(RandomAccessIterator first, RandomAccessIterator last,
|
|
// UniformRandomNumberGenerator& g);
|
|
|
|
#include <algorithm>
|
|
#include <random>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
|
|
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);
|
|
LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
|
|
assert(std::is_permutation(ia, ia+sa, ia1));
|
|
std::shuffle(ia, ia+sa, std::move(g));
|
|
LIBCPP_ASSERT(std::equal(ia, ia+sa, ia2));
|
|
assert(std::is_permutation(ia, ia+sa, ia2));
|
|
}
|