�&ǐk�@'bJ�h�ۊL'}T� :��'2�Z#$��n�a��� �>a��`��_3d�Qpt�/�P -��#5�,�M��� �pA:©�q�����NW��ډ�A���� �9nʺج���� �TSM��{J6?7��r�@�\����D��� �׶���s�f�TJj?"��D��`?��̒� b�#�%�C*v�$�{�$����5Ծ�F�s��y�e/8��h-�f�̰&(����Gj�L:U� 2�� ����v�_k����Y��gp,�k�WF�R������_C�R��N@���R�@�ߔ?A�w9���F("iNa-S���Q�o�3tDMLh*�#4k�T/iQ��Y*�G��m����)��8�hBm/�I�,g�ﯖ���Z��}�Cz�q@´��d.����L�ŕ�,��1�Z�܌�: ̪���F+J-'��c�tvJ8��]Q-��b��y �6;*J`r_�d ��'�G ~p��)'�C,�%F��E(��2�k�����lР�z�!�=t ��_�0��f7��� ;�p�|�U �% heap[0]: item = heapreplace(heap, item) i(R(RRR((s/usr/lib64/python2.7/heapq.pyRs   cCsB|r>t|d|r>|d|}|dt|}x+tt|dD]}t||q#WdS(s8Transform list into a heap, in-place, in O(len(x)) time.iN(RtreversedtxrangeR(Rtnti((s/usr/lib64/python2.7/heapq.pyRs cCsB|r>t||dr>|d|}|dt|}x+tt|dD]}t||q#WdS(s;Transform list into a maxheap, in-place, in O(len(x)) time.iN(RRtrangeR!(RRR ((s/usr/lib64/python2.7/heapq.pyt _heapify_maxs cCs}|dkrgSt|}tt||}|s;|St|t}x|D]}|||qRW|jdt|S(sfFind the n largest elements in a dataset. Equivalent to: sorted(iterable, reverse=True)[:n] itreverse(titertlistRRRtsorttTrue(Rtiterabletittresultt _heappushpoptelem((s/usr/lib64/python2.7/heapq.pyRs    cCsw|dkrgSt|}tt||}|s;|St|t}x|D]}|||qRW|j|S(sYFind the n smallest elements in a dataset. Equivalent to: sorted(iterable)[:n] i(R&R'RR$R"R((RR*R+R,R-R.((s/usr/lib64/python2.7/heapq.pyRs     cCsi||}xN||krZ|dd?}||}t||rV|||<|}q nPq W|||>> list(merge([1,3,5,7], [0,2,4,8], [5,10,15,20], [], [25])) [0, 1, 2, 3, 4, 5, 5, 7, 8, 10, 15, 20, 25] iiN( RRt StopIterationRRt enumeratetmapR&tnextRt__self__( t iterablest_heappopt _heapreplacet_StopIterationt_lenthth_appendtitnumR+R<tvts((s/usr/lib64/python2.7/heapq.pyRes2  "     c CsQ|dkrut|}tt|d}|s7gS|dkrYtt||gStt||d|gSyt|}Wnttfk rn!X||krt |d|| S|dkrt |t }t ||}t td|St|\}}t t||t |}t ||}t td|S(sbFind the n smallest elements in a dataset. Equivalent to: sorted(iterable, key=key)[:n] itkeyiiN(R&R'RtNonetminR Rt TypeErrortAttributeErrortsortedR R t _nsmallestR;RR R ( RR*RHR+theadtsizeR,tin1tin2((s/usr/lib64/python2.7/heapq.pyRs,     c Csc|dkrut|}tt|d}|s7gS|dkrYtt||gStt||d|gSyt|}Wnttfk rn'X||krt |d|dt | S|dkr t |t dd}t ||}ttd|St|\}}t t||t dd|}t ||}ttd|S(soFind the n largest elements in a dataset. Equivalent to: sorted(iterable, key=key, reverse=True)[:n] iRHR%iiiN(R&R'RRItmaxR RRKRLRMR)R R t _nlargestR;RR R ( RR*RHR+RORPR,RQRR((s/usr/lib64/python2.7/heapq.pyRs,     $t__main__iiiii iiiiiN((t__doc__t __about__t__all__t itertoolsRR R R R R toperatorRRRRRRRR"R$RRRRR7R!t_heapqt ImportErrorRRNRIRTt__name__RtdataRR(Rtdoctestttestmod(((s/usr/lib64/python2.7/heapq.pytsN`.         5     ) $ % $