Current File : //proc/thread-self/root/proc/3522530/root/lib/python2.7/site-packages/salt/utils/odict.pyo
�
���^c @@ sR d Z d d l m Z m Z m Z y d d l m Z Wn! e k
rY d d l m Z n Xd d l m
Z
y) d d l Z d e j f d � � YZ Wn� e e f k
r7y) d d l
Z
d e
j f d � � YZ Wq8e k
r3y d d l m Z Wn! e k
rd d l m Z n Xd e f d
� � YZ q8Xn Xd e f d � � YZ d S(
u�
:codeauthor: Pedro Algarvio (pedro@algarvio.me)
salt.utils.odict
~~~~~~~~~~~~~~~~
This is a compatibility/"importability" layer for an ordered dictionary.
Tries to import from the standard library if python >= 2.7, then from the
``ordereddict`` package available from PyPi, and, as a last resort,
provides an ``OrderedDict`` implementation based on::
http://code.activestate.com/recipes/576669/
It also implements a DefaultOrderedDict Class that serves as a
combination of ``OrderedDict`` and ``defaultdict``
It's source was submitted here::
http://stackoverflow.com/questions/6190331/
i ( t absolute_importt unicode_literalst print_function( t Callable( t sixNt OrderedDictc B@ s e Z d Z RS( N( t __name__t
__module__t Nonet __hash__( ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR % s c B@ s e Z d Z RS( N( R R R t _OrderedDict__hash_( ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR + s ( t get_identc B@ s
e Z d Z d Z d � Z e j d � Z e j d � Z d � Z d � Z
d � Z e d � Z
d � Z d � Z d
� Z d � Z d � Z d
� Z d � Z e Z e � Z e d � Z d d � Z i d � Z d � Z d � Z e d d � � Z d � Z d � Z RS( u) Dictionary that remembers insertion orderc O@ s� t t | � j � t | � d k rC t d j t | � � � � n y | j Wn7 t k
r� g | _ } | | d g | (i | _ n X| j
| | � d S( u� Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
i u% expected at most 1 arguments, got {0}N( t superR t __init__t lent TypeErrort formatt _OrderedDict__roott AttributeErrorR t _OrderedDict__mapt _OrderedDict__update( t selft argst kwdst root( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR
K s
c C@ s\ | | k rH | j } | d } | | | g | d <| d <| j | <n | | | | � d S( u! od.__setitem__(i, y) <==> od[i]=yi i N( R R ( R t keyt valuet dict_setitemR t last( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt __setitem__^ s
)c C@ s@ | | | � | j j | � \ } } } | | d <| | d <d S( u od.__delitem__(y) <==> del od[y]i i N( R t pop( R R t dict_delitemt link_prevt link_next( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt __delitem__h s
c c@ s= | j } | d } x# | | k r8 | d V| d } q Wd S( u od.__iter__() <==> iter(od)i i N( R ( R R t curr( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt __iter__q s
c c@ s= | j } | d } x# | | k r8 | d V| d } q Wd S( u# od.__reversed__() <==> reversed(od)i i N( R ( R R R# ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt __reversed__y s
c C@ sp yK x t j | j � D]
} | 2q W| j } | | d g | (| j j � Wn t k
r^ n Xt j | � d S( u. od.clear() -> None. Remove all items from od.N( R t
itervaluesR R R t clearR t dict( R t nodeR ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR' � s
c C@ s� | s t d � � n | j } | rO | d } | d } | | d <| | d <n( | d } | d } | | d <| | d <| d } | j | =t j | | � } | | f S( u� od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
u dictionary is emptyi i i ( t KeyErrorR R R( R ( R R R t linkR R! R R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt popitem� s
c C@ s
t | � S( u od.keys() -> list of keys in od( t list( R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt keys� s c C@ s g | D] } | | ^ q S( u# od.values() -> list of values in od( ( R R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt values� s c C@ s! g | D] } | | | f ^ q S( u. od.items() -> list of (key, value) pairs in od( ( R R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt items� s c C@ s
t | � S( u0 od.iterkeys() -> an iterator over the keys in od( t iter( R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt iterkeys� s c c@ s x | D] } | | Vq Wd S( u2 od.itervalues -> an iterator over the values in odN( ( R t k( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR& � s
c c@ s$ x | D] } | | | f Vq Wd S( u= od.iteritems -> an iterator over the (key, value) items in odN( ( R R3 ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt iteritems� s
c O@ s% t | � d k r0 t d j t | � � � � n | sE t d � � n | d } d } t | � d k rt | d } n t | t � r� xq | D] } | | | | <q� WnR t | d � r� x@ | D] } | | | | <q� Wn! x | D] \ } } | | | <q� Wx' t j | � D] \ } } | | | <qWd S( u� od.update(E, **F) -> None. Update od from dict/iterable E and F.
If E is a dict instance, does: for k in E: od[k] = E[k]
If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
Or if E is an iterable of items, does: for k, v in E: od[k] = v
In either case, this is followed by: for k, v in F.items(): od[k] = v
i u9 update() takes at most 2 positional arguments ({0} given)u, update() takes at least 1 argument (0 given)i i u keysN( ( R R R t
isinstanceR( t hasattrR R4 ( R R R t otherR R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt update� s(
c C@ sC | | k r! | | } | | =| S| | j k r? t | � � n | S( u� od.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
( t _OrderedDict__markerR* ( R R t defaultt result( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR � s
c C@ s" | | k r | | S| | | <| S( uD od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od( ( R R R: ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt
setdefault� s
c C@ s} t | � t � f } | | k r% d Sd | | <z? | sK d j | j j � Sd j | j j t | j � � � SWd | | =Xd S( u od.__repr__() <==> repr(od)u ...i u {0}()u
{0}('{1}')N( t idt
_get_identR t __class__R R- R0 ( R t
_repr_runningt call_key( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt __repr__� s
&c C@ s� g | D] } | | | g ^ q } t | � j � } x' t t � � D] } | j | d � qE W| rx | j | f | f S| j | f f S( u% Return state information for picklingN( t varst copyR R R R? ( R R3 R0 t inst_dict( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt
__reduce__ s #c C@ s
| j | � S( u! od.copy() -> a shallow copy of od( R? ( R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRD s c C@ s( | � } x | D] } | | | <q W| S( u� OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
( ( t clst iterableR t dR ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt fromkeys s
c C@ sM t | t � r= t | � t | � k o< | j � | j � k St j | | � S( u� od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
( R5 R R R0 R( t __eq__( R R7 ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRK s .c C@ s | | k S( N( ( R R7 ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt __ne__( s N(! R R t __doc__R R
R
R( R R" R$ R% R' t TrueR, R. R/ R0 R2 R& R4 R8 R t objectR9 R R< RB RF RD t classmethodRJ RK RL ( ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR > s6
!
t DefaultOrderedDictc B@ s\ e Z d Z d d � Z d � Z d � Z d � Z d � Z d � Z d � Z
i d � Z RS(
u. Dictionary that remembers insertion order and c O@ sQ | d k r+ t | t � r+ t d � � n t t | � j | | � | | _ d S( Nu first argument must be callable( R R5 R R R RQ R
t default_factory( R RR t at kw( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyR
= s
c C@ s6 y t j | | � SWn t k
r1 | j | � SXd S( N( R t __getitem__R* t __missing__( R R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRU D s
c C@ s6 | j d k r t | � � n | j � | | <} | S( N( RR R R* ( R R R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRV J s c C@ sF | j d k r t � } n | j f } t | � | d d | j � f S( N( RR R t tuplet typeR0 ( R R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRF P s c C@ s
| j � S( N( t __copy__( R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRD W s c C@ s t | � | j | � S( N( RX RR ( R ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRY Z s c C@ s1 d d l } t | � | j | j | j � � � S( Ni ( RD RX RR t deepcopyR0 ( R RD ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt __deepcopy__] s c C@ s" d j | j t t | � j � � S( Nu DefaultOrderedDict({0}, {1})( R RR R RQ RB ( R R@ ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRB b s N( R R RM R R
RU RV RF RD RY R[ RB ( ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyRQ ; s ( RM t
__future__R R R t collections.abcR t ImportErrort collectionst salt.extR R R t ordereddictt salt.ext.six.moves._threadR R> t salt.ext.six.moves._dummy_threadR( RQ ( ( ( s4 /usr/lib/python2.7/site-packages/salt/utils/odict.pyt <module> s(
�
Mini Shell