Function num::range_step_inclusive

Important traits for RangeStepInclusive<A>

impl<A> Iterator for RangeStepInclusive<A> where
    A: CheckedAdd + PartialOrd<A> + Clone + PartialEq<A>,  type Item = A;

pub fn range_step_inclusive<A>(
    start: A, 
    stop: A, 
    step: A
) -> RangeStepInclusive<A> where
    A: CheckedAdd + PartialOrd<A> + Clone + Zero, 

Return an iterator over the range [start, stop] by step. It handles overflow by stopping.