Skip to content

Commit

Permalink
implement RandomSeedSequence
Browse files Browse the repository at this point in the history
  • Loading branch information
@andiwand
andiwand committed Nov 14, 2024
1 parent 9c81494 commit 08aece0
Show file tree
Hide file tree
Showing 2 changed files with 229 additions and 142 deletions.
188 changes: 46 additions & 142 deletions Examples/Framework/include/ActsExamples/Framework/RandomNumbers.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,8 @@

#include <cstdint>
#include <random>
#include <type_traits>

#include <boost/container/small_vector.hpp>

namespace ActsExamples {
struct AlgorithmContext;
Expand All @@ -21,6 +22,44 @@ using RandomEngine = std::mt19937; ///< Mersenne Twister
/// The seed type used in the framework.
using RandomSeed = std::uint32_t;

class RandomSeedSequence {
public:
using result_type = std::uint_least32_t;
static constexpr std::size_t N = 4;
using container_type = boost::container::small_vector<result_type, N>;

RandomSeedSequence();
explicit RandomSeedSequence(RandomSeed seed);
template <typename InputIterator>
RandomSeedSequence(InputIterator first, InputIterator last)
: m_seed(first, last) {}
template <typename InputRange>
RandomSeedSequence(const InputRange& range)
: m_seed(range.begin(), range.end()) {}
RandomSeedSequence(std::initializer_list<result_type> il)
: m_seed(il.begin(), il.end()) {}

std::size_t size() const;

container_type generate(std::size_t size) const;

template <typename OutputIterator>
void generate(OutputIterator first, OutputIterator last) const {
container_type result = generate(static_cast<std::size_t>(last - first));
std::copy(result.begin(), result.end(), first);
}

template <typename OutputIterator>
void param(OutputIterator first) const {
std::copy(m_seed.begin(), m_seed.end(), first);
}

RandomSeedSequence append(RandomSeed seed) const;

private:
container_type m_seed;
};

/// Provide event and algorithm specific random number generator.s
///
/// This provides local random number generators, allowing for
Expand All @@ -40,6 +79,12 @@ class RandomNumbers {

explicit RandomNumbers(const Config& cfg);

RandomSeedSequence createEventAlgorithmSeedSequence(
const AlgorithmContext& context) const;

RandomEngine createEventAlgorithmEngine(
const AlgorithmContext& context) const;

/// Spawn an algorithm-local random number generator. To avoid inefficiencies
/// and multiple uses of a given RNG seed, this should only be done once per
/// Algorithm invocation, after what the generator object should be reused.
Expand All @@ -59,145 +104,4 @@ class RandomNumbers {
Config m_cfg;
};

/// Distribute entropy from a sequence of input values to a sequence of output
/// values.
///
/// This function is copied from std::seed_seq::generate() and modified to avoid
/// the intermediate std::vector.
///
/// @tparam InputIteratorBegin is the type of the input iterator begin
/// @tparam InputIteratorEnd is the type of the input iterator end
/// @tparam OutputIteratorBegin is the type of the output iterator begin
/// @tparam OutputIteratorEnd is the type of the output iterator end
///
/// @param inputIteratorBegin is the begin of the input sequence
/// @param inputIteratorEnd is the end of the input sequence
/// @param outputIteratorBegin is the begin of the output sequence
/// @param outputIteratorEnd is the end of the output sequence
template <typename InputIteratorBegin, typename InputIteratorEnd,
typename OutputIteratorBegin, typename OutputIteratorEnd>
void distributeEntropy(InputIteratorBegin inputIteratorBegin,
InputIteratorEnd inputIteratorEnd,
OutputIteratorBegin outputIteratorBegin,
OutputIteratorEnd outputIteratorEnd)
requires((std::input_iterator<InputIteratorBegin> &&
std::random_access_iterator<InputIteratorBegin> &&
std::is_assignable_v<std::uint_least32_t,
decltype(*inputIteratorBegin)>) &&
(std::input_iterator<InputIteratorEnd> &&
std::random_access_iterator<InputIteratorEnd> &&
std::is_assignable_v<std::uint_least32_t,
decltype(*inputIteratorEnd)>) &&
(std::output_iterator<OutputIteratorBegin, std::uint_least32_t> &&
std::random_access_iterator<OutputIteratorBegin>) &&
(std::output_iterator<OutputIteratorEnd, std::uint_least32_t> &&
std::random_access_iterator<OutputIteratorEnd>))
{
using result_type = std::uint_least32_t;

if (inputIteratorBegin == inputIteratorEnd) {
return;
}
if (outputIteratorBegin == outputIteratorEnd) {
throw std::invalid_argument("outputIteratorBegin == outputIteratorEnd");
}

const auto __v_ = inputIteratorBegin;
const auto __v_size =
static_cast<std::size_t>(inputIteratorEnd - inputIteratorBegin);
const auto __first = outputIteratorBegin;
const auto __last = outputIteratorEnd;

std::fill(__first, __last, 0x8b8b8b8b);
const std::size_t __n = static_cast<std::size_t>(__last - __first);
const std::size_t __s = __v_size;
const std::size_t __t = (__n >= 623) ? 11
: (__n >= 68) ? 7
: (__n >= 39) ? 5
: (__n >= 7) ? 3
: (__n - 1) / 2;
const std::size_t __p = (__n - __t) / 2;
const std::size_t __q = __p + __t;
const std::size_t __m = std::max(__s + 1, __n);
// __k = 0;
{
result_type __r =
1664525 * _Tp(__first[0] ^ __first[__p] ^ __first[__n - 1]);
__first[__p] += __r;
__r += __s;
__first[__q] += __r;
__first[0] = __r;
}
// Initialize indexing terms used with if statements as an optimization to
// avoid calculating modulo n on every loop iteration for each term.
std::size_t __kmodn = 0; // __k % __n
std::size_t __k1modn = __n - 1; // (__k - 1) % __n
std::size_t __kpmodn = __p % __n; // (__k + __p) % __n
std::size_t __kqmodn = __q % __n; // (__k + __q) % __n

for (std::size_t __k = 1; __k <= __s; ++__k) {
if (++__kmodn == __n) {
__kmodn = 0;
}
if (++__k1modn == __n) {
__k1modn = 0;
}
if (++__kpmodn == __n) {
__kpmodn = 0;
}
if (++__kqmodn == __n) {
__kqmodn = 0;
}

result_type __r =
1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]);
__first[__kpmodn] += __r;
__r += __kmodn + __v_[__k - 1];
__first[__kqmodn] += __r;
__first[__kmodn] = __r;
}
for (std::size_t __k = __s + 1; __k < __m; ++__k) {
if (++__kmodn == __n) {
__kmodn = 0;
}
if (++__k1modn == __n) {
__k1modn = 0;
}
if (++__kpmodn == __n) {
__kpmodn = 0;
}
if (++__kqmodn == __n) {
__kqmodn = 0;
}

result_type __r =
1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]);
__first[__kpmodn] += __r;
__r += __kmodn;
__first[__kqmodn] += __r;
__first[__kmodn] = __r;
}
for (std::size_t __k = __m; __k < __m + __n; ++__k) {
if (++__kmodn == __n) {
__kmodn = 0;
}
if (++__k1modn == __n) {
__k1modn = 0;
}
if (++__kpmodn == __n) {
__kpmodn = 0;
}
if (++__kqmodn == __n) {
__kqmodn = 0;
}

result_type __r = 1566083941 * _Tp(__first[__kmodn] + __first[__kpmodn] +
__first[__k1modn]);
__first[__kpmodn] ^= __r;
__r -= __kmodn;
__first[__kqmodn] ^= __r;
__first[__kmodn] = __r;
}
}

} // namespace ActsExamples
Loading

0 comments on commit 08aece0

Please sign in to comment.