← Back
Editing: ordered_set.cpython-312.opt-1.pyc
� SSh; � � � d Z ddlZddlmZ ddlmZmZ e d� Z dZ d� Z G d� dee� Z y# e$ r ddlmZmZ Y �)w xY w) z� 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. � N)�deque)� MutableSet�Sequencez3.1c �f � t | d� xr$ t | t � xr t | 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)�objs �C/usr/lib/python3.12/site-packages/setuptools/_vendor/ordered_set.py� is_iterabler s7 � � ��Z� � '��3��$� $� '��3��&� &�� c �� � e Zd ZdZd d�Zd� Zd� Zd� Zd� Zd� Z d � Z d � Z e Z d � Z d � ZeZeZd � Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Zd� Z d� Z d� Z d� Z d � Z d � Z!d � Z"y) � OrderedSetz� An OrderedSet is a custom MutableSet that remembers its order, so that every entry has an index that can be looked up. Example: >>> OrderedSet([1, 1, 2, 3, 2]) OrderedSet([1, 2, 3]) Nc �0 � g | _ i | _ |�| |z } y y �N)�items�map)�self�iterables r �__init__zOrderedSet.__init__4 s% � ��� ���� � � �H� �D� r c �, � t | j � S )z� Returns the number of unique elements in the ordered set Example: >>> len(OrderedSet([])) 0 >>> len(OrderedSet([1, 2])) 2 )�lenr �r s r �__len__zOrderedSet.__len__: s � � �4�:�:�� r c �f � t |t � r|t k( r| j � S t |� r |D �cg c] }| j | �� c}S t |d� st |t � r2| j | }t |t � r| j |� S |S t d|z � �c c}w )aQ Get the item at a given index. If `index` is a slice, you will get back that slice of items, as a new OrderedSet. If `index` is a list or a similar iterable, you'll get a list of items corresponding to those indices. This is similar to NumPy's "fancy indexing". The result is not an OrderedSet because you may ask for duplicate indices, and the number of elements returned should be the number of elements asked for. Example: >>> oset = OrderedSet([1, 2, 3]) >>> oset[1] 2 � __index__z+Don't know how to index an OrderedSet by %r) r �slice� SLICE_ALL�copyr r r �list� __class__� TypeError)r �index�i�results r � __getitem__zOrderedSet.__getitem__F s� � �$ �e�U� #���(:��9�9�;� � �� �+0�1�5�a�D�J�J�q�M�5�1� 1� �U�K� (�J�u�e�,D��Z�Z��&�F��&�$�'��~�~�f�-�-� � �� I�E� Q�R� R�� 2s �B.c �$ � | j | � S )z� Return a shallow copy of this object. Example: >>> this = OrderedSet([1, 2, 3]) >>> other = this.copy() >>> this == other True >>> this is other False )r# r s r r! zOrderedSet.copye s � � �~�~�d�#�#r c �6 � t | � dk( ryt | � S )Nr r )r r" r s r � __getstate__zOrderedSet.__getstate__s s � � �t�9��>� ���:� r c �T � |dk( r| j g � y | j |� y )Nr )r )r �states r � __setstate__zOrderedSet.__setstate__ s" � � �G� � �M�M�"� � �M�M�%� r c � � || j v S )z� Test if the item is in this ordered set Example: >>> 1 in OrderedSet([1, 3, 2]) True >>> 5 in OrderedSet([1, 3, 2]) False )r �r �keys r � __contains__zOrderedSet.__contains__� s � � �d�h�h�� r c � � || j vr=t | j � | j |< | j j |� | j | S )aE 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. Example: >>> oset = OrderedSet() >>> oset.append(3) 0 >>> print(oset) OrderedSet([3]) )r r r �appendr0 s r �addzOrderedSet.add� sE � � �d�h�h� � �� � �O�D�H�H�S�M� �J�J� � �c� "��x�x��}� r c � � d} |D ] }| j |� }� |S # t $ r t dt |� z � �w xY w)a< Update the set with the given iterable sequence, then return the index of the last element inserted. Example: >>> oset = OrderedSet([1, 2, 3]) >>> oset.update([3, 1, 5, 1, 4]) 4 >>> print(oset) OrderedSet([1, 2, 3, 5, 4]) Nz(Argument needs to be an iterable, got %s)r5 r$ � ValueError�type)r �sequence� item_index�items r �updatezOrderedSet.update� sW � � � � � �� !�X�X�d�^� � !� ��� � � �:�T�(�^�K�� � �s � �!A c �~ � t |� r |D �cg c] }| j |� �� c}S | j | S c c}w )aH 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. Example: >>> oset = OrderedSet([1, 2, 3]) >>> oset.index(2) 1 )r r% r )r r1 �subkeys r r% zOrderedSet.index� s= � � �s� �58�9�S�6�D�J�J�v�&�S�9� 9��x�x��}� �� :s �:c � � | j s t d� �| j d }| j d= | j |= |S )z� Remove and return the last element from the set. Raises KeyError if the set is empty. Example: >>> oset = OrderedSet([1, 2, 3]) >>> oset.pop() 3 z Set is empty���)r �KeyErrorr )r �elems r �popzOrderedSet.pop� s> � � �z�z��>�*� *��z�z�"�~�� �J�J�r�N� �H�H�T�N�� r c �� � || v rd| j | }| j |= | j |= | j j � D ] \ }}||k\ s� |dz | j |< � yy)a� 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. Example: >>> oset = OrderedSet([1, 2, 3]) >>> oset.discard(2) >>> print(oset) OrderedSet([1, 3]) >>> oset.discard(2) >>> print(oset) OrderedSet([1, 3]) � N)r r )r r1 r& �k�vs r �discardzOrderedSet.discard� sd � � �$�;����� �A�� � �1� ����� � �����(���1���6�"#�a�%�D�H�H�Q�K� )� r c �V � | j dd�= | j j � y)z8 Remove all items from this OrderedSet. N)r r �clearr s r rJ zOrderedSet.clear� s � � �J�J�q�M� �����r c �, � t | j � S )zb Example: >>> list(iter(OrderedSet([1, 2, 3]))) [1, 2, 3] )�iterr r s r r zOrderedSet.__iter__ s � � �D�J�J� � r c �, � t | j � S )zf Example: >>> list(reversed(OrderedSet([1, 2, 3]))) [3, 2, 1] )�reversedr r s r � __reversed__zOrderedSet.__reversed__ s � � �� � �#�#r c � � | s| j j �d�S | j j �dt | � �d�S )Nz()�(�))r# �__name__r" r s r �__repr__zOrderedSet.__repr__ s1 � �� !�^�^� 4� 4�6� 6� �>�>�2�2�D��J�?�?r c � � t |t t f� rt | � t |� k( S t |� }t | � |k( S # t $ r Y yw xY w)a� Returns true if the containers have the same items. If `other` is a Sequence, then order is checked, otherwise it is ignored. Example: >>> oset = OrderedSet([1, 3, 2]) >>> oset == [1, 3, 2] True >>> oset == [1, 2, 3] False >>> oset == [2, 3] False >>> oset == OrderedSet([3, 2, 1]) False F)r r r r" �setr$ )r �other� other_as_sets r �__eq__zOrderedSet.__eq__ s[ � �$ �e�h�� .� /� ��:��e��,� ,� -� �u�:�L� �t�9� �,� ,�� � �� �s � A � A�Ac �� � t | t � r | j nt }t t t j | g|� � }t j j |� } ||� S )a� Combines all unique items. Each items order is defined by its first appearance. Example: >>> oset = OrderedSet.union(OrderedSet([3, 1, 4, 1, 5]), [1, 3], [2, 0]) >>> print(oset) OrderedSet([3, 1, 4, 5, 2, 0]) >>> oset.union([8, 9]) OrderedSet([3, 1, 4, 5, 2, 0, 8, 9]) >>> oset | {10} OrderedSet([3, 1, 4, 5, 2, 0, 10]) )r r r# r r" �it�chain� from_iterable)r �sets�cls� containersr s r �unionzOrderedSet.union6 sO � � !+�4�� <�d�n�n�*����r�x�x���� 5�6� ����&�&�z�2���5�z�r c �$ � | j |� S r )� intersection�r rW s r �__and__zOrderedSet.__and__I s � �� � ��'�'r c � �� t | t � r | j nt }|r,t j t t |� � ��fd�| D � }n| } ||� S )a� Returns elements in common between all sets. Order is defined only by the first set. Example: >>> oset = OrderedSet.intersection(OrderedSet([0, 1, 2, 3]), [1, 2, 3]) >>> print(oset) OrderedSet([1, 2, 3]) >>> oset.intersection([2, 4, 5], [1, 2, 3, 4]) OrderedSet([2]) >>> oset.intersection() OrderedSet([1, 2, 3]) c 3 �, �K � | ] }|�v s�|�� � y �wr � )�.0r; �commons �r � <genexpr>z*OrderedSet.intersection.<locals>.<genexpr>^ s �� �� �=�d�d�d�f�n�T�d�� � �)r r r# rV rc r )r r^ r_ r rj s @r rc zOrderedSet.intersectionM sK �� � !+�4�� <�d�n�n�*�� ��%�%�s�3��~�6�F�=�d�=�E��E��5�z�r c � �� | j }|r,t j t t |� � ��fd�| D � }n| } ||� S )a� Returns all elements that are in this set but not the others. Example: >>> OrderedSet([1, 2, 3]).difference(OrderedSet([2])) OrderedSet([1, 3]) >>> OrderedSet([1, 2, 3]).difference(OrderedSet([2]), OrderedSet([3])) OrderedSet([1]) >>> OrderedSet([1, 2, 3]) - OrderedSet([2]) OrderedSet([1, 3]) >>> OrderedSet([1, 2, 3]).difference() OrderedSet([1, 2, 3]) c 3 �, �K � | ] }|�vs�|�� � y �wr rh �ri r; rW s �r rk z(OrderedSet.difference.<locals>.<genexpr>t s �� �� �@�d�d�d�%�.?�T�d�rl )r# rV ra r )r r^ r_ r rW s @r � differencezOrderedSet.differencec s> �� � �n�n�� ��I�I�s�3��~�.�E�@�d�@�E��E��5�z�r c �\ �� t | � t �� kD ryt �fd�| D � � S )a7 Report whether another set contains this set. Example: >>> OrderedSet([1, 2, 3]).issubset({1, 2}) False >>> OrderedSet([1, 2, 3]).issubset({1, 2, 3, 4}) True >>> OrderedSet([1, 2, 3]).issubset({1, 4, 3, 5}) False Fc 3 �& �K � | ] }|�v �� � y �wr rh ro s �r rk z&OrderedSet.issubset.<locals>.<genexpr>� s �� �� �2�T�T�4�5�=�T�� ��r �allrd s `r �issubsetzOrderedSet.issubsety s) �� � �t�9�s�5�z� !���2�T�2�2�2r c �\ � � t � � t |� k ryt � fd�|D � � S )a= Report whether this set contains another set. Example: >>> OrderedSet([1, 2]).issuperset([1, 2, 3]) False >>> OrderedSet([1, 2, 3, 4]).issuperset({1, 2, 3}) True >>> OrderedSet([1, 4, 3, 5]).issuperset({1, 2, 3}) False Fc 3 �& �K � | ] }|�v �� � y �wr rh )ri r; r s �r rk z(OrderedSet.issuperset.<locals>.<genexpr>� s �� �� �2�E�D�4�4�<�E�rs rt rd s ` r � issupersetzOrderedSet.issuperset� s) �� � �t�9�s�5�z� !���2�E�2�2�2r c �� � t | t � r | j nt } || � j |� } ||� j | � }|j |� S )a� Return the symmetric difference of two OrderedSets as a new set. That is, the new set will contain all elements that are in exactly one of the sets. Their order will be preserved, with elements from `self` preceding elements from `other`. Example: >>> this = OrderedSet([1, 4, 3, 5, 7]) >>> other = OrderedSet([9, 7, 1, 3, 2]) >>> this.symmetric_difference(other) OrderedSet([4, 5, 9, 2]) )r r r# rp ra )r rW r_ �diff1�diff2s r �symmetric_differencez OrderedSet.symmetric_difference� sO � � !+�4�� <�d�n�n�*���D� �$�$�U�+���E� �%�%�d�+���{�{�5�!�!r c �f � || _ t |� D ��ci c] \ }}||�� c}}| _ yc c}}w )zt Replace the 'items' list of this OrderedSet with a new one, updating self.map accordingly. N)r � enumerater )r r �idxr; s r � _update_itemszOrderedSet._update_items� s3 � � �� �1:�5�1A�B�1A�+�3��D�#�I�1A�B����Bs � -c � � t � }|D ] }|t |� z }� | j | j D �cg c] }||vs�|�� c}� yc c}w )a� Update this OrderedSet to remove items from one or more other sets. Example: >>> this = OrderedSet([1, 2, 3]) >>> this.difference_update(OrderedSet([2, 4])) >>> print(this) OrderedSet([1, 3]) >>> this = OrderedSet([1, 2, 3, 4, 5]) >>> this.difference_update(OrderedSet([2, 4]), OrderedSet([1, 4, 6])) >>> print(this) OrderedSet([3, 5]) N�rV r� r )r r^ �items_to_removerW r; s r �difference_updatez OrderedSet.difference_update� sN � � �%���E� �s�5�z� )�O� � ���T�Z�Z�W�Z�T�4��;V�D�Z�W�X��Ws � A�Ac � � t |� }| j | j D �cg c] }||v s�|�� c}� yc c}w )a^ Update this OrderedSet to keep only items in another set, preserving their order in this set. Example: >>> this = OrderedSet([1, 4, 3, 5, 7]) >>> other = OrderedSet([9, 7, 1, 3, 2]) >>> this.intersection_update(other) >>> print(this) OrderedSet([1, 3, 7]) Nr� )r rW r; s r �intersection_updatez OrderedSet.intersection_update� s7 � � �E� �� ���T�Z�Z�I�Z�T�4�5�=�D�Z�I�J��Is � ;�;c � � |D �cg c] }|| vs�|�� }}t |� }| j | j D �cg c] }||vs�|�� c}|z � yc c}w c c}w )a� Update this OrderedSet to remove items from another set, then add items from the other set that were not present in this set. Example: >>> this = OrderedSet([1, 4, 3, 5, 7]) >>> other = OrderedSet([9, 7, 1, 3, 2]) >>> this.symmetric_difference_update(other) >>> print(this) OrderedSet([4, 5, 9, 2]) Nr� )r rW r; � items_to_addr� s r �symmetric_difference_updatez&OrderedSet.symmetric_difference_update� sd � � */�C���$�d�2B��� �C� �e�*�� ��� "�j�j� H�j�d�D��,G�T�j� H�<� W� �� D�� Is � A�A� A�Ar )#rS � __module__� __qualname__�__doc__r r r( r! r+ r. r2 r5 r4 r< r% �get_loc� get_indexerrC rH rJ r rO rT rY ra re rc rp rv ry r} r� r� r� r� rh r r r r * s� � �� � � S�> $� �!� � �& �F��, �$ �G��K��&(�0� �$�@� -�<�&(��,�,3� 3� "�(C�Y�( K� r r )r� � itertoolsr[ � collectionsr �collections.abcr r � ImportErrorr r � __version__r r rh r r �<module>r� sV ��� � �1�4� �$�K� �� ��(~ ��X� ~ ��9 � 1�0�0�1�s �0 � A �A
Save File
Cancel