Files
project_6/cccl_upstream/thrust/thrust/random/linear_congruential_engine.h
EngineX CI 56fd68e7dd [INFRA] Import NVIDIA/CCCL upstream as optimization reference library
CCCL (CUDA C++ Core Libraries) provides:
- CUB: device/block/warp-level GPU primitives (reduce, scan, sort, topk)
- Thrust: high-level parallel algorithms (transform_reduce, sort, scan)
- libcudacxx: CUDA C++ standard library (atomics, barriers, memory)
- cudax: experimental features (memory resources, allocators)
- Tuning policies: per-SM hardware-specific algorithm parameters

Competition optimization vectors mapped to CCCL:
- Output TPS (83% weight): warp_reduce, block_reduce, device_topk
- Input TPS (14% weight): device_scan, block_load, prefetch
- Cache TPS (3% weight): prefix caching strategy patterns
- Memory (0.9 util): pooled/cached/buddy allocators

Source: https://github.com/NVIDIA/cccl (shallow clone, HEAD only)
License: Apache-2.0
2026-07-30 09:35:51 +00:00

275 lines
9.1 KiB
C++

// SPDX-FileCopyrightText: Copyright (c) 2008-2013, NVIDIA Corporation. All rights reserved.
// SPDX-License-Identifier: Apache-2.0
/*! \file linear_congruential_engine.h
* \brief A linear congruential pseudorandom number engine.
*/
#pragma once
#include <thrust/detail/config.h>
#if defined(_CCCL_IMPLICIT_SYSTEM_HEADER_GCC)
# pragma GCC system_header
#elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_CLANG)
# pragma clang system_header
#elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_MSVC)
# pragma system_header
#endif // no system header
#include <thrust/random/detail/linear_congruential_engine_discard.h>
#include <thrust/random/detail/random_core_access.h>
#include <cuda/std/__host_stdlib/istream>
#include <cuda/std/__host_stdlib/ostream>
#include <cuda/std/cstdint>
THRUST_NAMESPACE_BEGIN
namespace random
{
/*! \addtogroup random_number_engine_templates Random Number Engine Class Templates
* \ingroup random
* \{
*/
/*! \class linear_congruential_engine
* \brief A \p linear_congruential_engine random number engine produces unsigned integer
* random numbers using a linear congruential random number generation algorithm.
*
* The generation algorithm has the form <tt>x_i = (a * x_{i-1} + c) mod m</tt>.
*
* \tparam UIntType The type of unsigned integer to produce.
* \tparam a The multiplier used in the generation algorithm.
* \tparam c The increment used in the generation algorithm.
* \tparam m The modulus used in the generation algorithm.
*
* \note Inexperienced users should not use this class template directly. Instead, use
* \p minstd_rand or \p minstd_rand0.
*
* The following code snippet shows examples of use of a \p linear_congruential_engine instance:
*
* \code
* #include <thrust/random/linear_congruential_engine.h>
* #include <iostream>
*
* int main()
* {
* // create a minstd_rand object, which is an instance of linear_congruential_engine
* thrust::minstd_rand rng1;
*
* // output some random values to cout
* std::cout << rng1() << '\n';
*
* // a random value is printed
*
* // create a new minstd_rand from a seed
* thrust::minstd_rand rng2(13);
*
* // discard some random values
* rng2.discard(13);
*
* // stream the object to an iostream
* std::cout << rng2 << '\n';
*
* // rng2's current state is printed
*
* // print the minimum and maximum values that minstd_rand can produce
* std::cout << thrust::minstd_rand::min << '\n';
* std::cout << thrust::minstd_rand::max << '\n';
*
* // the range of minstd_rand is printed
*
* // save the state of rng2 to a different object
* thrust::minstd_rand rng3 = rng2;
*
* // compare rng2 and rng3
* std::cout << (rng2 == rng3) << '\n';
*
* // 1 is printed
*
* // re-seed rng2 with a different seed
* rng2.seed(7);
*
* // compare rng2 and rng3
* std::cout << (rng2 == rng3) << '\n';
*
* // 0 is printed
*
* return 0;
* }
*
* \endcode
*
* \see thrust::random::minstd_rand
* \see thrust::random::minstd_rand0
*/
template <typename UIntType, UIntType a, UIntType c, UIntType m>
class linear_congruential_engine
{
public:
// types
/*! \typedef result_type
* \brief The type of the unsigned integer produced by this \p linear_congruential_engine.
*/
using result_type = UIntType;
// engine characteristics
/*! The multiplier used in the generation algorithm.
*/
static const result_type multiplier = a;
/*! The increment used in the generation algorithm.
*/
static const result_type increment = c;
/*! The modulus used in the generation algorithm.
*/
static const result_type modulus = m;
/*! The smallest value this \p linear_congruential_engine may potentially produce.
*/
#ifndef _CCCL_DOXYGEN_INVOKED // Doxygen breaks on the ternary :shrug:
static const result_type min = c == 0u ? 1u : 0u;
#else
static const result_type min = 0u;
#endif // _CCCL_DOXYGEN_INVOKED
/*! The largest value this \p linear_congruential_engine may potentially produce.
*/
static const result_type max = m - 1u;
/*! The default seed of this \p linear_congruential_engine.
*/
static const result_type default_seed = 1u;
// constructors and seeding functions
/*! This constructor, which optionally accepts a seed, initializes a new
* \p linear_congruential_engine.
*
* \param s The seed used to initialize this \p linear_congruential_engine's state.
*/
_CCCL_HOST_DEVICE explicit linear_congruential_engine(result_type s = default_seed);
/*! This method initializes this \p linear_congruential_engine's state, and optionally accepts
* a seed value.
*
* \param s The seed used to initializes this \p linear_congruential_engine's state.
*/
_CCCL_HOST_DEVICE void seed(result_type s = default_seed);
// generating functions
/*! This member function produces a new random value and updates this \p linear_congruential_engine's state.
* \return A new random number.
*/
_CCCL_HOST_DEVICE result_type operator()();
/*! This member function advances this \p linear_congruential_engine's state a given number of times
* and discards the results.
*
* \param z The number of random values to discard.
* \note This function is provided because an implementation may be able to accelerate it.
*/
_CCCL_HOST_DEVICE void discard(unsigned long long z);
/*! \cond
*/
private:
result_type m_x;
static void transition(result_type& state);
friend struct thrust::random::detail::random_core_access;
friend struct thrust::random::detail::linear_congruential_engine_discard;
_CCCL_HOST_DEVICE bool equal(const linear_congruential_engine& rhs) const;
template <typename CharT, typename Traits>
std::basic_ostream<CharT, Traits>& stream_out(std::basic_ostream<CharT, Traits>& os) const;
template <typename CharT, typename Traits>
std::basic_istream<CharT, Traits>& stream_in(std::basic_istream<CharT, Traits>& is);
/*! \endcond
*/
}; // end linear_congruential_engine
/*! This function checks two \p linear_congruential_engines for equality.
* \param lhs The first \p linear_congruential_engine to test.
* \param rhs The second \p linear_congruential_engine to test.
* \return \c true if \p lhs is equal to \p rhs; \c false, otherwise.
*/
template <typename UIntType_, UIntType_ a_, UIntType_ c_, UIntType_ m_>
_CCCL_HOST_DEVICE bool operator==(const linear_congruential_engine<UIntType_, a_, c_, m_>& lhs,
const linear_congruential_engine<UIntType_, a_, c_, m_>& rhs);
/*! This function checks two \p linear_congruential_engines for inequality.
* \param lhs The first \p linear_congruential_engine to test.
* \param rhs The second \p linear_congruential_engine to test.
* \return \c true if \p lhs is not equal to \p rhs; \c false, otherwise.
*/
template <typename UIntType_, UIntType_ a_, UIntType_ c_, UIntType_ m_>
_CCCL_HOST_DEVICE bool operator!=(const linear_congruential_engine<UIntType_, a_, c_, m_>& lhs,
const linear_congruential_engine<UIntType_, a_, c_, m_>& rhs);
/*! This function streams a linear_congruential_engine to a \p std::basic_ostream.
* \param os The \p basic_ostream to stream out to.
* \param e The \p linear_congruential_engine to stream out.
* \return \p os
*/
template <typename UIntType_, UIntType_ a_, UIntType_ c_, UIntType_ m_, typename CharT, typename Traits>
std::basic_ostream<CharT, Traits>&
operator<<(std::basic_ostream<CharT, Traits>& os, const linear_congruential_engine<UIntType_, a_, c_, m_>& e);
/*! This function streams a linear_congruential_engine in from a std::basic_istream.
* \param is The \p basic_istream to stream from.
* \param e The \p linear_congruential_engine to stream in.
* \return \p is
*/
template <typename UIntType_, UIntType_ a_, UIntType_ c_, UIntType_ m_, typename CharT, typename Traits>
std::basic_istream<CharT, Traits>&
operator>>(std::basic_istream<CharT, Traits>& is, linear_congruential_engine<UIntType_, a_, c_, m_>& e);
/*! \} // random_number_engine_templates
*/
/*! \addtogroup predefined_random
* \{
*/
// XXX the type N2111 used here was uint_fast32_t
/*! \typedef minstd_rand0
* \brief A random number engine with predefined parameters which implements a version of
* the Minimal Standard random number generation algorithm.
* \note The 10000th consecutive invocation of a default-constructed object of type \p minstd_rand0
* shall produce the value \c 1043618065 .
*/
using minstd_rand0 = linear_congruential_engine<std::uint32_t, 16807, 0, 2147483647>;
/*! \typedef minstd_rand
* \brief A random number engine with predefined parameters which implements a version of
* the Minimal Standard random number generation algorithm.
* \note The 10000th consecutive invocation of a default-constructed object of type \p minstd_rand
* shall produce the value \c 399268537 .
*/
using minstd_rand = linear_congruential_engine<std::uint32_t, 48271, 0, 2147483647>;
/*! \} // predefined_random
*/
} // namespace random
// import names into thrust::
using random::linear_congruential_engine;
using random::minstd_rand;
using random::minstd_rand0;
THRUST_NAMESPACE_END
#include <thrust/random/detail/linear_congruential_engine.inl>