PortSDEvader.py
def mix_count(count, num):
    '''
    sequence S = range(count) such that consecutive numbers have gap of num;
    we restart the sequence from the lowest unused number of S when a sequence
    is exchausted; e.g.
    mix_count(10, 5) = [0, 5, 1, 6, 2, 7, 3, 8, 4, 9]
    mix_count(20, 3) = [0, 3, 6, 9, 12, 15, 18, 1, 4, 7, 10, 13, 16, 19, 2, 5, 8, 11, 14, 17]

    params:
        count<int>      to rearrange numbers in range(count)
        num<int>        gap
    returns:
        list of numbers
    '''
    return [i for x in range(num) for i in range(x, count, num)]

    sequence S = range(count) such that consecutive numbers have gap of num;
    we restart the sequence from the lowest unused number of S when a sequence
    is exchausted; e.g.
    mix_count(10, 5) = [0, 5, 1, 6, 2, 7, 3, 8, 4, 9]
    mix_count(20, 3) = [0, 3, 6, 9, 12, 15, 18, 1, 4, 7, 10, 13, 16, 19, 2, 5, 8, 11, 14, 17]

    params:
        count<int>      to rearrange numbers in range(count)
        num<int>        gap
    returns:
        list of numbers
    
sequence S = range(count) such that consecutive numbers have gap of num;
we restart the sequence from the lowest unused number of S when a sequence
is exchausted; e.g.

count      to rearrange numbers in range(count)
num        gap
returns:
list of numbers
sequence S = range ( count ) such that consecutive numbers have gap of num ; we restart the sequence from the lowest unused number of S when a sequence is exchausted ; e . g . count to rearrange numbers in range ( count ) num gap returns : list of numbers
def mix_count(count, num):
    return [i for x in range(num) for i in range(x, count, num)]
def mix_count ( count , num ) : return [ i for x in range ( num ) for i in range ( x , count , num ) ]
sequence S = range(count) such that consecutive numbers have gap of num;
we restart the sequence from the lowest unused number of S when a sequence
is exchausted; e.g.
sequence S = range ( count ) such that consecutive numbers have gap of num ; we restart the sequence from the lowest unused number of S when a sequence is exchausted ; e . g .
'''
    sequence S = range(count) such that consecutive numbers have gap of num;
    we restart the sequence from the lowest unused number of S when a sequence
    is exchausted; e.g.
    mix_count(10, 5) = [0, 5, 1, 6, 2, 7, 3, 8, 4, 9]
    mix_count(20, 3) = [0, 3, 6, 9, 12, 15, 18, 1, 4, 7, 10, 13, 16, 19, 2, 5, 8, 11, 14, 17]

    params:
        count<int>      to rearrange numbers in range(count)
        num<int>        gap
    returns:
        list of numbers
    '''
count
num