ELF > `+ @ @ 8 @ > > ؐ ؐ ؐ $ $ Ptd u u u Qtd GNU /$Si8&/ \E A A @ A C E |CEqX 3O ( r V & Y 9
+ * 2 F y Z " O r ) p J i M k b
8
} ` L 9 @ ( p ? 6 __gmon_start__ _init _fini __cxa_finalize _Jv_RegisterClasses inititertools PyType_Type Py_InitModule4_64 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.2.5 / ui Q @ H ` P X ` @ h p x ` @ ` А А ^r C 0 8 P- @ - 8 wr P o Ю خ . n ; X n د r B x , `8 x r PB . @ m k r 0 A / 0i 8 ^ r д pA P @ X / 0h ص ] X r p 0A 0 0 x ` r @ 0 k \ r P@ 0 ` 8 P1 ` @j J 8 s P ? л ػ 2 _ X @C ؼ s p? p x 3 g \ x $s ? @ P4 @ f [ ;s 0 e X E e 8 c Ks > P X 4 I Y X Zs p = D @ 05 P5 ( ` x C os R 3 L @Q s > 0 8 5 ` U pW 8 s P P p3 pG X S s PP p x 2 E N x s < 0, @ p9 7 r @o ` @ s H ks ` s h r s r Ur 0; s p7 ` s ( 07 8 ` s h 6 x @ h p x
" + 0 & P & & & 0 & ж & p & & & P & & & 0 & & p & & & P & & ` @ ` ` 8 س x X 8 x X 8 ؒ
( 0 8 @ H P X ` h p x ! # $ % ' ( ) ȓ * Г , ؓ - . / 1 2 3 4 5 6 7 ( 8 0 9 8 : @ ; H < P = X > ` ? h @ HO H H5j %j @ %j h %j h %j h %j h %j h %zj h %rj h %jj h p%bj h `%Zj h P%Rj h
@%Jj h 0%Bj h %:j h
%2j h %*j h %"j h %j h %j h %
j h %j h %i h %i h %i h p%i h `%i h P%i h @%i h 0%i h %i h %i h %i h %i h %i h! %i h" %i h# %i h$ %zi h% %ri h& %ji h' p%bi h( `%Zi h) P%Ri h* @%Ji h+ 0%Bi h, %:i h- %2i h. %*i h/ %"i h0 %i h1 %i h2 HHg HtHÐU= HATSubH=g t H=/e H kd L%\d H L)HHH9s D HH͢ AH¢ H9r [A\f H=d UHtHsf HtH=c @ ÐH\$Hl$HLd$HHHIHt HՅubH{Ht LՅuPH{ Ht LՅu>H{(Ht LՅu,H{01Ht!LHH $Hl$Ld$H H $Hl$Ld$Hffff. H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D AUIATUHSHHHHt HՅuKCE1~!IcH|(Ht LՅu*AD9cH{ 1HtHHL[]A\A] H[]A\A] D UHSHHHtHE HHHHtU~H1 @ 9]~8HcHH|HtHD HHHHuHGP09]H} Ht HE HHHHuHGP0H1[]HGP0ufff. HHHt H 1 D H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D HHHt H 1 D ATUSHoHHW0H9WHEL >f D HS0HH9SHS0~&HAHt[HHHHuHPHR0HK Hu>HAHt+HKHC0HHS(H9HS~HS HSf. []A\ 1H9[]A\fff. H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D SHH1H0 HtHXH@ H[f D HHHHuHSHD$HR0HD$ff. H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{ 1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{ 1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{(1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D H\$Hl$HLd$HHHIHt HՅu*H{ 1Ht LHH $Hl$Ld$H D H $Hl$Ld$H D HHHt H 1 D HW1H t~HHWHGH HGfff. H\$Hl$HLd$HH HIHt HՅu:H{(Ht LՅu(H{01Ht LHH $Hl$Ld$H H $Hl$Ld$H D ATH57Z Hk^ A USH H\ HHHH5Ŗ H=: H?v "HHtML$$MtQH2 I|$. I$HpLHL#HMtLyHĐ []A\ÐH=u xH=Yw xHĐ H=x []A\f HHHtHf Hy[ H59 H81H HWHH9tHwH=9 1 HWHwH=9 1fSHHtHtHH[3 [fffff. SH
HHHHl9 HHZ LD$IH$1zu1HH[ 1H0 HHtH@ H@( H@0 H$HCH$H H|$HHCuHHHHuHCH1P0ffff. Hl$H\$HLd$H(H_H{0 tHs(H} ]~aH{(HC0HC0 HtHC( HHHHt H\$Hl$Ld$ H(f HWHD$R0HD$ D 1 @ H{WHItH{H;=Y tEH11HHtHs(Lc0FI$HHI$uID$LP01`H H @ ATUSHH D Hs(Ht(H{ H P H{HH H{H;=X t]1H1HtlH{(HC(HtHHHHt@H{0Hk0HoHHHH\HGP0PH f. HGP0 HE HHHE 1H[]A\ D Hs(HH{ Lc(HLc tHHHHtvLc H=u HHtHXHHL`I$oHs(H1 HU HHHU qHUHHD$R0HD$H[]A\HGP0HEHP01:H\$HH=r Hl$H#HHt&HCHH HCHECHE EHH\$Hl$H H\$HH=p Hl$HHHt @ H@ HHHXlHH\$Hl$Hf. H\$Hl$HLd$Ho82LgA9l$~dHcID(H CH $Hl$Ld$H @ HoLe MtcI$Le HSHHHHt7LcC 1A9l$I|$HtHcAD$ID( @ H{HGP0 H}HIHE tf SHHCHtHHHH HCHtHHHH HC HtHHHHt_HC(HtHHHHt7HC0HtHHHHu H{0HGP0HCH[H@ H{(HGP0 H{ HGP0 H{HGP0i H{HGP05SHHCHtHHHHu H{HGP0HCH[H@ SHHC HtHHHHt_HC(HtHHHHt7HC0HtHHHHu H{0HGP0HCH[H@ H{(HGP0 H{ HGP0 SH'HCHtHHHHt7HC HtHHHHu H{ HGP0HCH[H@ H{HGP0ff. SHHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHGHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHgHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHHCHtHHHHu H{HGP0HCH[H@ SHGHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHgHCHtHHHHt7HCHtHHHHu H{HGP0HCH[H@ H{HGP0ff. SHHSHHHHt,HSHHHHu H{HGP0H[ D H{HGP0ff. SHHH[ff D Hw H\$Hl$HHHH9t0HHt6HHl$H\$HH:f. H=- Hu1H\$Hl$Hfff. UHx HSHHH9H$t0HT$H5U- 1HHu+1H[]f. H=!- Ht HHt21H0 HtHT$HHT$HPH$HPf D H<$ yH$ UHSHHH1Ht?HUHtBHs$H=, 1HHHHuHSHHD$R0HD$H[]f D Hs$H=Y, f D SHHHwH9tHH=D, 1[U D HH1Ht3Hs$H=$, -HHHHuHSHHD$R0HD$H[ @ AWE1AVAUIATUSHO(H_Lg Hk
Me I<$LwM~RHHI HIE ~ 1 ITHITHH9uI$HHI$ II K HuHHTHHH;B IlMt*fIxSHE JTHIHHE HH;BuXH HBH I>IHHHHuHGP0IyAE( E1 @ HL[]A\A]A^A_f D HDIH K|KDHHHHtI @ ID$LP0HGP0HHItHIE ~HS1Hz ue @ HTHz QHRHITHH9AW1AVAUIATUSHw8LH_HW Lw(Ho0Mg{ M M I>L~YHHT$HHT$u HIE(~"1f ItHHtHH9uIHHI HH* L N I HHI udIt$LDLH9N }H @ HLH HH9|LMH)HI IML HIIHtI)N H9JI3H
I H2~[LlI @ IIL9~@JITHI} IU HHHHuHWIH$IR0L9H$H H[]A\A]A^A_INLH$HT$Q0HT$H$AE8 1H{HtHIE(~1H ILHHLHH9ufffff. AUATIUSHLoHo M H} u{MHE ~]1f. HI9~FID$H|HG H H|HDHHHHuHGHP0I9HH[]A\A] LHHtM~1 HDHI9~ID$H|HG Huf HE HHHE tH1[H]A\A]HEH1P0mfffff. AVHn AUATUHSHHH9 HHI HxHItiA fJ|HtAKDIM91H0 H L`HSHHPH[]A\A]A^fI$HHI$t41H[]A\A]A^HF H5j( H8ZH1[]A\A]A^ID$LP01H=% HM1I$HHI$uIT$LHD$R0HD$Wf D AW1AVIAUATUSHLgH_Lo Ho(0M|$ M I} L~NHH HIF ~ 1f D ILHHLHH9uIU HHIU HHx?LIOI0H9uSHLI H1LIIHH9u*HyAF0 1f. H[]A\A]A^A_ÐLrHI0L9L~ D HtHH4HH9H9~^Llf D IL9L~EIHITHI} IU HHHHuHWIHD$R0L9HD$LH H[]A\A]A^A_ @ IULHD$R0HD$HH
HIF ~1 H ILHHLHH9u AW AVAUIATUHSHH8HHD$( L{IHHD$HHI H|$sHIt0E1MQKDK IM9~:J|HuLM 1H8[]A\A]A^A_f L;t$}3LL)IDf D HHJHK IL;t$|1H0 HtLhL`H@ @( H8[]A\A]A^A_H $ 1HD$ HD$HINHL$LD$(H
" HL1t}I$HHI$tSHD$(H 1HD$ E1 D IE HHIE IELP01ID$LP01I$HHI$ID$LP01HCB H5# H81m D SHgHCHtHHHHt?HC HtHHHHu H{ HGP0H{HCH[H@ fH{HGP0 SHHCHtHHHHtOHC(HtHHHHu H{(HGP0H{H{ zHCH[H@ f H{HGP0 H\$Hl$HLd$Ll$H8HLL$HH
| H 1IH$ u 1H\$Hl$ Ld$(Ll$0H8 H<$HItH|$LhHxtH`HH 1H|$ ~f. HD HH9D$1H0 HtxL`HhH@ HT$HP(1L9l$P0QH6@ H5U H8M0I$HHI$ID$LP01 H SHHCHtHHHHt?HC HtHHHHu H{ HGP0H{HCH[H@ fH{HGP0 H\$Hl$HLd$Ll$HLt$L|$HHH-y? HLL$H
z H` 1IH$ Hl$u(1H\$Hl$ Ld$(Ll$0Lt$8L|$@HH H<$HItH|$L`H9 HH H J< MH< I=HI M 1M~IHL9uHt1 @ LH)IT HH9u1H0 H 1L9LxLpLh H@( Hh0P8 LE HuH= H5 H8PMIHHIIGLP01 MtLMtLfffff. Hl$H\$HLd$Ll$Lt$L|$HHLwLg(Mu.E1LH\$Hl$ Ld$(Ll$0Lt$8L|$@HH D H tI<$ MI$ ~18 D LHt[I|IDHHHHt2HI9zHE L{NlMuHE0H HE0 D HGP0 HEHHHEtQ*HuGHE0H HU HE0JD IU HHIU \IULHD$R0HD$CHE I$HHI$ID$LE1P0f D L@HIM1& LHt3IDHI9fHE L{NlMuHE0H HE0ΐHEHHHEM&H?HE0H HU HE0JD IU HHIU uIULHD$R0HD$gf. AWAVAUATIHUHSHHQHItH: H9C L5 ; L)HHt]M E1 JDIM9 J|HuH-: H} / HHHH 1H[]A\A]A^A_ HHgH5~ H HItHpHEH : H5 H8H1[]A\A]A^A_ L@HH]M~!H : 1f D HHTHL9u1LA$0 HtXHX LhLhHh(ILp0H[]A\A]A^A_ D H} IWH5y 1HCHP01HHHHt&HE HHHE HEHP01HCHP0 AVAUATIHUHSHGIHg I9 L,HHt\M~gE1f. JDIM9~JJ|HuH-8 H} 3 HHHH 1[]A\A]A^ D LHHtM~%Ht8 1f. HHTHL9u1LA$0 HthHXLhHh []A\A]A^ H=9 Hq @ H} IVH5 1::HCHP01>HHHHt&HE HHHE HEHP01 HCHP0 H9c H\$Hl$H8HHH9t@LL$LD$H5 1 Hu/1H\$(Hl$0H8f D H=P Ht H|$NHHt1H0 HtHT$HHT$HXHPHHHHuHSHHD$R0HD$qf D H` H\$Hl$H8HHH9t@LL$LD$H5 1 Hu/1H\$(Hl$0H8f D H= Ht H|$nHHt1H0 HtHT$HHT$HXHPHHHHuHSHHD$R0HD$qf D HZ H\$Hl$H8HHH9t@LL$LD$H5 1 Hu/1H\$(Hl$0H8f D H= Ht H|$HHt1H0 HtHT$HHT$HXHPHHHHuHSHHD$R0HD$qf D HV H\$Hl$H8HHH9t@LL$LD$H5 1 H;u/1H\$(Hl$0H8f D H= Ht H|$HHt1H0 Ht HT$HHT$HXH@ HPHHHHuHSHHD$R0HD$ifffff. HIT H\$Hl$H8HHH9t@LL$LD$H5 1 HKu/1H\$(Hl$0H8f D H= Ht H|$HHt1H0 Ht HT$HHT$HXH@ HPHHHHuHSHHD$R0HD$ifffff. USHHA D HH zHtH2 H8VtlH{HulHCHtSH{HuHZHHt~HHCHE HHHE tUH{HxH{Huw 1HH[] @ HC HHHHyHGP0mHEHP0H{HtHC HHHHuHGP0 HC HHHHuHG1P0iffffff. HIU H\$Hl$Ld$Ll$HLt$HhH9HHD$0 HD$( HD$ j HD$ LL$0LD$8H5 HD$HD$(HH$1u&1H\$@Hl$HLd$PLl$XLt$`Hhf D HH& H|$0L-0 1L9tHHi H|$(L9 HI HH?Ic [ H|$ H L9 HI H H|$8HI 1H0 HH LpHhL` Lh(H@0 fHIH?j D H=c Hiz @ A t D H|$0L-/ L9twHI 11f +HtHR/ H5[ H81@ @ Hf{}f D I1fH/ H5 H8z1Ht4H. H5V H8N1IHHIIVLHD$R0HD$ff. UH\ SHH(H9HD$ tbLD$H5+ 11 HtTH|$11HtnHHtE1H=[ HtjHXHhH([] H=
HuH(1[] @ Ht1Hl$HE tFHE Hf D HtHU HHHU uHUHHD$R0HD$oH- H5
H81Rfff. H\$Hl$HHHHH9t HGHl$HCH\$HAH{ taH5Bi Ht-HkHHtHIt[H>I$HHI$t-uHE HHHE tXHC 1|f IT$LD$R0D$HE HHHE GHEH1P08 D HEHP0 @ AVAUATUHSHLgID$L LAHHtjH} tcH}1H1[HI HWIHHItHtZHHHHuHCHP0LAHHu D HH[]A\A]A^ IVLD$R0D$uHE HH[]A\A]A^fHHHHt1HH[]A\A]A^HCH1P0뉐AUATIUSHHjHIHHtBM~R1f D HDHI9~:ID$H|˽HuHHHHtc1HH[]A\A] I|$H;=' t1H踿HHHHuHSHHD$R0HD$HHH[]A\A]HCH1P0f D UHSHHHG HHtqHb' H9Cu{ HSHHD$R0HD$ِUHSHH@ HtH 3 HHHuH[ÐH菺H 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 p @ и ` й( @P `h ` м@ @h p0 H ` @ 0 p H p p 0 @ @` @ p@ ` `
(
X
@
X P P
(
P
Pp
P
@ ` @ 0 0` 0 ` P `X p p @ ` P P h ` zR x $ x MI q
I R $ D k MI {
G R L l H{ BEA D(G0L
(G ABBE D(A ABB , x ADD
CAA $ k MI {
G R $ , Xk MI {
G R $ T k MI {
G R | 4 BAA
ABD HAB $ xk MI {
G R $ k MI {
G R $ U AL [
AG $ D @k MI {
G R $ l k MI {
G R $ зk MI {
G R $ k MI {
G R $ `k MI {
G R $ k MI {
G R $ 4 k MI {
G R \ 8 t @$ $ X{ MI M
E R < BZA G
AABB g HAB `= DN
N \ > , " AW
H A $ L A[ g
AD $ t P MI0`
J D 8 BAA G0
AABF
AABA ] HP D V HP } $ $ 0 MI u
E L A
L l = As ؿ Ac
L He AK
L e AK
L e AK
L 8e AK
L , e AK
L L e AK
L l (= As He AK
L e AK
L e AK
L 8U A}
J x AT $ , xt U l
O c , T AKG0p
AAK , `z ADD0V
AAG , | AN M
JJ JA L BEB E(A0A8D@(
8D0A(B BBBG L 4 " BDB E(A0A8DP
8A0A(B BBBA L " BBD A(D0
(D ABBD e
(C DBBA l `: BIB A(D0G@|
0A(A BBBC W
0A(A BBBA Z
0C(A BBBA d D 0 BDE B(A0A8DP
8A0A(B BBBB
8A0A(B BBBE d ; BGB E(A0D8Gp
8A0A(B BBBJ e
8A0A(B BBBA
m AT
K 4
} A]
R $ T
PY MN@I
D |
m AT
K $
M[P\
D $
V MXPu
F |
BBB B(G0D8G@
8A0A(B BBBD T
8C0A(B BBBH h
8A0A(B BBBF L l x BBB G(D0
(A BBBF Y
(A BBBH U@D
G U@D
G H U@D
G U@D
G < U@D
G , \ A AAG
DAE $ ^Ip
G 4 $ AHG@j
AAD W
CAE $ MD i
F y
G
00 Aj L 4
@ BBB B(D0A8D@
8D0A(B BBBG L
BBB B(D0A8D@
8D0A(B BBBG $
HN0c
G l
BBB A(D0D@
0D(A BBBI e
0A(A BBBC U
0D(A BBBA L l 8 BBD A(D@b
(D ABBH B
(D ABBA 4 ADD0X
AAE l
CAH $ P" Z0D
B $ X ADD AA4 D AAD0F
AAB h
AAF | ; D v ; Ay AT D n AMD@G
DAB
ADE \
DAA ` @ ` @ ` А / (
p o
] @#
o
o o o ؐ 6( F( V( f( v( ( ( ( ( ( ( ( ( ) ) &) 6) F) V) f) v) ) ) ) ) ) ) ) ) * * &* 6* F* V* f* v* * * * * * * * * + + &+ 6+ F+ V+ 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)). ^r C A P- - wr ( o A . n ; n r B A , `8 r ( PB E . m k r ( A E / 0i ^ r ( pA E @ / 0h ] r 8 0A E 0 0 ` r @ E 0 k \ r P@ E ` P1 @j J s ? E 2 _ @C s p? E 3 g \ $s ? E @ P4 f [ ;s e E e c Ks ( > E 4 I Y Zs = D E @ 05 P5 ` C os 8 R E 3 L @Q s 8 > E 5 U pW s @ P E p3 pG S s 0 PP E 2 E N s 8 < E 0, p9 7 r @o ` s ks s r s r Ur 0; s p7 ` s 07 s 6 @ itertoolsmodule.so.debug S .data .rodata .shstrtab .dynamic .note.gnu.build-id .eh_frame .gnu.hash .fini .gnu_debuglink .dynsym .gnu.version .rela.dyn .data.rel.ro .gnu.version_r .jcr .eh_frame_hdr .dynstr .ctors .dtors .bss .init .rela.plt .got.plt .got .text " $ ? o < ^ ] f o o
s
@# @#
( ( ( ( @ `+ `+ E I p p 2 p p u u 5 x x } @ @ ؐ ؐ h h X : O