Home | History | Annotate | Download | only in alg.random.shuffle
      1 //===----------------------------------------------------------------------===//
      2 //
      3 //                     The LLVM Compiler Infrastructure
      4 //
      5 // This file is dual licensed under the MIT and the University of Illinois Open
      6 // Source Licenses. See LICENSE.TXT for details.
      7 //
      8 //===----------------------------------------------------------------------===//
      9 
     10 // <algorithm>
     11 
     12 // template<class RandomAccessIterator, class UniformRandomNumberGenerator>
     13 //     void shuffle(RandomAccessIterator first, RandomAccessIterator last,
     14 //                  UniformRandomNumberGenerator& g);
     15 
     16 #include <algorithm>
     17 #include <random>
     18 #include <cassert>
     19 
     20 #include "test_macros.h"
     21 
     22 int main()
     23 {
     24     int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
     25     int ia1[] = {2, 7, 1, 4, 3, 6, 5, 10, 9, 8};
     26     int ia2[] = {1, 8, 3, 4, 6, 9, 5, 7, 2, 10};
     27     const unsigned sa = sizeof(ia)/sizeof(ia[0]);
     28     std::minstd_rand g;
     29     std::shuffle(ia, ia+sa, g);
     30     LIBCPP_ASSERT(std::equal(ia, ia+sa, ia1));
     31     assert(std::is_permutation(ia, ia+sa, ia1));
     32     std::shuffle(ia, ia+sa, std::move(g));
     33     LIBCPP_ASSERT(std::equal(ia, ia+sa, ia2));
     34     assert(std::is_permutation(ia, ia+sa, ia2));
     35 }
     36