kerncraft/kerncraft.py
def space(start, stop, num, endpoint=True, log=False, base=10):
    """
    Return list of evenly spaced integers over an interval.

    Numbers can either be evenly distributed in a linear space (if *log* is False) or in a log
    space (if *log* is True). If *log* is True, base is used to define the log space basis.

    If *endpoint* is True, *stop* will be the last retruned value, as long as *num* >= 2.
    """
    assert type(start) is int and type(stop) is int and type(num) is int, \
        "start, stop and num need to be intergers"
    assert num >= 2, "num has to be atleast 2"

    if log:
        start = math.log(start, base)
        stop = math.log(stop, base)

    if endpoint:
        step_length = float((stop - start)) / float(num - 1)
    else:
        step_length = float((stop - start)) / float(num)

    i = 0
    while i < num:
        if log:
            yield int(round(base ** (start + i * step_length)))
        else:
            yield int(round(start + i * step_length))
        i += 1
def space(start, stop, num, endpoint=True, log=False, base=10):
    assert type(start) is int and type(stop) is int and type(num) is int, \
        "start, stop and num need to be intergers"
    assert num >= 2, "num has to be atleast 2"

    if log:
        start = math.log(start, base)
        stop = math.log(stop, base)

    if endpoint:
        step_length = float((stop - start)) / float(num - 1)
    else:
        step_length = float((stop - start)) / float(num)

    i = 0
    while i < num:
        if log:
            yield int(round(base ** (start + i * step_length)))
        else:
            yield int(round(start + i * step_length))
        i += 1
def space ( start , stop , num , endpoint = True , log = False , base = 10 ) : assert type ( start ) is int and type ( stop ) is int and type ( num ) is int , "start, stop and num need to be intergers" assert num >= 2 , "num has to be atleast 2" if log : start = math . log ( start , base ) stop = math . log ( stop , base ) if endpoint : step_length = float ( ( stop - start ) ) / float ( num - 1 ) else : step_length = float ( ( stop - start ) ) / float ( num ) i = 0 while i < num : if log : yield int ( round ( base ** ( start + i * step_length ) ) ) else : yield int ( round ( start + i * step_length ) ) i += 1
Return list of evenly spaced integers over an interval.

    Numbers can either be evenly distributed in a linear space (if *log* is False) or in a log
    space (if *log* is True). If *log* is True, base is used to define the log space basis.

    If *endpoint* is True, *stop* will be the last retruned value, as long as *num* >= 2.
Return list of evenly spaced integers over an interval .