Function num::range_step_inclusive [−][src]
pub fn range_step_inclusive<A>(
start: A,
stop: A,
step: A
) -> RangeStepInclusive<A>ⓘwhereNotable traits for RangeStepInclusive<A>
impl<A> Iterator for RangeStepInclusive<A> where
A: CheckedAdd + PartialOrd<A> + Clone + PartialEq<A>, type Item = A;
A: CheckedAdd + PartialOrd<A> + Clone + Zero,
Return an iterator over the range [start, stop] by step
. It handles overflow by stopping.