pub struct Range<X> { /* private fields */ }
Expand description
Sample values uniformly between two bounds.
This gives a uniform distribution (assuming the RNG used to sample
it is itself uniform & the SampleRange
implementation for the
given type is correct), even for edge cases like low = 0u8
,
high = 170u8
, for which a naive modulo operation would return
numbers less than 85 with double the probability to those greater
than 85.
Types should attempt to sample in [low, high)
, i.e., not
including high
, but this may be very difficult. All the
primitive integer types satisfy this property, and the float types
normally satisfy it, but rounding may mean high
can occur.
Example
use sgx_rand::distributions::{IndependentSample, Range};
fn main() {
let between = Range::new(10, 10000);
let mut rng = sgx_rand::thread_rng();
let mut sum = 0;
for _ in 0..1000 {
sum += between.ind_sample(&mut rng);
}
println!("{}", sum);
}
Implementations
sourceimpl<X: SampleRange + PartialOrd> Range<X>
impl<X: SampleRange + PartialOrd> Range<X>
Trait Implementations
sourceimpl<Sup: SampleRange> IndependentSample<Sup> for Range<Sup>
impl<Sup: SampleRange> IndependentSample<Sup> for Range<Sup>
sourcefn ind_sample<R: Rng>(&self, rng: &mut R) -> Sup
fn ind_sample<R: Rng>(&self, rng: &mut R) -> Sup
Generate a random value.
sourceimpl<Sup: SampleRange> Sample<Sup> for Range<Sup>
impl<Sup: SampleRange> Sample<Sup> for Range<Sup>
impl<X: Copy> Copy for Range<X>
Auto Trait Implementations
impl<X> RefUnwindSafe for Range<X>where
X: RefUnwindSafe,
impl<X> Send for Range<X>where
X: Send,
impl<X> Sync for Range<X>where
X: Sync,
impl<X> Unpin for Range<X>where
X: Unpin,
impl<X> UnwindSafe for Range<X>where
X: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more