1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8
9 // <algorithm>
10
11 // template<class RandomAccessIterator, class UniformRandomNumberGenerator>
12 // void shuffle(RandomAccessIterator first, RandomAccessIterator last,
13 // UniformRandomNumberGenerator& g);
14
15 #include <algorithm>
16 #include <random>
17 #include <cassert>
18
19 #include "test_macros.h"
20
main(int,char **)21 int main(int, char**)
22 {
23 int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
24 int ia1[] = {2, 7, 1, 4, 3, 6, 5, 10, 9, 8};
25 int ia2[] = {1, 8, 3, 4, 6, 9, 5, 7, 2, 10};
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
27 std::minstd_rand g;
28 std::shuffle(ia, ia+sa, g);
29 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
30 assert(std::is_permutation(ia, ia+sa, ia1));
31 std::shuffle(ia, ia+sa, std::move(g));
32 LIBCPP_ASSERT(std::equal(ia, ia+sa, ia2));
33 assert(std::is_permutation(ia, ia+sa, ia2));
34
35 return 0;
36 }
37