Lines Matching refs:iterables

92 .. function:: chain(*iterables)
95    exhausted, then proceeds to the next iterable, until all of the iterables are
99       def chain(*iterables):
101           for it in iterables:
111       def from_iterable(iterables):
113           for it in iterables:
221    Stops when either the *data* or *selectors* iterables has been exhausted.
374 .. function:: imap(function, *iterables)
377    iterables.  If *function* is set to ``None``, then :func:`imap` returns the
379    exhausted instead of filling in ``None`` for shorter iterables.  The reason for
384       def imap(function, *iterables):
386           iterables = map(iter, iterables)
388               args = [next(it) for it in iterables]
440 .. function:: izip(*iterables)
442    Make an iterator that aggregates elements from each of the iterables. Like
444    lock-step iteration over several iterables at a time.  Roughly equivalent to::
446       def izip(*iterables):
448           iterators = map(iter, iterables)
453       When no iterables are specified, returns a zero length iterator instead of
456    The left-to-right evaluation order of the iterables is guaranteed. This
461    care about trailing, unmatched values from the longer iterables.  If those
465 .. function:: izip_longest(*iterables[, fillvalue])
467    Make an iterator that aggregates elements from each of the iterables. If the
468    iterables are of uneven length, missing values are filled-in with *fillvalue*.
491    If one of the iterables is potentially infinite, then the
558 .. function:: product(*iterables[, repeat])
560    Cartesian product of input iterables.
567    the input's iterables are sorted, the product tuples are emitted in sorted
758    def roundrobin(*iterables):
761        pending = len(iterables)
762        nexts = cycle(iter(it).next for it in iterables)