(
    start: Union[int, float],
    stop: Optional[Union[int, float]] = None,
    step: Union[int, float] = 1,
)
return RangeSweep(start=start, stop=stop, step=step)
Range defines a sweep over a range of integer or floating-point values.
    When only start is defined, it is set as the stop value, and start is set at
    zero.
    For a positive step, the contents of a range r are determined by the formula
     r[i] = start + step*i where i >= 0 and r[i] < stop.
    For a negative step, the contents of the range are still determined by the formula
     r[i] = start + step*i, but the constraints are i >= 0 and r[i] > stop.
Range defines a sweep over a range of integer or floating-point values.
    When only start is defined, it is set as the stop value, and start is set at
    zero.
    For a positive step, the contents of a range r are determined by the formula
     r[i] = start + step*i where i >= 0 and r[i] < stop.
    For a negative step, the contents of the range are still determined by the formula
     r[i] = start + step*i, but the constraints are i >= 0 and r[i] > stop.
Range defines a sweep over a range of integer or floating - point values . When only start is defined it is set as the stop value and start is set at zero . For a positive step the contents of a range r are determined by the formula r [ i ] = start + step * i where i > = 0 and r [ i ] < stop . For a negative step the contents of the range are still determined by the formula r [ i ] = start + step * i but the constraints are i > = 0 and r [ i ] > stop .
def range(
    start: Union[int, float],
    stop: Optional[Union[int, float]] = None,
    step: Union[int, float] = 1,
) -> RangeSweep:
    """
    Range defines a sweep over a range of integer or floating-point values.
    When only start is defined, it is set as the stop value, and start is set at
    zero.
    For a positive step, the contents of a range r are determined by the formula
     r[i] = start + step*i where i >= 0 and r[i] < stop.
    For a negative step, the contents of the range are still determined by the formula
     r[i] = start + step*i, but the constraints are i >= 0 and r[i] > stop.
    """
    if stop is None:
        stop = start
        start = 0
    return RangeSweep(start=start, stop=stop, step=step)
def range ( start : Union [ int , float ] , stop : Optional [ Union [ int , float ] ] = None , step : Union [ int , float ] = 1 , ) -> RangeSweep : if stop is None : stop = start start = 0 return RangeSweep ( start = start , stop = stop , step = step )