snarkvm_console_types_integers/random.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
// Copyright 2024 Aleo Network Foundation
// This file is part of the snarkVM library.
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at:
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
use super::*;
impl<E: Environment, I: IntegerType> Distribution<Integer<E, I>> for Standard {
#[inline]
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> Integer<E, I> {
Integer::new(Uniform::rand(rng))
}
}
#[cfg(test)]
mod tests {
use super::*;
use snarkvm_console_network_environment::Console;
use std::collections::HashSet;
type CurrentEnvironment = Console;
const ITERATIONS: usize = 10;
fn check_random<I: IntegerType>(rng: &mut TestRng) {
// Initialize a set to store all seen random elements.
let mut set = HashSet::with_capacity(ITERATIONS);
// Note: This test technically has a `(1 + 2 + ... + ITERATIONS) / MODULUS` probability of being flaky.
for _ in 0..ITERATIONS {
// Sample a random value.
let integer: Integer<CurrentEnvironment, I> = Uniform::rand(rng);
assert!(!set.contains(&integer));
// Add the new random value to the set.
set.insert(integer);
}
}
#[test]
fn test_random() {
let mut rng = TestRng::default();
check_random::<u32>(&mut rng);
check_random::<u64>(&mut rng);
check_random::<u128>(&mut rng);
check_random::<i32>(&mut rng);
check_random::<i64>(&mut rng);
check_random::<i128>(&mut rng);
}
}