0x1949 Team - FAZEMRX - MANAGER
Edit File: recipes.cpython-310.pyc
o �B;aA � @ s� d Z ddlZddlmZ ddlmZmZmZmZm Z m Z m Z m Z m Z mZ ddlZddlmZmZmZ g d�Zdd� ZdDd d �Zd d � ZdEd d�ZdEdd�Zdd� Zefdd�Z dd� Z e Z dd� Z dd� Z dd � Z!dEd d �Z"d d � Z#zdd!lm$Z% W n e&y� e#Z$Y n w d"d#� Z$e#j e$_ dEd$d%�Z'd&d'� Z(d(d)� Z)d*d+� Z*dEd,d-�Z+dEd.d/�Z,dEd0d1�Z-dFd2d3�Z.d4d5�d6d7�Z/dEd8d9�Z0d:d;� Z1d<d=� Z2d>d?� Z3d@dA� Z4dBdC� Z5dS )Ga 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) �chain� combinations�count�cycle�groupby�islice�repeat�starmap�tee� zip_longest)� randrange�sample�choice) � all_equal�consume�convolve� dotproduct� first_true�flatten�grouper� iter_except�ncycles�nth�nth_combination�padnone�pad_none�pairwise� partition�powerset�prepend�quantify�#random_combination_with_replacement�random_combination�random_permutation�random_product� repeatfunc� roundrobin�tabulate�tail�take�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� r2 �8/usr/lib/python3/dist-packages/more_itertools/recipes.pyr* < s r* 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�startr2 r2 r3 r( L s r( c C s t t|| d��S )z�Return an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] ��maxlen)�iterr r/ r2 r2 r3 r) ^ s r) 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 r7 )r �nextr )�iteratorr0 r2 r2 r3 r i 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)r: r )r1 r0 �defaultr2 r2 r3 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 r: )r1 �gr2 r2 r3 r � s r c C r- )zcReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )�sumr4 )r1 �predr2 r2 r3 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 �r1 r2 r2 r3 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)r1 r0 r2 r2 r3 r � s r c C s t ttj| |��S )zcReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )r> r4 �operator�mul)�vec1�vec2r2 r2 r3 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 rA )� listOfListsr2 r2 r3 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�argsr2 r2 r3 r& � s r& 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 r: �zip)r1 �a�br2 r2 r3 � _pairwise s � rN )r c c s � t | �E d H d S �N)�itertools_pairwiser@ r2 r2 r3 r s �r c C s< t | t�rt�dt� | |}} t| �g| }t|d|i�S )z�Collect data into fixed-length chunks or blocks. >>> list(grouper('ABCDEFG', 3, 'x')) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G', 'x', 'x')] z+grouper expects iterable as first parameter� fillvalue)� isinstance�int�warnings�warn�DeprecationWarningr9 r )r1 r0 rQ rJ r2 r2 r3 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 rO )r9 �__next__)�.0�itr2 r2 r3 � <genexpr>9 � � z roundrobin.<locals>.<genexpr>� N)�lenr � StopIterationr )� iterables�pending�nextsr: r2 r2 r3 r' , s � � � �r' 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 rO r2 )rX �x�r? r2 r3 rZ Z � � z partition.<locals>.<genexpr>c s s � | ] \}}|s|V qd S rO r2 �rX �condrb r2 r2 r3 rZ ] rd c s s � | ] \}}|r|V qd S rO r2 re r2 r2 r3 rZ ^ rd )�boolr )r? r1 � evaluations�t1�t2r2 rc r3 r C 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 rO )r )rX �r��sr2 r3 rZ v r[ zpowerset.<locals>.<genexpr>r\ )r. r rA �ranger] r@ r2 rl r3 r b 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�append� TypeError) r1 �key�seenset� seenset_add�seenlist� seenlist_add�use_key�element�kr2 r2 r3 r+ y 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'] r\ )r4 r: rC � itemgetterr )r1 rs r2 r2 r3 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))) [] Nr2 )rH � exception�firstr2 r2 r3 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' )r: �filter)r1 r< r? r2 r2 r3 r � s r r\ )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 r2 �rB �rX �poolr2 r2 r3 � <listcomp>� s z"random_product.<locals>.<listcomp>c s s � | ]}t |�V qd S rO )r r� r2 r2 r3 rZ � � � z!random_product.<locals>.<genexpr>r )r rJ �poolsr2 r2 r3 r% � s r% 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)rB r] r )r1 rk r� r2 r2 r3 r$ � 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 rO r2 �rX �i�r� r2 r3 rZ r� z%random_combination.<locals>.<genexpr>)rB r] �sortedr rn )r1 rk r0 �indicesr2 r� r3 r# 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 rO )r r� )r0 r2 r3 rZ ( r� z6random_combination_with_replacement.<locals>.<genexpr>c 3 r� rO r2 r� r� r2 r3 rZ ) r� )rB r] r� rn )r1 rk r� r2 )r0 r� r3 r" 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 r\ ���)rB r] � ValueError�minrn � IndexErrorrq ) r1 rk �indexr� r0 �crz r� �resultr2 r2 r3 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 )�valuer; r2 r2 r3 r V 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 r7 r\ ) rB r] r r r rq r> r4 rC rD )�signal�kernelr0 �windowrb r2 r2 r3 r e s � �r )r rO )NN)6�__doc__rT � collectionsr � itertoolsr r r r r r r r r r rC �randomr r r �__all__r* r( r) r r r rg r! r r r r r r& rN r rP � ImportErrorr r' r r r+ r, r r r% r$ r# r" r r r r2 r2 r2 r3 �<module> sV 0 ! ( � - *