golden hour
/opt/saltstack/salt/lib/python3.10/site-packages/pkg_resources/_vendor/more_itertools/__pycache__
⬆️ Go Up
Upload
File/Folder
Size
Actions
__init__.cpython-310.pyc
331 B
Del
OK
more.cpython-310.pyc
122.63 KB
Del
OK
recipes.cpython-310.pyc
26.15 KB
Del
OK
Edit: recipes.cpython-310.pyc
o �xeHc � @ s^ d Z ddlZddlZddlZddlmZ ddlmZ ddlm Z ddl m Z m Z m Z mZmZmZmZmZmZmZmZmZ ddlmZmZmZ ddlm Z g d �Z e � Z d d � Z ddd d �Z!dd� Z"dedd�Z#dedd�Z$dd� Z%e&fdd�Z'dd� Z(e(Z)dd� Z*d d � Z+d d � Z,ded d!�Z-d"d#� Z.zdd$l m/Z0 W n e1y� e.Z/Y n w d%d&� Z/e.j e/_ G d'd(� d(e2�Z3d)d*� Z4d+d,� Z5dfd.d/�Z6d0d1� Z7d2d3� Z8d4d5� Z9ded6d7�Z:ded8d9�Z;ded:d;�Z<dgd<d=�Z=d>d?�d@dA�Z>dedBdC�Z?dDdE� Z@dFdG� ZAdHdI� ZBdJdK� ZCdLdM� ZDdNdO� ZEdPdQ� ZFdRdS� ZGdTdU� ZHdVdW� ZIdddXdY�ZJdZd[� ZKd\d]� ZLd^d_� ZMd`da� ZNdbdc� ZOdS )ha Imported from the recipes section of the itertools documentation. All functions taken from the recipes section of the itertools library docs [1]_. Some backward-compatible usability improvements have been made. .. [1] http://docs.python.org/library/itertools.html#recipes � N)�deque)�Sized)�reduce) �chain� combinations�compress�count�cycle�groupby�islice�product�repeat�starmap�tee� zip_longest)� randrange�sample�choice)� hexversion)(� all_equal�batched�before_and_after�consume�convolve� dotproduct� first_true�factor�flatten�grouper� iter_except� iter_index�matmul�ncycles�nth�nth_combination�padnone�pad_none�pairwise� partition�polynomial_from_roots�powerset�prepend�quantify�#random_combination_with_replacement�random_combination�random_permutation�random_product� repeatfunc� roundrobin�sieve�sliding_window� subslices�tabulate�tail�take� transpose� triplewise�unique_everseen�unique_justseenc C � t t|| ��S )z�Return first *n* items of the iterable as a list. >>> take(3, range(10)) [0, 1, 2] If there are fewer than *n* items in the iterable, all of them are returned. >>> take(10, range(3)) [0, 1, 2] )�listr ��n�iterable� rB �`/opt/saltstack/salt/lib/python3.10/site-packages/pkg_resources/_vendor/more_itertools/recipes.pyr8 P s r8 c C s t | t|��S )a� Return an iterator over the results of ``func(start)``, ``func(start + 1)``, ``func(start + 2)``... *func* should be a function that accepts one integer argument. If *start* is not specified it defaults to 0. It will be incremented each time the iterator is advanced. >>> square = lambda x: x ** 2 >>> iterator = tabulate(square, -3) >>> take(4, iterator) [9, 4, 1, 0] )�mapr )�function�startrB rB rC r6 ` s r6 c c sJ � t |t�rt|tdt|�| �d�E dH dS tt|| d��E dH dS )z�Return an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] r N��maxlen)� isinstancer r �max�len�iterr r? rB rB rC r7 r s � $r7 c C s. |du r t | dd� dS tt| ||�d� dS )aX Advance *iterable* by *n* steps. If *n* is ``None``, consume it entirely. Efficiently exhausts an iterator without returning values. Defaults to consuming the whole iterator, but an optional second argument may be provided to limit consumption. >>> i = (x for x in range(10)) >>> next(i) 0 >>> consume(i, 3) >>> next(i) 4 >>> consume(i) >>> next(i) Traceback (most recent call last): File "<stdin>", line 1, in <module> StopIteration If the iterator has fewer items remaining than the provided limit, the whole iterator will be consumed. >>> i = (x for x in range(3)) >>> consume(i, 5) >>> next(i) Traceback (most recent call last): File "<stdin>", line 1, in <module> StopIteration Nr rG )r �nextr )�iteratorr@ rB rB rC r � s r c C s t t| |d�|�S )z�Returns the nth item or a default value. >>> l = range(10) >>> nth(l, 3) 3 >>> nth(l, 20, "zebra") 'zebra' N)rM r )rA r@ �defaultrB rB rC r# � s r# c C s t | �}t|d�ot|d� S )z� Returns ``True`` if all the elements are equal to each other. >>> all_equal('aaaa') True >>> all_equal('aaab') False TF)r rM )rA �grB rB rC r � s r c C r= )zcReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )�sumrD )rA �predrB rB rC r, � s r, c C s t | td��S )a Returns the sequence of elements and then returns ``None`` indefinitely. >>> take(5, pad_none(range(3))) [0, 1, 2, None, None] Useful for emulating the behavior of the built-in :func:`map` function. See also :func:`padded`. N)r r �rA rB rB rC r& � s r& c C s t �tt| �|��S )zvReturns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r � from_iterabler �tuple)rA r@ rB rB rC r" � s r" c C s t ttj| |��S )zcReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )rQ rD �operator�mul)Zvec1Zvec2rB rB rC r � s r c C s t �| �S )z�Return an iterator flattening one level of nesting in a list of lists. >>> list(flatten([[0, 1], [2, 3]])) [0, 1, 2, 3] See also :func:`collapse`, which can flatten multiple levels of nesting. )r rT )Z listOfListsrB rB rC r � s r c G s& |du r t | t|��S t | t||��S )aG Call *func* with *args* repeatedly, returning an iterable over the results. If *times* is specified, the iterable will terminate after that many repetitions: >>> from operator import add >>> times = 4 >>> args = 3, 5 >>> list(repeatfunc(add, times, *args)) [8, 8, 8, 8] If *times* is ``None`` the iterable will not terminate: >>> from random import randrange >>> times = None >>> args = 1, 11 >>> take(6, repeatfunc(randrange, times, *args)) # doctest:+SKIP [2, 4, 8, 1, 8, 4] N)r r )�func�times�argsrB rB rC r1 s r1 c c s, � t | �\}}t|d� t||�E dH dS )z�Returns an iterator of paired items, overlapping, from the original >>> take(4, pairwise(count())) [(0, 1), (1, 2), (2, 3), (3, 4)] On Python 3.10 and above, this is an alias for :func:`itertools.pairwise`. N)r rM �zip)rA �a�brB rB rC � _pairwise s � r^ �r' c c s � t | �E d H d S �N)�itertools_pairwiserS rB rB rC r' 1 s �r' c s e Zd Zd� fdd� Z� ZS )�UnequalIterablesErrorNc s* d}|d ur |dj |� 7 }t� �|� d S )Nz Iterables have different lengthsz/: index 0 has length {}; index {} has length {})�format�super�__init__)�self�details�msg�� __class__rB rC re 8 s �z UnequalIterablesError.__init__r` )�__name__� __module__� __qualname__re � __classcell__rB rB ri rC rb 7 s rb c c s8 � t | dti�D ]}|D ] }|tu rt� �q |V qd S )N� fillvalue)r �_markerrb )� iterablesZcombo�valrB rB rC �_zip_equal_generatorB s ���rs c G sr z+t | d �}t| dd � d�D ]\}}t |�}||kr nqt| � W S t|||fd�� ty8 t| � Y S w )Nr � )rg )rK � enumerater[ rb � TypeErrorrs )rq Z first_size�i�it�sizerB rB rC � _zip_equalJ s � �rz �fillc C sL t | �g| }|dkrt|d|i�S |dkrt|� S |dkr"t|� S td��)a� Group elements from *iterable* into fixed-length groups of length *n*. >>> list(grouper('ABCDEF', 3)) [('A', 'B', 'C'), ('D', 'E', 'F')] The keyword arguments *incomplete* and *fillvalue* control what happens for iterables whose length is not a multiple of *n*. When *incomplete* is `'fill'`, the last group will contain instances of *fillvalue*. >>> list(grouper('ABCDEFG', 3, incomplete='fill', fillvalue='x')) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G', 'x', 'x')] When *incomplete* is `'ignore'`, the last group will not be emitted. >>> list(grouper('ABCDEFG', 3, incomplete='ignore', fillvalue='x')) [('A', 'B', 'C'), ('D', 'E', 'F')] When *incomplete* is `'strict'`, a subclass of `ValueError` will be raised. >>> it = grouper('ABCDEFG', 3, incomplete='strict') >>> list(it) # doctest: +IGNORE_EXCEPTION_DETAIL Traceback (most recent call last): ... UnequalIterablesError r{ ro �strict�ignorez Expected fill, strict, or ignore)rL r rz r[ � ValueError)rA r@ Z incompletero rZ rB rB rC r ^ s r c g sl � t | �}tdd� | D ��}|r4z |D ]}|� V qW n ty/ |d8 }tt||��}Y nw |sdS dS )aJ Yields an item from each iterable, alternating between them. >>> list(roundrobin('ABC', 'D', 'EF')) ['A', 'D', 'E', 'B', 'F', 'C'] This function produces the same output as :func:`interleave_longest`, but may perform better for some inputs (in particular when the number of iterables is small). c s s � | ]}t |�jV qd S r` )rL �__next__)�.0rx rB rB rC � <genexpr>� � � z roundrobin.<locals>.<genexpr>rt N)rK r � StopIterationr )rq �pendingZnextsrM rB rB rC r2 � s � � � �r2 c sF � du rt � � fdd�|D �}t|�\}}dd� |D �dd� |D �fS )a� Returns a 2-tuple of iterables derived from the input iterable. The first yields the items that have ``pred(item) == False``. The second yields the items that have ``pred(item) == True``. >>> is_odd = lambda x: x % 2 != 0 >>> iterable = range(10) >>> even_items, odd_items = partition(is_odd, iterable) >>> list(even_items), list(odd_items) ([0, 2, 4, 6, 8], [1, 3, 5, 7, 9]) If *pred* is None, :func:`bool` is used. >>> iterable = [0, 1, False, True, '', ' '] >>> false_items, true_items = partition(None, iterable) >>> list(false_items), list(true_items) ([0, False, ''], [1, True, ' ']) Nc 3 s � | ] }� |�|fV qd S r` rB )r� �x�rR rB rC r� � � � z partition.<locals>.<genexpr>c s s � | ] \}}|s|V qd S r` rB �r� Zcondr� rB rB rC r� � r� c s s � | ] \}}|r|V qd S r` rB r� rB rB rC r� � r� )�boolr )rR rA Z evaluations�t1�t2rB r� rC r( � s �r( c s, t | �� t�� fdd�tt� �d �D ��S )a� Yields all possible subsets of the iterable. >>> list(powerset([1, 2, 3])) [(), (1,), (2,), (3,), (1, 2), (1, 3), (2, 3), (1, 2, 3)] :func:`powerset` will operate on iterables that aren't :class:`set` instances, so repeated elements in the input will produce repeated elements in the output. Use :func:`unique_everseen` on the input to avoid generating duplicates: >>> seq = [1, 1, 0] >>> list(powerset(seq)) [(), (1,), (1,), (0,), (1, 1), (1, 0), (1, 0), (1, 1, 0)] >>> from more_itertools import unique_everseen >>> list(powerset(unique_everseen(seq))) [(), (1,), (0,), (1, 0)] c 3 s � | ]}t � |�V qd S r` )r )r� �r��srB rC r� � r� zpowerset.<locals>.<genexpr>rt )r> r rT �rangerK rS rB r� rC r* � s $r* c c s� � t � }|j}g }|j}|du}| D ]+}|r||�n|}z ||vr(||� |V W q ty= ||vr;||� |V Y qw dS )a� Yield unique elements, preserving order. >>> list(unique_everseen('AAAABBBCCDAABBB')) ['A', 'B', 'C', 'D'] >>> list(unique_everseen('ABBCcAD', str.lower)) ['A', 'B', 'C', 'D'] Sequences with a mix of hashable and unhashable items can be used. The function will be slower (i.e., `O(n^2)`) for unhashable items. Remember that ``list`` objects are unhashable - you can use the *key* parameter to transform the list to a tuple (which is hashable) to avoid a slowdown. >>> iterable = ([1, 2], [2, 3], [1, 2]) >>> list(unique_everseen(iterable)) # Slow [[1, 2], [2, 3]] >>> list(unique_everseen(iterable, key=tuple)) # Faster [[1, 2], [2, 3]] Similary, you may want to convert unhashable ``set`` objects with ``key=frozenset``. For ``dict`` objects, ``key=lambda x: frozenset(x.items())`` can be used. N)�set�add�appendrv ) rA �keyZseensetZ seenset_addZseenlistZ seenlist_addZuse_key�element�krB rB rC r; � s( �� ���r; c C s t tt t�d�t| |���S )z�Yields elements in order, ignoring serial duplicates >>> list(unique_justseen('AAAABBBCCDAABBB')) ['A', 'B', 'C', 'D', 'A', 'B'] >>> list(unique_justseen('ABBCcAD', str.lower)) ['A', 'B', 'C', 'A', 'D'] rt )rD rM rV � itemgetterr )rA r� rB rB rC r< s r< c c s4 � z|dur |� V | � V q |y Y dS w )a� Yields results from a function repeatedly until an exception is raised. Converts a call-until-exception interface to an iterator interface. Like ``iter(func, sentinel)``, but uses an exception instead of a sentinel to end the loop. >>> l = [0, 1, 2] >>> list(iter_except(l.pop, IndexError)) [2, 1, 0] Multiple exceptions can be specified as a stopping condition: >>> l = [1, 2, 3, '...', 4, 5, 6] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [7, 6, 5] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [4, 3, 2] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [] NrB )rX � exception�firstrB rB rC r s �� �r c C s t t|| �|�S )a� Returns the first true value in the iterable. If no true value is found, returns *default* If *pred* is not None, returns the first item for which ``pred(item) == True`` . >>> first_true(range(10)) 1 >>> first_true(range(10), pred=lambda x: x > 5) 6 >>> first_true(range(10), default='missing', pred=lambda x: x > 9) 'missing' )rM �filter)rA rO rR rB rB rC r + s r rt )r c G s$ dd� |D �| }t dd� |D ��S )a� Draw an item at random from each of the input iterables. >>> random_product('abc', range(4), 'XYZ') # doctest:+SKIP ('c', 3, 'Z') If *repeat* is provided as a keyword argument, that many items will be drawn from each iterable. >>> random_product('abcd', range(4), repeat=2) # doctest:+SKIP ('a', 2, 'd', 3) This equivalent to taking a random selection from ``itertools.product(*args, **kwarg)``. c S s g | ]}t |��qS rB �rU �r� �poolrB rB rC � <listcomp>O s z"random_product.<locals>.<listcomp>c s s � | ]}t |�V qd S r` )r r� rB rB rC r� P � � z!random_product.<locals>.<genexpr>r� )r rZ ZpoolsrB rB rC r0 ? s r0 c C s* t | �}|du r t|�n|}t t||��S )ab Return a random *r* length permutation of the elements in *iterable*. If *r* is not specified or is ``None``, then *r* defaults to the length of *iterable*. >>> random_permutation(range(5)) # doctest:+SKIP (3, 4, 0, 1, 2) This equivalent to taking a random selection from ``itertools.permutations(iterable, r)``. N)rU rK r )rA r� r� rB rB rC r/ S s r/ c s8 t | �� t� �}ttt|�|��}t � fdd�|D ��S )z�Return a random *r* length subsequence of the elements in *iterable*. >>> random_combination(range(5), 3) # doctest:+SKIP (2, 3, 4) This equivalent to taking a random selection from ``itertools.combinations(iterable, r)``. c 3 � � | ]}� | V qd S r` rB �r� rw �r� rB rC r� r r� z%random_combination.<locals>.<genexpr>)rU rK �sortedr r� )rA r� r@ �indicesrB r� rC r. e s r. c s@ t | ��t��� t� fdd�t|�D ��}t �fdd�|D ��S )aS Return a random *r* length subsequence of elements in *iterable*, allowing individual elements to be repeated. >>> random_combination_with_replacement(range(3), 5) # doctest:+SKIP (0, 0, 1, 2, 2) This equivalent to taking a random selection from ``itertools.combinations_with_replacement(iterable, r)``. c 3 s � | ]}t � �V qd S r` )r r� )r@ rB rC r� � r� z6random_combination_with_replacement.<locals>.<genexpr>c 3 r� r` rB r� r� rB rC r� � r� )rU rK r� r� )rA r� r� rB )r@ r� rC r- u s r- c C s� t | �}t|�}|dk s||krt�d}t||| �}td|d �D ] }||| | | }q"|dk r7||7 }|dk s?||krAt�g }|ry|| | |d |d }}}||krn||8 }||| | |d }}||ksY|�|d| � |sEt |�S )a Equivalent to ``list(combinations(iterable, r))[index]``. The subsequences of *iterable* that are of length *r* can be ordered lexicographically. :func:`nth_combination` computes the subsequence at sort position *index* directly, without computing the previous subsequences. >>> nth_combination(range(5), 3, 5) (0, 3, 4) ``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. r rt ���)rU rK r~ �minr� � IndexErrorr� ) rA r� �indexr� r@ �cr� rw �resultrB rB rC r$ � s, ��r$ c C s t | g|�S )a Yield *value*, followed by the elements in *iterator*. >>> value = '0' >>> iterator = ['1', '2', '3'] >>> list(prepend(value, iterator)) ['0', '1', '2', '3'] To prepend multiple values, see :func:`itertools.chain` or :func:`value_chain`. )r )�valuerN rB rB rC r+ � s r+ c c sj � t |�ddd� }t|�}tdg|d�| }t| td|d ��D ]}|�|� tttj ||��V q!dS )aB Convolve the iterable *signal* with the iterable *kernel*. >>> signal = (1, 2, 3, 4, 5) >>> kernel = [3, 2, 1] >>> list(convolve(signal, kernel)) [3, 8, 14, 20, 26, 14, 5] Note: the input arguments are not interchangeable, as the *kernel* is immediately consumed and stored. Nr� r rG rt ) rU rK r r r r� rQ rD rV rW )�signalZkernelr@ �windowr� rB rB rC r � s � �r c s0 t � �� g �� ��fdd�}t�� �}|� |fS )a� A variant of :func:`takewhile` that allows complete access to the remainder of the iterator. >>> it = iter('ABCdEfGhI') >>> all_upper, remainder = before_and_after(str.isupper, it) >>> ''.join(all_upper) 'ABC' >>> ''.join(remainder) # takewhile() would lose the 'd' 'dEfGhI' Note that the first iterator must be fully consumed before the second iterator can generate valid results. c 3 s. � � D ]} �| �r | V q�� | � d S d S r` )r� )�elem�rx � predicateZ transitionrB rC � true_iterator� s � �z'before_and_after.<locals>.true_iterator)rL r )r� rx r� Zremainder_iteratorrB r� rC r � s r c c s0 � t t | ��D ]\\}}\}}|||fV qdS )z�Return overlapping triplets from *iterable*. >>> list(triplewise('ABCDE')) [('A', 'B', 'C'), ('B', 'C', 'D'), ('C', 'D', 'E')] Nr_ )rA r\ �_r] r� rB rB rC r: � s � �r: c c sT � t | �}tt||�|d�}t|�|krt|�V |D ] }|�|� t|�V qdS )aY Return a sliding window of width *n* over *iterable*. >>> list(sliding_window(range(6), 4)) [(0, 1, 2, 3), (1, 2, 3, 4), (2, 3, 4, 5)] If *iterable* has fewer than *n* items, then nothing is yielded: >>> list(sliding_window(range(3), 4)) [] For a variant with more features, see :func:`windowed`. rG N)rL r r rK rU r� )rA r@ rx r� r� rB rB rC r4 � s � �r4 c C s6 t | �}ttttt|�d �d��}ttjt |�|�S )z�Return all contiguous non-empty subslices of *iterable*. >>> list(subslices('ABC')) [['A'], ['A', 'B'], ['A', 'B', 'C'], ['B'], ['B', 'C'], ['C']] This is similar to :func:`substrings`, but emits items in a different order. rt � ) r> r �slicer r� rK rD rV �getitemr )rA �seqZslicesrB rB rC r5 s r5 c s@ t tddd� �� tttj����� �fdd�tt��d �D �S )z�Compute a polynomial's coefficients from its roots. >>> roots = [5, -4, 3] # (x - 5) * (x + 4) * (x - 3) >>> polynomial_from_roots(roots) # x^3 - 4 * x^2 - 17 * x + 60 [1, -4, -17, 60] �prodc S s t tj| d�S )Nrt )r rV rW �r� rB rB rC �<lambda>+ � z'polynomial_from_roots.<locals>.<lambda>c s g | ] }t t� t�|����qS rB )rQ rD r )r� r� �r� �rootsrB rC r� - s �z)polynomial_from_roots.<locals>.<listcomp>rt )�getattr�mathr> rD rV �negr� rK )r� rB r� rC r) # s �r) c c s� � z| j }W n% ty+ t| |d�}t||�D ]\}}||u s$||kr'|V qY dS w |d }z |||d �}|V q2 tyF Y dS w )a Yield the index of each place in *iterable* that *value* occurs, beginning with index *start*. See :func:`locate` for a more general means of finding the indexes associated with particular values. >>> list(iter_index('AABCADEAF', 'A')) [0, 1, 4, 7] Nrt )r� �AttributeErrorr ru r~ )rA r� rF Z seq_indexrx rw r� rB rB rC r 2 s( � ���� �r c C s� t tddd� �}td�| d }d|dd�< || �d }tt|�|�D ]}ttt|| | || ���||| | || �< q#d |d< | dkrJt|d �S tg �S ) zdYield the primes less than n. >>> list(sieve(30)) [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] �isqrtc S � t t�| ��S r` ��intr� �sqrtr� rB rB rC r� U r� zsieve.<locals>.<lambda>)r rt r� )r r r N� rt ) r� r� � bytearrayr r� �bytesrK r rL )r@ r� �data�limit�prB rB rC r3 O s 0r3 c c s> � t dkr t�dt� t| �} tt||��}|sdS |V q)a" Batch data into lists of length *n*. The last batch may be shorter. >>> list(batched('ABCDEFG', 3)) [['A', 'B', 'C'], ['D', 'E', 'F'], ['G']] This recipe is from the ``itertools`` docs. This library also provides :func:`chunked`, which has a different implementation. i� zzbatched will be removed in a future version of more-itertools. Use the standard library itertools.batched function insteadTN)r �warnings�warn�DeprecationWarningrL r> r )rA r@ rx ZbatchrB rB rC r _ s � � �r c C s t | � S )z�Swap the rows and columns of the input. >>> list(transpose([(1, 2, 3), (11, 22, 33)])) [(1, 11), (2, 22), (3, 33)] The caller should ensure that the dimensions of the input are compatible. )r[ )rx rB rB rC r9 z s r9 c C s& t |d �}tttt| t|���|�S )z�Multiply two matrices. >>> list(matmul([(7, 5), (3, 5)], [(2, 5), (7, 9)])) [[49, 80], [41, 60]] The caller should ensure that the dimensions of the input matrices are compatible with each other. r )rK r r r r r9 )Zm1Zm2r@ rB rB rC r! � s r! c c sn � t tddd� �}t|| �d �D ]} t| |�\}}|r n |V |} | dkr* dS qq| dkr5| V dS dS )zSYield the prime factors of n. >>> list(factor(360)) [2, 2, 2, 3, 3, 5] r� c S r� r` r� r� rB rB rC r� � r� zfactor.<locals>.<lambda>rt TNr� )r� r� r3 �divmod)r@ r� ZprimeZquotient� remainderrB rB rC r � s �� �r )r r` )r{ N)NN)P�__doc__r� rV r� � collectionsr �collections.abcr � functoolsr � itertoolsr r r r r r r r r r r r �randomr r r �sysr �__all__�objectrp r8 r6 r7 r r# r r� r, r& r% r" r r r1 r^ r' ra � ImportErrorr~ rb rs rz r r2 r( r* r; r< r r r0 r/ r. r- r$ r+ r r r: r4 r5 r) r r3 r r9 r! r rB rB rB rC �<module> s| 8 + ( � ( - *!
Save