rand.odin 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. package rand
  2. Rand :: struct {
  3. state: u64,
  4. inc: u64,
  5. }
  6. @(private, static)
  7. _GLOBAL_SEED_DATA := 1234567890;
  8. @(private, static)
  9. global_rand := create(u64(uintptr(&_GLOBAL_SEED_DATA)));
  10. @(private, static)
  11. global_rand_ptr := &global_rand;
  12. set_global_seed :: proc(seed: u64) {
  13. init(global_rand_ptr, seed);
  14. }
  15. create :: proc(seed: u64) -> Rand {
  16. r: Rand;
  17. init(&r, seed);
  18. return r;
  19. }
  20. init :: proc(r: ^Rand, seed: u64) {
  21. r.state = 0;
  22. r.inc = (seed << 1) | 1;
  23. _random(r);
  24. r.state += seed;
  25. _random(r);
  26. }
  27. _random :: proc(r: ^Rand) -> u32 {
  28. old_state := r.state;
  29. r.state = old_state * 6364136223846793005 + (r.inc|1);
  30. xor_shifted := u32(((old_state>>18) ~ old_state) >> 27);
  31. rot := u32(old_state >> 59);
  32. return (xor_shifted >> rot) | (xor_shifted << ((-rot) & 31));
  33. }
  34. uint32 :: proc(r: ^Rand = global_rand_ptr) -> u32 { return _random(r); }
  35. uint64 :: proc(r: ^Rand = global_rand_ptr) -> u64 {
  36. a := u64(_random(r));
  37. b := u64(_random(r));
  38. return (a<<32) | b;
  39. }
  40. int31 :: proc(r: ^Rand = global_rand_ptr) -> i32 { return i32(uint32(r) << 1 >> 1); }
  41. int63 :: proc(r: ^Rand = global_rand_ptr) -> i64 { return i64(uint64(r) << 1 >> 1); }
  42. int31_max :: proc(n: i32, r: ^Rand = global_rand_ptr) -> i32 {
  43. if n <= 0 do panic("Invalid argument to int31_max");
  44. if n&(n-1) == 0 {
  45. return int31(r) & (n-1);
  46. }
  47. max := i32((1<<31) - 1 - (1<<31)&u32(n));
  48. v := int31(r);
  49. for v > max {
  50. v = int31(r);
  51. }
  52. return v % n;
  53. }
  54. int63_max :: proc(n: i64, r: ^Rand = global_rand_ptr) -> i64 {
  55. if n <= 0 do panic("Invalid argument to int63_max");
  56. if n&(n-1) == 0 {
  57. return int63(r) & (n-1);
  58. }
  59. max := i64((1<<63) - 1 - (1<<63)&u64(n));
  60. v := int63(r);
  61. for v > max {
  62. v = int63(r);
  63. }
  64. return v % n;
  65. }
  66. int_max :: proc(n: int, r: ^Rand = global_rand_ptr) -> int {
  67. if n <= 0 do panic("Invalid argument to int_max");
  68. when size_of(int) == 4 {
  69. return int(int31_max(i32(n), r));
  70. } else {
  71. return int(int63_max(i64(n), r));
  72. }
  73. }
  74. float64 :: proc(r: ^Rand = global_rand_ptr) -> f64 { return f64(int63_max(1<<53, r)) / (1 << 53); }
  75. float32 :: proc(r: ^Rand = global_rand_ptr) -> f32 { return f32(float64(r)); }
  76. float64_range :: proc(lo, hi: f64, r: ^Rand = global_rand_ptr) -> f64 { return (hi-lo)*float64(r) + lo; }
  77. float32_range :: proc(lo, hi: f32, r: ^Rand = global_rand_ptr) -> f32 { return (hi-lo)*float32(r) + lo; }
  78. read :: proc(p: []byte, r: ^Rand = global_rand_ptr) -> (n: int) {
  79. pos := i8(0);
  80. val := i64(0);
  81. for n = 0; n < len(p); n += 1 {
  82. if pos == 0 {
  83. val = int63(r);
  84. pos = 7;
  85. }
  86. p[n] = byte(val);
  87. val >>= 8;
  88. pos -= 1;
  89. }
  90. return;
  91. }
  92. // perm returns a slice of n ints in a pseudo-random permutation of integers in the range [0, n)
  93. perm :: proc(n: int, r: ^Rand = global_rand_ptr) -> []int {
  94. m := make([]int, n);
  95. for i := 0; i < n; i += 1 {
  96. j := int_max(i+1);
  97. m[i] = m[j];
  98. m[j] = i;
  99. }
  100. return m;
  101. }
  102. shuffle :: proc(array: $T/[]$E, r: ^Rand = global_rand_ptr) {
  103. n := i64(len(array));
  104. if n < 2 do return;
  105. for i := i64(0); i < n; i += 1 {
  106. j := int63_max(n, r);
  107. array[i], array[j] = array[j], array[i];
  108. }
  109. }