OwlCyberSecurity - MANAGER
Edit File: functools.cpython-34.pyo
� j f_o � & @ s� d Z d d d d d d d d d d d g Z y d d l m Z Wn e k rU Yn Xd d l m Z d d l m Z d d l m Z d d l m Z y d d l m Z Wn Gd d � d � Z Yn XdQ Z dR Z e e d d � Z e e d d � Z d d � Z d d � Z d! d" � Z d# d$ � Z d% d& � Z d' d( � Z d) d* � Z d+ d, � Z d- d. � Z d/ d0 � Z d1 d2 � Z d3 d4 � Z d5 d � Z d6 d � Z y d d7 l m Z Wn e k r�Yn Xd8 d � Z! y d d9 l m! Z! Wn e k r�Yn XGd: d � d e" � Z# e d; d< d= d> d? g � Z$ Gd@ dA � dA e% � Z& e" � f e' e( e) e* dB � h e+ e, e* e- dC dD � Z. dE dF dG d � Z/ dH dI � Z0 dB dJ dK � Z1 dL dM � Z2 dN dO � Z3 dP d � Z4 dB S)SzEfunctools.py - Tools for working with functions and callable objects �update_wrapper�wraps�WRAPPER_ASSIGNMENTS�WRAPPER_UPDATES�total_ordering� cmp_to_key� lru_cache�reduce�partial� partialmethod�singledispatch� )r )�get_cache_token)� namedtuple)�MappingProxyType)�WeakKeyDictionary)�RLockc @ s. e Z d Z d Z d d � Z d d � Z d S)r z/Dummy reentrant lock for builds without threadsc C s d S)N� )�selfr r �./opt/alt/python34/lib64/python3.4/functools.py� __enter__ s zRLock.__enter__c C s d S)Nr )r �exctype�excinst�exctbr r r �__exit__ s zRLock.__exit__N)�__name__� __module__� __qualname__�__doc__r r r r r r r s r r r r r �__annotations__�__dict__c C s� xF | D]> } y t | | � } Wn t k r4 Yq Xt | | | � q Wx0 | D]( } t | | � j t | | i � � qP W| | _ | S)a Update a wrapper function to look like the wrapped function wrapper is the function to be updated wrapped is the original function assigned is a tuple naming the attributes assigned directly from the wrapped function to the wrapper function (defaults to functools.WRAPPER_ASSIGNMENTS) updated is a tuple naming the attributes of the wrapper that are updated with the corresponding attribute from the wrapped function (defaults to functools.WRAPPER_UPDATES) )�getattr�AttributeError�setattr�update� __wrapped__)�wrapper�wrapped�assigned�updated�attr�valuer r r r + s & c C s t t d | d | d | �S)a� Decorator factory to apply update_wrapper() to a wrapper function Returns a decorator that invokes update_wrapper() with the decorated function as the wrapper argument and the arguments to wraps() as the remaining arguments. Default arguments are as for update_wrapper(). This is a convenience function to simplify applying partial() to update_wrapper(). r& r' r( )r r )r& r' r( r r r r I s c C s0 | j | � } | t k r t S| o/ | | k S)zIReturn a > b. Computed by @total_ordering from (not a < b) and (a != b).)�__lt__�NotImplemented)r �other� op_resultr r r � _gt_from_lta s r/ c C s | j | � } | p | | k S)zEReturn a <= b. Computed by @total_ordering from (a < b) or (a == b).)r+ )r r- r. r r r � _le_from_lth s r0 c C s$ | j | � } | t k r t S| S)z=Return a >= b. Computed by @total_ordering from (not a < b).)r+ r, )r r- r. r r r � _ge_from_ltm s r1 c C s0 | j | � } | t k r t S| p/ | | k S)zJReturn a >= b. Computed by @total_ordering from (not a <= b) or (a == b).)�__le__r, )r r- r. r r r � _ge_from_let s r3 c C s/ | j | � } | t k r t S| o. | | k S)zFReturn a < b. Computed by @total_ordering from (a <= b) and (a != b).)r2 r, )r r- r. r r r � _lt_from_le{ s r4 c C s$ | j | � } | t k r t S| S)z=Return a > b. Computed by @total_ordering from (not a <= b).)r2 r, )r r- r. r r r � _gt_from_le� s r5 c C s0 | j | � } | t k r t S| o/ | | k S)zIReturn a < b. Computed by @total_ordering from (not a > b) and (a != b).)�__gt__r, )r r- r. r r r � _lt_from_gt� s r7 c C s | j | � } | p | | k S)zEReturn a >= b. Computed by @total_ordering from (a > b) or (a == b).)r6 )r r- r. r r r � _ge_from_gt� s r8 c C s$ | j | � } | t k r t S| S)z=Return a <= b. Computed by @total_ordering from (not a > b).)r6 r, )r r- r. r r r � _le_from_gt� s r9 c C s0 | j | � } | t k r t S| p/ | | k S)zJReturn a <= b. Computed by @total_ordering from (not a >= b) or (a == b).)�__ge__r, )r r- r. r r r � _le_from_ge� s r; c C s/ | j | � } | t k r t S| o. | | k S)zFReturn a > b. Computed by @total_ordering from (a >= b) and (a != b).)r: r, )r r- r. r r r � _gt_from_ge� s r< c C s$ | j | � } | t k r t S| S)z=Return a < b. Computed by @total_ordering from (not a >= b).)r: r, )r r- r. r r r � _lt_from_ge� s r= c s i d t f d t f d t f g d 6d t f d t f d t f g d 6d t f d t f d t f g d 6d t f d t f d t f g d 6} � f d d � | D� } | s� t d � � n t | � } x@ | | D]4 \ } } | | k r� | | _ t � | | � q� q� W� S)z6Class decorator that fills in missing ordering methodsr6 r2 r: r+ c s: g | ]0 } t � | d � t t | d � k r | � q S)N)r �object)�.0�op)�clsr r � <listcomp>� s z"total_ordering.<locals>.<listcomp>z6must define at least one ordering operation: < > <= >=)r/ r0 r1 r3 r4 r5 r7 r8 r9 r; r< r= � ValueError�maxr r" )rA �convert�roots�root�opname�opfuncr )rA r r � s, c s G� f d d � d t � } | S)z,Convert a cmp= function into a key= functionc s� e Z d Z d g Z d d � Z � f d d � Z � f d d � Z � f d d � Z � f d d � Z � f d d � Z � f d d � Z d Z d S)zcmp_to_key.<locals>.K�objc S s | | _ d S)N)rJ )r rJ r r r �__init__� s z cmp_to_key.<locals>.K.__init__c s � | j | j � d k S)Nr )rJ )r r- )�mycmpr r r+ � s z cmp_to_key.<locals>.K.__lt__c s � | j | j � d k S)Nr )rJ )r r- )rL r r r6 � s z cmp_to_key.<locals>.K.__gt__c s � | j | j � d k S)Nr )rJ )r r- )rL r r �__eq__� s z cmp_to_key.<locals>.K.__eq__c s � | j | j � d k S)Nr )rJ )r r- )rL r r r2 � s z cmp_to_key.<locals>.K.__le__c s � | j | j � d k S)Nr )rJ )r r- )rL r r r: � s z cmp_to_key.<locals>.K.__ge__c s � | j | j � d k S)Nr )rJ )r r- )rL r r �__ne__� s z cmp_to_key.<locals>.K.__ne__N) r r r � __slots__rK r+ r6 rM r2 r: rN �__hash__r )rL r r �K� s rQ )r> )rL rQ r )rL r r � s )r c s7 � � � f d d � } � | _ � | _ � | _ | S)zSNew function with partial application of the given arguments and keywords. c s* � j � } | j | � � � | | � S)N)�copyr# )ZfargsZ fkeywordsZ newkeywords)�args�func�keywordsr r �newfunc� s zpartial.<locals>.newfunc)rT rS rU )rT rS rU rV r )rS rT rU r r � s )r c @ sX e Z d Z d Z d d � Z d d � Z d d � Z d d � Z e d d � � Z d S) r z�Method descriptor with partial application of the given arguments and keywords. Supports wrapping existing descriptors and handles non-descriptor callables as instance methods. c O s� t | � r5 t | d � r5 t d j | � � � n t | t � r� | j | _ | j | | _ | j j � | _ | j j | � n | | _ | | _ | | _ d S)N�__get__z${!r} is not callable or a descriptor) �callable�hasattr� TypeError�format� isinstancer rT rS rU rR r# )r rT rS rU r r r rK s zpartialmethod.__init__c C s} d j t t | j � � } d j d d � | j j � D� � } d } | j d | j j d | j j d | j d | d | � S) Nz, c s s' | ] \ } } d j | | � Vq d S)z{}={!r}N)r[ )r? �k�vr r r � <genexpr>" s z)partialmethod.__repr__.<locals>.<genexpr>z*{module}.{cls}({func}, {args}, {keywords})�modulerA rT rS rU ) �join�map�reprrS rU �itemsr[ � __class__r r rT )r rS rU � format_stringr r r �__repr__ s zpartialmethod.__repr__c s+ � f d d � } � j | _ � | _ | S)Nc sR � j j � } | j | � | ^ } } | f � j t | � } � j | | � S)N)rU rR r# rS �tuplerT )rS rU � call_keywords� cls_or_self�rest� call_args)r r r �_method, s z3partialmethod._make_unbound_method.<locals>._method)�__isabstractmethod__�_partialmethod)r rm r )r r �_make_unbound_method+ s z"partialmethod._make_unbound_methodc C s� t | j d d � } d } | d k r� | | | � } | | j k r� t | | j | j � } y | j | _ Wq� t k r� Yq� Xq� n | d k r� | j � j | | � } n | S)NrW ) r rT r rS rU �__self__r! rp rW )r rJ rA �get�result�new_funcr r r rW 6 s zpartialmethod.__get__c C s t | j d d � S)Nrn F)r rT )r r r r rn I s z"partialmethod.__isabstractmethod__N) r r r r rK rg rp rW �propertyrn r r r r r s � CacheInfo�hits�misses�maxsize�currsizec @ s7 e Z d Z d Z d Z e d d � Z d d � Z d S)� _HashedSeqz� This class guarantees that hash() will be called no more than once per element. This is important because the lru_cache() will hash the key multiple times on a cache miss. � hashvaluec C s# | | d d � <| | � | _ d S)N)r| )r �tup�hashr r r rK ] s z_HashedSeq.__init__c C s | j S)N)r| )r r r r rP a s z_HashedSeq.__hash__N)r r r r rO r~ rK rP r r r r r{ T s r{ Nc s� | } | rF | | j � � } | | 7} x | D] } | | 7} q/ Wn | r� | | � f d d � | D� � 7} | r� | | � f d d � | D� � 7} q� n0 | | � d k r� � | d � | k r� | d St | � S)a� Make a cache key from optionally typed positional and keyword arguments The key is constructed in a way that is flat as possible rather than as a nested structure that would take more memory. If there is only a single argument and its data type is known to cache its hash value, then that argument is returned without a wrapper. This saves space and improves lookup speed. c 3 s | ] } � | � Vq d S)Nr )r? r^ )�typer r r_ y s z _make_key.<locals>.<genexpr>c 3 s! | ] \ } } � | � Vq d S)Nr )r? r] r^ )r r r r_ { s � r )rd r{ ) rS �kwds�typed�kwd_mark� fasttypes�sortedrh r �len�key� sorted_items�itemr )r r � _make_keyd s #)(r� � Fc sw � d k r+ t � t � r+ t d � � n t � � t � d \ � � � � � � � � � � � � f d d � } | S) a� Least-recently-used cache decorator. If *maxsize* is set to None, the LRU features are disabled and the cache can grow without bound. If *typed* is True, arguments of different types will be cached separately. For example, f(3.0) and f(3) will be treated as distinct calls with distinct results. Arguments to the cached function must be hashable. View the cache statistics named tuple (hits, misses, maxsize, currsize) with f.cache_info(). Clear the cache and statistics with f.cache_clear(). Access the underlying function with f.__wrapped__. See: http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used Nz)Expected maxsize to be an integer or Noner r� � � c s> i � d � � d � � j � t � � g � � � d d g � d d � <� d k rn � � f d d � } nr � d k r� � � � � � � � � f d d � } n< � � � � � � � � � � � � � � � f d d � } � � � � � f d d � } � � � � � � f d d � } | | _ | | _ t | � � S) Nr Fc s � | | � } � d 7� | S)Nr� r )rS r� rs )rx � user_functionr r r% � s z7lru_cache.<locals>.decorating_function.<locals>.wrapperc sb � | | � � } � | � � } | � k r; � d 7� | S� | | � } | � | <� d 7� | S)Nr� r )rS r� r� rs )�cache� cache_getrw �make_keyrx �sentinelr� r� r r r% � s c s� � | | � � } � �� � | � } | d k r� | \ } } } } | | � <| | � <� � } | | � <� � <| | � <� | � <� d 7� | SWd QX� | | � } � �� | � k r� n� � r$� } | | � <| | � <| � � � � } � � } d � � <� � <� | =| � | <nH � � } | � | | g } | | � <� � <� | <t � � � k � � d 7� Wd QX| S)Nr� )r� ) rS r� r� �link� link_prev� link_next�_keyrs �last�oldroot�oldkey� oldresult)�KEY�NEXT�PREV�RESULTr� r� �fullrw �lockr� ry rx rG r� r� r r r% � sB c s* � � t � � � t � � � SWd QXd S)zReport cache statisticsN)� _CacheInfor� r )r� rw r� ry rx r r � cache_info� s z:lru_cache.<locals>.decorating_function.<locals>.cache_infoc sG � �; � j � � � d d g � d d � <d � � d � Wd QXd S)z$Clear the cache and cache statisticsNr F)�clearr )r� r� rw r� rx rG r r � cache_clear s z;lru_cache.<locals>.decorating_function.<locals>.cache_clear)rr r r� r� r )r� r% r� r� )r� r� r� r� r� ry r� r� )r� r� r� rw r� rx rG r� r �decorating_function� s" *<7 ! z&lru_cache.<locals>.decorating_function)r r� r� r� )r\ �intrZ r> r� )ry r� r� r )r� r� r� r� r� ry r� r� r r � s 'lc C s� g } x� d d � | D� } | s& | SxJ | D]B } | d } x/ | D]& } | | d d � k rD d } PqD qD WPq- W| d k r� t d � � n | j | � x( | D] } | d | k r� | d =q� q� Wq Wd S)z�Merges MROs in *sequences* to a single MRO using the C3 algorithm. Adapted from http://www.python.org/download/releases/2.3/mro/. c S s g | ] } | r | � q Sr r )r? �sr r r rB s z _c3_merge.<locals>.<listcomp>r r� NzInconsistent hierarchy)� RuntimeError�append)� sequencesrs �s1� candidate�s2�seqr r r � _c3_merge s$ r� c s� xO t t | j � � D]2 \ } � t � d � r t | j � | } Pq q Wd } � rd t � � n g � t | j d | � � } g } t | j | d � � } xP � D]H � t | � � r� t � f d d � | j D� � r� | j � � q� q� Wx | D] � � j � � q� W� f d d � | D� } � f d d � | D� } � f d d � | D� } t | g g | | | | g | g | g � S) a� Computes the method resolution order using extended C3 linearization. If no *abcs* are given, the algorithm works exactly like the built-in C3 linearization used for method resolution. If given, *abcs* is a list of abstract base classes that should be inserted into the resulting MRO. Unrelated ABCs are ignored and don't end up in the result. The algorithm inserts ABCs where their functionality is introduced, i.e. issubclass(cls, abc) returns True for the class itself but returns False for all its direct base classes. Implicit ABCs for a given class (either registered or inferred from the presence of a special method like __len__) are inserted directly after the last ABC explicitly listed in the MRO of said class. If two implicit ABCs end up next to each other in the resulting MRO, their ordering depends on the order of types in *abcs*. �__abstractmethods__r Nc 3 s | ] } t | � � Vq d S)N)� issubclass)r? �b)�baser r r_ O s z_c3_mro.<locals>.<genexpr>c s" g | ] } t | d � �� q S)�abcs)�_c3_mro)r? r� )r� r r rB V s z_c3_mro.<locals>.<listcomp>c s" g | ] } t | d � �� q S)r� )r� )r? r� )r� r r rB W s c s" g | ] } t | d � �� q S)r� )r� )r? r� )r� r r rB X s ) � enumerate�reversed� __bases__rY r� �listr� �anyr� �remover� ) rA r� �i�boundary�explicit_bases�abstract_bases� other_bases�explicit_c3_mros�abstract_c3_mros� other_c3_mrosr )r� r� r r� 2 s( " r� c sf t � j � � � � f d d � � � f d d � � D� � � f d d � � � f d d � � D� � t � � � g } x� � D]� } g } xU | j � D]G } | � k r� t � | � r� | j � f d d � | j D� � q� q� W| s� | j | � q� n | j d t d d � x; | D]3 } x* | D]" } | | k r(| j | � q(q(WqWq� Wt � d | �S) z�Calculates the method resolution order for a given class *cls*. Includes relevant abstract base classes (with their respective bases) from the *types* iterable. Uses a modified C3 linearization algorithm. c s( | � k o' t | d � o' t � | � S)N�__mro__)rY r� )�typ)�basesrA r r � is_relatedh s z _compose_mro.<locals>.is_relatedc s" g | ] } � | � r | � q Sr r )r? �n)r� r r rB k s z _compose_mro.<locals>.<listcomp>c s4 x- � D]% } | | k r | | j k r d Sq Wd S)NTF)r� )r� r- )�typesr r �is_strict_basen s z$_compose_mro.<locals>.is_strict_basec s" g | ] } � | � s | � q Sr r )r? r� )r� r r rB s s c s" g | ] } | � k r | � q Sr r )r? r� )�type_setr r rB | s r� �reverseTr� )�setr� �__subclasses__r� r� �sortr� r� )rA r� �mror� �found�sub�subclsr )r� rA r� r� r� r� r � _compose_mro_ s* * r� c C s� t | | j � � } d } x� | D]� } | d k r� | | k r� | | j k r� | | j k r� t | | � r� t d j | | � � � n Pn | | k r" | } q" q" W| j | � S)a^ Returns the best matching implementation from *registry* for type *cls*. Where there is no registered implementation for a specific type, its method resolution order is used to find a more generic implementation. Note: if *registry* does not contain an implementation for the base *object* type, this function may return None. Nz Ambiguous dispatch: {} or {})r� �keysr� r� r� r[ rr )rA �registryr� �match�tr r r � _find_impl� s r� c s� i � t � � d � � � � f d d � � d � � � � f d d � � � f d d � } | � t <� | _ � | _ t � � | _ � j | _ t | | � | S)al Single-dispatch generic function decorator. Transforms a function into a generic function, which can have different behaviours depending upon the type of its first argument. The decorated function acts as the default implementation, and additional implementations can be registered using the register() attribute of the generic function. Nc s� � d k r7 t � } � | k r7 � j � | � q7 n y � | } WnN t k r� y � | } Wn! t k r� t | � � } Yn X| � | <Yn X| S)z�generic_func.dispatch(cls) -> <function implementation> Runs the dispatch algorithm to return the best available implementation for the given *cls* registered on *generic_func*. N)r r� �KeyErrorr� )rA � current_token�impl)� cache_token�dispatch_cacher� r r �dispatch� s z singledispatch.<locals>.dispatchc s^ | d k r � � f d d � S| � � <� d k rP t � d � rP t � � n � j � | S)z�generic_func.register(cls, func) -> func Registers a new implementation for the given *cls* on a *generic_func*. Nc s � � | � S)Nr )�f)rA �registerr r �<lambda>� s z2singledispatch.<locals>.register.<locals>.<lambda>r� )rY r r� )rA rT )r� r� r� r� )rA r r� � s z singledispatch.<locals>.registerc s � | d j � | | � S)Nr )re )rS �kw)r� r r r% � s z singledispatch.<locals>.wrapper) r r> r� r� r r� r� � _clear_cacher )rT r% r )r� r� r� r� r� r r � s )z __module__z__name__z __qualname__z__doc__z__annotations__)z__dict__)5r �__all__� _functoolsr � ImportError�abcr � collectionsr r� r �weakrefr �_threadr r r r r r/ r0 r1 r3 r4 r5 r7 r8 r9 r; r< r= r r r r> r r� r� r{ r� �str� frozensetr r� rh r� r� r r� r� r� r� r r r r r �<module> sr N � - )