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
// Copyright (C) 2019-2023 Aleo Systems Inc.
// This file is part of the snarkVM library.
// The snarkVM library is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// The snarkVM library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with the snarkVM library. If not, see <https://www.gnu.org/licenses/>.
use super::*;
impl<E: Environment> Distribution<StringType<E>> for Standard {
#[inline]
fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> StringType<E> {
// Sample a random number up to 1/4th of the maximum bytes.
let num_bytes = rng.gen_range(1..(E::MAX_STRING_BYTES / 4) as usize);
// Sample a random string.
StringType::new(&rng.sample_iter(&Alphanumeric).take(num_bytes).map(char::from).collect::<String>())
}
}
#[cfg(test)]
mod tests {
use super::*;
use snarkvm_console_network_environment::Console;
use std::collections::HashSet;
type CurrentEnvironment = Console;
const ITERATIONS: usize = 100;
#[test]
fn test_random() {
// Initialize a set to store all seen random elements.
let mut set = HashSet::with_capacity(ITERATIONS);
let mut rng = TestRng::default();
// Note: This test technically has a `(1 + 2 + ... + ITERATIONS) / MODULUS` probability of being flaky.
for _ in 0..ITERATIONS {
// Sample a random value.
let string: StringType<CurrentEnvironment> = Uniform::rand(&mut rng);
assert!(!set.contains(&string), "{}", string);
// Add the new random value to the set.
set.insert(string);
}
}
}