Repository URL to install this package:
Version:
4.0.109 ▾
|
contego
/
home
/
tvault
/
.virtenv
/
lib
/
python2.7
/
site-packages
/
functools32
/
functools32.pyc
|
---|
ó ʓEYc @ s> d Z d d d d d d d d d g Z d d l m Z m Z d d l m Z m Z d d l m Z d d l m Z d d l Z y d d l m Z Wn! e k r¶ d d l m Z n Xd e f d YZ d e f d YZ d" Z d# Z e e d Z e e d Z d Z d Z e d d Z d d! Z d S($ sE functools.py - Tools for working with functions and callable objects t update_wrappert wrapst WRAPPER_ASSIGNMENTSt WRAPPER_UPDATESt total_orderingt cmp_to_keyt lru_cachet reducet partialiÿÿÿÿ( R R ( t MutableMappingt namedtuplei ( t recursive_repr( t proxyN( t allocate_lockt _Linkc B s e Z d Z RS( t prevt nextt keyt __weakref__( s prevs nexts keys __weakref__( t __name__t __module__t __slots__( ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyR s t OrderedDictc B s e Z d Z d Z e j e e d Z e j d Z d Z d Z d Z e d Z e d Z d Z e j Z Z e j Z e j Z e j Z e j Z e Z e d Z d d Z e d Z d Z d Z e d d Z! d Z" RS( s) Dictionary that remembers insertion orderc O s t | d k r+ t d t | n y | j WnL t k r t | _ t | j | _ } | | _ | _ i | _ n X| j | | d S( sÅ Initialize an ordered dictionary. The signature is the same as regular dictionaries, but keyword arguments are not recommended because their insertion order is arbitrary. i s$ expected at most 1 arguments, got %dN( t lent TypeErrort _OrderedDict__roott AttributeErrorR t _OrderedDict__hardroott _proxyR R t _OrderedDict__mapt _OrderedDict__update( t selft argst kwdst root( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt __init__. s c C s~ | | k rj | | j | <} | j } | j } | | | | _ | _ | _ | | _ | | | _ n | | | | d S( s! od.__setitem__(i, y) <==> od[i]=yN( R R R R R ( R R t valuet dict_setitemR t Linkt linkR" t last( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt __setitem__? s c C sG | | | | j j | } | j } | j } | | _ | | _ d S( s od.__delitem__(y) <==> del od[y]N( R t popR R ( R R t dict_delitemR' t link_prevt link_next( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt __delitem__M s c c s: | j } | j } x! | | k r5 | j V| j } q Wd S( s od.__iter__() <==> iter(od)N( R R R ( R R" t curr( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt __iter__X s c c s: | j } | j } x! | | k r5 | j V| j } q Wd S( s# od.__reversed__() <==> reversed(od)N( R R R ( R R" R/ ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt __reversed__a s c C s7 | j } | | _ | _ | j j t j | d S( s. od.clear() -> None. Remove all items from od.N( R R R R t cleart dict( R R" ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyR2 j s c C s | s t d n | j } | rK | j } | j } | | _ | | _ n$ | j } | j } | | _ | | _ | j } | j | =t j | | } | | f S( s 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. s dictionary is empty( t KeyErrorR R R R R R3 R* ( R R( R" R' R, R- R R$ ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt popitemq s c C s | j | } | j } | j } | | _ | | _ | j } | rn | j } | | _ | | _ | | _ | _ n+ | j } | | _ | | _ | | _ | _ d S( sÑ Move an existing element to the end (or beginning if last==False). Raises KeyError if the element does not exist. When last=True, acts like a fast version of self[key]=self.pop(key). N( R R R R ( R R R( R' R, R- R" t first( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt move_to_end s c C sq t j } t | d } | | j } | | | j d 7} | | | j | 7} | | | j | 7} | S( Ni i ( t _syst getsizeofR t __dict__R R R ( R t sizeoft nt size( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt __sizeof__ s c C sC | | k r! | | } | | =| S| | j k r? t | n | S( s² 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__markerR4 ( R R t defaultt result( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyR* ± s c C s" | | k r | | S| | | <| S( sD od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od( ( R R R@ ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt setdefault¿ s c C s7 | s d | j j f Sd | j j t | j f S( s od.__repr__() <==> repr(od)s %s()s %s(%r)( t __class__R t listt items( R ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.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( s% Return state information for picklingN( t varst copyR R* t NoneRC ( R t kRE t inst_dict( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt __reduce__Í s #c C s | j | S( s! od.copy() -> a shallow copy of od( RC ( R ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyRH × s c C s( | } x | D] } | | | <q W| S( s OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S. If not specified, the value defaults to None. ( ( t clst iterableR$ R R ( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyt fromkeysÛ s c C s` t | t rP t | t | k oO t d t | j | j D St j | | S( s od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive while comparison to a regular mapping is order-insensitive. c s s! | ] \ } } | | k Vq d S( N( ( t .0t pt q( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pys <genexpr>í s ( t isinstanceR R t allt zipRE R3 t __eq__( R t other( ( sL /home/tvault/.virtenv/lib/python2.7/site-packages/functools32/functools32.pyRV æ s )N(# R R t __doc__R# R3 R) R R R. R0 R1 R2 t TrueR5 R7 R>