shuffle() [2/3]

template<typename Iterator>

void fl::shuffle	(	Iterator	first,
		Iterator	last,
		math::random &	rng )

Definition at line 645 of file algorithm.h.

                                                                         {
    if (first == last) {
        return;  // Empty range, nothing to shuffle
    }
    
    auto n = last - first;
    for (auto i = n - 1; i > 0; --i) {
        // Generate random index from 0 to i (inclusive)
        auto j = rng(static_cast<u32>(i + 1));
        
        // Swap elements at positions i and j
        swap(*(first + i), *(first + j));
    }
}

References FL_NOEXCEPT, and swap().

Here is the call graph for this function: