random.h

Go to the documentation of this file.

 
/*
Copyright (c) 2026 MrXie1109
 
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
 
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
 
#pragma once
#include <chrono>
#include <cstdint>
#include <initializer_list>
#include <numeric>
#include <random>
#include <utility>
 
#include "../core/csexc.h"
#include "../core/sfinae.h"
 
namespace console {

    inline std::mt19937 &thread_rng() {
        thread_local std::mt19937 gen(std::chrono::high_resolution_clock::now()
                .time_since_epoch()
                .count());
        return gen;
    }

    template <class T>
    inline void seed(T seed) {
        thread_rng().seed(seed);
    }

    template <class T = int>
    T randint(T min = 0, T max = 32767, std::mt19937 &gen = thread_rng()) {
        return std::uniform_int_distribution<T>(min, max)(gen);
    }

    template <class T = double>
    T uniform(T min = 0.0, T max = 1.0, std::mt19937 &gen = thread_rng()) {
        return std::uniform_real_distribution<T>(min, max)(gen);
    }

    inline bool randbool(double p = 0.5, std::mt19937 &gen = thread_rng()) {
        return std::bernoulli_distribution(p)(gen);
    }

    template <class C>
    auto
    choice(C &c, std::mt19937 &gen = thread_rng()) -> decltype(*std::begin(c)) {
        if (std::begin(c) == std::end(c))
            throw ContainerError("Empty container");
        return *std::next(std::begin(c), randint<size_t>(0, c.size() - 1, gen));
    }

    template <class C>
    auto choice(const C &c, std::mt19937 &gen = thread_rng())
        -> decltype(*std::begin(c)) {
        if (std::begin(c) == std::end(c))
            throw ContainerError("Empty container");
        return *std::next(std::begin(c), randint<size_t>(0, c.size() - 1, gen));
    }

    template <class C>
    auto choice(C &&c, std::mt19937 &gen = thread_rng())
        -> decltype(*std::begin(c)) {
        if (std::begin(c) == std::end(c))
            throw ContainerError("Empty container");
        return *std::next(std::begin(c), randint<size_t>(0, c.size() - 1, gen));
    }

    template <class T>
    T choice(std::initializer_list<T> init, std::mt19937 &gen = thread_rng()) {
        return choice<std::initializer_list<T>>(init, gen);
    }

    template <class C>
    void shuffle(C &&c, std::mt19937 &gen = thread_rng()) {
        if (std::begin(c) == std::end(c)) return;
        for (size_t i = c.size() - 1; i > 0; i--) {
            auto j = randint<size_t>(0, i, gen);
            std::swap(
                *std::next(std::begin(c), i), *std::next(std::begin(c), j));
        }
    }

    template <class T = double>
    std::vector<T> rnorm(
        size_t n, T mean = 0.0, T sd = 1.0, std::mt19937 &gen = thread_rng()) {
        std::vector<T>              vec(n);
        std::normal_distribution<T> dist(mean, sd);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = double>
    std::vector<T> runif(
        size_t n, T min = 0.0, T max = 1.0, std::mt19937 &gen = thread_rng()) {
        std::vector<T>            vec(n);
        uniform_distribution_t<T> dist(min, max);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = int>
    std::vector<T>
    rbinom(size_t n, T size, double prob, std::mt19937 &gen = thread_rng()) {
        std::vector<T>                vec(n);
        std::binomial_distribution<T> dist(size, prob);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = int>
    std::vector<T>
    rpois(size_t n, double lambda, std::mt19937 &gen = thread_rng()) {
        std::vector<T>               vec(n);
        std::poisson_distribution<T> dist(lambda);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = double>
    std::vector<T>
    rexp(size_t n, T rate = 1.0, std::mt19937 &gen = thread_rng()) {
        std::vector<T>                   vec(n);
        std::exponential_distribution<T> dist(rate);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = double>
    std::vector<T>
    rgamma(size_t n, T shape, T rate = 1.0, std::mt19937 &gen = thread_rng()) {
        std::vector<T>             vec(n);
        std::gamma_distribution<T> dist(shape, 1.0 / rate);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

 
    template <class T = double>
    std::vector<T>
    rbeta(size_t n, T shape1, T shape2, std::mt19937 &gen = thread_rng()) {
        std::vector<T>             vec(n);
        std::gamma_distribution<T> dist_a(shape1, 1.0);
        std::gamma_distribution<T> dist_b(shape2, 1.0);
        for (T &t : vec) {
            T x = dist_a(gen);
            T y = dist_b(gen);
            t   = x / (x + y);
        }
        return vec;
    }

    template <class T = double>
    std::vector<T> rchisq(size_t n, T df, std::mt19937 &gen = thread_rng()) {
        return rgamma(n, df / 2.0, 0.5, gen);
    }

    template <class T = double>
    std::vector<T> rt(size_t n, T df, std::mt19937 &gen = thread_rng()) {
        std::vector<T>                 vec(n);
        std::student_t_distribution<T> dist(df);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = double>
    std::vector<T>
    rf(size_t n, T df1, T df2, std::mt19937 &gen = thread_rng()) {
        std::vector<T>                vec(n);
        std::fisher_f_distribution<T> dist(df1, df2);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = double>
    std::vector<T> rlnorm(size_t n,
        T                        meanlog = 0.0,
        T                        sdlog   = 1.0,
        std::mt19937            &gen     = thread_rng()) {
        std::vector<T>                 vec(n);
        std::lognormal_distribution<T> dist(meanlog, sdlog);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class T = double>
    std::vector<T> rweibull(
        size_t n, T shape, T scale = 1.0, std::mt19937 &gen = thread_rng()) {
        std::vector<T>               vec(n);
        std::weibull_distribution<T> dist(shape, scale);
        for (T &t : vec) t = dist(gen);
        return vec;
    }

    template <class C>
    std::vector<typename C::value_type> sample(const C &c,
        size_t                                          size,
        bool                                            replace = false,
        std::mt19937                                   &gen = thread_rng()) {
        using value_type = typename C::value_type;
        std::vector<value_type> result;
        result.reserve(size);
        auto   it_begin = std::begin(c);
        auto   it_end   = std::end(c);
        size_t n        = std::distance(it_begin, it_end);
        if (n == 0) throw ContainerError("Cannot sample from empty container");
        if (!replace && size > n)
            throw ContainerError(
                "Sample size exceeds container size when replace=false");
        if (replace)
            for (size_t i = 0; i < size; ++i) {
                result.push_back(*std::next(it_begin,
                    std::uniform_int_distribution<size_t>(0, n - 1)(gen)));
            }
        else {
            std::vector<size_t> indices(n);
            std::iota(indices.begin(), indices.end(), 0);
            shuffle(indices, gen);
            for (size_t i = 0; i < size; ++i)
                result.push_back(*std::next(it_begin, indices[i]));
        }
        return result;
    }

    template <class T>
    std::vector<T> sample(std::initializer_list<T> init,
        size_t                                     size,
        bool                                       replace = false,
        std::mt19937                              &gen     = thread_rng()) {
        return sample<std::initializer_list<T>>(init, size, replace, gen);
    }
 // end of random group
}