관리-도구
편집 파일: more.cpython-312.pyc
� t��e�� � � � d dl Z d dlmZmZmZmZ d dlmZ d dlm Z m Z mZ d dlm Z mZmZmZ d dlmZmZmZmZmZmZmZmZmZmZmZmZ d dlmZm Z m!Z!m"Z" d dl#m$Z$m%Z% d d l&m&Z&m'Z'm(Z( d d l)m*Z*m+Z+m,Z,m-Z-m.Z. d dl/m0Z0m1Z1 d dl2m3Z3 d dl4m5Z5m6Z6m7Z7m8Z8m9Z9m:Z: g d�Z; e<� Z=dxd�Z>e=fd�Z?e=fd�Z@e=fd�ZA G d� d� ZBd� ZCd� ZDd� ZEd� ZFd� ZGdyd�ZHdzd�ZId{d�ZJd� ZKd|d �ZLd!� ZMdxd"�ZN G d#� d$� ZOd{d%�ZPd&� ZQd'� ZRdyd(�ZSd}d)�ZTdxd*�ZUd~d+�ZVdd,�ZWdd-�ZXdd.�ZYd/� ZZd�d0�Z[dzd1�Z\d2� Z]d�d3�Z^ G d4� d5e_� Z`d6� Zad7� Zbddd8�d9�Zcd�d;�Zdd<� Zed=� Zfegehffd>�Zid{d?�Zjd}d@�Zk G dA� dBej ej� � ZmdzdC�ZndD� ZoepdfdE�ZqdF� ZrdG� ZsdH� Zt G dI� dJ� ZudK� ZvdL� ZwdM� fdN�Zxe,fddO�dP�Zy G dQ� dRe� Zz G dS� dT� Z{ G dU� dV� Z|epfdW�Z}dX� Z~d:dY�ZdydZ�Z�epdfd[�Z�d|d\�Z�d]� Z�dzd^�Z� G d_� d`� Z�dyda�Z�db� Z�dc� Z�dd� Z�de� Z�df� Z�dg� Z�dzdh�Z�d�di�Z� G dj� dke�� Z� G dl� dm� Z�dn� Z�dzdo�Z�dp� Z�dq� Z�dr� Z�ds� Z�dt� Z�du� Z� G dv� dw� Z�y)�� N)�Counter�defaultdict�deque�abc)�Sequence)�partial�reduce�wraps)�merge�heapify�heapreplace�heappop)�chain�compress�count�cycle� dropwhile�groupby�islice�repeat�starmap� takewhile�tee�zip_longest)�exp� factorial�floor�log)�Empty�Queue)�random� randrange�uniform)� itemgetter�mul�sub�gt�lt)� hexversion�maxsize)� monotonic� )�consume�flatten�pairwise�powerset�take�unique_everseen)S�AbortThread�adjacent�always_iterable�always_reversible�bucket� callback_iter�chunked�circular_shifts�collapse�collate�consecutive_groups�consumer� countable�count_cycle� mark_ends� difference�distinct_combinations�distinct_permutations� distribute�divide� exactly_n� filter_except�first�groupby_transform�ilen�interleave_longest� interleave�intersperse�islice_extended�iterate�ichunked� is_sorted�last�locate�lstrip�make_decorator� map_except� map_reduce�nth_or_last�nth_permutation�nth_product� numeric_range�one�only�padded� partitions�set_partitions�peekable�repeat_last�replace�rlocate�rstrip� run_length�sample�seekable�SequenceView�side_effect�sliced� sort_together�split_at�split_after�split_before� split_when� split_into�spy�stagger�strip� substrings�substrings_indexes�time_limited�unique_to_each�unzip�windowed� with_iter�UnequalIterablesError� zip_equal� zip_offset�windowed_complete� all_unique�value_chain� product_index�combination_index�permutation_indexFc � ��� t t t �t | � � g � �|r��fd�}t |� � 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. c 3 �V �K � �D ] } t | � �k7 rt d� �| �� �! y �w)Nziterable is not divisible by n.��len� ValueError)�chunk�iterator�ns ����/builddir/build/BUILDROOT/alt-python312-setuptools-69.0.2-1.el8.x86_64/opt/alt/python312/lib/python3.12/site-packages/setuptools/_vendor/more_itertools/more.py�retzchunked.<locals>.ret� s2 �� �� �!� ���u�:��?�$�%F�G�G��� �� �&))�iterr r1 )�iterabler� �strictr� r� s ` @r� r9 r9 ~ s9 �� �&