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