Directory:~$ /lib/python2.7/site-packages/future/backports/

Upload File

[Home] [System Details] [Kill Me]

�
,�]c@@s�dZd
dl
mZ
d
dlZd
dlmZ
d
dlmZ	m
Z
d
dlZd
dl
Zd
dlmZ
d
dlmZmZmZ
d
dlmZmZmZmZ
d
d	lmZmZm
Z m!Z!m"Z"
e r�d
d
l#m$Z$m%Z%
nd
d
l&m$Z$m%Z%
d�Zd
dlm'Z'
e"re
yd
d
l(m)Z)
Wn!e*k
ra



d
d
l+m)Z)
n
Xn8yd
d
l,m)Z)
Wn!e*k
r�



d
d
l-m)Z)
n
Xdd�
Z.de/f
d��YZ0de1f
d��YZ2y$d
dlmZ
d
dl
m3Z3
Wne*k
r


n
Xd�Z4de1f
d��YZ5d�Z6d
dd�Z7de%f
d��YZ8d
dlm9Z9
e9e:d�Z;d
�Z<e2Z=e5Z>e6Z?e7Z@eZAe4ZBe.ZCe8ZDe;ZEe<ZFejGd!d"fkrDd
d#l#m2Z2m5Z5
d
d$lm7Z7
d
d%lHm<Z<
yd
d&lm6Z6
Wne*k
r0


n
Xd
d'lm;Z;
nejGd(d
fkr|d
dlmZ
d
d)l#m4Z4
nejGd(d(fkr�d
d*lIm.Z.
d
d+l#m8Z8
ndS(,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(
tabsolute_importN(
tceil(t
itemgetterteq(
tproxy(trepeattchaintstarmap(tgetaddrinfotSOCK_STREAMterrortsocket(t	iteritemst
itervaluestPY2tPY26tPY3(tMappingtMutableMappingc

C@stt
|�
�
S(
sZ
    Return the ceiling of x as an int.
    This is the smallest integral value >= x.
   
(tinttoldceil(
t
x((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR
#s(
tislice(
t	get_idents...c
@s�f
d
�}
|
S(sGDecorator
to make a repr function return fillvalue for a recursive
callc
@smt�����
fd
�}
t
�
d�|
_t
�
d�|
_t
�
d�|
_t
�
di�|
_|
S(Nc
@sWt|�
t
�f}
|
�
kr%�S�
j|
�

z�|�
}Wd�
j|
�

X|S(
N(tidRtaddtdiscard(tselftkeytresult(t	fillvaluetrepr_runningt
user_function(s9/usr/lib/python2.7/site-packages/future/backports/misc.pytwrapperCs







t
__module__t__doc__t__name__t__annotations__(tsettgetattrR"R#R$R%(R
R!(
R(RR
s9/usr/lib/python2.7/site-packages/future/backports/misc.pytdecorating_function@s
	



((RR(((
Rs9/usr/lib/python2.7/site-packages/future/backports/misc.pytrecursive_repr=st_LinkcB@seZ
dZRS(tprevtnextRt__weakref__(sprevsnextskeys__weakref__(R$R"t	__slots__(((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR*\s
tOrderedDictcB@s
eZ
dZd
�Zejeed�Zejd�
Zd�Z	d�Z
d�Zed�
Z
ed�
Zd	�ZejZZejZejZejZejZe�Zed
�
Zdd�
Ze�d��
Zd
�Zd�Ze
dd�
�
Z!d�Z"RS(s)Dictionary that remembers insertion
ordercO@s�|std
�
�
n|d}|d}t
|�
dkrTtdt
|�
�
�
ny|j
WnLtk
r�


t�|_t|j�
|_}||_|_i|_	n
X|j
||
�
dS(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 argumentii
s$expected at most 1 arguments, got
%dN(t	TypeErrortlent_OrderedDict__roottAttributeErrorR*t_OrderedDict__hardroott_proxyR+R,t_OrderedDict__mapt_OrderedDict__update(targstkwdsRtroot((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__init__ns















c	C@s~|
|krj|�|j|
<}|j
}|j}|||
|_|_|_||_||�
|_n|||
|�
d
S(s!od.__setitem__(i,
y) <==>
od[i]=yN(R6R2R+R,R(	RRtvaluetdict_setitemRtLinktlinkR:tlast((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__setitem__�s

	
	

	

cC@sG|||
�
|jj
|
�
}|j}|j}||_||_d
S(s
od.__delitem__(y) <==> del
od[y]N(R6tpopR+R,(RRtdict_delitemR?t	link_prevt	link_next((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__delitem__�s


	
	
	
c
c@s:|j}
|
j
}x!||
k	r5|jV
|j
}qWd
S(sod.__iter__()
<==>
iter(od)N(R2R,R(RR:tcurr((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__iter__�s
	
	


c
c@s:|j}
|
j
}x!||
k	r5|jV
|j
}qWd
S(s#od.__reversed__()
<==>
reversed(od)N(R2R+R(RR:RG((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__reversed__�s
	
	


c
C@s7|j}
|
|
_
|
_|jj�
tj|�

d
S(s.od.clear() ->
None.  Remove all items from
od.N(R2R+R,R6tcleartdict(RR:((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRJ�s	



cC@s�|std
�
�
n|j
}|
rK|j}|j}||_||_n$|j}|j}||_||_|j}|j|=tj||�}||fS(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.

        sdictionary is
empty(tKeyErrorR2R+R,RR6RKRB(RR@R:R?RDRERR<((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytpopitem�s


	

	
	
	
	
	
	
	
	



cC@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(R6R+R,R2(RRR@R?RDRER:tfirst((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytmove_to_end�s

	
	
	
	
	

	
	
	
	
	
	
c
C@sqtj
}
t|�
d
}|
|j�
}||
|j�
d7}||
|j�
|7}||
|j�
|7}|S(Ni
i(tsyst	getsizeofR1t__dict__R6R4R2(Rtsizeoft
ntsize((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt
__sizeof__�s
	





cC@sC|
|kr!||
}||
=|S||jkr?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__markerRL(RRtdefaultR((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRB�s






cC@s"|
|kr||
S|||
<|S(
sDod.setdefault(k[,d])
-> od.get(k,d), also set od[k]=d if k not in
od((RRRX((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt
setdefault
s



c

C@s7|sd
|jj
f
Sd|jj
t|j��
fS(sod.__repr__() <==>
repr(od)s%s()s%s(%r)(t	__class__R$tlisttitems(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__repr__
s

c
C@sdt|�
j
�}
x'tt��
D]}|
j|d
�
q"W|jd|
pNd
d
t|j��
fS(s%Return
state information for
picklingN((tvarstcopyR/RBtNoneRZtiterR\(Rt	inst_dictt
k((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt
__reduce__
s


c

C@s
|j|�
S(
s!od.copy() -> a shallow copy of
od(
RZ(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR_
scC@s(|�}x|
D]}|||<qW|S(
sOD.fromkeys(S[,
v]) -> New ordered dictionary with keys from S.
        If not specified, the value defaults to None.

       
((tclstiterableR<RR((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytfromkeys
s	



cC@sGt|
t
�r7tj||
�o6ttt||
��
Stj||
�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/RKt__eq__talltmapt_eq(Rtother((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRi(
s
(
N(#R$R"R#R;RKRAR5R*RFRHRIRJtTrueRMRORVRtupdateR7tkeystvaluesR\t__ne__tobjectRWRBR`RYR)R]RdR_tclassmethodRgRi(((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR/_s0
	
							

	
	
	
				

(
R(
tnlargestcC@s5|j}x%|
D]}||d
�d||<qWdS(s!Tally
elements from the
iterable.ii
N(
tget(tmappingRftmapping_gettelem((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt_count_elements>
s	


tCountercB@s�eZ
dZd
�Zd�Zdd�
Zd�Zedd�
�
Z	d�Z
d�Zd�Zd	�Z
d
�Zd�Zd�Zd
�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�Zd�ZRS(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)]

   
cO@s{|std
�
�
n|d}|d}t
|�
dkrTtdt
|�
�
�
ntt|�j�
|j||
�
dS(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 argumentii
s$expected at most 1 arguments, got
%dN(R0R1tsuperR{R;Ro(R8R9R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR;w
s







c
C@sd
S(s1The count of elements not in the Counter is
zero.i((RR((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__missing__�
scC@sP|
dkr.t
|j�d
td�
dt�
Stj|
|j�d
td�
�
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)]

       
Ri
treverseN(R`tsortedR\t_itemgetterRnt_heapqRu(RRT((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytmost_common�
s	
"
c

C@stj
tt|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((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytelements�
scC@std
�
�
dS(Ns@Counter.fromkeys()
is undefined.  Use Counter(iterable)
instead.(
tNotImplementedError(ReRft
v((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRg�
s
cO@s
|std
�
�
n|d}|d}t
|�
dkrTtdt
|�
�
�
n|rd|dnd}|dk	r�t|t�r�|r�|j}xJ|j�D]#\}}|||d�||<q�Wq�tt|�j	|�

q�t
||�
n|
r

|j	|
�

ndS(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

        s9descriptor 'update' of 'Counter' object needs
an argumentii
s$expected at most 1 arguments, got
%dN(R0R1R`RhRRvR\R|R{RoRz(R8R9RRftself_getRytcount((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRo�
s"










	



cO@s

|std
�
�
n|d}|d}t
|�
dkrTtdt
|�
�
�
n|rd|dnd}|dk	r�|j}t|t�r�x\|j�D]#\}}||d�|||<q�Wq�x(|D]}||d�d||<q�Wn|
r
|j|
�

ndS(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 argumentii
s$expected at most 1 arguments, got
%dN(R0R1R`RvRhRR\tsubtract(R8R9RRfR�RyR�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR��
s









	






c

C@s
|j|�
S(
sReturn a shallow
copy.(
RZ(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR_	sc

C@s|jt
|�
f
fS(
N(RZRK(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRd
s
cC@s)|
|kr%tt
|�j|
�

nd
S(sGLike
dict.__delitem__() but does not raise KeyError for missing
values.N(R|R{RF(RRy((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRFs
c
C@s~|sd
|jj
Sy9djtdj|j���
}
d|jj
|
fSWn*tk
ry


dj|jj
t|�
�SXdS(Ns%s()s, s%r: %rs%s({%s})s
{0}({1!r})(	RZR$tjoinRkt__mod__R�R0tformatRK(RR\((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR]s



!


cC@s�t|
t
�stSt
�}xA|j�D]3\}}||
|}|d
kr)|||<q)q)Wx?|
j�D]1\}}||krm|d
krm|||<qmqmW|S(sAdd
counts from two counters.

        >>> Counter('abbb') + Counter('bcc')
        Counter({'b': 4, 'c': 2, 'a': 1})

       
i(RhR{tNotImplementedR\(RRmRRyR�tnewcount((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__add__(s

	







cC@s�t|
t
�stSt
�}xA|j�D]3\}}||
|}|d
kr)|||<q)q)WxC|
j�D]5\}}||krm|d
krmd
|||<qmqmW|S(s�
Subtract count, but keep only results with positive counts.

        >>> Counter('abbbc') - Counter('bccd')
        Counter({'b': 2, 'a': 1})

       
i(RhR{R�R\(RRmRRyR�R�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__sub__;s

	







cC@s�t|
t
�stSt
�}xU|j�D]G\}}|
|}||krQ|n|}|d
kr)|||<q)q)Wx?|
j�D]1\}}||kr�|d
kr�|||<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(RhR{R�R\(RRmRRyR�tother_countR�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__or__Ns

	









cC@sxt|
t
�stSt
�}xU|j�D]G\}}|
|}||krQ|n|}|d
kr)|||<q)q)W|S(s�
Intersection is the minimum of corresponding counts.

        >>> Counter('abbb') &
Counter('bcc')
        Counter({'b': 1})

       
i(RhR{R�R\(RRmRRyR�R�R�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__and__bs

	






c

C@s|t�S(
sEAdds an empty counter, effectively stripping
negative and zero
counts(
R{(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__pos__ssc

C@st�|S(
s{Subtracts
from an empty counter.  Strips positive and zero counts,
        and flips the sign on negative counts.

       
(
R{(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__neg__wsc
C@sMg|j�D]\}
}|d
ks
|
^q
}x|D]
}
||
=q8W|S(s?Internal
method to strip elements with a negative or zero
counti(
R\(RRyR�tnonpositive((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt_keep_positive~s1



cC@s7x*|
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�(RRmRyR�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__iadd__�s	

cC@s7x*|
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�(RRmRyR�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__isub__�s	

cC@sJx=|
j�D]/\}}||}||kr
|||<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�(RRmRyR�R�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__ior__�s
	




cC@sJx=|j�D]/\}}|
|}||kr
|||<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�(RRmRyR�R�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__iand__�s
	




N(R$R"R#R;R}R`R�R�RtRgRoR�R_RdRFR]R�R�R�R�R�R�R�R�R�R�R�(((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR{D
s0+		
	
	)	#												
	
	cO@s�d
|
krtd�
�
nt
jd
t
j||
�
}|j�\}}|j�}|r�|
jd�
}|dkr�|d}nt
j||��
n|S(s[
    For Python 2.6 compatibility: see
    http://stackoverflow.com/questions/4814970/
    tstdouts3stdout argument not allowed, it will be overridden.R8iN(	t
ValueErrort
subprocesstPopentPIPEtcommunicatetpollRvR`tCalledProcessError(t	popenargstkwargstprocesstoutputt
unused_errtretcodetcmd((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytcheck_output�s










i
cc@s
xtr|V
||
7}qWd
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(
Rn(tstarttstep((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR��s	

tChainMapcB@s�eZ
dZd
�Zd�Zd�Zdd�
Zd�Zd�Z	d�Z
d�ZeZe
�d	��
Zed
��
Zd�ZeZdd�
Zed
��
Zd�Zd�Zd�Zd�Zd�ZRS(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@st|
�
pig
|_
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(R[tmaps(RR�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR;�scC@st|
�
�
dS(
N(
RL(RR((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR}�s
cC@sAx1|jD]&}y||
SWq
t
k
r/


q
Xq
W|j|
�
S(
N(R�RLR}(RRRw((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__getitem__�s






cC@s|
|kr||
S|S(
N((RRRX((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRv
s
c

C@stt
�j|j��
S(
N(R1R&tunionR�(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__len__s
c

C@stt
�j|j��
S(
N(RaR&R�R�(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRHs
c@st�f
d
�|j
D�
�
S(Nc
3@s|]}
�|
kV
qdS(
N((t.0t
m(
R(s9/usr/lib/python2.7/site-packages/future/backports/misc.pys	<genexpr>s(tanyR�(RR((
Rs9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__contains__
s
c

C@s
t|j
�
S(
N(R�R�(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__bool__
s
c

C@s%d
j|dj
tt|j��
�S(Ns{0.__class__.__name__}({1})s,
(R�R�RktreprR�(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR]s
cG@s|tj
|
|�
�
S(
s?Create
a ChainMap with a single dict created from the
iterable.(RKRg(ReRfR8((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRgsc

C@s$|j|j
d
j�|j
d�
S(sHNew
ChainMap or subclass with a new copy of maps[0] and refs to
maps[1:]ii
(RZR�R_(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR_scC@s(|
d
kri}
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`RZR�(RR�((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt	new_child#s
	
c

C@s|j|j
d
�S(sNew
ChainMap from
maps[1:].i
(RZR�(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytparents,scC@s||jd
|
<dS(Ni(
R�(RRR<((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRA1s
cC@s?y|jd
|
=Wn&t
k
r:


t
dj|
�
�
�
n
XdS(Nis)Key not found in the first mapping:
{0!r}(R�RLR�(RR((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRF4s




c

C@s9y|jd
j
�SWntk
r4


td�
�
n
XdS(sPRemove and return an item pair from maps[0].
Raise KeyError is maps[0] is empty.is#No keys found in the first
mapping.N(R�RMRL(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRM:s



cG@sHy|jd
j
|
|�
SWn&tk
rC


tdj|
�
�
�
n
XdS(sWRemove *key* from maps[0] and return its
value. Raise KeyError if *key* not in maps[0].is)Key not found in the first
mapping:
{0!r}N(R�RBRLR�(RRR8((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRBAs



c

C@s|jd
j
�
dS(s'Clear
maps[0], leaving maps[1:]
intact.iN(R�RJ(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRJHsN(R$R"R#R;R}R�R`RvR�RHR�R�t__nonzero__R)R]RtRgR_t__copy__R�tpropertyR�RARFRMRBRJ(((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR��s*													(
t_GLOBAL_DEFAULT_TIMEOUTcC@s
|\}}d}x�t
||d
t�D]�}|\}}}	}
}d}yYt|||	�}|
tk	rz|j|
�

n|r�|j|�

n|j|�

|SWq(tk
r�
}

|
}|dk	r�|j	�
q�q(Xq(W|dk	r�|�
ntd�
�
dS(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.
    is!getaddrinfo returns an empty listN(
R`RR	RR�t
settimeouttbindtconnectR
tclose(taddressttimeouttsource_addressthosttportterrtrestaftsocktypetprotot	canonnametsatsockt
_((s9/usr/lib/python2.7/site-packages/future/backports/misc.pytcreate_connectionRs(
















	c
@s
d
tf
�f
d��Y}
|
S(s,Convert a cmp= function into a key=
functiont
Kc@s}eZ
dg
Zd
�Z�f
d�Z�f
d�Z�f
d�Z�f
d�Z�f
d�Z�f
d�Z	d�Z
RS(	tobjcW@s
|
|_dS(
N(
R�(RR�R8((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR;s
c@s�|j|
j�d
kS(Ni(
R�(RRm(
tmycmp(s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__lt__�s
c@s�|j|
j�d
kS(Ni(
R�(RRm(
R�(s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__gt__�s
c@s�|j|
j�d
kS(Ni(
R�(RRm(
R�(s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRi�s
c@s�|j|
j�d
k
S(Ni(
R�(RRm(
R�(s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__le__�s
c@s�|j|
j�d
kS(Ni(
R�(RRm(
R�(s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__ge__�s
c@s�|j|
j�d
kS(Ni(
R�(RRm(
R�(s9/usr/lib/python2.7/site-packages/future/backports/misc.pyRr�s
c

S@std
�
�
dS(Nshash
not
implemented(
R0(
R((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt__hash__�s
(R$R"R.R;R�R�RiR�R�RrR�((
R�(s9/usr/lib/python2.7/site-packages/future/backports/misc.pyR�}s
	
	(
Rs(R�R�((
R�s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt
cmp_to_key{sii(R/R{(
R�(
R�(
R�(
R�i(
Rz(
R)(
R�(JR#t
__future__RR�tmathR
RtoperatorRR�RRlRPtheapqR�t_weakrefRR5t	itertoolsRR�RR�RR�RRR	R
tfuture.utilsRR
RRRtcollectionsRRtcollections.abcRt_threadRtImportErrort
_dummy_threadtthreadtdummy_threadR)RsR*RKR/RuRzR{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	functoolstreprlib(((s9/usr/lib/python2.7/site-packages/future/backports/misc.pyt<module>
s�





"(
	








�




	�{	l
(