관리-도구
편집 파일: more.cpython-312.pyc
� t��e@ � �$ � d dl Z d dlmZmZmZmZ d dlmZ d dlm Z m Z mZ d dlm Z mZmZ d dlmZmZmZmZmZmZmZmZmZmZmZmZ d dlmZmZm 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-m.Z.m/Z/ d dl0m1Z1m2Z2 d dl3m4Z4 d dl5m6Z6m7Z7m8Z8m9Z9m:Z:m;Z;m<Z<m=Z=m>Z>m?Z? g d�Z@d�d�ZAe6fd�ZBe6fd�ZCe6fd�ZD G d� d� ZEd� ZFd� ZGd� ZHd� ZId�d�ZJd� ZKd�d�ZLd�d�ZMd�d�ZNd � ZOd�d!�ZPd"� ZQd�d#�ZR G d$� d%� ZSd�d&�ZTd'� ZUd(� ZVd�d)�ZWd�d*�ZXd�d+�ZYd�d,�ZZd�d-�Z[d�d.�Z\d�d/�Z]d�d0�Z^d1� Z_d�d2�Z`d�d3�Zad�d4�Zbd5� Zcd�d6�Zdd7� Zeddd8�d9�Zfd�d;�Zgd<� Zhd=� Ziejekffd>�Zld�d?�Zmd�d@�Zn G dA� dBej ej� � Zpd�dC�ZqdD� ZresdfdE�ZtdF� ZudG� ZvdH� ZwdI� Zx G dJ� dK� ZydL� ZzdM� Z{dN� fdO�Z|e+fddP�dQ�Z} G dR� dSe� Z~ G dT� dU� Z G dV� dW� Z�esfdX�Z�dY� Z�d:dZ�Z�d�d[�Z�esdfd\�Z�d�d]�Z�d^� Z�d�d_�Z� G d`� da� Z�d�db�Z� G dc� dd� Z�de� Z�df� Z�dg� Z�dh� Z�di� Z�dj� fdk�Z�dl� Z�dm� Z�d�dn�Z�d�do�Z� G dp� dqe�� Z� G dr� ds� Z�dt� Z�d�du�Z�dv� Z�dw� Z�dx� Z�dy� Z�dz� Z�d{� Z� G d|� d}� Z�d~� Z�d� Z�d�� Z�ejekfdd��d��Z�d�d��Z�d�d��Z�d�d��Z�de6d��d��Z�de�d�fd��Z�d�� Z�y)�� N)�Counter�defaultdict�deque�abc)�Sequence)�partial�reduce�wraps)�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�ge�le)� hexversion�maxsize)� monotonic� ) �_marker� _zip_equal�UnequalIterablesError�consume�flatten�pairwise�powerset�take�unique_everseen� all_equal)a�AbortThread�SequenceViewr0 �adjacent� all_unique�always_iterable�always_reversible�bucket� callback_iter�chunked�chunked_even�circular_shifts�collapse�combination_index�consecutive_groups�constrained_batches�consumer�count_cycle� countable� difference�distinct_combinations�distinct_permutations� distribute�divide�duplicates_everseen�duplicates_justseen� exactly_n� filter_except�first�gray_product�groupby_transform�ichunked�iequals�ilen� interleave�interleave_evenly�interleave_longest�intersperse� is_sorted�islice_extended�iterate�last�locate�longest_common_prefix�lstrip�make_decorator� map_except�map_if� map_reduce� mark_ends�minmax�nth_or_last�nth_permutation�nth_product� numeric_range�one�only�padded� partitions�peekable�permutation_index� product_index�raise_�repeat_each�repeat_last�replace�rlocate�rstrip� run_length�sample�seekable�set_partitions�side_effect�sliced� sort_together�split_after�split_at�split_before� split_into� split_when�spy�stagger�strip� strictly_n� substrings�substrings_indexes�time_limited�unique_in_window�unique_to_each�unzip�value_chain�windowed�windowed_complete� with_iter� zip_broadcast� zip_equal� zip_offsetFc � ��� t t t �t | � � g � �|r#��t d� ���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. z*n must not be None when using strict mode.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/pkg_resources/_vendor/more_itertools/more.py�retzchunked.<locals>.ret� s2 �� �� �!� ���u�:��?�$�%F�G�G��� �� �&))�iterr r5 r� )�iterabler� �strictr� r� s ` @r� r@ r@ � sJ �� �&