HEX

File: //opt/saltstack/salt/lib/python3.10/site-packages/salt/utils/__pycache__/oset.cpython-310.pyc
o

�N�gj�@s8dZddlmZed�ZdZdd�ZGdd�de�ZdS)	a�

Available at repository https://github.com/LuminosoInsight/ordered-set

    salt.utils.oset
    ~~~~~~~~~~~~~~~~

An OrderedSet is a custom MutableSet that remembers its order, so that every
entry has an index that can be looked up.

Based on a recipe originally posted to ActiveState Recipes by Raymond Hettiger,
and released under the MIT license.

Rob Speer's changes are as follows:

    - changed the content from a doubly-linked list to a regular Python list.
      Seriously, who wants O(1) deletes but O(N) lookups by index?
    - add() returns the index of the added item
    - index() just returns the index of an item
    - added a __getstate__ and __setstate__ so it can be pickled
    - added __getitem__
�)�
MutableSetNz2.0.1cCs"t|d�ot|t�ot|t�S)a

    Are we being asked to look up a list of things, instead of a single thing?
    We check for the `__iter__` attribute so that this can cover types that
    don't have to be known by this module, such as NumPy arrays.

    Strings, however, should be considered as atomic values to look up, not
    iterables. The same goes for tuples, since they are immutable and therefore
    valid entries.

    We don't need to check for the Python 2 `unicode` type, because it doesn't
    have an `__iter__` attribute anyway.
    �__iter__)�hasattr�
isinstance�str�tuple)�obj�r	�C/opt/saltstack/salt/lib/python3.10/site-packages/salt/utils/oset.py�is_iterables


�
�rc@s�eZdZdZd%dd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�ZeZdd�Z
dd�Zdd�Zdd�Zdd�Zdd�Zdd �Zd!d"�Zd#d$�ZdS)&�
OrderedSetz�
    An OrderedSet is a custom MutableSet that remembers its order, so that
    every entry has an index that can be looked up.
    NcCs$g|_i|_|dur||O}dSdS�N)�items�map)�self�iterabler	r	r
�__init__8s
�zOrderedSet.__init__cC�
t|j�Sr
)�lenr�rr	r	r
�__len__>�
zOrderedSet.__len__csp|tkr�St|d�st|t�r �j|}t|t�rt|�S|St|�r/t�fdd�|D��Stdt	|�����)a�
        Get the item at a given index.

        If `index` is a slice, you will get back that slice of items. If it's
        the slice [:], exactly the same object is returned. (If you want an
        independent copy of an OrderedSet, use `OrderedSet.copy()`.)

        If `index` is an iterable, you'll get the OrderedSet of items
        corresponding to those indices. This is similar to NumPy's
        "fancy indexing".
        �	__index__csg|]}�j|�qSr	)r)�.0�irr	r
�
<listcomp>V�z*OrderedSet.__getitem__.<locals>.<listcomp>z)Don't know how to index an OrderedSet by )
�	SLICE_ALLrr�slicer�listrr�	TypeError�repr)r�index�resultr	rr
�__getitem__As

zOrderedSet.__getitem__cCst|�Sr
)rrr	r	r
�copyZszOrderedSet.copycCs|jsdSt|�S�Nr
)rrrr	r	r
�__getstate__]szOrderedSet.__getstate__cCs$|dkr|�g�dS|�|�dSr&)r)r�stater	r	r
�__setstate__iszOrderedSet.__setstate__cCs
||jvSr
)r�r�keyr	r	r
�__contains__orzOrderedSet.__contains__cCs0||jvrt|j�|j|<|j�|�|j|S)z�
        Add `key` as an item to this OrderedSet, then return its index.

        If `key` is already in the OrderedSet, return the index it already
        had.
        )rrr�appendr*r	r	r
�addrs

zOrderedSet.addcCs@d}z
|D]}|�|�}qW|Stytdt|�����w)z~
        Update the set with the given iterable sequence, then return the index
        of the last element inserted.
        Nz&Argument needs to be an iterable, got )r.r �
ValueError�type)rZsequenceZ
item_index�itemr	r	r
�update�s���zOrderedSet.updatecs$t|�r
�fdd�|D�S�j|S)z�
        Get the index of a given entry, raising an IndexError if it's not
        present.

        `key` can be an iterable of entries that is not a string, in which case
        this returns a list of indices.
        csg|]}��|��qSr	)r")rZsubkeyrr	r
r�rz$OrderedSet.index.<locals>.<listcomp>)rrr*r	rr
r"�s
zOrderedSet.indexcCs,|jstd��|jd}|jd=|j|=|S)zp
        Remove and return the last element from the set.

        Raises KeyError if the set is empty.
        zSet is empty���)r�KeyErrorr)r�elemr	r	r
�pop�s
zOrderedSet.popcCsT||vr&|j|}|j|=|j|=|j��D]\}}||kr%|d|j|<qdSdS)z�
        Remove an element.  Do not raise an exception if absent.

        The MutableSet mixin uses this to implement the .remove() method, which
        *does* raise an error when asked to remove a non-existent item.
        �N)rr)rr+r�k�vr	r	r
�discard�s
��zOrderedSet.discardcCs|jdd�=|j��dS)z8
        Remove all items from this OrderedSet.
        N)rr�clearrr	r	r
r;�szOrderedSet.clearcCrr
)�iterrrr	r	r
r�rzOrderedSet.__iter__cCrr
)�reversedrrr	r	r
�__reversed__�rzOrderedSet.__reversed__cCs.|s	|jj�d�S|jj�dtt|���d�S)Nz()�(�))�	__class__�__name__r!rrr	r	r
�__repr__�szOrderedSet.__repr__cCsTt|t�rt|�t|�ko|j|jkSzt|�}Wn
ty#YdSwt|�|kS)NF)rrrr�setr )r�otherZother_as_setr	r	r
�__eq__�s
�zOrderedSet.__eq__r
)rB�
__module__�__qualname__�__doc__rrr$r%r'r)r,r.r-r2r"r6r:r;rr>rCrFr	r	r	r
r2s(

r)rI�collections.abcrrr�__version__rrr	r	r	r
�<module>s