std::experimental::shuffle

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Filesystem library (C++17)

Technical Specifications

 

Technical specifications

Filesystem library (filesystem TS)

Library fundamentals (library fundamentals TS)

Library fundamentals 2 (library fundamentals 2 TS)

Extensions for parallelism (parallelism TS)

Concepts (concepts TS)

Extensions for concurrency (concurrency TS)

Special mathematical functions (special math TR)

 

Library fundamentals v2

experimental::propagate_const

experimental::not_fn

experimental::observer_ptr

experimental::make_array

experimental::to_array

experimental::ostream_joiner

experimental::gcd

experimental::lcm

experimental::source_location

experimental::randint

detection idiom

uniform container erasure

logical operator type traits

 

Defined in header <experimental/algorithm>
template< class RandomIt> void shuffle( RandomIt first, RandomIt last);		(library fundamentals TS v2)

Reorders the elements in the given range [first, last) such that each possible permutation of those elements has equal probability of appearance, using the per-thread random number engine as the random number generator.

Parameters

first, last	-	the range of elements to shuffle randomly
- RandomIt must meet the requirements of ValueSwappable and RandomAccessIterator.

Return value

(none)

Complexity

Linear in the distance between first and last.

See also

random_shuffleshuffle (until C++17)(C++11)	randomly re-orders elements in a range (function template)