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 12eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// template<RandomAccessIterator Iter, Callable<auto, Iter::difference_type> Rand> 13eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// requires ShuffleIterator<Iter> 14eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// && Convertible<Rand::result_type, Iter::difference_type> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// void 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// random_shuffle(Iter first, Iter last, Rand&& rand); 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <algorithm> 19c326721e65fe4e1631cc79a5408f3bf8b154f086Howard Hinnant#include <cassert> 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantstruct gen 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int operator()(int n) 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 25c326721e65fe4e1631cc79a5408f3bf8b154f086Howard Hinnant return n-1; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}; 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int ia[] = {1, 2, 3, 4}; 32c326721e65fe4e1631cc79a5408f3bf8b154f086Howard Hinnant int ia1[] = {4, 1, 2, 3}; 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant const unsigned sa = sizeof(ia)/sizeof(ia[0]); 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant gen r; 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::random_shuffle(ia, ia+sa, r); 36c326721e65fe4e1631cc79a5408f3bf8b154f086Howard Hinnant assert(std::equal(ia, ia+sa, ia1)); 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 38