Current File : //proc/self/root/opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyc
�
�A�[c @@ s� d Z d d l m Z d d l Z d d l m Z d d l m Z m Z d d l
m Z m
Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z d d l m Z m Z m Z m Z d d
l m! Z! m" Z" m# Z# m$ Z$ d � Z d d l m% Z% e$ r@y d d
l& m' Z' Wn! e( k
r<d d
l) m' Z' n Xn8 y d d
l* m' Z' Wn! e( k
rwd d
l+ m' Z' n Xd d � Z, d e- f d � � YZ. d e/ f d � � YZ0 y$ d d l
m Z d d l m1 Z1 Wn e( k
r�n Xd � Z2 d e/ f d � � YZ3 d � Z4 d d d � Z5 d e f d � � YZ6 d d l m7 Z7 e7 e8 d � Z9 d � Z: e0 Z; e3 Z< e4 Z= e5 Z> e Z? e2 Z@ e, ZA e6 ZB e9 ZC e: ZD e jE d! d" f k r d d# l m0 Z0 m3 Z3 d d$ l m5 Z5 d d% lF m: Z: y d d& l m4 Z4 Wn e( k
r n Xd d' l m9 Z9 n e jE d( d f k rWd d l m Z d d) l m2 Z2 n e jE d( d( f k r�d d* lG m, Z, d d+ l m6 Z6 n d S(, s�
Miscellaneous function (re)definitions from the Py3.4+ standard library
for Python 2.6/2.7.
- math.ceil (for Python 2.7)
- collections.OrderedDict (for Python 2.6)
- collections.Counter (for Python 2.6)
- collections.ChainMap (for all versions prior to Python 3.3)
- itertools.count (for Python 2.6, with step parameter)
- subprocess.check_output (for Python 2.6)
- reprlib.recursive_repr (for Python 2.6+)
- functools.cmp_to_key (for Python 2.6)
i ( t absolute_importN( t ceil( t Mappingt MutableMapping( t
itemgettert eq( t proxy( t repeatt chaint starmap( t getaddrinfot SOCK_STREAMt errort socket( t iteritemst
itervaluest PY26t PY3c C@ s t t | � � S( sZ
Return the ceiling of x as an int.
This is the smallest integral value >= x.
( t intt oldceil( t x( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR s ( t islice( t get_idents ...c @ s � f d � } | S( sG Decorator to make a repr function return fillvalue for a recursive callc @ sm t � � � � � f d � } t � d � | _ t � d � | _ t � d � | _ t � d i � | _ | S( Nc @ sW t | � t � f } | � k r% � S� j | � z � | � } Wd � j | � X| S( N( t idR t addt discard( t selft keyt result( t fillvaluet repr_runningt
user_function( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt wrapper? s
t
__module__t __doc__t __name__t __annotations__( t sett getattrR! R" R# R$ ( R R ( R ( R R sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt decorating_function< s ( ( R R' ( ( R sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt recursive_repr9 s t _Linkc B@ s e Z d Z RS( t prevt nextR t __weakref__( R* R+ R R, ( R# R! t __slots__( ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR) X 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� | s t d � � n | d } | d } t | � d k rT 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.
s? descriptor '__init__' of 'OrderedDict' object needs an argumenti i s$ expected at most 1 arguments, got %dN( t TypeErrort lent _OrderedDict__roott AttributeErrorR) t _OrderedDict__hardroott _proxyR* R+ t _OrderedDict__mapt _OrderedDict__update( t argst kwdsR t root( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __init__j s
c C@ s~ | | k rj | � | j | <} | j } | j } | | | | _ | _ | _ | | _ | | � | _ n | | | | � d S( s! od.__setitem__(i, y) <==> od[i]=yN( R5 R1 R* R+ R ( R R t valuet dict_setitemR t Linkt linkR9 t last( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __setitem__� s c C@ sG | | | � | j j | � } | j } | j } | | _ | | _ d S( s od.__delitem__(y) <==> del od[y]N( R5 t popR* R+ ( R R t dict_delitemR> t link_prevt link_next( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __delitem__� s
c c@ s: | j } | j } x! | | k r5 | j V| j } q Wd S( s od.__iter__() <==> iter(od)N( R1 R+ R ( R R9 t curr( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __iter__� s
c c@ s: | j } | j } x! | | k r5 | j V| j } q Wd S( s# od.__reversed__() <==> reversed(od)N( R1 R* R ( R R9 RF ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __reversed__� s
c C@ s7 | j } | | _ | _ | j j � t j | � d S( s. od.clear() -> None. Remove all items from od.N( R1 R* R+ R5 t cleart dict( R R9 ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRI � 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 KeyErrorR1 R* R+ R R5 RJ RA ( R R? R9 R> RC RD R R; ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt popitem� 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( R5 R* R+ R1 ( R R R? R> RC RD R9 t first( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.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 getsizeofR0 t __dict__R5 R3 R1 ( R t sizeoft nt size( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.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__markerRK ( R R t defaultR ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRA � 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 RW ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.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 ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __repr__ s c C@ sd t | � j � } x' t t � � D] } | j | d � q" W| j d | pN d d t | j � � f S( s% Return state information for picklingN( ( t varst copyR. RA t NoneRY t iterR[ ( R t inst_dictt k( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt
__reduce__ s c C@ s
| j | � S( s! od.copy() -> a shallow copy of od( RY ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR^ 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 ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt fromkeys s
c C@ sG t | t � r7 t j | | � o6 t t t | | � � 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.
( t
isinstanceR. RJ t __eq__t allt mapt _eq( R t other( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRh $ s (N(# R# R! R" R: RJ R@ R4 R) RE RG RH RI t TrueRL RN RU R t updateR6 t keyst valuesR[ t __ne__t objectRV RA R_ RX R( R\ Rc R^ t classmethodRf Rh ( ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR. [ s0
( R ( t nlargestc C@ s5 | j } x% | D] } | | d � d | | <q Wd S( s! Tally elements from the iterable.i i N( t get( t mappingRe t mapping_gett elem( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt _count_elements: s
t Counterc B@ s� e Z d Z d � Z d � Z d d � Z d � Z e d d � � Z d � Z
d � Z d � Z d � Z
d
� Z d � Z d � Z d
� Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( s� Dict subclass for counting hashable items. Sometimes called a bag
or multiset. Elements are stored as dictionary keys and their counts
are stored as dictionary values.
>>> c = Counter('abcdeabcdabcaba') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('b', 4), ('c', 3)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'e']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbbbcccdde'
>>> sum(c.values()) # total of all counts
15
>>> c['a'] # count of letter 'a'
5
>>> for elem in 'shazam': # update counts from an iterable
... c[elem] += 1 # by adding 1 to each element's count
>>> c['a'] # now there are seven 'a'
7
>>> del c['b'] # remove all 'b'
>>> c['b'] # now there are zero 'b'
0
>>> d = Counter('simsalabim') # make another counter
>>> c.update(d) # add in the second counter
>>> c['a'] # now there are nine 'a'
9
>>> c.clear() # empty the counter
>>> c
Counter()
Note: If a count is set to zero or reduced to zero, it will remain
in the counter until the entry is deleted or the counter is cleared:
>>> c = Counter('aaabbc')
>>> c['b'] -= 2 # reduce the count of 'b' by two
>>> c.most_common() # 'b' is still in, but its count is zero
[('a', 3), ('c', 1), ('b', 0)]
c O@ s{ | s t d � � n | d } | d } t | � d k rT t d t | � � � n t t | � j � | j | | � d S( s Create a new, empty Counter object. And if given, count elements
from an input iterable. Or, initialize the count from another mapping
of elements to their counts.
>>> c = Counter() # a new, empty counter
>>> c = Counter('gallahad') # a new counter from an iterable
>>> c = Counter({'a': 4, 'b': 2}) # a new counter from a mapping
>>> c = Counter(a=4, b=2) # a new counter from keyword args
s; descriptor '__init__' of 'Counter' object needs an argumenti i s$ expected at most 1 arguments, got %dN( R/ R0 t superRz R: Rn ( R7 R8 R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR: s s
c C@ s d S( s1 The count of elements not in the Counter is zero.i ( ( R R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __missing__� s c C@ sP | d k r. t | j � d t d � d t �St j | | j � d t d � �S( s� List the n most common elements and their counts from the most
common to the least. If n is None, then list all element counts.
>>> Counter('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
R i t reverseN( R_ t sortedR[ t _itemgetterRm t _heapqRt ( R RS ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt most_common� s "c C@ s t j t t | j � � � S( s� Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC')
>>> sorted(c.elements())
['A', 'A', 'B', 'B', 'C', 'C']
# Knuth's example for prime factors of 1836: 2**2 * 3**3 * 17**1
>>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
>>> product = 1
>>> for factor in prime_factors.elements(): # loop over factors
... product *= factor # and multiply them
>>> product
1836
Note, if an element's count has been set to zero or is a negative
number, elements() will ignore it.
( t _chaint
from_iterablet _starmapt _repeatR[ ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt elements� s c C@ s t d � � d S( Ns@ Counter.fromkeys() is undefined. Use Counter(iterable) instead.( t NotImplementedError( Rd Re t v( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRf � s c O@ s | s t d � � n | d } | d } t | � d k rT t d t | � � � n | rd | d n d } | d k r� t | t � r� | r� | j } xJ | j � D]# \ } } | | | d � | | <q� Wq� t t | � j | � q� t
| | � n | r
| j | � n d S( s� Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.update('witch') # add elements from another iterable
>>> d = Counter('watch')
>>> c.update(d) # add elements from another counter
>>> c['h'] # four 'h' in which, witch, and watch
4
s9 descriptor 'update' of 'Counter' object needs an argumenti i s$ expected at most 1 arguments, got %dN( R/ R0 R_ Rg R Ru R[ R{ Rz Rn Ry ( R7 R8 R Re t self_getRx t count( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRn � s"
c O@ s
| s t d � � n | d } | d } t | � d k rT t d t | � � � n | rd | d n d } | d k r� | j } t | t � r� x\ | j � D]# \ } } | | d � | | | <q� Wq� x( | D] } | | d � d | | <q� Wn | r| j | � n d S( s� Like dict.update() but subtracts counts instead of replacing them.
Counts can be reduced below zero. Both the inputs and outputs are
allowed to contain zero and negative counts.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which')
>>> c.subtract('witch') # subtract elements from another iterable
>>> c.subtract(Counter('watch')) # subtract elements from another counter
>>> c['h'] # 2 in which, minus 1 in witch, minus 1 in watch
0
>>> c['w'] # 1 in which, minus 1 in witch, minus 1 in watch
-1
s; descriptor 'subtract' of 'Counter' object needs an argumenti i s$ expected at most 1 arguments, got %dN( R/ R0 R_ Ru Rg R R[ t subtract( R7 R8 R Re R� Rx R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR� � s
c C@ s
| j | � S( s Return a shallow copy.( RY ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR^ s c C@ s | j t | � f f S( N( RY RJ ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRc s c C@ s) | | k r% t t | � j | � n d S( sG Like dict.__delitem__() but does not raise KeyError for missing values.N( R{ Rz RE ( R Rx ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRE s c C@ s~ | s d | j j Sy9 d j t d j | j � � � } d | j j | f SWn* t k
ry d j | j j t | � � SXd S( Ns %s()s , s %r: %rs %s({%s})s
{0}({1!r})( RY R# t joinRj t __mod__R� R/ t formatRJ ( R R[ ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR\ s !
c C@ s� t | t � s t St � } xA | j � D]3 \ } } | | | } | d k r) | | | <q) q) Wx? | j � D]1 \ } } | | k rm | d k rm | | | <qm qm W| S( s Add counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
i ( Rg Rz t NotImplementedR[ ( R Rl R Rx R� t newcount( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __add__$ s c C@ s� t | t � s t St � } xA | j � D]3 \ } } | | | } | d k r) | | | <q) q) WxC | j � D]5 \ } } | | k rm | d k rm d | | | <qm qm W| S( s� Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
i ( Rg Rz R� R[ ( R Rl R Rx R� R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __sub__7 s c C@ s� t | t � s t St � } xU | j � D]G \ } } | | } | | k rQ | n | } | d k r) | | | <q) q) Wx? | j � D]1 \ } } | | k r� | d k r� | | | <q� q� W| S( s� Union is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
i ( Rg Rz R� R[ ( R Rl R Rx R� t other_countR� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __or__J s
c C@ sx t | t � s t St � } xU | j � D]G \ } } | | } | | k rQ | n | } | d k r) | | | <q) q) W| S( s� Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
i ( Rg Rz R� R[ ( R Rl R Rx R� R� R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __and__^ s
c C@ s | t � S( sE Adds an empty counter, effectively stripping negative and zero counts( Rz ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __pos__o s c C@ s t � | S( s{ Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
( Rz ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __neg__s s c C@ sM g | j � D] \ } } | d k s
| ^ q
} x | D]
} | | =q8 W| S( s? Internal method to strip elements with a negative or zero counti ( R[ ( R Rx R� t nonpositive( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt _keep_positivez s 1
c C@ s7 x* | j � D] \ } } | | c | 7<q
W| j � S( s� Inplace add from another counter, keeping only positive counts.
>>> c = Counter('abbb')
>>> c += Counter('bcc')
>>> c
Counter({'b': 4, 'c': 2, 'a': 1})
( R[ R� ( R Rl Rx R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __iadd__� s c C@ s7 x* | j � D] \ } } | | c | 8<q
W| j � S( s� Inplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
( R[ R� ( R Rl Rx R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __isub__� s c C@ sJ x= | j � D]/ \ } } | | } | | k r
| | | <q
q
W| j � S( s� Inplace union is the maximum of value from either counter.
>>> c = Counter('abbb')
>>> c |= Counter('bcc')
>>> c
Counter({'b': 3, 'c': 2, 'a': 1})
( R[ R� ( R Rl Rx R� R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __ior__� s
c C@ sJ x= | j � D]/ \ } } | | } | | k r
| | | <q
q
W| j � S( s� Inplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
( R[ R� ( R Rl Rx R� R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __iand__� s
N( R# R! R" R: R| R_ R� R� Rs Rf Rn R� R^ Rc RE R\ R� R� R� R� R� R� R� R� R� R� R� ( ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRz @ s0 +
) #
c O@ s� d | k r t d � � n t j d t j | | � } | j � \ } } | j � } | r� | j d � } | d k r� | d } n t j | | � � n | S( s[
For Python 2.6 compatibility: see
http://stackoverflow.com/questions/4814970/
t stdouts3 stdout argument not allowed, it will be overridden.R7 i N( t
ValueErrort
subprocesst Popent PIPEt communicatet pollRu R_ t CalledProcessError( t popenargst kwargst processt outputt
unused_errt retcodet cmd( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt check_output� s
i c c@ s x t r | V| | 7} q Wd S( s�
``itertools.count`` in Py 2.6 doesn't accept a step
parameter. This is an enhanced version of ``itertools.count``
for Py2.6 equivalent to ``itertools.count`` in Python 2.7+.
N( Rm ( t startt step( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR� � s t ChainMapc B@ s� e Z d Z d � Z d � Z d � Z d d � Z d � Z d � Z d � Z
d � Z e Z e
� d � � Z e d
� � Z d � Z e Z d d � Z e d
� � Z d � Z d � Z d � Z d � Z d � Z RS( s� A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
accessed or updated using the *maps* attribute. There is no other state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
c G@ s t | � p i g | _ d S( s� Initialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N( RZ t maps( R R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR: � s c C@ s t | � � d S( N( RK ( R R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR| � s c C@ sA x1 | j D]& } y | | SWq
t k
r/ q
Xq
W| j | � S( N( R� RK R| ( R R Rv ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __getitem__� s
c C@ s | | k r | | S| S( N( ( R R RW ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRu � s c C@ s t t � j | j � � S( N( R0 R% t unionR� ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __len__ s c C@ s t t � j | j � � S( N( R` R% R� R� ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRG s c @ s t � f d � | j D� � S( Nc 3@ s | ] } � | k Vq d S( N( ( t .0t m( R ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pys <genexpr> s ( t anyR� ( R R ( ( R sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __contains__ s c C@ s
t | j � S( N( R� R� ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __bool__ s c C@ s% d j | d j t t | j � � � S( Ns {0.__class__.__name__}({1})s , ( R� R� Rj t reprR� ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR\ s c G@ s | t j | | � � S( s? Create a ChainMap with a single dict created from the iterable.( RJ Rf ( Rd Re R7 ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRf s c C@ s$ | j | j d j � | j d � S( sH New ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]i i ( RY R� R^ ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR^ s c C@ s( | d k r i } n | j | | j � S( s�
New ChainMap with a new map followed by all previous maps. If no
map is provided, an empty dict is used.
N( R_ RY R� ( R R� ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt new_child s c C@ s | j | j d � S( s New ChainMap from maps[1:].i ( RY R� ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt parents( s c C@ s | | j d | <d S( Ni ( R� ( R R R; ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR@ - s c C@ s? y | j d | =Wn& t k
r: t d j | � � � n Xd S( Ni s) Key not found in the first mapping: {0!r}( R� RK R� ( R R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRE 0 s
c C@ s9 y | j d j � SWn t k
r4 t d � � n Xd S( sP Remove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.i s# No keys found in the first mapping.N( R� RL RK ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRL 6 s
c G@ sH y | j d j | | � SWn& t k
rC t d j | � � � n Xd S( sW Remove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].i s) Key not found in the first mapping: {0!r}N( R� RA RK R� ( R R R7 ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRA = s
c C@ s | j d j � d S( s' Clear maps[0], leaving maps[1:] intact.i N( R� RI ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRI D s N( R# R! R" R: R| R� R_ Ru R� RG R� R� t __nonzero__R( R\ Rs Rf R^ t __copy__R� t propertyR� R@ RE RL RA RI ( ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR� � s* ( t _GLOBAL_DEFAULT_TIMEOUTc C@ s | \ } } d } x� t | | d t � D]� } | \ } } } }
} d } yY t | | | � } | t k rz | j | � n | r� | j | � n | j | � | SWq( t k
r� }
|
} | d k r� | j � q� q( Xq( W| d k r� | � n t d � � d S( s� Backport of 3-argument create_connection() for Py2.6.
Connect to *address* and return the socket object.
Convenience function. Connect to *address* (a 2-tuple ``(host,
port)``) and return the socket object. Passing the optional
*timeout* parameter will set the timeout on the socket instance
before attempting to connect. If no *timeout* is supplied, the
global default timeout setting returned by :func:`getdefaulttimeout`
is used. If *source_address* is set it must be a tuple of (host, port)
for the socket to bind as a source address before making the connection.
An host of '' or port 0 tells the OS to use the default.
i s! getaddrinfo returns an empty listN(
R_ R
R R
R� t
settimeoutt bindt connectR t close( t addresst timeoutt source_addresst hostt portt errt rest aft socktypet protot canonnamet sat sockt _( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt create_connectionN s(
c @ s d t f � f d � � Y} | S( s, Convert a cmp= function into a key= functiont Kc @ s} e Z d g Z d � Z � f d � Z � f d � Z � f d � Z � f d � Z � f d � Z � f d � Z d � Z
RS( t objc W@ s
| | _ d S( N( R� ( R R� R7 ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR: { s c @ s � | j | j � d k S( Ni ( R� ( R Rl ( t mycmp( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __lt__} s c @ s � | j | j � d k S( Ni ( R� ( R Rl ( R� ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __gt__ s c @ s � | j | j � d k S( Ni ( R� ( R Rl ( R� ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRh � s c @ s � | j | j � d k S( Ni ( R� ( R Rl ( R� ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __le__� s c @ s � | j | j � d k S( Ni ( R� ( R Rl ( R� ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __ge__� s c @ s � | j | j � d k S( Ni ( R� ( R Rl ( R� ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyRq � s c S@ s t d � � d S( Ns hash not implemented( R/ ( R ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt __hash__� s ( R# R! R- R: R� R� Rh R� R� Rq R� ( ( R� ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyR� y s ( Rr ( R� R� ( ( R� sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt
cmp_to_keyw s i i ( R. Rz ( R� ( R� ( R� ( R� i ( Ry ( R( ( R� (H R" t
__future__R R� t mathR R t collectionsR R t operatorR R R Rk RO t heapqR� t _weakrefR R4 t itertoolsR R� R R� R R� R
R
R R t future.utilsR R R R R t _threadR t ImportErrort
_dummy_threadt threadt dummy_threadR( Rr R) RJ R. Rt Ry Rz R� R� R� R� R_ R� R� t _OrderedDictt _Countert
_check_outputt _countt _ceilt __count_elementst _recursive_reprt _ChainMapt _create_connectiont _cmp_to_keyt version_infot functoolst reprlib( ( ( sF /opt/alt/python27/lib/python2.7/site-packages/future/backports/misc.pyt <module>
s� ""
�
� { l (
Mini Shell