Using /dev/random may require waiting for the result as it uses so-called entropy pool, where random data may not be available at the moment. /dev/urandom returns as many bytes as user requested and thus it is less random than /dev/random. As can be read from the man page: random When read, the /dev/random device will … Read more
Use function Intn from rand package to select a random index. import ( “math/rand” “time” ) // … rand.Seed(time.Now().Unix()) // initialize global pseudo random generator message := fmt.Sprint(“Gonna work from home…”, reasons[rand.Intn(len(reasons))]) Other solution is to use Rand object. s := rand.NewSource(time.Now().Unix()) r := rand.New(s) // initialize local pseudorandom generator r.Intn(len(reasons))
You can call Erlang’s rand module from Elixir code seamlessly. random_number = :rand.uniform(n) Will give a random number from 1 <= x <= n
Java doubles are in IEEE-754 format, therefore they have a 52-bit fraction; between any two adjacent powers of two (inclusive of one and exclusive of the next one), there will therefore be 2 to the 52th power different doubles (i.e., 4503599627370496 of them). For example, that’s the number of distinct doubles between 0.5 included and … Read more
numpy.random.Generator.choice offers a replace argument to sample without replacement: from numpy.random import default_rng rng = default_rng() numbers = rng.choice(20, size=10, replace=False) If you’re on a pre-1.17 NumPy, without the Generator API, you can use random.sample() from the standard library: print(random.sample(range(20), 10)) You can also use numpy.random.shuffle() and slicing, but this will be less efficient: a … Read more
Probability of just two hashes accidentally colliding is 1/2128 which is 1 in 340 undecillion 282 decillion 366 nonillion 920 octillion 938 septillion 463 sextillion 463 quintillion 374 quadrillion 607 trillion 431 billion 768 million 211 thousand 456. However if you keep all the hashes then the probability is a bit higher thanks to birthday … Read more
For very simple pseudorandom-looking stuff, I use this oneliner that I found on the internet somewhere: float rand(vec2 co){ return fract(sin(dot(co, vec2(12.9898, 78.233))) * 43758.5453); } You can also generate a noise texture using whatever PRNG you like, then upload this in the normal fashion and sample the values in your shader; I can dig … Read more
Each time you set the same seed, you get the same sequence. So of course if you’re setting the seed to the time in a fast loop, you’ll probably call it with the same seed many times. In your case, as you’re calling your randInt function until you have a different value, you’re waiting for … Read more
My suggestion would be an extension function on IntRange to create randoms like this: (0..10).random() TL;DR Kotlin >= 1.3, one Random for all platforms As of 1.3, Kotlin comes with its own multi-platform Random generator. It is described in this KEEP. The extension described below is now part of the Kotlin standard library, simply use … Read more
Use Random class from dart:math: import ‘dart:math’; main() { var rng = Random(); for (var i = 0; i < 10; i++) { print(rng.nextInt(100)); } } This code was tested with the Dart VM and dart2js, as of the time of this writing.