%PDF- %PDF-
Mini Shell

Mini Shell

Direktori : /usr/lib/python3/dist-packages/more_itertools/__pycache__/
Upload File :
Create Path :
Current File : //usr/lib/python3/dist-packages/more_itertools/__pycache__/more.cpython-312.pyc

�

�ݷe�.��j�ddlZddlmZmZmZmZddlmZddlm	Z	m
Z
mZmZddl
mZmZmZddlmZmZmZmZmZmZmZmZmZmZmZmZmZddlm Z m!Z!m"Z"m#Z#m$Z$m%Z%ddl&m'Z'm(Z(dd	l)m)Z)m*Z*m+Z+dd
l,m-Z-m.Z.m/Z/m0Z0m1Z1m2Z2m3Z3ddl4m5Z5m6Z6ddl7m8Z8d
dl9m:Z:m;Z;m<Z<m=Z=m>Z>m?Z?m@Z@mAZAmBZBmCZCmDZDgd�ZEd�d�ZFe:fd�ZGe:fd�ZHe:fd�ZIGd�d�ZJd�ZKd�ZLd�ZMd�ZNd�d�ZOd�ZPd�d�ZQd�d�ZRd�d�ZSd �ZTd�d!�ZUd"�ZVd�d#�ZWGd$�d%�ZXd�d&�ZYd'�ZZd(�Z[d�d)�Z\d�d*�Z]d�d+�Z^d�d,�Z_d�d-�Z`d�d.�Zad�d/�Zbd�d0�Zcd1�Zdd�d2�Zed�d3�Zfd�d4�Zgd5�Zhd�d6�Zid7�Zjddd8�d9�Zkd�d;�Zld<�Zmd=�Zneoepffd>�Zqd�d?�Zrd�d@�ZsGdA�dBejej��Zud�dC�ZvdD�ZwexdfdE�ZydF�ZzdG�Z{dH�Z|dI�Z}GdJ�dK�Z~dL�ZdM�Z�dN�fdO�Z�e/fddP�dQ�Z�GdR�dSe�Z�GdT�dU�Z�GdV�dW�Z�exfdX�Z�dY�Z�d:dZ�Z�d�d[�Z�exdfd\�Z�d�d]�Z�d^�Z�d�d_�Z�Gd`�da�Z�d�db�Z�Gdc�dd�Z�de�Z�df�Z�dg�Z�dh�Z�di�Z�dj�fdk�Z�dl�Z�dm�Z�d�dn�Z�d�do�Z�Gdp�dqe��Z�Gdr�ds�Z�dt�Z�d�du�Z�dv�Z�dw�Z�dx�Z�dy�Z�dz�Z�d{�Z�d|�Z�d}�Z�Gd~�d�Z�d��Z�d��Z�d��Z�eoepfdd��d��Z�d�d��Z�d�d��Z�d�d��Z�d�d��Z�de:d��d��Z�de�d�fd��Z�d��Z�d��Z�d��Z�d��Z�d��Z�d��Z�y)��N)�Counter�defaultdict�deque�abc)�Sequence)�cached_property�partial�reduce�wraps)�heapify�heapreplace�heappop)
�chain�compress�count�cycle�	dropwhile�groupby�islice�repeat�starmap�	takewhile�tee�zip_longest�product)�exp�	factorial�floor�log�perm�comb)�Empty�Queue)�random�	randrange�uniform)�
itemgetter�mul�sub�gt�lt�ge�le)�
hexversion�maxsize)�	monotonic�)�_marker�
_zip_equal�UnequalIterablesError�consume�flatten�pairwise�powerset�take�unique_everseen�	all_equal�batched)i�AbortThread�SequenceViewr4�adjacent�
all_unique�always_iterable�always_reversible�bucket�
callback_iter�chunked�chunked_even�circular_shifts�collapse�combination_index�"combination_with_replacement_index�consecutive_groups�constrained_batches�consumer�count_cycle�	countable�
difference�distinct_combinations�distinct_permutations�
distribute�divide�duplicates_everseen�duplicates_justseen�classify_unique�	exactly_n�
filter_except�
filter_map�first�gray_product�groupby_transform�ichunked�iequals�ilen�
interleave�interleave_evenly�interleave_longest�intersperse�	is_sorted�islice_extended�iterate�
iter_suppress�last�locate�longest_common_prefix�lstrip�make_decorator�
map_except�map_if�
map_reduce�	mark_ends�minmax�nth_or_last�nth_permutation�nth_product� nth_combination_with_replacement�
numeric_range�one�only�
outer_product�padded�partial_product�
partitions�peekable�permutation_index�
product_index�raise_�repeat_each�repeat_last�replace�rlocate�rstrip�
run_length�sample�seekable�set_partitions�side_effect�sliced�
sort_together�split_after�split_at�split_before�
split_into�
split_when�spy�stagger�strip�
strictly_n�
substrings�substrings_indexes�takewhile_inclusive�time_limited�unique_in_window�unique_to_each�unzip�value_chain�windowed�windowed_complete�	with_iter�
zip_broadcast�	zip_equal�
zip_offsetFc	����ttt�t|��g��|r#��td����fd�}t|��S�S)aJBreak *iterable* into lists of length *n*:

        >>> list(chunked([1, 2, 3, 4, 5, 6], 3))
        [[1, 2, 3], [4, 5, 6]]

    By the default, the last yielded list will have fewer than *n* elements
    if the length of *iterable* is not divisible by *n*:

        >>> list(chunked([1, 2, 3, 4, 5, 6, 7, 8], 3))
        [[1, 2, 3], [4, 5, 6], [7, 8]]

    To use a fill-in value instead, see the :func:`grouper` recipe.

    If the length of *iterable* is not divisible by *n* and *strict* is
    ``True``, then ``ValueError`` will be raised before the last
    list is yielded.

    z*n must not be None when using strict mode.c3�V�K��D]}t|��k7rtd��|���!y�w)Nziterable is not divisible by n.��len�
ValueError)�chunk�iterator�ns ���5/usr/lib/python3/dist-packages/more_itertools/more.py�retzchunked.<locals>.ret�s2�����!�
���u�:��?�$�%F�G�G���
���&))�iterr	r9r�)�iterabler��strictr�r�s `  @r�rErE�sJ���&�G�D�!�T�(�^�4�b�9�H�
��9��I�J�J�	��C�E�{����c�@�|D]}|cS|turtd��|S)a�Return the first item of *iterable*, or *default* if *iterable* is
    empty.

        >>> first([0, 1, 2, 3])
        0
        >>> first([], 'some default')
        'some default'

    If *default* is not provided and there are no items in the iterable,
    raise ``ValueError``.

    :func:`first` is useful when you have a generator of expensive-to-retrieve
    values and want any arbitrary one. It is marginally shorter than
    ``next(iter(iterable), default)``.

    zKfirst() was called on an empty iterable, and no default value was provided.)r2r�)r��default�items   r�r[r[�s9��"�������'���
*�
�	
��Nr�c��	t|t�r|dSt|d�rtdk7rt	t|��St
|d��dS#tttf$r|turtd��|cYSwxYw)aReturn the last item of *iterable*, or *default* if *iterable* is
    empty.

        >>> last([0, 1, 2, 3])
        3
        >>> last([], 'some default')
        'some default'

    If *default* is not provided and there are no items in the iterable,
    raise ``ValueError``.
    ����__reversed__i�r1��maxlenzDlast() was called on an empty iterable, and no default was provided.)�
isinstancer�hasattrr.�next�reversedr�
IndexError�	TypeError�
StopIterationr2r�)r�r�s  r�riri�s�����h��)��B�<��
�X�~�
.�J�*�4L����*�+�+���!�,�R�0�0���	�=�1���g�����
���
�s�A�(A�A�)A<�;A<c�6�tt||dz�|��S)agReturn the nth or the last item of *iterable*,
    or *default* if *iterable* is empty.

        >>> nth_or_last([0, 1, 2, 3], 2)
        2
        >>> nth_or_last([0, 1], 2)
        1
        >>> nth_or_last([], 0, 'some default')
        'some default'

    If *default* is not provided and there are no items in the iterable,
    raise ``ValueError``.
    r1�r�)rir)r�r�r�s   r�rsrs�s����x��Q��'��9�9r�c�D�eZdZdZd�Zd�Zd�Zefd�Zd�Z	d�Z
d�Zd	�Zy
)r~aWrap an iterator to allow lookahead and prepending elements.

    Call :meth:`peek` on the result to get the value that will be returned
    by :func:`next`. This won't advance the iterator:

        >>> p = peekable(['a', 'b'])
        >>> p.peek()
        'a'
        >>> next(p)
        'a'

    Pass :meth:`peek` a default value to return that instead of raising
    ``StopIteration`` when the iterator is exhausted.

        >>> p = peekable([])
        >>> p.peek('hi')
        'hi'

    peekables also offer a :meth:`prepend` method, which "inserts" items
    at the head of the iterable:

        >>> p = peekable([1, 2, 3])
        >>> p.prepend(10, 11, 12)
        >>> next(p)
        10
        >>> p.peek()
        11
        >>> list(p)
        [11, 12, 1, 2, 3]

    peekables can be indexed. Index 0 is the item that will be returned by
    :func:`next`, index 1 is the item after that, and so on:
    The values up to the given index will be cached.

        >>> p = peekable(['a', 'b', 'c', 'd'])
        >>> p[0]
        'a'
        >>> p[1]
        'b'
        >>> next(p)
        'a'

    Negative indexes are supported, but be aware that they will cache the
    remaining items in the source iterator, which may require significant
    storage.

    To check whether a peekable is exhausted, check its truth value:

        >>> p = peekable(['a', 'b'])
        >>> if p:  # peekable has items
        ...     list(p)
        ['a', 'b']
        >>> if not p:  # peekable is exhausted
        ...     list(p)
        []

    c�B�t|�|_t�|_y�N)r��_itr�_cache��selfr�s  r��__init__zpeekable.__init__?s����>����g��r�c��|Sr���r�s r��__iter__zpeekable.__iter__C����r�c�D�	|j�y#t$rYywxYw�NFT��peekr�r�s r��__bool__zpeekable.__bool__F�)��	��I�I�K����	��	����	�c���|js/	|jjt|j��|jdS#t$r|t
ur�|cYSwxYw)z�Return the item that will be next returned from ``next()``.

        Return ``default`` if there are no items left. If ``default`` is not
        provided, raise ``StopIteration``.

        r)r��appendr�r�r�r2)r�r�s  r�r�z
peekable.peekMs[���{�{�
����"�"�4����>�2�
�{�{�1�~���	!�
��g�%����
�s�.A�A"�!A"c�L�|jjt|��y)aStack up items to be the next ones returned from ``next()`` or
        ``self.peek()``. The items will be returned in
        first in, first out order::

            >>> p = peekable([1, 2, 3])
            >>> p.prepend(10, 11, 12)
            >>> next(p)
            10
            >>> list(p)
            [11, 12, 1, 2, 3]

        It is possible, by prepending items, to "resurrect" a peekable that
        previously raised ``StopIteration``.

            >>> p = peekable([])
            >>> next(p)
            Traceback (most recent call last):
              ...
            StopIteration
            >>> p.prepend(1)
            >>> next(p)
            1
            >>> next(p)
            Traceback (most recent call last):
              ...
            StopIteration

        N)r��
extendleftr�)r��itemss  r��prependzpeekable.prepend]s��:	
�����x���/r�c�x�|jr|jj�St|j�Sr�)r��popleftr�r�r�s r��__next__zpeekable.__next__|s*���;�;��;�;�&�&�(�(��D�H�H�~�r�c��|j�dn|j}|dkDr9|j�dn|j}|j�tn|j}nM|dkr=|j�dn|j}|j�
tdz
n|j}nt	d��|dks|dkr&|j
j
|j�nitt||�dzt�}t|j
�}||k\r2|j
j
t|j||z
��t|j
�|S)Nr1rr�zslice step cannot be zero)
�step�start�stopr/r�r��extendr��min�maxr�r�list)r��indexr�r�r�r��	cache_lens       r��
_get_slicezpeekable._get_slice�s���Z�Z�'�q�e�j�j���!�8��+�+�-�A�E�K�K�E�$�z�z�1�7��
�
�D�
�A�X� �;�;�.�B�U�[�[�E�&+�j�j�&8�W�H�q�L�u�z�z�D��8�9�9�
�A�I�4�!�8��K�K���t�x�x�(��C��t�$�q�(�'�2�A��D�K�K�(�I��I�~����"�"�6�$�(�(�A�	�M�#B�C��D�K�K� ��'�'r�c�V�t|t�r|j|�St|j�}|dkr&|jj|j�n:||k\r5|jjt|j|dz|z
��|j|S�Nrr1)r��slicer�r�r�r�r�r)r�r�r�s   r��__getitem__zpeekable.__getitem__�s����e�U�#��?�?�5�)�)�����$�	��1�9��K�K���t�x�x�(�
�i�
��K�K���v�d�h�h���	�I�0E�F�G��{�{�5�!�!r�N)
�__name__�
__module__�__qualname__�__doc__r�r�r�r2r�r�r�r�r�r�r�r�r~r~s5��8�t���#�� 0�>�(�4
"r�r~c�.��t���fd��}|S)abDecorator that automatically advances a PEP-342-style "reverse iterator"
    to its first yield point so you don't have to call ``next()`` on it
    manually.

        >>> @consumer
        ... def tally():
        ...     i = 0
        ...     while True:
        ...         print('Thing number %s is %s.' % (i, (yield)))
        ...         i += 1
        ...
        >>> t = tally()
        >>> t.send('red')
        Thing number 0 is red.
        >>> t.send('fish')
        Thing number 1 is fish.

    Without the decorator, you would have to call ``next(t)`` before
    ``t.send()`` could be used.

    c�.���|i|��}t|�|Sr�)r�)�args�kwargs�gen�funcs   �r��wrapperzconsumer.<locals>.wrapper�s����D�#�F�#���S�	��
r�)r)r�r�s` r�rMrM�s"���.�4�[����
�Nr�c�Z�t�}tt||�d��t|�S)z�Return the number of items in *iterable*.

        >>> ilen(x for x in range(1000000) if x % 3 == 0)
        333334

    This consumes the iterable, so handle with care.

    rr�)rr�zipr�)r��counters  r�r`r`�s&���g�G�	�#�h��
 ��+���=�r�c#�FK�	|��	||�}�#t$rYywxYw�w)z�Return ``start``, ``func(start)``, ``func(func(start))``, ...

    >>> from itertools import islice
    >>> list(islice(iterate(lambda x: 2*x, 1), 10))
    [1, 2, 4, 8, 16, 32, 64, 128, 256, 512]

    N)r�)r�r�s  r�rgrg�s6�������	���K�E����	��	�s�!��!�	�!��!c#�RK�|5}|Ed{���ddd�y7�
#1swYyxYw�w)a:Wrap an iterable in a ``with`` statement, so it closes once exhausted.

    For example, this will close the file when the iterator is exhausted::

        upper_lines = (line.upper() for line in with_iter(open('foo')))

    Any context manager which returns an iterable is a candidate for
    ``with_iter``.

    Nr�)�context_managerr�s  r�r�r��s3����
��H����������s �'����	'��$�'c���t|�}	t|�}	t|�}dj	||�}|xst|��#t$r}|xstd�|�d}~wwxYw#t$rY|SwxYw)a�Return the first item from *iterable*, which is expected to contain only
    that item. Raise an exception if *iterable* is empty or has more than one
    item.

    :func:`one` is useful for ensuring that an iterable contains only one item.
    For example, it can be used to retrieve the result of a database query
    that is expected to return a single row.

    If *iterable* is empty, ``ValueError`` will be raised. You may specify a
    different exception with the *too_short* keyword:

        >>> it = []
        >>> one(it)  # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        ValueError: too many items in iterable (expected 1)'
        >>> too_short = IndexError('too few items')
        >>> one(it, too_short=too_short)  # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        IndexError: too few items

    Similarly, if *iterable* contains more than one item, ``ValueError`` will
    be raised. You may specify a different exception with the *too_long*
    keyword:

        >>> it = ['too', 'many']
        >>> one(it)  # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        ValueError: Expected exactly one item in iterable, but got 'too',
        'many', and perhaps more.
        >>> too_long = RuntimeError
        >>> one(it, too_long=too_long)  # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        RuntimeError

    Note that :func:`one` attempts to advance *iterable* twice to ensure there
    is only one item. See :func:`spy` or :func:`peekable` to check iterable
    contents less destructively.

    z&too few items in iterable (expected 1)N�LExpected exactly one item in iterable, but got {!r}, {!r}, and perhaps more.)r�r�r�r��format)r��	too_short�too_long�it�first_value�e�second_value�msgs        r�rxrx�s���X
�h��B���2�h��	*��B�x��

 � &��{�L� A�	��)�*�S�/�)�����M��$L�M��	�����
����
�s(�A�A&�	A#�A�A#�&	A3�2A3c��||��r�r�)�	exceptionr�s  r�r�r�<s
��
�T�
�r�c#��K�|�d�}|�d�}t|�}t|�D]}	t|�}|���	t|�||dz�y#t$r||�YywxYw#t$rYywxYw�w)awValidate that *iterable* has exactly *n* items and return them if
    it does. If it has fewer than *n* items, call function *too_short*
    with those items. If it has more than *n* items, call function
    *too_long* with the first ``n + 1`` items.

        >>> iterable = ['a', 'b', 'c', 'd']
        >>> n = 4
        >>> list(strictly_n(iterable, n))
        ['a', 'b', 'c', 'd']

    Note that the returned iterable must be consumed in order for the check to
    be made.

    By default, *too_short* and *too_long* are functions that raise
    ``ValueError``.

        >>> list(strictly_n('ab', 3))  # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        ValueError: too few items in iterable (got 2)

        >>> list(strictly_n('abc', 2))  # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        ValueError: too many items in iterable (got at least 3)

    You can instead supply functions that do something else.
    *too_short* will be called with the number of items in *iterable*.
    *too_long* will be called with `n + 1`.

        >>> def too_short(item_count):
        ...     raise RuntimeError
        >>> it = strictly_n('abcd', 6, too_short=too_short)
        >>> list(it)  # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        RuntimeError

        >>> def too_long(item_count):
        ...     print('The boss is going to hear about this')
        >>> it = strictly_n('abcdef', 4, too_long=too_long)
        >>> list(it)
        The boss is going to hear about this
        ['a', 'b', 'c', 'd']

    Nc�@�ttdj|��S)Nz"Too few items in iterable (got {})�r�r�r��
item_counts r��<lambda>zstrictly_n.<locals>.<lambda>ps��v��0�7�7�
�C�(
�r�c�@�ttdj|��S)Nz,Too many items in iterable (got at least {})rrs r�rzstrictly_n.<locals>.<lambda>vs��f��:�A�A�*�M�'
�r�r1)r��ranger�r�)r�r�rrr�ir�s       r�r�r�@s�����^��
�	�
��
��

�h��B�
�1�X���	���8�D�
�J����R��	��Q�����	��a�L��	���
��
�sJ�$A7�A�A7�A(�A7�A%�!A7�$A%�%A7�(	A4�1A7�3A4�4A7c����fd�}d�}t|�}t|��|��}d|cxkr�krnn|�k(r||�S|||�St|rd�Sd�S)a�Yield successive distinct permutations of the elements in *iterable*.

        >>> sorted(distinct_permutations([1, 0, 1]))
        [(0, 1, 1), (1, 0, 1), (1, 1, 0)]

    Equivalent to ``set(permutations(iterable))``, except duplicates are not
    generated and thrown away. For larger input sequences this is much more
    efficient.

    Duplicate permutations arise when there are duplicated elements in the
    input iterable. The number of items returned is
    `n! / (x_1! * x_2! * ... * x_n!)`, where `n` is the total number of
    items input, and each `x_i` is the count of a distinct item in the input
    sequence.

    If *r* is given, only the *r*-length permutations are yielded.

        >>> sorted(distinct_permutations([1, 0, 1], r=2))
        [(0, 1), (1, 0), (1, 1)]
        >>> sorted(distinct_permutations(range(3), r=2))
        [(0, 1), (0, 2), (1, 0), (1, 2), (2, 0), (2, 1)]

    c3��K�	t|���t�dz
dd�D]}||||dzks�nyt�dz
|d�D]}||||ks�n|||c||<||<|d|�z
d�||dzd�x�w)N�r�r1)�tupler)�Ar�j�sizes   �r��_fullz$distinct_permutations.<locals>._full�s���������(�N��4�!�8�R��,�
���Q�4�!�A��E�(�?��
�
��4�!�8�Q��+�
���Q�4�!�A�$�;��
��1��q��t�J�A�a�D�!�A�$��?�Q��X��?�+�A�a�!�e�g�J�)�s�0A=�"A=�&A=c3�K�|d|||d}}t|dz
dd�}tt|��}	t|���|d}|D]}|||krn||}�y|D] }||||kDs�||||c||<||<n&|D] }||||kDs�||||c||<||<n||d||z
d�z
}|dz
}|d||z
|||z
dc||d|dd���w)Nr1r�)rr�r)	r�r�head�tail�right_head_indexes�left_tail_indexes�pivotrrs	         r��_partialz'distinct_permutations.<locals>._partial�sS�����r��U�A�a�b�E�d��"�1�q�5�"�b�1��!�#�d�)�,�����+����H�E�'�
����7�U�?���Q���
�
�'�

����7�T�!�W�$�'+�A�w��Q��$�D��G�T�!�W��

�,��A��A�w��a��(�+/��7�D��G�(��Q���a����
�D��1�q�5�2��&�&�D�
��F�A� $�W�q�1�u�
�t�A��E�G�}��D���H�d�1�g�?�s�A)C�,$C�?Crr�)r�)�sortedr�r�)r�r rr&r�rs     @r�rRrR�si���4,�0%=�N
�8��E��u�:�D��y����1�}��}� !�T�	�u�U�|�B����0B�B��a��#�#�U�#�#r�c���|dk(rtd��|dk(r ttt|�|�dd�St|g�}t	||�}ttt||�dd��S)a6Intersperse filler element *e* among the items in *iterable*, leaving
    *n* items between each filler element.

        >>> list(intersperse('!', [1, 2, 3, 4, 5]))
        [1, '!', 2, '!', 3, '!', 4, '!', 5]

        >>> list(intersperse(None, [1, 2, 3, 4, 5], n=2))
        [1, 2, None, 3, 4, None, 5]

    rz
n must be > 0r1N)r�rrarrEr6)r	r�r��filler�chunkss     r�rdrd�sm��	�A�v���)�)�	
�a���j����H�5�q�$�?�?�
�������1�%���v�j���8�!�T�B�C�Cr�c	�2�|D�cgc]
}t|���}}ttjt	t
|���}|D�chc]
}||dk(s�|��}}|D�cgc]!}tt
|j|����#c}Scc}wcc}wcc}w)a�Return the elements from each of the input iterables that aren't in the
    other input iterables.

    For example, suppose you have a set of packages, each with a set of
    dependencies::

        {'pkg_1': {'A', 'B'}, 'pkg_2': {'B', 'C'}, 'pkg_3': {'B', 'D'}}

    If you remove one package, which dependencies can also be removed?

    If ``pkg_1`` is removed, then ``A`` is no longer necessary - it is not
    associated with ``pkg_2`` or ``pkg_3``. Similarly, ``C`` is only needed for
    ``pkg_2``, and ``D`` is only needed for ``pkg_3``::

        >>> unique_to_each({'A', 'B'}, {'B', 'C'}, {'B', 'D'})
        [['A'], ['C'], ['D']]

    If there are duplicates in one input iterable that aren't in the others
    they will be duplicated in the output. Input order is preserved::

        >>> unique_to_each("mississippi", "missouri")
        [['p', 'p'], ['o', 'u', 'r']]

    It is assumed that the elements of each iterable are hashable.

    r1)r�rr�
from_iterable�map�set�filter�__contains__)�	iterablesr�pool�counts�element�uniquess      r�r�r�s���6 )�)��D��H�)�D�)�
�U�(�(��S�$��8�
9�F�&,�E�7��w��1�0D�w�E�G�E�=A�B�r�D���,�,�b�1�2�B�B��*��E��Bs�B
�	
B�B�!&Bc
#��K�|dkrtd��|dk(r
t���y|dkrtd��t|��}|}t|j|�D]}|dz}|r�|}t|����t|�}|dk(ry||kr%tt
|t|||z
�����yd|cxkrt||�krny||f|zz
}t|���yy�w)aMReturn a sliding window of width *n* over the given iterable.

        >>> all_windows = windowed([1, 2, 3, 4, 5], 3)
        >>> list(all_windows)
        [(1, 2, 3), (2, 3, 4), (3, 4, 5)]

    When the window is larger than the iterable, *fillvalue* is used in place
    of missing values:

        >>> list(windowed([1, 2, 3], 4))
        [(1, 2, 3, None)]

    Each window will advance in increments of *step*:

        >>> list(windowed([1, 2, 3, 4, 5, 6], 3, fillvalue='!', step=2))
        [(1, 2, 3), (3, 4, 5), (5, 6, '!')]

    To slide into the iterable's items, use :func:`chain` to add filler items
    to the left:

        >>> iterable = [1, 2, 3, 4]
        >>> n = 3
        >>> padding = [None] * (n - 1)
        >>> list(windowed(chain(padding, iterable), 3))
        [(None, None, 1), (None, 1, 2), (1, 2, 3), (2, 3, 4)]
    r�n must be >= 0Nr1zstep must be >= 1r�)	r�rrr-r�r�rrr�)�seqr��	fillvaluer��windowr�_rs        r�r�r�-s�����6	�1�u��)�*�*��A�v��g�
���a�x��,�-�-�
�!�_�F�	�A�
�����
$� ��	�Q�����A���-��	 ��v�;�D��q�y��	
����E�&�&��A��H�"=�>�?�?�	
�Q�	��T�1��	��9�,��"�"���F�m��
�s
�A!C �$A<C c#��K�g}t|�D]}|j|�|f���t|�}t|�}t	d|dz�D]"}t	||z
dz�D]}||||z����$y�w)aFYield all of the substrings of *iterable*.

        >>> [''.join(s) for s in substrings('more')]
        ['m', 'o', 'r', 'e', 'mo', 'or', 're', 'mor', 'ore', 'more']

    Note that non-string iterables can also be subdivided.

        >>> list(substrings([0, 1, 2]))
        [(0,), (1,), (2,), (0, 1), (1, 2), (0, 1, 2)]

    rr1N)r�r�rr�r)r�r8r�rr�rs      r�r�r�bs�����
�C��X�����
�
�4���g�
����*�C��S��J��1�j�1�n�
%�!���z�A�~��)�*�	!�A��a�!�a�%�.� �	!�!�s�A4A6c�d��tdt��dz�}|rt|�}�fd�|D�S)a@Yield all substrings and their positions in *seq*

    The items yielded will be a tuple of the form ``(substr, i, j)``, where
    ``substr == seq[i:j]``.

    This function only works for iterables that support slicing, such as
    ``str`` objects.

    >>> for item in substrings_indexes('more'):
    ...    print(item)
    ('m', 0, 1)
    ('o', 1, 2)
    ('r', 2, 3)
    ('e', 3, 4)
    ('mo', 0, 2)
    ('or', 1, 3)
    ('re', 2, 4)
    ('mor', 0, 3)
    ('ore', 1, 4)
    ('more', 0, 4)

    Set *reverse* to ``True`` to yield the same items in the opposite order.


    r1c3�x�K�|]1}tt��|z
dz�D]}�|||z|||zf����3y�w�r1N)rr�)�.0�Lrr8s   �r��	<genexpr>z%substrings_indexes.<locals>.<genexpr>�sO������'(�u�S��X��\�A�=M�7N��23��Q��Q����A��E�"��"��s�7:)rr�r�)r8�reverser s`  r�r�r�|s7���4	�a��S��A���A���Q�K���,-��r�c�0�eZdZdZdd�Zd�Zd�Zd�Zd�Zy)	rCa�Wrap *iterable* and return an object that buckets the iterable into
    child iterables based on a *key* function.

        >>> iterable = ['a1', 'b1', 'c1', 'a2', 'b2', 'c2', 'b3']
        >>> s = bucket(iterable, key=lambda x: x[0])  # Bucket by 1st character
        >>> sorted(list(s))  # Get the keys
        ['a', 'b', 'c']
        >>> a_iterable = s['a']
        >>> next(a_iterable)
        'a1'
        >>> next(a_iterable)
        'a2'
        >>> list(s['b'])
        ['b1', 'b2', 'b3']

    The original iterable will be advanced and its items will be cached until
    they are used by the child iterables. This may require significant storage.

    By default, attempting to select a bucket to which no items belong  will
    exhaust the iterable and cache all values.
    If you specify a *validator* function, selected buckets will instead be
    checked against it.

        >>> from itertools import count
        >>> it = count(1, 2)  # Infinite sequence of odd numbers
        >>> key = lambda x: x % 10  # Bucket by last digit
        >>> validator = lambda x: x in {1, 3, 5, 7, 9}  # Odd digits only
        >>> s = bucket(it, key=key, validator=validator)
        >>> 2 in s
        False
        >>> list(s[2])
        []

    Nc�r�t|�|_||_tt�|_|xsd�|_y)Nc��y�NTr���xs r�rz!bucket.__init__.<locals>.<lambda>�s�r�)r�r��_keyrrr��
_validator)r�r��key�	validators    r�r�zbucket.__init__�s,����>�����	�!�%�(���#�7���r�c��|j|�sy	t||�}|j|j|�y#t$rYywxYwr�)rKr�r��
appendleftr�)r��valuer�s   r�r0zbucket.__contains__�sT�����u�%��	0���U��$�D�
�K�K���)�)�$�/����	��	�s�A�	A
�A
c#�NK�	|j|r |j|j���nb		t|j�}|j|�}||k(r|��n0|j
|�r|j|j|��a��#t$rYywxYw�w)z�
        Helper to yield items from the parent iterator that match *value*.
        Items that don't match are stored in the local cache as they
        are encountered.
        N)r�r�r�r�r�rJrKr�)r�rPr��
item_values    r��_get_valueszbucket._get_values�s�������{�{�5�!��k�k�%�(�0�0�2�2���#�D�H�H�~��"&���4��J�!�U�*�"�
������4����J�/�6�6�t�<����)����s)�2B%�B�
AB%�	B"�B%�!B"�"B%c#�K�|jD]C}|j|�}|j|�s�&|j|j	|��E|jj�Ed{���y7��wr�)r�rJrKr�r��keys)r�r�rRs   r�r�zbucket.__iter__�sa�����H�H�	5�D����4��J����z�*����J�'�.�.�t�4�	5�
�;�;�#�#�%�%�%�s�2A:�=A:�2A8�3A:c�\�|j|�std�S|j|�S)Nr�)rKr�rS�r�rPs  r�r�zbucket.__getitem__�s(�����u�%���8�O�����&�&r�r�)	r�r�r�r�r�r0rSr�r�r�r�r�rCrC�s!��!�F8��=�4&�'r�rCc�h�t|�}t||�}|j�t||�fS)a�Return a 2-tuple with a list containing the first *n* elements of
    *iterable*, and an iterator with the same items as *iterable*.
    This allows you to "look ahead" at the items in the iterable without
    advancing it.

    There is one item in the list by default:

        >>> iterable = 'abcdefg'
        >>> head, iterable = spy(iterable)
        >>> head
        ['a']
        >>> list(iterable)
        ['a', 'b', 'c', 'd', 'e', 'f', 'g']

    You may use unpacking to retrieve items instead of lists:

        >>> (head,), iterable = spy('abcdefg')
        >>> head
        'a'
        >>> (first, second), iterable = spy('abcdefg', 2)
        >>> first
        'a'
        >>> second
        'b'

    The number of items requested can be larger than the number of items in
    the iterable:

        >>> iterable = [1, 2, 3, 4, 5]
        >>> head, iterable = spy(iterable, 10)
        >>> head
        [1, 2, 3, 4, 5]
        >>> list(iterable)
        [1, 2, 3, 4, 5]

    )r�r9�copyr)r�r�rr!s    r�r�r��s0��J
�h��B���2�;�D��9�9�;��d�B��'�'r�c�8�tjt|��S)a4Return a new iterable yielding from each iterable in turn,
    until the shortest is exhausted.

        >>> list(interleave([1, 2, 3], [4, 5], [6, 7, 8]))
        [1, 4, 6, 2, 5, 7]

    For a version that doesn't terminate after the shortest iterable is
    exhausted, see :func:`interleave_longest`.

    )rr,r��r1s r�rara)s�����s�I��/�/r�c�X�tjt|dti��}d�|D�S)asReturn a new iterable yielding from each iterable in turn,
    skipping any that are exhausted.

        >>> list(interleave_longest([1, 2, 3], [4, 5], [6, 7, 8]))
        [1, 4, 6, 2, 5, 7, 3, 8]

    This function produces the same output as :func:`roundrobin`, but may
    perform better for some inputs (in particular when the number of iterables
    is large).

    r9c3�2K�|]}|tus�|���y�wr�)r2�r@rIs  r�rBz%interleave_longest.<locals>.<genexpr>Ds����-�!�A�W�,�A�-�s�
�)rr,rr2)r1rs  r�rcrc7s)��	���K��F�g�F�G�A�-�q�-�-r�c#���K���	|D�cgc]
}t|���c}�n"t|�t��k7rtd��t��}tt	|��fd�d��}|D�cgc]}�|��	}}|D�cgc]}t||���}}|d|dd}	}|d|dd}}
||zgt|	�z}t
��}
|
rrt|
���|
dz}
t||	�D��cgc]
\}}||z
��}}}t|�D]-\}}|dks�t||���|
dz}
||xx|z
cc<�/|
r�qyycc}w#t$rtd��wxYwcc}wcc}wcc}}w�w)	aG
    Interleave multiple iterables so that their elements are evenly distributed
    throughout the output sequence.

    >>> iterables = [1, 2, 3, 4, 5], ['a', 'b']
    >>> list(interleave_evenly(iterables))
    [1, 2, 'a', 3, 4, 'b', 5]

    >>> iterables = [[1, 2, 3], [4, 5], [6, 7, 8]]
    >>> list(interleave_evenly(iterables))
    [1, 6, 4, 2, 7, 3, 8, 5]

    This function requires iterables of known length. Iterables without
    ``__len__()`` can be used by manually specifying lengths with *lengths*:

    >>> from itertools import combinations, repeat
    >>> iterables = [combinations(range(4), 2), ['a', 'b', 'c']]
    >>> lengths = [4 * (4 - 1) // 2, 3]
    >>> list(interleave_evenly(iterables, lengths=lengths))
    [(0, 1), (0, 2), 'a', (0, 3), (1, 2), 'b', (1, 3), (2, 3), 'c']

    Based on Bresenham's algorithm.
    Nz^Iterable lengths could not be determined automatically. Specify them with the lengths keyword.z,Mismatching number of iterables and lengths.c����|Sr�r�)r�lengthss �r�rz#interleave_evenly.<locals>.<lambda>ns���7�1�:�r�T�rLrCrr1)
r�r�r�r'rr��sumr�r��	enumerate)r1rar�dims�lengths_permuter�lengths_desc�
iters_desc�
delta_primary�deltas_secondary�iter_primary�iters_secondary�errors�to_yieldr	�deltas `              r�rbrbGs������0��	�)2�3�2�s�2�w�3�G�

�Y��3�w�<�	'��G�H�H��w�<�D��
�d��-�t��O�)8�8�1�G�A�J�8�L�8�.=�>��$�y��|�$�>�J�>�'3�1�o�|�A�B�7G�#�M�$.�q�M�:�a�b�>�/�L��t�#�
$�s�+;�'<�
<�F��7�|�H�
��<� � ��A�
��,/��8H�,I�J���5�!�e�)�J��J��f�%�	+�D�A�q��1�u��?�1�-�.�.��A�
���q�	�]�*�	�		+���34���	��9��
�	��9��>��K�s]�E(�E�D;�E�AE(�,E�8E(�>E�AE(�)E"�8E(�&E(�9E(�;E�E�E(c#�F���K����fd���|d�Ed{���y7��w)a>Flatten an iterable with multiple levels of nesting (e.g., a list of
    lists of tuples) into non-iterable types.

        >>> iterable = [(1, 2), ([3, 4], [[5], [6]])]
        >>> list(collapse(iterable))
        [1, 2, 3, 4, 5, 6]

    Binary and text strings are not considered iterable and
    will not be collapsed.

    To avoid collapsing other types, specify *base_type*:

        >>> iterable = ['ab', ('cd', 'ef'), ['gh', 'ij']]
        >>> list(collapse(iterable, base_type=tuple))
        ['ab', ('cd', 'ef'), 'gh', 'ij']

    Specify *levels* to stop flattening after a certain level:

    >>> iterable = [('a', ['b']), ('c', ['d'])]
    >>> list(collapse(iterable))  # Fully flattened
    ['a', 'b', 'c', 'd']
    >>> list(collapse(iterable, levels=1))  # Only one level flattened
    ['a', ['b'], 'c', ['d']]

    c3���K���|�kDs$t|ttf�s��t|��r|��y	t|�}|D]}�||dz�Ed{����y7�#t$r|��YywxYw�w�Nr1)r��str�bytesr�r�)�node�level�tree�child�	base_type�levels�walks    ���r�r{zcollapse.<locals>.walk�s������� �u�v�~��$��e��-��&�J�t�Y�,G��J��	2���:�D�
�
2����u�q�y�1�1�1�
2�1���	��J��	�s4�1A1�A�A1�A�A1�
A.�+A1�-A.�.A1rNr�)r�ryrzr{s ``@r�rHrH�s�����62�$�H�a� � � �s�!��!c#��K�	|�|�|�|D]}||�|���n#t||�D]}||�|Ed{����|�|�yy7�#|�|�wwxYw�w)auInvoke *func* on each item in *iterable* (or on each *chunk_size* group
    of items) before yielding the item.

    `func` must be a function that takes a single argument. Its return value
    will be discarded.

    *before* and *after* are optional functions that take no arguments. They
    will be executed before iteration starts and after it ends, respectively.

    `side_effect` can be used for logging, updating progress bars, or anything
    that is not functionally "pure."

    Emitting a status message:

        >>> from more_itertools import consume
        >>> func = lambda item: print('Received {}'.format(item))
        >>> consume(side_effect(func, range(2)))
        Received 0
        Received 1

    Operating on chunks of items:

        >>> pair_sums = []
        >>> func = lambda chunk: pair_sums.append(sum(chunk))
        >>> list(side_effect(func, [0, 1, 2, 3, 4, 5], 2))
        [0, 1, 2, 3, 4, 5]
        >>> list(pair_sums)
        [1, 5, 9]

    Writing to a file-like object:

        >>> from io import StringIO
        >>> from more_itertools import consume
        >>> f = StringIO()
        >>> func = lambda x: print(x, file=f)
        >>> before = lambda: print(u'HEADER', file=f)
        >>> after = f.close
        >>> it = [u'a', u'b', u'c']
        >>> consume(side_effect(func, it, before=before, after=after))
        >>> f.closed
        True

    N)rE)r�r��
chunk_size�before�afterr�r�s       r�r�r��s�����X����H��� �
���T�
��
�
�!��:�6�
!���U�� � � �
!����G��!�����G��s-�A"�;A�A�A�A"�A�A�A"c�����tt��fd�td��D���|r��fd�}t|��S�S)apYield slices of length *n* from the sequence *seq*.

    >>> list(sliced((1, 2, 3, 4, 5, 6), 3))
    [(1, 2, 3), (4, 5, 6)]

    By the default, the last yielded slice will have fewer than *n* elements
    if the length of *seq* is not divisible by *n*:

    >>> list(sliced((1, 2, 3, 4, 5, 6, 7, 8), 3))
    [(1, 2, 3), (4, 5, 6), (7, 8)]

    If the length of *seq* is not divisible by *n* and *strict* is
    ``True``, then ``ValueError`` will be raised before the last
    slice is yielded.

    This function will only work for iterables that support slicing.
    For non-sliceable iterables, see :func:`chunked`.

    c3�.�K�|]}�||�z���y�wr�r�)r@rr�r8s  ��r�rBzsliced.<locals>.<genexpr>
s�����C�!�s�1�q�1�u�~�C���rc3�V�K��D]}t|��k7rtd��|���!y�w)Nzseq is not divisible by n.r�)�_slicer�r�s ��r�r�zsliced.<locals>.ret
s3�����"�
���v�;�!�#�$�%A�B�B���
�r�)rr�rr�)r8r�r�r�r�s``  @r�r�r��s8���(��C�u�Q��{�C�D�H�
�	��C�E�{���r�c#��K�|dk(rt|���yg}t|�}|D]B}||�r'|��|r|g��|dk(rt|���yg}|dz}�2|j|��D|��y�w)a;Yield lists of items from *iterable*, where each list is delimited by
    an item where callable *pred* returns ``True``.

        >>> list(split_at('abcdcba', lambda x: x == 'b'))
        [['a'], ['c', 'd', 'c'], ['a']]

        >>> list(split_at(range(10), lambda n: n % 2 == 1))
        [[0], [2], [4], [6], [8], []]

    At most *maxsplit* splits are done. If *maxsplit* is not specified or -1,
    then there is no limit on the number of splits:

        >>> list(split_at(range(10), lambda n: n % 2 == 1, maxsplit=2))
        [[0], [2], [4, 5, 6, 7, 8, 9]]

    By default, the delimiting items are not included in the output.
    To include them, set *keep_separator* to ``True``.

        >>> list(split_at('abcdcba', lambda x: x == 'b', keep_separator=True))
        [['a'], ['b'], ['c', 'd', 'c'], ['b'], ['a']]

    rNr1�r�r�r�)r��pred�maxsplit�keep_separator�bufrr�s       r�r�r�s�����.�1�}��8�n���
�C�	
�h��B������:��I���f���1�}��2�h����C���M�H��J�J�t����I�s�A-A/c#��K�|dk(rt|���yg}t|�}|D]@}||�r%|r#|��|dk(r|gt|�z��yg}|dz}|j|��B|r|��yy�w)a\Yield lists of items from *iterable*, where each list ends just before
    an item for which callable *pred* returns ``True``:

        >>> list(split_before('OneTwo', lambda s: s.isupper()))
        [['O', 'n', 'e'], ['T', 'w', 'o']]

        >>> list(split_before(range(10), lambda n: n % 3 == 0))
        [[0, 1, 2], [3, 4, 5], [6, 7, 8], [9]]

    At most *maxsplit* splits are done. If *maxsplit* is not specified or -1,
    then there is no limit on the number of splits:

        >>> list(split_before(range(10), lambda n: n % 3 == 0, maxsplit=2))
        [[0, 1, 2], [3, 4, 5], [6, 7, 8, 9]]
    rNr1r��r�r�r�r�rr�s      r�r�r�Ds����� �1�}��8�n���
�C�	
�h��B������:�#��I��1�}��f�t�B�x�'�'���C���M�H��
�
�4�����	��s�A.A0c#��K�|dk(rt|���yg}t|�}|D]B}|j|�||�s�|s� |��|dk(rt|�}|r|��yg}|dz}�D|r|��yy�w)a[Yield lists of items from *iterable*, where each list ends with an
    item where callable *pred* returns ``True``:

        >>> list(split_after('one1two2', lambda s: s.isdigit()))
        [['o', 'n', 'e', '1'], ['t', 'w', 'o', '2']]

        >>> list(split_after(range(10), lambda n: n % 3 == 0))
        [[0], [1, 2, 3], [4, 5, 6], [7, 8, 9]]

    At most *maxsplit* splits are done. If *maxsplit* is not specified or -1,
    then there is no limit on the number of splits:

        >>> list(split_after(range(10), lambda n: n % 3 == 0, maxsplit=2))
        [[0], [1, 2, 3], [4, 5, 6, 7, 8, 9]]

    rNr1r�r�s      r�r�r�gs�����"�1�}��8�n���
�C�	
�h��B��
���
�
�4����:�#��I��1�}��2�h����I���C���M�H�
���	��s�?A2�A2�-A2c#�K�|dk(rt|���yt|�}	t|�}|g}|D]A}|||�r#|��|dk(r|gt|�z��yg}|dz}|j	|�|}�C|��y#t$rYywxYw�w)a�Split *iterable* into pieces based on the output of *pred*.
    *pred* should be a function that takes successive pairs of items and
    returns ``True`` if the iterable should be split in between them.

    For example, to find runs of increasing numbers, split the iterable when
    element ``i`` is larger than element ``i + 1``:

        >>> list(split_when([1, 2, 3, 3, 2, 5, 2, 4, 2], lambda x, y: x > y))
        [[1, 2, 3, 3], [2, 5], [2, 4], [2]]

    At most *maxsplit* splits are done. If *maxsplit* is not specified or -1,
    then there is no limit on the number of splits:

        >>> list(split_when([1, 2, 3, 3, 2, 5, 2, 4, 2],
        ...                 lambda x, y: x > y, maxsplit=2))
        [[1, 2, 3, 3], [2, 5], [2, 4, 2]]

    rNr1)r�r�r�r�r�)r�r�r�r�cur_itemr��	next_items       r�r�r��s�����&�1�}��8�n���	
�h��B����8���*�C��
�	���)�$��I��1�}� �k�D��H�,�,���C���M�H��
�
�9����
��I��!����s(�B
�A;�AB
�;	B�B
�B�B
c#�K�t|�}|D]*}|�t|���ytt||�����,y�w)a�Yield a list of sequential items from *iterable* of length 'n' for each
    integer 'n' in *sizes*.

        >>> list(split_into([1,2,3,4,5,6], [1,2,3]))
        [[1], [2, 3], [4, 5, 6]]

    If the sum of *sizes* is smaller than the length of *iterable*, then the
    remaining items of *iterable* will not be returned.

        >>> list(split_into([1,2,3,4,5,6], [2,3]))
        [[1, 2], [3, 4, 5]]

    If the sum of *sizes* is larger than the length of *iterable*, fewer items
    will be returned in the iteration that overruns *iterable* and further
    lists will be empty:

        >>> list(split_into([1,2,3,4], [1,2,3,4]))
        [[1], [2, 3], [4], []]

    When a ``None`` object is encountered in *sizes*, the returned list will
    contain items up to the end of *iterable* the same way that itertools.slice
    does:

        >>> list(split_into([1,2,3,4,5,6,7,8,9,0], [2,3,None]))
        [[1, 2], [3, 4, 5], [6, 7, 8, 9, 0]]

    :func:`split_into` can be useful for grouping a series of items where the
    sizes of the groups are not uniform. An example would be where in a row
    from a table, multiple columns represent elements of the same feature
    (e.g. a point represented by x,y,z) but, the format is not the same for
    all columns.
    N)r�r�r)r��sizesrrs    r�r�r��sD����F
�h��B��)���<��r�(�N���v�b�$�'�(�(�)�s�<>c#��K�t|�}|�t|t|��Ed{���y|dkrtd��d}|D]}|��|dz
}�
|r||z
|zn||z
}t	|�D]}|���y7�K�w)a�Yield the elements from *iterable*, followed by *fillvalue*, such that
    at least *n* items are emitted.

        >>> list(padded([1, 2, 3], '?', 5))
        [1, 2, 3, '?', '?']

    If *next_multiple* is ``True``, *fillvalue* will be emitted until the
    number of items emitted is a multiple of *n*::

        >>> list(padded([1, 2, 3, 4], n=3, next_multiple=True))
        [1, 2, 3, 4, None, None]

    If *n* is ``None``, *fillvalue* will be emitted indefinitely.

    Nr1�n must be at least 1r)r�rrr�r)	r�r9r��
next_multiplerrr��	remainingr;s	         r�r{r{�s����� 
�h��B��y���V�I�.�/�/�/�	
�Q���/�0�0��
��	�D��J��!�O�J�	�-:�Q��^�q�(�q�:�~�	��y�!�	�A��O�	�	0�s�&A6�A4�AA6c	�\�tjtt|t|���S)z�Repeat each element in *iterable* *n* times.

    >>> list(repeat_each('ABC', 3))
    ['A', 'A', 'A', 'B', 'B', 'B', 'C', 'C', 'C']
    )rr,r-r)r�r�s  r�r�r�s"�����s�6�8�V�A�Y�?�@�@r�c#�pK�t}|D]}|���|tur|n|}t|�Ed{���y7��w)a"After the *iterable* is exhausted, keep yielding its last element.

        >>> list(islice(repeat_last(range(3)), 5))
        [0, 1, 2, 2, 2]

    If the iterable is empty, yield *default* forever::

        >>> list(islice(repeat_last(range(0), 42), 5))
        [42, 42, 42, 42, 42]

    N)r2r)r�r�r��finals    r�r�r�s;�����D�����
���w��G�D�E��e�}���s�,6�4�6c
��|dkrtd��t||�}t|�D��cgc]\}}t||d|���c}}Scc}}w)a�Distribute the items from *iterable* among *n* smaller iterables.

        >>> group_1, group_2 = distribute(2, [1, 2, 3, 4, 5, 6])
        >>> list(group_1)
        [1, 3, 5]
        >>> list(group_2)
        [2, 4, 6]

    If the length of *iterable* is not evenly divisible by *n*, then the
    length of the returned iterables will not be identical:

        >>> children = distribute(3, [1, 2, 3, 4, 5, 6, 7])
        >>> [list(c) for c in children]
        [[1, 4, 7], [2, 5], [3, 6]]

    If the length of *iterable* is smaller than *n*, then the last returned
    iterables will be empty:

        >>> children = distribute(5, [1, 2, 3])
        >>> [list(c) for c in children]
        [[1], [2], [3], [], []]

    This function uses :func:`itertools.tee` and may require significant
    storage. If you need the order items in the smaller iterables to match the
    original iterable, see :func:`divide`.

    r1r�N)r�rrdr)r�r��childrenr�rs     r�rSrS#sK��8	�1�u��/�0�0��8�Q��H�8A�(�8K�L�9�5�"�F�2�u�d�A�&�L�L��Ls�Ac�F�t|t|��}t||||d��S)a[Yield tuples whose elements are offset from *iterable*.
    The amount by which the `i`-th item in each tuple is offset is given by
    the `i`-th item in *offsets*.

        >>> list(stagger([0, 1, 2, 3]))
        [(None, 0, 1), (0, 1, 2), (1, 2, 3)]
        >>> list(stagger(range(8), offsets=(0, 2, 4)))
        [(0, 2, 4), (1, 3, 5), (2, 4, 6), (3, 5, 7)]

    By default, the sequence will end when the final element of a tuple is the
    last item in the iterable. To continue until the first element of a tuple
    is the last item in the iterable, set *longest* to ``True``::

        >>> list(stagger([0, 1, 2, 3], longest=True))
        [(None, 0, 1), (0, 1, 2), (1, 2, 3), (2, 3, None), (3, None, None)]

    By default, ``None`` will be used to replace offsets beyond the end of the
    sequence. Specify *fillvalue* to use some other value.

    )�offsets�longestr9)rr�r�)r�r�r�r9r�s     r�r�r�Fs*��*�8�S��\�*�H��	�7�G�y��r�c�X�tdk\rtjdt�t	|�S)a ``zip`` the input *iterables* together, but raise
    ``UnequalIterablesError`` if they aren't all the same length.

        >>> it_1 = range(3)
        >>> it_2 = iter('abc')
        >>> list(zip_equal(it_1, it_2))
        [(0, 'a'), (1, 'b'), (2, 'c')]

        >>> it_1 = range(3)
        >>> it_2 = iter('abcd')
        >>> list(zip_equal(it_1, it_2)) # doctest: +IGNORE_EXCEPTION_DETAIL
        Traceback (most recent call last):
        ...
        more_itertools.more.UnequalIterablesError: Iterables have different
        lengths

    i�
zwzip_equal will be removed in a future version of more-itertools. Use the builtin zip function with strict=True instead.)r.�warnings�warn�DeprecationWarningr3r[s r�r�r�bs/��$�Y���
�
�'�
�
	
��y�!�!r�)r�r9c	�Z�t|�t|�k7rtd��g}t||�D]d\}}|dkr'|jt	t||�|���2|dkDr|jt
||d���T|j|��f|rt|d|i�St|�S)aF``zip`` the input *iterables* together, but offset the `i`-th iterable
    by the `i`-th item in *offsets*.

        >>> list(zip_offset('0123', 'abcdef', offsets=(0, 1)))
        [('0', 'b'), ('1', 'c'), ('2', 'd'), ('3', 'e')]

    This can be used as a lightweight alternative to SciPy or pandas to analyze
    data sets in which some series have a lead or lag relationship.

    By default, the sequence will end when the shortest iterable is exhausted.
    To continue until the longest iterable is exhausted, set *longest* to
    ``True``.

        >>> list(zip_offset('0123', 'abcdef', offsets=(0, 1), longest=True))
        [('0', 'b'), ('1', 'c'), ('2', 'd'), ('3', 'e'), (None, 'f')]

    By default, ``None`` will be used to replace offsets beyond the end of the
    sequence. Specify *fillvalue* to use some other value.

    z,Number of iterables and offsets didn't matchrNr9)r�r�r�r�rrrr)r�r�r9r1�	staggeredrr�s       r�r�r��s���*�9�~��W��%��G�H�H��I��Y��(�!���A��q�5����U�6�)�a�R�#8�"�=�>�
��U����V�B��4�0�1����R� �
!���I�;��;�;��	�?�r��rc	��������	t|�}n3t|�}t|�dk(r|d���fd�}nt|����fd�}ttt	t|�||����S)a�Return the input iterables sorted together, with *key_list* as the
    priority for sorting. All iterables are trimmed to the length of the
    shortest one.

    This can be used like the sorting function in a spreadsheet. If each
    iterable represents a column of data, the key list determines which
    columns are used for sorting.

    By default, all iterables are sorted using the ``0``-th iterable::

        >>> iterables = [(4, 3, 2, 1), ('a', 'b', 'c', 'd')]
        >>> sort_together(iterables)
        [(1, 2, 3, 4), ('d', 'c', 'b', 'a')]

    Set a different key list to sort according to another iterable.
    Specifying multiple keys dictates how ties are broken::

        >>> iterables = [(3, 1, 2), (0, 1, 0), ('c', 'b', 'a')]
        >>> sort_together(iterables, key_list=(1, 2))
        [(2, 3, 1), (0, 0, 1), ('a', 'c', 'b')]

    To sort by a function of the elements of the iterable, pass a *key*
    function. Its arguments are the elements of the iterables corresponding to
    the key list::

        >>> names = ('a', 'b', 'c')
        >>> lengths = (1, 2, 3)
        >>> widths = (5, 2, 1)
        >>> def area(length, width):
        ...     return length * width
        >>> sort_together([names, lengths, widths], key_list=(1, 2), key=area)
        [('c', 'b', 'a'), (3, 2, 1), (1, 2, 5)]

    Set *reverse* to ``True`` to sort in descending order.

        >>> sort_together([(1, 2, 3), ('c', 'b', 'a')], reverse=True)
        [(3, 2, 1), ('a', 'b', 'c')]

    r1rc����|��Sr�r�)�zipped_itemsrL�
key_offsets ��r�rzsort_together.<locals>.<lambda>�s����L��4L�0M�r�c�����|��Sr�r�)r��
get_key_itemsrLs ��r�rzsort_together.<locals>.<lambda>�s�����|�,�1�r�rb)r'r�r�r�r')r1�key_listrLrC�key_argumentr�r�s  `  @@r�r�r��su���P�{�"�8�,����>���x�=�A��"�!��J�M�L�'��1�M��L���V�C��O��w�
G�H��r�c���tt|��\}}|sy|d}t|t|��}d��t	�fd�t|�D��S)a�The inverse of :func:`zip`, this function disaggregates the elements
    of the zipped *iterable*.

    The ``i``-th iterable contains the ``i``-th element from each element
    of the zipped iterable. The first element is used to determine the
    length of the remaining elements.

        >>> iterable = [('a', 1), ('b', 2), ('c', 3), ('d', 4)]
        >>> letters, numbers = unzip(iterable)
        >>> list(letters)
        ['a', 'b', 'c', 'd']
        >>> list(numbers)
        [1, 2, 3, 4]

    This is similar to using ``zip(*iterable)``, but it avoids reading
    *iterable* into memory. Note, however, that this function uses
    :func:`itertools.tee` and thus may require significant storage.

    r�rc����fd�}|S)Nc�6��	|�S#t$rt�wxYwr�)r�r�)�objrs �r��getterz)unzip.<locals>.itemgetter.<locals>.getters(���
$��1�v�
���

$�$�#�

$�s��r�)rr�s` r�r'zunzip.<locals>.itemgetters���
	$��
r�c3�H�K�|]\}}t�|�|����y�wr��r-)r@rrr's   �r�rBzunzip.<locals>.<genexpr>s �����J�E�A�r��Z��]�B�'�J�s�")r�r�rr�rrd)r�r!r1r's   @r�r�r��sS���(��h��(�N�D�(�����7�D��H�c�$�i�(�I��$�J�Y�y�5I�J�J�Jr�c�&�|dkrtd��	|dd|}tt	|�|�\}}g}d}td|dz�D]0}|}|||kr|dzn|z
}|j
t|||���2|S#t$rt|�}Y�vwxYw)a�Divide the elements from *iterable* into *n* parts, maintaining
    order.

        >>> group_1, group_2 = divide(2, [1, 2, 3, 4, 5, 6])
        >>> list(group_1)
        [1, 2, 3]
        >>> list(group_2)
        [4, 5, 6]

    If the length of *iterable* is not evenly divisible by *n*, then the
    length of the returned iterables will not be identical:

        >>> children = divide(3, [1, 2, 3, 4, 5, 6, 7])
        >>> [list(c) for c in children]
        [[1, 2, 3], [4, 5], [6, 7]]

    If the length of the iterable is smaller than n, then the last returned
    iterables will be empty:

        >>> children = divide(5, [1, 2, 3])
        >>> [list(c) for c in children]
        [[1], [2], [3], [], []]

    This function will exhaust the iterable before returning and may require
    significant storage. If order is not important, see :func:`distribute`,
    which does not first pull the iterable into memory.

    r1r�Nr)r�r�r�divmodr�rr�r�)	r�r�r8�qr r�r�rr�s	         r�rTrTs���:	�1�u��/�0�0����!�����#�c�(�A��D�A�q�
�C��D�
�1�a�!�e�_�*������a���A��Q�&���
�
�4��E�$��(�)�*�
�J�����H�o���s�A9�9B�Bc��|�td�S|�t||�rt|f�S	t|�S#t$rt|f�cYSwxYw)axIf *obj* is iterable, return an iterator over its items::

        >>> obj = (1, 2, 3)
        >>> list(always_iterable(obj))
        [1, 2, 3]

    If *obj* is not iterable, return a one-item iterable containing *obj*::

        >>> obj = 1
        >>> list(always_iterable(obj))
        [1]

    If *obj* is ``None``, return an empty iterable:

        >>> obj = None
        >>> list(always_iterable(None))
        []

    By default, binary and text strings are not considered iterable::

        >>> obj = 'foo'
        >>> list(always_iterable(obj))
        ['foo']

    If *base_type* is set, objects for which ``isinstance(obj, base_type)``
    returns ``True`` won't be considered iterable.

        >>> obj = {'a': 1}
        >>> list(always_iterable(obj))  # Iterate over the dict's keys
        ['a']
        >>> list(always_iterable(obj, base_type=dict))  # Treat dicts as a unit
        [{'a': 1}]

    Set *base_type* to ``None`` to avoid any special handling and treat objects
    Python considers iterable as iterable:

        >>> obj = 'foo'
        >>> list(always_iterable(obj, base_type=None))
        ['f', 'o', 'o']
    r�)r�r�r�)r�rys  r�rArANsX��R�{��B�x����:�c�9�#=��S�F�|����C�y������S�F�|���s�
4�A�Ac���|dkrtd��t|�\}}dg|z}t|t||�|�}ttt|d|zdz��}t
||�S)asReturn an iterable over `(bool, item)` tuples where the `item` is
    drawn from *iterable* and the `bool` indicates whether
    that item satisfies the *predicate* or is adjacent to an item that does.

    For example, to find whether items are adjacent to a ``3``::

        >>> list(adjacent(lambda x: x == 3, range(6)))
        [(False, 0), (False, 1), (True, 2), (True, 3), (True, 4), (False, 5)]

    Set *distance* to change what counts as adjacent. For example, to find
    whether items are two places away from a ``3``:

        >>> list(adjacent(lambda x: x == 3, range(6), distance=2))
        [(False, 0), (True, 1), (True, 2), (True, 3), (True, 4), (True, 5)]

    This is useful for contextualizing the results of a search function.
    For example, a code comparison tool might want to identify lines that
    have changed, but also surrounding lines to give the viewer of the diff
    context.

    The predicate function will only be called once for each item in the
    iterable.

    See also :func:`groupby_transform`, which can be used with this function
    to group ranges of items with the same `bool` value.

    rzdistance must be at least 0Frr1)r�rrr-�anyr�r�)�	predicater��distance�i1�i2�padding�selected�adjacent_to_selecteds        r�r?r?�sp��:�!�|��6�7�7�
��]�F�B���g�� �G��W�c�)�R�0�'�:�H��s�H�X�q�8�|�a�7G�$H�I���#�R�(�(r�c�V���t||�}�r�fd�|D�}�r�fd�|D�}|S)aAn extension of :func:`itertools.groupby` that can apply transformations
    to the grouped data.

    * *keyfunc* is a function computing a key value for each item in *iterable*
    * *valuefunc* is a function that transforms the individual items from
      *iterable* after grouping
    * *reducefunc* is a function that transforms each group of items

    >>> iterable = 'aAAbBBcCC'
    >>> keyfunc = lambda k: k.upper()
    >>> valuefunc = lambda v: v.lower()
    >>> reducefunc = lambda g: ''.join(g)
    >>> list(groupby_transform(iterable, keyfunc, valuefunc, reducefunc))
    [('A', 'aaa'), ('B', 'bbb'), ('C', 'ccc')]

    Each optional argument defaults to an identity function if not specified.

    :func:`groupby_transform` is useful when grouping elements of an iterable
    using a separate iterable as the key. To do this, :func:`zip` the iterables
    and pass a *keyfunc* that extracts the first element and a *valuefunc*
    that extracts the second element::

        >>> from operator import itemgetter
        >>> keys = [0, 0, 1, 1, 1, 2, 2, 2, 3]
        >>> values = 'abcdefghi'
        >>> iterable = zip(keys, values)
        >>> grouper = groupby_transform(iterable, itemgetter(0), itemgetter(1))
        >>> [(k, ''.join(g)) for k, g in grouper]
        [(0, 'ab'), (1, 'cde'), (2, 'fgh'), (3, 'i')]

    Note that the order of items in the iterable is significant.
    Only adjacent items are grouped together, so if you don't want any
    duplicate groups, you should sort the iterable by the key function.

    c3�@�K�|]\}}|t�|�f���y�wr�r�)r@�k�g�	valuefuncs   �r�rBz$groupby_transform.<locals>.<genexpr>�s!�����6�$�!�Q��3�y�!�$�%�6�s�c3�8�K�|]\}}|�|�f���y�wr�r�)r@r�r��
reducefuncs   �r�rBz$groupby_transform.<locals>.<genexpr>�s�����2�d�a���:�a�=�!�2�s��r)r��keyfuncr�r�r�s  `` r�r]r]�s1���H�(�G�
$�C��6�#�6���2�c�2���Jr�c��eZdZdZeedd��Zd�Zd�Zd�Z	d�Z
d�Zd�Zd	�Z
d
�Zed��Zd�Zd
�Zd�Zd�Zd�Zd�Zy)rwa<An extension of the built-in ``range()`` function whose arguments can
    be any orderable numeric type.

    With only *stop* specified, *start* defaults to ``0`` and *step*
    defaults to ``1``. The output items will match the type of *stop*:

        >>> list(numeric_range(3.5))
        [0.0, 1.0, 2.0, 3.0]

    With only *start* and *stop* specified, *step* defaults to ``1``. The
    output items will match the type of *start*:

        >>> from decimal import Decimal
        >>> start = Decimal('2.1')
        >>> stop = Decimal('5.1')
        >>> list(numeric_range(start, stop))
        [Decimal('2.1'), Decimal('3.1'), Decimal('4.1')]

    With *start*, *stop*, and *step*  specified the output items will match
    the type of ``start + step``:

        >>> from fractions import Fraction
        >>> start = Fraction(1, 2)  # Start at 1/2
        >>> stop = Fraction(5, 2)  # End at 5/2
        >>> step = Fraction(1, 2)  # Count by 1/2
        >>> list(numeric_range(start, stop, step))
        [Fraction(1, 2), Fraction(1, 1), Fraction(3, 2), Fraction(2, 1)]

    If *step* is zero, ``ValueError`` is raised. Negative steps are supported:

        >>> list(numeric_range(3, -1, -1.0))
        [3.0, 2.0, 1.0, 0.0]

    Be aware of the limitations of floating point numbers; the representation
    of the yielded numbers may be surprising.

    ``datetime.datetime`` objects can be used for *start* and *stop*, if *step*
    is a ``datetime.timedelta`` object:

        >>> import datetime
        >>> start = datetime.datetime(2019, 1, 1)
        >>> stop = datetime.datetime(2019, 1, 3)
        >>> step = datetime.timedelta(days=1)
        >>> items = iter(numeric_range(start, stop, step))
        >>> next(items)
        datetime.datetime(2019, 1, 1, 0, 0)
        >>> next(items)
        datetime.datetime(2019, 1, 2, 0, 0)

    rc���t|�}|dk(rW|\|_t|j�d�|_t|j|jz
�d�|_n�|dk(r=|\|_|_t|j|jz
�d�|_nT|dk(r|\|_|_|_n9|dk(rtdj
|���tdj
|���t|j�d�|_|j|jk(rtd��|j|jkD|_	y)Nr1rr�z2numeric_range expected at least 1 argument, got {}z2numeric_range expected at most 3 arguments, got {}z&numeric_range() arg 3 must not be zero)
r��_stop�type�_start�_stepr�r�_zeror��_growing)r�r��argcs   r�r�znumeric_range.__init__
s(���4�y���1�9� �M�T�Z�*�$�t�z�z�*�1�-�D�K�7��d�j�j�4�;�;�6�7��:�D�J�
�Q�Y�&*�#�D�K���7��d�j�j�4�;�;�6�7��:�D�J�
�Q�Y�26�/�D�K���T�Z�
�Q�Y��%�%+�V�D�\��
�
�&�&,�f�T�l��
�
&�T�$�*�*�%�a�(��
��:�:����#��E�F�F��
�
�T�Z�Z�/��
r�c�~�|jr|j|jkS|j|jkDSr�)r�r�r�r�s r�r�znumeric_range.__bool__(s/���=�=��;�;����+�+��;�;����+�+r�c�L�|jrL|j|cxkr|jkr,ny||jz
|jz|jk(Sy|j|cxk\r|jkDr-ny|j|z
|jz|jk(Sy�NF)r�r�r�r�r�)r��elems  r�r0znumeric_range.__contains__.s����=�=��{�{�d�/�T�Z�Z�/���t�{�{�*�d�j�j�8�D�J�J�F�F�
��{�{�d�/�T�Z�Z�/�����d�*��
�
�{�;�t�z�z�I�I�r�c��t|t�r{t|�}t|�}|s|r|xr|S|j|jk(xr>|j|jk(xr#|jd�|jd�k(Sy)Nr�F)r�rw�boolr�r��
_get_by_index)r��other�
empty_self�empty_others    r��__eq__znumeric_range.__eq__8s����e�]�+�!�$�Z��J�"�5�k�/�K��[�!�1�k�1��K�K�5�<�<�/�J��
�
�e�k�k�1�J��*�*�2�.�%�2E�2E�b�2I�I��r�c��t|t�r|j|�St|t��r&|j�|j
n|j|j
z}|j�|j|jkr
|j}nA|j|jk\r
|j}n|j|j�}|j�|j|jk\r
|j}nB|j|jkr
|j}n|j|j�}t|||�Stdjt|�j���)Nz8numeric range indices must be integers or slices, not {})r��intr�r�r�r�r��_lenr�r�r�rwr�rr�r�)r�rLr�r�r�s     r�r�znumeric_range.__getitem__Gs���c�3���%�%�c�*�*�
��U�
#�!$���!1�4�:�:�s�x�x�$�*�*�7L�D��y�y� �C�I�I�$�)�)��$;��������d�i�i�'��
�
���*�*�3�9�9�5���x�x��3�8�8�t�y�y�#8��z�z�����d�i�i�Z�'��{�{���)�)�#�(�(�3�� ���d�3�3��-�-3�V�D��I�4F�4F�-G��
r�c��|r1t|j|jd�|jf�S|jS�Nr�)�hashr�r�r��_EMPTY_HASHr�s r��__hash__znumeric_range.__hash__bs6�������d�&8�&8��&<�d�j�j�I�J�J��#�#�#r�c�����fd�t�D�}�jr$ttt�j
�|�Sttt�j
�|�S)Nc3�V�K�|] }�j|�jzz���"y�wr�)r�r�)r@r�r�s  �r�rBz)numeric_range.__iter__.<locals>.<genexpr>is"�����B�Q�$�+�+��T�Z�Z��0�B�r�)rr�rr	r*r�r+)r��valuess` r�r�znumeric_range.__iter__hsF���B�%�'�B���=�=��W�R����4�f�=�=��W�R����4�f�=�=r�c��|jSr�)r�r�s r��__len__znumeric_range.__len__os���y�y�r�c�>�|jr%|j}|j}|j}n%|j}|j}|j}||z
}||jkryt||�\}}t
|�t
||jk7�zS�Nr)r�r�r�r�r�r�r�)r�r�r�r�r�r�r s       r�r�znumeric_range._lenrs����=�=��K�K�E��:�:�D��:�:�D��J�J�E��;�;�D��J�J�;�D��%�<���t�z�z�!���(�D�)�D�A�q��q�6�C��T�Z�Z��0�0�0r�c�T�t|j|j|jffSr�)rwr�r�r�r�s r��
__reduce__znumeric_range.__reduce__�s ���t�{�{�D�J�J��
�
�C�C�Cr�c�(�|jdk(r8djt|j�t|j��Sdjt|j�t|j�t|j��S)Nr1znumeric_range({}, {})znumeric_range({}, {}, {}))r�r�reprr�r�r�s r��__repr__znumeric_range.__repr__�sn���:�:��?�*�1�1��T�[�[�!�4��
�
�#3��
�/�5�5��T�[�[�!�4��
�
�#3�T�$�*�*�5E��
r�c��tt|jd�|j|jz
|j��Sr�)r�rwr�r�r�r�s r�r�znumeric_range.__reversed__�s<�����"�"�2�&����d�j�j�(@�4�:�:�+�
�
�	
r�c��t||v�Sr�)r�rWs  r�rznumeric_range.count�s���5�D�=�!�!r�c���|jrb|j|cxkr|jkr�nn�t||jz
|j�\}}||j
k(rnt
|�S|j|cxk\r|jkDrDnnAt|j|z
|j�\}}||j
k(rt
|�Stdj|���)Nz{} is not in numeric range)	r�r�r�r�r�r�r�r�r)r�rPr�r s    r�r�znumeric_range.index�s����=�=��{�{�e�0�d�j�j�0��e�d�k�k�1�4�:�:�>���1���
�
�?��q�6�M��{�{�e�0�d�j�j�0��d�k�k�E�1�D�J�J�;�?���1���
�
�?��q�6�M��5�<�<�U�C�D�Dr�c��|dkr||jz
}|dks||jk\rtd��|j||jzzS)Nrz'numeric range object index out of range)r�r�r�r�)r�rs  r�r�znumeric_range._get_by_index�sJ���q�5�
����N�A��q�5�A����N��F�G�G��{�{�Q����^�+�+r�N)r�r�r�r�r�rr�r�r�r0r�r�r�r�r�rr�r�r�r�rr�r�r�r�r�rwrw�sv��1�f�u�Q��{�#�K�0�6,��
��6$�>���1��1� D��
�"�E�,r�rwc�x��t����std�S|�
t�n
t|�}�fd�|D�S)aCycle through the items from *iterable* up to *n* times, yielding
    the number of completed cycles along with each item. If *n* is omitted the
    process repeats indefinitely.

    >>> list(count_cycle('AB', 3))
    [(0, 'A'), (0, 'B'), (1, 'A'), (1, 'B'), (2, 'A'), (2, 'B')]

    r�c3�4�K�|]}�D]}||f���
�y�wr�r�)r@rr�r�s   �r�rBzcount_cycle.<locals>.<genexpr>�s!�����<�!�8�<�4�Q��I�<�I�<���)rr�rr)r�r�r�s`  r�rNrN�s6����X��H���B�x����e�g��a��G�<�w�<�<r�c#��K�t|�}	t|�}	t�D]}|}t|�}|dk(d|f���y#t$rYywxYw#t$r
dk(df��YywxYw�w)aHYield 3-tuples of the form ``(is_first, is_last, item)``.

    >>> list(mark_ends('ABC'))
    [(True, False, 'A'), (False, False, 'B'), (False, True, 'C')]

    Use this when looping over an iterable to take special action on its first
    and/or last items:

    >>> iterable = ['Header', 100, 200, 'Footer']
    >>> total = 0
    >>> for is_first, is_last, item in mark_ends(iterable):
    ...     if is_first:
    ...         continue  # Skip the header
    ...     if is_last:
    ...         continue  # Skip the footer
    ...     total += item
    >>> print(total)
    300
    NrFT)r�r�r�r)r�r�br�as     r�rqrq�s�����(
�h��B����H�����	#�A��A��R��A��q�&�%��"�"�	#��	��������1�f�d�A�o���sE�A*�A�&A�A*�	A�A*�
A�A*�A'�$A*�&A'�'A*c���|�tt�t||��S|dkrtd��t	||t
��}tt�t
||��S)a�Yield the index of each item in *iterable* for which *pred* returns
    ``True``.

    *pred* defaults to :func:`bool`, which will select truthy items:

        >>> list(locate([0, 1, 1, 0, 1, 0, 0]))
        [1, 2, 4]

    Set *pred* to a custom function to, e.g., find the indexes for a particular
    item.

        >>> list(locate(['a', 'b', 'c', 'b'], lambda x: x == 'b'))
        [1, 3]

    If *window_size* is given, then the *pred* function will be called with
    that many items. This enables searching for sub-sequences:

        >>> iterable = [0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3]
        >>> pred = lambda *args: args == (1, 2, 3)
        >>> list(locate(iterable, pred=pred, window_size=3))
        [1, 5, 9]

    Use with :func:`seekable` to find indexes and then retrieve the associated
    items:

        >>> from itertools import count
        >>> from more_itertools import seekable
        >>> source = (3 * n + 1 if (n % 2) else n // 2 for n in count())
        >>> it = seekable(source)
        >>> pred = lambda x: x > 100
        >>> indexes = locate(it, pred=pred)
        >>> i = next(indexes)
        >>> it.seek(i)
        >>> next(it)
        106

    r1zwindow size must be at least 1�r9)rrr-r�r�r2r)r�r��window_sizers    r�rjrj�sX��L������T�8�!4�5�5��Q���9�:�:�	�(�K�7�	;�B��E�G�W�T�2�.�/�/r�c�<�d�ttt|��D�S)z�Yield elements of the longest common prefix amongst given *iterables*.

    >>> ''.join(longest_common_prefix(['abcd', 'abc', 'abf']))
    'ab'

    c3�&K�|]	}|d���y�w)rNr�)r@�cs  r�rBz(longest_common_prefix.<locals>.<genexpr>	s����@�Q�A�a�D�@�s�)rr;r�r[s r�rkrk	s��A�)�I�s�I��?�@�@r�c��t||�S)a�Yield the items from *iterable*, but strip any from the beginning
    for which *pred* returns ``True``.

    For example, to remove a set of items from the start of an iterable:

        >>> iterable = (None, False, None, 1, 2, None, 3, False, None)
        >>> pred = lambda x: x in {None, False, ''}
        >>> list(lstrip(iterable, pred))
        [1, 2, None, 3, False, None]

    This function is analogous to to :func:`str.lstrip`, and is essentially
    an wrapper for :func:`itertools.dropwhile`.

    )r�r�r�s  r�rlrl	s���T�8�$�$r�c#�K�g}|j}|j}|D](}||�r	||��|Ed{���|�|���*y7��w)a�Yield the items from *iterable*, but strip any from the end
    for which *pred* returns ``True``.

    For example, to remove a set of items from the end of an iterable:

        >>> iterable = (None, False, None, 1, 2, None, 3, False, None)
        >>> pred = lambda x: x in {None, False, ''}
        >>> list(rstrip(iterable, pred))
        [None, False, None, 1, 2, None, 3]

    This function is analogous to :func:`str.rstrip`.

    N)r��clear)r�r��cache�cache_append�cache_clearrIs      r�r�r�1	sT����
�E��<�<�L��+�+�K�
�����7���O�����M��G�
�
�s�6A
�A�A
c�.�tt||�|�S)a�Yield the items from *iterable*, but strip any from the
    beginning and end for which *pred* returns ``True``.

    For example, to remove a set of items from both ends of an iterable:

        >>> iterable = (None, False, None, 1, 2, None, 3, False, None)
        >>> pred = lambda x: x in {None, False, ''}
        >>> list(strip(iterable, pred))
        [1, 2, None, 3]

    This function is analogous to :func:`str.strip`.

    )r�rlrs  r�r�r�K	s���&��4�(�$�/�/r�c�(�eZdZdZd�Zd�Zd�Zd�Zy)rfaAn extension of :func:`itertools.islice` that supports negative values
    for *stop*, *start*, and *step*.

        >>> iterable = iter('abcdefgh')
        >>> list(islice_extended(iterable, -4, -1))
        ['e', 'f', 'g']

    Slices with negative values require some caching of *iterable*, but this
    function takes care to minimize the amount of memory required.

    For example, you can use a negative step with an infinite iterator:

        >>> from itertools import count
        >>> list(islice_extended(count(), 110, 99, -2))
        [110, 108, 106, 104, 102, 100]

    You can also use slice notation directly:

        >>> iterable = map(str, count())
        >>> it = islice_extended(iterable)[10:20:2]
        >>> list(it)
        ['10', '12', '14', '16', '18']

    c�\�t|�}|rt|t|��|_y||_yr�)r��_islice_helperr��	_iterable)r�r�r�rs    r�r�zislice_extended.__init__v	s'��
�(�^���+�B��t��=�D�N��D�Nr�c��|Sr�r�r�s r�r�zislice_extended.__iter__}	r�r�c�,�t|j�Sr�)r�rr�s r�r�zislice_extended.__next__�	����D�N�N�#�#r�c�v�t|t�rtt|j|��Std��)Nz4islice_extended.__getitem__ argument must be a slice)r�r�rfrrr�)r�rLs  r�r�zislice_extended.__getitem__�	s.���c�5�!�"�>�$�.�.�#�#F�G�G��N�O�Or�N)r�r�r�r�r�r�r�r�r�r�r�rfrf\	s���2 ��$�Pr�rfc#�|K�|j}|j}|jdk(rtd��|jxsd}|dkD�r|�dn|}|dkrt	t|d�|��}|r|ddnd}t
||zd�}|�|}n!|dk\r
t||�}nt
||zd�}||z
}	|	dkryt|d|	|�D]	\}
}|���y|�v|dkrqtt|||�d�t	t||�|��}t|�D]2\}
}|j�}|
|zdk(r|��|j|��4yt||||�Ed{���y|�dn|}|�g|dkrb|dz
}	t	t|d�|	��}|r|ddnd}|dkr||}}nt||z
d�d}}t|�|||�D]	\}
}|���y|�|dz}
tt||
|
�d�|dkr|}d}	n|�d}|dz}	n
d}||z
}	|	dkrytt||	��}||d|�Ed{���y7��7��w)Nrz1step argument must be a non-zero integer or None.r1r�r�)
r�r�r�r�rrdr�r�rr�r�r�r�)r�sr�r�r�r�len_iterrrr�r�r��cached_item�ms              r�rr�	s�����
�G�G�E��6�6�D��v�v��{��L�M�M��6�6�;�Q�D��a�x��m��%���1�9��)�B��*�E�6�:�E�',�u�R�y��|�!�H��H�u�$�a�(�A��|��������h�'����4���+���A��A��A�v��%�e�Q��4�8�
���t��
�
���T�A�X����E�5�)�4�0��&��d�U�+�T�E�:�E�(��}�
#���t�#�m�m�o���4�<�1�$�%�%����T�"�	
#��b�%��t�4�4�4��}��5����4�!�8����	�A��)�B��*�1�5�E�',�u�R�y��|�!�H�
�q�y��d�1���5�8�+�R�0�$�1��#�E�{�1�Q�t�8�4�
���t��
�
����1�H���V�B��1�%�t�,��q�y����������A�I�����D�L����6�����A��'�E��Q�W��W�~�%�%�[
5��Z
&�s%�EH<�H8�CH<�2H:�3H<�:H<c�`�	t|�S#t$rtt|��cYSwxYw)a�An extension of :func:`reversed` that supports all iterables, not
    just those which implement the ``Reversible`` or ``Sequence`` protocols.

        >>> print(*always_reversible(x for x in range(3)))
        2 1 0

    If the iterable is already reversible, this function returns the
    result of :func:`reversed()`. If the iterable is not reversible,
    this function will cache the remaining items in the iterable and
    yield them in reverse order, which may require significant storage.
    )r�r�r��r�s r�rBrB�	s0��(���!�!���(���X��'�'�(�s�

�-�-c��|Sr�r�rHs r�rr�	s��A�r�c#�~�K�tt|��fd���D]\}}ttd�|����y�w)a�Yield groups of consecutive items using :func:`itertools.groupby`.
    The *ordering* function determines whether two items are adjacent by
    returning their position.

    By default, the ordering function is the identity function. This is
    suitable for finding runs of numbers:

        >>> iterable = [1, 10, 11, 12, 20, 30, 31, 32, 33, 40]
        >>> for group in consecutive_groups(iterable):
        ...     print(list(group))
        [1]
        [10, 11, 12]
        [20]
        [30, 31, 32, 33]
        [40]

    For finding runs of adjacent letters, try using the :meth:`index` method
    of a string of letters:

        >>> from string import ascii_lowercase
        >>> iterable = 'abcdfgilmnop'
        >>> ordering = ascii_lowercase.index
        >>> for group in consecutive_groups(iterable, ordering):
        ...     print(list(group))
        ['a', 'b', 'c', 'd']
        ['f', 'g']
        ['i']
        ['l', 'm', 'n', 'o', 'p']

    Each group of consecutive items is an iterator that shares it source with
    *iterable*. When an an output group is advanced, the previous group is
    no longer available unless its elements are copied (e.g., into a ``list``).

        >>> iterable = [1, 2, 11, 12, 21, 22]
        >>> saved_groups = []
        >>> for group in consecutive_groups(iterable):
        ...     saved_groups.append(list(group))  # Copy group elements
        >>> saved_groups
        [[1, 2], [11, 12], [21, 22]]

    c�&��|d�|d�z
Sr�r�)rI�orderings �r�rz$consecutive_groups.<locals>.<lambda>'
s���1�Q�4�(�1�Q�4�.�+@�r��rLr1N)rrdr-r')r�rr�r�s `  r�rKrK�	s@�����T��(��!@��$���1��*�Q�-��#�#�$�s�:=)�initialc��t|�\}}	t|�g}|�g}t	|t|||��S#t$rtg�cYSwxYw)a�This function is the inverse of :func:`itertools.accumulate`. By default
    it will compute the first difference of *iterable* using
    :func:`operator.sub`:

        >>> from itertools import accumulate
        >>> iterable = accumulate([0, 1, 2, 3, 4])  # produces 0, 1, 3, 6, 10
        >>> list(difference(iterable))
        [0, 1, 2, 3, 4]

    *func* defaults to :func:`operator.sub`, but other functions can be
    specified. They will be applied as follows::

        A, B, C, D, ... --> A, func(B, A), func(C, B), func(D, C), ...

    For example, to do progressive division:

        >>> iterable = [1, 2, 6, 24, 120]
        >>> func = lambda x, y: x // y
        >>> list(difference(iterable, func))
        [1, 2, 3, 4, 5]

    If the *initial* keyword is set, the first element will be skipped when
    computing successive differences.

        >>> it = [10, 11, 13, 16]  # from accumulate([1, 2, 3], initial=10)
        >>> list(difference(it, initial=10))
        [1, 2, 3]

    )rr�r�r�rr-)r�r�r r�r�r[s      r�rPrP,
s]��<�x�=�D�A�q���a��	���������D�!�Q��(�(��
���B�x���s�7�A�
Ac�(�eZdZdZd�Zd�Zd�Zd�Zy)r>aSReturn a read-only view of the sequence object *target*.

    :class:`SequenceView` objects are analogous to Python's built-in
    "dictionary view" types. They provide a dynamic view of a sequence's items,
    meaning that when the sequence updates, so does the view.

        >>> seq = ['0', '1', '2']
        >>> view = SequenceView(seq)
        >>> view
        SequenceView(['0', '1', '2'])
        >>> seq.append('3')
        >>> view
        SequenceView(['0', '1', '2', '3'])

    Sequence views support indexing, slicing, and length queries. They act
    like the underlying sequence, except they don't allow assignment:

        >>> view[1]
        '1'
        >>> view[1:-1]
        ['1', '2']
        >>> len(view)
        4

    Sequence views are useful as an alternative to copying, as they don't
    require (much) extra storage.

    c�>�t|t�st�||_yr�)r�rr��_target)r��targets  r�r�zSequenceView.__init__t
s���&�(�+��O���r�c� �|j|Sr�)r$)r�r�s  r�r�zSequenceView.__getitem__y
s���|�|�E�"�"r�c�,�t|j�Sr�)r�r$r�s r�r�zSequenceView.__len__|
s���4�<�<� � r�c�t�dj|jjt|j��S)Nz{}({}))r�	__class__r�r�r$r�s r�r�zSequenceView.__repr__
s&�����t�~�~�6�6��T�\�\�8J�K�Kr�N)r�r�r�r�r�r�r�r�r�r�r�r>r>V
s���:�
#�!�Lr�r>c�F�eZdZdZdd�Zd�Zd�Zd�Zefd�Z	d�Z
d	�Zd
�Zy)r�ap
Wrap an iterator to allow for seeking backward and forward. This
    progressively caches the items in the source iterable so they can be
    re-visited.

    Call :meth:`seek` with an index to seek to that position in the source
    iterable.

    To "reset" an iterator, seek to ``0``:

        >>> from itertools import count
        >>> it = seekable((str(n) for n in count()))
        >>> next(it), next(it), next(it)
        ('0', '1', '2')
        >>> it.seek(0)
        >>> next(it), next(it), next(it)
        ('0', '1', '2')
        >>> next(it)
        '3'

    You can also seek forward:

        >>> it = seekable((str(n) for n in range(20)))
        >>> it.seek(10)
        >>> next(it)
        '10'
        >>> it.relative_seek(-2)  # Seeking relative to the current position
        >>> next(it)
        '9'
        >>> it.seek(20)  # Seeking past the end of the source isn't a problem
        >>> list(it)
        []
        >>> it.seek(0)  # Resetting works even after hitting the end
        >>> next(it), next(it), next(it)
        ('0', '1', '2')

    Call :meth:`peek` to look ahead one item without advancing the iterator:

        >>> it = seekable('1234')
        >>> it.peek()
        '1'
        >>> list(it)
        ['1', '2', '3', '4']
        >>> it.peek(default='empty')
        'empty'

    Before the iterator is at its end, calling :func:`bool` on it will return
    ``True``. After it will return ``False``:

        >>> it = seekable('5678')
        >>> bool(it)
        True
        >>> list(it)
        ['5', '6', '7', '8']
        >>> bool(it)
        False

    You may view the contents of the cache with the :meth:`elements` method.
    That returns a :class:`SequenceView`, a view that updates automatically:

        >>> it = seekable((str(n) for n in range(10)))
        >>> next(it), next(it), next(it)
        ('0', '1', '2')
        >>> elements = it.elements()
        >>> elements
        SequenceView(['0', '1', '2'])
        >>> next(it)
        '3'
        >>> elements
        SequenceView(['0', '1', '2', '3'])

    By default, the cache grows as the source iterable progresses, so beware of
    wrapping very large or infinite iterables. Supply *maxlen* to limit the
    size of the cache (this of course limits how far back you can seek).

        >>> from itertools import count
        >>> it = seekable((str(n) for n in count()), maxlen=2)
        >>> next(it), next(it), next(it), next(it)
        ('0', '1', '2', '3')
        >>> list(it.elements())
        ['2', '3']
        >>> it.seek(0)
        >>> next(it), next(it), next(it), next(it)
        ('2', '3', '4', '5')
        >>> next(it)
        '6'

    Nc�v�t|�|_|�g|_d|_ytg|�|_d|_yr�)r��_sourcer�r�_index)r�r�r�s   r�r�zseekable.__init__�
s9���H�~����>��D�K���� ��F�+�D�K���r�c��|Sr�r�r�s r�r�zseekable.__iter__�
r�r�c��|j�1	|j|j}|xjdz
c_|St|j�}|jj|�|S#t$r
d|_Y�DwxYwrr)r-r�r�r�r,r��r�r�s  r�r�zseekable.__next__�
su���;�;�"�
��{�{�4�;�;�/�����q� �����D�L�L�!�������4� �����
#�"���
#�s�A0�0B�Bc�D�	|j�y#t$rYywxYwr�r�r�s r�r�zseekable.__bool__�
r�r�c���	t|�}|j�t	|j
�|_|xjdzc_|S#t$r|tur�|cYSwxYwrr)r�r�r2r-r�r�)r�r��peekeds   r�r�z
seekable.peek�
s`��	��$�Z�F�
�;�;���d�k�k�*�D�K����q����
���	��'�!���N�	�s�A
�
A!� A!c�,�t|j�Sr�)r>r�r�s r��elementszseekable.elementss���D�K�K�(�(r�c�f�||_|t|j�z
}|dkDr
t||�yyr�)r-r�r�r5)r�r��	remainders   r��seekz
seekable.seeks2������C����,�,�	��q�=��D�)�$�r�c�j�t|j�}|jt||zd��yr�)r�r�r8r�)r�rr�s   r��
relative_seekzseekable.relative_seeks'���D�K�K� ���	�	�#�e�e�m�Q�'�(r�r�)
r�r�r�r�r�r�r�r�r2r�r5r8r:r�r�r�r�r��
s6��V�p����#�
�)�%�)r�r�c�0�eZdZdZed��Zed��Zy)r�a�
    :func:`run_length.encode` compresses an iterable with run-length encoding.
    It yields groups of repeated items with the count of how many times they
    were repeated:

        >>> uncompressed = 'abbcccdddd'
        >>> list(run_length.encode(uncompressed))
        [('a', 1), ('b', 2), ('c', 3), ('d', 4)]

    :func:`run_length.decode` decompresses an iterable that was previously
    compressed with run-length encoding. It yields the items of the
    decompressed iterable:

        >>> compressed = [('a', 1), ('b', 2), ('c', 3), ('d', 4)]
        >>> list(run_length.decode(compressed))
        ['a', 'b', 'b', 'c', 'c', 'c', 'd', 'd', 'd', 'd']

    c�&�d�t|�D�S)Nc3�<K�|]\}}|t|�f���y�wr�)r`)r@r�r�s   r�rBz$run_length.encode.<locals>.<genexpr>,s����;���A��D��G��;�s�r�rs r��encodezrun_length.encode*s��;���):�;�;r�c�:�tjd�|D��S)Nc3�:K�|]\}}t||����y�wr�)r)r@r�r�s   r�rBz$run_length.decode.<locals>.<genexpr>0s����"E�D�A�q�6�!�Q�<�"E�s�)rr,rs r��decodezrun_length.decode.s���"�"�"E�H�"E�E�Er�N)r�r�r�r��staticmethodr>rAr�r�r�r�r�s1���&�<��<��F��Fr�r�c	�L�tt|dzt||���|k(S)a�Return ``True`` if exactly ``n`` items in the iterable are ``True``
    according to the *predicate* function.

        >>> exactly_n([True, True, False], 2)
        True
        >>> exactly_n([True, True, False], 1)
        False
        >>> exactly_n([0, 1, 2, 3, 4, 5], 3, lambda x: x < 3)
        True

    The iterable will be advanced until ``n + 1`` truthy items are encountered,
    so avoid calling it on infinite iterables.

    r1)r�r9r/)r�r�r�s   r�rXrX3s&���t�A��E�6�)�X�6�7�8�A�=�=r�c	�z�t|�}tt|�tt	|�t|���S)z�Return a list of circular shifts of *iterable*.

    >>> circular_shifts(range(4))
    [(0, 1, 2, 3), (1, 2, 3, 0), (2, 3, 0, 1), (3, 0, 1, 2)]
    )r�r9r�r�r)r��lsts  r�rGrGEs-���x�.�C���C��(�5��:�s�3�x�8�9�9r�c������fd�}|S)a�Return a decorator version of *wrapping_func*, which is a function that
    modifies an iterable. *result_index* is the position in that function's
    signature where the iterable goes.

    This lets you use itertools on the "production end," i.e. at function
    definition. This can augment what the function returns without changing the
    function's code.

    For example, to produce a decorator version of :func:`chunked`:

        >>> from more_itertools import chunked
        >>> chunker = make_decorator(chunked, result_index=0)
        >>> @chunker(3)
        ... def iter_range(n):
        ...     return iter(range(n))
        ...
        >>> list(iter_range(9))
        [[0, 1, 2], [3, 4, 5], [6, 7, 8]]

    To only allow truthy items to be returned:

        >>> truth_serum = make_decorator(filter, result_index=1)
        >>> @truth_serum(bool)
        ... def boolean_test():
        ...     return [0, 1, '', ' ', False, True]
        ...
        >>> list(boolean_test())
        [1, ' ', True]

    The :func:`peekable` and :func:`seekable` wrappers make for practical
    decorators:

        >>> from more_itertools import peekable
        >>> peekable_function = make_decorator(peekable)
        >>> @peekable_function()
        ... def str_range(*args):
        ...     return (str(x) for x in range(*args))
        ...
        >>> it = str_range(1, 20, 2)
        >>> next(it), next(it), next(it)
        ('1', '3', '5')
        >>> it.peek()
        '7'
        >>> next(it)
        '7'

    c���������fd�}|S)Nc���������fd�}|S)Nc�^���|i|��}t��}|j�|��|i���Sr�)r��insert)	r�r��result�wrapping_args_�f�result_index�
wrapping_args�
wrapping_func�wrapping_kwargss	    �����r��
inner_wrapperzOmake_decorator.<locals>.decorator.<locals>.outer_wrapper.<locals>.inner_wrapper�s<����D�+�F�+��!%�m�!4���%�%�l�F�;�$�n�H��H�Hr�r�)rMrRrNrOrPrQs` ����r��
outer_wrapperz8make_decorator.<locals>.decorator.<locals>.outer_wrapper�s���
I�
I�!� r�r�)rOrQrSrNrPs`` ��r��	decoratorz!make_decorator.<locals>.decorator�s���	!��r�r�)rPrNrTs`` r�rmrmOs���f
��r�c���|�d�n|}tt�}|D]&}||�}||�}||j|��(|�#|j�D]\}}||�||<�d|_|S)a�Return a dictionary that maps the items in *iterable* to categories
    defined by *keyfunc*, transforms them with *valuefunc*, and
    then summarizes them by category with *reducefunc*.

    *valuefunc* defaults to the identity function if it is unspecified.
    If *reducefunc* is unspecified, no summarization takes place:

        >>> keyfunc = lambda x: x.upper()
        >>> result = map_reduce('abbccc', keyfunc)
        >>> sorted(result.items())
        [('A', ['a']), ('B', ['b', 'b']), ('C', ['c', 'c', 'c'])]

    Specifying *valuefunc* transforms the categorized items:

        >>> keyfunc = lambda x: x.upper()
        >>> valuefunc = lambda x: 1
        >>> result = map_reduce('abbccc', keyfunc, valuefunc)
        >>> sorted(result.items())
        [('A', [1]), ('B', [1, 1]), ('C', [1, 1, 1])]

    Specifying *reducefunc* summarizes the categorized items:

        >>> keyfunc = lambda x: x.upper()
        >>> valuefunc = lambda x: 1
        >>> reducefunc = sum
        >>> result = map_reduce('abbccc', keyfunc, valuefunc, reducefunc)
        >>> sorted(result.items())
        [('A', 1), ('B', 2), ('C', 3)]

    You may want to filter the input iterable before applying the map/reduce
    procedure:

        >>> all_items = range(30)
        >>> items = [x for x in all_items if 10 <= x <= 20]  # Filter
        >>> keyfunc = lambda x: x % 2  # Evens map to 0; odds to 1
        >>> categories = map_reduce(items, keyfunc=keyfunc)
        >>> sorted(categories.items())
        [(0, [10, 12, 14, 16, 18, 20]), (1, [11, 13, 15, 17, 19])]
        >>> summaries = map_reduce(items, keyfunc=keyfunc, reducefunc=sum)
        >>> sorted(summaries.items())
        [(0, 90), (1, 75)]

    Note that all items in the iterable are gathered into a list before the
    summarization step, which may require significant storage.

    The returned object is a :obj:`collections.defaultdict` with the
    ``default_factory`` set to ``None``, such that it behaves like a normal
    dictionary.

    Nc��|Sr�r�rHs r�rzmap_reduce.<locals>.<lambda>�s��1�r�)rr�r�r��default_factory)	r�r�r�r�r�r�rLrP�
value_lists	         r�rprp�s���f#,�"3��)�I�
�d�
�C�����d�m���$����C�������
��"�y�y�{�	.�O�C��!�*�-�C��H�	.��C���Jr�c	���|�*	t|���fd�tt|�|�D�Stt	t|||���S#t$rY�*wxYw)a�Yield the index of each item in *iterable* for which *pred* returns
    ``True``, starting from the right and moving left.

    *pred* defaults to :func:`bool`, which will select truthy items:

        >>> list(rlocate([0, 1, 1, 0, 1, 0, 0]))  # Truthy at 1, 2, and 4
        [4, 2, 1]

    Set *pred* to a custom function to, e.g., find the indexes for a particular
    item:

        >>> iterable = iter('abcb')
        >>> pred = lambda x: x == 'b'
        >>> list(rlocate(iterable, pred))
        [3, 1]

    If *window_size* is given, then the *pred* function will be called with
    that many items. This enables searching for sub-sequences:

        >>> iterable = [0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3]
        >>> pred = lambda *args: args == (1, 2, 3)
        >>> list(rlocate(iterable, pred=pred, window_size=3))
        [9, 5, 1]

    Beware, this function won't return anything for infinite iterables.
    If *iterable* is reversible, ``rlocate`` will reverse it and search from
    the right. Otherwise, it will search from the left and return the results
    in reverse order.

    See :func:`locate` to for other example applications.

    c3�.�K�|]}�|z
dz
���y�wr?r�)r@rrs  �r�rBzrlocate.<locals>.<genexpr>�s�����O��H�q�L�1�$�O�r�)r�rjr�r�r�)r�r�rrs   @r�r�r��s`���B��	��8�}�H�O�f�X�h�5G��.N�O�O��D���$��<�=�>�>���	��	�s�(A
�
	A�Ac#� K�|dkrtd��t|�}t|tg|dz
z�}t	||�}d}|D]C}||�r&|�||kr|dz
}|Ed{���t||dz
��.|s�1|dtus�=|d���Ey7�-�w)aYYield the items from *iterable*, replacing the items for which *pred*
    returns ``True`` with the items from the iterable *substitutes*.

        >>> iterable = [1, 1, 0, 1, 1, 0, 1, 1]
        >>> pred = lambda x: x == 0
        >>> substitutes = (2, 3)
        >>> list(replace(iterable, pred, substitutes))
        [1, 1, 2, 3, 1, 1, 2, 3, 1, 1]

    If *count* is given, the number of replacements will be limited:

        >>> iterable = [1, 1, 0, 1, 1, 0, 1, 1, 0]
        >>> pred = lambda x: x == 0
        >>> substitutes = [None]
        >>> list(replace(iterable, pred, substitutes, count=2))
        [1, 1, None, 1, 1, None, 1, 1, 0]

    Use *window_size* to control the number of items passed as arguments to
    *pred*. This allows for locating and replacing subsequences.

        >>> iterable = [0, 1, 2, 5, 0, 1, 2, 5]
        >>> window_size = 3
        >>> pred = lambda *args: args == (0, 1, 2)  # 3 items passed to pred
        >>> substitutes = [3, 4] # Splice in these items
        >>> list(replace(iterable, pred, substitutes, window_size=window_size))
        [3, 4, 5, 3, 4, 5]

    r1zwindow_size must be at least 1rN)r�rrr2r�r5)	r�r��substitutesrrr�windowsr��ws	         r�r�r��s�����:�Q���9�:�:���$�K�
�x�'��k�A�o�6�	7�B��r�;�'�G�	�A�
�����8��
�1�u�9��Q���&�&�&����q��1��
�!�A�$�g�%��A�$�J�#�'�s�AB�B�B�6B�Bc#��K�t|�}t|�}ttd|��D]-}t	d|z||fz�D��cgc]
\}}|||��c}}���/ycc}}w�w)a"Yield all possible order-preserving partitions of *iterable*.

    >>> iterable = 'abc'
    >>> for part in partitions(iterable):
    ...     print([''.join(p) for p in part])
    ['abc']
    ['a', 'bc']
    ['ab', 'c']
    ['a', 'b', 'c']

    This is unrelated to :func:`partition`.

    r1r�N)r�r�r8rr�)r��sequencer�rrs     r�r}r}<se�����H�~�H��H�
�A�
�e�A�q�k�
"�B��),�T�A�X�q�A�4�x�)@�A���A�x��!�}�A�A�B��A�s�AA%�A�A%c#���K�t|�}t|�}|�|dkrtd��||kDry�fd��|�&td|dz�D]}�||�Ed{����y�||�Ed{���y7�7��w)a
    Yield the set partitions of *iterable* into *k* parts. Set partitions are
    not order-preserving.

    >>> iterable = 'abc'
    >>> for part in set_partitions(iterable, 2):
    ...     print([''.join(p) for p in part])
    ['a', 'bc']
    ['ab', 'c']
    ['b', 'ac']


    If *k* is not given, every set partition is generated.

    >>> iterable = 'abc'
    >>> for part in set_partitions(iterable):
    ...     print([''.join(p) for p in part])
    ['abc']
    ['a', 'bc']
    ['ab', 'c']
    ['b', 'ac']
    ['a', 'b', 'c']

    Nr1z6Can't partition in a negative or zero number of groupsc3�4�K�t|�}|dk(r|g��y||k(r|D�cgc]}|g��c}��y|^}}�||dz
�D]
}|gg|�����||�D]6}tt|��D]}|d||g||zgz||dzdz����8ycc}w�wrr)r�r)	rAr�r�rr	�M�pr�set_partitions_helpers	        �r�rez-set_partitions.<locals>.set_partitions_helperss��������F����6��#�I�
�!�V� !�"�1�A�3�"�"��E�A��*�1�a�!�e�4�
 ���s�i�Q�i��
 �*�1�a�0�
<���s�1�v��<�A��B�Q�%�A�3��1��:�,�.��1�q�5�7��;�;�<�
<��#�s� B�
B�A+B)r�r�r�r)r�r�rAr�res    @r�r�r�Ps������2	
�X��A��A��A��}��q�5��H��
���U��<�	�y��q�!�a�%��	3�A�,�Q��2�2�2�	3�)��A�.�.�.�
3��.�s$�AA5�A1�A5�+A3�,A5�3A5c�"�eZdZdZd�Zd�Zd�Zy)r�a]
    Yield items from *iterable* until *limit_seconds* have passed.
    If the time limit expires before all items have been yielded, the
    ``timed_out`` parameter will be set to ``True``.

    >>> from time import sleep
    >>> def generator():
    ...     yield 1
    ...     yield 2
    ...     sleep(0.2)
    ...     yield 3
    >>> iterable = time_limited(0.1, generator())
    >>> list(iterable)
    [1, 2]
    >>> iterable.timed_out
    True

    Note that the time is checked before each item is yielded, and iteration
    stops if  the time elapsed is greater than *limit_seconds*. If your time
    limit is 1 second, but it takes 2 seconds to generate the first item from
    the iterable, the function will run for 2 seconds and not yield anything.
    As a special case, when *limit_seconds* is zero, the iterator never
    returns anything.

    c�~�|dkrtd��||_t|�|_t	�|_d|_y)Nrzlimit_seconds must be positiveF)r��
limit_secondsr�rr0�_start_time�	timed_out)r�rhr�s   r�r�ztime_limited.__init__�s:���1���=�>�>�*����h����$�;�����r�c��|Sr�r�r�s r�r�ztime_limited.__iter__�r�r�c���|jdk(r
d|_t�t|j�}t�|jz
|jkDr
d|_t�|S)NrT)rhrjr�r�rr0rir0s  r�r�ztime_limited.__next__�sX������"�!�D�N����D�N�N�#���;��)�)�)�D�,>�,>�>�!�D�N����r�N�r�r�r�r�r�r�r�r�r�r�r�r��s���4��	r�r�c��t|�}t||�}	t|�}dj||�}|xst|��#t$rY|SwxYw)a*If *iterable* has only one item, return it.
    If it has zero items, return *default*.
    If it has more than one item, raise the exception given by *too_long*,
    which is ``ValueError`` by default.

    >>> only([], default='missing')
    'missing'
    >>> only([1])
    1
    >>> only([1, 2])  # doctest: +IGNORE_EXCEPTION_DETAIL
    Traceback (most recent call last):
    ...
    ValueError: Expected exactly one item in iterable, but got 1, 2,
     and perhaps more.'
    >>> only([1, 2], too_long=TypeError)  # doctest: +IGNORE_EXCEPTION_DETAIL
    Traceback (most recent call last):
    ...
    TypeError

    Note that :func:`only` attempts to advance *iterable* twice to ensure there
    is only one item.  See :func:`spy` or :func:`peekable` to check
    iterable contents less destructively.
    r)r�r�rr�r�)r�r�rrrr
rs       r�ryry�sj��0
�h��B��r�7�#�K�	*��B�x��

 � &��{�L� A�	��)�*�S�/�)���
����
�s�A�	A�Ac�$�eZdZd�Zd�Zd�Zd�Zy)�_IChunkc�D�t||�|_t�|_yr�)rr�rr�)r�r�r�s   r�r�z_IChunk.__init__�s���(�A�&����g��r�c�N�|jj|j�yr�)r�r�r�r�s r��
fill_cachez_IChunk.fill_cache�s�������4�8�8�$r�c��|Sr�r�r�s r�r�z_IChunk.__iter__�r�r�c��	t|j�S#t$r*|jr|jj	�cYS�wxYwr�)r�r�r�r�r�r�s r�r�z_IChunk.__next__�sA��	�����>�!���	��{�{��{�{�*�*�,�,��		�s��/A
�A
N)r�r�r�r�rsr�r�r�r�r�rprp�s���%��r�rpc#�K�tt|��}t�}	|j|�}||uryt	||�}|��|j��7�w)a�Break *iterable* into sub-iterables with *n* elements each.
    :func:`ichunked` is like :func:`chunked`, but it yields iterables
    instead of lists.

    If the sub-iterables are read in order, the elements of *iterable*
    won't be stored in memory.
    If they are read out of order, :func:`itertools.tee` is used to cache
    elements as necessary.

    >>> from itertools import count
    >>> all_chunks = ichunked(count(), 4)
    >>> c_1, c_2, c_3 = next(all_chunks), next(all_chunks), next(all_chunks)
    >>> list(c_2)  # c_1's elements have been cached; c_3's haven't been
    [4, 5, 6, 7]
    >>> list(c_1)
    [0, 1, 2, 3]
    >>> list(c_3)
    [8, 9, 10, 11]

    N)r~r��objectr�rprs)r�r��source�
ichunk_markerr�r�s      r�r^r^�s]����*�d�8�n�
%�F��H�M�
��{�{�=�)���=� �����"����	�����s�AAc�V�tttt|dt	�i���S)aReturn ``True`` if all given *iterables* are equal to each other,
    which means that they contain the same elements in the same order.

    The function is useful for comparing iterables of different data types
    or iterables that do not support equality checks.

    >>> iequals("abc", ['a', 'b', 'c'], ('a', 'b', 'c'), iter("abc"))
    True

    >>> iequals("abc", "acb")
    False

    Not to be confused with :func:`all_equal`, which checks whether all
    elements of iterable are equal to each other.

    r9)�allr-r;rrwr[s r�r_r_
s"��"�s�9�k�9�I���I�J�K�Kr�c	#��K�|dkrtd��|dk(rd��yt|�}tt|�t	d���g}dg|z}d}|rn	t|d�\}}|||<|dz|k(rt|���n=|jtt||dzd|dz�t	d����|dz
}|r�myy#t$r|j�|dz}Y��wxYw�w)aBYield the distinct combinations of *r* items taken from *iterable*.

        >>> list(distinct_combinations([0, 0, 1], 2))
        [(0, 0), (0, 1)]

    Equivalent to ``set(combinations(iterable))``, except duplicates are not
    generated and thrown away. For larger input sequences this is much more
    efficient.

    rzr must be non-negativer�Nr1rr�)	r�rr:rdr'r�r��popr�)r�r r2�
generators�
current_comborv�cur_idxrds        r�rQrQ0
s����	�1�u��1�2�2�	
�a�������?�D�!�)�D�/�z�!�}�E�F�J��F�Q�J�M�
�E�
�	��j��n�-�J�G�Q�
 !�
�e���1�9��>��
�&�&������d�7�Q�;�=�1�7�Q�;�?�"�1�
��
�
�Q�J�E�#���	��N�N���Q�J�E��	�s1�AC%�C�$AC%�?C%�C"�C%�!C"�"C%c'�JK�|D]}	||�|���y#|$rY�wxYw�w)aYield the items from *iterable* for which the *validator* function does
    not raise one of the specified *exceptions*.

    *validator* is called for each item in *iterable*.
    It should be a function that accepts one argument and raises an exception
    if that item is not valid.

    >>> iterable = ['1', '2', 'three', '4', None]
    >>> list(filter_except(int, iterable, ValueError, TypeError))
    ['1', '2', '4']

    If an exception other than one given by *exceptions* is raised by
    *validator*, it is raised like normal.
    Nr�)rMr��
exceptionsr�s    r�rYrYX
s=�������	��d�O��J�
���	��	�s�#��#� �#� �#c'�FK�|D]
}	||����y#|$rY�wxYw�w)a�Transform each item from *iterable* with *function* and yield the
    result, unless *function* raises one of the specified *exceptions*.

    *function* is called to transform each item in *iterable*.
    It should accept one argument.

    >>> iterable = ['1', '2', 'three', '4', None]
    >>> list(map_except(int, iterable, ValueError, TypeError))
    [1, 2, 4]

    If an exception other than one given by *exceptions* is raised by
    *function*, it is raised like normal.
    Nr�)�functionr�r�r�s    r�rnrnp
s9�������	��4�.� ����	��	�s�!�
�!��!��!c��|Sr�r�rHs r�rr�
s��Q�r�c#�NK�|D]}||�r||�n||����y�w)a�Evaluate each item from *iterable* using *pred*. If the result is
    equivalent to ``True``, transform the item with *func* and yield it.
    Otherwise, transform the item with *func_else* and yield it.

    *pred*, *func*, and *func_else* should each be functions that accept
    one argument. By default, *func_else* is the identity function.

    >>> from math import sqrt
    >>> iterable = list(range(-5, 5))
    >>> iterable
    [-5, -4, -3, -2, -1, 0, 1, 2, 3, 4]
    >>> list(map_if(iterable, lambda x: x > 3, lambda x: 'toobig'))
    [-5, -4, -3, -2, -1, 0, 1, 2, 3, 'toobig']
    >>> list(map_if(iterable, lambda x: x >= 0,
    ... lambda x: f'{sqrt(x):.2f}', lambda x: None))
    [None, None, None, None, None, '0.00', '1.00', '1.41', '1.73', '2.00']
    Nr�)r�r�r��	func_elser�s     r�roro�
s-����$�<�� ��J�d�4�j�I�d�O�;�<�s�#%c	��t||�}ttt��|z�}|t	tt��td|z
�z�z}t||�D]l\}}||k(s�||t
|�<|ttt��|z�z}|t	tt��td|z
�z�dzz
}�n|Srr)r9rrr$rrdr%)r�r��	reservoir�W�
next_indexr�r4s       r��_sample_unweightedr��
s���
�Q��!�I�	�C���M�A���A��U�3�v�x�=�3�q�1�u�:�5�6�6�J�#�H�a�0�@���w��J��&-�I�i��l�#�
��S���]�Q�&�'�'�A��%��F�H�
��A��E�
� :�;�a�?�?�J�@��r�c���d�|D�}t|t||��}t|�|d\}}tt	��|z}t||�D]l\}}	||k\r]|d\}}t||z�}
t
|
d�}t|�|z}t|||	f�|d\}}tt	��|z}�h||z}�nt|�D�cgc]}t|�d��c}Scc}w)Nc3�HK�|]}tt��|z���y�wr�)rr$)r@�weights  r�rBz#_sample_weighted.<locals>.<genexpr>�
s����@�f�3�v�x�=�6�)�@�s� "rr1)
r9r�rrr$rr&r
rr)
r�r��weights�weight_keysr��smallest_weight_keyr;�weights_to_skipr�r4�t_w�r_2�
weight_keys
             r��_sample_weightedr��
s��
A��@�K��Q��K��2�3�I��I��'�q�\�����&�(�m�&9�9�O��w��1�&�����_�$�&/�q�\�"����f�2�2�3�C��#�q�/�C��S��F�*�J��	�J��#8�9�%.�q�\�"���!�&�(�m�.A�A�O��v�%�O�&�,1��8�4�a�G�I��q�!�4�4��4s�C)c�r�|dk(rgSt|�}|�t||�St|�}t|||�S)afReturn a *k*-length list of elements chosen (without replacement)
    from the *iterable*. Like :func:`random.sample`, but works on iterables
    of unknown length.

    >>> iterable = range(100)
    >>> sample(iterable, 5)  # doctest: +SKIP
    [81, 60, 96, 16, 4]

    An iterable with *weights* may also be given:

    >>> iterable = range(100)
    >>> weights = (i * i + 1 for i in range(100))
    >>> sampled = sample(iterable, 5, weights=weights)  # doctest: +SKIP
    [79, 67, 74, 66, 78]

    The algorithm can also be used to generate weighted random permutations.
    The relative weight of each item determines the probability that it
    appears late in the permutation.

    >>> data = "abcdefgh"
    >>> weights = range(1, len(data) + 1)
    >>> sample(data, k=len(data), weights=weights)  # doctest: +SKIP
    ['c', 'a', 'b', 'e', 'g', 'd', 'h', 'f']
    r)r�r�r�)r�r�r�s   r�r�r��
sC��2	�A�v��	��H�~�H���!�(�A�.�.��w�-����!�W�5�5r�c��|r|rtntn
|rtnt}|�|nt	||�}tt
|t|���S)a�Returns ``True`` if the items of iterable are in sorted order, and
    ``False`` otherwise. *key* and *reverse* have the same meaning that they do
    in the built-in :func:`sorted` function.

    >>> is_sorted(['1', '2', '3', '4', '5'], key=int)
    True
    >>> is_sorted([5, 4, 3, 1, 2], reverse=True)
    False

    If *strict*, tests for strict sorting, that is, returns ``False`` if equal
    elements are found:

    >>> is_sorted([1, 2, 2])
    True
    >>> is_sorted([1, 2, 2], strict=True)
    False

    The function returns ``False`` after encountering the first out-of-order
    item. If there are no out-of-order items, the iterable is exhausted.
    )r-r,r+r*r-r�rr7)r�rLrCr��comparers      r�rere�
s@��,*0�W�r�"�G�b��G��[��c�#�x�&8�B��7�7�H�R�L�1�2�2�2r�c��eZdZy)r=N)r�r�r�r�r�r�r=r=s��r�r=c�V�eZdZdZdd�Zd�Zd�Zd�Zd�Ze	d��Z
e	d��Zd	�Zy
)rDa�Convert a function that uses callbacks to an iterator.

    Let *func* be a function that takes a `callback` keyword argument.
    For example:

    >>> def func(callback=None):
    ...     for i, c in [(1, 'a'), (2, 'b'), (3, 'c')]:
    ...         if callback:
    ...             callback(i, c)
    ...     return 4


    Use ``with callback_iter(func)`` to get an iterator over the parameters
    that are delivered to the callback.

    >>> with callback_iter(func) as it:
    ...     for args, kwargs in it:
    ...         print(args)
    (1, 'a')
    (2, 'b')
    (3, 'c')

    The function will be called in a background thread. The ``done`` property
    indicates whether it has completed execution.

    >>> it.done
    True

    If it completes successfully, its return value will be available
    in the ``result`` property.

    >>> it.result
    4

    Notes:

    * If the function uses some keyword argument besides ``callback``, supply
      *callback_kwd*.
    * If it finished executing, but raised an exception, accessing the
      ``result`` property will raise the same exception.
    * If it hasn't finished executing, accessing the ``result``
      property from within the ``with`` block will raise ``RuntimeError``.
    * If it hasn't finished executing, accessing the ``result`` property from
      outside the ``with`` block will raise a
      ``more_itertools.AbortThread`` exception.
    * Provide *wait_seconds* to adjust how frequently the it is polled for
      output.

    c���||_||_d|_d|_||_td�jjd��|_|j�|_
y)NFzconcurrent.futuresr1)�max_workers)�_func�
_callback_kwd�_aborted�_future�
_wait_seconds�
__import__�futures�ThreadPoolExecutor�	_executor�_reader�	_iterator)r�r��callback_kwd�wait_secondss    r�r�zcallback_iter.__init__Ms[����
�)�����
����)���#� �
�
�'�$�$��$�3�	
�������r�c��|Sr�r�r�s r��	__enter__zcallback_iter.__enter__Yr�r�c�F�d|_|jj�yrG)r�r��shutdown)r��exc_type�	exc_value�	tracebacks    r��__exit__zcallback_iter.__exit__\s����
������!r�c��|Sr�r�r�s r�r�zcallback_iter.__iter__`r�r�c�,�t|j�Sr�)r�r�r�s r�r�zcallback_iter.__next__crr�c�P�|j�y|jj�Sr�)r��doner�s r�r�zcallback_iter.donefs"���<�<����|�|� � �"�"r�c�d�|jstd��|jj�S)NzFunction has not yet completed)r��RuntimeErrorr�rKr�s r�rKzcallback_iter.resultls(���y�y��?�@�@��|�|�"�"�$�$r�c#���K�t����fd�}�jj�jfi�j|i���_		�j
�j��}�j�|���j
j�rn�Mg}		�j�}�j�|j|��3#t$rY�]wxYw#t$rYnwxYw�j�|Ed{���7y�w)Nc�Z���jrtd���j||f�y)Nzcanceled by user)r�r=�put)r�r�r�r�s  ��r��callbackz'callback_iter._reader.<locals>.callbackvs&����}�}�!�"4�5�5�
�E�E�4��.�!r�)�timeout)r#r��submitr�r�r��getr��	task_doner"r��
get_nowaitr��join)r�r�r�r�r�s`   @r�r�zcallback_iter._readerss������G��	"�-�t�~�~�,�,��J�J�
��-�-�x�8�
����
��u�u�T�%7�%7�u�8�����
��
��|�|� � �"����	��
'��|�|�~�����
�� � ��&����
��
���
��
��
	
�������sZ�A
D�C�+3D�C �/"D�	C�D�C�D� 	C,�)D�+C,�,D�D�DN)r�g�������?)
r�r�r�r�r�r�r�r�r��propertyr�rKr�r�r�r�rDrDsN��0�d
(��"��$��#��#�
�%��%�#r�rDc#��K�|dkrtd��t|�}t|�}||kDrtd��t||z
dz�D]}|d|}||||z}|||zd}|||f��� y�w)a�
    Yield ``(beginning, middle, end)`` tuples, where:

    * Each ``middle`` has *n* items from *iterable*
    * Each ``beginning`` has the items before the ones in ``middle``
    * Each ``end`` has the items after the ones in ``middle``

    >>> iterable = range(7)
    >>> n = 3
    >>> for beginning, middle, end in windowed_complete(iterable, n):
    ...     print(beginning, middle, end)
    () (0, 1, 2) (3, 4, 5, 6)
    (0,) (1, 2, 3) (4, 5, 6)
    (0, 1) (2, 3, 4) (5, 6)
    (0, 1, 2) (3, 4, 5) (6,)
    (0, 1, 2, 3) (4, 5, 6) ()

    Note that *n* must be at least 0 and most equal to the length of
    *iterable*.

    This function will exhaust the iterable and may require significant
    storage.
    rr7zn must be <= len(seq)r1N)r�rr�r)r�r�r8rr�	beginning�middle�ends        r�r�r��s�����0	�1�u��)�*�*�
��/�C��s�8�D��4�x��0�1�1�
�4�!�8�a�<�
 �%�����G�	��Q��Q�����!�a�%�'�l�����$�$�	%�s�A*A,c���t�}|j}g}|j}|rt||�n|D]}	||vry||��y#t$r||vrYy||�Y�/wxYw)a
    Returns ``True`` if all the elements of *iterable* are unique (no two
    elements are equal).

        >>> all_unique('ABCB')
        False

    If a *key* function is specified, it will be used to make comparisons.

        >>> all_unique('ABCb')
        True
        >>> all_unique('ABCb', str.lower)
        False

    The function returns as soon as the first non-unique element is
    encountered. Iterables with a mix of hashable and unhashable items can
    be used, but the function will be slower for unhashable items.
    FT)r.�addr�r-r�)r�rL�seenset�seenset_add�seenlist�seenlist_addr4s       r�r@r@�s}��&�e�G��+�+�K��H��?�?�L�),�3�s�H�%�(�"��	"��'�!���� �	"���	�	"��(�"����!�	"�s�A
�A
�

A%�A%�$A%c�h�tttt|���}ttt|��}tt|�}|dkr||z
}d|cxkr
|ks
t�t�g}t||�D]!\}}|j|||z�||z}�#tt|��S)a�Equivalent to ``list(product(*args))[index]``.

    The products of *args* can be ordered lexicographically.
    :func:`nth_product` computes the product at sort position *index* without
    computing the previous products.

        >>> nth_product(8, range(2), range(2), range(2), range(2))
        (1, 0, 0, 0)

    ``IndexError`` will be raised if the given *index* is invalid.
    r)
r�r-rr�r�r
r(r�r�r�)r�r��pools�nsrrKr2r�s        r�ruru�s���
��U�H�T�N�+�,�E�	
�c�#�u�o�	�B��s�B��A��q�y�
��
����>��>������
�F��u�b�>����a��
�
�d�5�1�9�o�&�
�!������&�!�"�"r�c��t|�}t|�}|�||k(r|t|�}}n$d|cxkr
|ks
t�t�t	||�}|dkr||z
}d|cxkr
|ks
t
�t
�|dk(r
t
�Sdg|z}||kr|t|�z|zn|}td|dz�D]1}t||�\}}	d||z
cxkr|krnn|	|||z
<|dk(s�1nt
t|j|��S)a'Equivalent to ``list(permutations(iterable, r))[index]```

    The subsequences of *iterable* that are of length *r* where order is
    important can be ordered lexicographically. :func:`nth_permutation`
    computes the subsequence at sort position *index* directly, without
    computing the previous subsequences.

        >>> nth_permutation('ghijk', 2, 5)
        ('h', 'i')

    ``ValueError`` will be raised If *r* is negative or greater than the length
    of *iterable*.
    ``IndexError`` will be raised if the given *index* is invalid.
    rr1)r�r�rr�r r�rrr�r-r})
r�r r�r2r�rrKr��drs
          r�rtrts����>�D��D�	�A��y�A��F��)�A�,�1��
�!�Z�a�Z��������A�J���q�y�
��
����>��>�������A�v��w���S�1�W�F�%&��U��	�!����!��A�
�1�a�!�e�_����a��|���1���A��>��>��F�1�q�5�M���6�����T�X�X�v�&�'�'r�c�d�t|�}t|�}|dks||kDrt�t||zdz
|�}|dkr||z
}|dks||k\rt�g}d}|rN|dz}|dk\r-t||zdz
|�}||krn|dz}|dz
}||z}|dk\r�-|j||�|r�Nt|�S)agEquivalent to
    ``list(combinations_with_replacement(iterable, r))[index]``.


    The subsequences with repetition of *iterable* that are of length *r* can
    be ordered lexicographically. :func:`nth_combination_with_replacement`
    computes the subsequence at sort position *index* directly, without
    computing the previous subsequences with replacement.

        >>> nth_combination_with_replacement(range(5), 3, 5)
        (0, 1, 1)

    ``ValueError`` will be raised If *r* is negative or greater than the length
    of *iterable*.
    ``IndexError`` will be raised if the given *index* is invalid.
    rr1)rr�r�r!r�r�)	r�r r�r2r�rrKr�	num_combss	         r�rvrv1s���"��?�D��D�	�A�	�A��1�q�5����Q��U�Q�Y���A��q�y�
��
��
��	�u��z���
�F�	�A�
�	�Q����1�f��Q��U�Q�Y��*�I��y� ��
��F�A�
��F�A��Y��E�
�1�f�	�
�
�d�1�g�����=�r�c'�K�|D](}t|ttf�r|���	|Ed{����*y7�#t$r|��Y�=wxYw�w)a�Yield all arguments passed to the function in the same order in which
    they were passed. If an argument itself is iterable then iterate over its
    values.

        >>> list(value_chain(1, 2, 3, [4, 5, 6]))
        [1, 2, 3, 4, 5, 6]

    Binary and text strings are not considered iterable and are emitted
    as-is:

        >>> list(value_chain('12', '34', ['56', '78']))
        ['12', '34', '56', '78']


    Multiple levels of nesting are not flattened.

    N)r�rsrtr�)r�rPs  r�r�r�_sS����$����e�c�5�\�*��K��	�����

���	��K�	�s1�!A�3�1�3�A�3�
A�A�A�Ac���d}t||t��D]K\}}|tus|turtd��t|�}|t	|�z|j|�z}�M|S)a�Equivalent to ``list(product(*args)).index(element)``

    The products of *args* can be ordered lexicographically.
    :func:`product_index` computes the first index of *element* without
    computing the previous products.

        >>> product_index([8, 2], range(10), range(5))
        42

    ``ValueError`` will be raised if the given *element* isn't in the product
    of *args*.
    rr�z element is not a product of args)rr2r�rr�r�)r4r�r�rIr2s     r�r�r�{si��
�E��w���@�2���4���<�4�7�?��?�@�@��T�{����D�	�!�D�J�J�q�M�1��2��Lr�c��t|�}t|d�\}}|�yg}t|�}|D]1\}}||k(s�|j|�t|d�\}}|�n|}�3td��t	||df��\}}	d}
tt|�d��D]\}}||z
}||ks�|
t
||�z
}
�!t
|dz|dz�|
z
S)a�Equivalent to ``list(combinations(iterable, r)).index(element)``

    The subsequences of *iterable* that are of length *r* can be ordered
    lexicographically. :func:`combination_index` computes the index of the
    first *element*, without computing the previous combinations.

        >>> combination_index('adf', 'abcdefg')
        10

    ``ValueError`` will be raised if the given *element* isn't one of the
    combinations of *iterable*.
    �NNNrz(element is not a combination of iterabler�r1)r�)rdr�r�r�rir�r!)
r4r�r��y�indexesr2r�rI�tmpr;r�rrs
             r�rIrI�s����� �G����&�D�A�q��y���G��X��D��	E���1���6��N�N�1���'�<�0�F�C���{����	E��C�D�D���q�$�i�(�D�A�q�
�E��(�7�+�1�5� ���1�
��E����6��T�!�Q�Z��E� �
��A��q�1�u���%�%r�c��t|�}t|�}t|�}t|d�\}}|�yg}t|�}t|�D]9\}}||k(r+|j	|�t|d�\}	}|	�n|	}||k(r�+|��9ntd��t|�}dg|z}
|D]}|
|xxdz
cc<�d}d}
t
d|�D]5}|
|
|dz
z
}
||zdz
|z
|
z
}||z
}||ks�'|t||�z
}�7|S)a0Equivalent to
    ``list(combinations_with_replacement(iterable, r)).index(element)``

    The subsequences with repetition of *iterable* that are of length *r* can
    be ordered lexicographically. :func:`combination_with_replacement_index`
    computes the index of the first *element*, without computing the previous
    combinations with replacement.

        >>> combination_with_replacement_index('adf', 'abcdefg')
        20

    ``ValueError`` will be raised if the given *element* isn't one of the
    combinations with replacement of *iterable*.
    r�rz9element is not a combination with replacement of iterabler1)rr�rdr�r�r�rr!)r4r��lr�r�r�r2r�rIr��occupationsrdr��cumulative_sumrrs                r�rJrJ�sV���G�n�G��G��A��� �G����&�D�A�q��y���G���?�D��$��

���1��1�f��N�N�1���'�<�0�F�C���{����
�1�f�
�9��

��G�
�	
�	�D�	�A��#��'�K�
����A��!����
�E��N�
�1�a�[� ���+�a�!�e�,�,��
��E�A�I��M�N�*��
��E����6��T�!�Q�Z��E� ��Lr�c��d}t|�}ttt|�dd�|�D]!\}}|j	|�}||z|z}||=�#|S)a�Equivalent to ``list(permutations(iterable, r)).index(element)```

    The subsequences of *iterable* that are of length *r* where order is
    important can be ordered lexicographically. :func:`permutation_index`
    computes the index of the first *element* directly, without computing
    the previous permutations.

        >>> permutation_index([1, 3, 2], range(5))
        19

    ``ValueError`` will be raised if the given *element* isn't one of the
    permutations of *iterable*.
    rr�)r�r�rr�r�)r4r�r�r2rrIr s       r�rr�sa��
�E���>�D��E�#�d�)�R��,�g�6����1��J�J�q�M����	�A�
����G��
�Lr�c�"�eZdZdZd�Zd�Zd�Zy)rOa�Wrap *iterable* and keep a count of how many items have been consumed.

    The ``items_seen`` attribute starts at ``0`` and increments as the iterable
    is consumed:

        >>> iterable = map(str, range(10))
        >>> it = countable(iterable)
        >>> it.items_seen
        0
        >>> next(it), next(it)
        ('0', '1')
        >>> list(it)
        ['2', '3', '4', '5', '6', '7', '8', '9']
        >>> it.items_seen
        10
    c�2�t|�|_d|_yr�)r�r��
items_seenr�s  r�r�zcountable.__init__"s����>�����r�c��|Sr�r�r�s r�r�zcountable.__iter__&r�r�c�Z�t|j�}|xjdz
c_|Srr)r�r�r�r0s  r�r�zcountable.__next__)s"���D�H�H�~�����1����r�Nrmr�r�r�rOrOs���"��r�rOc�\�t|dd�}|�t||�St||�|�S)a�Break *iterable* into lists of approximately length *n*.
    Items are distributed such the lengths of the lists differ by at most
    1 item.

    >>> iterable = [1, 2, 3, 4, 5, 6, 7]
    >>> n = 3
    >>> list(chunked_even(iterable, n))  # List lengths: 3, 2, 2
    [[1, 2, 3], [4, 5], [6, 7]]
    >>> list(chunked(iterable, n))  # List lengths: 3, 3, 1
    [[1, 2, 3], [4, 5, 6], [7]]

    r�N)�getattr�_chunked_even_online�_chunked_even_finite)r�r��
len_methods   r�rFrF0s6����9�d�3�J���#�H�a�0�0�#�H�j�l�A�>�>r�c#��K�g}||dz
|dz
zz}|D].}|j|�t|�|k(s�#|d|��||d}�0t|t|�|�Ed{���y7��w)Nrr1)r�r�r�)r�r��buffer�maxbufrIs     r�r�r�Fsx����
�F�
�!�a�%�A��E�"�
"�F�
� ���
�
�a���v�;�&� ���!�*���A�B�Z�F�	 �
$�F�C��K��;�;�;�s�5A'�'A'�A%� A'c	#�K�|dkryt||�\}}||dkDrdndz}t||�\}}||dkDrdndz}|dz
}|||zz
}||z
}	||z}
|dkDr-td|
|�D]}tt||||z�����|dkDr4t|
|
|	|zz|�D]}tt||||z�����yy�w)Nr1r)r�rr�r)r��Nr�r�r �	num_lists�	full_size�partial_size�num_full�num_partial�partial_start_idxrs            r�r�r�Qs
�����1�u���!�Q�<�D�A�q��!�a�%�Q�Q�'�I��!�Y��D�A�q��!�a�%�Q�Q�'�I��q�=�L��<�)�+�+�H��h�&�K�!�9�,���1�}��q�+�Y�7�	;�A��v�h��1�y�=�9�:�:�	;��a������|�!;�<��
�	>�A�
�v�h��1�|�+;�<�=�=�	>��s�CC)�scalar_typesr�c'�x�K��fd�}t|�}|sydg|z}gg}}t|�D]>\}}	||	�r|	||<�|jt|	��|j|��@|st	|���y|rt
nt}
|
|�D]&}t
||�D]\}||<�
t	|����(y�w)aA version of :func:`zip` that "broadcasts" any scalar
    (i.e., non-iterable) items into output tuples.

    >>> iterable_1 = [1, 2, 3]
    >>> iterable_2 = ['a', 'b', 'c']
    >>> scalar = '_'
    >>> list(zip_broadcast(iterable_1, iterable_2, scalar))
    [(1, 'a', '_'), (2, 'b', '_'), (3, 'c', '_')]

    The *scalar_types* keyword argument determines what types are considered
    scalar. It is set to ``(str, bytes)`` by default. Set it to ``None`` to
    treat strings and byte strings as iterable:

    >>> list(zip_broadcast('abc', 0, 'xyz', scalar_types=None))
    [('a', 0, 'x'), ('b', 0, 'y'), ('c', 0, 'z')]

    If the *strict* keyword argument is ``True``, then
    ``UnequalIterablesError`` will be raised if any of the iterables have
    different lengths.
    c�Z���r
t|��ry	t|�y#t$rYywxYw)NTF)r�r�r�)r�r�s �r��	is_scalarz zip_broadcast.<locals>.is_scalar�s7����J�s�L�9��	���I����	��	�s��	*�*N)r�rdr�r�rr3r�)r�r��objectsr�r�new_itemr1�iterable_positionsrr��zipperr�s`           r�r�r�ns������,��w�<�D����v��}�H�$&��!�I��G�$�)���3��S�>��H�Q�K����T�#�Y�'��%�%�a�(�)���G�n���!�Z�s�F��	�"���!�"4�d�;�	�N�A�x��{��	��H�o���s�B7B:c#�4K�|dkrtd��t|��}tt�}|du}|D]`}t	|�|k(r|d}||dk(r||=n
||xxdzcc<|r||�n|}||vr|��||xxdz
cc<|j|��by�w)a�Yield the items from *iterable* that haven't been seen recently.
    *n* is the size of the lookback window.

        >>> iterable = [0, 1, 0, 2, 3, 0]
        >>> n = 3
        >>> list(unique_in_window(iterable, n))
        [0, 1, 2, 3, 0]

    The *key* function, if provided, will be used to determine uniqueness:

        >>> list(unique_in_window('abAcda', 3, key=lambda x: x.lower()))
        ['a', 'b', 'c', 'd', 'a']

    The items in *iterable* must be hashable.

    rzn must be greater than 0r�Nr1)r�rrr�r�r�)	r�r�rLr:r3�use_keyr��
to_discardr�s	         r�r�r��s�����"	�A�v��3�4�4�
�!�_�F�
��
�F���o�G�����v�;�!�����J��j�!�Q�&��:�&��z�"�a�'�"� �C��I�d���F�?��J��q�	�Q��	��
�
�a���s�BBc#��K�t�}g}|du}|D])}|r||�n|}	||vr|j|�n|���+y#t$r||vr|j|�n|��Y�RwxYw�w)a{Yield duplicate elements after their first appearance.

    >>> list(duplicates_everseen('mississippi'))
    ['s', 'i', 's', 's', 'i', 'p', 'i']
    >>> list(duplicates_everseen('AaaBbbCccAaa', str.lower))
    ['a', 'a', 'b', 'b', 'c', 'c', 'A', 'a', 'a']

    This function is analogous to :func:`unique_everseen` and is subject to
    the same performance considerations.

    N)r.r�r�r�)r�rL�seen_set�	seen_listrr4r�s       r�rUrU�s������u�H��I���o�G����#�C��L���		��� ����Q���
��
���	��	�!�� � ��#��
��		�s'�"A+�A�A+�#A(�%A+�'A(�(A+c�:�td�t||�D��S)a2Yields serially-duplicate elements after their first appearance.

    >>> list(duplicates_justseen('mississippi'))
    ['s', 's', 'p']
    >>> list(duplicates_justseen('AaaBbbCccAaa', str.lower))
    ['a', 'a', 'b', 'b', 'c', 'c', 'a', 'a']

    This function is analogous to :func:`unique_justseen`.

    c3�4K�|]\}}|D]}|����y�wr�r�)r@r;r�s   r�rBz&duplicates_justseen.<locals>.<genexpr>�s ����C���A��C�A�1�C�1�C�s�)r6r)r�rLs  r�rVrV�s���C���3�!7�C�C�Cr�c#�K�t�}g}|du}d}t|�D]>\}}|r||�n|}|xs||k7}	|}d}
	||vr|j|�d}
||	|
f���@y#t$r||vr|j	|�d}
Y�,wxYw�w)a�Classify each element in terms of its uniqueness.

    For each element in the input iterable, return a 3-tuple consisting of:

    1. The element itself
    2. ``False`` if the element is equal to the one preceding it in the input,
       ``True`` otherwise (i.e. the equivalent of :func:`unique_justseen`)
    3. ``False`` if this element has been seen anywhere in the input before,
       ``True`` otherwise (i.e. the equivalent of :func:`unique_everseen`)

    >>> list(classify_unique('otto'))    # doctest: +NORMALIZE_WHITESPACE
    [('o', True,  True),
     ('t', True,  True),
     ('t', False, False),
     ('o', True,  False)]

    This function is analogous to :func:`unique_everseen` and is subject to
    the same performance considerations.

    NFT)r.rdr�r�r�)r�rLrrr�previousrr4r��is_unique_justseen�is_unique_everseens           r�rWrW�s�����*�u�H��I���o�G��H���)�
>�
��7�#�C��L���!"�U�3�h�!�m����"��	*��� ����Q��%)�"�
�)�+=�=�=�
>���	*��	�!�� � ��#�%)�"��	*�s)�>B�A"�
B�" B�B�B�B)rLr�c��|r|g|��n|}t|�}	t|�x}}|�2t|||��D]\}	}
|
|	kr|
|	}
}	|	|kr|	}||
ks�|
}�||fS||�x}}t|||��D]8\}	}
||	�||
�}}
||
kr|
|	||
f\}	}
}
}|
|kr|	|
}}||ks�5|
|}}�:||fS#t$r }|turt	d�|�|cYd}~Sd}~wwxYw)a�Returns both the smallest and largest items in an iterable
    or the largest of two or more arguments.

        >>> minmax([3, 1, 5])
        (1, 5)

        >>> minmax(4, 2, 6)
        (2, 6)

    If a *key* function is provided, it will be used to transform the input
    items for comparison.

        >>> minmax([5, 30], key=str)  # '30' sorts before '5'
        (30, 5)

    If a *default* value is provided, it will be returned if there are no
    input items.

        >>> minmax([], default=(0, 0))
        (0, 0)

    Otherwise ``ValueError`` is raised.

    This function is based on the
    `recipe <http://code.activestate.com/recipes/577916/>`__ by
    Raymond Hettinger and takes care to minimize the number of comparisons
    performed.
    z[`minmax()` argument is an empty iterable. Provide a `default` value to suppress this error.Nr�)r�r�r�r2r�r)�iterable_or_valuerLr��othersr�r�lo�hir	rIr��lo_key�hi_key�x_key�y_keys               r�rrrr#sI��:06�!�+�F�+�;L�H�	
�h��B���r�(���R��{���B�"�5�	�D�A�q��1�u��!�1���2�v����A�v���
	�*�r�6�M��b�'�!�����B�"�5�	&�D�A�q��q�6�3�q�6�5�E��u�}�%&��5�%�%7�"��1�e�U��v�~���F����~���F��	&��r�6�M��C���g���D���
����
�s�
B/�/	C�8C�
C�CTc#�8K�|dkrtd��g}d}d}|D]k}||�}	|r|	|kDrtd��||k(}
|	|z|kD}|r%|s|
r!t|���|j�d}d}|j|�||	z
}|dz
}�m|rt|���yy�w)aBYield batches of items from *iterable* with a combined size limited by
    *max_size*.

    >>> iterable = [b'12345', b'123', b'12345678', b'1', b'1', b'12', b'1']
    >>> list(constrained_batches(iterable, 10))
    [(b'12345', b'123'), (b'12345678', b'1', b'1'), (b'12', b'1')]

    If a *max_count* is supplied, the number of items per batch is also
    limited:

    >>> iterable = [b'12345', b'123', b'12345678', b'1', b'1', b'12', b'1']
    >>> list(constrained_batches(iterable, 10, max_count = 2))
    [(b'12345', b'123'), (b'12345678', b'1'), (b'1', b'12'), (b'1',)]

    If a *get_len* function is supplied, use that instead of :func:`len` to
    determine item size.

    If *strict* is ``True``, raise ``ValueError`` if any single item is bigger
    than *max_size*. Otherwise, allow single items to exceed *max_size*.
    rz&maximum size must be greater than zerozitem size exceeds maximum sizer1N)r�rrr�)r��max_size�	max_count�get_lenr��batch�
batch_size�batch_countr��item_len�
reached_count�reached_sizes            r�rLrLjs�����.�1�}��A�B�B��E��J��K�����4�=���h��)��=�>�>�#�y�0�
��*�,�x�7���L�M���,���K�K�M��J��K�
���T���h��
��q����"
��E�l��
�s�BBc'����K�td�|D���t��}�D]}t|�dks�td��dg|z�tt	|dz��}dg|z}	t��fd�t	|�D����|d}d|d<||k(ry�|||z�|<�|dk(s�|t�|�dz
k(r||||<||dz||<|dz||dz<�}�w)afLike :func:`itertools.product`, but return tuples in an order such
    that only one element in the generated tuple changes from one iteration
    to the next.

        >>> list(gray_product('AB','CD'))
        [('A', 'C'), ('B', 'C'), ('B', 'D'), ('A', 'D')]

    This function consumes all of the input iterables before producing output.
    If any of the input iterables have fewer than two items, ``ValueError``
    is raised.

    For information on the algorithm, see
    `this section <https://www-cs-faculty.stanford.edu/~knuth/fasc2a.ps.gz>`__
    of Donald Knuth's *The Art of Computer Programming*.
    c3�2K�|]}t|����y�wr�)rr^s  r�rBzgray_product.<locals>.<genexpr>�s����6�q�%��(�6�s�rz)each iterable must have two or more itemsrr1c3�4�K�|]}�|�|���y�wr�r�)r@rr��
all_iterabless  ��r�rBzgray_product.<locals>.<genexpr>�s�����J�q�M�!�$�Q�q�T�*�J�r�N)rr�r�r�r)r1�iterable_countr�rM�orr�r!s      @@r�r\r\�s ����� �6�I�6�6�M���'�N�!�J���x�=�1���H�I�I�J�
��n��A��U�>�A�%�
&�'�A�	
��n��A�
��J�E�.�4I�J�J�J�
�a�D����!��������t�a��d�{��!���Q�4�1�9��!���M�!�$4� 5�� 9�9��a�D�5�A�a�D��Q��U�8�A�a�D��1�u�A�a�!�e�H��s�1C#�B-C#c'�K�ttt|��}	|D�cgc]
}t|���}}t|���t
|�D]\}}|D]||<t|�����ycc}w#t$rYywxYw�w)a�Yields tuples containing one item from each iterator, with subsequent
    tuples changing a single item at a time by advancing each iterator until it
    is exhausted. This sequence guarantees every value in each iterable is
    output at least once without generating all possible combinations.

    This may be useful, for example, when testing an expensive function.

        >>> list(partial_product('AB', 'C', 'DEF'))
        [('A', 'C', 'D'), ('B', 'C', 'D'), ('B', 'C', 'E'), ('B', 'C', 'F')]
    N)r�r-r�r�r�rrd)r1�	iteratorsr�prodrs     r�r|r|�s������S��y�)�*�I��#,�-�R��R��-��-���+���9�%����2��	�D��G���+��	���.������s7�B�A2�A-�A2�8B�-A2�2	A>�;B�=A>�>Bc#�6K�|D]}|��||�r�yy�w)z�A variant of :func:`takewhile` that yields one additional element.

        >>> list(takewhile_inclusive(lambda x: x < 5, [1, 4, 6, 4, 1]))
        [1, 4, 6]

    :func:`takewhile` would return ``[1, 4]``.
    Nr�)r�r�rIs   r�r�r��s&�����������|���s��c	�|����t|�}tt���fd�t||��t	|���S)a�A generalized outer product that applies a binary function to all
    pairs of items. Returns a 2D matrix with ``len(xs)`` rows and ``len(ys)``
    columns.
    Also accepts ``*args`` and ``**kwargs`` that are passed to ``func``.

    Multiplication table:

    >>> list(outer_product(mul, range(1, 4), range(1, 6)))
    [(1, 2, 3, 4, 5), (2, 4, 6, 8, 10), (3, 6, 9, 12, 15)]

    Cross tabulation:

    >>> xs = ['A', 'B', 'A', 'A', 'B', 'B', 'A', 'A', 'B', 'B']
    >>> ys = ['X', 'X', 'X', 'Y', 'Z', 'Z', 'Y', 'Y', 'Z', 'Z']
    >>> rows = list(zip(xs, ys))
    >>> count_rows = lambda x, y: rows.count((x, y))
    >>> list(outer_product(count_rows, sorted(set(xs)), sorted(set(ys))))
    [(2, 3, 0), (1, 0, 4)]

    Usage with ``*args`` and ``**kwargs``:

    >>> animals = ['cat', 'wolf', 'mouse']
    >>> list(outer_product(min, animals, animals, key=len))
    [('cat', 'cat', 'cat'), ('cat', 'wolf', 'wolf'), ('cat', 'wolf', 'mouse')]
    c����||g���i���Sr�r�)rIr�r�r�r�s  ���r�rzouter_product.<locals>.<lambda>	s���T�!�Q�8��8��8�r�)r�)rr<rrr�)r��xs�ysr�r�s`  ``r�rzrz�s3���4
�r��B���8�'�"�b�/�J�

�b�'��r�c'�<K�	|Ed{���y7�#|$rYywxYw�w)a.Yield each of the items from *iterable*. If the iteration raises one of
    the specified *exceptions*, that exception will be suppressed and iteration
    will stop.

    >>> from itertools import chain
    >>> def breaks_at_five(x):
    ...     while True:
    ...         if x >= 5:
    ...             raise RuntimeError
    ...         yield x
    ...         x += 1
    >>> it_1 = iter_suppress(breaks_at_five(1), RuntimeError)
    >>> it_2 = iter_suppress(breaks_at_five(2), RuntimeError)
    >>> list(chain(it_1, it_2))
    [1, 2, 3, 4, 2, 3, 4]
    Nr�)r�r�s  r�rhrhs%����"���������s(����������c#�8K�|D]}||�}|��|���y�w)z�Apply *func* to every element of *iterable*, yielding only those which
    are not ``None``.

    >>> elems = ['1', 'a', '2', 'b', '3']
    >>> list(filter_map(lambda s: int(s) if s.isnumeric() else None, elems))
    [1, 2, 3]
    Nr�)r�r�rIr�s    r�rZrZ%s*���������G���=��G��s��)Fr�r�)r1rr)NNN)r�F)r�)NNF)r))r�rr1FN)r�NF)NFF)�r��collectionsrrrr�collections.abcr�	functoolsrr	r
r�heapqrr
r�	itertoolsrrrrrrrrrrrrr�mathrrrrr r!�queuer"r#r$r%r&�operatorr'r(r)r*r+r,r-�sysr.r/�timer0�recipesr2r3r4r5r6r7r8r9r:r;r<�__all__rEr[rirsr~rMr`rgr�rxr�r�rRrdr�r�r�r�rCr�rarcrbrHr�r�r�r�r�r�r�r{r�r�rSr�r�r�r�r�rTrsrtrAr?r]�HashablerwrNrqr�rjrkrlr�r�rfrrBrKrPr>r�r�rXrGrmrpr�r�r}r�r�ryrpr^r_rQrYrnror�r�r�re�
BaseExceptionr=rDr�r@rurtrvr�r�rIrJrrOrFr�r�r�r�rUrVrWrrr�rLr\r|r�rzrhrZr�r�r��<module>r<s����8�8�$�=�=�/�/�����8�7��-�-�9�9�9�#������j��Z �F$��6#��:&-�:�"b"�b"�J�@�"
� �@�F�J�Zb$�JD�4C�B2�j!�4�D]'�]'�@((�V0�
.� ?+�D-!�`:�z�D)�X �F#�L*�Z*)�Z�@A��& M�F�8"�>-2�T�$�N?�D.K�b0�f%(��<�2�j$)�N*�ZV,�C�L�L�#�,�,�V,�r
=� "�J�D�-0�`A�%�$�40�"+P�+P�\]&�@(�$+6�-$�`"�')�d�')�T*L�8�*L�ZP)�P)�fF�F�:&*�>�$:�?�D@�F �T�(?�V:�zB�(5/�p/�/�d&�R��*!�HL�(%�P�0�*,7�<�,�2 5�F!6�H3�6	�-�	�|�|�~%%�P �F#�>+(�\+�\�8�2(&�V6�r�0��@?�,<�>�:+.�u��e�5�p$�N�<D�'>�T,0��D�P#'��D�/�d'�T�2��B�.r�

Zerion Mini Shell 1.0