| Server IP : 180.180.241.3 / Your IP : 216.73.216.252 Web Server : Microsoft-IIS/7.5 System : Windows NT NETWORK-NHRC 6.1 build 7601 (Windows Server 2008 R2 Standard Edition Service Pack 1) i586 User : IUSR ( 0) PHP Version : 5.3.28 Disable Function : NONE MySQL : ON | cURL : ON | WGET : OFF | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : C:/Program Files (x86)/MySQL/MySQL Workbench 6.1 CE/python/lib/ |
Upload File : |
'Sc @ sx d d d d d g Z d d l Td d l Z e e j 7Z d d l m Z m Z d d l m Z m Z d d
l
m Z d d l
Z d d l Z d d l m Z m Z m Z m Z m Z y d d l m Z Wn! e k
r d d l m Z n Xd
Z d e! e" f d YZ# e$ e$ d Z% d e! f d YZ& e' d k rtd d l( m) Z) m* Z* e% d d e+ Z, e, d d d d Z- e- e) e* e- k st. d e% d d f d YZ, x/ e, d d e, d d d f D] Z- e- GHqWd e% d d f d YZ, e, d! d" j/ d d# GHe% d$ e, j0 d% f Z1 e1 j2 GHd d l3 Z3 e% d& d' Z4 e4 e3 j5 GHn d S(( t Countert dequet defaultdictt
namedtuplet OrderedDicti( t *N( R R ( t
itemgettert eq( t iskeyword( t repeatt chaint starmapt ifiltert imap( t get_identc sU t f d } t d | _ t d | _ t d | _ | S( sC Decorator to make a repr function return "..." for a recursive callc sW t | t f } | k r% d S j | z | } Wd j | X| S( Ns ...( t idR t addt discard( t selft keyt result( t repr_runningt
user_function( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt wrapper s
t
__module__t __doc__t __name__( t sett getattrR R R ( R R ( ( R R sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt _recursive_repr s c B s% e Z d Z d Z d d e j d Z d d e j d Z d d d Z d d d Z d Z d
Z
e j Z e j
Z
e j Z e j Z e j Z e j Z e j Z e j Z e j Z e j Z d Z d Z d
Z e d Z e 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 WnN t k
r d d d g | _ } d } d } | | | <| | <i | _ n X| j | | d S( s Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
i s$ expected at most 1 arguments, got %di N( t lent TypeErrort _OrderedDict__roott AttributeErrort Nonet _OrderedDict__mapt update( R t argst kwdst roott PREVt NEXT( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __init__: s
i i c C s\ | | k rH | j } | | } | | | g | | <| | <| j | <n | | | | d S( s! od.__setitem__(i, y) <==> od[i]=yN( R R# ( R R t valueR( R) t dict_setitemR' t last( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __setitem__L s
)c C sK | | | | j j | } | | } | | } | | | <| | | <d S( s od.__delitem__(y) <==> del od[y]N( R# t pop( R R R( R) t dict_delitemt linkt link_prevt link_next( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __delitem__V s
i c c s= | j } | | } x# | | k r8 | | V| | } q Wd S( s od.__iter__() <==> iter(od)N( R ( R R) t KEYR' t curr( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __iter__a s
c c s= | j } | | } x# | | k r8 | | V| | } q Wd S( s# od.__reversed__() <==> reversed(od)N( R ( R R( R5 R' R6 ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __reversed__j s
c C s g | D] } | | | g ^ q } | j | j f } | ` | ` t | j } | \ | _ | _ | r~ | j | f | f S| j | f f S( s% Return state information for pickling( R# R t varst copyt __class__( R t kt itemst tmpt inst_dict( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt
__reduce__s s # c C sm yH x | j j D]
} | 2q W| j | j d g | j (| j j Wn t k
r[ n Xt j | d S( s. od.clear() -> None. Remove all items from od.N( R# t
itervaluesR R" t clearR! t dict( R t node( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyRB ~ s
c C s
t | S( s@ od.viewkeys() -> a set-like object providing a view on od's keys( t KeysView( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt viewkeys s c C s
t | S( s< od.viewvalues() -> an object providing a view on od's values( t
ValuesView( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt
viewvalues s c C s
t | S( sB od.viewitems() -> a set-like object providing a view on od's items( t ItemsView( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt viewitems s c C sR | s t d n t | r* t | n 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 KeyErrort nextt reversedt iterR/ ( R R- R R+ ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt popitem s
$c C s1 | s d | j j f Sd | j j | j f S( s od.__repr__() <==> repr(od)s %s()s %s(%r)( R; R R= ( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __repr__ s c C s
| j | S( s! od.copy() -> a shallow copy of od( R; ( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR: s c C s( | } x | D] } | | | <q W| S( s OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
( ( t clst iterableR+ t dR ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt fromkeys s
c C sY t | t rI t | t | k oH t t t | j | j 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 R t allt _imapt _eqt iteritemsRC t __eq__( R t other( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyRZ s "N(" R R R R* RC R. R4 R7 R8 R@ RB t MutableMappingt
setdefaultR$ R/ t keyst valuesR= t iterkeysRA RY t __ne__RF RH RJ t TrueRO R RP R: t classmethodR" RT RZ ( ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR . s6
c B s/ e | e r* | j d d j } n e e e | } | r e | } e } x e | D] \ } } e
d | D s e | s | s | d j s | j
d s | | k r d | | | <n | j | qg We | } n x | f | D]q } e
d | D s6e d | n e | rUe d | n | d j re d
| qqWe } xc | D][ } | j
d r| re d | n | | k re d | n | j | qWe | } e | j d
d d d !}
d j d | D } d e } x1 e | D]# \ } } | d | | | f 7} qIW| r~| GHn e d e d d | d e d e d e }
y | |
UWn* e k
r} e | j d | n X|
| } y% e j d j j d d | _ Wn e e f k
r*n X| S( s> Returns a new subclass of tuple with named fields.
>>> Point = namedtuple('Point', 'x y')
>>> Point.__doc__ # docstring for the new class
'Point(x, y)'
>>> p = Point(11, y=22) # instantiate with positional args or keywords
>>> p[0] + p[1] # indexable like a plain tuple
33
>>> x, y = p # unpack like a regular tuple
>>> x, y
(11, 22)
>>> p.x + p.y # fields also accessable by name
33
>>> d = p._asdict() # convert to a dictionary
>>> d['x']
11
>>> Point(**d) # convert from a dictionary
Point(x=11, y=22)
>>> p._replace(x=100) # _replace() is like str.replace() but targets named fields
Point(x=100, y=22)
t ,t c s s' | ] } | j p | d k Vq d S( t _N( t isalnum( t .0t c( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pys <genexpr> s i Rf s _%dc s s' | ] } | j p | d k Vq d S( Rf N( Rg ( Rh Ri ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pys <genexpr> s sW Type names and field names can only contain alphanumeric characters and underscores: %rs2 Type names and field names cannot be a keyword: %rs9 Type names and field names cannot start with a number: %rs/ Field names cannot start with an underscore: %rs$ Encountered duplicate field name: %rt 't i is , c s s | ] } d | Vq d S( s %s=%%rN( ( Rh t name( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pys <genexpr> s s class %(typename)s(tuple):
'%(typename)s(%(argtxt)s)'
__slots__ = ()
_fields = %(field_names)r
def __new__(_cls, %(argtxt)s):
'Create new instance of %(typename)s(%(argtxt)s)'
return _tuple.__new__(_cls, (%(argtxt)s))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new %(typename)s object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != %(numfields)d:
raise TypeError('Expected %(numfields)d arguments, got %%d' %% len(result))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return '%(typename)s(%(reprtxt)s)' %% self
def _asdict(self):
'Return a new OrderedDict which maps field names to their values'
return OrderedDict(zip(self._fields, self))
def _replace(_self, **kwds):
'Return a new %(typename)s object replacing specified fields with new values'
result = _self._make(map(kwds.pop, %(field_names)r, _self))
if kwds:
raise ValueError('Got unexpected field names: %%r' %% kwds.keys())
return result
def __getnewargs__(self):
'Return self as a plain tuple. Used by copy and pickle.'
return tuple(self)
sI %s = _property(_itemgetter(%d), doc='Alias for field number %d')
t _itemgetterR s
namedtuple_%sR t _propertyt _tuples :
t __main__( RU t
basestringt replacet splitt tuplet mapt strt listR t enumerateRV t
_iskeywordt isdigitt
startswithR t
ValueErrorR t reprt joint localsRC Rm R t propertyt SyntaxErrort messaget _syst _getframet f_globalst getR R! ( t typenamet field_namest verboset renamet namest seent iRl t
seen_namest numfieldst argtxtt reprtxtt templatet namespacet eR ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR s^ #&
%c B s e Z d Z d d Z d Z d d Z d Z e d d Z d d Z
d 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('abracadabra') # count elements from a string
>>> c.most_common(3) # three most common elements
[('a', 5), ('r', 2), ('b', 2)]
>>> sorted(c) # list all unique elements
['a', 'b', 'c', 'd', 'r']
>>> ''.join(sorted(c.elements())) # list elements with repetitions
'aaaaabbcdrr'
>>> sum(c.values()) # total of all counts
11
>>> 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['r'] # remove all 'r'
>>> c['r'] # now there are zero 'r'
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 K s | 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
N( R$ ( R RR R& ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR* y s c C s d S( s1 The count of elements not in the Counter is zero.i ( ( R R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.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('abracadabra').most_common(3)
[('a', 5), ('r', 2), ('b', 2)]
R i t reverseN( R" t sortedRY Rm Rb t _heapqt nlargest( R t n( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.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 _repeatRY ( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt elements s c C s t d d S( Ns@ Counter.fromkeys() is undefined. Use Counter(iterable) instead.( t NotImplementedError( RQ RR t v( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyRT s c K s | d k r t | t rt | ra | j } xD | j D]# \ } } | | d | | | <q7 Wq t j | | q | j } x( | D] } | | d d | | <q Wn | 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
i i N( R" RU t MappingR RY RC R$ ( R RR R& t self_gett elemt count( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR$ s
c K s | d k r | j } t | t r[ x\ | j D]# \ } } | | d | | | <q1 Wq x( | D] } | | d d | | <qb 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
i i N( R" R RU R R= t subtract( R RR R& R R R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR s
c C s
t | S( sB Like dict.copy() but returns a Counter instance instead of a dict.( R ( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR: s c C s# | | k r t j | | n d S( sG Like dict.__delitem__() but does not raise KeyError for missing values.N( RC R4 ( R R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR4 s c C sI | s d | j j Sd j t d j | j } d | j j | f S( Ns %s()s , s %r: %rs %s({%s})( R; R R~ Ru t __mod__R ( R R= ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyRP s !c C sl t | t s t St } xI t | t | BD]1 } | | | | } | d k r3 | | | <q3 q3 W| S( s Add counts from two counters.
>>> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
i ( RU R t NotImplementedR ( R R[ R R t newcount( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __add__
s c C sl t | t s t St } xI t | t | BD]1 } | | | | } | d k r3 | | | <q3 q3 W| S( s Subtract count, but keep only results with positive counts.
>>> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
i ( RU R R R ( R R[ R R R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __sub__ s c C s t | t s t St } xd t | t | BD]L } | | | | } } | | k r` | n | } | d k r3 | | | <q3 q3 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 ( RU R R R ( R R[ R R t pt qR ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __or__- s c C s t | t s t St } t | t | k rD | | } } n x` t | j | D]L } | | | | } } | | k r | n | } | d k rW | | | <qW qW W| S( s Intersection is the minimum of corresponding counts.
>>> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
i ( RU R R R t _ifiltert __contains__( R R[ R R R R R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __and__> s N( R R R R" R* R R R Rc RT R$ R R: R4 RP R R R R ( ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR F s +
# Rp ( t loadst dumpst Points x, yt xi
t yi s x yc B s& e Z d Z e d Z d Z RS( c C s | j d | j d d S( Ni g ?( R R ( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt hypot\ s c C s d | j | j | j f S( Ns$ Point: x=%6.3f y=%6.3f hypot=%6.3f( R R R ( R ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt __str___ s ( ( R R t __slots__R R R ( ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR Z s i i i i g @c B s/ e Z d Z d Z e e j Z e d Z RS( sH Point class with optimized _make() and _replace() without error-checkingc K s | j | | j d | S( NR R ( R R ( t _makeR ( R t _mapR& ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt _replacei s ( (
R R R R Rc Rt t __new__R Ru R ( ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyR e s i i id t Point3Dt zt TestResultss failed attempted(6 t __all__t _abcollt _collectionsR R t operatorR Rm R RX t keywordR Ry t sysR t heapqR t itertoolsR R R
R R R R R R
RW t threadR t ImportErrort dummy_threadR RC R\ R t FalseR R R t cPickleR R Rb R R t AssertionErrorR t _fieldsR R t doctestR t testmod( ( ( sM C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE\Python\Lib\collections.pyt <module> sB
(
v
)