Server : LiteSpeed System : Linux premium84.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64 User : claqxcrl ( 523) PHP Version : 8.1.32 Disable Function : NONE Directory : /opt/alt/python33/lib64/python3.3/collections/__pycache__/ |
�
�� f�J c @ s� d Z d d l m Z m Z d d l Z d d d d d d d
d d d
d d d d d d d g Z e e d � � Z e e e � � � Z
e e i j � � � Z e e i j
� � � Z e e i j � � � Z e e g � � Z e e e g � � � Z e e e d � � � Z e e e � � � Z e e d � � Z e e f � � Z e e e � � � Z e i j � � Z e i j
� � Z e i j � � Z e e j � Z Gd d � d d e �Z! Gd d � d d e �Z" Gd d � d e" � Z# e# j$ e � e# j$ e
� e# j$ e � e# j$ e � e# j$ e � e# j$ e � e# j$ e � e# j$ e � e# j$ e � e# j$ e � e# j$ e � e# j$ e � Gd d � d d e �Z% Gd d � d d e �Z& Gd d � d d e �Z' Gd d
� d
e% e" e& � Z( e( j$ e) � Gd d � d e( � Z* e* j$ e � Gd d � d e% e" e& � Z+ e+ j$ e � Gd! d � d e% � Z, Gd" d � d e, e( � Z- e- j$ e � Gd# d � d e, e( � Z. e. j$ e � Gd$ d � d e, � Z/ e/ j$ e � Gd% d
� d
e+ � Z0 e0 j$ e1 � Gd& d � d e% e" e& � Z2 e2 j$ e3 � e2 j$ e4 � e2 j$ e � Gd' d � d e2 � Z5 e5 j$ e6 � e5 j$ e � Gd( d � d e2 � Z7 e7 j$ e8 � e7 j$ e � d S() uj Abstract Base Classes (ABCs) for collections, according to PEP 3119.
Unit tests are in test_collections.
i ( u ABCMetau abstractmethodNu Hashableu Iterableu Iteratoru Sizedu Containeru Callableu Setu
MutableSetu Mappingu MutableMappingu MappingViewu KeysViewu ItemsViewu
ValuesViewu Sequenceu MutableSequenceu
ByteStrings u c B s> | Ee Z d Z f Z e d d � � Z e d d � � Z d S( u Hashablec C s d S( Ni ( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __hash__7 s u Hashable.__hash__c C sK | t k rG x8 | j D]* } d | j k r | j d r< d SPq q Wn t S( Nu __hash__T( u Hashableu __mro__u __dict__u Trueu NotImplemented( u clsu Cu B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__; s
u Hashable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __hash__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Hashable3 s u metaclassc B s> | Ee Z d Z f Z e d d � � Z e d d � � Z d S( u Iterablec c s d S( N( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__J s u Iterable.__iter__c C s3 | t k r/ t d d � | j D� � r/ d Sn t S( Nc s s | ] } d | j k Vq d S( u __iter__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>R s u, Iterable.__subclasshook__.<locals>.<genexpr>T( u Iterableu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__O s u Iterable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __iter__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu IterableF s c B sJ | Ee Z d Z f Z e d d � � Z d d � Z e d d � � Z d S( u Iteratorc C s
t � d S( uK Return the next item from the iterator. When exhausted, raise StopIterationN( u
StopIteration( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __next__[ s u Iterator.__next__c C s | S( N( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__` s u Iterator.__iter__c C sO | t k rK t d d � | j D� � rK t d d � | j D� � rK d Sn t S( Nc s s | ] } d | j k Vq d S( u __next__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>f s u, Iterator.__subclasshook__.<locals>.<genexpr>c s s | ] } d | j k Vq d S( u __iter__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>g s T( u Iteratoru anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__c s
u Iterator.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __next__u __iter__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu IteratorW s c B s> | Ee Z d Z f Z e d d � � Z e d d � � Z d S( u Sizedc C s d S( Ni ( ( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __len__} s u
Sized.__len__c C s3 | t k r/ t d d � | j D� � r/ d Sn t S( Nc s s | ] } d | j k Vq d S( u __len__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>� s u) Sized.__subclasshook__.<locals>.<genexpr>T( u Sizedu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__� s u Sized.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __len__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Sizedy s c B s> | Ee Z d Z f Z e d d � � Z e d d � � Z d S( u Containerc C s d S( NF( u False( u selfu x( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__� s u Container.__contains__c C s3 | t k r/ t d d � | j D� � r/ d Sn t S( Nc s s | ] } d | j k Vq d S( u __contains__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>� s u- Container.__subclasshook__.<locals>.<genexpr>T( u Containeru anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__� s u Container.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __contains__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Container� s c B s> | Ee Z d Z f Z e d d � � Z e d d � � Z d S( u Callablec O s d S( NF( u False( u selfu argsu kwds( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __call__� s u Callable.__call__c C s3 | t k r/ t d d � | j D� � r/ d Sn t S( Nc s s | ] } d | j k Vq d S( u __call__N( u __dict__( u .0u B( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>� s u, Callable.__subclasshook__.<locals>.<genexpr>T( u Callableu anyu __mro__u Trueu NotImplemented( u clsu C( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __subclasshook__� s u Callable.__subclasshook__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __call__u classmethodu __subclasshook__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Callable� s c B s� | Ee Z d Z d Z f Z d d � Z d d � Z d d � Z d d � Z d
d � Z d d
� Z
e d d � � Z d d � Z
d d � Z d d � Z d d � Z d d � Z d d � Z d S( u Setuh A set is a finite, iterable container.
This class provides concrete generic implementations of all
methods except for __contains__, __iter__ and __len__.
To override the comparisons (presumably for speed, as the
semantics are fixed), all you have to do is redefine __le__ and
then the other operations will automatically follow suit.
c C sT t | t � s t St | � t | � k r/ d Sx | D] } | | k r6 d Sq6 Wd S( NFT( u
isinstanceu Setu NotImplementedu lenu Falseu True( u selfu otheru elem( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __le__� s
u
Set.__le__c C s8 t | t � s t St | � t | � k o7 | j | � S( N( u
isinstanceu Setu NotImplementedu lenu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __lt__� s u
Set.__lt__c C s t | t � s t S| j | � S( N( u
isinstanceu Setu NotImplementedu __lt__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __gt__� s u
Set.__gt__c C s t | t � s t S| j | � S( N( u
isinstanceu Setu NotImplementedu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ge__� s u
Set.__ge__c C s8 t | t � s t St | � t | � k o7 | j | � S( N( u
isinstanceu Setu NotImplementedu lenu __le__( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __eq__� s u
Set.__eq__c C s | | k S( N( ( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ne__� s u
Set.__ne__c C s
| | � S( u� Construct an instance of the class from any iterable input.
Must override this method if the class constructor signature
does not accept an iterable for an input.
( ( u clsu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable� s u Set._from_iterablec s3 t | t � s t S� j � f d d � | D� � S( Nc 3 s! | ] } | � k r | Vq d S( N( ( u .0u value( u self( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>� s u Set.__and__.<locals>.<genexpr>( u
isinstanceu Iterableu NotImplementedu _from_iterable( u selfu other( ( u selfu4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __and__� s u Set.__and__c C s% x | D] } | | k r d Sq Wd S( u1 Return True if two sets have a null intersection.FT( u Falseu True( u selfu otheru value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
isdisjoint� s
u Set.isdisjointc C s9 t | t � s t Sd d � | | f D� } | j | � S( Nc s s" | ] } | D] } | Vq
q d S( N( ( u .0u su e( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>� s u Set.__or__.<locals>.<genexpr>( u
isinstanceu Iterableu NotImplementedu _from_iterable( u selfu otheru chain( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __or__� s u
Set.__or__c sT t � t � s4 t � t � s" t S| j � � � n | j � f d d � | D� � S( Nc 3 s! | ] } | � k r | Vq d S( N( ( u .0u value( u other( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>� s u Set.__sub__.<locals>.<genexpr>( u
isinstanceu Setu Iterableu NotImplementedu _from_iterable( u selfu other( ( u otheru4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __sub__� s
u Set.__sub__c C sD t | t � s4 t | t � s" t S| j | � } n | | | | BS( N( u
isinstanceu Setu Iterableu NotImplementedu _from_iterable( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __xor__� s
u Set.__xor__c C s� t j } d | d } t | � } d | d } | | M} x> | D]6 } t | � } | | | d >Ad Ad N} | | M} qB W| d d } | | M} | | k r� | | d 8} n | d
k r� d } n | S( u+ Compute the hash value of a set.
Note that we don't define __hash__: not all sets are hashable.
But if you define a hashable set type, its __hash__ should
call this function.
This must be compatible __eq__.
All sets ought to compare equal if they contain the same
elements, regardless of how they are implemented, and
regardless of the order of the elements; so there's not much
freedom for __eq__ or __hash__. We match the algorithm used
by the built-in frozenset type.
i i iM��ri i�M[l �4~2 i�
i��6i��8#i����( u sysu maxsizeu lenu hash( u selfu MAXu MASKu nu hu xu hx( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _hash s
u Set._hashN( u __name__u
__module__u __qualname__u __doc__u __slots__u __le__u __lt__u __gt__u __ge__u __eq__u __ne__u classmethodu _from_iterableu __and__u
isdisjointu __or__u __sub__u __xor__u _hash( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Set� s
c B s� | Ee Z d Z d Z f Z e d d � � Z e d d � � Z d d � Z d d � Z d
d � Z
d d
� Z d d � Z d d � Z
d d � Z d S( u
MutableSetu� A mutable set is a finite, iterable container.
This class provides concrete generic implementations of all
methods except for __contains__, __iter__, __len__,
add(), and discard().
To override the comparisons (presumably for speed, as the
semantics are fixed), all you have to do is redefine __le__ and
then the other operations will automatically follow suit.
c C s
t � d S( u Add an element.N( u NotImplementedError( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu add6 s u MutableSet.addc C s
t � d S( u8 Remove an element. Do not raise an exception if absent.N( u NotImplementedError( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu discard; s u MutableSet.discardc C s, | | k r t | � � n | j | � d S( u5 Remove an element. If not a member, raise a KeyError.N( u KeyErroru discard( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu remove@ s u MutableSet.removec C sH t | � } y t | � } Wn t k
r6 t � Yn X| j | � | S( u2 Return the popped value. Raise KeyError if empty.( u iteru nextu
StopIterationu KeyErroru discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu popF s
u MutableSet.popc C s- y x
| j � q Wn t k
r( Yn Xd S( u6 This is slow (creates N new iterators!) but effective.N( u popu KeyError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clearP s
u MutableSet.clearc C s" x | D] } | j | � q W| S( N( u add( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ior__X s
u MutableSet.__ior__c C s& x | | D] } | j | � q W| S( N( u discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iand__] s u MutableSet.__iand__c C sx | | k r | j � n[ t | t � s: | j | � } n x7 | D]/ } | | k rc | j | � qA | j | � qA W| S( N( u clearu
isinstanceu Setu _from_iterableu discardu add( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ixor__b s
u MutableSet.__ixor__c C s; | | k r | j � n x | D] } | j | � q W| S( N( u clearu discard( u selfu itu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __isub__o s
u MutableSet.__isub__N( u __name__u
__module__u __qualname__u __doc__u __slots__u abstractmethodu addu discardu removeu popu clearu __ior__u __iand__u __ixor__u __isub__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
MutableSet( s
c B s� | Ee Z d Z f Z e d d � � Z d d d � Z d d � Z d d � Z d d
� Z
d d � Z d
d � Z d d � Z
d S( u Mappingc C s
t � d S( N( u KeyError( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __getitem__� s u Mapping.__getitem__c C s) y | | SWn t k
r$ | SYn Xd S( u< D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.N( u KeyError( u selfu keyu default( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu get� s
u Mapping.getc C s- y | | Wn t k
r$ d SYn Xd Sd S( NFT( u KeyErroru Falseu True( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__� s
u Mapping.__contains__c C s
t | � S( u: D.keys() -> a set-like object providing a view on D's keys( u KeysView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu keys� s u Mapping.keysc C s
t | � S( u< D.items() -> a set-like object providing a view on D's items( u ItemsView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu items� s u
Mapping.itemsc C s
t | � S( u6 D.values() -> an object providing a view on D's values( u
ValuesView( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu values� s u Mapping.valuesc C s5 t | t � s t St | j � � t | j � � k S( N( u
isinstanceu Mappingu NotImplementedu dictu items( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __eq__� s u Mapping.__eq__c C s | | k S( N( ( u selfu other( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __ne__� s u Mapping.__ne__N( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __getitem__u Noneu getu __contains__u keysu itemsu valuesu __eq__u __ne__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu Mapping} s
c B s8 | Ee Z d Z d d � Z d d � Z d d � Z d S( u MappingViewc C s
| | _ d S( N( u _mapping( u selfu mapping( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __init__� s u MappingView.__init__c C s
t | j � S( N( u lenu _mapping( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __len__� s u MappingView.__len__c C s
d j | � S( Nu& {0.__class__.__name__}({0._mapping!r})( u format( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __repr__� s u MappingView.__repr__N( u __name__u
__module__u __qualname__u __init__u __len__u __repr__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MappingView� s c B s> | Ee Z d Z e d d � � Z d d � Z d d � Z d S( u KeysViewc C s
t | � S( N( u set( u selfu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable� s u KeysView._from_iterablec C s
| | j k S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__� s u KeysView.__contains__c c s x | j D] } | Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__� s u KeysView.__iter__N( u __name__u
__module__u __qualname__u classmethodu _from_iterableu __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu KeysView� s c B s> | Ee Z d Z e d d � � Z d d � Z d d � Z d S( u ItemsViewc C s
t | � S( N( u set( u selfu it( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu _from_iterable� s u ItemsView._from_iterablec C sD | \ } } y | j | } Wn t k
r5 d SYn X| | k Sd S( NF( u _mappingu KeyErroru False( u selfu itemu keyu valueu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__� s
u ItemsView.__contains__c c s* x# | j D] } | | j | f Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__� s u ItemsView.__iter__N( u __name__u
__module__u __qualname__u classmethodu _from_iterableu __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu ItemsView� s c B s, | Ee Z d Z d d � Z d d � Z d S( u
ValuesViewc C s/ x( | j D] } | | j | k r
d Sq
Wd S( NTF( u _mappingu Trueu False( u selfu valueu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__� s u ValuesView.__contains__c c s$ x | j D] } | j | Vq
Wd S( N( u _mapping( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__� s u ValuesView.__iter__N( u __name__u
__module__u __qualname__u __contains__u __iter__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
ValuesView� s c B s� | Ee Z d Z f Z e d d � � Z e d d � � Z e � Z e d d � Z d d � Z
d d
� Z d d � Z d d
d � Z d S( u MutableMappingc C s
t � d S( N( u KeyError( u selfu keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __setitem__ s u MutableMapping.__setitem__c C s
t � d S( N( u KeyError( u selfu key( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __delitem__ s u MutableMapping.__delitem__c C sK y | | } Wn+ t k
r; | | j k r3 � n | SYn X| | =| Sd S( u� D.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.
N( u KeyErroru _MutableMapping__marker( u selfu keyu defaultu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu pop s
u MutableMapping.popc C sL y t t | � � } Wn t k
r0 t � Yn X| | } | | =| | f S( u� D.popitem() -> (k, v), remove and return some (key, value) pair
as a 2-tuple; but raise KeyError if D is empty.
( u nextu iteru
StopIterationu KeyError( u selfu keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu popitem s
u MutableMapping.popitemc C s- y x
| j � q Wn t k
r( Yn Xd S( u, D.clear() -> None. Remove all items from D.N( u popitemu KeyError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clear% s
u MutableMapping.clearc O s% t | � d k r0 t d j t | � � � � n | sE t d � � n | d } t | � d k rk | d n f } t | t � r� xw | D] } | | | | <q� WnX t | d � r� xF | j � D] } | | | | <q� Wn! x | D] \ } } | | | <q� Wx$ | j � D] \ } } | | | <qWd S( uK D.update([E, ]**F) -> None. Update D from mapping/iterable E and F.
If E present and has a .keys() method, does: for k in E: D[k] = E[k]
If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v
In either case, this is followed by: for k, v in F.items(): D[k] = v
i u8 update() takes at most 2 positional arguments ({} given)u, update() takes at least 1 argument (0 given)i i u keysN( u lenu TypeErroru formatu
isinstanceu Mappingu hasattru keysu items( u argsu kwdsu selfu otheru keyu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu update- s"
"
u MutableMapping.updatec C s/ y | | SWn t k
r* | | | <Yn X| S( u@ D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D( u KeyError( u selfu keyu default( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
setdefaultG s
u MutableMapping.setdefaultN( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __setitem__u __delitem__u objectu _MutableMapping__markeru popu popitemu clearu updateu Noneu
setdefault( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MutableMapping� s c B sn | Ee Z d Z d Z f Z e d d � � Z d d � Z d d � Z d d � Z d
d � Z
d d
� Z d S( u Sequenceu� All the operations on a read-only sequence.
Concrete subclasses must override __new__ or __init__,
__getitem__, and __len__.
c C s
t � d S( N( u
IndexError( u selfu index( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __getitem___ s u Sequence.__getitem__c c sF d } y# x | | } | V| d 7} q Wn t k
rA d SYn Xd S( Ni i ( u
IndexError( u selfu iu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iter__c s
u Sequence.__iter__c C s% x | D] } | | k r d Sq Wd S( NTF( u Trueu False( u selfu valueu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __contains__m s
u Sequence.__contains__c c s0 x) t t t | � � � D] } | | Vq Wd S( N( u reversedu rangeu len( u selfu i( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __reversed__s s u Sequence.__reversed__c C s7 x* t | � D] \ } } | | k r
| Sq
Wt � d S( u| S.index(value) -> integer -- return first index of value.
Raises ValueError if the value is not present.
N( u enumerateu
ValueError( u selfu valueu iu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu indexw s u Sequence.indexc s t � f d d � | D� � S( uB S.count(value) -> integer -- return number of occurrences of valuec 3 s! | ] } | � k r d Vq d S( i N( ( u .0u v( u value( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <genexpr>� s u! Sequence.count.<locals>.<genexpr>( u sum( u selfu value( ( u valueu4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu count� s u Sequence.countN( u __name__u
__module__u __qualname__u __doc__u __slots__u abstractmethodu __getitem__u __iter__u __contains__u __reversed__u indexu count( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu SequenceU s
c B s | Ee Z d Z d Z f Z d S( u
ByteStringuM This unifies bytes and bytearray.
XXX Should add all their methods.
N( u __name__u
__module__u __qualname__u __doc__u __slots__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu
ByteString� s c B s� | Ee Z d Z f Z e d d � � Z e d d � � Z e d d � � Z d d � Z d d
� Z d d � Z
d
d � Z d d d � Z d d � Z
d d � Z d S( u MutableSequencec C s
t � d S( N( u
IndexError( u selfu indexu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __setitem__� s u MutableSequence.__setitem__c C s
t � d S( N( u
IndexError( u selfu index( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __delitem__� s u MutableSequence.__delitem__c C s
t � d S( u3 S.insert(index, value) -- insert value before indexN( u
IndexError( u selfu indexu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu insert� s u MutableSequence.insertc C s | j t | � | � d S( u: S.append(value) -- append value to the end of the sequenceN( u insertu len( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu append� s u MutableSequence.appendc C s- y x
| j � q Wn t k
r( Yn Xd S( u, S.clear() -> None -- remove all items from SN( u popu
IndexError( u self( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu clear� s
u MutableSequence.clearc C sX t | � } xE t | d � D]3 } | | | d | | | | <| | | d <q Wd S( u! S.reverse() -- reverse *IN PLACE*i i N( u lenu range( u selfu nu i( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu reverse� s u MutableSequence.reversec C s" x | D] } | j | � q Wd S( uM S.extend(iterable) -- extend sequence by appending elements from the iterableN( u append( u selfu valuesu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu extend� s
u MutableSequence.extendi c C s | | } | | =| S( u� S.pop([index]) -> item -- remove and return item at index (default last).
Raise IndexError if list is empty or index is out of range.
( ( u selfu indexu v( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu pop� s
u MutableSequence.popc C s | | j | � =d S( uv S.remove(value) -- remove first occurrence of value.
Raise ValueError if the value is not present.
N( u index( u selfu value( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu remove� s u MutableSequence.removec C s | j | � | S( N( u extend( u selfu values( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu __iadd__� s
u MutableSequence.__iadd__Ni����( u __name__u
__module__u __qualname__u __slots__u abstractmethodu __setitem__u __delitem__u insertu appendu clearu reverseu extendu popu removeu __iadd__( u
__locals__( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu MutableSequence� s (9 u __doc__u abcu ABCMetau abstractmethodu sysu __all__u typeu iteru bytes_iteratoru bytearrayu bytearray_iteratoru keysu dict_keyiteratoru valuesu dict_valueiteratoru itemsu dict_itemiteratoru
list_iteratoru reversedu list_reverseiteratoru rangeu range_iteratoru setu set_iteratoru str_iteratoru tuple_iteratoru zipu zip_iteratoru dict_keysu dict_valuesu
dict_itemsu __dict__u mappingproxyu Hashableu Iterableu Iteratoru registeru Sizedu Containeru Callableu Setu frozensetu
MutableSetu Mappingu MappingViewu KeysViewu ItemsViewu
ValuesViewu MutableMappingu dictu Sequenceu tupleu stru
ByteStringu bytesu MutableSequenceu list( ( ( u4 /opt/alt/python33/lib64/python3.3/collections/abc.pyu <module> s�
y
O
3
[
/
A