Jamie Reece Wilson
8c101cea6f
[+] IRandomDevice::ShuffleList [+] AuRNG::RngShuffleIterators [+] AuRNG::RngShuffleList
161 lines
4.8 KiB
C++
161 lines
4.8 KiB
C++
/***
|
|
Copyright (C) 2021 J Reece Wilson (a/k/a "Reece"). All rights reserved.
|
|
|
|
File: RNG.hpp
|
|
Date: 2021-7-14
|
|
Author: Reece
|
|
***/
|
|
#pragma once
|
|
|
|
#include "ERngStringCharacters.hpp"
|
|
#include "RandomDef.hpp"
|
|
#include "IRandomDevice.hpp"
|
|
|
|
namespace Aurora::RNG
|
|
{
|
|
AUKN_SYM void ReadSecureRNG(Memory::MemoryViewWrite writeView);
|
|
AUKN_SYM void ReadFastRNG (Memory::MemoryViewWrite writeView);
|
|
|
|
AUKN_SYM AuString ReadString(AuUInt32 uLength, ERngStringCharacters type = ERngStringCharacters::eAlphaCharacters);
|
|
AUKN_SYM void RngString(char *pString, AuUInt32 uLength, ERngStringCharacters type = ERngStringCharacters::eAlphaCharacters);
|
|
|
|
AUKN_SYM AuUInt8 RngByte();
|
|
AUKN_SYM bool RngBoolean();
|
|
AUKN_SYM AuUInt32 RngU32();
|
|
AUKN_SYM AuUInt32 RngU32Range(AuUInt32 uMin, AuUInt32 uMax);
|
|
AUKN_SYM AuUInt64 RngU64();
|
|
AUKN_SYM AuInt32 RngI32Range(AuInt32 iMin, AuInt32 iMax);
|
|
AUKN_SYM double RngDecimal();
|
|
AUKN_SYM double RngNumber(double dMin, double dMax);
|
|
AUKN_SYM AuUInt32 RngIndex(AuUInt32 uCount /* = max + 1*/);
|
|
AUKN_SYM uuids::uuid RngUUID();
|
|
AUKN_SYM AuList<AuInt32> RngArrayI32Range(AuUInt32 uCount, AuInt32 iMin, AuInt32 iMax);
|
|
AUKN_SYM AuList<AuUInt32> RngArrayU32Range(AuUInt32 uCount, AuUInt32 uMin, AuUInt32 uMax);
|
|
AUKN_SYM AuList<double> RngArrayDoubleRange(AuUInt32 uCount, double dMin, double dMax);
|
|
AUKN_SYM AuList<AuInt32> RngArrayI32(AuUInt32 uCount);
|
|
AUKN_SYM AuList<AuUInt32> RngArrayU32(AuUInt32 uCount);
|
|
AUKN_SYM AuList<double> RngArrayDouble(AuUInt32 uCount);
|
|
AUKN_SYM AuList<double> RngArrayDecimals(AuUInt32 uCount);
|
|
AUKN_SYM AuList<uuids::uuid> RngArrayUUIDs(AuUInt32 uCount);
|
|
// Note: it is conceivable that someone may want the following templates for some cryptographic purpose
|
|
|
|
template<bool fast = true, typename T, int N>
|
|
static auline void RngFillArray(T(&array)[N])
|
|
{
|
|
if constexpr (fast)
|
|
{
|
|
ReadFastRNG(Memory::MemoryViewWrite(array));
|
|
}
|
|
else
|
|
{
|
|
ReadSecureRNG(Memory::MemoryViewWrite(array));
|
|
}
|
|
}
|
|
|
|
template<bool fast = true, typename T>
|
|
static auline void RngFillArray(T *array, AuUInt32 uCount)
|
|
{
|
|
if constexpr (fast)
|
|
{
|
|
ReadFastRNG(Memory::MemoryViewWrite(array, uCount * sizeof(T)));
|
|
}
|
|
else
|
|
{
|
|
ReadSecureRNG(Memory::MemoryViewWrite(array, uCount * sizeof(T)));
|
|
}
|
|
}
|
|
|
|
template<bool fast = true, typename T>
|
|
static auline void RngFillRange(T &container)
|
|
{
|
|
RngFillArray<fast>(container.begin(), container.end() - container.begin());
|
|
}
|
|
|
|
static auline void RngFillBuffer(Memory::ByteBuffer &buffer)
|
|
{
|
|
auto view = buffer.GetNextLinearWrite();
|
|
RngFillRange(view);
|
|
buffer.writePtr += view.length;
|
|
}
|
|
|
|
/**
|
|
* @brief
|
|
* @deprecated
|
|
*/
|
|
static auline void RngFillRange(Memory::ByteBuffer &buffer)
|
|
{
|
|
RngFillBuffer(buffer);
|
|
}
|
|
|
|
template<bool fast = true, typename T>
|
|
static auline T RngTmpl()
|
|
{
|
|
T ret {};
|
|
if constexpr (fast)
|
|
{
|
|
ReadFastRNG(Memory::MemoryViewWrite(&ret, sizeof(T)));
|
|
}
|
|
else
|
|
{
|
|
ReadSecureRNG(Memory::MemoryViewWrite(&ret, sizeof(T)));
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
template<typename T>
|
|
static auline T &RngArray(T *pItems, AuUInt32 uCount)
|
|
{
|
|
return pItems[RngIndex(uCount)];
|
|
}
|
|
|
|
template<typename T>
|
|
inline T RngIterator(T begin, T end)
|
|
{
|
|
auto nextItr = begin;
|
|
auto uCount = std::distance(begin, end);
|
|
std::advance(nextItr, RngIndex(uCount));
|
|
return nextItr;
|
|
}
|
|
|
|
template<typename T>
|
|
static auline auto RngRange(T &items)
|
|
{
|
|
return RngIterator(std::begin(items), std::end(items));
|
|
}
|
|
|
|
template<typename T>
|
|
static auline T &RngList(AuList<T> &items)
|
|
{
|
|
return *RngRange(items);
|
|
}
|
|
|
|
template<typename T>
|
|
static auline const T &RngList(const AuList<T> &items)
|
|
{
|
|
return *RngRange(items);
|
|
}
|
|
|
|
template<typename T>
|
|
inline void RngShuffleIterators(T begin, T end)
|
|
{
|
|
AU_DEBUG_MEMCRUNCH;
|
|
|
|
auto uCount = std::distance(begin, end);
|
|
auto nextIndexArray = RngArrayU32Range(uCount, 0, uCount - 1);
|
|
|
|
for (AU_ITERATE_N(i, AuUInt(uCount)))
|
|
{
|
|
auto nextItrA = begin;
|
|
auto nextItrB = begin;
|
|
std::advance(nextItrA, i);
|
|
std::advance(nextItrB, nextIndexArray[i]);
|
|
AuSwap(*nextItrA, *nextItrB);
|
|
}
|
|
}
|
|
|
|
template<typename T>
|
|
inline void RngShuffleList(AuList<T> &list)
|
|
{
|
|
RngShuffleIterators(list.begin(), list.end());
|
|
}
|
|
} |