2019-06-23 04:21:30 +02:00
|
|
|
// Copyright (c) 2019 Alexander Medvednikov. All rights reserved.
|
|
|
|
// Use of this source code is governed by an MIT license
|
|
|
|
// that can be found in the LICENSE file.
|
|
|
|
|
2019-06-22 20:20:28 +02:00
|
|
|
module rand
|
|
|
|
|
2019-07-13 18:17:45 +02:00
|
|
|
pub fn seed(s int) {
|
|
|
|
C.srand(s)
|
2019-06-22 20:20:28 +02:00
|
|
|
}
|
|
|
|
|
2019-06-26 12:56:49 +02:00
|
|
|
pub fn next(max int) int {
|
2019-06-27 19:02:47 +02:00
|
|
|
return C.rand() % max
|
2019-06-22 20:20:28 +02:00
|
|
|
}
|
|
|
|
|
2019-09-16 21:21:21 +02:00
|
|
|
fn C.rand() int
|
|
|
|
|
|
|
|
/**
|
|
|
|
* rand_r - reentrant pseudo-random number generator
|
|
|
|
*
|
|
|
|
* @param seed byref reentrant seed, holding current state
|
|
|
|
*
|
|
|
|
* @return a value between 0 and C.RAND_MAX (inclusive)
|
|
|
|
*/
|
|
|
|
pub fn rand_r(seed &int) int {
|
|
|
|
mut rs := seed
|
|
|
|
ns := ( *rs * 1103515245 + 12345 )
|
|
|
|
*rs = ns
|
|
|
|
return ns & 0x7fffffff
|
|
|
|
}
|