File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/setuptools/_vendor/more_itertools/__pycache__/more.cpython-310.pyc
Back
o ;jj � @ sD d dl Z d dlZd dlmZmZmZmZ d dlmZ d dl m Z d dl m Z m Z mZmZ d dlmZmZ d dlmZmZmZmZmZmZmZmZm Z m Z m Z m Z m Z m!Z!m"Z" d dl m#Z#m$Z$m%Z%m&Z&m'Z'm(Z(m)Z)m*Z*m+Z+m,Z, d d l m-Z- d d l.m/Z/m0Z0 d d l1m1Z1m2Z2m3Z3m4Z4 d d l5m6Z6m7Z7m8Z8m9Z9m:Z:m;Z;m<Z<m=Z= d d l>m?Z?m@Z@ d dlAmBZB ddlCmDZDmEZEmFZFmGZGmHZHmIZImJZJmKZKmLZLmMZMmNZNmOZOmPZPmQZQ g d�ZRzd dl mSZT W n eUy� deVfdd�ZWdd� ZXdd� ZTY nw �ddd �ZYeDfd d �ZZeDfd d �Z[eDfd!d"�Z\G d#d$� d$�Z]d%d&� Z^d'd(� Z_d)d*� Z`d+d,� Za�d d-d.�Zbd/d0� Zc�d d1d2�Zd�d d3d4�Ze�d d5d6�Zf�d d7d8�Zgd9d:� Zh�d d;d<�Zid=d>� Zj�dd?d@�ZkG dAdB� dB�Zl�d dCdD�ZmdEdF� ZndGdH� Zo�d dIdJ�ZpdKdL� Zq�d dMdN�Zr�d dOdP�Zs�ddQdR�Zt�d!dTdU�Zu�d"dVdW�Zv�d"dXdY�Zw�d"dZd[�Zxd\d]� Zy�d#d^d_�Zz�d$dadb�Z{�d dcdd�Z|dedf� Z}�d%dhdi�Z~djdk� Zdddl�dmdn�Z� �d&dpdq�Z�drds� Z�dtdu� Z�e�e�ffdvdw�Z��d dxdy�Z��d dzd{�Z�G d|d}� d}ejej��Z��d d~d�Z�d�d�� Z�e�dfd�d��Z�d�d�� Z�d�d�� Z�d�d�� Z�d�d�� Z�G d�d�� d��Z�d�d�� Z�d�d�� Z��d d�d��Z�e<fdd��d�d��Z�G d�d�� d�e�Z�G d�d�� d��Z�G d�d�� d��Z�e�fd�d��Z��d d�d��Z�dod�d��Z��d d�d��Z�e�dfd�d��Z��d d�d��Z�d�d�� Z��d d�d��Z�G d�d�� d��Z��d d�d��Z�d�d�� Z�d�d�� Z�d�d�� Z�d�d�� Z�d�d�� Z�d�d�� Z��d d�d��Z�d�d�� Z�d�d Z�d�dĄ Z��d dddŜd�dDŽZ��d'd�dɄZ�G d�d˄ d�e��Z�G d�d̈́ d̓Z�d�dτ Z��d d�dфZ�d�dӄ Z�d�dՄ Z�d�dׄ Z�d�dل Z�d�dۄ Z�d�d݄ Z�d�d߄ Z�d�d� Z�G d�d� d�Z�d�d� Z�e�e�fdd�d�d�Z��d d�d�Z��d d�d�Zd d�d�ZÐd d�d�Z�deDd�d�d�Z�de�d�fd�d��Z�d�d�� Z�d�d�� Z�d�d�� Z�d�d�� Z�d��d � Z̐d�d� Z͐d�d� Zΐd�d� Zϐd�d� ZАd �d � Zѐd �d � ZҐd �d� ZӐd�d� Z�d�d��d�d�Z�d�d��d�d�Z�d�d��d�d�Zאd�d� Z�dS (( � N)�Counter� defaultdict�deque�abc)�Sequence)�suppress)�cached_property�partial�reduce�wraps)�heapify� heapreplace)�chain� combinations�compress�count�cycle� dropwhile�groupby�islice� permutations�repeat�starmap� takewhile�tee� zip_longest�product) �comb�e�exp� factorial�floor�fsum�log�log1p�perm�tau)�ceil)�Empty�Queue)�random� randrange�shuffle�uniform)� attrgetter�is_not� itemgetter�lt�mul�neg�sub�gt)� hexversion�maxsize)� monotonic� )�_marker� _zip_equal�UnequalIterablesError�consume� first_true�flatten�is_prime�nth�powerset�sieve�take�unique_everseen� all_equal�batched)t� AbortThread� SequenceViewr< �adjacent� all_unique�always_iterable�always_reversible�argmax�argmin�bucket� callback_iter�chunked� chunked_even�circular_shifts�collapse�combination_index�"combination_with_replacement_index�consecutive_groups�constrained_batches�consumer� count_cycle� countable� derangements�dft� difference�distinct_combinations�distinct_permutations� distribute�divide� doublestarmap�duplicates_everseen�duplicates_justseen�classify_unique� exactly_n�extract� filter_except� filter_map�first� gray_product�groupby_transform�ichunked�iequals�idft�ilen� interleave�interleave_evenly�interleave_longest�interleave_randomly� intersperse� is_sorted�islice_extended�iterate� iter_suppress� join_mappings�last�locate�longest_common_prefix�lstrip�make_decorator� map_except�map_if� map_reduce� mark_ends�minmax� nth_or_last�nth_permutation� nth_prime� nth_product� nth_combination_with_replacement� numeric_range�one�only� outer_product�padded�partial_product� partitions�peekable�permutation_index�powerset_of_sets� 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_offset)�sumprod�xc C s$ | d }||| }| | }||fS )z1Split a float into two half-precision components.g �A� )r� �t�hi�lor� r� �Z/opt/saltstack/salt/lib/python3.10/site-packages/setuptools/_vendor/more_itertools/more.py�dl_split� s r� c C sT t | �\}}t |�\}}|| }|| || }|| }|| | || } || fS )zLossless multiplication.)r� ) r� �yZxx_hiZxx_loZyy_hiZyy_lo�p�q�z�zzr� r� r� �dl_mul� s r� c C s t t�tt| |���S �N)r" r � from_iterable�mapr� )r� r� r� r� r� � _fsumprod� � r� Fc sB t tt�t | ��g �� |r �du rtd��� �fdd�}|� S � S )aJ Break *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. Nz*n must not be None when using strict mode.c 3 �* � � D ]} t | ��krtd��| V qd S )Nz iterable is not divisible by n.��len� ValueError)�chunk��iterator�nr� r� �ret� � � �zchunked.<locals>.ret)�iterr rD r� )�iterabler� �strictr� r� r� r� rR � s rR c C s$ | D ]}| S |t u rtd��|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.)r: r� )r� �default�itemr� r� r� rl � s �rl c C sn z t | t�r | d W S t| dd�rtt| ��W S t| dd�d W S tttfy6 |t u r2t d��| Y S w )a Return 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__Nr9 ��maxlenzJlast() was called on an empty iterable, and no default value was provided.) � isinstancer �getattr�next�reversedr � IndexError� TypeError� StopIterationr: r� )r� r� r� r� r� r} s ��r} c C s t t| |d �|d�S )ag Return 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``. r9 �r� )r} r )r� r� r� r� r� r� r� , s r� c @ sT e Zd ZdZdd� Zdd� Zdd� Zefdd �Zd d � Z d d � Z dd� Z dd� Z dS )r� a Wrap 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 C s t |�| _t� | _d S r� )r� �_itr �_cache��selfr� r� r� r� �__init__x s zpeekable.__init__c C � | S r� r� �r� r� r� r� �__iter__| � zpeekable.__iter__c C �$ z| � � W dS ty Y dS w �NFT��peekr� r� r� r� r� �__bool__ � ��zpeekable.__bool__c C sH | j s z | j �t| j�� W n ty |tu r� | Y S w | j d S )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� r: )r� r� r� r� r� r� � s � z peekable.peekc G s | j �t|�� dS )a Stack 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� �itemsr� r� r� �prepend� s zpeekable.prependc C s | j r| j �� S t| j�S r� )r� �popleftr� r� r� r� r� r� �__next__� s zpeekable.__next__c C s� |j d u rdn|j }|dkr#|jd u rdn|j}|jd u r tn|j}n |dk r?|jd u r.dn|j}|jd u r;t d n|j}ntd��|dk sK|dk rS| j�| j� n tt ||�d t�}t | j�}||krr| j�t | j|| �� t | j�| S )Nr9 r r� zslice step cannot be zero) �step�start�stopr7 r� r� �extendr� �min�maxr� r �list)r� �indexr� r� r r� � cache_lenr� r� r� � _get_slice� s zpeekable._get_slicec C sd t |t�r | �|�S t| j�}|dk r| j�| j� n||kr-| j�t| j|d | �� | j| S �Nr r9 )r� �slicer r� r� r r� r )r� r r r� r� r� � __getitem__� s zpeekable.__getitem__N) �__name__� __module__� __qualname__�__doc__r� r� r� r: r� r� r� r r r� r� r� r� r� = s : r� c s t � �� fdd��}|S )ab Decorator 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 s � | i |��}t |� |S r� �r� )�args�kwargs�gen��funcr� r� �wrapper� s zconsumer.<locals>.wrapper)r )r r r� r r� rZ � s rZ c C s t ttd�t| ���S )a} Return the number of items in *iterable*. For example, there are 168 prime numbers below 1,000: >>> ilen(sieve(1000)) 168 Equivalent to, but faster than:: def ilen(iterable): count = 0 for _ in iterable: count += 1 return count This fully consumes the iterable, so handle with care. r9 )�sumr r �zip�r� r� r� r� rr s rr c c s2 � t t�� |V | |�}q1 sw Y dS )a� Return ``start``, ``func(start)``, ``func(func(start))``, ... Produces an infinite iterator. To add a stopping condition, use :func:`take`, ``takewhile``, or :func:`takewhile_inclusive`:. >>> take(10, iterate(lambda x: 2*x, 1)) [1, 2, 4, 8, 16, 32, 64, 128, 256, 512] >>> collatz = lambda x: 3*x + 1 if x%2==1 else x // 2 >>> list(takewhile_inclusive(lambda x: x!=1, iterate(collatz, 10))) [10, 5, 16, 8, 4, 2, 1] TN)r r� )r r� r� r� r� rz s � ��rz c c s6 � | �}|E dH W d � dS 1 sw Y dS )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� )Zcontext_managerr� r� r� r� r� / s � "�r� c C sJ t | �}|D ]}|D ]}d|�d|�d�}|pt|��| S |p$td��)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 few 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. �/Expected exactly one item in iterable, but got �, �, and perhaps more.z&too few items in iterable (expected 1)�r� r� )r� � too_short�too_longr� rl �second�msgr� r� r� r� > s ,�� r� c G s | |� �r� r� )� exceptionr r� r� r� r� v s r� c c s~ � |du r dd� }|du rdd� }t | �}d}t||�D ] }|V |d7 }q ||k r0||� dS |D ] }||d � dS dS )a� Validate that *iterable* has exactly *n* items and return them if it does. If it has fewer than *n* items, call function *too_short* with the actual number of items. If it has more than *n* items, call function *too_long* with the number ``n + 1``. >>> 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 S � t td| � d��S )Nz Too few items in iterable (got �)�r� r� �� item_countr� r� r� �<lambda>� � �z strictly_n.<locals>.<lambda>c S r" )Nz)Too many items in iterable (got at least r# r$ r% r� r� r� r' � r( r r9 )r� r )r� r� r r �it�sentr� r� r� r� r� z s" �/ �r� c s �fdd�}dd� }t | ��z��� d}W n: tyP d}tt �}�D ] }|��|� �|� q%�fdd��D �}|�� d d � |�� D �� � fd d ��Y nw t���|d u r[�}|�kra|nt||d�}d| k rq�kr�n n|ry|��S �fdd�||�D �S t |r�d�S d�S )aT 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 yielding from ``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. The function :func:`multinomial` computes this directly. 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)] *iterable* need not be sortable, but note that using equal (``x == y``) but non-identical (``id(x) != id(y)``) elements may produce surprising behavior. For example, ``1`` and ``True`` are equal but non-identical: >>> list(distinct_permutations([1, True, '3'])) # doctest: +SKIP [ (1, True, '3'), (1, '3', True), ('3', 1, True) ] >>> list(distinct_permutations([1, 2, '3'])) # doctest: +SKIP [ (1, 2, '3'), (1, '3', 2), (2, 1, '3'), (2, '3', 1), ('3', 1, 2), ('3', 2, 1) ] c 3 s� � t | �V t� d dd�D ]}| | | |d k r nqd S t� d |d�D ] }| | | | k r4 nq(| | | | | |< | |< | d |� d� | |d d �< q)NT� r� r9 )�tuple�range)�A�i�j)�sizer� r� �_full� s � �� �z$distinct_permutations.<locals>._fullc s s4 � | d |� | |d � }}t |d dd�}t t|��} t|�V |d }|D ]}|| |k r2 n|| }q(d S |D ]}|| || krT|| || ||< ||< n q;|D ]}|| || krp|| || ||< ||< nqW||d || d� 7 }|d7 }|d || � ||| d � ||d �< |d d �< q )Nr9 r� )r- r� r, ) r. �r�head�tailZright_head_indexesZleft_tail_indexesZpivotr/ r0 r� r� r� �_partial s4 � ��2�z'distinct_permutations.<locals>._partialTFc s g | ]}� � |��qS r� )r )�.0r� )r� r� r� � <listcomp>> s z)distinct_permutations.<locals>.<listcomp>c S s i | ] \}}|t |��qS r� )r )r7 �k�vr� r� r� � <dictcomp>A s z)distinct_permutations.<locals>.<dictcomp>c s t � fdd�| D ��S )Nc 3 s � | ] }t � | �V qd S r� r )r7 r ��equivalent_itemsr� r� � <genexpr>D s � �z@distinct_permutations.<locals>.permuted_items.<locals>.<genexpr>�r, )�permuted_indicesr< r� r� �permuted_itemsC s �z-distinct_permutations.<locals>.permuted_itemsN�r3 r c 3 s � | ]}� |�V qd S r� r� )r7 r@ )rA r� r� r> S s � � �z(distinct_permutations.<locals>.<genexpr>r� )r� ) r �sortr� r r r� r� r� r r� ) r� r3 r2 r6 ZsortableZ indices_dictr� �indices� algorithmr� )r= r� rA r1 r� ra � s6 -' � �ra c C sJ t | �}t tt|���}tt||d�tttttt�t|�t||d����S )a Yield successive derangements of the elements in *iterable*. A derangement is a permutation in which no element appears at its original index. In other words, a derangement is a permutation that has no fixed points. Suppose Alice, Bob, Carol, and Dave are playing Secret Santa. The code below outputs all of the different ways to assign gift recipients such that nobody is assigned to himself or herself: >>> for d in derangements(['Alice', 'Bob', 'Carol', 'Dave']): ... print(', '.join(d)) Bob, Alice, Dave, Carol Bob, Carol, Dave, Alice Bob, Dave, Alice, Carol Carol, Alice, Dave, Bob Carol, Dave, Alice, Bob Carol, Dave, Bob, Alice Dave, Alice, Bob, Carol Dave, Carol, Alice, Bob Dave, Carol, Bob, Alice If *r* is given, only the *r*-length derangements are yielded. >>> sorted(derangements(range(3), 2)) [(1, 0), (1, 2), (2, 0)] >>> sorted(derangements([0, 2, 3], 2)) [(2, 0), (2, 3), (3, 0)] Elements are treated as unique based on their position, not on their value. Consider the Secret Santa example with two *different* people who have the *same* name. Then there are two valid gift assignments even though it might appear that a person is assigned to themselves: >>> names = ['Alice', 'Bob', 'Bob'] >>> list(derangements(names)) [('Bob', 'Bob', 'Alice'), ('Bob', 'Alice', 'Bob')] To avoid confusion, make the inputs distinct: >>> deduped = [f'{name}{index}' for index, name in enumerate(names)] >>> list(derangements(deduped)) [('Bob1', 'Bob2', 'Alice0'), ('Bob2', 'Alice0', 'Bob1')] The number of derangements of a set of size *n* is known as the "subfactorial of n". For n > 0, the subfactorial is: ``round(math.factorial(n) / math.e)``. References: * Article: https://www.numberanalytics.com/blog/ultimate-guide-to-derangements-in-combinatorics * Sizes: https://oeis.org/A000166 rB ) r, r- r� r r r� �allr r/ )r� r3 �xs�ysr� r� r� r] [ s 6 "�r] c C sX |dkrt d��|dkrttt| �|�dd�S t| g�}t||�}ttt||�dd��S )a6 Intersperse 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] r z n must be > 0r9 N)r� r rs r rR r? )r r� r� �filler�chunksr� r� r� rw � s rw c sF dd� | D �}t t�tt|���� � fdd�� D ���fdd�|D �S )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. c S � g | ]}t |��qS r� )r �r7 r) r� r� r� r8 � � z"unique_to_each.<locals>.<listcomp>c s h | ] }� | d kr|�qS �r9 r� )r7 �element)�countsr� r� � <setcomp>� � z!unique_to_each.<locals>.<setcomp>c s g | ] }t t� j|���qS r� )r �filter� __contains__rL )�uniquesr� r� r8 � rR )r r r� r� �set)� iterables�poolr� )rP rU r� r� � s r� c c s� � |dk r t d��|dkrdV dS |dk rt d��t| �}tt||�|d�}|s+dS t|�|k rAt|�|f|t|� V dS t|�V |f||krP|d n|d }t|jt||��}t||d d|�D ]}t|�V qgdS )aM Return 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 >= 0r� Nr9 zstep must be >= 1r� ) r� r� r r r� r, r� r� r ) �seqr� � fillvaluer� r� �window�paddingrI �_r� r� r� r� � s* � �r� c c sr � g }| D ] }|� |� |fV qt|�}t|�}td|d �D ]}t|| d �D ] }|||| � V q*q dS )aF Yield 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)] r+ r9 N)r� r, r� r- )r� rZ r� r& r� r/ r� r� r� r� s � ��r� c s0 t dt� �d �}|rt|�}� fdd�|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. r9 c 3 sD � | ] }t t� �| d �D ]}� ||| � ||| fV qqdS �r9 N)r- r� )r7 �Lr/ �rZ r� r� r> E s � � �z%substrings_indexes.<locals>.<genexpr>)r- r� r� )rZ �reverser3 r� ra r� r� ( s �r� c @ s: e Zd ZdZd dd�Zdd� Zdd� Zd d � Zd d � ZdS )rP a� 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 C s, t |�| _|| _tt�| _|pdd� | _d S )Nc S s dS �NTr� �r� r� r� r� r' r s z!bucket.__init__.<locals>.<lambda>)r� r� �_keyr r r� � _validator)r� r� �key� validatorr� r� r� r� n s zbucket.__init__c C sH | � |�sdS zt| | �}W n ty Y dS w | j| �|� dS r� )rf r� r� r� � appendleft)r� �valuer� r� r� r� rT t s �zbucket.__contains__c c s~ � | j | r| j | �� V n. zt| j�}W n ty" Y dS w | �|�}||kr0|V n| �|�r=| j | �|� qq)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. TN)r� r� r� r� r� re rf r� )r� rj r� � item_valuer� r� r� � _get_values� s$ � � ��zbucket._get_valuesc C s: | j D ]}| �|�}| �|�r| j| �|� qt| j�S r� )r� re rf r� r� r� )r� r� rk r� r� r� r� � s � zbucket.__iter__c C s | � |�s td�S | �|�S )Nr� )rf r� rl �r� rj r� r� r� r � s zbucket.__getitem__r� ) r r r r r� rT rl r� r r� r� r� r� rP J s # rP c C s t | �\}}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 rD )r� r� r� r� r� r� r� r� � s %r� c G s t �t| � �S )a4 Return 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`. )r r� r �rW r� r� r� rs � s rs c g s2 � t | dti�D ]}|D ] }|tur|V q qdS )as Return 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). r[ N)r r: )rW rG r� r� r� r� ru � s � ���ru c # sN � �du rz dd� � D ��W n t y td��w t� �t��kr&td��t��}tt|��fdd�dd �}�fd d�|D �}� fd d�|D �}|d |d d� }}|d |d d� }} || gt|� } t��} | r�t|�V | d 8 } dd� t| |�D �} t| �D ]\} } | d k r�t| | �V | d 8 } | | |7 < q�| sndS dS )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. Nc S rK r� �r� rL r� r� r� r8 rM z%interleave_evenly.<locals>.<listcomp>z^Iterable lengths could not be determined automatically. Specify them with the lengths keyword.z,Mismatching number of iterables and lengths.c s � | S r� r� �r/ ��lengthsr� r� r' s z#interleave_evenly.<locals>.<lambda>T�rg rb c s g | ]}� | �qS r� r� �r7 r/ rq r� r� r8 rM c s g | ]}t � | ��qS r� �r� rt rn r� r� r8 � r r9 c S s g | ]\}}|| �qS r� r� )r7 r �deltar� r� r� r8 * rv ) r� r� r� �sortedr- r r� r � enumerate)rW rr ZdimsZlengths_permuteZ lengths_descZ iters_descZ delta_primaryZdeltas_secondaryZ iter_primaryZiters_secondary�errorsZto_yieldr/ Ze_r� )rW rr r� rt � s@ � ��� � �rt c g sd � dd� | D �}|r0t t|��}z t|| �V W n ty+ |d ||< |d= Y nw |s dS dS )a� Repeatedly select one of the input *iterables* at random and yield the next item from it. >>> iterables = [1, 2, 3], 'abc', (True, False, None) >>> list(interleave_randomly(*iterables)) # doctest: +SKIP ['a', 'b', 1, 'c', True, False, None, 2, 3] The relative order of the items in each input iterable will preserved. Note the sequences of items with this property are not equally likely to be generated. c S rK r� ru )r7 r r� r� r� r8 A rM z'interleave_randomly.<locals>.<listcomp>r� N)r+ r� r� r� )rW � iterators�idxr� r� r� rv 5 s � � �rv c c s� � t � }|�dt| d�f� |rd|�� }|\}}|dur&||kr&|E dH q|D ]7}t|ttf�s:|dur>t||�r>|V q(zt|�}W n tyP |V Y q(w |�|� |�|d |f� |sdS dS )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']] r r9 N) r ri r r� r� �str�bytesr� r� ) r� � base_typeZlevels�stackZ node_group�levelZnodes�nodeZtreer� r� r� rU L s, � � �rU c c s� � z5|dur |� |du r|D ] }| |� |V qnt ||�D ] }| |� |E dH q W |dur5|� dS dS |dur?|� w w )au Invoke *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)rR )r r� Z chunk_size�beforeZafterr� r� r� r� r� r� � s$ �,� � ��r� c s< t t��fdd�td��D ��� |r � �fdd�}|� S � S )ap Yield 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`. c 3 s � | ] }�||� � V qd S r� r� rt )r� rZ r� r� r> � � � zsliced.<locals>.<genexpr>r c 3 r� )Nzseq is not divisible by n.r� )Z_slicer� r� r� r� � r� zsliced.<locals>.ret)r r� r )rZ r� r� r� r� )r� r� rZ r� r� � s r� r� c c s� � |dkr t | �V dS g }t| �}|D ]'}||�r6|V |r#|gV |dkr/t |�V dS g }|d8 }q|�|� q|V dS )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']] r Nr9 �r r� r� )r� �pred�maxsplitZkeep_separator�bufr) r� r� r� r� r� � s$ � r� c c s� � |dkr t | �V dS g }t| �}|D ]#}||�r2|r2|V |dkr,|g|�V dS g }|d8 }|�|� q|r?|V dS dS )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]] r Nr9 r� �r� r� r� r� r) r� r� r� r� r� s$ � �r� c c s� � |dkr t | �V dS g }t| �}|D ]&}|�|� ||�r:|r:|V |dkr4t |�}|r1|V dS g }|d8 }q|rB|V dS dS )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]] r Nr9 r� r� r� r� r� r� 6 s* � � �r� c c s� � |dkr t | �V dS t| �}zt|�}W n ty Y dS w |g}|D ]$}|||�rC|V |dkr=|g|�V dS g }|d8 }|�|� |}q&|V dS )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]] r Nr9 )r r� r� r� r� )r� r� r� r) Zcur_itemr� Z next_itemr� r� r� r� \ s, � � r� c c s@ � t | �}|D ]}|du rt|�V dS tt||��V qdS )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 the *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 :func:`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� Zsizesr) r1 r� r� r� r� � s �# �r� c sb t | �� t� t|����du r�S �dk rtd��|r)� ��fdd�}t�|� �S tt���� �S )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. To create an *iterable* of exactly size *n*, you can truncate with :func:`islice`. >>> list(islice(padded([1, 2, 3], '?'), 5)) [1, 2, 3, '?', '?'] >>> list(islice(padded([1, 2, 3, 4, 5, 6, 7, 8], '?'), 5)) [1, 2, 3, 4, 5] Nr9 �n must be at least 1c 3 s( � � D ]} | fV t ��d �V qd S �Nr9 �r )rl �r� Ziterator_with_repeatr� r� r� �slice_generator� s ��z padded.<locals>.slice_generator)r� r r r� r� r )r� r[ r� Z next_multipler� r� r� r� r� � s r� r+ c C s t �tt| t|���S )z�Repeat each element in *iterable* *n* times. >>> list(repeat_each('ABC', 3)) ['A', 'A', 'A', 'B', 'B', 'B', 'C', 'C', 'C'] )r r� r� r )r� r� r� r� r� r� � s r� c c s8 � t }| D ]}|V q|t u r|n|}t|�E dH dS )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)r: r )r� r� r� �finalr� r� r� r� � s � r� c s0 � dk rt d��t|� �}� fdd�t|�D �S )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`. r9 r� c s g | ] \}}t ||d � ��qS r� r� )r7 r r) �r� r� r� r8 ! s z distribute.<locals>.<listcomp>)r� r ry )r� r� �childrenr� r� r� rb � s rb �r� r r9 c C s 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�longestr[ )r r� r� )r� r� r� r[ r� r� r� r� r� $ s �r� c G s t dkr t�dt� 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.)r6 �warnings�warn�DeprecationWarningr; rn r� r� r� r� @ s � r� )r� r[ c G s� t |�t | �kr td��g }t|| �D ](\}}|dk r(|�tt|| �|�� q|dkr6|�t||d�� q|�|� q|rEt|d|i�S t|� 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 matchr Nr[ )r� r� r r� r r r r )r� r� r[ rW Z staggeredr) r� r� r� r� r� _ s r� �r c sz �du r t |� }n!t|�}t|�dkr |d ���fdd�}n t |� � � �fdd�}|r.tnt}t|t|| � ||d�� �S )aq 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')] If the *strict* keyword argument is ``True``, then ``UnequalIterablesError`` will be raised if any of the iterables have different lengths. Nr9 r c s � | � �S r� r� �Z zipped_items)rg � key_offsetr� r� r' � s z sort_together.<locals>.<lambda>c s �� | �� S r� r� r� )� get_key_itemsrg r� r� r' � s �rs )r0 r r� r� r rx )rW Zkey_listrg rb r� Z key_argument�zipperr� )r� rg r� r� r� � s . �r� c C s@ t | �\}} |s dS |d }t| t|��}tdd� 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� r c s s( � | ]\}}t tt|�|�t�V qd S r� )r{ r� r0 r� )r7 r/ r) r� r� r� r> � s � � �zunzip.<locals>.<genexpr>)r� r r� r, ry )r� r4 rW r� r� r� r� � s �r� c C s� | dk rt d��z|dd� W n ty t|�}Y nw |}tt|�| �\}}g }d}td| d �D ]}|}|||krA|d n|7 }|�t|||� �� q4|S )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. If order is not important, see :func:`distribute`, which does not first pull the iterable into memory. r9 r� Nr )r� r� r, �divmodr� r- r� r� ) r� r� rZ r� r3 r� r r/ r� r� r� r� rc � s �rc c C sT | du rt d�S |durt| |�rt | f�S zt | �W S ty) t | f� Y S w )ax If *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'] Nr� )r� r� r� )�objr r� r� r� rL + s ) �rL c C sZ |dk rt d��t|�\}}dg| }t|t| |�|�}ttt|d| d ��}t||�S )as Return 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. r zdistance must be at least 0Fr+ r9 )r� r r r� �anyr� r )� predicater� �distance�i1�i2r] �selectedZadjacent_to_selectedr� r� r� rJ ` s rJ c s: t | |�}�r�fdd�|D �}� r� fdd�|D �}|S )a An 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. c 3 s" � | ] \}}|t � |�fV qd S r� )r� �r7 r9 �g)� valuefuncr� r� r> � � � z$groupby_transform.<locals>.<genexpr>c 3 s � | ] \}}|� |�fV qd S r� r� r� )� reducefuncr� r� r> � r� �r )r� �keyfuncr� r� r� r� )r� r� r� rn � s $rn c @ s� e Zd ZdZeedd��Zdd� Zdd� Zdd� Z d d � Z d d � Z d d� Z dd� Z dd� Zedd� �Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!S )"r� a< 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) r c G s� t |�}|dkr |\| _t| j�d�| _t| j| j �d�| _n5|dkr6|\| _| _t| j| j �d�| _n |dkrC|\| _| _| _n|dkrNtd|� ���td|� ���t| j�d�| _| j| jkrgtd��| j| jk| _d S )Nr9 r r+ � z0numeric_range expected at least 1 argument, got z0numeric_range expected at most 3 arguments, got z&numeric_range() arg 3 must not be zero) r� �_stop�type�_start�_stepr� �_zeror� �_growing)r� r Zargcr� r� r� r� � s* �� znumeric_range.__init__c C s | j r | j| jk S | j| jkS r� )r� r� r� r� r� r� r� r� s znumeric_range.__bool__c C sx | j r | j| kr| jk r n dS || j | j | jkS dS | j| kr+| jkr:n dS | j| | j | jkS dS �NF)r� r� r� r� r� )r� �elemr� r� r� rT s ���znumeric_range.__contains__c C s^ t |t�r-t| � }t|� }|s|r|o|S | j|jko,| j|jko,| �d�|�d�kS dS )Nr� F)r� r� �boolr� r� � _get_by_index)r� �otherZ empty_selfZ empty_otherr� r� r� �__eq__ s ��znumeric_range.__eq__c C s� t |t�r | �|�S t |t�rc|jd u r| jn|j| j }|jd u s)|j| j kr-| j}n|j| jkr7| j }n| �|j�}|j d u sH|j | jkrL| j }n|j | j krW| j}n| �|j �}t |||�S t dt |�j� ���)Nz6numeric range indices must be integers or slices, not )r� �intr� r r� r� r� �_lenr� r� r r� r� r� r )r� rg r� r� r r� r� r� r " s( ��znumeric_range.__getitem__c C s" | rt | j| �d�| jf�S | jS �Nr� )�hashr� r� r� � _EMPTY_HASHr� r� r� r� �__hash__= s znumeric_range.__hash__c s> � fdd�t � D �}� jrttt� j�|�S ttt� j�|�S )Nc 3 s � | ] }� j |� j V qd S r� )r� r� �r7 r� r� r� r� r> D r� z)numeric_range.__iter__.<locals>.<genexpr>)r r� r r r5 r� r1 )r� �valuesr� r� r� r� C s znumeric_range.__iter__c C s | j S r� )r� r� r� r� r� �__len__J s znumeric_range.__len__c C sh | j r | j}| j}| j}n | j}| j}| j }|| }|| jkr"dS t||�\}}t|�t|| jk� S �Nr )r� r� r� r� r� r� r� )r� r� r r� r� r� r3 r� r� r� r� M s znumeric_range._lenc C s t | j| j| jffS r� )r� r� r� r� r� r� r� r� � __reduce__^ s znumeric_range.__reduce__c C s> | j dkrd| j�d| j�d�S d| j�d| j�d| j �d�S )Nr9 znumeric_range(r r# )r� r� r� r� r� r� r� �__repr__a s �znumeric_range.__repr__c C s" t t| �d�| j| j | j ��S r� )r� r� r� r� r� r� r� r� r� r� h s ��znumeric_range.__reversed__c C s t || v �S r� )r� rm r� r� r� r o s znumeric_range.countc C s� | j r&| j| kr| jk r%n n8t|| j | j�\}}|| jkr%t|�S n#| j| kr2| jkrIn nt| j| | j �\}}|| jkrIt|�S t|� d���)Nz is not in numeric range)r� r� r� r� r� r� r� r� )r� rj r� r3 r� r� r� r r s � znumeric_range.indexc C s< |dk r || j 7 }|dk s|| j krtd��| j|| j S )Nr z'numeric range object index out of range)r� r� r� r� )r� r/ r� r� r� r� � s znumeric_range._get_by_indexN)r r r r r� r- r� r� r� rT r� r r� r� r� r r� r� r� r� r r r� r� r� r� r� r� � s& 3 r� c C sB t | �}|s td�S |du rt� nt|�}tt|t|��t|��S )a Cycle 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� N)r, r� r r- r r� r� r )r� r� rZ Zcounterr� r� r� r[ � s r[ c c sF � t | �}|D ]}d}|D ] }|d|fV |}d}q |d|fV qdS )aH Yield 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 TFNru )r� r) �arl �br� r� r� r� � s � �r� c C sJ |du r t t� t|| ��S |dk rtd��t| |td�}t t� 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 Nr9 z window size must be at least 1�r[ )r r r� r� r� r: r )r� r� � window_sizer) r� r� r� r~ � s &r~ c C s dd� t tt| � �D �S )z�Yield elements of the longest common prefix among given *iterables*. >>> ''.join(longest_common_prefix(['abcd', 'abc', 'abf'])) 'ab' c s s � | ]}|d V qdS )r Nr� )r7 �cr� r� r� r> � � � z(longest_common_prefix.<locals>.<genexpr>)r rF r rn r� r� r� r � s r c C s 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� r� r� r� r� � s r� c c sH � g }|j }|j}| D ]}||�r||� q |E dH |� |V q dS )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� �cacheZ cache_append� cache_clearr� r� r� r� r� s � �r� c C s t t| |�|�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� r� r� r� r� r� r� s r� c @ �0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) ry a An extension of :func:`itertools.islice` that supports negative values for *stop*, *start*, and *step*. >>> iterator = iter('abcdefgh') >>> list(islice_extended(iterator, -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: >>> iterator = map(str, count()) >>> it = islice_extended(iterator)[10:20:2] >>> list(it) ['10', '12', '14', '16', '18'] c G s* t |�}|rt|t|� �| _d S || _d S r� )r� �_islice_helperr � _iterator)r� r� r r) r� r� r� r� G s zislice_extended.__init__c C r� r� r� r� r� r� r� r� N r� zislice_extended.__iter__c C � t | j�S r� �r� r� r� r� r� r� r� Q � zislice_extended.__next__c C s" t |t�r tt| j|��S td��)Nz4islice_extended.__getitem__ argument must be a slice)r� r ry r� r� r� )r� rg r� r� r� r T s zislice_extended.__getitem__N)r r r r r� r� r� r r� r� r� r� ry - s ry c c s� � |j }|j}|jdkrtd��|jpd}|dkr�|d u r dn|}|dk r}tt| d�| d�}|r7|d d nd}t|| d�}|d u rG|}n|dkrQt||�}nt|| d�}|| } | dkrbd S t| �D ]} | | dkrv|� � d V qf|� � qfd S |d ur�|dk r�t t | ||�d � tt | | �| d�}t| �D ]\} } | | dkr�|� � V n|� � |� | � q�d S t | |||�E d H d S |d u r�dn|}|d u�r|dk �r| d } tt| d�| d�}|r�|d d nd}|dk r�||}}n t|| d�d }}t |�|||� D ]\} } | V �q d S |d u�r)|d } t t | | | �d � |dk �r3|}d } n|d u �r?d }|d } n d }|| } | dk�rLd S t t | | ��}||d |� E d H d S )Nr z1step argument must be a non-zero integer or None.r9 r� r� )r� r r� r� r ry r r r- r� r� r r� r ) r) �sr� r r� r� �len_iterr/ r0 r� r r� �mr� r� r� r� [ sz � � � � r� c C s* zt | �W S ty t t| �� Y S w )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 r� r� r� rM � s �rM c # sN � � du r dd� }n� fdd�}t t| �|d�D ] \}}ttd�|�V qdS )ap 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] To find runs of adjacent letters, apply :func:`ord` function to convert letters to ordinals. >>> iterable = 'abcdfgilmnop' >>> ordering = ord >>> 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]] Nc S s | d | d S r r� rd r� r� r� r' s z$consecutive_groups.<locals>.<lambda>c s | d � | d � S r r� rd ��orderingr� r� r' rM �rg r9 )r ry r� r0 )r� r� rg r9 r� r� r� r� rX � s �) �rX )�initialc C sT t | �\}}zt|�g}W n ty tg � Y S w |dur!g }t|t|||��S )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] N)r r� r� r� r r� )r� r r� r� r� rl r� r� r� r_ s �r_ c @ r� ) rI aS Return 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 C s t |t�st�|| _d S r� )r� r r� �_target)r� �targetr� r� r� r� S s zSequenceView.__init__c C s | j | S r� )r� )r� r r� r� r� r X r� zSequenceView.__getitem__c C r� r� )r� r� r� r� r� r� r� [ r� zSequenceView.__len__c C s | j j� d| j�d�S )N�(r# )� __class__r r� r� r� r� r� r� ^ r� zSequenceView.__repr__N)r r r r r� r r� r� r� r� r� r� rI 5 s rI c @ sV e Zd ZdZddd�Zdd� Zdd� Zd d � Zefd d �Z d d� Z dd� Z dd� Z dS )r� a� 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') You can also seek forward: >>> it = seekable((str(n) for n in range(20))) >>> it.seek(10) >>> next(it) '10' >>> 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) '0' Call :meth:`relative_seek` to seek relative to the source iterator's current position. >>> it = seekable((str(n) for n in range(20))) >>> next(it), next(it), next(it) ('0', '1', '2') >>> it.relative_seek(2) >>> next(it) '5' >>> it.relative_seek(-3) # Source is at '6', we move back to '3' >>> next(it) '3' >>> it.relative_seek(-3) # Source is at '4', we move back to '1' >>> next(it) '1' 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 C s0 t |�| _|d u r g | _ntg |�| _d | _d S r� )r� �_sourcer� r �_index)r� r� r� r� r� r� r� � s zseekable.__init__c C r� r� r� r� r� r� r� r� � r� zseekable.__iter__c C s` | j d ur#z| j| j }W n ty d | _ Y n w | j d7 _ |S t| j�}| j�|� |S r� )r� r� r� r� r� r� �r� r� r� r� r� r� � s � zseekable.__next__c C r� r� r� r� r� r� r� r� � r� zseekable.__bool__c C sV zt | �}W n ty |tu r� | Y S w | jd u r"t| j�| _| jd8 _|S r� )r� r� r: r� r� r� )r� r� Zpeekedr� r� r� r� � s � z seekable.peekc C r� r� )rI r� r� r� r� r� �elements� r� zseekable.elementsc C s. || _ |t| j� }|dkrt| |� d S d S r� )r� r� r� r= )r� r � remainderr� r� r� �seek� s �z seekable.seekc C s0 | j d u r t| j�| _ | �t| j | d�� d S r� )r� r� r� r� r )r� r r� r� r� � relative_seek� s zseekable.relative_seekr� ) r r r r r� r� r� r� r: r� r� r� r� r� r� r� r� r� b s d r� c @ s( e Zd ZdZedd� �Zedd� �ZdS )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 C s dd� t | �D �S )Nc s s � | ] \}}|t |�fV qd S r� )rr r� r� r� r� r> r� z$run_length.encode.<locals>.<genexpr>r� r r� r� r� �encode s zrun_length.encodec C s t �tt| ��S r� )r r� r r r r� r� r� �decode s zrun_length.decodeN)r r r r � staticmethodr� r� r� r� r� r� r� s r� c C s t tt|| �|d ��|kS )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. r9 )rr r rS )r� r� r� r� r� r� rh s rh c c sj � t | �}|dkr td��|�|� | }t|�}|t�||� }td|�D ] }|�|� t|�V q&dS )a� Yield the circular shifts of *iterable*. >>> list(circular_shifts(range(4))) [(0, 1, 2, 3), (1, 2, 3, 0), (2, 3, 0, 1), (3, 0, 1, 2)] Set *steps* to the number of places to rotate to the left (or to the right if negative). Defaults to 1. >>> list(circular_shifts(range(4), 2)) [(0, 1, 2, 3), (2, 3, 0, 1)] >>> list(circular_shifts(range(4), -1)) [(0, 1, 2, 3), (3, 0, 1, 2), (2, 3, 0, 1), (1, 2, 3, 0)] r z"Steps should be a non-zero integerN)r r� �rotater� �math�gcdr r, )r� Zsteps�bufferr� r^ r� r� r� rT 2 s � �rT c s � �fdd�}|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 s �� ��fdd�}|S )Nc s � ����fdd�}|S )Nc s0 � | i |��}t ��}|��|� �|i ���S r� )r �insert)r r �resultZwrapping_args_)�f� result_index� wrapping_args� wrapping_func�wrapping_kwargsr� r� � inner_wrapper� s zOmake_decorator.<locals>.decorator.<locals>.outer_wrapper.<locals>.inner_wrapperr� )r� r� )r� r� r� r� )r� r� � outer_wrapper� s z8make_decorator.<locals>.decorator.<locals>.outer_wrapperr� )r� r� r� �r� r� )r� r� r� � decorator� s z!make_decorator.<locals>.decoratorr� )r� r� r� r� r� r� r� P s 3 r� c C s� t t�}|du r| D ] }||�}|| �|� q n| D ]}||�}||�}|| �|� q|dur@|�� D ] \}}||�||< q5d|_|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. N)r r r� r� �default_factory) r� r� r� r� r� r� rg rj Z value_listr� r� r� r� � s 4�r� c sV |du r!zt | �� � fdd�tt| �|�D �W S ty Y nw ttt| ||���S )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: >>> iterator = iter('abcb') >>> pred = lambda x: x == 'b' >>> list(rlocate(iterator, 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. Nc 3 s � | ] }� | d V qdS r_ r� rt �r� r� r� r> � s � zrlocate.<locals>.<genexpr>)r� r~ r� r� r )r� r� r� r� r� r� r� � s ! �r� c c s� � |dk r t d��t|�}t| tt|d ��}t||�}d}|D ],}||� r?|du s.||k r?|d7 }|E dH t||d � q |rL|d turL|d V q dS )aY Yield 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] r9 z window_size must be at least 1r N)r� r, r r r: r� r= ) r� r� Z substitutesr r� r) Zwindowsr� �wr� r� r� r� s$ � ��r� c # sN � t | �� t� �}ttd|��D ]}� fdd�td| ||f �D �V qdS )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`. r9 c s g | ] \}}� ||� �qS r� r� )r7 r/ r0 �Zsequencer� r� r8 T rR z partitions.<locals>.<listcomp>r� N)r r� rB r- r )r� r� r/ r� r� r� r� C s �&�r� c # s� � t | �}t|�}|dur|dk rtd��||krdS �dur!�nd�� dur)� n|� �� kr1dS �fdd��|du rWtd|d �D ]}t� �fdd��||��E dH qBdS t� �fd d��||��E dH dS ) 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'] if *min_size* and/or *max_size* are given, the minimum and/or maximum size per block in partition is set. >>> iterable = 'abc' >>> for part in set_partitions(iterable, min_size=2): ... print([''.join(p) for p in part]) ['abc'] >>> for part in set_partitions(iterable, max_size=2): ... print([''.join(p) for p in part]) ['a', 'bc'] ['ab', 'c'] ['b', 'ac'] ['a', 'b', 'c'] Nr9 z6Can't partition in a negative or zero number of groupsr c 3 s� � t | �}|dkr| gV d S ||kr dd� | D �V d S | ^}}� ||d �D ] }|gg|�V q(� ||�D ]"}tt |��D ]}|d |� |g|| g ||d d � V q?q7d S )Nr9 c S s g | ]}|g�qS r� r� )r7 r� r� r� r� r8 � s zAset_partitions.<locals>.set_partitions_helper.<locals>.<listcomp>)r� r- )r` r9 r� r �Mr� r/ )�set_partitions_helperr� r� r� � s � 0��z-set_partitions.<locals>.set_partitions_helperc � t � �fdd�| D ��S )Nc 3 �, � | ]}�t |� ko� kn V qd S r� ro �r7 Zbk��max_size�min_sizer� r� r> � � �* �3set_partitions.<locals>.<lambda>.<locals>.<genexpr>�rF �r� r r� r� r' � rv z set_partitions.<locals>.<lambda>c r� )Nc 3 r r� ro r r r� r� r> � r r r r r r� r� r' � rv )r r� r� r- rS )r� r9 r r r` r� r� )r r r� r� r� W s4 �'� �� �r� c @ �( e Zd ZdZdd� Zdd� Zdd� ZdS ) 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 C s2 |dk rt d��|| _t|�| _t� | _d| _d S )Nr z limit_seconds must be positiveF)r� � limit_secondsr� r� r8 � _start_time� timed_out)r� r r� r� r� r� r� � s ztime_limited.__init__c C r� r� r� r� r� r� r� r� � r� ztime_limited.__iter__c C s> | j dkr d| _t�t| j�}t� | j | j kr d| _t�|S )Nr T)r r r� r� r� r8 r r� r� r� r� r� � s ztime_limited.__next__N�r r r r r� r� r� r� r� r� r� r� � s r� c C sB t | �}|D ]}|D ]}d|�d|�d�}|pt|��| S |S )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 r )r� r� r r� rl r r r� r� r� r� � s �� r� c s8 t � � t| |��� �fdd�}d� �fdd� }|� |fS )Nc 3 s> � t t�� � r� �� V nt��V q1 sw Y d S r� )r r� r� r� r� �r� r� r� r� � generator s � ��z_ichunk.<locals>.generatorr9 c sL | d u r � � �� t� �S | t� � }|dkr � � t�|�� t| t� ��S r� )r r� r r )r� Zto_cacher r� r� �materialize_next s z!_ichunk.<locals>.materialize_nextrN )r r )r� r� r r r� r r� �_ichunk� s r c c s4 � t | �} t||�\}}|� sdS |V |d� q)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] TN)r� r )r� r� r� r� r r� r� r� ro s ��ro c G s t ttt| dt� i���S )a Return ``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. r[ )rF r� rF r �objectrn r� r� r� rp A s rp c c s� � |dk r t d��|dkrdV dS t| �}tt|�td�d�g}dg| }d}|rtz t|d �\}}W n tyE |�� |d8 }Y q(w |||< |d |krVt|�V n|�tt||d d� |d �td�d�� |d7 }|s*dS dS )aB Yield 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. r zr must be non-negativer� Nr9 r� r� ) r� r, rE ry r0 r� r� �popr� )r� r3 rX � generatorsZ current_combor� Zcur_idxr� r� r� r� r` U s: � � �� �r` c g s6 � |D ]}z| |� W n |y Y qw |V qdS )a Yield 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� )rh r� � exceptionsr� r� r� r� rj } s � ��rj c g s0 � |D ]}z| |�V W q |y Y qw dS )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� r� r� r� r� � s � ��r� c c sV � |du r| D ] }||�r||�n|V qdS | D ]}||�r#||�n||�V qdS )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 Z func_elser� r� r� r� r� � s �� �r� c C s� t t| |��}|rt|�|k rtd��d}tt��& |t� d| 9 }ttt� �t | � �}t t| |d ��}||t |�< q1 sBw Y t |� |S )N� Sample larger than population� �?Tr9 ) r r r� r� r r� r* r! r# r$ r� r+ r, )r� r9 r� � reservoir�W�skiprO r� r� r� �_sample_unweighted� s ��r c C s� dd� |D �}t |t|| ��}|rt|�|k rtd��t|� |d \}}tt� �| }t|| �D ]8\} } | |kre|d \}}t| | �} t| d�} t| �| } t || | f� |d \}}tt� �| }q1|| 8 }q1dd� |D �}t |� |S )Nc s s � | ] }t t� �| V qd S r� )r# r* )r7 �weightr� r� r� r> � s � z#_sample_weighted.<locals>.<genexpr>r r r9 c S s g | ]\}}|�qS r� r� )r7 � weight_keyrO r� r� r� r8 � rM z$_sample_weighted.<locals>.<listcomp>) rD r r� r� r r# r* r r- r r, )r� r9 �weightsr� Z weight_keysr Zsmallest_weight_keyr^ Zweights_to_skipr rO Zt_wZr_2r r� r� r� r� �_sample_weighted� s( r c s� d �d�� ���fdd�}t t�� g }t|�D ] }|�|d�� qW d � n1 s,w Y |r=t|�|k r=td��t t��$ d} |t� d| 9 }ttt� �t | � �}||���|t |�< qE1 shw Y t |� |S )Nr c s@ | d �kr| � } t ���t � ��| d �ks�| d 8 ��S r� r rp �rP rO � population� remainingr� r� �feed s � z _sample_counted.<locals>.feedr r Tr9 ) r r� r- r� r� r� r* r! r# r$ r+ r, ) r" r9 rP r� r$ r r^ r r r� r! r� �_sample_counted s, � � ��r% )rP r� c C s� t | �}|dk r td��|dkrg S |dur |dur td��|dur-t |�}t||||�S |dur<t |�}t||||�S t|||�S )a� Return a *k*-length list of elements chosen (without replacement) from the *iterable*. Similar to :func:`random.sample`, but works on inputs that aren't indexable (such as sets and dictionaries) and on inputs where the size isn't known in advance (such as generators). >>> iterable = range(100) >>> sample(iterable, 5) # doctest: +SKIP [81, 60, 96, 16, 4] For iterables with repeated elements, you may supply *counts* to indicate the repeats. >>> iterable = ['a', 'b'] >>> counts = [3, 4] # Equivalent to 'a', 'a', 'a', 'b', 'b', 'b', 'b' >>> sample(iterable, k=3, counts=counts) # doctest: +SKIP ['a', 'a', 'b'] An iterable with *weights* may 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] Weighted selections are made without replacement. After an element is selected, it is removed from the pool and the relative weights of the other elements increase (this does not match the behavior of :func:`random.sample`'s *counts* parameter). Note that *weights* may not be used with *counts*. If the length of *iterable* is less than *k*, ``ValueError`` is raised if *strict* is ``True`` and all elements are returned (in shuffled order) if *strict* is ``False``. By default, the `Algorithm L <https://w.wiki/ANrM>`__ reservoir sampling technique is used. When *weights* are provided, `Algorithm A-ExpJ <https://w.wiki/ANrS>`__ is used instead. Notes on reproducibility: * The algorithms rely on inexact floating-point functions provided by the underlying math library (e.g. ``log``, ``log1p``, and ``pow``). Those functions can `produce slightly different results <https://members.loria.fr/PZimmermann/papers/accuracy.pdf>`_ on different builds. Accordingly, selections can vary across builds even for the same seed. * The algorithms loop over the input and make selections based on ordinal position, so selections from unordered collections (such as sets) won't reproduce across sessions on the same platform using the same seed. For example, this won't reproduce:: >> seed(8675309) >> sample(set('abcdefghijklmnopqrstuvwxyz'), 10) ['c', 'p', 'e', 'w', 's', 'a', 'j', 'd', 'n', 't'] r zk must be non-negativeNz)weights and counts are mutually exclusive)r� r� r� r r% r )r� r9 r rP r� r� r� r� r� r� $ s < r� c C s` |du r| nt || �}t|�\}}t|d� |r ||}}|r'tt t||��S 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, which means it may produce results that differ from the built-in :func:`sorted` function for objects with unusual comparison dynamics (like ``math.nan``). If there are no out-of-order items, the iterable is exhausted. N)r� r r� rF r1 r� )r� rg rb r� r) r� r� r� r� r� rx w s &rx c @ s e Zd ZdS )rH N)r r r r� r� r� r� rH � s rH c @ sZ e Zd ZdZddd�Zdd� Zdd � Zd d � Zd d � Ze dd� �Z e dd� �Z dd� Z dS )rQ a� 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. �callback皙�����?c C s@ || _ || _d| _d | _|| _td�jjdd�| _| � � | _ d S )NFzconcurrent.futuresr9 )� max_workers) �_func� _callback_kwd�_aborted�_future� _wait_seconds� __import__ZfuturesZThreadPoolExecutor� _executor�_readerr� )r� r Z callback_kwdZ wait_secondsr� r� r� r� � s ��zcallback_iter.__init__c C r� r� r� r� r� r� r� � __enter__� r� zcallback_iter.__enter__c C s d| _ | j�� d S rc )r+ r/ �shutdown)r� �exc_type� exc_value� tracebackr� r� r� �__exit__� s zcallback_iter.__exit__c C r� r� r� r� r� r� r� r� � r� zcallback_iter.__iter__c C r� r� r� r� r� r� r� r� � r� zcallback_iter.__next__c C s | j d u rdS | j �� S r� )r, �doner� r� r� r� r7 � s zcallback_iter.donec C s | j std��| j�� S )Nz Function has not yet completed)r7 � RuntimeErrorr, r� r� r� r� r� r� � s zcallback_iter.resultc # s� � t � � � �fdd�}�jj�jfi �j|i���_ z � j�jd�}W n ty- Y nw � � � |V �j� � r;nqg } z� � � }W n tyN Y n w � � � |� |� q?� � � |E d H d S )Nc s �j rtd��� �| |f� d S )Nzcanceled by user)r+ rH �put)r r �r� r� r� r� r& � s z'callback_iter._reader.<locals>.callbackT)�timeout)r) r/ Zsubmitr) r* r, �getr- r( � task_doner7 � get_nowaitr� �join)r� r& r� r# r� r: r� r0 � s> ��� � � � �zcallback_iter._readerN)r& r' ) r r r r r� r1 r6 r� r� �propertyr7 r� r0 r� r� r� r� rQ � s 2 rQ c c s� � |dk r t d��t| �}t|�}||krt d��t|| d �D ] }|d|� }|||| � }||| d� }|||fV q!dS )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. r rY zn must be <= len(seq)r9 N)r� r, r� r- )r� r� rZ r1 r/ Z beginningZmiddle�endr� r� r� r� s � �r� c C sx t � }|j}g }|j}|rt|| �n| D ]%}z||v r W dS ||� W q ty9 ||v r3Y dS ||� Y qw dS )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)rV �addr� r� r� )r� rg ZseensetZ seenset_addZseenlistZ seenlist_addrO r� r� r� rK B s �rK c G s� t ttt|���}t tt|��}tt|�}| dk r | |7 } d| kr(|k s+t� t�g }t||�D ]\}}|� || | � | | } q2tt|��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� r, r� r� r r2 r� r r� )r r Zpools�nsr� r� rX r� r� r� r� r� e s � r� c C s t | �}t|�}|du s||kr|t|�}}nd| kr#|k s&t� t�t||�}|dks1J �|dk r9||7 }d| krD|k sGt� t�dg| }||k rX|t|� | n|}td|d �D ]#}t||�\}} d|| krv|k r~n n| ||| < |dkr� nqatt |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. Nr r9 ) r r� r r� r% r� r- r� r, r� r ) r� r3 r rX r� r� r� r� �dr/ r� r� r� r� � s4 � � �r� c C s� t | �}t|�}|dk s||krt�t|| d |�}|dk r#||7 }|dk s+||kr-t�g }d}|rb|d8 }|dkrYt|| d |�}||k rIn|d8 }|d7 }||8 }|dks;|�|| � |s3t |�S )ag Equivalent 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. r r9 )r, r� r� r r� r� ) r� r3 r rX r� r� r� r/ Z num_combsr� r� r� r� � s0 �� r� c g sL � | D ] }t |ttf�r|V qz|E dH W q ty# |V Y qw dS )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'] Pre- or postpend a single element to an iterable: >>> list(value_chain(1, [2, 3, 4, 5, 6])) [1, 2, 3, 4, 5, 6] >>> list(value_chain([1, 2, 3, 4, 5], 6)) [1, 2, 3, 4, 5, 6] Multiple levels of nesting are not flattened. N)r� r} r~ r� )r rj r� r� r� r� � s � ��r� c G sV d}t | |td�D ] \}}|tu s|tu rtd��t|�}|t|� |�|� }q |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*. r r� z element is not a product of args)r r: r� r, r� r )rO r r r� rX r� r� r� r� s r� c C s� t | �} t| d�\}}|du rdS g }t |�}|D ] \}}||kr5|�|� t| d�\}}|du r3 n|}qtd��t||dfd�\}} d} t t|�dd�D ]\} } || } | | kra| t| | �7 } qNt|d |d �| 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*. �NNNr z(element is not a combination of iterabler� r9 )r� )ry r� r� r� r} r� r ) rO r� r9 r� �indexesrX r� r� �tmpr^ r r/ r0 r� r� r� rV s. ��rV c C s$ t | �} t| �}t| �} t| d�\}}|du rdS g }t |�}t|�D ]%\}}||krB|�|� t| d�\} }| du r<n| }||ks+|du rH nq#td��t|�}dg| } |D ] } | | d7 < qXd} d} td|�D ]#}| | |d 7 } || d | | }|| }||kr�| t||�7 } ql| S )a0 Equivalent 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*. rE Nr z9element is not a combination with replacement of iterabler9 )r, r� ry r� r� r� r- r )rO r� �lr9 r� rF rX r� r� rG Z occupationsr� r Zcumulative_sumr0 r/ r� r� r� rW D sH ��� �rW c C sL d}t |�}ttt|�dd�| �D ]\}}|�|�}|| | }||= q|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*. r r� )r r r- r� r )rO r� r rX r/ r� r3 r� r� r� r� } s r� c @ r ) r\ a� 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 C s t |�| _d| _d S r� )r� r� � items_seenr� r� r� r� r� � s zcountable.__init__c C r� r� r� r� r� r� r� r� � r� zcountable.__iter__c C s t | j�}| jd7 _|S r� )r� r� rI r� r� r� r� r� � s zcountable.__next__Nr r� r� r� r� r\ � s r\ c c s, � t | �}|d |d }tt||��}tt|j|�|d|�D ]}|d|� V |d|�= q |s2dS t|�}t||�\}}||dkrDdnd } t|| �\}}||dkrUdnd } | d } || | } | | } | dkr|td| | �D ] }|||| � V qp| dkr�t| || �D ] }|||| � V q�dS dS )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]] r9 r+ Nr )r� r r r� r� r� r� r- )r� r� r� Z min_bufferr� r^ �lengthr� r3 Z num_listsZ full_sizeZ partial_sizeZnum_fullZpartial_start_idxr/ r� r� r� rS � s2 � �rS )� scalar_typesr� c ' s� � � fdd�}t |�}|sdS dg| }g g }}t|�D ]\}} || �r*| ||< q |�t| �� |�|� q |s@t|�V dS |rDtnt} | |� D ]} t|| �D ]\}||< qQt|�V qJdS )a A 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 s6 � r t | � �r dS zt| � W dS ty Y dS w )NTF)r� r� r� )r� �rK r� r� � is_scalar� s ��z zip_broadcast.<locals>.is_scalarN)r� ry r� r� r, r; r ) rK r� ZobjectsrM r1 Znew_itemrW Ziterable_positionsr/ r� r� r� r� rL r� r� � s* � �r� c c s� � |dkr t d��t|d�}tt�}|du}| D ]:}t|�|kr6|d }|| dkr.||= n|| d8 < |r<||�n|}||vrE|V || d7 < |�|� qdS )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. r zn must be greater than 0r� Nr9 )r� r r r� r� r� ) r� r� rg r\ rP �use_keyr� Z to_discardr9 r� r� r� r� s$ � �r� c c s| � t � }g }|du}| D ]/}|r||�n|}z||vr!|�|� n|V W q ty; ||vr6|�|� n|V Y q w dS )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)rV rB r� r� )r� rg �seen_set� seen_listrN rO r9 r� r� r� re F s$ � � ���re c C s t dd� t| |�D ��S )a2 Yields 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`. c s s" � | ] \}}|D ]}|V qqd S r� r� )r7 r^ r� r� r� r� r> o r� z&duplicates_justseen.<locals>.<genexpr>)r? r �r� rg r� r� r� rf d s rf c c s� � t � }g }|du}d}t| �D ]?\}}|r||�n|}| p"||k} |}d} z ||vr3|�|� d} W n tyH ||vrF|�|� d} Y nw || | fV qdS )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)rV ry rB r� r� ) r� rg rO rP rN Zpreviousr/ rO r9 Zis_unique_justseenZis_unique_everseenr� r� r� rg r s. � � ���rg )rg r� c G s8 |r| g|�R n| }t |�}zt|� }}W n ty3 } z|tu r'td�|�|W Y d}~S d}~ww |du r]t|||d�D ]\} } | | k rL| | } } | |k rR| }|| k rX| }q?||fS ||� } } t|||d�D ]-\} } || �|| �} }|| k r�| | || f\} } } }| | k r�| | }} | |k r�| |}} qj||fS )a Returns both the smallest and largest items from an iterable or from 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 makes a single pass over the input elements and takes care to minimize the number of comparisons made during processing. Note that unlike the builtin ``max`` function, which always returns the first item with the maximum value, this function may return another item when there are ties. This function is based on the `recipe <https://code.activestate.com/recipes/577916-fast-minmax-function>`__ by Raymond Hettinger. z[`minmax()` argument is an empty iterable. Provide a `default` value to suppress this error.Nr� )r� r� r� r: r� r )Ziterable_or_valuerg r� Zothersr� r) r� r� �excr� r� Zlo_keyZhi_keyZx_keyZy_keyr� r� r� r� � sF #���� � � �r� Tc c s� � |dkr t d��g }d}d}| D ]:}||�} |r!| |kr!t d��||k} | | |k} |r>| s1| r>t|�V |�� d}d}|�|� || 7 }|d7 }q|rUt|�V dS dS )aB Yield 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*. r z&maximum size must be greater than zeroz item size exceeds maximum sizer9 N)r� r, r� r� ) r� r � max_countZget_lenr� ZbatchZ batch_sizeZ batch_countr� �item_lenZ reached_countZ reached_sizer� r� r� rY � s. � �rY c ' s � t dd� | D ���t��}�D ] }t|�dk r td��qdg| � tt|d ��}dg| } t � �fdd�t|�D ��V |d }d|d< ||krMd S � | || � |< � | dksi� | t�| �d kr�|| ||< ||d ||< |d ||d < q0) af Like :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*. c s s � | ]}t |�V qd S r� r? )r7 r� r� r� r� r> + r� z gray_product.<locals>.<genexpr>r+ z)each iterable must have two or more itemsr r9 Tc 3 s � | ] }�| � | V qd S r� r� rt �r� Z all_iterablesr� r� r> 9 r� N)r, r� r� r r- )rW Ziterable_countr� r� �or0 r� rU r� rm s, � � $�rm c g sp � t tt| ��}z dd� |D �}W n ty Y dS w t|�V t|�D ]\}}|D ] ||< t|�V q+q%dS )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')] c S rK r� r rL r� r� r� r8 T rM z#partial_product.<locals>.<listcomp>N)r r� r� r� r, ry )rW r{ �prodr/ r) r� r� r� r� E s � � ��r� c c s$ � |D ] }|V | |�s dS qdS )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� r� r� r� r� r� ^ s ���r� c s0 t |�}tt� ��fdd�t||��t|�d�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'] >>> pair_counts = Counter(zip(xs, ys)) >>> count_rows = lambda x, y: pair_counts[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 s �| |g� �R i ���S r� r� )r� r� �r r r r� r� r' � rv z outer_product.<locals>.<lambda>r� )r, rG r r r� )r rG rH r r r� rX r� r� l s �r� c g s( � z| E dH W dS |y Y dS 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 r� r� r� r{ � s � �r{ c c s& � |D ] }| |�}|dur|V qdS )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� r� r� r� r� r� rk � s ���rk c s< t t�ttt| ����� t�� fdd�tt � �d �D ��S )ax Yields all possible subsets of the iterable. >>> list(powerset_of_sets([1, 2, 3])) # doctest: +SKIP [set(), {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}] >>> list(powerset_of_sets([1, 1, 0])) # doctest: +SKIP [set(), {1}, {0}, {0, 1}] :func:`powerset_of_sets` takes care to minimize the number of hash operations performed. c 3 s$ � | ] }t t� jt� |��V qd S r� )r rV �unionr )r7 r3 �Zsetsr� r� r> � s � � �z#powerset_of_sets.<locals>.<genexpr>r9 ) r, �dict�fromkeysr� � frozensetr r r� r- r� r r� rZ r� r� � s �r� c K s@ t t�}| �� D ]\}}|�� D ] \}}||| |< qqt|�S )a2 Joins multiple mappings together using their common keys. >>> user_scores = {'elliot': 50, 'claris': 60} >>> user_times = {'elliot': 30, 'claris': 40} >>> join_mappings(score=user_scores, time=user_times) {'elliot': {'score': 50, 'time': 30}, 'claris': {'score': 60, 'time': 40}} )r r[ r� )Z field_to_mapr� � field_name�mappingrg rj r� r� r� r| � s �r| c C s� t d�}t d�}tt|| �ttt|| ���}tt||�t||��}tt|| �t|| ��}tt||�t||��}tt||�t||��S )z\High precision sumprod() for complex numbers. Used by :func:`dft` and :func:`idft`. �real�imag)r. r r� r3 �complexr� )Zv1Zv2r` ra Zr1Zr2r� r� r� r� r� �_complex_sumprod� s rc c # sX � t | �� � fdd�t� �D ��t� �D ]�� ��fdd�t� �D �}t| |�V qdS )ay Discrete Fourier Transform. *xarr* is a sequence of complex numbers. Yields the components of the corresponding transformed output vector. >>> import cmath >>> xarr = [1, 2-1j, -1j, -1+2j] # time domain >>> Xarr = [2, -2-2j, -2j, 4+4j] # frequency domain >>> magnitudes, phases = zip(*map(cmath.polar, Xarr)) >>> all(map(cmath.isclose, dft(xarr), Xarr)) True Inputs are restricted to numeric types that can add and multiply with a complex number. This includes int, float, complex, and Fraction, but excludes Decimal. See :func:`idft` for the inverse Discrete Fourier Transform. c � g | ] }t |� t d �qS )y � �r r& r� ��Nr� r� r8 � � zdft.<locals>.<listcomp>c � g | ] }��| � �qS r� r� r� �rg r9 Zroots_of_unityr� r� r8 � rR N�r� r- rc )Zxarr�coeffsr� rj r� r^ � s � �r^ c # s\ � t | �� � fdd�t� �D ��t� �D ]�� ��fdd�t� �D �}t| |�� V qdS )aK Inverse Discrete Fourier Transform. *Xarr* is a sequence of complex numbers. Yields the components of the corresponding inverse-transformed output vector. >>> import cmath >>> xarr = [1, 2-1j, -1j, -1+2j] # time domain >>> Xarr = [2, -2-2j, -2j, 4+4j] # frequency domain >>> all(map(cmath.isclose, idft(Xarr), xarr)) True Inputs are restricted to numeric types that can add and multiply with a complex number. This includes int, float, complex, and Fraction, but excludes Decimal. See :func:`dft` for the Discrete Fourier Transform. c rd )y �?re r� rf r� r� r8 rh zidft.<locals>.<listcomp>c ri r� r� r� rj r� r� r8 rR Nrk )ZXarrrl r� rj r� rq � s � �rq c c s � |D ] }| di |��V qdS )a Apply *func* to every item of *iterable* by dictionary unpacking the item into *func*. The difference between :func:`itertools.starmap` and :func:`doublestarmap` parallels the distinction between ``func(*a)`` and ``func(**a)``. >>> iterable = [{'a': 1, 'b': 2}, {'a': 40, 'b': 60}] >>> list(doublestarmap(lambda a, b: a + b, iterable)) [3, 100] ``TypeError`` will be raised if *func*'s signature doesn't match the mapping contained in *iterable* or if *iterable* does not contain mappings. Nr� r� )r r� r� r� r� r� rd s ��rd c C sp | dk rt �| dk r| d| fS | t| t| � � }|| }| dkr4|| dtt| ��d t| � 8 }||fS )z:Bounds for the nth prime (counting from 1): lb < p_n < ub.r9 � g @i�� r g @)r� r# )r� Z upper_boundZ lower_boundr� r� r� �_nth_prime_bounds& s $rn )� approximatec C sV t | d �\}}|r| dkrttt|��| �S t|| d �dB }tt|dd�td�S )a` Return the nth prime (counting from 0). >>> nth_prime(0) 2 >>> nth_prime(100) 547 If *approximate* is set to True, will return a prime close to the nth prime. The estimation is much faster than computing an exact result. >>> nth_prime(200_000_000, approximate=True) # Exact result is 4222234763 4217820427 r9 i@B r+ )r� )r� )rn rA rC r' r! r> r r@ )r� ro ZlbZubZoddr� r� r� r� 9 s r� r� c C �* |dur t || �} tt| �td�d�d S )a� Index of the first occurrence of a minimum value in an iterable. >>> argmin('efghabcdijkl') 4 >>> argmin([3, 2, 1, 0, 4, 2, 1, 0]) 3 For example, look up a label corresponding to the position of a value that minimizes a cost function:: >>> def cost(x): ... "Days for a wound to heal given a subject's age." ... return x**2 - 20*x + 150 ... >>> labels = ['homer', 'marge', 'bart', 'lisa', 'maggie'] >>> ages = [ 35, 30, 10, 9, 1 ] # Fastest healing family member >>> labels[argmin(ages, key=cost)] 'bart' # Age with fastest healing >>> min(ages, key=cost) 10 Nr9 r� r )r� r ry r0 rQ r� r� r� rO S s rO c C rp )u Index of the first occurrence of a maximum value in an iterable. >>> argmax('abcdefghabcd') 7 >>> argmax([0, 1, 2, 3, 3, 2, 1, 0]) 3 For example, identify the best machine learning model:: >>> models = ['svm', 'random forest', 'knn', 'naïve bayes'] >>> accuracy = [ 68, 61, 84, 72 ] # Most accurate model >>> models[argmax(accuracy)] 'knn' # Best accuracy >>> max(accuracy) 84 Nr9 r� r )r� r ry r0 rQ r� r� r� rN t s rN c c s� � t | �}tt|t� ��}|r|d d dk rtd��i }d}d}|D ]:\}}|| } | rGz tt|| d d��} W n tyD t|��w |}| ||< ||v r]|� |�V |d7 }||v sOq#dS )a� Yield values at the specified indices. Example: >>> data = 'abcdefghijklmnopqrstuvwxyz' >>> list(extract(data, [7, 4, 11, 11, 14])) ['h', 'e', 'l', 'l', 'o'] The *iterable* is consumed lazily and can be infinite. The *indices* are consumed immediately and must be finite. Raises ``IndexError`` if an index lies beyond the iterable. Raises ``ValueError`` for negative indices. r z Indices must be non-negativer� r9 N) r� rx r r r� r� r r� r� r ) r� rD r� Zindex_and_positionr� Ziterator_positionZ next_to_emitr �orderZadvancerj r� r� r� ri � s0 � � ���ri )FrE r� rN r� )NNN)r� F)r� )NNF)r+ )r� FN)r� NFF)NFF)�r� r� � collectionsr r r r �collections.abcr � contextlibr � functoolsr r r r �heapqr r � itertoolsr r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' �queuer( r) r* r+ r, r- �operatorr. r/ r0 r1 r2 r3 r4 r5 �sysr6 r7 �timer8 Zrecipesr: r; r< r= r> r? r@ rA rB rC rD rE rF rG �__all__r� r� � ImportError�floatr� r� rR rl r} r� r� rZ rr rz r� r� r� r� ra r] rw r� r� r� r� rP r� rs ru rt rv rU r� r� r� r� r� r� r� r� r� r� rb r� r� r� r� r� rc r} r~ rL rJ rn �Hashabler� r[ r� r� r~ r r� r� r� ry r� rM rX r_ rI r� r� rh rT r� r� r� r� r� r� r� r� r ro rp r` rj r� r� r r r% r� rx � BaseExceptionrH rQ r� rK r� r� r� r� r� rV rW r� r\ rS r� r� re rf rg r� r� rY rm r� r� r� r{ rk r� r| rc r^ rq rd rn r� rO rN ri r� r� r� r� �<module> s0 D0 ( @x � # & 8 K > !: " `) B < = " , # &- - - % ( �I)3 5 '- U 0 .l 2*- " BI += Q 2% $( '# S (# ,."+9 2 8 ' *N �2* ! !
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings