B , d Z ddlmZ ddlZddlmZ ddlmZ m
Z ddl Z ddl
ZddlmZ ddlmZmZmZ ddlmZmZm Z mZ dd l m Z m Z m Z m!Z!m"Z" e r dd
l#m$Z$m%Z% ndd
l&m$Z$m%Z% d Zdd lm'Z' e!rd-dZ(nddlm(Z( e"r ddl)m*Z* n*# e+$ r ddl,m*Z* Y n w xY w ddl-m*Z* n# e+$ r ddl.m*Z* Y nw xY wd.dZ/ G d de0 Z1 G d de2 Z3 ddlmZ ddl
m4Z4 n # e+$ r Y nw xY wd Z5 G d de2 Z6d Z7d-d Z( G d d e% Z8dd lm9Z9 e9dfd!Z:d" Z;e3Ze(Z?eZ@e5ZAe/ZBe8ZCe:ZDe;ZEe jF d#k r-dd$l#m3Z3m6Z6 ddlm(Z( dd%lGm;Z; dd&lm7Z7 n # e+$ r Y nw xY wdd'lm:Z: e jF d(k r ddlmZ dd)l#m5Z5 e jF d*k rdd+lHm/Z/ dd,l#m8Z8 dS dS )/a
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)
)absolute_importN)ceil)
itemgettereq)proxy)repeatchainstarmap) getaddrinfo SOCK_STREAMerrorsocket) iteritems
itervaluesPY2PY26PY3)MappingMutableMappingc : t t | S )zZ
Return the ceiling of x as an int.
This is the smallest integral value >= x.
)intoldceil)xs g/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/future/backports/misc.pyr r # s
wqzz?? )islice c # K | V | |z
}
N startsteps r countr$ 3 s" KKK TME r )r$ ) get_ident...c fd}|S )zGDecorator to make a repr function return fillvalue for a recursive callc t fd}t d |_ t d |_ t d |_ t di |_ |S )Nc t | t f}|v rS | | } | n# | w xY w|S r )idr% adddiscard)selfkeyresult fillvalue repr_running
user_functions r wrapperz.decorating_function..wrapperM s T((IKK'Cl"" S ! ! !
*& t,, $$S)))) $$S))))Ms A A3
__module____doc____name____annotations__)setgetattrr4 r5 r6 r7 )r2 r3 r1 r0 s ` @r decorating_functionz+recursive_repr..decorating_functionJ s uu %]L A A!-;;"=*==")-9JB"O"O r r )r0 r: s ` r recursive_reprr; G s$ * r c e Zd ZdZdS )_Link)prevnextr. __weakref__N)r6 r4 __qualname__ __slots__r r r r= r= j s 4IIIr r= c , e Zd ZdZd Zej eefdZej fdZ d Z
d Z d Z dd Z
dd
Zd Zej xZZej Zej Zej Zej Z e Zefd ZddZ e d Z d Z d Z e dd Z d Z!d
S ) OrderedDictz)Dictionary that remembers insertion orderc | st d | d }| dd } t | dk r t dt | z |j nS# t $ rF t |_ t
|j x|_ }|x|_ |_ i |_ Y nw xY w |j
| i | dS )zInitialize an ordered dictionary. The signature is the same as
regular dictionaries, but keyword arguments are not recommended because
their insertion order is arbitrary.
z?descriptor '__init__' of 'OrderedDict' object needs an argumentr r N$expected at most 1 arguments, got %d) TypeErrorlen_OrderedDict__rootAttributeErrorr= _OrderedDict__hardroot_proxyr> r? _OrderedDict__map_OrderedDict__update)argskwdsr- roots r __init__zOrderedDict.__init__| s 1 0 1 1
1AwABBx t99q== BSYY NOO O KKK #ggDO!'!8!8 8DK$$( (DI DJJJ
t$t$$$$$s A A
B/.B/c || vrO | x| j |< }| j }|j }|||c|_ |_ |_ ||_ || |_ || || dS )z!od.__setitem__(i, y) <==> od[i]=yN)rM rI r> r? r. ) r- r. value dict_setitemr LinklinkrQ lasts r __setitem__zOrderedDict.__setitem__ sw
d??%)TVV +DJsOd;D9D-14 *DIty$( DI d DI T3&&&&&r c || | | j | }|j }|j }||_ ||_ dS )z od.__delitem__(y) <==> del od[y]N)rM popr> r? )r- r. dict_delitemrW link_prev link_nexts r __delitem__zOrderedDict.__delitem__ sI T3 z~~c""I I " " r c # Z K | j }|j }||ur|j V |j }||udS dS )zod.__iter__() <==> iter(od)N)rI r? r. r- rQ currs r __iter__zOrderedDict.__iter__ L {y$ (NNN9D $ r c # Z K | j }|j }||ur|j V |j }||udS dS )z#od.__reversed__() <==> reversed(od)N)rI r> r. ra s r __reversed__zOrderedDict.__reversed__ rd r c | j }|x|_ |_ | j t
| dS )z.od.clear() -> None. Remove all items from od.N)rI r> r? rM cleardict)r- rQ s r rh zOrderedDict.clear sC { $$ DI
4r Tc | st d | j }|r |j }|j }||_ ||_ n |j }|j }||_ ||_ |j }| j |= t | | }||fS )zod.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.
zdictionary is empty)KeyErrorrI r> r? r. rM ri r[ )r- rX rQ rW r] r^ r. rT s r popitemzOrderedDict.popitem s
2011 1{ "9D I !IN!DII9D I!DI !INh JsOs##Ezr c | j | }|j }|j }||_ ||_ | j }|r%|j }||_ ||_ |x|_ |_ dS |j }||_ ||_ |x|_ |_ dS )zMove 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)rM r> r? rI )r- r. rX rW r] r^ rQ firsts r move_to_endzOrderedDict.move_to_end s z#I I " " { *9D DI DI$( (DI IE DI DI%) )DI
r c t j }t | dz } || j }| || j dz z
}| || j |z z
}| || j |z z
}|S )Nr )sys getsizeofrH __dict__rM rK rI )r- sizeofnsizes r
__sizeof__zOrderedDict.__sizeof__ s IIMvdm$$ tz""Q&& t''!++ t{##a'' r c X || v r
| | }| |= |S || j u rt | |S )zod.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.
)_OrderedDict__markerrk )r- r. defaultr/ s r r[ zOrderedDict.pop s@ $;;#YFS M dm # #3-- r Nc ( || v r| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr r- r. r{ s r
setdefaultzOrderedDict.setdefault s# $;;9 S r c | s| j j dS | j j dt | dS )zod.__repr__() <==> repr(od)z()()) __class__r6 listitemsr- s r __repr__zOrderedDict.__repr__ sL 7 !^ 4 4 46 6 >222D 4F4F4F4FGGr c t | }t t D ]}| |d | j d|pddt | fS )z%Return state information for picklingNr )varscopyrD r[ r iterr )r- inst_dictks r
__reduce__zOrderedDict.__reduce__ sq JJOO%% kmm$$ # #A MM!T " " " "~r9#4dD a shallow copy of odr r s r r zOrderedDict.copy' ~~d###r c . | }|D ]}|||< |S )zOD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.
If not specified, the value defaults to None.
r )clsiterablerT r- r. s r fromkeyszOrderedDict.fromkeys+ s. suu C DII r c t |t r>t | | o"t t t | | S t | | S )zod.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)
isinstancerD ri __eq__allmap_eq)r- others r r zOrderedDict.__eq__6 sX
e[ ) ) K;;tU++JCT54I4I0J0J J{{4'''r )Tr )"r6 r4 rA r5 rR ri rY rL r= r_ rc rf rh rl ro rx r updaterN keysvaluesr __ne__objectrz r[ r~ r; r r r classmethodr r r r r rD rD m s // % % %. "&!1e ' ' ' ' -1,< # # # # .* * * *0 '--FX D
"F E
"FvxxH ' ^H H H O O O$ $ $ [( ( ( ( (r rD )r )nlargestc B | j }|D ]} ||d dz | |< dS )z!Tally elements from the iterable.r r N)get)mappingr mapping_getelems r _count_elementsr L s> +K 1 1# D!,,q0
1 1r c e Zd ZdZ fdZd ZddZd Zedd Z fdZ
d Z d
Z d Z
fd Zd
Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Zd Z xZS )Countera 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 | st d | d }| dd } t | dk r t dt | z t t | |j | i | dS )a 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
z;descriptor '__init__' of 'Counter' object needs an argumentr r NrF )rG rH superr rR r )rO rP r- r s r rR zCounter.__init__ s 1 0 1 1
1AwABBx t99q== BSYY NOO O
gt %%''' T"T"""""r c dS )z1The count of elements not in the Counter is zero.r r r- r. s r __missing__zCounter.__missing__ s qr Nc |1t | t d d S t j || t d S )zList 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)]
Nr T)r. reverse)r. )sortedr _itemgetter_heapqr )r- rv s r most_commonzCounter.most_common sQ
9$**,,KNNDIII Iq$**,,KNNCCCCr c t t j t t | S )a 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.
)_chain
from_iterable_starmap_repeatr r s r elementszCounter.elements s' ( #HWdjjll$C$CDDDr c t d )Nz@Counter.fromkeys() is undefined. Use Counter(iterable) instead.)NotImplementedError)r r vs r r zCounter.fromkeys s " NP P Pr c | st d | d }| dd } t | dk r t dt | z | r| d nd}|t |t r_|r4|j }| D ]\ }}| ||d z ||< n9t
t | | nt || |r| | dS dS )a 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
z9descriptor 'update' of 'Counter' object needs an argumentr r NrF )
rG rH r r r r r r r r )rO rP r- r self_getr r$ r s r r zCounter.update s7 ( 1 0 1 1
1AwABBx t99q== BSYY NOO O ",477 (G,,
0 : #xH'/~~'7'7 ? ? e%*XXdA->->%>T
? '4((//9999 h/// KK r c | st d | d }| dd } t | dk r t dt | z | r| d nd}|`|j }t |t r-| D ]\ }} ||d |z
||< n|D ]} ||d dz
||< |r| | dS dS )a 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
z;descriptor 'subtract' of 'Counter' object needs an argumentr r NrF )rG rH r r r r subtract)rO rP r- r r r r$ s r r zCounter.subtract s( 1 0 1 1
1AwABBx t99q== BSYY NOO O ",477 xH(G,,
7#+>>#3#3 ; ;KD%!)$!2!2U!:DJJ; % 7 7D!)$!2!2Q!6DJJ MM$ r c , | | S )zReturn a shallow copy.r r s r r z Counter.copy r r c 0 | j t | ffS r )r ri r s r r zCounter.__reduce__ s ~T
},,r c d || v r*t t | | dS dS )zGLike dict.__delitem__() but does not raise KeyError for missing values.N)r r r_ )r- r r s r r_ zCounter.__delitem__ s7 4<< '4 , ,T 2 2 2 2 2 T
KK K K K Ls A A 7BBc t |t st S t }| D ]\ }}||| z }|dk r|||< | D ]\ }}|| vr |dk r|||< |S )zAdd counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
r r r NotImplementedr r- r r/ r r$ newcounts r __add__zCounter.__add__6 s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]\ }}||| z
}|dk r|||< | D ]\ }}|| vr|dk rd|z
||< |S )z Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
r r r s r __sub__zCounter.__sub__I s %)) "! ! ::<< ( (KD% uT{*H!|| 't ;;== ) )KD%4 EAII 5yt
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #| D ]\ }}|| vr |dk r|||< |S )zUnion is the maximum of value in either of the input counters.
>>> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
r r r- r r/ r r$ other_countr s r __or__zCounter.__or__\ s %)) "! ! ::<< ( (KD% +K&+k&9&9{{uH!|| 't ;;== % %KD%4 EAII $t
r c t |t st S t }| D ]"\ }}|| }||k r|n|}|dk r|||< #|S )z Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
r r r s r __and__zCounter.__and__p st %)) "! ! ::<< ( (KD% +K % 3 3uuH!|| 't
r c $ | t z S )zEAdds an empty counter, effectively stripping negative and zero countsr r s r __pos__zCounter.__pos__ s gii r c $ t | z
S )z{Subtracts from an empty counter. Strips positive and zero counts,
and flips the sign on negative counts.
r r s r __neg__zCounter.__neg__ s
yy4 r c R d | D }|D ]}| |= | S )z?Internal method to strip elements with a negative or zero countc $ g | ]
\ }}|d k |S )r r ).0r r$ s r
z*Counter._keep_positive.. s! MMM e5199t999r )r )r- nonpositiver s r _keep_positivezCounter._keep_positive s: MMtzz||MMM DT
r c ~ | D ]\ }}| |xx |z
cc< | S )zInplace 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- r r r$ s r __iadd__zCounter.__iadd__ I !;;== KD% JJJ% JJJJ""$$$r c ~ | D ]\ }}| |xx |z cc< | S )zInplace subtract counter, but keep only results with positive counts.
>>> c = Counter('abbbc')
>>> c -= Counter('bccd')
>>> c
Counter({'b': 2, 'a': 1})
r r s r __isub__zCounter.__isub__ r r c | D ]\ }}| | }||k r|| |< | S )zInplace 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 r r r$ s r __ior__zCounter.__ior__ sP "' ) ) D+JEU"" (T
""$$$r c | D ]\ }}|| }||k r|| |< | S )zInplace intersection is the minimum of corresponding counts.
>>> c = Counter('abbb')
>>> c &= Counter('bcc')
>>> c
Counter({'b': 1})
r )r- r r r$ r s r __iand__zCounter.__iand__ sO ::<< ) )KD% +KU"" (T
""$$$r r ) r6 r4 rA r5 rR r r r r r r r r r r_ r r r r r r r r r r r r
__classcell__r s @r r r R s * *d# # # # #*
D D D DE E E0 P P P [P ' ' ' ' ' R! ! ! F$ $ $- - -3 3 3 3 3
L L L& & & ( " % % % % % %
%
%
%
%
%
%
%
%
%
%r r c ( d|v rt d t j | dt j i|}| \ }}| }|r4| d }|| d }t j || |S )z[
For Python 2.6 compatibility: see
http://stackoverflow.com/questions/4814970/
stdoutz3stdout argument not allowed, it will be overridden.rO Nr )
ValueError
subprocessPopenPIPE communicatepollr CalledProcessError) popenargskwargsprocessoutput
unused_errretcodecmds r check_outputr s 6NOOO LjoLVLLG ,,..FJllnnG :jj ;A,C+GS999 Mr c # K | V | |z
}
)z
``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+.
r r! s r r$ r$ s"
r c e Zd ZdZd Zd Zd ZddZd Zd Z d Z
d
Z e Z e
d Zed Zd
ZeZddZed Zd Zd Zd Zd Zd ZdS )ChainMapa 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 4 t | pi g| _ dS )zInitialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
N)r maps)r- r s r rR zChainMap.__init__ s
JJ&2$ r c t | r )rk r s r r zChainMap.__missing__ s smmr c t | j D ] } || c S # t $ r Y w xY w| | S r )r rk r )r- r. r s r __getitem__zChainMap.__getitem__ s\ y G
s|###
$$$s
""Nc || v r| | n|S r r r} s r r z ChainMap.get s 4KKtCyyW4r c R t t j | j S r )rH r8 unionr r s r __len__zChainMap.__len__ s ;355; *+++r c R t t j | j S r )r r8 r r r s r rc zChainMap.__iter__ s KCEEK+,,,r c D t fd| j D S )Nc 3 K | ]}|v V d S r r )r mr. s r z(ChainMap.__contains__.. s' //3!8//////r anyr r s `r __contains__zChainMap.__contains__ s( ////TY//////r c * t | j S r r r s r __bool__zChainMap.__bool__ s 49~~ r c d | d t t | j S )Nz{0.__class__.__name__}({1})r )r r r reprr r s r r zChainMap.__repr__! s7 ,33 $))Cdi 0 0113 3 3r c 8 | t j |g|R S )z?Create a ChainMap with a single dict created from the iterable.)ri r )r r rO s r r zChainMap.fromkeys& s& s4=1D111222r c r | j | j d g| j dd R S )zHNew ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]r r N)r r r r s r r z
ChainMap.copy+ s8 t~dil / / 1 1BDIabbMBBBBr c 0 |i } | j |g| j R S )z
New ChainMap with a new map followed by all previous maps. If no
map is provided, an empty dict is used.
r r )r- r s r new_childzChainMap.new_child1 s*
9A t~a,$),,,,r c 0 | j | j dd S )zNew ChainMap from maps[1:].r Nr r s r parentszChainMap.parents: s t~ty}--r c & || j d |< d S Nr )r )r- r. rT s r rY zChainMap.__setitem__? s ! ! Sr c | j d |= d S # t $ r# t d | w xY w)Nr )Key not found in the first mapping: {0!r})r rk r r s r r_ zChainMap.__delitem__B sX T ! S!!! T T TFMMcRRSS S Ts -?c | | j d S # t $ r t d w xY w)zPRemove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.r z#No keys found in the first mapping.)r rl rk r s r rl zChainMap.popitemH sN B9Q<'')) ) B B B@AA A Bs ! ;c | j d j |g|R S # t $ r# t d | w xY w)zWRemove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].r r# )r r[ rk r )r- r. rO s r r[ z ChainMap.popO se T#49Q<#C/$/// / T T TFMMcRRSS S Ts -Ac D | j d dS )z'Clear maps[0], leaving maps[1:] intact.r N)r rh r s r rh zChainMap.clearV s ! r r )r6 r4 rA r5 rR r r r r rc r r __nonzero__r; r r r r __copy__r propertyr rY r_ rl r[ rh r r r r r s{
' ' ' % % %5 5 5 5, , ,- - -0 0 0 K^3 3 3 3 3 [3C C C H- - - - . . X." " "T T T B B BT T T r r )_GLOBAL_DEFAULT_TIMEOUTc | \ }}d}t ||dt D ]}|\ }}} }
} d} t ||| } |t ur| | |r| | | | | c S # t $ r"}
|
}| | Y d}
~
d}
~
ww xY w||t d )a 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.
Nr z!getaddrinfo returns an empty list) r r r r*
settimeoutbindconnectr
close)addresstimeoutsource_addresshostporterrresafsocktypeproto canonnamesasock_s r create_connectionr> ` s JD$
C4q+66 -0*HeY "h..D 555(((
* .))) LL KKK C
7888s A B
B7B22B7c 2 G fddt }|S )z,Convert a cmp= function into a key= functionc ^ e Zd ZdgZd Z fdZ fdZ fdZ fdZ fdZ fdZ
d Z d
S ) cmp_to_key..Kobjc || _ d S r rB )r- rB rO s r rR z cmp_to_key..K.__init__ s
DHHHr c 8 | j |j dk S r! rD r- r mycmps r __lt__z cmp_to_key..K.__lt__ 559--1 1r c 8 | j |j dk S r! rD rF s r __gt__z cmp_to_key..K.__gt__ rI r c 8 | j |j dk S r! rD rF s r r z cmp_to_key..K.__eq__ 559--2 2r c 8 | j |j dk S r! rD rF s r __le__z cmp_to_key..K.__le__ rM r c 8 | j |j dk S r! rD rF s r __ge__z cmp_to_key..K.__ge__ rM r c 8 | j |j dk S r! rD rF s r r z cmp_to_key..K.__ne__ rM r c t d )Nzhash not implemented)rG r s r __hash__z cmp_to_key..K.__hash__ s 233 3r N) r6 r4 rA rB rR rH rK r rO rQ r rT )rG s r KrA s G 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4r rU )r )rG rU s ` r
cmp_to_keyrV s> 4 4 4 4 4 4 4F 4 4 4$
Hr )rq )rD r )rV )r )r> ) r )r )rX rX )r; )r )r r )r& )Ir5
__future__r r mathr r operatorr r r r rr heapqr _weakrefr rL itertoolsr r r r r
r r r r r
future.utilsr r r r r collectionsr r collections.abcr r$ _threadr% ImportError
_dummy_threadthread dummy_threadr; r r= ri rD r r r r r r* r> rV _OrderedDict_Counter
_check_output_count_ceil__count_elements_recursive_repr _ChainMap_create_connection _cmp_to_key version_info functoolsreprlibr r r rt s ' & & & & & 9 9 9 9 9 9 9 9
$ $ $ $ $ $ M M M M M M M M M M : : : : : : : : : : : : > > > > > > > > > > > > > > 833333333377777777
+,%%%%%%% , , ,++++++++,+$$$$$$$ + + +********+ F5 5 5 5 5F 5 5 5P( P( P( P( P($ P( P( P(j ###### D 1 1 1 w% w% w% w% w%d w% w% w%t & "h h h h h ~ h h h X + * * * * * (?%)&9 &9 &9 &9R
.
" & v 00000000 $$$$$$
+++++++
)(((((v ++++++v &&&&&&$$$$$$$$ sH 9B B
BB B'&B' C C C E EE