/usr/lib/python2.6/lib-dynload
Edit: /usr/lib/python2.6/lib-dynload/itertoolsmodule.so (45540B)
ELF 0 4 4 ( u u , , l l l $ $ Ptda a a Qtd GNU iÛcA-5G0 @ @ A @ @ B D |CEqX 3O o S # 6
+ h ' | / C v W L o & m G f M _ Y 5
z " ] I 6 = \ ? __gmon_start__ _init _fini __cxa_finalize _Jv_RegisterClasses inititertools PyType_Type Py_InitModule4 strchr PyModule_AddObject PyType_Ready PyInt_FromSize_t PyExc_TypeError PyErr_SetString Py_BuildValue PyObject_GetIter _Py_NoneStruct PyArg_ParseTupleAndKeywords PyObject_RichCompareBool PyIter_Next PyObject_CallFunctionObjArgs _PyObject_GC_New PyObject_GC_Track PyTuple_Pack PyObject_GC_UnTrack PyObject_GC_Del _PyArg_NoKeywords PyArg_ParseTuple PyTuple_Size PyObject_Repr PyString_FromFormat PyTuple_New PyMem_Malloc PySequence_Tuple PyMem_Free PyErr_NoMemory PyExc_ValueError PyInt_AsSsize_t PyErr_Occurred PySequence_Size PyDict_Type PyErr_ExceptionMatches PyDict_Size PyDict_GetItemString PyErr_Format PyArg_UnpackTuple PyExc_StopIteration PyErr_Clear _PyObject_New PyInt_FromSsize_t PyNumber_Add PyInt_FromLong PyObject_Free PyObject_IsTrue PyBool_Type PyObject_Call PyTuple_Type PyList_New PyList_Size PyList_Append PyType_IsSubtype PyObject_ClearWeakRefs PyObject_HasAttrString PyObject_CallMethod PyObject_GenericGetAttr PyObject_SelfIter libpthread.so.0 libc.so.6 _edata __bss_start _end GLIBC_2.1.3 GLIBC_2.0 , s i N ii
Z $ ( , 0 4 8 < @ D H L P T X \ ` h L X , 8 x | \ p 8 < P | ̝ ؝ 0 \ < ؟ ܟ l x Р L X ܡ , 8 x | X \ p 8 < P | ̤ ؤ 0 4 \ < ئ ܦ l x Ч L X ܨ , 8 x | X \ p 8 < P | ī ̫ $ , @ D L ` d l 4 8 < @ D H L P T ) X - \ = $ H $ ( $ $ $ ȟ $ $ $ h $ H $ ( $ $ $ Ȧ $ $ $ h $ H $ ( $ ` @ @ l L , ̠ l L , ̧ l L l p t x |
ā ȁ ́ ! Ё " ԁ # % ܁ & ' ( * + , . / 0 1 2 3 4 5 6 7 8 9 $ : ( ; , < 0 = 4 > 8 ? US [ðm t~ H X[ h h h h h h( $ h0 ( h8 p, h@ `0 hH P4 hP @8 hX 0< h` @ hh D hp H hx L h P h T h X h \ h ` h d h h h pl h `p h Pt h @x h 0| h h h h h h h h h h( h0 h8 p h@ ` hH P hP @ hX 0 h` hh hp hx h h h h UVS &j d$@+ u\t$)D+ 9s t& D+ D+ 9rƃ@+ d$[^]
US0 ×i d$싓tt $Ѝd$[]Ë $ÐUWVd$u} FtU$T$ׅuZF tU$T$ׅuCFtU$T$ׅu,FtU$T$ׅuV1t E$D$d$^_]Ð& Ud$uu}} FtU$T$ׅuV 1t E$D$u}]Í& UWVd$}GtU$T$U ҅uEG 1~$DtU$T$U ҅u v9w W1tE$D$U ҍd$^_]Í ' UWVd$}GtG ҉tkW ~81v9w ~,DtD ҉uPv$R9w ԋGtG ҉u P$Rd$1^_]ËP$R느t& Ud$EP1t
E$D$U Í& ' Ud$uu}} FtU$T$ׅuV 1t E$D$u}]Í& Ud$uu}} F tU$T$ׅuV1t E$D$u}]Í& Ud$uu}} F tU$T$ׅuV1t E$D$u}]Í& Ud$EP1t
E$D$U Í& ' UWVd$u~G@pEV9V ~G}V9V V~.E$ׅt3҉uۋP$RV9V Vҋ}Nt19 d$ ^_]Ív <$U҅tN VʃF9щV ~VV Ή' Ud$uu}} F tU$T$ׅuV1t E$D$u}]Í& Ud$uu}} FtU$T$ׅuV 1t E$D$u}]Í& UV֍d$D$ $ tp@ d$$^]Ë҉uVE4$REݍt& Ud$uu}} FtU$T$ׅuV 1t E$D$u}]Í& Ud$uu}} FtU$T$ׅuV1t E$D$u}]Í& Ud$uu}} FtU$T$ׅuV1t E$D$u}]Í& Ud$uu}} FtU$T$ׅuV1t E$D$u}]Í& Ud$uu}} F tU$T$ׅuV1t E$D$u}]Í& Ud$uu}} F tU$T$ׅuV1t E$D$u}]Í& Ud$uu}} F tU$T$ׅuV1t E$D$u}]Í& Ud$EP1t
E$D$U Í& ' U1UJ t~IJ B B]Í ' UWVd$u} FtU$T$ׅu,FtU$T$ׅuV1t E$D$d$^_]Í U WV}Sma $tD$ D$ D$`* D$$EtTut\}<& D$. F $D$Et$$X7t4$y$ [^_]Ív $fxߍ $Tx͍ $B$ [^_]fUS g` d$E@ t$^d$[]Ív D$ $z1fUS` d$EPt'T$@D$$zd$[]Í& P T$@D$$Pd$[]Ðt& Ud$]E 7Þ_ u$ut]u]t& ]u]Í UVSV_ d$ЋEED$ED$* D$ D$ED$E u$u1d$0[^]Ít& 4$D$ t@ @ @ EF E E$FuuF4$1P됍 Ud$ȉ}}]ux^ wN FD$ D$G $~VVFF tF
ɉ
t]u}]Í JE$QE]u}]Ít& ]u}1]ÐF$tߋF ;tGT$UD$ $UtFV:v uB$P1ZЍ UWVSe] d$ԋuFt0V D$ D$$v F$ F ;tYD$ |$$!tYVFt t4F~n҉_P$RQ븐B$Pt& 1d$,[^_]Ðt& F FVVt҉tkV U$NjUtpP $|$FD$$ ҉uW<$EREd$,[^_]ËP$R늋G<$P1Mt& ' Ud$؉]uGî[ } u$Xt!F FGF G G <$]u}]Í& ' Ud$؉]u>[ }ƍ $t @ @ p$]u}]Ít& Ud$ȉuu]}qZ ~ 8"V9z ~ID F ]u}]f~Wt^WNt2VF 19z BU$ UtB DfFHU$QU뺍t& GGt돍 ' UVSZ d$u4$%Ft҉ F t ҉tyFt ҉tWFt ҉t5Ft҉u FP$RF4$ d$[^]Ív FP$RfFP$RfF P$Rv& FP$RL& Ud$]u Y u4$1Ft҉u FP$RF4$ ]u]É' UVS_X d$u4$Ft ҉tWFt ҉t5Ft҉u FP$RF4$ d$[^]Ív FP$RfFP$R뛍v ' UVS&X d$u4$5F t ҉t7Ft҉u FP$RF4$ d$[^]Ðt& F P$R뻍v ' UVS?æW d$u4$Ft ҉t7F t҉u F P$RF4$ d$[^]Ðt& FP$R뻍v ' UVS&W d$u4$5Ft ҉t7F t҉u F P$RF4$ d$[^]Ðt& FP$R뻍v ' UVS?æV d$u4$F t ҉t7Ft҉u FP$RF4$ d$[^]Ðt& F P$R뻍v ' UVS&V d$u4$5Ft ҉t7F t҉u F P$RF4$ d$[^]Ðt& FP$R뻍v ' UVS?æU d$u4$Ft ҉t7F t҉u F P$RF4$ d$[^]Ðt& FP$R뻍v ' Ud$]u U u4$1Ft҉u FP$RF4$ ]u]É' UVS_T d$u4$Ft ҉t7F t҉u F P$RF4$ d$[^]Ðt& FP$R뻍v ' UVSFT d$u4$UFt ҉t7F t҉u F P$RF4$ d$[^]Ðt& FP$R뻍v ' UVS_S d$u4$F t ҉t7Ft҉u FP$RF4$ d$[^]Ðt& F P$R뻍v ' Ud$]u>S u4$QVt/V u F P$R4$]u]Ív FP$RfUd$]ugR u4$4$4$]u]Ív Ud$؉]u'ÎR u 9Ɖ}U} t"<$t,]}u]T$$uȋ]u}1]Ít& ' Ud$ȉ]uR u % 9Ɖ}E} t6E<$D$ ED$D$Bu21]u}]Ív ED$$'t믐t& <$t& t.D$ 4$ tUUPUP 땐t& }yE & Ud$ȉ]}.Q }uG$1t;G tGD$FD$$҉uVE4$RE]u}]Í& FD$$뻉' Ud$؋U]u$ËP B=t#D$#$=]u]Í& B $1t܍FD$.$҉uVE4$RE뫍t& UWVSP d$EU@ErRx1 ] MI M܃>~=<$ UB~1ҋL L R9u҉ MU܋L MĉU
Mԉ
M܋Uč|M;Ju{M xOUL };QuRU Q L T ҉uQE؉ $REyE@ 1d$L[^_]Í& UԉMċMԋ}ċT L T ҉t* d$L[^_]Í VE؉4$REt& QE؉ $REʼn<$sMA~UJ 1ҋqVut& L y >I L R9j UWVSN d$EU@EȋJr MMz@E؋RUE I y E }̃?~SMԉ $Eb UBMԅ~!u1Mԋu̐T T @9uu MԃM UM M܋umM؋Eԃ<}Ћ}DǍv 9MU}EfT@9|EЋUU܋E+Em }܋Ut}؍)Nj
8:E9E~TỦ}D v 9}ԍv~6UȋD uًBMĉ$P9}ԋMčvʋŨE̍d$L[^_]ËG<$PMA E Ӊ$FEt܋UB~1M̋}ȋT T @;Eu뒐UWVSnK d$ԋEU@Ez ?ug ~L1 v9u~?UB D P$Rp T D uʋBv$P9ud$,[^_]Í E$qtދu~1E} UD v9u~AG D P$Rpu}ft
1d$,[^_]ËG<$1Pwp' UWVSNõJ d$ԍ 9E} <$E E$Etn v D $tHMDv9uED$ $ UPW P d$,[^_]Ðt& Ut71d$,[^_]Í& D$ $*d$,1[^_]ËB$P1렋ED$8$-1띋M҉uQE܉ $RE]t& ' UWVSeI d$ċEU@E܋r zHBEE R }?~eEMЉ$DE؋M UBE~-Mu1Mu؍& T T @9uMuԋ Ex7
d$ԋuE $1t9F U܉<$ Ete }1} UD v9u D $u$ U 1d$,[^_]É4$| 4$D$Et4$SGD$ $`d$,1[^_]Ð}<$)n~ 1& T @9uED$ $ t`UxPx pU܃Pd$,[^_]ÐDvD$t$$B$P1EsUt F4$P1B$P֍v ' UWVS< d$ԋE $$Ǎ@$ 9E <$ EtY~g}1} fUD v9u~ID $uዻ$% U 1d$,[^_]Ít& }<$t΅~1v T @9uED$ $ trUxP pd$,[^_]Ðt& ED$$wt xvD$t$$)7B$P1;Ut F4$P1B$P& Ud$]u^: u" 9Ɖ}tHED$ED$D$E D$ D$ $u11]u}]fED$$ot띐t& E$tD$ 4$ tUUPx 뚋҉uWEԉ<$RE{v ' Ud$]un9 u! 9Ɖ}tHED$ED$D$E D$ D$ $u11]u}]fED$$t띐t& E$)tD$ 4$ tUUPx 뚋҉uWEԉ<$RE{v ' Ud$]u~8 u 9Ɖ}tHED$ED$D$E D$ D$ $u11]u}]fED$$t띐t& E$9tD$ 4$ tUUPx 뚋҉uWEԉ<$RE{v ' Ud$]u'Î7 u@ 9Ɖ}tHED$ED$D$E D$ D$ $u11]u}]fED$$t띐t& E$ItD$ 4$ tUUPx @ 듋҉uWEԉ<$REtv Ud$]u7Þ6 u` 9Ɖ}tHED$ED$nD$E D$ D$ $u11]u}]fED$$t띐t& E$YtD$ 4$ tUUPx @ 듋҉uWEԉ<$REtv UWVSNõ5 d$u= $Lul1t$
tOF uQVt:F u$t`$F t?F uFua1d$ [^_]Ív F ҉uP$R뒍v G<$P붋FtF ҉uP$R룐F ҉uP1$R냉' UWVS.Õ4 d$ u} 9E E E b ED$ D$ D$ E܉<$D$ED$ED$D$u1d$L[^_]Ðt& <$ 7 E9E t$E E9 $E E } { E 9 $ E$:D$ 4$E U9 PUԉP UЉPx@ d$L[^_]ÐEE c ED$$o| v ^v E9 $E E 1f/t$D$ $d$L1[^_]Ðt& tj dv EE t& t.놋
ɉ
JẺ$QE
Ud$]uWþ1 `# 9u}E tsED$D$E D$ D$ $ t`E11t$dtY1҉Uԉ4$UtmxP ]u}]fED$$p]u}1]Ít& tUB@Wt1녍t& t
ɉ
uJEԉ$QEvD$ $1Ut& Ud$؉uu]}x0 F=t PV$>lj]u}]Ð~ tQH+ t'~ D$<$t,F ]u}]f$ H+ uf1뜍t& $F u1끉' Ud$uu]Tû/ F t҉u F P$R4$]u]Ðt& UWVSu/ d$ԋE@ E@@pEG& D$ t$$p $n҉tWtCt`EU$҅t'UB;t;u4$%ut& d$,[^_]Ðt& WE܉<$RE똍& F4$P땐t& t
1d$,[^_]ËF4$1P룍t& ' UWVSe. d$ԋE@ E@@pEG& D$ t$$` $^҉tWuCt`EU$҅t'UB;t;u4$tt& d$,[^_]Ðt& WE܉<$RE똍& F4$P땐t& t
1d$,[^_]ËF4$1P룍t& ' Ud$ȉuu]}H- ~F u1]u}]ËP$RptD$ D$F$6tG$E7U
ɉ
t ut>F 1딍v JE$QEҋoG<$1PaG<$P뷍 ' UWVSu, d$ԋE@ E@@pEEU$҅ttExtkD$ |$@$[tY$]҉t t-uG<$P뜍t& VE܉4$RE܅uӋE@ d$,[^_]Ët
1d$,[^_]ËG<$1PЍv UWVS.Õ+ d$ԋUBU$E$NjUt@E~G1v D v9u~4BD U$Uuۋt[1d$,[^_]Ív B ;tD$ |$$Ϳ҉tǍd$,[^_]ÐW<$EREG<$1PUd$ȉ}}]uAè* G P$Rptp9FuED$ t$G$B҉uVE4$RE]u}]Í& 4$҉t t 렐t& ]u}1]ÐVE4$RE
Ud$]uw) u 9Ɖ}t@ED$^D$E D$ D$ $0u01]u}]ÐED$$t륐t& E$衽t$ 迾t*D$ 4$E Ut.xP @ 뇋vG<$P1huGUԉ<$PUԋ=B$P1/t& UWVSNõ( d$uF$Qug6t$tb虽F $込tNF $蟼t?VF FuB$P댍t& VuD$F $込fd$ [^_]Í ' Ud$ȉ$]u脾' }!1t0F 9t|$$ t 4$҉tU]u}]É<$T1t؉1GtJG G <$҉u& V4$ERE]u}]Ít& <$,1qUS谽' d$̍ED$=D$E D$ D$ $u1tEd$4[]Ív ' Ud$uu]Dë& Nt4$FtF ҉u P$R]u1]Ð& Ud$]uN& u4$a4$u4$1]u]Ív UWVES諼& d$E D$ ED$D$E $U E $tuud$<[^_]Í E$t^4$EԉD$ G }~ D v9u~UD$ T$$uًt= 1d$<[^_]Ív D$1 $Pd$<[^_]ËG<$1P(҉tR덍 VEЉ4$REߐUVS/Ö$ t& vЋu[^]US [\$ Y[itertools len() of unsized object O(O) O(n) O|O:groupby chain() repeat() O|n:repeat repeat(%s) repeat(%s, %zd) count(%zd) count(%s) imap() |n:product On:combinations r must be non-negative O|O:permutations fillvalue izip() ifilterfalse() ifilter() starmap() takewhile() dropwhile() islice() count() an integer is required cycle() O|n n must be >= 0 __copy__ itertools.tee_dataobject itertools.tee itertools._grouper itertools.cycle itertools.dropwhile itertools.takewhile itertools.islice itertools.starmap itertools.imap itertools.chain itertools.ifilter itertools.ifilterfalse itertools.count itertools.izip itertools.repeat key itertools.combinations itertools.izip_longest itertools.permutations itertools.product itertools.groupby from_iterable __reduce__ __length_hint__ imap() must have at least two arguments. repeat argument cannot be negative izip_longest() got an unexpected keyword argument izip_longest argument #%zd must support iteration izip argument #%zd must support iteration Stop argument for islice() must be a non-negative integer or None. Indices for islice() must be non-negative integers or None. Step for islice() must be a positive integer or None. ; Y D Զ $< d D t ĸ d( H Dt 4 Ի< $d t ļ d $ ĽD $l 4 D4 ` 4 T D t t t tL x t t $
TP
|
T
4 dd 0 p 4 D <
h
d T@ p 4 $0 ` p $ 4P D $ @ | < Dh zR | $ P AB
IyAA $ D I AB
JFt
A$ l s AB
IdAA ( 8 AB
I
AA A " AB
^ $ I AB
JFt
A$ I AB
JFt
A$ 0 I AB
JFt
A X 4" AB
^ ( x D AB
In
AA D $ ȵI AB
JFt
A$ I AB
JFt
A$ L AB
Ch
A A $ @I AB
JFt
A$ D hI AB
JFt
A$ l I AB
JFt
A$ I AB
JFt
A$ I AB
JFt
A$ I AB
JFt
A$ 0I AB
JFt
A 4 X" AB
^ T h# AD
] $ t xZ AB
IKAA 8 AG
EA
AAA D zAAA $ N AB
Ag
A D , k AB
A{
A H aA 0 0 J AB
JTU
AI H
A( d AB
B\
AA E H AB
JFe
AG Z
AE M
AB < AB
C
AAA F
AAA A ( b AB
JZy
A ( H 4\ AB
JYt
A , t h AB
JFq
AC ( AB
B
AA D $ ̽W AB
JH
A( AB
Bm
AA D ( $ xv AB
B[
AA F ( P ̾v AB
B[
AA F ( | v AB
B[
AA F ( tv AB
B[
AA F ( ȿv AB
B[
AA F ( v AB
B[
AA F $ , pW AB
JH
A( T v AB
B[
AA F ( v AB
B[
AA F ( Pv AB
B[
AA F ( n AB
JN
AD $ = AB
Jn
A 4 , u AB
J_]
AF c
A, d H AB
Jcs
AD , AB
JWS
AH ( h AB
Mo
AH < AB
C'
AAA H n
AAA G , 0 / AB
C
AAA A < ` AB
C
AAA G d
AAA A H lE AB
C
AAA F U
AAA H a
AAA A < p AB
C
AAA E
AAA E < ,
@5 AG
C
AAA G f
AAA G ( l
@~ AB
Bf
AA C (
AB
Bq
AA H <
B AB
FR
AAA B
AAA A ( ~ AB
Bf
AA C < 0 \ AB
F[
AAA A
AAA E , p ) AB
Ch
AAA G L AB
C
AAA A [
AAA B k
AAA B < AB
C
AAA E W
AAA F , 0 , AB
J[D
AC , ` AB
J[D
AC , AB
J[D
AC , l AB
J[D
AC , , AB
J[D
AC ,
AB
C
AAA D L P
AB
C
AAA F
AAA B
AAA F 8
\< AB
J`o
AC j
AE 8
` AB
JFr
AB t
AC $ K AB
JCy
A< @ AB
C
AAA F |
AAA A < AB
C
AAA F |
AAA A , AB
JFc
AA < \ AB
C
AAA A T
AAA A < 0 AB
C{
AAA D s
AAA B 8 p AB
JFd
AH m
AB , 0+ AB
J[}
AB ( 0 AB
CAAA < AB
MNH
AA b
AE H dV AB
APA ( l X AB
JCF
A $ = AB
Jn
A H q AB
Fe
AAA G
AAA D c
AAA A ` ` @ @ h ,
\ o T
d `
0 o
o o
o l
* : J Z j z
* : J Z j z
* : J Z j z
Functional tools for creating and using iterators.
Infinite iterators:
count([n]) --> n, n+1, n+2, ...
cycle(p) --> p0, p1, ... plast, p0, p1, ...
repeat(elem [,n]) --> elem, elem, elem, ... endlessly or up to n times
Iterators terminating on the shortest input sequence:
izip(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ...
izip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ...
ifilter(pred, seq) --> elements of seq where pred(elem) is True
ifilterfalse(pred, seq) --> elements of seq where pred(elem) is False
islice(seq, [start,] stop [, step]) --> elements from
seq[start:stop:step]
imap(fun, p, q, ...) --> fun(p0, q0), fun(p1, q1), ...
starmap(fun, seq) --> fun(*seq[0]), fun(*seq[1]), ...
tee(it, n=2) --> (it1, it2 , ... itn) splits one iterator into n
chain(p, q, ...) --> p0, p1, ... plast, q0, q1, ...
takewhile(pred, seq) --> seq[0], seq[1], until pred fails
dropwhile(pred, seq) --> seq[n], seq[n+1], starting when pred fails
groupby(iterable[, keyfunc]) --> sub-iterators grouped by value of keyfunc(v)
Combinatoric generators:
product(p, q, ... [repeat=1]) --> cartesian product
permutations(p[, r])
combinations(p, r)
Data container common to multiple tee objects. tee(iterable, n=2) --> tuple of n independent iterators. Iterator wrapped to make it copyable cycle(iterable) --> cycle object
Return elements from the iterable until it is exhausted.
Then repeat the sequence indefinitely. dropwhile(predicate, iterable) --> dropwhile object
Drop items from the iterable while predicate(item) is true.
Afterwards, return every element until the iterable is exhausted. takewhile(predicate, iterable) --> takewhile object
Return successive entries from an iterable as long as the
predicate evaluates to true for each entry. islice(iterable, [start,] stop [, step]) --> islice object
Return an iterator whose next() method returns selected values from an
iterable. If start is specified, will skip all preceding elements;
otherwise, start defaults to zero. Step defaults to one. If
specified as another value, step determines how many values are
skipped between successive calls. Works like a slice() on a list
but returns an iterator. starmap(function, sequence) --> starmap object
Return an iterator whose values are returned from the function evaluated
with a argument tuple taken from the given sequence. imap(func, *iterables) --> imap object
Make an iterator that computes the function using arguments from
each of the iterables. Like map() except that it returns
an iterator instead of a list and that it stops when the shortest
iterable is exhausted instead of filling in None for shorter
iterables. chain(*iterables) --> chain object
Return a chain object whose .next() method returns elements from the
first iterable until it is exhausted, then elements from the next
iterable, until all of the iterables are exhausted. ifilter(function or None, sequence) --> ifilter object
Return those items of sequence for which function(item) is true.
If function is None, return the items that are true. ifilterfalse(function or None, sequence) --> ifilterfalse object
Return those items of sequence for which function(item) is false.
If function is None, return the items that are false. count([firstval]) --> count object
Return a count object whose .next() method returns consecutive
integers starting from zero or, if specified, from firstval. izip(iter1 [,iter2 [...]]) --> izip object
Return a izip object whose .next() method returns a tuple where
the i-th element comes from the i-th iterable argument. The .next()
method continues until the shortest iterable in the argument sequence
is exhausted and then it raises StopIteration. Works like the zip()
function but consumes less memory by returning an iterator instead of
a list. repeat(element [,times]) -> create an iterator which returns the element
for the specified number of times. If not specified, returns the element
endlessly. Returns an independent iterator. combinations(iterable, r) --> combinations object
Return successive r-length combinations of elements in the iterable.
combinations(range(4), 3) --> (0,1,2), (0,1,3), (0,2,3), (1,2,3) izip_longest(iter1 [,iter2 [...]], [fillvalue=None]) --> izip_longest object
Return an izip_longest object whose .next() method returns a tuple where
the i-th element comes from the i-th iterable argument. The .next()
method continues until the longest iterable in the argument sequence
is exhausted and then it raises StopIteration. When the shorter iterables
are exhausted, the fillvalue is substituted in their place. The fillvalue
defaults to None or can be specified by a keyword argument.
permutations(iterable[, r]) --> permutations object
Return successive r-length permutations of elements in the iterable.
permutations(range(3), 2) --> (0,1), (0,2), (1,0), (1,2), (2,0), (2,1) product(*iterables) --> product object
Cartesian product of input iterables. Equivalent to nested for-loops.
For example, product(A, B) returns the same as: ((x,y) for x in A for y in B).
The leftmost iterators are in the outermost for-loop, so the output tuples
cycle in a manner similar to an odometer (with the rightmost element changing
on every iteration).
product('ab', range(3)) --> ('a',0) ('a',1) ('a',2) ('b',0) ('b',1) ('b',2)
product((0,1), (0,1), (0,1)) --> (0,0,0) (0,0,1) (0,1,0) (0,1,1) (1,0,0) ... groupby(iterable[, keyfunc]) -> create an iterator which returns
(key, sub-iterator) grouped by each value of key(value).
chain.from_iterable(iterable) --> chain object
Alternate chain() contructor taking a single iterable argument
that evaluates lazily. Return state information for pickling. Private method returning an estimate of len(list(it)). z^ . A ` ^ [ A ` Z p& @Z ^ . A " ^ - E 0 X pW ^ - E @ T J ^ , E T I ^ 0, E P L ^ + E ` V H _ 0+ E P U 6 _ * E ` K @ . ._ 0* E @ 0 R G @_ ) E Q F W_ Q 0 P ` O g_ 0) E ` 5 PE v_ 0( 0 E P @/ _ > E 7 P= _ ( E A @C _ < E P3 ? _ @< E @ P1 : _ @' E # " ^ @[ _ _ _ ^ _ ^ q^ % _ ! ` @!
` itertoolsmodule.so.debug N2ɂ .data .rodata .shstrtab .dynamic .note.gnu.build-id .eh_frame .gnu.hash .fini .gnu_debuglink .dynsym .gnu.version .rel.dyn .data.rel.ro .gnu.version_r .jcr .eh_frame_hdr .dynstr .ctors .dtors .bss .init .rel.plt .got.plt .got .text " $ ? o < ^ T T ` d f o
o
0 s
0
0 P 0 0 E I \ \ 2 ] ] a a 5 d d | L l l 4 4 , ` ` @ @ `* O