ELF > V @ @ @ 8 @ I I P P P HG HG ] m m @\ ` 8] 8m 8m 8 8 8 $ $ Ptd ) ) ) \ \ Qtd Rtd ] m m GNU dS$'?=t C L $ r@!` * JP\^I
l ǀ D Q!@" +L O P R S T W X Z \ ] _ ` a b e g i l o p r s u w y z { } hf8$טd# F\LVdʆ%/#U)z #pdX;U !Ȣq'c5!
v
c|
b̚q.JU13{ xAQ&(UҬMMf*1 F,a#$8 1eP̏PF1=uSɔ` τB> -ܲ
)H G`.tYr& t ưWt˳H
Ҿ9V l:.ӋDt^Y֯2 j p I { k v
a e
Z y , L 5 n
( 8 u + #
Y 2 " M L " T M t p F
9 P |
B [ `Y S 4
> * @ s 3 n ` r `
`s : J ? a ^ R к H n Y o D a I @c ' U Q U \ {
P S 1 p 3
o H @ u 0 & f P
` w r O L
p
# 7 Ъ
p ` U : ` f Z h x K
f > @ k
M B ) } P { B ` M ) 0 @ __gmon_start__ _fini _ITM_deregisterTMCloneTable _ITM_registerTMCloneTable __cxa_finalize NyMutBitSet_hasbit NyImmBitSet_hasbit _NyImmBitSet_EmptyStruct _Py_TrueStruct _Py_FalseStruct _Py_Dealloc NyUnion_Type _PyObject_NewVar memmove _Py_NoneStruct PyLong_AsSsize_t PyExc_IndexError PyErr_SetString PyLong_FromSsize_t immbitset_int PyMem_Malloc _PyLong_FromByteArray PyMem_Free PyErr_NoMemory PyExc_OverflowError PyNumber_Invert immbitset_iter NyImmBitSetIter_Type _PyObject_New PyObject_Free PyUnicode_FromFormat PySequence_List PyExc_TypeError PyUnicode_FromString PyObject_Realloc PyObject_InitVar NyAnyBitSet_iterate NyImmBitSet_Type PyType_IsSubtype NyMutBitSet_Type PyErr_Format PyErr_Occurred PyTuple_New PyBytes_FromStringAndSize NyImmBitSet_SubtypeNew NyImmBitSet_New PyExc_ValueError PyTuple_Size _PyArg_ParseTuple_SizeT NyMutBitSet_setbit NyMutBitSet_clrbit NyMutBitSet_SubtypeNew NyMutBitSet_New cpl_conv_left cpl_conv_right PyObject_GetIter PyIter_Next _PyLong_Frexp _PyLong_AsByteArray NyMutBitSet_clear mutbitset_iop NyCplBitSet_Type PySequence_Check PyDict_Next mutbitset_iand mutbitset_ior NyImmBitSet_SubtypeNewArg memcpy _PyArg_ParseTupleAndKeywords_SizeT mutbitset_isub mutbitset_ixor NyMutBitSet_pop NyCplBitSet_SubtypeNew _NyImmBitSet_OmegaStruct cplbitset_new NyCplBitSet_New PyLong_AsLong PyBytes_AsStringAndSize NyMutBitSet_AsImmBitSet mutbitset_iter PyNumber_Long NyCplBitSet_New_Del _Py_NotImplementedStruct NyAnyBitSet_length pos_add_check sf_slice PySlice_Type claset_load cplbitset_traverse generic_indisize mutbitset_indisize anybitset_indisize fsb_dx_nybitset_init NyBitSet_Type PyType_Ready PyModule_GetDict PyDict_SetItemString PyCapsule_New fsb_dx_addmethods PyObject_GetAttrString PyType_GenericNew PyObject_GenericGetAttr PyType_GenericAlloc mutbitset_is_immutable_doc immbitset_is_immutable_doc bitset_doc PyLong_AsUnsignedLongMask NyImmNodeSetIter_Type _PyObject_GC_New PyObject_GC_Track nodeset_get_is_immutable NyImmNodeSet_Type PyObject_GC_UnTrack _PyTrash_cond PyObject_GC_Del PyThreadState_Get _PyTrash_begin _PyTrash_end mutnodeset_iter NyMutNodeSetIter_Type NyNodeSet_setobj NyMutNodeSet_Type NyNodeSet_Type PyObject_RichCompare NyNodeSet_iterate NyNodeSet_clrobj NyNodeSet_hasobj NyNodeSet_invobj NyMutNodeSet_SubtypeNewFlags NyMutNodeSet_NewFlags NyMutNodeSet_New NyMutNodeSet_NewHiding nodeset_indisize nodeset_traverse nodeset_relate NyNodeSet_clear NyImmNodeSet_SubtypeNew memset NyImmNodeSet_New NyImmNodeSet_NewSingleton NyMutNodeSet_SubtypeNewIterable PyNumber_And PyNumber_Xor PyNumber_Or PyNumber_Subtract NyImmNodeSet_SubtypeNewCopy NyImmNodeSet_NewCopy NyNodeSet_be_immutable NyImmNodeSet_SubtypeNewIterable fsb_dx_nynodeset_init PyCMethod_New PyInit_setsc PyModule_Create2 PyExc_ImportError sets_doc libpthread.so.0 libc.so.6 GLIBC_2.14 GLIBC_2.2.5
ui
m `X (m X 0m 0m 0 @ P ` h x x `x w w
s ȟ ؟ v `e & 0q 1 C @| G Ƞ P ؠ { N z T 0 { V ( 8 z @ \ H X `z ` c h x y k p y o @y Pk @ c H Ю X y ` & h n x 1 آ m H ^ P ^ X h p ` x b d ( x k c y & Ȥ pm ؤ 1 ( P ^ x c 0 pc ا p^ ` Ш Pl d P | h @ ة @ H ` h p ^ ( f 0 0 8 H P ` X ` s 0 ^ X d ` h x @j `~ Ȭ @ ^ 0 Z X 0f ` h @ p x Z Ȯ 8 ` ^ H [ P X h p ` x X + + 4 V ] ] C ` G @ N ( p 8 @ T H X ` V h x \ P k ` o ȷ ط ( h 0 p H ? ع 8 j P غ 0 ػ ~ ( 0 p x p 0 ` x ؽ P m X ` 8 P p 0 ` X 8 p ` x p 0 p 0 ) o R o o w 0 w o (o Z 0o P P 8o b @o Ho Po Xo `o T ho # po ] xo % o ) o [ o p P p p p o 0 o ^ o 5 o o 6 o V o o < o D o o H o o v r 0 8 @ S H h ' ' 0 ' ' ' ' P ' ' ' P ' x f Щ 1 0 1 0 1 1 P 1 1 @ @ ` _ O 8 m Y Y خ l d X X ` } h p x e W ~ X ~ U ȹ h Ƚ ` M { p c s p p O (p S 0p a 8p @p Hp Pp L Xp `p hp pp xp p p p
p p p
p ~ p p o p p p P p p p p q i q q q q (q \ 0q 8q @q Hq Pq Xq j `q hq pq ! xq r q " q u q $ q % q & q v q ( q U q * q + q , q - q . q q z q / r r r h r | r 2 (r N 0r 3 8r 4 @r Hr k Pr Q Xr `r 7 hr 8 pr xr r 9 r : r x r ; r r r d r = r r > r ? r @ r r A r B r C s s y s E s F s n (s 0s G 8s H @s I Hs J Ps Xs K HHm Ht H 5 % @ % h % h % h % h % h % h % h % h p% h `% h P% h
@% h 0% h %z h
%r h %j h %b h %Z h %R h %J h %B h %: h %2 h %* h p%" h `% h P% h @%
h 0% h % h % h % h % h % h! % h" % h# % h$ % h% % h& % h' p% h( `% h) P% h* @% h+ 0% h, %z h- %r h. %j h/ %b h0 %Z h1 %R h2 %J h3 %B h4 %: h5 %2 h6 %* h7 p%" h8 `% h9 P% h: @%
h; 0% h< % h= % h> % h? % h@ % hA % hB % hC % hD % hE % hF % hG p% hH `% hI P% hJ @% hK 0% hL %z hM %r hN %j hO %b hP %Z hQ %R hR %J hS %B hT %: hU %2 hV %* hW p%" hX `% hY P% hZ @%
h[ 0% h\ % h] % h^ % h_ % h` % ha % hb % hc % hd % he % hf % hg p% hh `HHHWI9v#HPHHHt HuII9wm# # HHHWI9v#HPHHHt HuII9wE% ^% I9 HHHtHHH I9w HAI9wӟ I9 HHHtHHH I9w HAL9r鴥 H=q Hq H9tHF Ht H=yq H5rq H)HH?HHHtH Htf D =9q u/UH= Ht H= -hq ] {f. LG Mt I90 HG(HxHP LGII D H;2t, LHH)HH?HHHHHH9uLJLBL fI;0tK~iHLL)HH?HHHHIL9uI9sI;0INE1I9vH97LDL @ M9 LFLIH` D LI HHF?HHIHHHH)yH@H HIHtL#Pf. 1ff. fHHF?HHIIHIH)yH@IHGA HW ILHIILf L;tK~YHHH)HH?HHHHHH9uH9sL;HN1I9v(L;t+f. I9v(1L#RÐHH H1L#R1HHG@ -n Hf D HGHO HPHʗ HHH9 HH)H!H/ HHfHH @ oO(oW8H o_flfoflfH9ufoHfsHffH~H5V HqH3AH3H9vHq H3AH3AH9vH3A(H3A HHHHHHHHHHHHHtøV Hff. 1H;=O AWAVAUATUSHt$LD$ HIH;|$h 11L;d$p I|$ID$I AL= L-ҳ H9 f H9 HH9 IA uLZLBLHHXI9u L;d$ LI9u H;l$} IʃwEOcL MAf. [ ]A\A]A^A_LIIE1II!MuH9 LLH9QH9 L@HXI9u L;d$0 wsKcLfLIIE1HI! @ LIIE1I1 LIIE1I n @ HOHWH L;d$11L D H H9v3L@LHI9uL9d$wvwHcHMLH9w[1]A\A]A^A_fLIIE1 LZLB1|f LULEH u I|$MD$I w D I|$MD$I D I|$ID$I D HH HHHf D HGH f. H H @ H H @ UHHH/tHEH@ -j ] @ ߐAWAVAUIATUSHHo(H} 4Lu HHCHHHI] HL[]A\A]A^A_ HuIH=2 MHHtuL}Lp Hu LLxLH61M~ HHHHT8HI9uI\$(ID$ Hm YH>Lf E1N AUATIUHSHHH L-z L9t HG WHu}H{L9tHHG 2H{HE L9t6HG t`I$1H[]A\A]fH{HE L9uHI$H1[]A\A]H H5¯ H8f D 뤐HG(Hx HGHwH;p}rHHO HHHB(Huf HHtLB IIHtHHO L% D H1HwHO L
f. 1ff. fAVAUATUSHGH_ HHHH9 H L`HMl$I9 HI9 N4 LrHH 1MuL H1ɺ LHI[L]A\A]A^ HD HPI9tHH;uHSHHT HPI9uf D [1]A\A]A^E1[]LA\A]A^ @ H H5b E1H8 of. H H5 E1H8GfATUHHpHt;HH0Hm ItHL]A\ H HL]A\ D E1HL]A\fSHH=% HtfHXH@[f UHHH/tH]f H]fUHS1HHWHH^ fInfInflID$H LIl$ EH]A\A]A^ I,$u
LHtHm tMMtI.t2MtIm tHE1]LA\A]A^ @ Lf D Lf D Hf D MtI,$uf. H;= uHt*H0 HtY H@H H H ff. UIISHLG(I@IX HhHLH9 H1 HQHyH9v H HxHHH9rH H9rL;
tdL$IHtJH9vE1 D HKHCH9v( Hx tHo HHBD HH9rH H9rHL[]HH)H uH)HH9uM@8I9pvI IB 111Tf AWH5O AVAUATIUH/ A|$ A HI ILIHuH} IHvIMt}M Mt`Ht[H[ fInfInflID$H M|$ AGHm t]LA\A]A^A_ H ]LA\A]A^A_ I,$u
LMtI/tFMtIm t*MtI.tE1f. Lf D Lf D Lf D E1\ MtI,$uvff. @ HH= AWAVAUATUSHH H HIH9 HFH1H)HHLcU I9L M HHG?HHIHHHHt$H)y
HH@Ht$MI@?LIIHHHH)H4$HHT$yH@HHD$H4$A IH??HT$H@ H9$HDt$H9~# f HHHHI H9L9 HHHHN?HHIHHHH)H L$H LD$E1LT$0LA IM HHHLf?HLILIHL)yH@HMcHL9S I9 MK4LHHHWH7H?HH9$@ HDT$H9~ @ MHIHL H9H7c LA IHH L[]A\A]A^A_ÿ E1LL$.LL$HI E1H@HLD$L9 H$HLL$0HH+$@ A Jt0H+$@ HL)HHHHLOKH)ILH9f. HIH9~HT$8HL)I)KH9 @ IHHHIHH)LH)H9}I9LHL$(AILL$ ELD$I|L LD$LL$ HHL$(IHD$Mj(Ir0IB M IE1E1ېHLL HzHHLHxHzHxH9uIIM9uIHM IH$H I D HHHHHHNHHHNL9uMHHC?HIHHHH)HyH@H IHIAH?HH9$@ HDT$HH9 D HHHH H9IAH H5 H8`E1cH H5j H8BE1EHD$Mj(Ir0E11IB IE1!I{MH(1f UHHH HD$ HD$ HD$ H~?1HL$HT$HLD$H5< t5HT$Ht$H|$wH ]Ð1HT$H5 HuH 1]ff. SHF tRHHHta Ht|HHS?HIHHHH)xg HHp HP([ Ha H5ښ H8f. Hu HH Hu1[fHK@ HHff. AVE1E1AUATUHo SHGH^ L`HFILhI1IIf. HHI9v] D H2I9vxL I9| LBA Lu LHHL1LRM9tHttH7HHOI9LI9wI9vcHHH0HHIf. LBLRE1LLHLHIE1Lf. If. HuLIHt Hx [L]A\A]A^f D AV1E1E1AUATUHo SHGH^ L`HFILhIII% H LOIHt}HP HH D I9vH8I9v;H9>|FHHuLNHIL!fHHtHt2H:HHJ D HHf. Hf. I[L]A\A]A^ff. AVE1E1AUATUHo SHGH^ L`HFILhI1IIf. HHI9vW D H2I9vhLI9|pHJuL@HL LBHtHtZH7HHOI9LI9wI9vIHHH0HHIHJf. HHIHLIf. HuLIHt Hx 2[L]A\A]A^f D AVE1E1AUATUHo SHGH^ L`HFILhIII1% H L?IHt}Hp HH D I9vI9v>LH8I9CHJHI9uHxHH!tHt4LHHN Hf. Hf. I[L]A\A]A^ff. ATH1UHHSHH_ Ht{ HHuHGHLfHp(IIHp gLHpHH oMHP fHnHEfHnfl1fflfE[]A\ D HHuHH~HHEHHt)HH[HH?HHHHD HEHE1]A\ø AWAVAUIATUHSHHLg Mt
I94$ Ht$8LHD$8 SHt$8Hf H;+t, HHH)HH?HHHHHH9uLsHsH{I>~oM~ L)L)H|$I~Ht$HHDIH IVHx LHtHt$LcHH|$HH{HsI.n IIf D I;,$ LLL)HH?HHHHIL9uM9sI;,$MNI9s I9. MIIUI)M)LMHIH9~ L9 HSLZLR LHLM9 I9 H@L9 MH9 I|$LLrHCI,$ID$ Me HHL[]A\A]A^A_f. MI9EMe f D HH( D MI D H9 M9t KH9 I9 HJ H)L)IIII9 HwHLD$L)HT$HLL$aV HCLcHT$LxHH LH)HL$ IHILH+CHH)LII?IIIK<4BLL$HsLD$HL$ K1LLsIM9HsLs H9MH~LMfHk}f. L(H{Hs} HLD$ H)HLL$L)HLT$HHT$H)HL$(II?IIIJ<>O$>zHsH{LL$LD$ LLHT$LT$M9HsH{/ I9{2MHHs I+E(HLLD$L`LL$LLL$LD$HH IE(LHLD$LL$JL HL$ HsLD$HVL)HH?HLHHH| LJH{HCHCHL$H HHLqL+qIvH&t HL$LL$LIIAMHAE1Me M9M9 HL$(H9M9>M @ LG Mt I90 HO(SHAHQ LPII @ H;2t, LIH)IH?ILHHHI9uHZLBI fI;0tK~iLML)IH?ILHHIM9uM9sI;0MNE1L9vI93tZL[ D L9vCH9
HBH8~[ D MM IL@ D L @ E1[LMff. SHӃt'tRt-H& H5w H8[Hz uQ1[ D Hz tH21HtHSH P1[Hz tH2qHtHSHH!P1[ D H2HtHSH1P1ff. @ UHSHGt1҅HHA?HIHHHH)yH@H Ht(HtGHPHu5H HP1H[]HtHPHt
HH!HhӐH[]øATUHSHF H IH MH@?LIIHHHH)xe HEHu3HttHPHuPH HPH H []A\f Ht&HPHt HH!HXȐHH@f D H) LH5 H811[]A\f D H H5 H8f;IH HH-1f D ATUHSHF HIH MH@?LIIHHHH)xe HEHu3HtYHPHtPHH!HXH H []A\f D kHtAHPHu H HP @ HH@f D H LH5 H811[]A\f D H H5R H8Rf IH HH-1f D ATHF?HSHHDgHIHHHH)yH@H HEu*HtaHPHuGH HXHD[A\ D Ht&HPHt HE1H!HXHD[A\ D A HD[A\Aff. @ UHFH t/HHHt>HtBHc] H H5
H8
f. HHt1]ff. HHF?HSHIƋWHHHH)yH@H Ht*UHtLHPHu?H HX [f Ht HPHtHH!HX [ @ 1[ø[ff. fUHFH t/HHHt>H6tBHc] Hq H5 H8f. HHt1]ff. UHSHHF tjHbHHtyHH@?UHIHHHH) HumHH HPHusH HPj H H5* H8*f. Hu^EHH tHHtHPHt
HH!HXH H H[] @ HH@D H1[]ff. @ UHSHHF tzHBHH HH@?UHIHHHH) HuyHOHtHPHt
HH!HXH H H[] D H H5 H8f. HuNEHH tHvHt)HPHuH HP HH@H H1[]ff. @ ATUH1SH0 Ht|fH@ I@ H@ H@0 @@HtZHX(HL[; ]A\ vHH HCfHnflCHuI,$uL=E1[]LA\fH@0It$PLH ID$( HHtHtHUHhHE HE HHCHHC\ff. H=i 11tt+t4u; Ðu f ff. AWIHAVAUATUHSHH(HD$ Aăg LHt$HH|$HIH9 M|$IL$Mt$I? IIw H)I)H4$HHL$HDH4$H4 IWLh H$LH:HL$L$LMMT$IL$Ml$I/@ H|$L9sU H9vkHf D HH9voHH91H9vH9uHqHH#s HqHL9rI I9H(1[]A\A]A^A_ D HA HL9r D 1봃o IE1HN LHt$HH|$HIH9s M|$IL$Mt$I? IIw H)I)Ht$HH $HDWHt$H IWLh HD$LHH $LT$LMMT$IL$Ml$I/s H|$L9s[f D H9 Hf. HH9 HH91H9vH9uHqHHH#sHqHL9rI L9I4$LHt9IIL9I|$ tMHe H5> H8H([]A\A]A^A_LMl$IL$H HHHDLu߸ 1)MHA HL9 @ HA HI9wI L9L}Ml$IL$vH|$1H|$1cf D AWHB?HAVAUATUHSH8HHIHHHH)yH@H H}HT$ HD$ HHD$( x H Ht$HLL$IL9S Hl$ f. MoIGMwI} Iu I}H)I)H4$HHD$ HDH4$HHA IUL` LHHD$I_LMIGMgIm l LL$L9 H|$0H9sc H0H HH|$0H9sJH
H9H|$0H9 sH9u HxHH#zHxHI9vAHH|$0H9rH D H@ HL9sH|$0H9rH@ HL9rHI M91H8[]A\A]A^A_Ã H|$( Ht$HLl$ $LL$II9v IoIwMwH} B H}LM L)M)LL$HH4$HDLL$HH HUL` LLHiH4$I_LMIwMgHm LL$L9 HD$0I9scHL HH\$0H9sRHH9H|$0H9 sH9uH~HHH#xH~HI9vFIHD$0I9rLf. HF HL9sH|$0I9rHF HI9wII M9cMM,L跺MgIGH袺MgIwH H5~ H8/H8[]A\A]A^A_HT$ H<H8[]A\A]A^A_Ht$ HHfLL$1LL$1u tt#t,u3 Ð D @ @ AWAVAUIATIUSH(BHD$ Ht$D$`I}AM9 8 o Ht$L4LT$IL9 MFI^M~I8 IxIp L$H)I)Ht$HHDL$Ht$H IPHh L$HHD$HLHmHL$L$I^InINI(> LT$f H9s%H3LпH H@H!CHH9rI M9)D$ AU1AEH(1[]A\A]A^A_ D Mt$(IFHHLI HD$L9 InI^H9w HH9 H3L(HuH([]A\A]A^A_ 3BH H5{ H85H([]A\A]A^A_ÐAAwI}(Im0H9Q H/ H foy Im( IE IEPIEh AE@"HH IEhfHnflAEXH+f D Md$(ID$HHLI HD$L9hIl$I\$H9w D HH9s HDLmu HC H LLXInI^ HD$I I9=Ht$LLT$IL9 MFI^M~I8c IxIp L$H)I)Ht$HHDL$Ht$HF IPHh L$HHD$HLHMHL$L$I^InINI( LT$f H9s,H3L谼H HSHHH#PHSH9rI M9" D HD$I I9ULT$1t1I}H HHHH;YHHHH|8H/uȴIU(HH9Zj谴` HC H'L L致InI^LT$1ff. AWAVIAUATUHSH HIIH M ItSLLtbL0HHtHH@ HOHm IuHͳIu2HuI @ HtnM9t Im I,$tGH[]A\A]A^A_ IHtHsIH E D L@f D M9t$L LsyIm I$HP1I$HnLD$ D$ YL۲@f D H H5ju H8jHm H觲fM9Im L脲LwcfAWAVAUATIUSHhLl$@H|$HLD$< 0f.z ff/ H$ f.R f/ A = L5IHT LE1 LHcAă@ HD$H HD$Hx>ŃZ / H|$Ht$HuHT$HH9 Lt$(M1If. MNIvMnI9 IyMY LL$L)M)L\$HHt$ HD,LL$L\$H IQL@ LLL$LHD$H蘴Ht$ LT$LL$N<(HM~IvMVI)< HT$HL9s:fHt$Hf D HIHt H9 1HFHL9rI I9 Lt$(Dd$fH HH H A H HuHDH HuHH HuHH HuHHLH?)IHcHHCIHt?IOHE ILL|$1.A/ ? FI_HE L蘚I_IWL|$1H H5vZ H8IHv H5_ H8Ilff. U1HHH5SZ HHD$HT$ٜt/Ht$HXHHtH7H]ÐKHtH1]ff. H;5 SHu H;= t* 0 HtHX H[f H! H [ UH
H1HHHY HL HD$ LL$xA1Et
Ht$H聜H]ff. HH=F aff. ATSHHH5G ʷIHtCt HL[A\L訛I,$HtIHL[A\LI蕘HL[A\f. ATUSHHH HF H{HG њH{ HHG HT$H twH\$HHIHt^HH4$Hx H蚛@u| HL[]A\ H{bH H5\ E1H8TfHE1L[]A\ÐH H5\ E1H8'HL[]A\ H= L)I,$HtHtIcS1CQ @ HI H5z\ E1H8迗HL[]A\ LI,$HtI f D LIՖLȖt ATSHHH5 蚵IHtCu HL[A\LxI,$HtIHL[A\LIeHL[A\f. UHvH1HtHDHm t
H] HHD$HD$H] ATUH$Ht?HH脖Hm ItHL]A\ HHL]A\ D E1HL]A\fAWAVAUATIUSHHHH- H9t Ht I$HL[]A\A]A^A_ I|$L- L9 L賙 I|$L5 L9 L莙 ID$ H P {IHtCL Hc HL蟳I/IuGL螔Mu?f E1# D L蒘IMtI|$H9t`HȘuTI|$L9t:L貘u.I|$L9 L蘘 D D D {IH?L HOtL D I/L薓L ff. fATH1HH
O H/S HHD$ LD$qtYH|$HtcHt$D$ qIċD$tHLA\ @ Mt H H5mX H81蛗I,$t,E1HLA\ ˕HILA\f D L蠒ff. 1Ht!UHHlHm tH] HHD$SHD$H] AUATIUHHt$H LHt$ HqIH D$T$ t8 H HIHHHm tDI,$tLHL]A\A]Ã H H IHm uf H舑I,$uLyHL]A\A] @ Hm HE1L]A\A] D tSuIt$H}萻HIEIt$H胺I0 LH}I D HuLTI @ HАnff. AUATIUHHt$
H LHt$ HIH D$T$ t8 Hh HIHHHm tDI,$tLHL]A\A]Ã H' H IHm uf HI,$uLHL]A\A] @ Hm HE1L]A\A] D t[uIt$H}IM It$H÷H{I( LH襷I D H}L茷HDI @ H@^ff. AUATIUHHt$zH LHt$ HaIH D$T$ t8 Hج HIHHHm tDI,$tLHL]A\A]Ã H H IHm uf HxI,$uLiHL]A\A] @ Hm HE1L]A\A] D t[uIt$H}蠹HIEI|$HsHI( LHEI D H}Lff. AWIAVIAUATUSHHH-p H9tHtW I~H9tH[W IGI^(Io(1E1Md(IFMl(E1$ HuiIw IcTIHtUHH(HH D I9vHI9v#H>H9r+HH9t"HtHHHHHuAHHL[]A\A]A^A_HLL []A\A]A^A_f. ff. ATIUHHHH5o H9t NVtHp HLH]A\HLH]A\~ff. AWIAVIAUATUSHHH-Yo H9tHU I~H9tHU IGI^(Io(1E1Md(IFMl(E1$ HuyIw IcRIHteHp(HH D I9vI9v.HH:H9w;HH9uHHtHHH @ HfAf. HHL[]A\A]A^A_HLL []A\A]A^A_*f. ff. AVAUIATUHHHL5Ln L9t LTt{fHnfInI}H5~n fl)$H9t |TthHH5H6R HE IH|$HtL9t
H/ HL]A\A]A^ D HLH]A\A]A^f+OHD$IHtHxL9t LStYHrm LLgHHt/H/M@OC 3OHL]A\A]A^ @ E1C LLHUHHHV HvD$ SRH$HtHH5 HQH$H]ff. HH=l !RUSHHH?/PHt!H;HH/tH+1H[]fkNfATIUHH=gl
NHt=HLHQHm It
HL]A\fHNHL]A\ D E1HL]A\f. U1HH
s HHH HLL$IH$ HD$ Pt@H;-k H$HT$tHHLH] D HtH9huH9P uH ސH1] AVAUATUHHH=k H8 m N L%k I$8 b LrN H=k H8 U PN L5j I8 K L+Nk L-j I8 > LNF HfQ1H5 H= HPH5p HHK LM LH5 HK LM LH5 HK LcM LHH5 XKH]A\A]A^ÐHi H8 D Hi I$8 @ Hi H8 D Hi I8 D Hi I8 D H]A\A]A^ AUATIUSHHOH; ItCf11LHKHHt[H3HLkJHE u;HHE tH H; uH1[]A\A]fHH JH; u @ HHE tH[]A\A]f D HJff. AT H=2 UHHi H Hh H Hh H LHtjIHNLHMt>L6Nt11H5" H=A lNH5" HHZIu D KLHt&I,$tE1HL]A\ÐLIf D HYh H5E" H8JJHH LL\MDM,MLpMM8M MMLMMMMMM bitset slicing step must be 1 (~%R) MutBitSet(~ImmBitSet(%R)) MutBitSet(%R) len() is too large ImmBitSet([]) ImmBitSet(%R) |O:immbitset |O:mutbitset_new pop(): index must be 0 or -1 pop(): empty set |n:pop O!:CplBitSet.__new__ NyBitSet_Exports _bs arg NyBitSet_Exports v1.0 immbit immbitrange guppy.sets.setsc.Union immbitset-iterator guppy.sets.setsc.MutBitSet _splitting_size _num_seg _indisize is_immutable __reduce__ helper for pickle add append clear discard remove mutcopy tas tac guppy.sets.setsc.CplBitSet guppy.sets.setsc.ImmBitSet guppy.sets.setsc.BitSet immbitset with negative bits can not be converted to int immbitset too large to convert to int len() of this immbitset is too large to tell len() of complemented set is undefined operand for anybitset_iterate must be immbitset or mutset bitno_from_object: an int was expected bitrange() arg 3 must be positive bitrange() result has too many items n;bitrange() requires 1-3 int arguments nn|n;bitrange() requires 1-3 int arguments Invalid mutbitset_iop_field() operation mutset.append(%ld): bit is already in the set. mutset.remove(%ld): bit is not in the set. Invalid mutbitset_iop_fields() operation Invalid mutbitset_iop_bits() operation operand for mutable bitset must be integer or iterable ImmBitSet.__new__ : complemented arg not supported pop(): The mutset is complemented, and doesn't support pop.
NyBitSet_Form() requires exactly 2 arguments NyBitSet_Form(): 1st arg must be an int NyBitSet_Form(): 2nd arg must be bytes operand for immbitset must be a bitset, iterable or integer NyAnyBitSet_length: bitset required. immbitset_lshift(): too large shift count this slice index form is not implemented empty immbitset - index out of range immbitset_subscript(): index must be 0 or -1 mutbitset_slice(): The mutset is complemented, and doesn't support other slice than [:].
mutbitset_subscript(): The mutset is complemented, and doesn't support indexing.
mutbitset_subscript(): index must be 0 or -1 mutbitset_subscript(): empty set bitset_richcompare: some bitset expected anybitset_indisize: some bitset expected guppy.sets.setsc.NybitSet_Exports No object found at address %p
S.append(e): e is already in S nodeset_richcompare: some nodeset expected NyNodeSet_iterate: can not iterate because not owning element nodes iop: left argument must be mutable left argument must be a NodeSet nodeset_op: mismatching '_hiding_tag_' attributes guppy.sets.setsc.NyNodeSet_Exports S.is_immutable == True
True since S is immutable. S.is_immutable == False
False since S is not immmutable. S.is_immutable : bool
True if S is immutable, else False. mutable nodeset required pop: argument must be mutable immutable nodeset S.remove(e): e not in S |O:MutNodeSet.__new__ |OO:ImmNodeSet.__new__ NyNodeSet_Exports iterable hiding_tag NyNodeSet_Exports v1.0 obj_at _hiding_tag_ immnodeset-iterator guppy.sets.setsc.NodeSet guppy.sets.setsc.MutNodeSet guppy.sets.setsc.ImmNodeSet x.obj_at(address)
Return the object in x that is at a specified address, if any,
otherwise raise ValueError ImmNodeSet([iterable])
Return a new immutable nodeset with elements from iterable.
An immutable nodeset inherits the operations defined for NodeSet.
It also supports the following operation:
hash(x) -> int
Return a hash value based on the addresses of the elements. MutNodeSet([iterable])
Return a new mutable nodeset with elements from iterable.
A mutable nodeset inherits the operations defined for NodeSet.
It also supports the following methods:
add, append, clear, discard, pop, remove, tac, tas.
The class NodeSet is the base class for ImmNodeSet and MutNodeSet.
A nodeset is a set of objects with equality based on heap address.
The following operations are defined for both mutable and immutable
nodesets.
------------------------------------------
Binary operations.
The following operations all return an immutable nodeset.
The left argument must be a nodeset. The right argument
can be any iterable object.
x & y -> Intersection: the set of
objects that are in both x and y.
x | y -> Union: the set of
objects that are in either x or y.
x ^ y -> Symmetric difference: the set of
objects that are in exactly one of x and y.
x - y -> Difference: the set of
objects that are in x but not in y.
------------------------------------------
In-place binary operations.
The left argument can be mutable or immutable.
If it is mutable, it is updated in place and returned.
If it is immutable, the result is a new immutable nodeset.
The right argument can be any iterable object.
x &= y -> Intersection
x |= y -> Union
x ^= y -> Symmetric difference
x -= y -> Difference
------------------------------------------
Inclusion test.
The left argument can be any object.
The right argument is a nodeset.
x in y -> bool
True if x is an element of y, False otherwise.
------------------------------------------
Relational operations.
These return a boolean value.
The left argument is a nodeset.
The right argument is a nodeset.
If the right argument is another type, TypeError will be raised.
(This may be relaxed in future.)
x == y -> Equal:
x and y contain the same elements.
x != y -> Not equal:
x and y do not contain the same elements.
x <= y -> Subset, non-strict:
all elements in x are also in y.
x < y -> Subset, strict:
all elements in x are also in y,
and y contains some element not in x.
x >= y -> Superset, non-strict:
all elements in y are also in x.
x > y -> Superset, strict:
all elements in y are also in x,
and x contains some element not in y.
------------------------------------------
Iteration.
iter(x) -> iterator
The iterator yields the elements of x.
[The order is implementation dependent.]
------------------------------------------
Length.
len(x) -> int
Return the number of elements in x.
------------------------------------------
Truth-value testing.
bool(x) -> bool
Return True if x is not empty, False otherwise.
guppy.sets.setsc._NyHeapDefs_ module initialization failed setsc ;\ 8&x , - H-( -) . x/ / 0 0 1 1 4x 4 4 4 4 4 4 (5 6\ 6 7 7 88 X9x 9 9 : 8: :0
x;\
H<
<
(=
>( X@ hA A hB C C8 D E (F HG
Hl
H
M
N
hO P Q R S\ T Y [ [L h\ ] ^ _@ `` ` (a Hb hc hdT xdh d| h 8md mx r tD z { { H \ p ( x ȃ \ ( , @ x ȍ ( 8 H \ x 8( h ؓ xl h ( X ؞ ؟X D X ȲH \ p ( H ض8 L ` (x 8 H h ( ` ȹ x 8(! ػl! (! ! ! h4" h" (" X" " H" \# (# # $ P$ X$ $ 8$ h$ % XX% % % H% $& `& x& & & & 8' 8' L' d' ' ' ' (' H ( ( ( ( ) @) H) * * H* 8* H* * P+ d+ 8+ + + $, Hd, , , 0- zR x $ FJ w ?;*3$" D ' X (S l ) ) DU ) *
X * BBB B(A0A8
0F(B BBBA
0C(B BBBC - 0 - DR H - \ - p - - ,/ Ab
E H - BBB E(A0A8D@i
8D0A(B BBBI L - BBD D(G0t
(A ABBC c
(C ABBA P D.
d @. ` x .^ BBB A(A0
(D BBBH y
(C BBBF I
(A EBBE < /^ BAD g
DBD L
DBF GDB /' Ae 8 /. AQ
N I $ X /` ADF KDA 40 < @0 BDD C
DBE [
DBG LDB( 0 BO
G Y
A [
A 1 D
F P
A D $ 1~ IAD lDBHP L
DBF GDB l 1R H D2 BEE B(A0A8DP
8A0A(B BBBH ` 3x BEB B(D0D8DP
8A0A(B BBBA u
8F0A(B BBBA 0 4 $ D 5q Ae
J u
E F $ l 6q Ae
J u
E F ( p6 BAD u
HBJ 6k As
D L H7 BBB A(A0~
(A BBBC v
(A EBBH L , 8& BBB A(D0
(A BBBI v
(D EBBE | 8D R^ ( 09 AGD
DAA L $:q BIB B(D0
(E BBBH I
(E BBBD T; L $ P; BBB B(A0A8G
8D0A(B BBBA ( t @ AJ0b
AB ^C @ A[
D M
C 8 @A: BHB A(E0 (D BBB zR x 0 ( P 8 8 8 B BJB A(E0(D BBB 8 t B BHB A(E0(D BBB 8 8 C BHB A(E0(D BBB 8 DD BFH
ABF j
aBA L < D\ BBB E(A0D8D
8D0A(B BBBK 0 J W
F V
J `HD
D , J An
A J
F _
A b
F 4 tK ADF b
AAA d
CAA 8 (
K* BAD |
ABJ N
ABG 8 d
L* BAD
ABG N
ABG @
M BHD N
DBF d
DBF J
DBA
@Nu Ar
M t ( N KK
J c
E C
A F 0 Ou Ar
M t 0 P tO ADD
AAE TCA4 `P ADD
AAF |CA 8 HQ BAF I
HBD w
AEC R RU d TR
BIB B(A0D8G`S
8C0A(B BBBF
8A0A(B BBBA | UH BIB B(A0D8Dp
8A0A(B BBBA
8F0A(B BBBA Y
8D0A(D BBBA
YM |
ZB BBB G(D0A8D``
8C0A(B BBBF i
8F0A(B BBBH l
8A0A(B BBBB H
^ BBE B(A0D8DP
8A0A(B BBBD L
|` BBB B(D0C8D
8D0A(B BBBA , 8 f BAD t
ABB h f$ DY
C d f BBB B(D0C8GpA
8A0A(B BBBG 4
8C0A(B BBBH k
k
8 k BBD
BBE e
BBG P P tlM BBD
EBF h
BBD F
BBF A
DBI pmN A] nA 8 m BBA
BBE i
BBC 8 n BBA
BBE i
BBC 8 < ho BBA
BBE i
BBC @ x LpT BKJ K0
DBBF X
GBBE hq
dq
H `qU BBB B(A0A8D`
8D0A(B BBBF $ 0 tub AS y
AB NC X uM Hn
J L x uU A] uA ,v (v < $vf BAG _
DBA Y
DBA ODB ` Tv BAA G0
DABH l
GABB ]
DABD ]
DABD < d wf BAG _
DBA Y
DBA ODB $ wH AD b
AH VA< x^ BAD c
DBH L
DBF GDB H (x3 BBB B(D0A8G@k
8D0A(B BBBD 4 X z BZ B
EE k
EH I
HG ( zH HG PAHH VAP zu BBD D0k
DBBA K
DBBE O
GBBF P | BBD D0k
DBBA K
DBBE O
GBBF P d @} BBD D0k
DBBA K
DBBE O
GBBF P |~} BBD D0k
DBBA K
DBBE O
GBBF H BAG g
DBI
DBA D
DBE ZDB X l& H l r BEB B(A0A8D`k
8D0A(B BBBG @ BAG@_
ABD u
CBF V
ABG p x BEE A(D0U
(D BBBA H
(A BBBA Z
(A EBBA A(C BBB 4 p Ćm AJ@J
AJ
HP
EV <
AJ
DH i
AF
CK
EY ̋ L 8 BBB B(D0D8I"
8A0A(B BBBK L L BBB B(D0D8I"
8A0A(B BBBK L BBB B(D0D8I"
8A0A(B BBBK x 4 { BAA b
DBD DAE $ L ؔ A`
O P
H D t P DI L X BBB B(D0A8D@
8A0A(B BBBA GS 0 D X H l { BED D(D0E
(G ABBL D(A ABB 4 BAJ r
DBK I
DBA $ @ BAG oDB , 8L TX
D O L hW Al
C R
N p TK @ BAG p
DBH w
DBE A
ABA @ BEA E
BBG V
BBN KDB ( dN BDD \
ABG @ < p BEA U
ABH e
ABH L
ABA E A[
L X 4 t AAG0A
AAD K
CAA 0 ,| ADG F
AAD \FA x? D]
G V , $ DY
C H J D]
G 8 d BHA `
AEG M
ABH \ DX BBE D(G@
(A BBBF
(C BBBG r
(C BBBE ( D ADD g
CAD < , AAG v
IAG Z
CAB NCA L l BBA A(DPv
(C ABBH W
(A ABBA 4 h AAG y
CAJ I
CAC 4 > BDD U
GBH JAB 0 , Ȟ ADG0X
AAJ \FA ` 4? D]
G V T$ DY
C hJ D]
G @ ADG P
CAH L
DAG D
FAE 0 M ADG Z
AAH UDA 0 < D BDG r
ABN D
ABI \FB @ `L BAD G0
AABJ Z
CABA 8 l BAD
DBO A
ABD 8 0 BBA ~
EBF A
BBK 4 @ Ԣr BAE }
ABH K
AEG x
$ B BAG qDB H3 t) D d ! A@
G ^
J ,! $ DY
C ( H! I BAD ~AB t! 0 ! < A[ \ ! @> BEE B(A0A8D@
8L0A(B BBBE f8D0A(B BBB zR x @ ( < 0 <" R BDG d
GBF DGB p" < " BAL S
DBH I
DBA fDB " P A] pA H " H BBB B(D0D8GPy
8D0A(B BBBC \ 0# [ BBE B(A0D8D@
8L0A(B BBBE f8D0A(B BBB < # 0 # R BDG d
GBF DGB \ # ȩ BEE B(A0A8D@
8D0A(B BBBA D8L0A(B BBB L$ 0 `$ R BDG d
GBF DGB \ $ & BEE B(A0A8D@
8D0A(B BBBA D8L0A(B BBB $ \ % |P BBE A(G@
(D BBBF D
(G BBBG a
(D BBBE h% lB AG xA % ( % > AAG b
AAC < % f BDD m
DBC L
DBF GDB ( & ܬ A] C
AF \C L 4& @ BBB A(G0t
(D BDBB |(F BBB L & BBD A(G0U
(C ABBC f
(F ABBG ( & BMD
DBB `X X 0m
P
m (m o `
p ? o o o o 8m 6P FP VP fP vP P P P P P P P P Q Q &Q 6Q FQ VQ fQ vQ Q Q Q Q Q Q Q Q R R &R 6R FR VR fR vR R R R R R R R R S S &S 6S FS VS fS vS S S S S S S S S T T &T 6T FT VT fT vT T T T T T T T T U U &U 6U FU VU fU vU U U U U U U U U V V &V 6V FV VV fV vV V V V V S.is_immutable == False
False since S is not immmutable. S.is_immutable == True
True since S is immutable. immbitset() -> empty immutable bitset
immbitset(bitset) -> immutable bitset with bitset's bits
immbitset(iterable) -> immutable bitset with iterable's bits (int items)
immbitset(integer) -> immutable bitset with integer's bits (binary 2-complement)
Return an immutable bitset. It will be complemented if the argument
is a complemented bitset or a negative integer. If the argument is an
immutable bitset, the result is the same object.
_bs(flags, data) -> some kind of bitset
Internal function used to form a bitset when unpickling.
It is designed to be 'safe' with any data but may give strange results
if given something else than what x.__reduce__() generated. immbitrange([start,] stop[, step]) -> immutable bitset
Return an immutable bitset containing an arithmetic progression of integers.
immbitrange(i, j) equals immbitset([i, i+1, i+2, ..., j-1]).
Start defaults to 0. If step is given, it specifies a positive increment.
For example, immbitrange(3) equals immbitset([0, 1, 2]). immbit(bit) -> immutable bitset
Return an immutable bitset containing the single bit specified.
The bit must be an integer in the range of an int. S.mutcopy() -> mutable bitset
Return a mutable copy of S.
S.tac(e) -> bool
Test and Clear.
If e is in S, remove e from S and return True,
else return False. S.tas(e) -> bool
Test and Set.
If e is in S return True,
else add e to S and return False. S.clear()
Remove all elements from S, and compact its storage. S.remove(e)
Remove e from S, or raise ValueError if e was not in S. S.pop([index]) -> int
Remove and return a bit, or raise ValueError if there is no bit to pop.
The index must be -1 (default) to pop the highest bit or 0 to pop the
lowest bit; otherwise IndexError will be raised. S.discard(e)
Remove e from S; no effect if e was not in S. S.append(e)
Add e to S, or raise ValueError if e was already in S. S.add(e)
Add e to S; no effect if e was already in S
MutBitSet() -> new empty mutable bitset
MutBitSet(bitset) -> new mutable bitset with bitset's bits
MutBitSet(iterable) -> new mutable bitset with iterable's bits (int items)
MutBitSet(integer) -> new mutable bitset with integer's bits (binary 2-complement)
A mutable bitset has operations common for all bitsets as described
for the BitSet base class. It also defines the following methods:
add, append, clear, discard, pop, remove, tac, tas
CplBitSet(x:ImmBitSet) -> complemented immutable bitset.
If the argument is an instance of ImmBitSet, this is the same as ~x,
otherwise TypeError is raised.
A complemented immutable bitset provides the same operations as
non-complemented immutable bitsets, except for len() and iter().
ImmBitSet() -> empty immutable bitset
ImmBitSet(bitset) -> immutable bitset with bitset's bits
ImmBitSet(iterable) -> immutable bitset with iterable's bits (int items)
ImmBitSet(integer) -> immutable bitset with integer's bits (binary 2-complement)
The result can only be non-complemented; TypeError is raised
otherwise. (The function immbitset() can be used to create both
complemented and non-complemented bitsets.)
An immutable bitset provides the operations common for all bitsets as
described for the BitSet base class. It also defines the following:
hash(x) -> int
Return a hash value based on the bit numbers of the elements.
The class BitSet is the base class for all bitset classes.
A bitset is a set of 'bits'. Bits are integers, in a range that is
typically [-2**31 .. 2**31-1] or the range of the builtin Python int
type. The implementation of bitsets is such that it handles dense sets
the most efficiently while sparse sets are handled reasonably well.
Bitsets can be either mutable or immutable. Mutable bitsets have
various operations to add and remove bits in-place. Immutable bitsets
have hashing so they can be used as keys in dicts. Both kinds of
bitsets have several operations in common. Sometimes an operand can be
either a bitset or a 'convertible', which means it is one of the
following kinds.
iterable
An iterable argument is convertible to a bitset if each object yielded
is an integer in the range of an int.
int
A positive argument, x, of one of these types will be converted
to a bitset with the same bits as the binary representation of x.
A negative argument will be converted to a complemented bitset,
equivalent to the following expression:
~immbitset(~x)
This corresponds to the bits in the 2-complement binary representation
of x, except that the result conceptually has all negative bits set.
The difference shows (only) when shifting a complemented bitset.
The following operations are common for mutable and immutable bitsets.
------------------------------------------
Standard binary operations.
In the usual case the left argument is some kind of bitset, and the
right argument is a bitset or a 'convertible' as defined above. The
return value is then an immutable bitset.
x & y -> Intersection: the set of
bits that are in both x and y.
x | y -> Union: the set of
bits that are in either x or y.
x ^ y -> Symmetric difference: the set of
bits that are in exactly one of x and y.
x - y -> Difference: the set of
bits that are in x but not in y.
If the right argument is a bitset but not the left argument, the
result will be an immutable bitset if only the left argument is a
convertible that does not define the same operation; otherwise the
result is what is returned by the operation of the left argument or a
TypeError will be raised. The following table gives the result for the
different kinds of arguments.
Left argument Right argument Result
- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
bitset bitset immutable bitset
bitset convertible immutable bitset
bitset other TypeError
defining the same op bitset handled by left argument
convertible bitset immutable bitset
other bitset TypeError
------------------------------------------
In-place binary operations.
The left argument must be a bitset.
If it is mutable, it is updated in place and returned.
If it is immutable, the result is a new immutable bitset.
The right argument is a bitset or a convertible.
x &= y -> Intersection
x |= y -> Union
x ^= y -> Symmetric difference
x -= y -> Difference
------------------------------------------
Complement operation.
~x -> immutable bitset
Return the complement of x. This is a bitset that, conceptually,
contains all bits in the universe except the ones in x.
[ Subtle
If x is not already complemented, ~x will return a special
complemented kind of set. This can be used like other bitsets except
for two operations that are not supported: it is not possible to
iterate over, or take the length of a complemented bitset. If x is a
complemented bitset, ~x returns a non-complemented bitset.
Mutable bitsets may become complemented in-place if given a
complemented argument to a suitable in-place operation. This is
represented by a flag. Immutable complemented bitsets are represented
by a special type, but this is to be considered an implementation
detail, it could as well be using a flag. ]
------------------------------------------
Shift operation.
x << y -> immutable bitset
Return the set of bits of x, with the integer y added to each one.
Raise OverflowError if some bit would exceed the range of an int.
[ Subtle
For non-complemented x and positive y, the result is what one would
expect if x was a number in binary representation. But when x is
complemented, the result will equal
~((~x) << y)
which is different from what one would expect from binary number
shifting, since 1's are shifted in from the right.
The operation allows both positive or negative y values, unlike the
shift for integer objects. For negative y's, the operation will shift
bits to the right but not quite in the same way as a binary integer
right-shift operation would do it, because the low bits will not
disappear but be shifted towards negative bits. ]
------------------------------------------
Inclusion test.
The left argument is an integer in the range of an int.
The right argument is a bitset.
x in y -> bool
True if x is an element of y, False otherwise.
------------------------------------------
Relational operations.
These return a boolean value.
The left argument is a bitset.
The right argument is a bitset.
If the right argument is another type, TypeError will be raised.
(This restriction may be reconsidered in the future.)
x == y -> Equal:
x and y contain the same bits.
x != y -> Not equal:
x and y do not contain the same bits.
x <= y -> Subset, non-strict:
all bits in x are also in y.
x < y -> Subset, strict:
all bits in x are also in y,
and y contains some bits not in x.
x >= y -> Superset, non-strict:
all bits in y are also in x.
x > y -> Superset, strict:
all bits in y are also in x,
and x contains some bit not in y.
------------------------------------------
Iteration.
iter(x) -> iterator
The iterator yields the bits of x.
Raises TypeError if x is complemented.
[The order is implementation dependent.]
------------------------------------------
Length.
len(x) -> int
Return the number of bits in x.
Raises TypeError if x is complemented.
------------------------------------------
Truth-value testing.
bool(x) -> bool
Return True if x is not empty, False otherwise.
------------------------------------------
Conversions.
int(x) -> int
Return an integer having the same binary representation as the bits of
x, or raise an exception if the bitset can not be represented in the
choosen type. When no exception is raised, the bitset x can be exactly
recreated and the following invariants will hold.
immbitset(int(x)) == x
The exception OverflowError will be raised if it is found that x can
not be represented. Note that for a sparse bitset with high bit
numbers, int(x) may create a very big object since it allocates
storage for all the low bits up to the highest bit number set, unlike
bitsets that use a sparse representation. Creating such big objects
may run out of storage which may raise a MemoryError or cause some
other malfunction depending on the system.
------------------------------------------
Mutable copy
S.mutcopy() -> mutable bitset
Return a mutable copy of S.
x `x w w
s v `e & 0q 1 C @| G P { N z T 0 { V z \ `z c y k p y o @y Pk c Ю y & n 1 m ^ ^ ` b d k c y & pm 1 ` ^ c ( pc p^ ` p Pl d | @ ` ^ f 0 ` s ^ d @j `~ @ ^ Z 0f @ Z ` ^ [ ` S.tac(e) -> bool
Test and Clear.
If e is in S, remove e from S and return True,
else return False. S.tas(e) -> bool
Test and Set.
If e is in S return True,
else add e to S and return False. S.remove(e)
Remove e from S, or raise ValueError if e was not in S. S.pop() -> object
Remove and return some object from S, or raise ValueError if S was empty. S.discard(e)
Remove e from S; no effect if e was not in S. S.clear()
Remove all elements from S, and compact its storage. S.append(e)
Add e to S, or raise ValueError if e was already in S. S.add(e)
Add e to S; no effect if e was already in S. + + 4 V ] ] C ` G @ N p T V \ P k ` o 0 p h ? j @ 0 ~ 0 D p 0 P m 0 D p 0 ` ( D ` p 0 p 0 This module implements two specialized kinds of sets, 'bitsets' and
'nodesets'. Bitsets are sets of 'bits' -- here meaning integers in a
particular range -- and designed to be efficient with dense as well as
sparse distributions. Nodesets are sets of 'nodes', i.e. objects with
equality based on their address; this makes inclusion test work with
any combination of objects independently from how equality or hashing
has been defined for the objects involved.
Summary of module content.
Classes
BitSet Abstract bitset base class.
CplBitSet Complemented immutable bitset.
ImmBitSet Immutable bitset, non-complemented.
MutBitSet Mutable bitset, complemented or not.
NodeSet Abstract nodeset base class.
ImmNodeSet Immutable nodeset.
MutNodeSet Mutable nodeset.
Functions
immbit Immutable bitset singleton constructor.
immbitrange Immutable bitset range constructor.
immbitset Immutable bitset constructor.
Data
NyBitSet_Exports,
NyNodeSet_Exports C-level exported function tables.
) GCC: (GNU) 10.2.1 20210130 (Red Hat 10.2.1-11) pX Z % 1 Z @ [
R [ \ p^ k ^ | ^ ^ ^ ^ ^ / _ ` `
/ ` ? b ^ M pc . \ c ` j d y d d `e 0f ~ f R g @j Pk q k q Pl $ 0 m k C pm T h n & y p 0q q r w x Py : V 8 z 3 { L V 8 j | } ~ \ P * * p u u ' 5 0 G
\ В H p p B $ ` N @ Ю , C T Q 0 Z b h P q 0 f ^ 3 ' u ` }
@ r , m @
T j
u
p
`
P ` ` `x w E s $ v 0 D P Z o | } ` P @ @| 7 { D z @ { < z `z E y < y \ @y d * P @ `~ ! N @ ` ` P r @ P ` P . > 0 Q P d p { { p @ W ` N
p (
E :
? F
$ R
@ J a
p
0 X
p
>
?
$
P J
@ M
0 L 8 K ^ p $ l 0 > H 0W < p R P 0 [ lW <
R # : F 0 R S & j v P 0 Q @ h @
l P P
`
P '
%
P :
` P L
P _
` 7 D @ < ] E r
` \ z
d
W
W
X
`
(m
`X
m h $ ` 4 C DW Q 0m ^ 8m g ) z ` p 8 ` ? P
P V
) H0 m (m 0m 8m o p `s `
`Y S f & ; M U c ) r `s : >
Ъ
" 3 M u 0 f r @c ' U U & 8 F W P | h v B # 9 L ] q ` r o D
p , 8 t H U h w H " 6 H [ p 3 l } ` w { P # 0 8 L Q ` p Y r ` p C @ p
$ 1 @ V ` M m ~ I B ` U h x 1 ? T & b s ` f a ^ P * 7 D s 3 _ к H n M @ " P 1 C P @ a u mutbitset_findpos immbitset_dealloc n_immbitset immbitset_hash immbitset_nonzero sf_tst_sf bsiter_getiter cplbitset_hasbit cplbitset_complement cplbitset_nonzero immbitset_is_immutable mutbitset_is_immutable cplbitset_dealloc n_cplbitset mutbitset_getrange_mut NySlice_GetIndices mutbitset_get_num_seg bsiter_iternext cplbitset_int bsiter_dealloc union_dealloc cplbitset_repr mutbitset_repr immbitset_length len_tab mutbitset_length immbitset_repr mutbitset_nonzero root_ins1 cplbitset_hash mutbitset_contains immbitset_contains mutbitset_dealloc n_mutbitset cplbitset_contains immbitset_reduce NyBitSet_FormMethod cplbitset_reduce mutbitset_as_noncomplemented_immbitset_subtype mutbitset_reduce _NyImmBitSet_Range _NyImmBitSet_Singleton immbitset_op.constprop.0 immbitset_op.constprop.0.cold immbitset_op.constprop.1 immbitset_op.constprop.2 immbitset_op.constprop.2.cold immbitset_op.constprop.3 sf_realloc mutbitset_findpos_ins mutbitset_findpos_mut mutbitset_iop_field mutbitset_set_or_clr mutbitset_append mutbitset_remove mutbitset_tasbit mutbitset_tacbit mutbitset_add mutbitset_discard mutbitset_iop_fields mutbitset_iop_bitno mutbitset_iop_mutset mutbitset_iop_iterable mutbitset_iop_PyLongObject _mutbitset_clear mutbitset_subtype_new_from_arg immbitset_new kwlist.2 immbitset_mutable_copy cplbitset_mutable_copy mutbitset_mutable_copy mutbitset_new kwlist.1 mutbitset_pop kwlist.3 immbitset_complement mutbitset_complement _NyBitSet_Form mutbitset_int anybitset_convert kwlist.0 anybitset_and anybitset_xor anybitset_or anybitset_sub immbitset_lshift anybitset_lshift immbitset_subscript mutbitset_subscript cplbitset_richcompare CSWTCH.486 CSWTCH.487 CSWTCH.488 CSWTCH.489 immbitset_richcompare mutbitset_richcompare anybitset_get_indisize nybitset_exports nybitset_methods bitsingle_doc bitrange_doc immbitset_doc bitform_doc mutbitset_as_number mutbitset_as_sequence mutbitset_as_mapping mutbitset_doc mutbitset_methods mutbitset_members mutbitset_getsets add_doc append_doc clear_doc discard_doc pop_doc remove_doc mutable_copy_doc tasbit_doc tacbit_doc cplbitset_as_number cplbitset_as_sequence cplbitset_doc cplbitset_methods cplbitset_getsets immbitset_as_number immbitset_as_sequence immbitset_as_mapping ImmBitSet_doc immbitset_methods immbitset_getsets mutnsiter_getiter nodeset_op_set nodeset_iop_iterable_visit nodeset_length nodeset_nonzero immnsiter_traverse as_immutable_visit immnodeset_gc_traverse immnodeset_hash immnodeset_obj_at immnodeset_iter immnsiter_iternext nodeset_dealloc_iter immnsiter_dealloc mutnsiter_iternext nodeset_relate_visit mutnodeset_iterate_visit mutnsiter_dealloc nodeset_tas nodeset_add nodeset_append nodeset_bitset nodeset_richcompare immnodeset_gc_clear nodeset_pop mutnodeset_gc_clear mutnodeset_gc_traverse nodeset_tac nodeset_discard nodeset_remove nodeset_iand_visit immnsiter_getiter nodeset_iop_chk_iterable immnodeset_dealloc mutnodeset_dealloc nodeset_clear nodeset_op.constprop.3 nodeset_op.part.0 nodeset_op.constprop.3.cold nodeset_ior nodeset_or mutnodeset_new nodeset_op.constprop.0 nodeset_op.constprop.0.cold nodeset_xor nodeset_ixor nodeset_op.constprop.1 nodeset_sub nodeset_isub nodeset_op.constprop.2 nodeset_and nodeset_iand immnodeset_new nynodeset_exports immnodeset_methods immnodeset_obj_at_doc immnodeset_getset immnodeset_members immnodeset_doc nodeset_as_number nodeset_as_sequence nodeset_as_mapping mutnodeset_getset mutnodeset_members mutnodeset_methods tas_doc tac_doc mutnodeset_doc deregister_tm_clones __do_global_dtors_aux completed.0 __do_global_dtors_aux_fini_array_entry frame_dummy __frame_dummy_init_array_entry moduledef nysets_heapdefs module_methods __FRAME_END__ __dso_handle _DYNAMIC __GNU_EH_FRAME_HDR __TMC_END__ _GLOBAL_OFFSET_TABLE_ PyUnicode_FromFormat mutbitset_ior NyMutBitSet_hasbit NyImmNodeSet_Type generic_indisize NyImmNodeSet_SubtypeNewIterable PySequence_Check PyDict_SetItemString NyImmBitSet_SubtypeNewArg _PyTrash_cond nodeset_relate _ITM_deregisterTMCloneTable mutbitset_is_immutable_doc NyNodeSet_be_immutable NyMutNodeSet_New mutbitset_iand PyMem_Free NyMutNodeSet_SubtypeNewIterable PyObject_GetAttrString PyObject_InitVar PyBytes_FromStringAndSize _NyImmBitSet_EmptyStruct _Py_Dealloc PyErr_NoMemory PyObject_GC_Del PyIter_Next _Py_NotImplementedStruct immbitset_iter NyMutNodeSet_NewHiding NyNodeSet_hasobj PyObject_RichCompare NyMutBitSet_pop _fini cplbitset_new PyObject_GC_Track PyCMethod_New NyNodeSet_invobj NyNodeSet_setobj PyNumber_Long PyErr_SetString NyMutNodeSet_Type sf_slice _PyObject_GC_New fsb_dx_addmethods nodeset_indisize PyExc_ValueError PyExc_TypeError PyType_GenericNew _PyLong_Frexp PySlice_Type _PyLong_FromByteArray NyAnyBitSet_length NyCplBitSet_Type memset@@GLIBC_2.2.5 NyMutNodeSet_SubtypeNewFlags PyObject_Free PyLong_FromSsize_t PyType_Ready PyLong_AsSsize_t NyImmNodeSet_New NyImmBitSet_SubtypeNew cplbitset_traverse mutbitset_ixor NyImmNodeSet_NewCopy PyNumber_Or mutnodeset_iter PyNumber_And NyMutBitSet_clrbit _PyTrash_begin _Py_FalseStruct NyCplBitSet_New_Del PyLong_AsUnsignedLongMask NyImmBitSetIter_Type __gmon_start__ PyTuple_New NyMutBitSet_setbit PyObject_GenericGetAttr PyThreadState_Get PyExc_OverflowError NyNodeSet_iterate memcpy@@GLIBC_2.14 nodeset_traverse NyImmBitSet_Type NyNodeSet_Type PyErr_Occurred PyModule_Create2 PyLong_AsLong sets_doc _PyObject_NewVar mutbitset_indisize PyInit_setsc NyMutBitSet_SubtypeNew _PyArg_ParseTuple_SizeT fsb_dx_nybitset_init nodeset_get_is_immutable _Py_NoneStruct NyCplBitSet_New NyImmBitSet_hasbit NyImmBitSet_New PyType_GenericAlloc NyUnion_Type PyObject_Realloc NyImmNodeSet_NewSingleton anybitset_indisize mutbitset_isub _PyArg_ParseTupleAndKeywords_SizeT _PyTrash_end _Py_TrueStruct NyMutNodeSetIter_Type NyCplBitSet_SubtypeNew PyExc_IndexError NyImmNodeSet_SubtypeNew NyImmNodeSet_SubtypeNewCopy cpl_conv_left NyMutBitSet_Type PyDict_Next memmove@@GLIBC_2.2.5 _NyImmBitSet_OmegaStruct NyAnyBitSet_iterate NyMutBitSet_clear _PyObject_New PyUnicode_FromString pos_add_check PyObject_GetIter fsb_dx_nynodeset_init PyExc_ImportError NyMutBitSet_AsImmBitSet immbitset_int PySequence_List NyMutNodeSet_NewFlags PyCapsule_New PyType_IsSubtype _PyLong_AsByteArray NyMutBitSet_New PyTuple_Size PyErr_Format immbitset_is_immutable_doc mutbitset_iter PyModule_GetDict _ITM_registerTMCloneTable cpl_conv_right claset_load PyBytes_AsStringAndSize NyBitSet_Type PyNumber_Invert NyNodeSet_clear mutbitset_iop PyMem_Malloc __cxa_finalize@@GLIBC_2.2.5 PyNumber_Subtract PyNumber_Xor NyNodeSet_clrobj PyObject_GC_UnTrack NyImmNodeSetIter_Type .symtab .strtab .shstrtab .note.gnu.build-id .gnu.hash .dynsym .dynstr .gnu.version .gnu.version_r .rela.dyn .rela.plt .init .text .fini .rodata .eh_frame_hdr .eh_frame .init_array .fini_array .data.rel.ro .dynamic .got .got.plt .data .bss .comment 8 8 $ . o ` ` 8 @
H o : U o 0 d n B ? ? x P P s P P ~ V V Ȱ ) ) \ H0 H0 ' m ] (m (] 0m 0] 8m 8] o _ p ` ` `s `c V ` ` 0 ` / (& C