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: chain(p, q, ...) --> p0, p1, ... plast, q0, q1, ... compress(data, selectors) --> (d[0] if s[0]), (d[1] if s[1]), ... dropwhile(pred, seq) --> seq[n], seq[n+1], starting when pred fails groupby(iterable[, keyfunc]) --> sub-iterators grouped by value of keyfunc(v) 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 takewhile(pred, seq) --> seq[0], seq[1], until pred fails izip(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... izip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ...
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. repeat(object [,times]) -> create an iterator which returns the object for the specified number of times. If not specified, returns the object endlessly.Private method returning an estimate of len(list(it)).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.count(start=0, step=1) --> count object
Return a count object whose .next() method returns consecutive values. Equivalent to:
def count(firstval=0, step=1): x = firstval while 1: yield x x += step Return state information for pickling.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.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.compress(data, selectors) --> iterator over selected data
Return data elements corresponding to true selector elements. Forms a shorter iterator from selected data elements using the selectors to choose the data elements.permutations(iterable[, r]) --> permutations object
Return successive r-length permutations of elements in the iterable.
Return successive r-length combinations of elements in the iterable allowing individual elements to have successive repeats. combinations_with_replacement('ABC', 2) --> AA AB AC BB BC CCcombinations(iterable, r) --> combinations object
Return successive r-length combinations of elements in the iterable.
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).
To compute the product of an iterable with itself, specify the number of repetitions with the optional repeat keyword argument. For example, product(A, repeat=4) means the same as product(A, A, A, A).
Alternate chain() constructor taking a single iterable argument that evaluates lazily.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.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.starmap(function, sequence) --> starmap object
Return an iterator whose values are returned from the function evaluated with an argument tuple taken from the given sequence.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.takewhile(predicate, iterable) --> takewhile object
Return successive entries from an iterable as long as the predicate evaluates to true for each entry.dropwhile(predicate, iterable) --> dropwhile object
Drop items from the iterable while predicate(item) is true. Afterwards, return every element until the iterable is exhausted.cycle(iterable) --> cycle object
Return elements from the iterable until it is exhausted. Then repeat the sequence indefinitely.tee(iterable, n=2) --> tuple of n independent iterators.Iterator wrapped to make it copyableReturns an independent iterator.Data container common to multiple tee objects.groupby(iterable[, keyfunc]) -> create an iterator which returns (key, sub-iterator) grouped by each value of key(value). I��I��B�G�Q�W�I���\�I�b�ց M� }�`z�� ���{�� D��w�� �~A�� f�80<�E� 0x�[�]�� �;�Q�E� @9`9�� �P��(�<�E� �8�G�_��(=�z�E�� �8|� �kȀ p=�E�� P8pn�a߀ �=�E�� 8Po�b� 0>�E@� �70p�O�@PU�E � `7PEpY0�80W�E� 7�H�U�8Y�E � �6�J�W2�0�T�E� p6@CRR� �>�E`� 6�g � �wb� �>�E@� �5�r�cq� P?�E�� �5�s�d��8�?�E@� @4`4�h��(�?�E� �3q�e��(P@�E�� �3�q�f��(�@�E`� P3�u@t́( C�A@� 03�B �x`� �Bځ�;�A�� �v 2� �:�A�1@:�80;�E� @vpy�NGA$3a1�*�~GA$3p1113�1�~GA*GA$annobin gcc 8.5.0 20210514GA$plugin name: gcc-annobinGA$running gcc 8.5.0 20210514GA*GA*GA! GA*FORTIFYGA+GLIBCXX_ASSERTIONSGA*GOW*�GA*cf_protectionGA+omit_frame_pointerGA+stack_clashGA!stack_realign GA*FORTIFY�12GA+GLIBCXX_ASSERTIONSitertoolsmodule.so-2.7.18-17.module_el8.10.0+3783+2756348e.alma.x86_64.debug*g�C�7zXZ�ִF!t/���c]?�E�h=��ڊ�2N���F�]d�p�(k=���<G�X�e��s�Û�0v��';�>�s뮖�9y�]D�{�w�u$��ͯ�%�վ�|�Ed���k�{L�{s�:D�r��D̺�jw]� ~���P8��LE��ՠߋ���W�%v�4.�&�w��ٱ�\�����=�4�Z�5���-��$��.��%�Q� ��o:�D��C+'E5�z�3>��FWp[C�0�$�~��|��6� �M�� �cm�c�E0{�N���bi'��s���o�; �C����f�ο�`�I��;>����d��ϯ���fWs�4îw��P�5���x�(�`Ɓt!%:��A|0���P�s��V�M�"﹤atHp�@�Gʊ�Z�=��D��=Ě��1��cPГI����Ř��P靛�q�}ȐP )�}|�W��6h��o*�C<M�S�L��:}yl�V�3�f3��V�B�%���漛W�m�,��'���$��� x�l=!q�|@�Q�����J��������غp���y��Q���x�'bU����#�A`p[�~9�+v rJ-�z䛨��F���Q��ί�s���Eކ���1B?%8�B�ņ*Gť:E���J�"�������� ],_dg5l4w�(.[i�(@q�ާ�+����D��JI�����,��G�� �i�n�Q{*�-���r>f��0=��\�� �G��XW�]ӯ��彵�+��^��ZN�Yy�Gꗩhj��ء���6�5�a��� ���_����^5y�'���|�H�y4�D�o�jd4<�]~��qޠ����>UMDQ%����L���/m���X&~C �ooe �%h�U=$��A#���|vN��Л��S fކ��st��<3��lq^p�xGd���Ȏ�E��LY$T��|�r�e�HHq�V��0q<2�O7��O��Nx�M�����8|�Se jV�;&�M���J$rǺ� ���6�D�. u/�~���|�;l���B{�u��̋�@�?l`��h �O*o���Ꭹ`V W��vd�Ί��]��u�lequ-o�]�̘����<H�~FH0%;���6 �3@�$G�S� ���ڻr4�G`�ne&��V�#�Ho��V�> �?v)�=�o�{��8�����{"A�¡�J�P S����~��Z�~p�`ԉq��D�GR���8Q�<]��(|߽���\�ڈk|zNOѽ-*�]kdu-u�v�{[���J�����O�i ���"hz��,Y� )̠Ko�&wC�a�-�h@]g�K�K�\v"�ӡ����_�<F�ٞݛ� �`f]v|��?�j�1`"���*�H3 /r`��?+46�/lA��� C��B�cs���Z9��l'п ���0��}kU�4�q�cd�c��3֒z��C�@�j�3�۵'T{�1vp�3�&@�U߃�ר�I��3�4:�g����Gx5�4�ŀ9 �����}��C��;g��?���ڞeя�"��<S���J��E,���"IK��`�f�rjU��%0D)�,F:�c����4�f���b6����9�%ڱ�g�YZ.shstrtab.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.plt.sec.text.fini.rodata.eh_frame_hdr.eh_frame.note.gnu.property.init_array.fini_array.data.rel.ro.dynamic.got.data.bss.gnu.build.attributes.gnu_debuglink.gnu_debugdata88$���o``4(���0@ @ �8���o� � �E���oxx0T��^B�%�%�h�*�*c�*�*@n�-�-0w11�M}�~�~ �2�~�~��X�X�4���������� �؛ ؛�� ��� ��� ���� � �� �HA �H� H��P�`H�H ��T�����(