feat(inprogress): 특정 시드값을 기반으로 하는 결정론적 난수 생성기

This commit is contained in:
2022-03-12 20:31:13 +09:00
parent b19bd263a7
commit 11e17c4ae5
5 changed files with 504 additions and 0 deletions
+13
View File
@@ -0,0 +1,13 @@
export interface RNG {
/**
* nextInt()가 반환 가능한 최대값
*/
getMaxInt(): number;
nextBytes(bytes: number): ArrayBuffer;
nextBits(bits: number): ArrayBuffer;
nextInt(max?: number): number;
nextFloat1(): number;
}
+116
View File
@@ -0,0 +1,116 @@
import { RNG } from './RNG';
export class RandUtils{
constructor(protected rng: RNG){
}
public nextFloat1(): number{
return this.rng.nextFloat1();
}
public nextRange(min: number, max: number): number{
const range = max - min;
return this.nextFloat1() * (range) + min;
}
public nextRangeInt(min: number, max: number): number{
const range = max - min;
return this.rng.nextInt(range) + min;
}
public nextBit(): boolean{
const view = new DataView(this.rng.nextBits(1));
return view.getUint8(0) != 0;
}
public nextBool(prob = 0.5): boolean{
return this.nextFloat1() < prob;
}
public shuffle<T>(srcArray: T[]): T[]{
const cnt = srcArray.length;
if(cnt > this.rng.getMaxInt()){
throw 'Invalid random int range';
}
const result: T[] = Array.from(srcArray);
for(let srcIdx = 0; srcIdx < cnt; srcIdx += 1){
const destIdx = this.rng.nextInt(cnt - srcIdx - 1) + srcIdx;
[result[srcIdx], result[destIdx]] = [result[destIdx], result[srcIdx]];
}
return result;
}
//Object는 integer key에 예외가 있어 shuffleAssoc은 없음
public choice<T>(items: T[]|Record<string|number,T>|Set<T>): T{
if(items instanceof Array){
const idx = this.rng.nextInt(items.length - 1);
return items[idx];
}
if(items instanceof Set){
return this.choice(Array.from(items.values()));
}
return items[this.choice(Array.from(Object.keys(items)))];
}
public choiceUsingWeight(items: Record<string|number, number>): string|number{
let sum = 0;
for(const value of Object.values(items)){
if(value <= 0){
continue;
}
sum += value;
}
let rd = this.nextFloat1() * sum;
for(const [item, value] of Object.entries(items)){
if(value <= 0){
if(rd <= 0){
return item;
}
continue;
}
if(rd <= value){
return item;
}
rd -= value;
}
throw new Error('Unreacheable');
}
public choiceUsingWeightPair<T>(items: [T, number][]): T{
let sum = 0;
for(const [, value] of items){
if(value <= 0){
continue;
}
sum += value;
}
let rd = this.nextFloat1() * sum;
for(const [item, value] of items){
if(value <= 0){
if(rd <= 0){
return item;
}
continue;
}
if(rd <= value){
return item;
}
rd -= value;
}
throw new Error('Unreacheable');
}
}