Lc @ s9 d d d d g Z d d k Td d k Z e e i 7Z d d k l Z l Z d d k l Z d d k l Z
d d k Z d d
k
l Z d d k l Z y d d k l Z Wn# e j
o d d k l Z n Xd e f d
YZ e d Z e d j o5d d k l Z l Z e d d e Z e d d d d Z! e! e e e! j p t" 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 i# d d! GHe d" e i$ d& Z% e% i& GHd d k' Z' e d$ d% Z( e( e' i) GHn d S(' t dequet defaultdictt
namedtuplet OrderedDicti( t *N( R R ( t
itemgetter( t iskeyword( t imap( t eq( t get_identc B s e Z d Z d Z e i d Z e i d Z d Z d Z d Z d Z
d Z d Z d
Z
d Z d Z e i Z e Z e Z e d
Z d d Z e d Z h 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 t | d j o t d t | n y | i Wn9 t j
o- g | _ } | | d g | (h | _ n X| i | | 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.
i s$ expected at most 1 arguments, got %dN( t lent TypeErrort _OrderedDict__roott AttributeErrort Nonet _OrderedDict__mapt _OrderedDict__update( t selft argst kwdst root( ( s! /usr/lib/python2.6/collections.pyt __init__ s
c C sZ | | j o= | i } | d } | | | g | d <| d <| i | <n | | | | S( s! od.__setitem__(i, y) <==> od[i]=yi i ( R R ( R t keyt valuet dict_setitemR t last( ( s! /usr/lib/python2.6/collections.pyt __setitem__/ s
*c C s@ | | | | i i | \ } } } | | d <| | d <d S( s od.__delitem__(y) <==> del od[y]i i N( R t pop( R R t dict_delitemt link_prevt link_nextt _( ( s! /usr/lib/python2.6/collections.pyt __delitem__9 s
c c s? | i } | d } x% | | j o | d V| d } q Wd S( s od.__iter__() <==> iter(od)i i N( R ( R R t curr( ( s! /usr/lib/python2.6/collections.pyt __iter__B s
c c s? | i } | d } x% | | j o | d V| d } q Wd S( s# od.__reversed__() <==> reversed(od)i i N( R ( R R R! ( ( s! /usr/lib/python2.6/collections.pyt __reversed__K s
c C s7 | i } | | d g | (| i i t i | d S( s. od.clear() -> None. Remove all items from od.N( R R R t cleart dict( R R ( ( s! /usr/lib/python2.6/collections.pyR$ T s
c C s
t | S( s od.keys() -> list of keys in od( t list( R ( ( s! /usr/lib/python2.6/collections.pyt keys] s c C s# g } | D] } | | | q ~ S( s# od.values() -> list of values in od( ( R t _[1]R ( ( s! /usr/lib/python2.6/collections.pyt valuesa s c C s) g } | D] } | | | | f q ~ S( s. od.items() -> list of (key, value) pairs in od( ( R R( R ( ( s! /usr/lib/python2.6/collections.pyt itemse s c C s
t | S( s0 od.iterkeys() -> an iterator over the keys in od( t iter( R ( ( s! /usr/lib/python2.6/collections.pyt iterkeysi s c c s x | D] } | | Vq Wd S( s2 od.itervalues -> an iterator over the values in odN( ( R t k( ( s! /usr/lib/python2.6/collections.pyt
itervaluesm s c c s$ x | D] } | | | f Vq Wd S( s= od.iteritems -> an iterator over the (key, value) pairs in odN( ( R R- ( ( s! /usr/lib/python2.6/collections.pyt iteritemsr s c C sG | | j o | | } | | =| S| | i j o 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/lib/python2.6/collections.pyR } s
c C s$ | | j o | | S| | | <| S( sD od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od( ( R R R2 ( ( s! /usr/lib/python2.6/collections.pyt
setdefault s
c C sV | p t d n t | o
t | n
t | } | i | } | | 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( R1 t nextt reversedR+ R ( R R R R ( ( s! /usr/lib/python2.6/collections.pyt popitem s
&c C sw t | t f } | | j o d Sd | | <z7 | p d | i i f Sd | i i | i f SWd | | =Xd S( s od.__repr__() <==> 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/lib/python2.6/collections.pyt __repr__ s
c C s g } | D] } | | | | g q ~ } t | i } x' t t D] } | i | d qM W| o | i | f | f S| i | f f S( s% Return state information for picklingN( t varst copyR R R R: ( R R( R- R* t inst_dict( ( s! /usr/lib/python2.6/collections.pyt
__reduce__ s + c C s
| i | S( s! od.copy() -> a shallow copy of od( R: ( R ( ( s! /usr/lib/python2.6/collections.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 ( ( s! /usr/lib/python2.6/collections.pyt fromkeys s
c C sJ t | t o* t i | | o t t t | | St i | | 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/lib/python2.6/collections.pyRG s *c C s | | j S( s od.__ne__(y) <==> od!=y( ( R RK ( ( s! /usr/lib/python2.6/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/lib/python2.6/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/lib/python2.6/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/lib/python2.6/collections.pyt viewitems s N($ R; t
__module__t __doc__R R% R R R" R# R$ R' R) R* R, R. R/ t MutableMappingt updateR t objectR0 R R R4 t TrueR7 R> RB R@ t classmethodRE RG RL RN RP RR ( ( ( s! /usr/lib/python2.6/collections.pyR s:
c B s e | e o | i d d i } n e e e | } x | f | D]w } e d | D p e d | n e | o e d | n | d i
o e d | qO qO We } x` | D]X } | i d o e d | n | | j o e d
| n | i
| q We | } e | i d d d
d !} d i d | D } d i d e | D } d e } x. e | D] \ }
} | d | |
f 7} qW| o | GHn e d e d d | d e d e } y | | UWn, e j
o } e | i d | n X| | }
e e d o% e i d
i i d d |
_ n |
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, x% | ] } | i p
| d j Vq Wd S( R N( t isalnum( t .0t c( ( s! /usr/lib/python2.6/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: %ri s9 Type names and field names cannot start with a number: %rR s/ Field names cannot start with an underscore: %rs$ Encountered duplicate field name: %rt 't i is , c s s x | ] } d | Vq Wd S( s %s=%%rN( ( R] t name( ( s! /usr/lib/python2.6/collections.pys <genexpr> s c s s) x" | ] \ } } d | | f Vq Wd S( s %r: t[%d]N( ( R] t posRa ( ( s! /usr/lib/python2.6/collections.pys <genexpr> s s class %(typename)s(tuple):
'%(typename)s(%(argtxt)s)'
__slots__ = ()
_fields = %(field_names)r
def __new__(_cls, %(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 '%(typename)s(%(reprtxt)s)' %% self
def _asdict(t):
'Return a new dict which maps field names to their values'
return {%(dicttxt)s}
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 tuple(self)
s( %s = _property(_itemgetter(%d))
t _itemgetterR; s
namedtuple_%st _propertyt _tuples :
t _getframet __main__( RF t
basestringt replacet splitt tuplet mapt strRH t
ValueErrort
_iskeywordt isdigitt sett
startswitht addR
t reprt joint enumeratet localsR% Rc t propertyt SyntaxErrort messaget hasattrt _sysRf t f_globalst getRS ( t typenamet field_namest verboseRa t
seen_namest numfieldst argtxtt reprtxtt dicttxtt templatet it namespacet eR3 ( ( s! /usr/lib/python2.6/collections.pyR sN
%Rg ( 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 | i d | i d d S( Ni g ?( R R ( R ( ( s! /usr/lib/python2.6/collections.pyt hypotP s c C s d | i | i | i f S( Ns$ Point: x=%6.3f y=%6.3f hypot=%6.3f( R R R ( R ( ( s! /usr/lib/python2.6/collections.pyt __str__S s ( ( R; RS t __slots__Rx R R ( ( ( s! /usr/lib/python2.6/collections.pyR N s i i i i g @c B s/ e Z d Z d Z e e i Z e d Z RS( sH Point class with optimized _make() and _replace() without error-checkingc K s | i | | i d | S( NR R ( R R ( t _makeR~ ( R t _mapR ( ( s! /usr/lib/python2.6/collections.pyt _replace] s ( (
R; RS RT R RY Rk t __new__R Rl R ( ( ( s! /usr/lib/python2.6/collections.pyR Y s i i id t Point3Dt zt TestResultss failed attempted( R (* t __all__t _abcollt _collectionsR R t operatorR Rc t keywordR Ro t sysR| t itertoolsR RI R RJ t threadR R9 t ImportErrort dummy_threadR% R t FalseR R; t cPickleR R RX R t pt AssertionErrorR t _fieldsR RT t doctestR t testmod( ( ( s! /usr/lib/python2.6/collections.pyt <module> s>
g
#
y~or5J ={Eeu磝Qk ᯘG{?+]ן?wM3X^歌>{7پK>on\jy R g/=fOroNVv~Y+ NGuÝHWyw[eQʨSb> >}Gmx[o[<{Ϯ_qF vM IENDB`
