feat: 결정론적 난수 생성기 ts 버전 구현

This commit is contained in:
2022-03-12 20:31:13 +09:00
parent 11e17c4ae5
commit a2498506c3
5 changed files with 285 additions and 40 deletions
+34 -27
View File
@@ -1,41 +1,48 @@
import { RNG } from './RNG';
export class RandUtils{
constructor(protected rng: RNG){
export class RandUtil {
constructor(protected rng: RNG) {
}
public nextFloat1(): number{
public nextFloat1(): number {
return this.rng.nextFloat1();
}
public nextRange(min: number, max: number): number{
public nextRange(min: number, max: number): number {
const range = max - min;
return this.nextFloat1() * (range) + min;
}
public nextRangeInt(min: number, max: number): number{
public nextRangeInt(min: number, max: number): number {
const range = max - min;
return this.rng.nextInt(range) + min;
}
public nextBit(): boolean{
public nextInt(max?: number): number {
return this.rng.nextInt(max);
}
public nextBit(): boolean {
const view = new DataView(this.rng.nextBits(1));
return view.getUint8(0) != 0;
}
public nextBool(prob = 0.5): boolean{
public nextBool(prob = 0.5): boolean {
if (prob >= 1) {
return true;
}
return this.nextFloat1() < prob;
}
public shuffle<T>(srcArray: T[]): T[]{
public shuffle<T>(srcArray: T[]): T[] {
const cnt = srcArray.length;
if(cnt > this.rng.getMaxInt()){
if (cnt > this.rng.getMaxInt()) {
throw 'Invalid random int range';
}
const result: T[] = Array.from(srcArray);
for(let srcIdx = 0; srcIdx < cnt; srcIdx += 1){
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]];
}
@@ -45,23 +52,23 @@ export class RandUtils{
//Object는 integer key에 예외가 있어 shuffleAssoc은 없음
public choice<T>(items: T[]|Record<string|number,T>|Set<T>): T{
if(items instanceof Array){
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){
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{
public choiceUsingWeight(items: Record<string | number, number>): string | number {
let sum = 0;
for(const value of Object.values(items)){
if(value <= 0){
for (const value of Object.values(items)) {
if (value <= 0) {
continue;
}
sum += value;
@@ -69,15 +76,15 @@ export class RandUtils{
let rd = this.nextFloat1() * sum;
for(const [item, value] of Object.entries(items)){
if(value <= 0){
if(rd <= 0){
for (const [item, value] of Object.entries(items)) {
if (value <= 0) {
if (rd <= 0) {
return item;
}
continue;
}
if(rd <= value){
if (rd <= value) {
return item;
}
rd -= value;
@@ -86,10 +93,10 @@ export class RandUtils{
throw new Error('Unreacheable');
}
public choiceUsingWeightPair<T>(items: [T, number][]): T{
public choiceUsingWeightPair<T>(items: [T, number][]): T {
let sum = 0;
for(const [, value] of items){
if(value <= 0){
for (const [, value] of items) {
if (value <= 0) {
continue;
}
sum += value;
@@ -97,15 +104,15 @@ export class RandUtils{
let rd = this.nextFloat1() * sum;
for(const [item, value] of items){
if(value <= 0){
if(rd <= 0){
for (const [item, value] of items) {
if (value <= 0) {
if (rd <= 0) {
return item;
}
continue;
}
if(rd <= value){
if (rd <= value) {
return item;
}
rd -= value;