| 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- |
