1
0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
v/vlib/rand/rand.v

237 lines
6.1 KiB
V
Raw Normal View History

2020-02-03 07:00:36 +03:00
// Copyright (c) 2019-2020 Alexander Medvednikov. All rights reserved.
2019-06-23 05:21:30 +03:00
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
2019-06-22 21:20:28 +03:00
module rand
2020-06-09 16:06:07 +03:00
import rand.util
import rand.wyrand
import time
2020-06-09 16:06:07 +03:00
// Configuration struct for creating a new instance of the default RNG.
pub struct PRNGConfigStruct {
seed []u32 = util.time_seed_array(2)
2019-06-22 21:20:28 +03:00
}
2020-06-09 16:06:07 +03:00
__global default_rng &wyrand.WyRandRNG
fn init() {
default_rng = new_default({})
2019-06-22 21:20:28 +03:00
}
2020-06-09 16:06:07 +03:00
// new_default returns a new instance of the default RNG. If the seed is not provided, the current time will be used to seed the instance.
pub fn new_default(config PRNGConfigStruct) &wyrand.WyRandRNG {
2020-07-24 02:55:55 +03:00
mut rng := &wyrand.WyRandRNG{}
2020-06-09 16:06:07 +03:00
rng.seed(config.seed)
return rng
2019-09-16 22:21:21 +03:00
}
2020-06-09 16:06:07 +03:00
// seed sets the given array of `u32` values as the seed for the `default_rng`.
pub fn seed(seed []u32) {
default_rng.seed(seed)
2020-06-01 22:13:56 +03:00
}
2020-06-09 16:06:07 +03:00
// u32() returns a uniformly distributed u32 in _[0, 2<sup>32</sup>)_
pub fn u32() u32 {
return default_rng.u32()
}
// u64() returns a uniformly distributed u64 in _[0, 2<sup>64</sup>)_
pub fn u64() u64 {
return default_rng.u64()
}
// u32n(max) returns a uniformly distributed pseudorandom 32-bit signed positive u32 in _[0, max)_
pub fn u32n(max u32) u32 {
return default_rng.u32n(max)
}
// u64n(max) returns a uniformly distributed pseudorandom 64-bit signed positive u64 in _[0, max)_
pub fn u64n(max u64) u64 {
return default_rng.u64n(max)
}
// u32_in_range(min, max) returns a uniformly distributed pseudorandom 32-bit unsigned u32 in _[min, max)_
pub fn u32_in_range(min, max u32) u32 {
return default_rng.u32_in_range(min, max)
}
// u64_in_range(min, max) returns a uniformly distributed pseudorandom 64-bit unsigned u64 in _[min, max)_
pub fn u64_in_range(min, max u64) u64 {
return default_rng.u64_in_range(min, max)
}
// int() returns a uniformly distributed pseudorandom 32-bit signed (possibly negative) int
pub fn int() int {
return default_rng.int()
}
// intn(max) returns a uniformly distributed pseudorandom 32-bit signed positive int in _[0, max)_
pub fn intn(max int) int {
return default_rng.intn(max)
}
// int_in_range(min, max) returns a uniformly distributed pseudorandom
// 32-bit signed int in [min, max). Both min and max can be negative, but we must have _min < max_.
pub fn int_in_range(min, max int) int {
return default_rng.int_in_range(min, max)
}
// int31() returns a uniformly distributed pseudorandom 31-bit signed positive int
pub fn int31() int {
return default_rng.int31()
}
// i64() returns a uniformly distributed pseudorandom 64-bit signed (possibly negative) i64
pub fn i64() i64 {
return default_rng.i64()
}
// i64n(max) returns a uniformly distributed pseudorandom 64-bit signed positive i64 in _[0, max)_
pub fn i64n(max i64) i64 {
return default_rng.i64n(max)
}
// i64_in_range(min, max) returns a uniformly distributed pseudorandom 64-bit signed int in _[min, max)_
pub fn i64_in_range(min, max i64) i64 {
return default_rng.i64_in_range(min, max)
}
// int63() returns a uniformly distributed pseudorandom 63-bit signed positive int
pub fn int63() i64 {
return default_rng.int63()
2020-06-01 22:13:56 +03:00
}
2020-06-09 16:06:07 +03:00
// f32() returns a uniformly distributed 32-bit floating point in _[0, 1)_
pub fn f32() f32 {
return default_rng.f32()
}
2020-06-09 16:06:07 +03:00
// f64() returns a uniformly distributed 64-bit floating point in _[0, 1)_
pub fn f64() f64 {
return default_rng.f64()
}
2020-06-09 16:06:07 +03:00
// f32n() returns a uniformly distributed 32-bit floating point in _[0, max)_
pub fn f32n(max f32) f32 {
return default_rng.f32n(max)
}
2020-06-09 16:06:07 +03:00
// f64n() returns a uniformly distributed 64-bit floating point in _[0, max)_
pub fn f64n(max f64) f64 {
return default_rng.f64n(max)
}
2020-06-09 16:06:07 +03:00
// f32_in_range(min, max) returns a uniformly distributed 32-bit floating point in _[min, max)_
pub fn f32_in_range(min, max f32) f32 {
return default_rng.f32_in_range(min, max)
}
2020-06-09 16:06:07 +03:00
// f64_in_range(min, max) returns a uniformly distributed 64-bit floating point in _[min, max)_
pub fn f64_in_range(min, max f64) f64 {
return default_rng.f64_in_range(min, max)
2020-06-01 22:13:56 +03:00
}
2020-07-15 22:36:06 +03:00
const (
chars = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
)
pub fn string(len int) string {
mut buf := malloc(len)
2020-07-25 20:20:37 +03:00
for i in 0 .. len {
unsafe {
buf[i] = chars[intn(chars.len)]
}
2020-07-15 22:36:06 +03:00
}
return unsafe { buf.vstring_with_len(len) }
2020-07-15 22:36:06 +03:00
}
2020-07-24 13:58:30 +03:00
// rand.uuid_v4 generate a completely random UUID (v4)
// See https://en.wikipedia.org/wiki/Universally_unique_identifier#Version_4_(random)
pub fn uuid_v4() string {
buflen := 36
2020-07-24 13:58:30 +03:00
mut buf := malloc(37)
mut i_buf := 0
mut x := u64(0)
mut d := byte(0)
for i_buf < buflen {
mut c := 0
x = default_rng.u64()
// do most of the bit manipulation at once:
x &= 0x0F0F0F0F0F0F0F0F
x += 0x3030303030303030
// write the ASCII codes to the buffer:
for c < 8 && i_buf < buflen {
d = byte(x)
unsafe {
buf[i_buf] = if d > 0x39 { d + 0x27 } else { d }
}
i_buf++
c++
x = x >> 8
2020-07-24 13:58:30 +03:00
}
}
// there are still some random bits in x:
x = x >> 8
d = byte(x)
2020-07-24 13:58:30 +03:00
unsafe {
buf[19] = if d > 0x39 { d + 0x27 } else { d }
2020-07-24 13:58:30 +03:00
buf[8] = `-`
buf[13] = `-`
buf[18] = `-`
buf[23] = `-`
buf[14] = `4`
buf[buflen] = 0
2020-07-24 13:58:30 +03:00
}
return unsafe { buf.vstring_with_len(buflen) }
2020-07-24 13:58:30 +03:00
}
const(
ulid_encoding = "0123456789ABCDEFGHJKMNPQRSTVWXYZ"
)
// rand.ulid generates an Unique Lexicographically sortable IDentifier.
// See https://github.com/ulid/spec .
// NB: ULIDs can leak timing information, if you make them public, because
// you can infer the rate at which some resource is being created, like
// users or business transactions.
// (https://news.ycombinator.com/item?id=14526173)
pub fn ulid() string {
return ulid_at_millisecond(time.utc().unix_time_milli())
}
pub fn ulid_at_millisecond(unix_time_milli u64) string {
buflen := 26
mut buf := malloc(27)
mut t := unix_time_milli
mut i := 9
for i >= 0 {
unsafe{
buf[i] = ulid_encoding[t & 0x1F]
}
t = t >> 5
i--
}
// first rand set
mut x := default_rng.u64()
i = 10
for i < 19 {
unsafe{
buf[i] = ulid_encoding[x & 0x1F]
}
x = x >> 5
i++
}
// second rand set
x = default_rng.u64()
for i < 26 {
unsafe{
buf[i] = ulid_encoding[x & 0x1F]
}
x = x >> 5
i++
}
unsafe{
buf[26] = 0
}
return unsafe { buf.vstring_with_len(buflen) }
}