Mini Kabibi Habibi

Current Path : C:/Users/ITO/AppData/Local/Programs/GIMP 2/lib/python2.7/site-packages/
Upload File :
Current File : C:/Users/ITO/AppData/Local/Programs/GIMP 2/lib/python2.7/site-packages/ordered_set.pyo

�
{��]c@s�dZddlZddlmZyddlmZmZWn'ek
reddlmZmZnXe	d�ZdZd�Z
deefd��YZdS(	s�
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.
i����N(tdeque(t
MutableSettSequences3.1cCs-t|d�o,t|t�o,t|t�S(s

    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.
    t__iter__(thasattrt
isinstancetstrttuple(tobj((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytis_iterablest
OrderedSetcBseZdZdd�Zd�Zd�Zd�Zd�Zd�Z	d�Z
d�ZeZd	�Z
d
�ZeZeZd�Zd�Zd
�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Z d�Z!d�Z"RS(s�
    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])
    cCs/g|_i|_|dk	r+||O}ndS(N(titemstmaptNone(tselftiterable((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__init__4s		cCs
t|j�S(s�
        Returns the number of unique elements in the ordered set

        Example:
            >>> len(OrderedSet([]))
            0
            >>> len(OrderedSet([1, 2]))
            2
        (tlenR(R((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__len__:s
cCs�t|t�r%|tkr%|j�St|�rOg|D]}|j|^q8St|d�smt|t�r�|j|}t|t�r�|j|�S|Snt	d|��dS(sQ
        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
        t	__index__s+Don't know how to index an OrderedSet by %rN(
Rtslicet	SLICE_ALLtcopyR	RRtlistt	__class__t	TypeError(Rtindextitresult((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__getitem__Fs


cCs
|j|�S(s�
        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((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyRescCs$t|�dkrdSt|�SdS(Ni(N(RR
R(R((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__getstate__sscCs-|dkr|jg�n
|j|�dS(N(N(R
R(Rtstate((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__setstate__scCs
||jkS(s�
        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(Rtkey((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__contains__�s
cCsC||jkr8t|j�|j|<|jj|�n|j|S(sE
        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RRtappend(RR!((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytadd�scCsXd}y$x|D]}|j|�}qWWn'tk
rStdt|���nX|S(s<
        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])
        s(Argument needs to be an iterable, got %sN(R
R$Rt
ValueErrorttype(Rtsequencet
item_indextitem((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytupdate�s

cCs7t|�r,g|D]}|j|�^qS|j|S(sH
        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	RR(RR!tsubkey((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyR�s
 cCs=|jstd��n|jd}|jd=|j|=|S(s�
        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
        sSet is emptyi����(RtKeyErrorR(Rtelem((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytpop�s	


cCst||krp|j|}|j|=|j|=x@|jj�D],\}}||kr=|d|j|<q=q=WndS(s�
        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])
        iN(RR(RR!Rtktv((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytdiscard�s


cCs|j2|jj�dS(s8
        Remove all items from this OrderedSet.
        N(RRtclear(R((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyR2�scCs
t|j�S(sb
        Example:
            >>> list(iter(OrderedSet([1, 2, 3])))
            [1, 2, 3]
        (titerR(R((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyRscCs
t|j�S(sf
        Example:
            >>> list(reversed(OrderedSet([1, 2, 3])))
            [3, 2, 1]
        (treversedR(R((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__reversed__scCs1|sd|jjfSd|jjt|�fS(Ns%s()s%s(%r)(Rt__name__R(R((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__repr__scCsdt|ttf�r+t|�t|�kSyt|�}Wntk
rOtSXt|�|kSdS(s�
        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
        N(RRRRtsetRtFalse(Rtothertother_as_set((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__eq__s
cGsXt|t�r|jnt}tttj|g|��}tjj|�}||�S(s�
        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])
        (RR
RRRtittchaint
from_iterable(Rtsetstclst
containersR((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytunion6scCs
|j|�S(N(tintersection(RR:((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt__and__Iscset|t�r|jnt}|rUtjtt|����fd�|D�}n|}||�S(s�
        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])
        c3s!|]}|�kr|VqdS(N((t.0R)(tcommon(s3/mingw64/lib/python2.7/site-packages/ordered_set.pys	<genexpr>^s(RR
RR8RDR(RR@RAR((RGs3/mingw64/lib/python2.7/site-packages/ordered_set.pyRDMscsP|j}|r@tjtt|����fd�|D�}n|}||�S(s�
        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])
        c3s!|]}|�kr|VqdS(N((RFR)(R:(s3/mingw64/lib/python2.7/site-packages/ordered_set.pys	<genexpr>ts(RR8RCR(RR@RAR((R:s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt
differencecs	cs6t|�t��krtSt�fd�|D��S(s7
        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
        c3s|]}|�kVqdS(N((RFR)(R:(s3/mingw64/lib/python2.7/site-packages/ordered_set.pys	<genexpr>�s(RR9tall(RR:((R:s3/mingw64/lib/python2.7/site-packages/ordered_set.pytissubsetyscs6t��t|�krtSt�fd�|D��S(s=
        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
        c3s|]}|�kVqdS(N((RFR)(R(s3/mingw64/lib/python2.7/site-packages/ordered_set.pys	<genexpr>�s(RR9RI(RR:((Rs3/mingw64/lib/python2.7/site-packages/ordered_set.pyt
issuperset�scCsUt|t�r|jnt}||�j|�}||�j|�}|j|�S(s�
        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])
        (RR
RRHRC(RR:RAtdiff1tdiff2((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytsymmetric_difference�scCs&||_d�t|�D�|_dS(st
        Replace the 'items' list of this OrderedSet with a new one, updating
        self.map accordingly.
        cSsi|]\}}||�qS(((RFtidxR)((s3/mingw64/lib/python2.7/site-packages/ordered_set.pys
<dictcomp>�s	N(Rt	enumerateR(RR((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt
_update_items�s	cGs]t�}x|D]}|t|�O}qW|jg|jD]}||kr:|^q:�dS(s�
        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(R8RQR(RR@titems_to_removeR:R)((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytdifference_update�s	
cCs?t|�}|jg|jD]}||kr|^q�dS(s^
        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])
        N(R8RQR(RR:R)((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytintersection_update�scCshg|D]}||kr|^q}t|�}|jg|jD]}||krA|^qA|�dS(s�
        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])
        N(R8RQR(RR:R)titems_to_addRR((s3/mingw64/lib/python2.7/site-packages/ordered_set.pytsymmetric_difference_update�s%N(#R6t
__module__t__doc__R
RRRRRR R"R$R#R*Rtget_loctget_indexerR.R1R2RR5R7R<RCRERDRHRJRKRNRQRSRTRV(((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyR
*s@																										(RXt	itertoolsR=tcollectionsRtcollections.abcRRtImportErrorRR
Rt__version__R	R
(((s3/mingw64/lib/python2.7/site-packages/ordered_set.pyt<module>s