9.7. `itertools` — Functions creating iterators for efficient looping¶

New in version 2.3.

This module implements a number of iterator building blocks inspired by constructs from APL, Haskell, and SML. Each has been recast in a form suitable for Python.

The module standardizes a core set of fast, memory efficient tools that are useful by themselves or in combination. Together, they form an “iterator algebra” making it possible to construct specialized tools succinctly and efficiently in pure Python.

For instance, SML provides a tabulation tool: tabulate(f) which produces a sequence f(0), f(1), .... The same effect can be achieved in Python by combining imap() and count() to form imap(f, count()).

These tools and their built-in counterparts also work well with the high-speed functions in the operator module. For example, the multiplication operator can be mapped across two vectors to form an efficient dot-product: sum(imap(operator.mul, vector1, vector2)).

Infinite Iterators:

Iterator	Arguments	Results	Example
`count()`	start, [step]	start, start+step, start+2*step, ...	`count(10) --> 10 11 12 13 14 ...`
`cycle()`	p	p0, p1, ... plast, p0, p1, ...	`cycle('ABCD') --> A B C D A B C D ...`
`repeat()`	elem [,n]	elem, elem, elem, ... endlessly or up to n times	`repeat(10, 3) --> 10 10 10`

Iterators terminating on the shortest input sequence:

Iterator	Arguments	Results	Example
`chain()`	p, q, ...	p0, p1, ... plast, q0, q1, ...	`chain('ABC', 'DEF') --> A B C D E F`
`compress()`	data, selectors	(d[0] if s[0]), (d[1] if s[1]), ...	`compress('ABCDEF', [1,0,1,0,1,1]) --> A C E F`
`dropwhile()`	pred, seq	seq[n], seq[n+1], starting when pred fails	`dropwhile(lambda x: x<5, [1,4,6,4,1]) --> 6 4 1`
`groupby()`	iterable[, keyfunc]	sub-iterators grouped by value of keyfunc(v)
`ifilter()`	pred, seq	elements of seq where pred(elem) is True	`ifilter(lambda x: x%2, range(10)) --> 1 3 5 7 9`
`ifilterfalse()`	pred, seq	elements of seq where pred(elem) is False	`ifilterfalse(lambda x: x%2, range(10)) --> 0 2 4 6 8`
`islice()`	seq, [start,] stop [, step]	elements from seq[start:stop:step]	`islice('ABCDEFG', 2, None) --> C D E F G`
`imap()`	func, p, q, ...	func(p0, q0), func(p1, q1), ...	`imap(pow, (2,3,10), (5,2,3)) --> 32 9 1000`
`starmap()`	func, seq	func(seq[0]), func(seq[1]), ...	`starmap(pow, [(2,5), (3,2), (10,3)]) --> 32 9 1000`
`tee()`	it, n	it1, it2 , ... itn splits one iterator into n
`takewhile()`	pred, seq	seq[0], seq[1], until pred fails	`takewhile(lambda x: x<5, [1,4,6,4,1]) --> 1 4`
`izip()`	p, q, ...	(p[0], q[0]), (p[1], q[1]), ...	`izip('ABCD', 'xy') --> Ax By`
`izip_longest()`	p, q, ...	(p[0], q[0]), (p[1], q[1]), ...	`izip_longest('ABCD', 'xy', fillvalue='-') --> Ax By C- D-`

Combinatoric generators:

Iterator	Arguments	Results
`product()`	p, q, ... [repeat=1]	cartesian product, equivalent to a nested for-loop
`permutations()`	p[, r]	r-length tuples, all possible orderings, no repeated elements
`combinations()`	p, r	r-length tuples, in sorted order, no repeated elements
`combinations_with_replacement()`	p, r	r-length tuples, in sorted order, with repeated elements
`product('ABCD', repeat=2)`		`AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD`
`permutations('ABCD', 2)`		`AB AC AD BA BC BD CA CB CD DA DB DC`
`combinations('ABCD', 2)`		`AB AC AD BC BD CD`
`combinations_with_replacement('ABCD', 2)`		`AA AB AC AD BB BC BD CC CD DD`

9.7.1. Itertool functions¶

The following module functions all construct and return iterators. Some provide streams of infinite length, so they should only be accessed by functions or loops that truncate the stream.

itertools.chain(*iterables)¶

Make an iterator that returns elements from the first iterable until it is exhausted, then proceeds to the next iterable, until all of the iterables are exhausted. Used for treating consecutive sequences as a single sequence. Equivalent to:

def chain(*iterables):
    # chain('ABC', 'DEF') --> A B C D E F
    for it in iterables:
        for element in it:
            yield element

classmethod chain.from_iterable(iterable)¶

Alternate constructor for chain(). Gets chained inputs from a single iterable argument that is evaluated lazily. Roughly equivalent to:

def from_iterable(iterables):
    # chain.from_iterable(['ABC', 'DEF']) --> A B C D E F
    for it in iterables:
        for element in it:
            yield element

New in version 2.6.

itertools.combinations(iterable, r)¶

Return r length subsequences of elements from the input iterable.

Combinations are emitted in lexicographic sort order. So, if the input iterable is sorted, the combination tuples will be produced in sorted order.

Elements are treated as unique based on their position, not on their value. So if the input elements are unique, there will be no repeat values in each combination.

Equivalent to:

def combinations(iterable, r):
    # combinations('ABCD', 2) --> AB AC AD BC BD CD
    # combinations(range(4), 3) --> 012 013 023 123
    pool = tuple(iterable)
    n = len(pool)
    if r > n:
        return
    indices = range(r)
    yield tuple(pool[i] for i in indices)
    while True:
        for i in reversed(range(r)):
            if indices[i] != i + n - r:
                break
        else:
            return
        indices[i] += 1
        for j in range(i+1, r):
            indices[j] = indices[j-1] + 1
        yield tuple(pool[i] for i in indices)

The code for combinations() can be also expressed as a subsequence of permutations() after filtering entries where the elements are not in sorted order (according to their position in the input pool):

def combinations(iterable, r):
    pool = tuple(iterable)
    n = len(pool)
    for indices in permutations(range(n), r):
        if sorted(indices) == list(indices):
            yield tuple(pool[i] for i in indices)

The number of items returned is n! / r! / (n-r)! when 0 <= r <= n or zero when r > n.

New in version 2.6.

itertools.combinations_with_replacement(iterable, r)¶

Return r length subsequences of elements from the input iterable allowing individual elements to be repeated more than once.

Combinations are emitted in lexicographic sort order. So, if the input iterable is sorted, the combination tuples will be produced in sorted order.

Elements are treated as unique based on their position, not on their value. So if the input elements are unique, the generated combinations will also be unique.

Equivalent to:

def combinations_with_replacement(iterable, r):
    # combinations_with_replacement('ABC', 2) --> AA AB AC BB BC CC
    pool = tuple(iterable)
    n = len(pool)
    if not n and r:
        return
    indices = [0] * r
    yield tuple(pool[i] for i in indices)
    while True:
        for i in reversed(range(r)):
            if indices[i] != n - 1:
                break
        else:
            return
        indices[i:] = [indices[i] + 1] * (r - i)
        yield tuple(pool[i] for i in indices)

The code for combinations_with_replacement() can be also expressed as a subsequence of product() after filtering entries where the elements are not in sorted order (according to their position in the input pool):

def combinations_with_replacement(iterable, r):
    pool = tuple(iterable)
    n = len(pool)
    for indices in product(range(n), repeat=r):
        if sorted(indices) == list(indices):
            yield tuple(pool[i] for i in indices)

The number of items returned is (n+r-1)! / r! / (n-1)! when n > 0.

New in version 2.7.

itertools.compress(data, selectors)¶

Make an iterator that filters elements from data returning only those that have a corresponding element in selectors that evaluates to True. Stops when either the data or selectors iterables has been exhausted. Equivalent to:

def compress(data, selectors):
    # compress('ABCDEF', [1,0,1,0,1,1]) --> A C E F
    return (d for d, s in izip(data, selectors) if s)

New in version 2.7.

itertools.count(start=0, step=1)¶

Make an iterator that returns evenly spaced values starting with n. Often used as an argument to imap() to generate consecutive data points. Also, used with izip() to add sequence numbers. Equivalent to:

def count(start=0, step=1):
    # count(10) --> 10 11 12 13 14 ...
    # count(2.5, 0.5) -> 2.5 3.0 3.5 ...
    n = start
    while True:
        yield n
        n += step

When counting with floating point numbers, better accuracy can sometimes be achieved by substituting multiplicative code such as: (start + step * i for i in count()).

Changed in version 2.7: added step argument and allowed non-integer arguments.

itertools.cycle(iterable)¶

Make an iterator returning elements from the iterable and saving a copy of each. When the iterable is exhausted, return elements from the saved copy. Repeats indefinitely. Equivalent to:

def cycle(iterable):
    # cycle('ABCD') --> A B C D A B C D A B C D ...
    saved = []
    for element in iterable:
        yield element
        saved.append(element)
    while saved:
        for element in saved:
              yield element

Note, this member of the toolkit may require significant auxiliary storage (depending on the length of the iterable).

itertools.dropwhile(predicate, iterable)¶

Make an iterator that drops elements from the iterable as long as the predicate is true; afterwards, returns every element. Note, the iterator does not produce any output until the predicate first becomes false, so it may have a lengthy start-up time. Equivalent to:

def dropwhile(predicate, iterable):
    # dropwhile(lambda x: x<5, [1,4,6,4,1]) --> 6 4 1
    iterable = iter(iterable)
    for x in iterable:
        if not predicate(x):
            yield x
            break
    for x in iterable:
        yield x

itertools.groupby(iterable[, key])¶

Make an iterator that returns consecutive keys and groups from the iterable. The key is a function computing a key value for each element. If not specified or is None, key defaults to an identity function and returns the element unchanged. Generally, the iterable needs to already be sorted on the same key function.

The operation of groupby() is similar to the uniq filter in Unix. It generates a break or new group every time the value of the key function changes (which is why it is usually necessary to have sorted the data using the same key function). That behavior differs from SQL’s GROUP BY which aggregates common elements regardless of their input order.

The returned group is itself an iterator that shares the underlying iterable with groupby(). Because the source is shared, when the groupby() object is advanced, the previous group is no longer visible. So, if that data is needed later, it should be stored as a list:

groups = []
uniquekeys = []
data = sorted(data, key=keyfunc)
for k, g in groupby(data, keyfunc):
    groups.append(list(g))      # Store group iterator as a list
    uniquekeys.append(k)

groupby() is equivalent to:

class groupby(object):
    # [k for k, g in groupby('AAAABBBCCDAABBB')] --> A B C D A B
    # [list(g) for k, g in groupby('AAAABBBCCD')] --> AAAA BBB CC D
    def __init__(self, iterable, key=None):
        if key is None:
            key = lambda x: x
        self.keyfunc = key
        self.it = iter(iterable)
        self.tgtkey = self.currkey = self.currvalue = object()
    def __iter__(self):
        return self
    def next(self):
        while self.currkey == self.tgtkey:
            self.currvalue = next(self.it)    # Exit on StopIteration
            self.currkey = self.keyfunc(self.currvalue)
        self.tgtkey = self.currkey
        return (self.currkey, self._grouper(self.tgtkey))
    def _grouper(self, tgtkey):
        while self.currkey == tgtkey:
            yield self.currvalue
            self.currvalue = next(self.it)    # Exit on StopIteration
            self.currkey = self.keyfunc(self.currvalue)

New in version 2.4.

itertools.ifilter(predicate, iterable)¶

Make an iterator that filters elements from iterable returning only those for which the predicate is True. If predicate is None, return the items that are true. Equivalent to:

def ifilter(predicate, iterable):
    # ifilter(lambda x: x%2, range(10)) --> 1 3 5 7 9
    if predicate is None:
        predicate = bool
    for x in iterable:
        if predicate(x):
            yield x

itertools.ifilterfalse(predicate, iterable)¶

Make an iterator that filters elements from iterable returning only those for which the predicate is False. If predicate is None, return the items that are false. Equivalent to:

def ifilterfalse(predicate, iterable):
    # ifilterfalse(lambda x: x%2, range(10)) --> 0 2 4 6 8
    if predicate is None:
        predicate = bool
    for x in iterable:
        if not predicate(x):
            yield x

itertools.imap(function, *iterables)¶

Make an iterator that computes the function using arguments from each of the iterables. If function is set to None, then imap() returns the arguments as a tuple. Like map() but stops when the shortest iterable is exhausted instead of filling in None for shorter iterables. The reason for the difference is that infinite iterator arguments are typically an error for map() (because the output is fully evaluated) but represent a common and useful way of supplying arguments to imap(). Equivalent to:

def imap(function, *iterables):
    # imap(pow, (2,3,10), (5,2,3)) --> 32 9 1000
    iterables = map(iter, iterables)
    while True:
        args = [next(it) for it in iterables]
        if function is None:
            yield tuple(args)
        else:
            yield function(*args)

itertools.islice(iterable, stop)¶

itertools.islice(iterable, start, stop[, step])

Make an iterator that returns selected elements from the iterable. If start is non-zero, then elements from the iterable are skipped until start is reached. Afterward, elements are returned consecutively unless step is set higher than one which results in items being skipped. If stop is None, then iteration continues until the iterator is exhausted, if at all; otherwise, it stops at the specified position. Unlike regular slicing, islice() does not support negative values for start, stop, or step. Can be used to extract related fields from data where the internal structure has been flattened (for example, a multi-line report may list a name field on every third line). Equivalent to:

def islice(iterable, *args):
    # islice('ABCDEFG', 2) --> A B
    # islice('ABCDEFG', 2, 4) --> C D
    # islice('ABCDEFG', 2, None) --> C D E F G
    # islice('ABCDEFG', 0, None, 2) --> A C E G
    s = slice(*args)
    it = iter(xrange(s.start or 0, s.stop or sys.maxint, s.step or 1))
    nexti = next(it)
    for i, element in enumerate(iterable):
        if i == nexti:
            yield element
            nexti = next(it)

If start is None, then iteration starts at zero. If step is None, then the step defaults to one.

Changed in version 2.5: accept None values for default start and step.

itertools.izip(*iterables)¶

Make an iterator that aggregates elements from each of the iterables. Like zip() except that it returns an iterator instead of a list. Used for lock-step iteration over several iterables at a time. Equivalent to:

def izip(*iterables):
    # izip('ABCD', 'xy') --> Ax By
    iterators = map(iter, iterables)
    while iterators:
        yield tuple(map(next, iterators))

Changed in version 2.4: When no iterables are specified, returns a zero length iterator instead of raising a TypeError exception.

The left-to-right evaluation order of the iterables is guaranteed. This makes possible an idiom for clustering a data series into n-length groups using izip(*[iter(s)]*n).

izip() should only be used with unequal length inputs when you don’t care about trailing, unmatched values from the longer iterables. If those values are important, use izip_longest() instead.

itertools.izip_longest(*iterables[, fillvalue])¶

Make an iterator that aggregates elements from each of the iterables. If the iterables are of uneven length, missing values are filled-in with fillvalue. Iteration continues until the longest iterable is exhausted. Equivalent to:

class ZipExhausted(Exception):
    pass

def izip_longest(*args, **kwds):
    # izip_longest('ABCD', 'xy', fillvalue='-') --> Ax By C- D-
    fillvalue = kwds.get('fillvalue')
    counter = [len(args) - 1]
    def sentinel():
        if not counter[0]:
            raise ZipExhausted
        counter[0] -= 1
        yield fillvalue
    fillers = repeat(fillvalue)
    iterators = [chain(it, sentinel(), fillers) for it in args]
    try:
        while iterators:
            yield tuple(map(next, iterators))
    except ZipExhausted:
        pass

If one of the iterables is potentially infinite, then the izip_longest() function should be wrapped with something that limits the number of calls (for example islice() or takewhile()). If not specified, fillvalue defaults to None.

New in version 2.6.

itertools.permutations(iterable[, r])¶

Return successive r length permutations of elements in the iterable.

If r is not specified or is None, then r defaults to the length of the iterable and all possible full-length permutations are generated.

Permutations are emitted in lexicographic sort order. So, if the input iterable is sorted, the permutation tuples will be produced in sorted order.

Elements are treated as unique based on their position, not on their value. So if the input elements are unique, there will be no repeat values in each permutation.

Equivalent to:

def permutations(iterable, r=None):
    # permutations('ABCD', 2) --> AB AC AD BA BC BD CA CB CD DA DB DC
    # permutations(range(3)) --> 012 021 102 120 201 210
    pool = tuple(iterable)
    n = len(pool)
    r = n if r is None else r
    if r > n:
        return
    indices = range(n)
    cycles = range(n, n-r, -1)
    yield tuple(pool[i] for i in indices[:r])
    while n:
        for i in reversed(range(r)):
            cycles[i] -= 1
            if cycles[i] == 0:
                indices[i:] = indices[i+1:] + indices[i:i+1]
                cycles[i] = n - i
            else:
                j = cycles[i]
                indices[i], indices[-j] = indices[-j], indices[i]
                yield tuple(pool[i] for i in indices[:r])
                break
        else:
            return

The code for permutations() can be also expressed as a subsequence of product(), filtered to exclude entries with repeated elements (those from the same position in the input pool):

def permutations(iterable, r=None):
    pool = tuple(iterable)
    n = len(pool)
    r = n if r is None else r
    for indices in product(range(n), repeat=r):
        if len(set(indices)) == r:
            yield tuple(pool[i] for i in indices)

The number of items returned is n! / (n-r)! when 0 <= r <= n or zero when r > n.

New in version 2.6.

itertools.product(*iterables[, repeat])¶

Cartesian product of input iterables.

Equivalent to nested for-loops in a generator expression. For example, product(A, B) returns the same as ((x,y) for x in A for y in B).

The nested loops cycle like an odometer with the rightmost element advancing on every iteration. This pattern creates a lexicographic ordering so that if the input’s iterables are sorted, the product tuples are emitted in sorted order.

To compute the product of an iterable with itself, specify the number of repetitions with the optional repeat keyword argument. For example, product(A, repeat=4) means the same as product(A, A, A, A).

This function is equivalent to the following code, except that the actual implementation does not build up intermediate results in memory:

def product(*args, **kwds):
    # product('ABCD', 'xy') --> Ax Ay Bx By Cx Cy Dx Dy
    # product(range(2), repeat=3) --> 000 001 010 011 100 101 110 111
    pools = map(tuple, args) * kwds.get('repeat', 1)
    result = [[]]
    for pool in pools:
        result = [x+[y] for x in result for y in pool]
    for prod in result:
        yield tuple(prod)

New in version 2.6.

itertools.repeat(object[, times])¶

Make an iterator that returns object over and over again. Runs indefinitely unless the times argument is specified. Used as argument to imap() for invariant function parameters. Also used with izip() to create constant fields in a tuple record. Equivalent to:

def repeat(object, times=None):
    # repeat(10, 3) --> 10 10 10
    if times is None:
        while True:
            yield object
    else:
        for i in xrange(times):
            yield object

A common use for repeat is to supply a stream of constant values to imap or zip:

>>> list(imap(pow, xrange(10), repeat(2)))
[0, 1, 4, 9, 16, 25, 36, 49, 64, 81]

itertools.starmap(function, iterable)¶

Make an iterator that computes the function using arguments obtained from the iterable. Used instead of imap() when argument parameters are already grouped in tuples from a single iterable (the data has been “pre-zipped”). The difference between imap() and starmap() parallels the distinction between function(a,b) and function(*c). Equivalent to:

def starmap(function, iterable):
    # starmap(pow, [(2,5), (3,2), (10,3)]) --> 32 9 1000
    for args in iterable:
        yield function(*args)

Changed in version 2.6: Previously, starmap() required the function arguments to be tuples. Now, any iterable is allowed.

itertools.takewhile(predicate, iterable)¶

Make an iterator that returns elements from the iterable as long as the predicate is true. Equivalent to:

def takewhile(predicate, iterable):
    # takewhile(lambda x: x<5, [1,4,6,4,1]) --> 1 4
    for x in iterable:
        if predicate(x):
            yield x
        else:
            break

itertools.tee(iterable[, n=2])¶

Return n independent iterators from a single iterable. Equivalent to:

def tee(iterable, n=2):
    it = iter(iterable)
    deques = [collections.deque() for i in range(n)]
    def gen(mydeque):
        while True:
            if not mydeque:             # when the local deque is empty
                newval = next(it)       # fetch a new value and
                for d in deques:        # load it to all the deques
                    d.append(newval)
            yield mydeque.popleft()
    return tuple(gen(d) for d in deques)

Once tee() has made a split, the original iterable should not be used anywhere else; otherwise, the iterable could get advanced without the tee objects being informed.

This itertool may require significant auxiliary storage (depending on how much temporary data needs to be stored). In general, if one iterator uses most or all of the data before another iterator starts, it is faster to use list() instead of tee().

New in version 2.4.

9.7.2. Recipes¶

This section shows recipes for creating an extended toolset using the existing itertools as building blocks.

The extended tools offer the same high performance as the underlying toolset. The superior memory performance is kept by processing elements one at a time rather than bringing the whole iterable into memory all at once. Code volume is kept small by linking the tools together in a functional style which helps eliminate temporary variables. High speed is retained by preferring “vectorized” building blocks over the use of for-loops and generators which incur interpreter overhead.

def take(n, iterable):
    "Return first n items of the iterable as a list"
    return list(islice(iterable, n))

def tabulate(function, start=0):
    "Return function(0), function(1), ..."
    return imap(function, count(start))

def consume(iterator, n):
    "Advance the iterator n-steps ahead. If n is none, consume entirely."
    # Use functions that consume iterators at C speed.
    if n is None:
        # feed the entire iterator into a zero-length deque
        collections.deque(iterator, maxlen=0)
    else:
        # advance to the empty slice starting at position n
        next(islice(iterator, n, n), None)

def nth(iterable, n, default=None):
    "Returns the nth item or a default value"
    return next(islice(iterable, n, None), default)

def quantify(iterable, pred=bool):
    "Count how many times the predicate is true"
    return sum(imap(pred, iterable))

def padnone(iterable):
    """Returns the sequence elements and then returns None indefinitely.

    Useful for emulating the behavior of the built-in map() function.
    """
    return chain(iterable, repeat(None))

def ncycles(iterable, n):
    "Returns the sequence elements n times"
    return chain.from_iterable(repeat(tuple(iterable), n))

def dotproduct(vec1, vec2):
    return sum(imap(operator.mul, vec1, vec2))

def flatten(listOfLists):
    "Flatten one level of nesting"
    return chain.from_iterable(listOfLists)

def repeatfunc(func, times=None, *args):
    """Repeat calls to func with specified arguments.

    Example:  repeatfunc(random.random)
    """
    if times is None:
        return starmap(func, repeat(args))
    return starmap(func, repeat(args, times))

def pairwise(iterable):
    "s -> (s0,s1), (s1,s2), (s2, s3), ..."
    a, b = tee(iterable)
    next(b, None)
    return izip(a, b)

def grouper(iterable, n, fillvalue=None):
    "Collect data into fixed-length chunks or blocks"
    # grouper('ABCDEFG', 3, 'x') --> ABC DEF Gxx
    args = [iter(iterable)] * n
    return izip_longest(fillvalue=fillvalue, *args)

def roundrobin(*iterables):
    "roundrobin('ABC', 'D', 'EF') --> A D E B F C"
    # Recipe credited to George Sakkis
    pending = len(iterables)
    nexts = cycle(iter(it).next for it in iterables)
    while pending:
        try:
            for next in nexts:
                yield next()
        except StopIteration:
            pending -= 1
            nexts = cycle(islice(nexts, pending))

def powerset(iterable):
    "powerset([1,2,3]) --> () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)"
    s = list(iterable)
    return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))

def unique_everseen(iterable, key=None):
    "List unique elements, preserving order. Remember all elements ever seen."
    # unique_everseen('AAAABBBCCDAABBB') --> A B C D
    # unique_everseen('ABBCcAD', str.lower) --> A B C D
    seen = set()
    seen_add = seen.add
    if key is None:
        for element in ifilterfalse(seen.__contains__, iterable):
            seen_add(element)
            yield element
    else:
        for element in iterable:
            k = key(element)
            if k not in seen:
                seen_add(k)
                yield element

def unique_justseen(iterable, key=None):
    "List unique elements, preserving order. Remember only the element just seen."
    # unique_justseen('AAAABBBCCDAABBB') --> A B C D A B
    # unique_justseen('ABBCcAD', str.lower) --> A B C A D
    return imap(next, imap(itemgetter(1), groupby(iterable, key)))

def iter_except(func, exception, first=None):
    """ Call a function repeatedly until an exception is raised.

    Converts a call-until-exception interface to an iterator interface.
    Like __builtin__.iter(func, sentinel) but uses an exception instead
    of a sentinel to end the loop.

    Examples:
        bsddbiter = iter_except(db.next, bsddb.error, db.first)
        heapiter = iter_except(functools.partial(heappop, h), IndexError)
        dictiter = iter_except(d.popitem, KeyError)
        dequeiter = iter_except(d.popleft, IndexError)
        queueiter = iter_except(q.get_nowait, Queue.Empty)
        setiter = iter_except(s.pop, KeyError)

    """
    try:
        if first is not None:
            yield first()
        while 1:
            yield func()
    except exception:
        pass

def random_product(*args, **kwds):
    "Random selection from itertools.product(*args, **kwds)"
    pools = map(tuple, args) * kwds.get('repeat', 1)
    return tuple(random.choice(pool) for pool in pools)

def random_permutation(iterable, r=None):
    "Random selection from itertools.permutations(iterable, r)"
    pool = tuple(iterable)
    r = len(pool) if r is None else r
    return tuple(random.sample(pool, r))

def random_combination(iterable, r):
    "Random selection from itertools.combinations(iterable, r)"
    pool = tuple(iterable)
    n = len(pool)
    indices = sorted(random.sample(xrange(n), r))
    return tuple(pool[i] for i in indices)

def random_combination_with_replacement(iterable, r):
    "Random selection from itertools.combinations_with_replacement(iterable, r)"
    pool = tuple(iterable)
    n = len(pool)
    indices = sorted(random.randrange(n) for i in xrange(r))
    return tuple(pool[i] for i in indices)

def tee_lookahead(t, i):
    """Inspect the i-th upcomping value from a tee object
       while leaving the tee object at its current position.

       Raise an IndexError if the underlying iterator doesn't
       have enough values.

    """
    for value in islice(t.__copy__(), i, None):
        return value
    raise IndexError(i)

Note, many of the above recipes can be optimized by replacing global lookups with local variables defined as default values. For example, the dotproduct recipe can be written as:

def dotproduct(vec1, vec2, sum=sum, imap=imap, mul=operator.mul):
    return sum(imap(mul, vec1, vec2))

9.7. `itertools` — Functions creating iterators for efficient looping¶

9.7.1. Itertool functions¶

9.7.2. Recipes¶

Table Of Contents

Previous topic

Next topic

This Page

[ NAME ]	[ SIZE ]	[ PERM ]	[ DATE ]	[ ACT ]
+FILE +DIR
2to3.html	49.274 KB	-rw-r--r--	2019-07-03 16:47	R E G D
__builtin__.html	10.261 KB	-rw-r--r--	2019-07-03 16:47	R E G D
__future__.html	13.794 KB	-rw-r--r--	2019-07-03 16:47	R E G D
__main__.html	7.055 KB	-rw-r--r--	2019-07-03 16:47	R E G D
_winreg.html	59.208 KB	-rw-r--r--	2019-07-03 16:47	R E G D
abc.html	23.898 KB	-rw-r--r--	2019-07-03 16:47	R E G D
aepack.html	13.16 KB	-rw-r--r--	2019-07-03 16:47	R E G D
aetools.html	14.914 KB	-rw-r--r--	2019-07-03 16:47	R E G D
aetypes.html	18.882 KB	-rw-r--r--	2019-07-03 16:47	R E G D
aifc.html	22.404 KB	-rw-r--r--	2019-07-03 16:47	R E G D
al.html	17.341 KB	-rw-r--r--	2019-07-03 16:47	R E G D
allos.html	33.725 KB	-rw-r--r--	2019-07-03 16:47	R E G D
anydbm.html	16.33 KB	-rw-r--r--	2019-07-03 16:47	R E G D
archiving.html	9.263 KB	-rw-r--r--	2019-07-03 16:47	R E G D
argparse.html	237.615 KB	-rw-r--r--	2019-07-03 16:47	R E G D
array.html	29.295 KB	-rw-r--r--	2019-07-03 16:47	R E G D
ast.html	34.98 KB	-rw-r--r--	2019-07-03 16:47	R E G D
asynchat.html	31.434 KB	-rw-r--r--	2019-07-03 16:47	R E G D
asyncore.html	36.513 KB	-rw-r--r--	2019-07-03 16:47	R E G D
atexit.html	16.803 KB	-rw-r--r--	2019-07-03 16:47	R E G D
audioop.html	31.356 KB	-rw-r--r--	2019-07-03 16:47	R E G D
autogil.html	8.186 KB	-rw-r--r--	2019-07-03 16:47	R E G D
base64.html	19.669 KB	-rw-r--r--	2019-07-03 16:47	R E G D
basehttpserver.html	34.039 KB	-rw-r--r--	2019-07-03 16:47	R E G D
bastion.html	11.04 KB	-rw-r--r--	2019-07-03 16:47	R E G D
bdb.html	36.682 KB	-rw-r--r--	2019-07-03 16:47	R E G D
binascii.html	20.665 KB	-rw-r--r--	2019-07-03 16:47	R E G D
binhex.html	10.577 KB	-rw-r--r--	2019-07-03 16:47	R E G D
bisect.html	23.236 KB	-rw-r--r--	2019-07-03 16:47	R E G D
bsddb.html	26.433 KB	-rw-r--r--	2019-07-03 16:47	R E G D
bz2.html	26.082 KB	-rw-r--r--	2019-07-03 16:47	R E G D
calendar.html	37.788 KB	-rw-r--r--	2019-07-03 16:47	R E G D
carbon.html	48.944 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cd.html	27.96 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cgi.html	49.924 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cgihttpserver.html	13.099 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cgitb.html	11.411 KB	-rw-r--r--	2019-07-03 16:47	R E G D
chunk.html	14.664 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cmath.html	25.632 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cmd.html	26.095 KB	-rw-r--r--	2019-07-03 16:47	R E G D
code.html	24.577 KB	-rw-r--r--	2019-07-03 16:47	R E G D
codecs.html	100.638 KB	-rw-r--r--	2019-07-03 16:47	R E G D
codeop.html	14.841 KB	-rw-r--r--	2019-07-03 16:47	R E G D
collections.html	133.964 KB	-rw-r--r--	2019-07-03 16:47	R E G D
colorpicker.html	7.523 KB	-rw-r--r--	2019-07-03 16:47	R E G D
colorsys.html	11.037 KB	-rw-r--r--	2019-07-03 16:47	R E G D
commands.html	14.361 KB	-rw-r--r--	2019-07-03 16:47	R E G D
compileall.html	16.827 KB	-rw-r--r--	2019-07-03 16:47	R E G D
compiler.html	67.75 KB	-rw-r--r--	2019-07-03 16:47	R E G D
configparser.html	62.131 KB	-rw-r--r--	2019-07-03 16:47	R E G D
constants.html	12.834 KB	-rw-r--r--	2019-07-03 16:47	R E G D
contextlib.html	19.388 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cookie.html	39.068 KB	-rw-r--r--	2019-07-03 16:47	R E G D
cookielib.html	83.822 KB	-rw-r--r--	2019-07-03 16:47	R E G D
copy.html	12.189 KB	-rw-r--r--	2019-07-03 16:47	R E G D
copy_reg.html	13.765 KB	-rw-r--r--	2019-07-03 16:47	R E G D
crypt.html	10.041 KB	-rw-r--r--	2019-07-03 16:47	R E G D
crypto.html	7.591 KB	-rw-r--r--	2019-07-03 16:47	R E G D
csv.html	67.371 KB	-rw-r--r--	2019-07-03 16:47	R E G D
ctypes.html	238.781 KB	-rw-r--r--	2019-07-03 16:47	R E G D
curses.ascii.html	22.288 KB	-rw-r--r--	2019-07-03 16:47	R E G D
curses.html	146.633 KB	-rw-r--r--	2019-07-03 16:47	R E G D
curses.panel.html	14.388 KB	-rw-r--r--	2019-07-03 16:47	R E G D
custominterp.html	7.624 KB	-rw-r--r--	2019-07-03 16:47	R E G D
datatypes.html	16.845 KB	-rw-r--r--	2019-07-03 16:47	R E G D
datetime.html	226.595 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dbhash.html	15.482 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dbm.html	12.068 KB	-rw-r--r--	2019-07-03 16:47	R E G D
debug.html	10.151 KB	-rw-r--r--	2019-07-03 16:47	R E G D
decimal.html	194.439 KB	-rw-r--r--	2019-07-03 16:47	R E G D
development.html	14.168 KB	-rw-r--r--	2019-07-03 16:47	R E G D
difflib.html	84.829 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dircache.html	11.407 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dis.html	69.951 KB	-rw-r--r--	2019-07-03 16:47	R E G D
distutils.html	8.055 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dl.html	16.327 KB	-rw-r--r--	2019-07-03 16:47	R E G D
doctest.html	165.542 KB	-rw-r--r--	2019-07-03 16:47	R E G D
docxmlrpcserver.html	16.432 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dumbdbm.html	14.021 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dummy_thread.html	9.432 KB	-rw-r--r--	2019-07-03 16:47	R E G D
dummy_threading.html	8.368 KB	-rw-r--r--	2019-07-03 16:47	R E G D
easydialogs.html	30.546 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email-examples.html	45.654 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.charset.html	26.804 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.encoders.html	11.856 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.errors.html	15.767 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.generator.html	20.771 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.header.html	26.922 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.html	44.235 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.iterators.html	11.521 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.message.html	63.156 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.mime.html	27.928 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.parser.html	30.452 KB	-rw-r--r--	2019-07-03 16:47	R E G D
email.util.html	24.461 KB	-rw-r--r--	2019-07-03 16:47	R E G D
errno.html	37.994 KB	-rw-r--r--	2019-07-03 16:47	R E G D
exceptions.html	56.126 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fcntl.html	22.673 KB	-rw-r--r--	2019-07-03 16:47	R E G D
filecmp.html	22.299 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fileformats.html	9.136 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fileinput.html	24.278 KB	-rw-r--r--	2019-07-03 16:47	R E G D
filesys.html	10.203 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fl.html	49.923 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fm.html	11.905 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fnmatch.html	14.577 KB	-rw-r--r--	2019-07-03 16:47	R E G D
formatter.html	34.061 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fpectl.html	16.008 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fpformat.html	10.587 KB	-rw-r--r--	2019-07-03 16:47	R E G D
fractions.html	22.608 KB	-rw-r--r--	2019-07-03 16:47	R E G D
framework.html	33.345 KB	-rw-r--r--	2019-07-03 16:47	R E G D
frameworks.html	7.143 KB	-rw-r--r--	2019-07-03 16:47	R E G D
ftplib.html	43.989 KB	-rw-r--r--	2019-07-03 16:47	R E G D
functions.html	183.145 KB	-rw-r--r--	2019-07-03 16:47	R E G D
functools.html	27.169 KB	-rw-r--r--	2019-07-03 16:47	R E G D
future_builtins.html	13.04 KB	-rw-r--r--	2019-07-03 16:47	R E G D
gc.html	25.75 KB	-rw-r--r--	2019-07-03 16:47	R E G D
gdbm.html	15.965 KB	-rw-r--r--	2019-07-03 16:47	R E G D
gensuitemodule.html	11.513 KB	-rw-r--r--	2019-07-03 16:47	R E G D
getopt.html	23.662 KB	-rw-r--r--	2019-07-03 16:47	R E G D
getpass.html	10.652 KB	-rw-r--r--	2019-07-03 16:47	R E G D
gettext.html	78.757 KB	-rw-r--r--	2019-07-03 16:48	R E G D
gl.html	22.094 KB	-rw-r--r--	2019-07-03 16:48	R E G D
glob.html	13.26 KB	-rw-r--r--	2019-07-03 16:48	R E G D
grp.html	10.494 KB	-rw-r--r--	2019-07-03 16:48	R E G D
gzip.html	18.985 KB	-rw-r--r--	2019-07-03 16:48	R E G D
hashlib.html	18.198 KB	-rw-r--r--	2019-07-03 16:48	R E G D
heapq.html	31.61 KB	-rw-r--r--	2019-07-03 16:48	R E G D
hmac.html	10.464 KB	-rw-r--r--	2019-07-03 16:48	R E G D
hotshot.html	18.649 KB	-rw-r--r--	2019-07-03 16:48	R E G D
htmllib.html	25.315 KB	-rw-r--r--	2019-07-03 16:48	R E G D
htmlparser.html	39.114 KB	-rw-r--r--	2019-07-03 16:48	R E G D
httplib.html	62.95 KB	-rw-r--r--	2019-07-03 16:48	R E G D
i18n.html	9.523 KB	-rw-r--r--	2019-07-03 16:48	R E G D
ic.html	17.169 KB	-rw-r--r--	2019-07-03 16:48	R E G D
idle.html	20.896 KB	-rw-r--r--	2019-07-03 16:48	R E G D
imageop.html	14.765 KB	-rw-r--r--	2019-07-03 16:48	R E G D
imaplib.html	51.986 KB	-rw-r--r--	2019-07-03 16:48	R E G D
imgfile.html	11.712 KB	-rw-r--r--	2019-07-03 16:48	R E G D
imghdr.html	11.297 KB	-rw-r--r--	2019-07-03 16:48	R E G D
imp.html	34.344 KB	-rw-r--r--	2019-07-03 16:48	R E G D
importlib.html	8.258 KB	-rw-r--r--	2019-07-03 16:48	R E G D
imputil.html	31.808 KB	-rw-r--r--	2019-07-03 16:48	R E G D
index.html	72.778 KB	-rw-r--r--	2019-07-03 16:48	R E G D
inspect.html	50.705 KB	-rw-r--r--	2019-07-03 16:48	R E G D
internet.html	24.872 KB	-rw-r--r--	2019-07-03 16:48	R E G D
intro.html	8.935 KB	-rw-r--r--	2019-07-03 16:48	R E G D
io.html	98.13 KB	-rw-r--r--	2019-07-03 16:48	R E G D
ipc.html	13.405 KB	-rw-r--r--	2019-07-03 16:48	R E G D
itertools.html	115.905 KB	-rw-r--r--	2019-07-03 16:48	R E G D
jpeg.html	12.743 KB	-rw-r--r--	2019-07-03 16:48	R E G D
json.html	67.037 KB	-rw-r--r--	2019-07-03 16:48	R E G D
keyword.html	7.677 KB	-rw-r--r--	2019-07-03 16:48	R E G D
language.html	11.027 KB	-rw-r--r--	2019-07-03 16:48	R E G D
linecache.html	10.591 KB	-rw-r--r--	2019-07-03 16:48	R E G D
locale.html	55.137 KB	-rw-r--r--	2019-07-03 16:48	R E G D
logging.config.html	63.355 KB	-rw-r--r--	2019-07-03 16:48	R E G D
logging.handlers.html	69.645 KB	-rw-r--r--	2019-07-03 16:48	R E G D
logging.html	95.645 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mac.html	21.787 KB	-rw-r--r--	2019-07-03 16:48	R E G D
macos.html	14.758 KB	-rw-r--r--	2019-07-03 16:48	R E G D
macosa.html	12.959 KB	-rw-r--r--	2019-07-03 16:48	R E G D
macostools.html	15.516 KB	-rw-r--r--	2019-07-03 16:48	R E G D
macpath.html	7.764 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mailbox.html	156.753 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mailcap.html	13.215 KB	-rw-r--r--	2019-07-03 16:48	R E G D
markup.html	18.772 KB	-rw-r--r--	2019-07-03 16:48	R E G D
marshal.html	17.977 KB	-rw-r--r--	2019-07-03 16:48	R E G D
math.html	39.242 KB	-rw-r--r--	2019-07-03 16:48	R E G D
md5.html	13.968 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mhlib.html	21.537 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mimetools.html	19.251 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mimetypes.html	28.39 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mimewriter.html	15.016 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mimify.html	13.361 KB	-rw-r--r--	2019-07-03 16:48	R E G D
miniaeframe.html	12.199 KB	-rw-r--r--	2019-07-03 16:48	R E G D
misc.html	6.868 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mm.html	9.032 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mmap.html	28.364 KB	-rw-r--r--	2019-07-03 16:48	R E G D
modulefinder.html	15.313 KB	-rw-r--r--	2019-07-03 16:48	R E G D
modules.html	8.456 KB	-rw-r--r--	2019-07-03 16:48	R E G D
msilib.html	52.431 KB	-rw-r--r--	2019-07-03 16:48	R E G D
msvcrt.html	19.372 KB	-rw-r--r--	2019-07-03 16:48	R E G D
multifile.html	24.297 KB	-rw-r--r--	2019-07-03 16:48	R E G D
multiprocessing.html	365.706 KB	-rw-r--r--	2019-07-03 16:48	R E G D
mutex.html	11.231 KB	-rw-r--r--	2019-07-03 16:48	R E G D
netdata.html	16.983 KB	-rw-r--r--	2019-07-03 16:48	R E G D
netrc.html	12.305 KB	-rw-r--r--	2019-07-03 16:48	R E G D
new.html	12.122 KB	-rw-r--r--	2019-07-03 16:48	R E G D
nis.html	10.636 KB	-rw-r--r--	2019-07-03 16:48	R E G D
nntplib.html	41.919 KB	-rw-r--r--	2019-07-03 16:48	R E G D
numbers.html	37.748 KB	-rw-r--r--	2019-07-03 16:48	R E G D
numeric.html	13.553 KB	-rw-r--r--	2019-07-03 16:48	R E G D
operator.html	82 KB	-rw-r--r--	2019-07-03 16:48	R E G D
optparse.html	222.556 KB	-rw-r--r--	2019-07-03 16:48	R E G D
os.html	214.245 KB	-rw-r--r--	2019-07-03 16:48	R E G D
os.path.html	38.341 KB	-rw-r--r--	2019-07-03 16:48	R E G D
ossaudiodev.html	41.503 KB	-rw-r--r--	2019-07-03 16:48	R E G D
othergui.html	9.084 KB	-rw-r--r--	2019-07-03 16:48	R E G D
parser.html	39.363 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pdb.html	33.961 KB	-rw-r--r--	2019-07-03 16:48	R E G D
persistence.html	14.865 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pickle.html	102.271 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pickletools.html	10.631 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pipes.html	18.01 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pkgutil.html	25.107 KB	-rw-r--r--	2019-07-03 16:48	R E G D
platform.html	28.367 KB	-rw-r--r--	2019-07-03 16:48	R E G D
plistlib.html	17.028 KB	-rw-r--r--	2019-07-03 16:48	R E G D
popen2.html	25.431 KB	-rw-r--r--	2019-07-03 16:48	R E G D
poplib.html	22.321 KB	-rw-r--r--	2019-07-03 16:48	R E G D
posix.html	14.413 KB	-rw-r--r--	2019-07-03 16:48	R E G D
posixfile.html	19.763 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pprint.html	29.922 KB	-rw-r--r--	2019-07-03 16:48	R E G D
profile.html	63.556 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pty.html	9.478 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pwd.html	11.428 KB	-rw-r--r--	2019-07-03 16:48	R E G D
py_compile.html	11.116 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pyclbr.html	14.707 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pydoc.html	11.484 KB	-rw-r--r--	2019-07-03 16:48	R E G D
pyexpat.html	71.528 KB	-rw-r--r--	2019-07-03 16:48	R E G D
python.html	12.274 KB	-rw-r--r--	2019-07-03 16:48	R E G D
queue.html	24.22 KB	-rw-r--r--	2019-07-03 16:48	R E G D
quopri.html	11.896 KB	-rw-r--r--	2019-07-03 16:48	R E G D
random.html	37.835 KB	-rw-r--r--	2019-07-03 16:48	R E G D
re.html	134.742 KB	-rw-r--r--	2019-07-03 16:48	R E G D
readline.html	28.24 KB	-rw-r--r--	2019-07-03 16:48	R E G D
repr.html	20.427 KB	-rw-r--r--	2019-07-03 16:48	R E G D
resource.html	26.483 KB	-rw-r--r--	2019-07-03 16:48	R E G D
restricted.html	11.647 KB	-rw-r--r--	2019-07-03 16:48	R E G D
rexec.html	37.41 KB	-rw-r--r--	2019-07-03 16:48	R E G D
rfc822.html	42.22 KB	-rw-r--r--	2019-07-03 16:48	R E G D
rlcompleter.html	13.506 KB	-rw-r--r--	2019-07-03 16:48	R E G D
robotparser.html	12.268 KB	-rw-r--r--	2019-07-03 16:48	R E G D
runpy.html	19.339 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sched.html	18.543 KB	-rw-r--r--	2019-07-03 16:48	R E G D
scrolledtext.html	9.315 KB	-rw-r--r--	2019-07-03 16:48	R E G D
select.html	39.672 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sets.html	36.918 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sgi.html	9.712 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sgmllib.html	30.771 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sha.html	12.088 KB	-rw-r--r--	2019-07-03 16:48	R E G D
shelve.html	27.021 KB	-rw-r--r--	2019-07-03 16:48	R E G D
shlex.html	32.102 KB	-rw-r--r--	2019-07-03 16:48	R E G D
shutil.html	40.218 KB	-rw-r--r--	2019-07-03 16:48	R E G D
signal.html	31.136 KB	-rw-r--r--	2019-07-03 16:48	R E G D
simplehttpserver.html	18.41 KB	-rw-r--r--	2019-07-03 16:48	R E G D
simplexmlrpcserver.html	31.388 KB	-rw-r--r--	2019-07-03 16:48	R E G D
site.html	23.637 KB	-rw-r--r--	2019-07-03 16:48	R E G D
smtpd.html	12.465 KB	-rw-r--r--	2019-07-03 16:48	R E G D
smtplib.html	42.127 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sndhdr.html	10.018 KB	-rw-r--r--	2019-07-03 16:48	R E G D
socket.html	106.338 KB	-rw-r--r--	2019-07-03 16:48	R E G D
socketserver.html	59.829 KB	-rw-r--r--	2019-07-03 16:48	R E G D
someos.html	15.106 KB	-rw-r--r--	2019-07-03 16:48	R E G D
spwd.html	10.328 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sqlite3.html	139.502 KB	-rw-r--r--	2019-07-03 16:48	R E G D
ssl.html	65.622 KB	-rw-r--r--	2019-07-03 16:48	R E G D
stat.html	32.31 KB	-rw-r--r--	2019-07-03 16:48	R E G D
statvfs.html	10.604 KB	-rw-r--r--	2019-07-03 16:48	R E G D
stdtypes.html	260.401 KB	-rw-r--r--	2019-07-03 16:48	R E G D
string.html	106.649 KB	-rw-r--r--	2019-07-03 16:48	R E G D
stringio.html	18.813 KB	-rw-r--r--	2019-07-03 16:48	R E G D
stringprep.html	16.13 KB	-rw-r--r--	2019-07-03 16:48	R E G D
strings.html	14.927 KB	-rw-r--r--	2019-07-03 16:48	R E G D
struct.html	40.878 KB	-rw-r--r--	2019-07-03 16:48	R E G D
subprocess.html	84.912 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sun.html	6.843 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sunau.html	27.104 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sunaudio.html	17.795 KB	-rw-r--r--	2019-07-03 16:48	R E G D
symbol.html	7.66 KB	-rw-r--r--	2019-07-03 16:48	R E G D
symtable.html	22.937 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sys.html	98.698 KB	-rw-r--r--	2019-07-03 16:48	R E G D
sysconfig.html	23.844 KB	-rw-r--r--	2019-07-03 16:48	R E G D
syslog.html	17.919 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tabnanny.html	10.631 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tarfile.html	78.683 KB	-rw-r--r--	2019-07-03 16:48	R E G D
telnetlib.html	25.479 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tempfile.html	29.416 KB	-rw-r--r--	2019-07-03 16:48	R E G D
termios.html	16.011 KB	-rw-r--r--	2019-07-03 16:48	R E G D
test.html	52.621 KB	-rw-r--r--	2019-07-03 16:48	R E G D
textwrap.html	27.253 KB	-rw-r--r--	2019-07-03 16:48	R E G D
thread.html	20.468 KB	-rw-r--r--	2019-07-03 16:48	R E G D
threading.html	76.69 KB	-rw-r--r--	2019-07-03 16:48	R E G D
time.html	56.927 KB	-rw-r--r--	2019-07-03 16:48	R E G D
timeit.html	36.267 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tix.html	46.959 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tk.html	23.644 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tkinter.html	67.666 KB	-rw-r--r--	2019-07-03 16:48	R E G D
token.html	19.617 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tokenize.html	18.445 KB	-rw-r--r--	2019-07-03 16:48	R E G D
trace.html	25.535 KB	-rw-r--r--	2019-07-03 16:48	R E G D
traceback.html	33.438 KB	-rw-r--r--	2019-07-03 16:48	R E G D
ttk.html	101.749 KB	-rw-r--r--	2019-07-03 16:48	R E G D
tty.html	9.058 KB	-rw-r--r--	2019-07-03 16:48	R E G D
turtle.html	211.742 KB	-rw-r--r--	2019-07-03 16:48	R E G D
types.html	27.591 KB	-rw-r--r--	2019-07-03 16:48	R E G D
undoc.html	23.156 KB	-rw-r--r--	2019-07-03 16:48	R E G D
unicodedata.html	18.546 KB	-rw-r--r--	2019-07-03 16:48	R E G D
unittest.html	202.848 KB	-rw-r--r--	2019-07-03 16:48	R E G D
unix.html	10.551 KB	-rw-r--r--	2019-07-03 16:48	R E G D
urllib.html	58.682 KB	-rw-r--r--	2019-07-03 16:48	R E G D
urllib2.html	100.578 KB	-rw-r--r--	2019-07-03 16:48	R E G D
urlparse.html	40.414 KB	-rw-r--r--	2019-07-03 16:48	R E G D
user.html	11.826 KB	-rw-r--r--	2019-07-03 16:48	R E G D
userdict.html	29.729 KB	-rw-r--r--	2019-07-03 16:48	R E G D
uu.html	11.026 KB	-rw-r--r--	2019-07-03 16:48	R E G D
uuid.html	28.191 KB	-rw-r--r--	2019-07-03 16:48	R E G D
warnings.html	46.599 KB	-rw-r--r--	2019-07-03 16:48	R E G D
wave.html	22.216 KB	-rw-r--r--	2019-07-03 16:48	R E G D
weakref.html	36.521 KB	-rw-r--r--	2019-07-03 16:48	R E G D
webbrowser.html	23.065 KB	-rw-r--r--	2019-07-03 16:48	R E G D
whichdb.html	8.853 KB	-rw-r--r--	2019-07-03 16:48	R E G D
windows.html	9.335 KB	-rw-r--r--	2019-07-03 16:48	R E G D
winsound.html	18.747 KB	-rw-r--r--	2019-07-03 16:48	R E G D
wsgiref.html	81.043 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xdrlib.html	29.94 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.dom.html	89.044 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.dom.minidom.html	40.42 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.dom.pulldom.html	12.705 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.etree.elementtree.html	93.219 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.html	16.493 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.sax.handler.html	38.632 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.sax.html	20.221 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.sax.reader.html	39.086 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xml.sax.utils.html	14.257 KB	-rw-r--r--	2019-07-03 16:48	R E G D
xmlrpclib.html	60.79 KB	-rw-r--r--	2019-07-03 16:48	R E G D
zipfile.html	53.136 KB	-rw-r--r--	2019-07-03 16:48	R E G D
zipimport.html	20.425 KB	-rw-r--r--	2019-07-03 16:48	R E G D
zlib.html	25.461 KB	-rw-r--r--	2019-07-03 16:48	R E G D
REQUEST EXIT

Navigation

9.7. itertools — Functions creating iterators for efficient looping¶

9.7.1. Itertool functions¶

9.7.2. Recipes¶

Table Of Contents

Previous topic

Next topic

This Page

Quick search

Navigation

9.7. `itertools` — Functions creating iterators for efficient looping¶