Edit: /usr/lib64/python2.7/collections.pyo (26112B)
z fc @ sj d Z 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 d d
l m Z y d d l m Z Wn! e k
r d d l m Z n Xd e f d YZ! d Z" d Z# d Z$ e% e% d Z& d e f d YZ' e( d k rfd d l) m* Z* m+ Z+ e& d d e, Z- e- d d d d Z. 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 j GHd d l2 Z2 e& d* d+ Z3 e3 e2 j4 GHn d S(, s This module implements specialized container datatypes providing
alternatives to Python's general purpose built-in containers, dict,
list, set, and tuple.
* namedtuple factory function for creating tuple subclasses with named fields
* deque list-like container with fast appends and pops on either end
* Counter dict subclass for counting hashable objects
* OrderedDict dict subclass that remembers the order entries were added
* defaultdict dict subclass that calls a factory function to supply missing values
t Countert dequet defaultdictt
namedtuplet OrderedDicti( t *N( R R ( t
itemgettert eq( t iskeyword( t repeatt chaint starmap( t imap( t get_identc B s e Z d Z d Z e j d Z e j d Z d Z d Z d Z d Z
d Z d Z d
Z
d Z d Z e j Z e Z e Z e d
Z d d Z e d Z i d Z d Z d Z e d d Z d Z d Z d Z! 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 Wn7 t k
r g | _ } | | d g | (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 AttributeErrort Nonet _OrderedDict__mapt _OrderedDict__update( t argst kwdst selft root( ( s# /usr/lib64/python2.7/collections.pyt __init__2 s
c C sX | | k rH | j } | d } | | | g | d <| d <| j |
od[i]=yi i ( R R ( R t keyt valuet dict_setitemR t last( ( s# /usr/lib64/python2.7/collections.pyt __setitem__G s
)c C s@ | | | | j j | \ } } } | | d <| | d del od[y]i i N( R t pop( R R t dict_delitemt link_prevt link_nextt _( ( s# /usr/lib64/python2.7/collections.pyt __delitem__Q s
c c s= | j } | d } x# | | k r8 | d V| d } q Wd S( s od.__iter__() <==> iter(od)i i N( R ( R R t curr( ( s# /usr/lib64/python2.7/collections.pyt __iter__Z s
c c s= | j } | d } x# | | k r8 | d V| d } q Wd S( s# od.__reversed__() <==> reversed(od)i i N( R ( R R R% ( ( s# /usr/lib64/python2.7/collections.pyt __reversed__c s
c C s7 | j } | | d g | (| j j t j | d S( s. od.clear() -> None. Remove all items from od.N( R R R t cleart dict( R R ( ( s# /usr/lib64/python2.7/collections.pyR( l s
c C s
t | S( s od.keys() -> list of keys in od( t list( R ( ( s# /usr/lib64/python2.7/collections.pyt keysu s c C s g | D] } | | ^ q S( s# od.values() -> list of values in od( ( R R ( ( s# /usr/lib64/python2.7/collections.pyt valuesy s c C s! g | D] } | | | f ^ q S( s. od.items() -> list of (key, value) pairs in od( ( R R ( ( s# /usr/lib64/python2.7/collections.pyt items} s c C s
t | S( s0 od.iterkeys() -> an iterator over the keys in od( t iter( R ( ( s# /usr/lib64/python2.7/collections.pyt iterkeys s c c s x | D] } | | Vq Wd S( s2 od.itervalues -> an iterator over the values in odN( ( R t k( ( s# /usr/lib64/python2.7/collections.pyt
itervalues s
c c s$ x | D] } | | | f Vq Wd S( s= od.iteritems -> an iterator over the (key, value) pairs in odN( ( R R0 ( ( s# /usr/lib64/python2.7/collections.pyt iteritems 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__markert KeyError( R R t defaultt result( ( s# /usr/lib64/python2.7/collections.pyR 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 R5 ( ( s# /usr/lib64/python2.7/collections.pyt
setdefault 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( R4 t nextt reversedR. R ( R R R R ( ( s# /usr/lib64/python2.7/collections.pyt popitem s
$c C ss t | t f } | | k r% d Sd | | repr(od)s ...i s %s()s %s(%r)N( t idt
_get_identt __class__t __name__R- ( R t
_repr_runningt call_key( ( s# /usr/lib64/python2.7/collections.pyt __repr__ s
c C s g | D] } | | | g ^ q } t | j } x' t t D] } | j | d qE W| rx | j | f | f S| j | f f S( s% Return state information for picklingN( t varst copyR R R R= ( R R0 R- t inst_dict( ( s# /usr/lib64/python2.7/collections.pyt
__reduce__ s #c C s
| j | S( s! od.copy() -> a shallow copy of od( R= ( R ( ( s# /usr/lib64/python2.7/collections.pyRC s c C s( | } x | D] } | | | New ordered dictionary with keys from S.
If not specified, the value defaults to None.
( ( t clst iterableR R R ( ( s# /usr/lib64/python2.7/collections.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 R) t __eq__t allt _imapt _eq( R t other( ( s# /usr/lib64/python2.7/collections.pyRJ s (c C s | | k S( s od.__ne__(y) <==> od!=y( ( R RN ( ( s# /usr/lib64/python2.7/collections.pyt __ne__ s c C s
t | S( s@ od.viewkeys() -> a set-like object providing a view on od's keys( t KeysView( R ( ( s# /usr/lib64/python2.7/collections.pyt viewkeys s c C s
t | S( s< od.viewvalues() -> an object providing a view on od's values( t
ValuesView( R ( ( s# /usr/lib64/python2.7/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 ( ( s# /usr/lib64/python2.7/collections.pyt viewitems s N($ R> t
__module__t __doc__R R) R R$ R& R' R( R+ R, R- R/ R1 R2 t MutableMappingt updateR t objectR3 R R R7 t TrueR: RA RE RC t classmethodRH RJ RO RQ RS RU ( ( ( s# /usr/lib64/python2.7/collections.pyR & s:
s class {typename}(tuple):
'{typename}({arg_list})'
__slots__ = ()
_fields = {field_names!r}
def __new__(_cls, {arg_list}):
'Create new instance of {typename}({arg_list})'
return _tuple.__new__(_cls, ({arg_list}))
@classmethod
def _make(cls, iterable, new=tuple.__new__, len=len):
'Make a new {typename} object from a sequence or iterable'
result = new(cls, iterable)
if len(result) != {num_fields:d}:
raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))
return result
def __repr__(self):
'Return a nicely formatted representation string'
return '{typename}({repr_fmt})' % 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} 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)
__dict__ = _property(_asdict)
def __getstate__(self):
'Exclude the OrderedDict from pickling'
pass
{field_defs}
s {name}=%rsW {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')
c B s@ e | e r* | j d d j } n e e | } e | } | r e } x e | D] \ } } e d | D s e | s | s | d j
s | j d s | | k r d | | | >> 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 accessible 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( R# N( t isalnum( t .0t c( ( s# /usr/lib64/python2.7/collections.pys R s i R# s _%ds* Type names and field names must be stringsc s s' | ] } | j p | d k Vq d S( R# N( R_ ( R` Ra ( ( s# /usr/lib64/python2.7/collections.pys ] 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 typenamet field_namest
num_fieldst arg_listt 't i it repr_fmts , c s s! | ] } t j d | Vq d S( t nameN( t _repr_templatet format( R` Ri ( ( s# /usr/lib64/python2.7/collections.pys u s t
field_defss
c s s- | ]# \ } } t j d | d | Vq d S( t indexRi N( t _field_templateRk ( R` Rm Ri ( ( s# /usr/lib64/python2.7/collections.pys w s t _itemgetterR> s
namedtuple_%sR t _propertyt _tuples :
t __main__(" RI t
basestringt replacet splitt mapt strt sett enumerateRK t
_iskeywordt isdigitt
startswitht addt typeR t
ValueErrort _class_templateRk t tupleR t reprt joinR) Ro R t propertyt SyntaxErrort messaget _syst _getframet f_globalst getRV R ( Rb Rc t verboset renamet seenRm Ri t class_definitiont namespacet eR6 ( ( s# /usr/lib64/python2.7/collections.pyR 1 st
%
%c 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 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 R t superR R RY ( R R R ( ( s# /usr/lib64/python2.7/collections.pyR s
c C s d S( s1 The count of elements not in the Counter is zero.i ( ( R R ( ( s# /usr/lib64/python2.7/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('abcdeabcdabcaba').most_common(3)
[('a', 5), ('b', 4), ('c', 3)]
R i t reverseN( R t sortedR2 Ro R[ t _heapqt nlargest( R t n( ( s# /usr/lib64/python2.7/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 _repeatR2 ( R ( ( s# /usr/lib64/python2.7/collections.pyt elements s c C s t d d S( Ns@ Counter.fromkeys() is undefined. Use Counter(iterable) instead.( t NotImplementedError( RF RG t v( ( s# /usr/lib64/python2.7/collections.pyRH s c O s2 | s t d n | d } | d } t | d k rT t d t | n | rd | d n d } | d k rt | t r | r | j } xJ | j D]# \ } } | | d | | | >> 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 R R RI t MappingR R2 R R RY ( R R R RG t self_gett elemt count( ( s# /usr/lib64/python2.7/collections.pyRY 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 | | | >> 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 R R R RI R R- t subtract( R R R RG R R R ( ( s# /usr/lib64/python2.7/collections.pyR ; s
c C s
| j | S( s Return a shallow copy.( R= ( R ( ( s# /usr/lib64/python2.7/collections.pyRC ^ s c C s | j t | f f S( N( R= R) ( R ( ( s# /usr/lib64/python2.7/collections.pyRE b 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 R R$ ( R R ( ( s# /usr/lib64/python2.7/collections.pyR$ e 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 Rv t __mod__R ( R R- ( ( s# /usr/lib64/python2.7/collections.pyRA j s !c C s t | t s t St } xA | j D]3 \ } } | | | } | d k r) | | | >> Counter('abbb') + Counter('bcc')
Counter({'b': 4, 'c': 2, 'a': 1})
i ( RI R t NotImplementedR- ( R RN R6 R R t newcount( ( s# /usr/lib64/python2.7/collections.pyt __add__y s c C s t | t s t St } xA | j D]3 \ } } | | | } | d k r) | | | >> Counter('abbbc') - Counter('bccd')
Counter({'b': 2, 'a': 1})
i ( RI R R R- ( R RN R6 R R R ( ( s# /usr/lib64/python2.7/collections.pyt __sub__ s c C s t | t s t St } xU | j D]G \ } } | | } | | k rQ | n | } | d k r) | | | >> Counter('abbb') | Counter('bcc')
Counter({'b': 3, 'c': 2, 'a': 1})
i ( RI R R R- ( R RN R6 R R t other_countR ( ( s# /usr/lib64/python2.7/collections.pyt __or__ s
c C sx t | t s t St } xU | j D]G \ } } | | } | | k rQ | n | } | d k r) | | | >> Counter('abbb') & Counter('bcc')
Counter({'b': 1})
i ( RI R R R- ( R RN R6 R R R R ( ( s# /usr/lib64/python2.7/collections.pyt __and__ s
N( R> RV RW R R R R R R\ RH RY R RC RE R$ RA R R R R ( ( ( s# /usr/lib64/python2.7/collections.pyR s" +
+ # Rr ( 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 ( ( s# /usr/lib64/python2.7/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 ( ( s# /usr/lib64/python2.7/collections.pyt __str__ s ( ( R> RV t __slots__R R R ( ( ( s# /usr/lib64/python2.7/collections.pyR 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 ( ( s# /usr/lib64/python2.7/collections.pyt _replace s ( (
R> RV RW R R\ R t __new__R Rv R ( ( ( s# /usr/lib64/python2.7/collections.pyR s i i id t Point3Dt zt TestResultss failed attempted(5 RW t __all__t _abcollt _collectionsR R t operatorR Ro R RM t keywordR Rz t sysR t heapqR t itertoolsR R R
R R R R RL t threadR
R< t ImportErrort dummy_threadR) R R Rj Rn t FalseR R R> t cPickleR R R[ R t pR t _fieldsR t doctestR t testmod( ( ( s# /usr/lib64/python2.7/collections.pyt sJ
f / )