File manager - Edit - /opt/saltstack/salt/lib/python3.10/site-packages/jaraco/__pycache__/collections.cpython-310.pyc
Back
o ;j�g � @ s d dl Z d dlZd dlZd dlZd dlZd dlZd dlZd dlZd dlm Z m Z m Z d dl m Z mZ d dlZee e e e jf Zdede fdd�ZG dd � d ejj �ZG d d � d e�Zd d � ZG dd� de�Zdd� Zedfdd�ZG dd� de�Z G dd� de �Z G dd� d�Z G dd � d �Z d d � Z G d d � d e�Z!G d!d"� d"e"ejj#�Z$G d#d$� d$e�Z%G d%d&� d&ejj ejj&�Z'G d'd(� d(e e%�Z(G d)d*� d*�Z)G d+d,� d,ej*�Z+G d-d.� d.�Z,G d/d0� d0�Z-d1d2� Z.G d3d4� d4ej/�Z0G d5d6� d6�Z1G d7d8� d8e�Z2dS )9� N)� Container�Iterable�Mapping)�Callable�Union�obj�returnc C s8 t | tj�r | jS t | t�st | t�st| �} | j} | S �N)� isinstance�re�Pattern� fullmatchr r �set� __contains__)r � r �F/opt/saltstack/salt/lib/python3.10/site-packages/jaraco/collections.py� _dispatch s r c @ sB e Zd ZdZdedefdd�Zdd� Zdd � Zd d � Z d d � Z dS )� ProjectionaT Project a set of keys over a mapping >>> sample = {'a': 1, 'b': 2, 'c': 3} >>> prj = Projection(['a', 'c', 'd'], sample) >>> dict(prj) {'a': 1, 'c': 3} Projection also accepts an iterable or callable or pattern. >>> iter_prj = Projection(iter('acd'), sample) >>> call_prj = Projection(lambda k: ord(k) in (97, 99, 100), sample) >>> pat_prj = Projection(re.compile(r'[acd]'), sample) >>> prj == iter_prj == call_prj == pat_prj True Keys should only appear if they were specified and exist in the space. Order is retained. >>> list(prj) ['a', 'c'] Attempting to access a key not in the projection results in a KeyError. >>> prj['b'] Traceback (most recent call last): ... KeyError: 'b' Use the projection to update another dict. >>> target = {'a': 2, 'b': 2} >>> target.update(prj) >>> target {'a': 1, 'b': 2, 'c': 3} Projection keeps a reference to the original dict, so modifying the original dict may modify the Projection. >>> del sample['a'] >>> dict(prj) {'c': 3} �keys�spacec C s t |�| _|| _d S r )r �_match�_space)�selfr r r r r �__init__M � zProjection.__init__c C s | � |�s t|��| j| S r )r �KeyErrorr �r �keyr r r � __getitem__Q s zProjection.__getitem__c C s t | j| j�S r )�filterr r �r r r r �_keys_resolvedV � zProjection._keys_resolvedc C s | � � S r )r! r r r r �__iter__Y s zProjection.__iter__c C s t t| �� ��S r )�len�tupler! r r r r �__len__\ � zProjection.__len__N) �__name__� __module__� __qualname__�__doc__� _Matchabler r r r! r# r& r r r r r s - r c � e Zd ZdZ� fdd�Z� ZS )� DictFiltera *Deprecated* Takes a dict and simulates a sub-dict based on a pattern. >>> sample = dict(a=1, b=2, c=3, d=4, ef=5) Filter for only single-character keys: >>> filtered = DictFilter(sample, include_pattern='.$') >>> filtered == dict(a=1, b=2, c=3, d=4) True >>> filtered['e'] Traceback (most recent call last): ... KeyError: 'e' >>> 'e' in filtered False Pattern is useful for excluding keys with a prefix. >>> filtered = DictFilter(sample, include_pattern=r'(?![ace])') >>> filtered == dict(b=2, d=4) True DictFilter keeps a reference to the original dict, so modifying the original dict may modify the filtered dict. >>> del sample['d'] >>> dict(filtered) {'b': 2} c s* t jdtdd� t� �t�|�j|� d S )Nz@DictFilter is deprecated. Pass re.Pattern to Projection instead.� )� stacklevel)�warnings�warn�DeprecationWarning�superr r �compile�match)r �dictZinclude_pattern�� __class__r r r � s �zDictFilter.__init__�r( r) r* r+ r � __classcell__r r r8 r r. ` s #r. c s t � fdd�|�� D ��S )a1 dict_map is much like the built-in function map. It takes a dictionary and applys a function to the values of that dictionary, returning a new dictionary with the mapped values in the original keys. >>> d = dict_map(lambda x:x+1, dict(a=1, b=2)) >>> d == dict(a=2,b=3) True c 3 s � | ] \}}|� |�fV qd S r r )�.0r �value��functionr r � <genexpr>� s � zdict_map.<locals>.<genexpr>)r7 �items)r? Z dictionaryr r> r �dict_map� s rB c @ s| e Zd ZdZi ejfdd�Zedd� �Zdd� Z dd d �Z d d � Z d d� Z e ddi �� ZG dd� de�Zed�Zed�ZdS )�RangeMapaP A dictionary-like object that uses the keys as bounds for a range. Inclusion of the value for that range is determined by the key_match_comparator, which defaults to less-than-or-equal. A value is returned for a key if it is the first key that matches in the sorted list of keys. One may supply keyword parameters to be passed to the sort function used to sort keys (i.e. key, reverse) as sort_params. Create a map that maps 1-3 -> 'a', 4-6 -> 'b' >>> r = RangeMap({3: 'a', 6: 'b'}) # boy, that was easy >>> r[1], r[2], r[3], r[4], r[5], r[6] ('a', 'a', 'a', 'b', 'b', 'b') Even float values should work so long as the comparison operator supports it. >>> r[4.5] 'b' Notice that the way rangemap is defined, it must be open-ended on one side. >>> r[0] 'a' >>> r[-1] 'a' One can close the open-end of the RangeMap by using undefined_value >>> r = RangeMap({0: RangeMap.undefined_value, 3: 'a', 6: 'b'}) >>> r[0] Traceback (most recent call last): ... KeyError: 0 One can get the first or last elements in the range by using RangeMap.Item >>> last_item = RangeMap.Item(-1) >>> r[last_item] 'b' .last_item is a shortcut for Item(-1) >>> r[RangeMap.last_item] 'b' Sometimes it's useful to find the bounds for a RangeMap >>> r.bounds() (0, 6) RangeMap supports .get(key, default) >>> r.get(0, 'not found') 'not found' >>> r.get(7, 'not found') 'not found' One often wishes to define the ranges by their left-most values, which requires use of sort params and a key_match_comparator. >>> r = RangeMap({1: 'a', 4: 'b'}, ... sort_params=dict(reverse=True), ... key_match_comparator=operator.ge) >>> r[1], r[2], r[3], r[4], r[5], r[6] ('a', 'a', 'a', 'b', 'b', 'b') That wasn't nearly as easy as before, so an alternate constructor is provided: >>> r = RangeMap.left({1: 'a', 4: 'b', 7: RangeMap.undefined_value}) >>> r[1], r[2], r[3], r[4], r[5], r[6] ('a', 'a', 'a', 'b', 'b', 'b') c C s t �| |� || _|| _d S r )r7 r � sort_paramsr6 )r �sourcerD �key_match_comparatorr r r r � s zRangeMap.__init__c C s | |t dd�tjd�S )NT)�reverse)rD rF )r7 �operator�ge)�clsrE r r r �left� s �z RangeMap.leftc C sb t | �� fi | j��}t|tj�r| �|| �}|S | �||�}t�| |�}|tj u r/t |��|S r ) �sortedr rD r rC �Itemr �_find_first_match_r7 �undefined_valuer )r �item� sorted_keys�resultr r r r r � s � zRangeMap.__getitem__Nc C �" z| | W S t y | Y S w )z� Return the value for key if key is in the dictionary, else default. If default is not given, it defaults to None, so that this method never raises a KeyError. �r )r r �defaultr r r �get s �z RangeMap.getc C s0 t �| j|�}tt||��}|r|d S t|���Nr )� functools�partialr6 �listr r )r r rP Zis_match�matchesr r r rN s zRangeMap._find_first_match_c C s* t | �� fi | j��}|tj |tj fS r )rL r rD rC � first_item� last_item)r rQ r r r �bounds s zRangeMap.boundsZRangeValueUndefinedr c @ s e Zd ZdZdS )z RangeMap.Itemz RangeMap ItemN)r( r) r* r+ r r r r rM s rM r ���r )r( r) r* r+ rH �ler � classmethodrK r rV rN r^ �typerO �intrM r\ r] r r r r rC � s P rC c C � | S r r )�xr r r � __identity! � rf Fc s � fdd�}t | �� ||d�S )a� Return the items of the dictionary sorted by the keys. >>> sample = dict(foo=20, bar=42, baz=10) >>> tuple(sorted_items(sample)) (('bar', 42), ('baz', 10), ('foo', 20)) >>> reverse_string = lambda s: ''.join(reversed(s)) >>> tuple(sorted_items(sample, key=reverse_string)) (('foo', 20), ('bar', 42), ('baz', 10)) >>> tuple(sorted_items(sample, reverse=True)) (('foo', 20), ('baz', 10), ('bar', 42)) c s � | d �S rW r )rP �r r r � pairkey_key6 � z!sorted_items.<locals>.pairkey_key)r rG )rL rA )�dr rG ri r rh r � sorted_items% s rl c s� e Zd ZdZedd� �Z� fdd�Z� fdd�Z� fdd �Z� fd d �Z � fd d �Z � fdd�Z � fdd�Z � fdd�Z dd� Z� ZS )�KeyTransformingDictz� A dict subclass that transforms the keys before they're used. Subclasses may override the default transform_key to customize behavior. c C rd r r rh r r r � transform_keyB s z!KeyTransformingDict.transform_keyc s8 t t| ��� t|i |��}|�� D ]}| j|� qd S r )r4 rm r r7 rA � __setitem__)r �argsZkargsrk rP r8 r r r F s �z KeyTransformingDict.__init__c s | � |�}tt| ��||� d S r )rn r4 rm ro )r r �valr8 r r ro N s z KeyTransformingDict.__setitem__c � | � |�}tt| ��|�S r )rn r4 rm r r r8 r r r R � z KeyTransformingDict.__getitem__c rr r )rn r4 rm r r r8 r r r V rs z KeyTransformingDict.__contains__c rr r )rn r4 rm � __delitem__r r8 r r rt Z rs z KeyTransformingDict.__delitem__c �( | � |�}tt| �j|g|�R i |��S r )rn r4 rm rV �r r rp �kwargsr8 r r rV ^ � zKeyTransformingDict.getc ru r )rn r4 rm � setdefaultrv r8 r r ry b rx z KeyTransformingDict.setdefaultc ru r )rn r4 rm �poprv r8 r r rz f rx zKeyTransformingDict.popc s4 zt � fdd�| �� D ��W S ty t� ��w )z� Given a key, return the actual key stored in self that matches. Raise KeyError if the key isn't found. c 3 s � | ] }|� kr|V qd S r r )r< Ze_keyrh r r r@ p � � z7KeyTransformingDict.matching_key_for.<locals>.<genexpr>)�nextr � StopIterationr r r rh r �matching_key_forj s �z$KeyTransformingDict.matching_key_for)r( r) r* r+ � staticmethodrn r ro r r rt rV ry rz r~ r; r r r8 r rm < s rm c @ s e Zd ZdZedd� �ZdS )�FoldedCaseKeyedDicta� A case-insensitive dictionary (keys are compared as insensitive if they are strings). >>> d = FoldedCaseKeyedDict() >>> d['heLlo'] = 'world' >>> list(d.keys()) == ['heLlo'] True >>> list(d.values()) == ['world'] True >>> d['hello'] == 'world' True >>> 'hello' in d True >>> 'HELLO' in d True >>> print(repr(FoldedCaseKeyedDict({'heLlo': 'world'}))) {'heLlo': 'world'} >>> d = FoldedCaseKeyedDict({'heLlo': 'world'}) >>> print(d['hello']) world >>> print(d['Hello']) world >>> list(d.keys()) ['heLlo'] >>> d = FoldedCaseKeyedDict({'heLlo': 'world', 'Hello': 'world'}) >>> list(d.values()) ['world'] >>> key, = d.keys() >>> key in ['heLlo', 'Hello'] True >>> del d['HELLO'] >>> d {} get should work >>> d['Sumthin'] = 'else' >>> d.get('SUMTHIN') 'else' >>> d.get('OTHER', 'thing') 'thing' >>> del d['sumthin'] setdefault should also work >>> d['This'] = 'that' >>> print(d.setdefault('this', 'other')) that >>> len(d) 1 >>> print(d['this']) that >>> print(d.setdefault('That', 'other')) other >>> print(d['THAT']) other Make it pop! >>> print(d.pop('THAT')) other To retrieve the key in its originally-supplied form, use matching_key_for >>> print(d.matching_key_for('this')) This >>> d.matching_key_for('missing') Traceback (most recent call last): ... KeyError: 'missing' c C s t j�| �S r )�jaraco�textZ FoldedCaserh r r r rn � s z!FoldedCaseKeyedDict.transform_keyN)r( r) r* r+ r rn r r r r r� u s Jr� c @ s e Zd ZdZdd� Zdd� ZdS )� DictAdapteraD Provide a getitem interface for attributes of an object. Let's say you want to get at the string.lowercase property in a formatted string. It's easy with DictAdapter. >>> import string >>> print("lowercase is %(ascii_lowercase)s" % DictAdapter(string)) lowercase is abcdefghijklmnopqrstuvwxyz c C � || _ d S r )�object)r Z wrapped_obr r r r � � zDictAdapter.__init__c C s t | j|�S r )�getattrr� )r �namer r r r � rj zDictAdapter.__getitem__N)r( r) r* r+ r r r r r r r� � s r� c r- )�ItemsAsAttributesa� Mix-in class to enable a mapping object to provide items as attributes. >>> C = type('C', (dict, ItemsAsAttributes), dict()) >>> i = C() >>> i['foo'] = 'bar' >>> i.foo 'bar' Natural attribute access takes precedence >>> i.foo = 'henry' >>> i.foo 'henry' But as you might expect, the mapping functionality is preserved. >>> i['foo'] 'bar' A normal attribute error should be raised if an attribute is requested that doesn't exist. >>> i.missing Traceback (most recent call last): ... AttributeError: 'C' object has no attribute 'missing' It also works on dicts that customize __getitem__ >>> missing_func = lambda self, key: 'missing item' >>> C = type( ... 'C', ... (dict, ItemsAsAttributes), ... dict(__missing__ = missing_func), ... ) >>> i = C() >>> i.missing 'missing item' >>> i.foo 'missing item' c s� z t tt| �|�W S ty@ } z+t� }dd� }|| ||�}||ur*|W Y d }~S |j\}|�d| jjd�}|f|_� d }~ww )Nc S rS r rT )Zcontr Zmissing_resultr r r � _safe_getitem s �z4ItemsAsAttributes.__getattr__.<locals>._safe_getitemr4 � ) r� r4 r� �AttributeErrorr� rp �replacer9 r( )r r �eZnovalr� rR �messager8 r r � __getattr__ s ��z ItemsAsAttributes.__getattr__)r( r) r* r+ r� r; r r r8 r r� � s ,r� c C s2 t dd� | �� D ��}t|�t| �kstd��|S )a� Given a dictionary, return another dictionary with keys and values switched. If any of the values resolve to the same key, raises a ValueError. >>> numbers = dict(a=1, b=2, c=3) >>> letters = invert_map(numbers) >>> letters[1] 'a' >>> numbers['d'] = 3 >>> invert_map(numbers) Traceback (most recent call last): ... ValueError: Key conflict in inverted mapping c s s � | ] \}}||fV qd S r r )r< �k�vr r r r@ . r{ z invert_map.<locals>.<genexpr>z Key conflict in inverted mapping)r7 rA r$ � ValueError)�map�resr r r � invert_map s r� c @ � e Zd ZdZdd� ZdS )�IdentityOverrideMapz� A dictionary that by default maps each key to itself, but otherwise acts like a normal dictionary. >>> d = IdentityOverrideMap() >>> d[42] 42 >>> d['speed'] = 'speedo' >>> print(d['speed']) speedo c C s |S r r r r r r � __missing__A rg z IdentityOverrideMap.__missing__N)r( r) r* r+ r� r r r r r� 4 s r� c @ sN e Zd ZdZdd� Zdd� ZejZdd� Z dd � Z d d � Z d d � Z dd� Z dS )� DictStacka A stack of dictionaries that behaves as a view on those dictionaries, giving preference to the last. >>> stack = DictStack([dict(a=1, c=2), dict(b=2, a=2)]) >>> stack['a'] 2 >>> stack['b'] 2 >>> stack['c'] 2 >>> len(stack) 3 >>> stack.push(dict(a=3)) >>> stack['a'] 3 >>> stack['a'] = 4 >>> set(stack.keys()) == set(['a', 'b', 'c']) True >>> set(stack.items()) == set([('a', 4), ('b', 2), ('c', 2)]) True >>> dict(**stack) == dict(stack) == dict(a=4, c=2, b=2) True >>> d = stack.pop() >>> stack['a'] 2 >>> d = stack.pop() >>> stack['a'] 1 >>> stack.get('b', None) >>> 'c' in stack True >>> del stack['c'] >>> dict(stack) {'a': 1} c C s( t �| �}tttj�dd� |D ����S )Nc s s � | ]}|� � V qd S r )r )r< �cr r r r@ m � � z%DictStack.__iter__.<locals>.<genexpr>)rZ r# �iterr � itertools�chain� from_iterable)r Zdictsr r r r# k rx zDictStack.__iter__c C s4 t tt�| ���D ] }||v r|| S q t|��r )�reversedr% rZ r# r )r r Zscoper r r r o s �zDictStack.__getitem__c C s t jj�| |�S r )� collections�abcr r �r �otherr r r r w r' zDictStack.__contains__c C s t tt| ���S r )r$ rZ r� r r r r r& z r' zDictStack.__len__c C s t �| d�}|�||�S �Nr_ )rZ r ro )r r rP �lastr r r ro } s zDictStack.__setitem__c C s t �| d�}|�|�S r� )rZ r rt )r r r� r r r rt � s zDictStack.__delitem__c O s t j| g|�R i |��S r )rZ rz �r rp rw r r r rz � s z DictStack.popN)r( r) r* r+ r# r rZ �append�pushr r& ro rt rz r r r r r� E s % r� c sT e Zd ZdZ� fdd�Z� fdd�Zdd� Z� fdd �Z� fd d �Zd d � Z � Z S )� BijectiveMapa� A Bijective Map (two-way mapping). Implemented as a simple dictionary of 2x the size, mapping values back to keys. Note, this implementation may be incomplete. If there's not a test for your use case below, it's likely to fail, so please test and send pull requests or patches for additional functionality needed. >>> m = BijectiveMap() >>> m['a'] = 'b' >>> m == {'a': 'b', 'b': 'a'} True >>> print(m['b']) a >>> m['c'] = 'd' >>> len(m) 2 Some weird things happen if you map an item to itself or overwrite a single key of a pair, so it's disallowed. >>> m['e'] = 'e' Traceback (most recent call last): ValueError: Key cannot map to itself >>> m['d'] = 'e' Traceback (most recent call last): ValueError: Key/Value pairs may not overlap >>> m['e'] = 'd' Traceback (most recent call last): ValueError: Key/Value pairs may not overlap >>> print(m.pop('d')) c >>> 'c' in m False >>> m = BijectiveMap(dict(a='b')) >>> len(m) 1 >>> print(m['b']) a >>> m = BijectiveMap() >>> m.update(a='b') >>> m['b'] 'a' >>> del m['b'] >>> len(m) 0 >>> 'a' in m False c s" t t| ��� | j|i |�� d S r )r4 r� r �updater� r8 r r r � s zBijectiveMap.__init__c sl ||krt d��|| v r| | |kp|| v o| | |k}|r"t d��tt| ��||� tt| ��||� d S )NzKey cannot map to itselfz Key/Value pairs may not overlap)r� r4 r� ro )r rP r= Zoverlapr8 r r ro � s � �zBijectiveMap.__setitem__c C s | � |� d S r )rz )r rP r r r rt � r" zBijectiveMap.__delitem__c s t t| ��� d S )Nr/ )r4 r� r& r r8 r r r& � � zBijectiveMap.__len__c s6 | | }t t| ��|� t t| �j|g|�R i |��S r )r4 r� rt rz )r r rp rw Zmirrorr8 r r rz � s zBijectiveMap.popc O s* t |i |��}|�� D ]}| j|� q d S r )r7 rA ro )r rp rw rk rP r r r r� � s �zBijectiveMap.update) r( r) r* r+ r ro rt r& rz r� r; r r r8 r r� � s = r� c sf e Zd ZdZdgZ� fdd�Zdd� Zdd� Zd d � Zd d � Z d d� Z dd� Z dd� Z dd� Z � ZS )� FrozenDicta� An immutable mapping. >>> a = FrozenDict(a=1, b=2) >>> b = FrozenDict(a=1, b=2) >>> a == b True >>> a == dict(a=1, b=2) True >>> dict(a=1, b=2) == a True >>> 'a' in a True >>> type(hash(a)) is type(0) True >>> set(iter(a)) == {'a', 'b'} True >>> len(a) 2 >>> a['a'] == a.get('a') == 1 True >>> a['c'] = 3 Traceback (most recent call last): ... TypeError: 'FrozenDict' object does not support item assignment >>> a.update(y=3) Traceback (most recent call last): ... AttributeError: 'FrozenDict' object has no attribute 'update' Copies should compare equal >>> copy.copy(a) == a True Copies should be the same type >>> isinstance(copy.copy(a), FrozenDict) True FrozenDict supplies .copy(), even though collections.abc.Mapping doesn't demand it. >>> a.copy() == a True >>> a.copy() is not a True Z__datac s$ t t| ��| �}t|i |��|_|S r )r4 r� �__new__r7 �_FrozenDict__data)rJ rp rw r r8 r r r� $ s zFrozenDict.__new__c C s || j v S r �r� r r r r r * r� zFrozenDict.__contains__c C s t tt| j�� ���S r )�hashr% rL r� rA r r r r �__hash__. s zFrozenDict.__hash__c C � t | j�S r )r� r� r r r r r# 2 r� zFrozenDict.__iter__c C r� r )r$ r� r r r r r& 5 r� zFrozenDict.__len__c C s | j | S r r� r r r r r 8 r� zFrozenDict.__getitem__c O s | j j|i |��S r )r� rV r� r r r rV < r� zFrozenDict.getc C s t |t�r|j}| j�|�S r )r r� r� �__eq__r� r r r r� @ s zFrozenDict.__eq__c C s t � | �S )z Return a shallow copy of self)�copyr r r r r� E s zFrozenDict.copy)r( r) r* r+ � __slots__r� r r� r# r& r rV r� r� r; r r r8 r r� � s 4 r� c s: e Zd ZdZd � fdd� Zedd� �Zedd� �Z� ZS ) � Enumerationa� A convenient way to provide enumerated values >>> e = Enumeration('a b c') >>> e['a'] 0 >>> e.a 0 >>> e[1] 'b' >>> set(e.names) == set('abc') True >>> set(e.codes) == set(range(3)) True >>> e.get('d') is None True Codes need not start with 0 >>> e = Enumeration('a b c', range(1, 4)) >>> e['a'] 1 >>> e[3] 'c' Nc s< t |t�r |�� }|d u rt�� }tt| ��t||�� d S r ) r �str�splitr� �countr4 r� r �zip)r �names�codesr8 r r r k s zEnumeration.__init__c C s dd� | D �S )Nc s s � | ] }t |t�r|V qd S r )r r� )r< r r r r r@ t s � z$Enumeration.names.<locals>.<genexpr>r r r r r r� r s zEnumeration.namesc s � fdd�� j D �S )Nc 3 s � | ]}� | V qd S r r )r< r� r r r r@ x r� z$Enumeration.codes.<locals>.<genexpr>)r� r r r r r� v s zEnumeration.codesr ) r( r) r* r+ r �propertyr� r� r; r r r8 r r� J s r� c @ r� )� Everythinga A collection "containing" every possible thing. >>> 'foo' in Everything() True >>> import random >>> random.randint(1, 999) in Everything() True >>> random.choice([None, 'foo', 42, ('a', 'b', 'c')]) in Everything() True c C � dS �NTr r� r r r r � rg zEverything.__contains__N)r( r) r* r+ r r r r r r� { s r� c r- )�InstrumentedDictaD Instrument an existing dictionary with additional functionality, but always reference and mutate the original dictionary. >>> orig = {'a': 1, 'b': 2} >>> inst = InstrumentedDict(orig) >>> inst['a'] 1 >>> inst['c'] = 3 >>> orig['c'] 3 >>> inst.keys() == orig.keys() True c s t � �� || _d S r )r4 r �data)r r� r8 r r r � r zInstrumentedDict.__init__r: r r r8 r r� � s r� c @ �( e Zd ZdZdd� ZeZdd� ZeZdS )�Leasta A value that is always lesser than any other >>> least = Least() >>> 3 < least False >>> 3 > least True >>> least < 3 True >>> least <= 3 True >>> least > 3 False >>> 'x' > least True >>> None > least True c C r� r� r r� r r r �__le__� rg z Least.__le__c C r� �NFr r� r r r �__ge__� rg z Least.__ge__N)r( r) r* r+ r� �__lt__r� �__gt__r r r r r� � � r� c @ r� )�Greatesta2 A value that is always greater than any other >>> greatest = Greatest() >>> 3 < greatest True >>> 3 > greatest False >>> greatest < 3 False >>> greatest > 3 True >>> greatest >= 3 True >>> 'x' > greatest False >>> None > greatest False c C r� r� r r� r r r r� � rg zGreatest.__ge__c C r� r� r r� r r r r� � rg zGreatest.__le__N)r( r) r* r+ r� r� r� r� r r r r r� � r� r� c C s | dd� g }| dd�< |S )z� Clear items in place and return a copy of items. >>> items = [1, 2, 3] >>> popped = pop_all(items) >>> popped is items False >>> popped [1, 2, 3] >>> items [] Nr )rA rR r r r �pop_all� s r� c �( e Zd ZdZ� fdd�Zdd� Z� ZS )�FreezableDefaultDicta! Often it is desirable to prevent the mutation of a default dict after its initial construction, such as to prevent mutation during iteration. >>> dd = FreezableDefaultDict(list) >>> dd[0].append('1') >>> dd.freeze() >>> dd[1] [] >>> len(dd) 1 c s t | dt� j�|�S )N�_frozen)r� r4 r� r r8 r r r� s z FreezableDefaultDict.__missing__c s � fdd�� _ d S )Nc s � � � S r )�default_factoryrh r r r �<lambda> s z-FreezableDefaultDict.freeze.<locals>.<lambda>)r� r r r r �freeze r� zFreezableDefaultDict.freeze)r( r) r* r+ r� r� r; r r r8 r r� � s r� c @ s e Zd Zddd�Zdd� ZdS )� Accumulatorr c C r� r �rq )r �initialr r r r r� zAccumulator.__init__c C s | j |7 _ | j S r r� )r rq r r r �__call__ s zAccumulator.__call__N)r )r( r) r* r r� r r r r r� s r� c r� )�WeightedLookupa� Given parameters suitable for a dict representing keys and a weighted proportion, return a RangeMap representing spans of values proportial to the weights: >>> even = WeightedLookup(a=1, b=1) [0, 1) -> a [1, 2) -> b >>> lk = WeightedLookup(a=1, b=2) [0, 1) -> a [1, 3) -> b >>> lk[.5] 'a' >>> lk[1.5] 'b' Adds ``.random()`` to select a random weighted value: >>> lk.random() in ['a', 'b'] True >>> choices = [lk.random() for x in range(1000)] Statistically speaking, choices should be .5 a:b >>> ratio = choices.count('a') / choices.count('b') >>> .4 < ratio < .6 True c s> t |i |��}tt� |�� �}t� jt||�� �tj d� d S )N)rF ) r7 r� r� �valuesr4 r r� r rH �lt)r rp rw �rawZindexesr8 r r r 7 s zWeightedLookup.__init__c C s | � � \}}t�� | }| | S r )r^ �random)r �lower�upper�selectorr r r r� > s zWeightedLookup.random)r( r) r* r+ r r� r; r r r8 r r� s !r� )3r rH �collections.abcr� r� r� rX r� r1 r r r �typingr r Z jaraco.textr� r r, r r� r r. rB r7 rC rf rl rm r� r� r� r� r� rZ �MutableMappingr� r� �Hashabler� r� r� �UserDictr� r� r� r� � defaultdictr� r� r� r r r r �<module> sL A- 9PFEc]1
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings