Function beetle_collatz::steps_range::alpha

pub fn alpha<T: Collatz>(
    start: NonZeroUnchecked<T>,
    stop: NonZeroUnchecked<T>
) -> impl Iterator<Item = u32>

Maps each number N in the range nums to its steps to reach 1 using steps::basic. Performance should be pretty good, but consider using steps_range::omega for better performance.