[−][src]Function randge::randge_tree

pub fn randge_tree<T: PrimInt + AsPrimitive<usize>>(
    range: Range<T>, 
    n: T, 
    rand: impl FnRand<T>
) -> RandgeIter<T, impl FnRand<T>, RangesTree<T>>ⓘ
Notable traits for RandgeIter<T, F, R>
impl<T, F: FnRand<T>, R: RandgeTake<T>> Iterator for RandgeIter<T, F, R> where
    T: PrimInt,     type Item = T;

Generate random numbers that are not repeated in the range

  • Using tree-based algorithm, the time complexity is O(logn)
  • Moderate memory usage

Example

use rand::thread_rng;
 
let v = randge_tree(-15..15, 5, thread_rng());
let v: Vec<_> = v.collect();
// output: like [13, -3, -14, 5, 3]