| Current File : /home/mmdealscpanel/yummmdeals.com/metaclasses.zip |
PK z��ZyH� � �
Eiffel.pyonu �[��� �
��^c @ s� d Z d d l m Z m Z m Z d e f d � � YZ d e f d � � YZ d e f d � � YZ e d d
i � Z d
� Z e
d k r� e � n d S( s� Support Eiffel-style preconditions and postconditions.
For example,
class C:
def m1(self, arg):
require arg > 0
return whatever
ensure Result > arg
can be written (clumsily, I agree) as:
class C(Eiffel):
def m1(self, arg):
return whatever
def m1_pre(self, arg):
assert arg > 0
def m1_post(self, Result, arg):
assert Result > arg
Pre- and post-conditions for a method, being implemented as methods
themselves, are inherited independently from the method. This gives
much of the same effect of Eiffel, where pre- and post-conditions are
inherited when a method is overridden by a derived class. However,
when a derived class in Python needs to extend a pre- or
post-condition, it must manually merge the base class' pre- or
post-condition with that defined in the derived class', for example:
class D(C):
def m1(self, arg):
return arg**2
def m1_post(self, Result, arg):
C.m1_post(self, Result, arg)
assert Result < 100
This gives derived classes more freedom but also more responsibility
than in Eiffel, where the compiler automatically takes care of this.
In Eiffel, pre-conditions combine using contravariance, meaning a
derived class can only make a pre-condition weaker; in Python, this is
up to the derived class. For example, a derived class that takes away
the requirement that arg > 0 could write:
def m1_pre(self, arg):
pass
but one could equally write a derived class that makes a stronger
requirement:
def m1_pre(self, arg):
require arg > 50
It would be easy to modify the classes shown here so that pre- and
post-conditions can be disabled (separately, on a per-class basis).
A different design would have the pre- or post-condition testing
functions return true for success and false for failure. This would
make it possible to implement automatic combination of inherited
and new pre-/post-conditions. All this is left as an exercise to the
reader.
i����( t MetaClasst
MetaHelpert MetaMethodWrappert EiffelMethodWrapperc B s e Z d � Z d � Z RS( c C s� t j | | | � y t | | j d � | _ Wn t k
rL d | _ n Xy t | | j d � | _ Wn t k
r� d | _ n Xd S( Nt _pret _post( R t __init__t getattrt __name__t pret AttributeErrort Nonet post( t selft funct inst( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR D s
c O sh | j r t | j | | � n t | j | j f | | � } | j rd t | j | f | | � n | S( N( R t applyR R R ( R
t argst kwt Result( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt __call__S s ( R t
__module__R R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR B s t EiffelHelperc B s e Z e Z RS( ( R R R t __methodwrapper__( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR [ s t EiffelMetaClassc B s e Z e Z RS( ( R R R t
__helper__( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR ^ s t Eiffelc C s0 d t f d � � Y} | � } | j d � d S( Nt Cc B s# e Z d � Z d � Z d � Z RS( c S s | d S( Ni ( ( R
t arg( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt m1f s c S s d S( N( ( R
R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt m1_preh s c S s d S( N( ( R
R R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt m1_postj s ( R R R R R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR e s i ( R R ( R t x( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt _testd s t __main__N( ( t __doc__t MetaR R R R R R R R! R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt <module>> s PK z��Z�z�
Eiffel.pycnu �[��� �
��^c @ s� d Z d d l m Z m Z m Z d e f d � � YZ d e f d � � YZ d e f d � � YZ e d d
i � Z d
� Z e
d k r� e � n d S( s� Support Eiffel-style preconditions and postconditions.
For example,
class C:
def m1(self, arg):
require arg > 0
return whatever
ensure Result > arg
can be written (clumsily, I agree) as:
class C(Eiffel):
def m1(self, arg):
return whatever
def m1_pre(self, arg):
assert arg > 0
def m1_post(self, Result, arg):
assert Result > arg
Pre- and post-conditions for a method, being implemented as methods
themselves, are inherited independently from the method. This gives
much of the same effect of Eiffel, where pre- and post-conditions are
inherited when a method is overridden by a derived class. However,
when a derived class in Python needs to extend a pre- or
post-condition, it must manually merge the base class' pre- or
post-condition with that defined in the derived class', for example:
class D(C):
def m1(self, arg):
return arg**2
def m1_post(self, Result, arg):
C.m1_post(self, Result, arg)
assert Result < 100
This gives derived classes more freedom but also more responsibility
than in Eiffel, where the compiler automatically takes care of this.
In Eiffel, pre-conditions combine using contravariance, meaning a
derived class can only make a pre-condition weaker; in Python, this is
up to the derived class. For example, a derived class that takes away
the requirement that arg > 0 could write:
def m1_pre(self, arg):
pass
but one could equally write a derived class that makes a stronger
requirement:
def m1_pre(self, arg):
require arg > 50
It would be easy to modify the classes shown here so that pre- and
post-conditions can be disabled (separately, on a per-class basis).
A different design would have the pre- or post-condition testing
functions return true for success and false for failure. This would
make it possible to implement automatic combination of inherited
and new pre-/post-conditions. All this is left as an exercise to the
reader.
i����( t MetaClasst
MetaHelpert MetaMethodWrappert EiffelMethodWrapperc B s e Z d � Z d � Z RS( c C s� t j | | | � y t | | j d � | _ Wn t k
rL d | _ n Xy t | | j d � | _ Wn t k
r� d | _ n Xd S( Nt _pret _post( R t __init__t getattrt __name__t pret AttributeErrort Nonet post( t selft funct inst( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR D s
c O sh | j r t | j | | � n t | j | j f | | � } | j rd t | j | f | | � n | S( N( R t applyR R R ( R
t argst kwt Result( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt __call__S s ( R t
__module__R R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR B s t EiffelHelperc B s e Z e Z RS( ( R R R t __methodwrapper__( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR [ s t EiffelMetaClassc B s e Z e Z RS( ( R R R t
__helper__( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR ^ s t Eiffelc C s0 d t f d � � Y} | � } | j d � d S( Nt Cc B s# e Z d � Z d � Z d � Z RS( c S s | d S( Ni ( ( R
t arg( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt m1f s c S s | d k s t d � � d S( Ni s precondition for m1 failed( t AssertionError( R
R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt m1_preh s c S s | | k s t � d S( N( R ( R
R R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt m1_postj s ( R R R R R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyR e s i ( R R ( R t x( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt _testd s t __main__N( ( t __doc__t MetaR R R R R R R R" R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Eiffel.pyt <module>> s PK z��Z��Y� Trace.pycnu �[��� �
��^c @ s� d Z d d l Z d d l Z d d d � � YZ d d d � � YZ d d d � � YZ d e f d
� � YZ e d d i d d 6� Z d
� Z e
d k r� e � n d S( s? Tracing metaclass.
XXX This is very much a work in progress.
i����Nt TraceMetaClassc B s> e Z d Z d Z d � Z d � Z d � Z d � Z d Z RS( sU Metaclass for tracing.
Classes defined using this metaclass have an automatic tracing
feature -- by setting the __trace_output__ instance (or class)
variable to a file object, trace messages about all calls are
written to the file. The trace formatting can be changed by
defining a suitable __trace_call__ method.
i c C s( | | _ | | _ | | _ d | _ d S( Ni ( t __name__t __bases__t _TraceMetaClass__dictt _TraceMetaClass__inited( t selft namet basest dict( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __init__ s c C si y | j | SWnS t k
rd x6 | j D]+ } y | j | � SWq) t k
rS q) Xq) Wt | � n Xd S( N( R t KeyErrorR t __getattr__t AttributeError( R R t base( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR s
c C s* | j s | | j | <n
| | j | <d S( N( R t __dict__R ( R R t value( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __setattr__( s c O sZ t � } | j | � y | j d � } Wn t k
rE d � } n Xt | | | � | S( NR c S s d S( N( t None( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt <lambda>4 t ( t TracingInstancet
__meta_init__R R t apply( R t argst kwt instt init( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __call__. s
N(
R t
__module__t __doc__R R R R R R t __trace_output__( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR s
R c B s) e Z d Z d � Z d � Z d � Z RS( s9 Helper class to represent an instance of a tracing class.c G s | j | d | � d S( Ns
( t write( R t fpt fmtR ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __trace_call__= s c C s
| | _ d S( N( t _TracingInstance__class( R t klass( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR @ s c C s� y | j j | � } Wn t k
r2 t | � n Xt | � t j k rL | S| j j d | } | j sv | d k r� t | | | � St | | | � Sd S( Nt .R" (
R# R R t typet typest FunctionTypeR R t NotTracingWrappert TracingWrapper( R R t rawt fullname( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR C s
( R R R R" R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR : s R) c B s e Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R t funcR ( R R R- R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR S s c O s t | j | j f | | � S( N( R R- R ( R R R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR W s ( R R R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR) R s R* c B s e Z d � Z RS( c O s� | j j | j j d | j | j | | � y# t | j | j f | | � } WnM t j � \ } } } | j j | j j d | j | | � | | | � n' X| j j | j j d | j | � | Sd S( Ns# calling %s, inst=%s, args=%s, kw=%ss' returning from %s with exception %s: %ss returning from %s with value %s( R R" R R R R- t syst exc_info( R R R t rvt tt vt tb( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR [ s #
( R R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR* Z s t TracedR c C s� d t f d � � Ya d t f d � � Ya t d � } | GH| j GH| j d � GH| j d � GH| j d � GH| j d � GH| j d
� GH| j GHt j GHt j GHt j GHt j GHt � } | GH| j d � GH| j d � GH| j GHd S( Nt Cc B s/ e Z d d � Z d � Z d � Z e j Z RS( i c S s
| | _ d S( N( t x( R R6 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR s R c S s
| | _ d S( N( R6 ( R R6 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt m1t R c S s | j | S( N( R6 ( R t y( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt m2u R ( R R R R7 R9 R. t stdoutR ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR5 r s t Dc B s e Z d � Z d Z RS( c S s d | f GHt j | | � S( Ns D.m2(%r)( R5 R9 ( R R8 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR9 x s N( R R R9 R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR; w s i� id i
i! i i� ( R4 R5 R; R6 R7 R9 R ( R6 R8 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt _testp s( t __main__( ( ( ( ( R R' R. R R R) R* R R4 R< R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt <module> s 1 PK z��Z�L! ! Synch.pycnu �[��� �
��^c @ s� d Z d d l Z d d d � � YZ d � Z d d l m Z m Z m Z d e f d � � YZ d e f d
� � YZ d e f d � � YZ
e
d
d i � Z d � Z e
d k r� e � e � n d S( s` Synchronization metaclass.
This metaclass makes it possible to declare synchronized methods.
i����Nt Lockc B s, e Z d Z d � Z d d � Z d � Z RS( s� Reentrant lock.
This is a mutex-like object which can be acquired by the same
thread more than once. It keeps a reference count of the number
of times it has been acquired by the same thread. Each acquire()
call must be matched by a release() call and only the last
release() call actually releases the lock for acquisition by
another thread.
The implementation uses two locks internally:
__mutex is a short term lock used to protect the instance variables
__wait is the lock for which other threads wait
A thread intending to acquire both locks should acquire __wait
first.
The implementation uses two other instance variables, protected by
locking __mutex:
__tid is the thread ID of the thread that currently has the lock
__count is the number of times the current thread has acquired it
When the lock is released, __tid is None and __count is zero.
c C s4 t j � | _ t j � | _ d | _ d | _ d S( s0 Constructor. Initialize all instance variables.i N( t threadt
allocate_lockt _Lock__mutext _Lock__waitt Nonet
_Lock__tidt _Lock__count( t self( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt __init__* s i c C s� | j j � z- | j t j � k r9 | j d | _ d SWd | j j � X| j j | � } | ro | ro d SzW | j j � | j d k s� t � | j d k s� t � t j � | _ d | _ d SWd | j j � Xd S( s} Acquire the lock.
If the optional flag argument is false, returns immediately
when it cannot acquire the __wait lock without blocking (it
may still block for a little while in order to acquire the
__mutex lock).
The return value is only relevant when the flag argument is
false; it is 1 if the lock is acquired, 0 if not.
i Ni (
R t acquireR R t get_identR t releaseR R t AssertionError( R t flagt locked( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR
1 s"
c C s� | j j � zl | j t j � k s+ t � | j d k s@ t � | j d | _ | j d k rx d | _ | j j � n Wd | j j � Xd S( s� Release the lock.
If this thread doesn't currently have the lock, an assertion
error is raised.
Only allow another thread to acquire the lock when the count
reaches zero after decrementing it.
i i N(
R R
R R R R
R R R R ( R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR Q s
( t __name__t
__module__t __doc__R R
R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR
s c C s� g } | d � } | | d � } t � } | j � | | � | j � | j � t j | | f � t j | | | f � t j | | f � t j | | f � | j � d d l } x. t | � d k r� t | � GH| j d � q� Wt | � GHd S( Nc S s3 | j � d t j � G| j � | j d � d S( Ns f2 running in thread %d
i ( R
R R R t append( t lockt done( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt f2k s
c S sE | j � d t j � Gz | | � Wd | j � X| j d � d S( Ns f1 running in thread %d
i ( R
R R R R ( R R R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt f1q s
i����i g����MbP?( R R
R R t start_new_threadt timet lent sleep( R R R R R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt _testLockg s$
( t MetaClasst
MetaHelpert MetaMethodWrappert LockingMethodWrapperc B s e Z d � Z RS( c O s� | j d d k rC | j d d k rC t | j | j f | | � S| j j j � z! t | j | j f | | � SWd | j j j � Xd S( Ni t _( R t applyt funct instt __lock__R
R ( R t argst kw( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt __call__� s & !( R R R( ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR � s t
LockingHelperc B s e Z e Z d � Z RS( c C s t j | | � t � | _ d S( N( R t __helperinit__R R% ( R t formalclass( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR* � s ( R R R t __methodwrapper__R* ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR) � s t LockingMetaClassc B s e Z e Z RS( ( R R R) t
__helper__( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR- � s t Lockingc C s� d t f d � � Y} d d � } d d � } t j � } | j � t j � } | j � | d � } d } t j | | | | f � t j | | | | f � | j � d GH| j � d GHd Gt | j � GHd S(
Nt Bufferc B s# e Z d � Z d � Z d � Z RS( c S sB | d k s t � | | _ d g | j | _ d | _ | _ d S( Ni ( R
t sizeR t buffert firstt last( R t initialsize( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR � s c S sI | j d | j | j k rH | | j | j <| j d | j | _ d Sd G| j GHd | j | j | j f GH| j | j k r� | j | j | j !} n | j | j | j | j } d G| GH| d g | j d | _ d | _ | j d | _ | j d | _ d G| j GHd G| j GHd | j | j | j f GH| j | � d S( Ni s buffer =s first = %d, last = %d, size = %ds temp =i i s Buffer size doubled tos new buffer =( R4 R1 R3 R2 R t put( R t itemt temp( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR6 � s( c S sF | j | j k r t � n | j | j } | j d | j | _ | S( Ni ( R3 R4 t EOFErrorR2 R1 ( R R7 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt get� s
( R R R R6 R: ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR0 � s i� c S s` d d l } d } x0 | | k rD d G| GH| j | � | d } q Wd G| Gd GH| j � d S( Ni����i R6 i s Producer: done producingt items( R R6 R ( R2 t waitt nR t i( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt producer� s
c S s� d d l } d } d } x� | | k r� yK | j � } | | k rX t d | | f � n d G| GH| d } d } Wq t k
r� | j | � | d } q Xq Wd G| Gd GH| j � d S(
Ni����i g����MbP?s get() returned %s, expected %st goti i s Consumer: done consumingR; ( R R: R
R9 R R ( R2 R< R= R R> t toutt x( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt consumer� s"
i s
Producer dones All dones buffer size ==( R/ R R R
R R R2 ( R0 R? RC t pwaitt cwaitR2 R= ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt _test� s (
t __main__( ( ( R R R R t MetaR R R R R) R- R/ RF R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt <module> s Z +
U PK z��Zá�>�
�
Simple.pycnu �[��� �
��^c @ s� d d l Z d d d � � YZ d d
d � � YZ d d d � � YZ e d d i � Z d e f d
� � YZ e � Z e j d � e j � GHd S( i����Nt Tracingc B s e Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( s Create a new class.N( t __name__t __bases__t
__namespace__( t selft namet basest namespace( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt __init__ s c C s
t | � S( s Create a new instance.( t Instance( R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt __call__ s ( R t
__module__R R
( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s R c B s e Z d � Z d � Z RS( c C s
| | _ d S( N( t __klass__( R t klass( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s c C sW y | j j | } Wn t k
r0 t | � n Xt | � t j k rJ | St | | � S( N( R R t KeyErrort AttributeErrort typet typest FunctionTypet BoundMethod( R R t value( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt __getattr__ s
( R R R R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR
s R c B s e Z d � Z d � Z RS( c C s | | _ | | _ d S( N( t functiont instance( R R R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s c G s9 d G| j Gd G| j Gd G| GHt | j | j f | � S( Nt callingt fort with( R R t apply( R t args( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR
s ( R R R R
( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s t Tracet
MyTracedClassc B s e Z d � Z d � Z RS( c C s
| | _ d S( N( t a( R R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt method1$ s c C s | j S( N( R ( R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt method2& s ( R R R R! ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR # s i
( ( ( ( ( R R R R R R t
aninstanceR R! ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt <module> s
PK z��ZǪ�>z z Synch.pyonu �[��� �
��^c @ s� d Z d d l Z d d d � � YZ d � Z d d l m Z m Z m Z d e f d � � YZ d e f d
� � YZ d e f d � � YZ
e
d
d i � Z d � Z e
d k r� e � e � n d S( s` Synchronization metaclass.
This metaclass makes it possible to declare synchronized methods.
i����Nt Lockc B s, e Z d Z d � Z d d � Z d � Z RS( s� Reentrant lock.
This is a mutex-like object which can be acquired by the same
thread more than once. It keeps a reference count of the number
of times it has been acquired by the same thread. Each acquire()
call must be matched by a release() call and only the last
release() call actually releases the lock for acquisition by
another thread.
The implementation uses two locks internally:
__mutex is a short term lock used to protect the instance variables
__wait is the lock for which other threads wait
A thread intending to acquire both locks should acquire __wait
first.
The implementation uses two other instance variables, protected by
locking __mutex:
__tid is the thread ID of the thread that currently has the lock
__count is the number of times the current thread has acquired it
When the lock is released, __tid is None and __count is zero.
c C s4 t j � | _ t j � | _ d | _ d | _ d S( s0 Constructor. Initialize all instance variables.i N( t threadt
allocate_lockt _Lock__mutext _Lock__waitt Nonet
_Lock__tidt _Lock__count( t self( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt __init__* s i c C s� | j j � z- | j t j � k r9 | j d | _ d SWd | j j � X| j j | � } | ro | ro d Sz- | j j � t j � | _ d | _ d SWd | j j � Xd S( s} Acquire the lock.
If the optional flag argument is false, returns immediately
when it cannot acquire the __wait lock without blocking (it
may still block for a little while in order to acquire the
__mutex lock).
The return value is only relevant when the flag argument is
false; it is 1 if the lock is acquired, 0 if not.
i Ni ( R t acquireR R t get_identR t releaseR ( R t flagt locked( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR
1 s
c C s^ | j j � z< | j d | _ | j d k rH d | _ | j j � n Wd | j j � Xd S( s� Release the lock.
If this thread doesn't currently have the lock, an assertion
error is raised.
Only allow another thread to acquire the lock when the count
reaches zero after decrementing it.
i i N( R R
R R R R R ( R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR Q s
( t __name__t
__module__t __doc__R R
R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR
s c C s� g } | d � } | | d � } t � } | j � | | � | j � | j � t j | | f � t j | | | f � t j | | f � t j | | f � | j � d d l } x. t | � d k r� t | � GH| j d � q� Wt | � GHd S( Nc S s3 | j � d t j � G| j � | j d � d S( Ns f2 running in thread %d
i ( R
R R R t append( t lockt done( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt f2k s
c S sE | j � d t j � Gz | | � Wd | j � X| j d � d S( Ns f1 running in thread %d
i ( R
R R R R ( R R R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt f1q s
i����i g����MbP?( R R
R R t start_new_threadt timet lent sleep( R R R R R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt _testLockg s$
( t MetaClasst
MetaHelpert MetaMethodWrappert LockingMethodWrapperc B s e Z d � Z RS( c O s� | j d d k rC | j d d k rC t | j | j f | | � S| j j j � z! t | j | j f | | � SWd | j j j � Xd S( Ni t _( R t applyt funct instt __lock__R
R ( R t argst kw( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt __call__� s & !( R R R' ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR � s t
LockingHelperc B s e Z e Z d � Z RS( c C s t j | | � t � | _ d S( N( R t __helperinit__R R$ ( R t formalclass( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR) � s ( R R R t __methodwrapper__R) ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR( � s t LockingMetaClassc B s e Z e Z RS( ( R R R( t
__helper__( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR, � s t Lockingc C s� d t f d � � Y} d d � } d d � } t j � } | j � t j � } | j � | d � } d } t j | | | | f � t j | | | | f � | j � d GH| j � d GHd Gt | j � GHd S(
Nt Bufferc B s# e Z d � Z d � Z d � Z RS( c S s0 | | _ d g | j | _ d | _ | _ d S( Ni ( t sizeR t buffert firstt last( R t initialsize( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR � s c S sI | j d | j | j k rH | | j | j <| j d | j | _ d Sd G| j GHd | j | j | j f GH| j | j k r� | j | j | j !} n | j | j | j | j } d G| GH| d g | j d | _ d | _ | j d | _ | j d | _ d G| j GHd G| j GHd | j | j | j f GH| j | � d S( Ni s buffer =s first = %d, last = %d, size = %ds temp =i i s Buffer size doubled tos new buffer =( R3 R0 R2 R1 R t put( R t itemt temp( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR5 � s( c S sF | j | j k r t � n | j | j } | j d | j | _ | S( Ni ( R2 R3 t EOFErrorR1 R0 ( R R6 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt get� s
( R R R R5 R9 ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyR/ � s i� c S s` d d l } d } x0 | | k rD d G| GH| j | � | d } q Wd G| Gd GH| j � d S( Ni����i R5 i s Producer: done producingt items( R R5 R ( R1 t waitt nR t i( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt producer� s
c S s� d d l } d } d } x� | | k r� yK | j � } | | k rX t d | | f � n d G| GH| d } d } Wq t k
r� | j | � | d } q Xq Wd G| Gd GH| j � d S(
Ni����i g����MbP?s get() returned %s, expected %st goti i s Consumer: done consumingR: ( R R9 t AssertionErrorR8 R R ( R1 R; R< R R= t toutt x( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt consumer� s"
i s
Producer dones All dones buffer size ==( R. R R R
R R R1 ( R/ R> RC t pwaitt cwaitR1 R< ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt _test� s (
t __main__( ( ( R R R R t MetaR R R R R( R, R. RF R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Synch.pyt <module> s Z +
U PK z��Z�VA�� � Meta.pyonu �[��� �
��^c @ s� d Z d d l Z d d d � � YZ d d
d � � YZ d d d � � YZ e d d i � Z d
� Z e d k r| e � n d S( s? Generic metaclass.
XXX This is very much a work in progress.
i����Nt MetaMethodWrapperc B s e Z d � Z d � Z RS( c C s% | | _ | | _ | j j | _ d S( N( t funct instt __name__( t selfR R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __init__ s c O s t | j | j f | | � S( N( t applyR R ( R t argst kw( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __call__ s ( R t
__module__R R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR s t
MetaHelperc B s e Z e Z d � Z d � Z RS( c C s
| | _ d S( N( t __formalclass__( R t formalclass( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __helperinit__ s c C s� y | j j | � } WnT t k
rl y | j j d � } Wn t t f k
r^ t | � n X| | | � SXt | � t j k r� | S| j | | � S( Nt __usergetattr__( R t __getattr__t AttributeErrort KeyErrort typet typest FunctionTypet __methodwrapper__( R t namet rawt ga( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR s
( R R
R R R R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR s t MetaClassc B s> e Z d Z e Z d Z d � Z d � Z d � Z d � Z RS( sc A generic metaclass.
This can be subclassed to implement various kinds of meta-behavior.
i c C s[ y | d } Wn t k
r! n X| | d <| d =| | _ | | _ | | _ d | _ d S( NR R i ( R R t __bases__t __realdict__t _MetaClass__inited( R R t basest dictR ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR 4 s
c C si y | j | SWnS t k
rd x6 | j D]+ } y | j | � SWq) t k
rS q) Xq) Wt | � n Xd S( N( R R R R R ( R R t base( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR A s
c C s* | j s | | j | <n
| | j | <d S( N( R t __dict__R ( R R t value( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __setattr__L s c O s] | j � } | j | � y | j d � } Wn t k
rH d � } n Xt | | | � | S( NR c S s d S( N( t None( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt <lambda>X t ( t
__helper__R R R R ( R R R R t init( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR R s
(
R R
t __doc__R R' R R R R# R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR ( s
t Metac C si d t f d � � Y} | GH| � } | GH| j d � d | f d � � Y} | � } | j GH| j GHd S( Nt Cc B s e Z d � Z d � Z RS( c W s
d G| GHd S( Ns __init__, args =( ( R R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR b s c S s d | f GHd S( Ns m1(x=%r)( ( R t x( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt m1d s ( R R
R R- ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR+ a s i t Dc B s e Z d � Z RS( c S s$ | d d k r t | � n d | S( Ni t __s
getattr:%s( R ( R R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR k s ( R R
R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR. j s ( R* R- t foot _foo( R+ R, R. ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt _test` s
t __main__( ( ( ( ( R) R R R R R* R2 R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt <module> s
5 PK z��Z��� � Simple.pynu �[��� import types
class Tracing:
def __init__(self, name, bases, namespace):
"""Create a new class."""
self.__name__ = name
self.__bases__ = bases
self.__namespace__ = namespace
def __call__(self):
"""Create a new instance."""
return Instance(self)
class Instance:
def __init__(self, klass):
self.__klass__ = klass
def __getattr__(self, name):
try:
value = self.__klass__.__namespace__[name]
except KeyError:
raise AttributeError, name
if type(value) is not types.FunctionType:
return value
return BoundMethod(value, self)
class BoundMethod:
def __init__(self, function, instance):
self.function = function
self.instance = instance
def __call__(self, *args):
print "calling", self.function, "for", self.instance, "with", args
return apply(self.function, (self.instance,) + args)
Trace = Tracing('Trace', (), {})
class MyTracedClass(Trace):
def method1(self, a):
self.a = a
def method2(self):
return self.a
aninstance = MyTracedClass()
aninstance.method1(10)
print aninstance.method2()
PK z��Z�VA�� � Meta.pycnu �[��� �
��^c @ s� d Z d d l Z d d d � � YZ d d
d � � YZ d d d � � YZ e d d i � Z d
� Z e d k r| e � n d S( s? Generic metaclass.
XXX This is very much a work in progress.
i����Nt MetaMethodWrapperc B s e Z d � Z d � Z RS( c C s% | | _ | | _ | j j | _ d S( N( t funct instt __name__( t selfR R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __init__ s c O s t | j | j f | | � S( N( t applyR R ( R t argst kw( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __call__ s ( R t
__module__R R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR s t
MetaHelperc B s e Z e Z d � Z d � Z RS( c C s
| | _ d S( N( t __formalclass__( R t formalclass( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __helperinit__ s c C s� y | j j | � } WnT t k
rl y | j j d � } Wn t t f k
r^ t | � n X| | | � SXt | � t j k r� | S| j | | � S( Nt __usergetattr__( R t __getattr__t AttributeErrort KeyErrort typet typest FunctionTypet __methodwrapper__( R t namet rawt ga( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR s
( R R
R R R R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR s t MetaClassc B s> e Z d Z e Z d Z d � Z d � Z d � Z d � Z RS( sc A generic metaclass.
This can be subclassed to implement various kinds of meta-behavior.
i c C s[ y | d } Wn t k
r! n X| | d <| d =| | _ | | _ | | _ d | _ d S( NR R i ( R R t __bases__t __realdict__t _MetaClass__inited( R R t basest dictR ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR 4 s
c C si y | j | SWnS t k
rd x6 | j D]+ } y | j | � SWq) t k
rS q) Xq) Wt | � n Xd S( N( R R R R R ( R R t base( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR A s
c C s* | j s | | j | <n
| | j | <d S( N( R t __dict__R ( R R t value( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt __setattr__L s c O s] | j � } | j | � y | j d � } Wn t k
rH d � } n Xt | | | � | S( NR c S s d S( N( t None( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt <lambda>X t ( t
__helper__R R R R ( R R R R t init( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR R s
(
R R
t __doc__R R' R R R R# R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR ( s
t Metac C si d t f d � � Y} | GH| � } | GH| j d � d | f d � � Y} | � } | j GH| j GHd S( Nt Cc B s e Z d � Z d � Z RS( c W s
d G| GHd S( Ns __init__, args =( ( R R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR b s c S s d | f GHd S( Ns m1(x=%r)( ( R t x( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt m1d s ( R R
R R- ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR+ a s i t Dc B s e Z d � Z RS( c S s$ | d d k r t | � n d | S( Ni t __s
getattr:%s( R ( R R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR k s ( R R
R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyR. j s ( R* R- t foot _foo( R+ R, R. ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt _test` s
t __main__( ( ( ( ( R) R R R R R* R2 R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Meta.pyt <module> s
5 PK z��Zá�>�
�
Simple.pyonu �[��� �
��^c @ s� d d l Z d d d � � YZ d d
d � � YZ d d d � � YZ e d d i � Z d e f d
� � YZ e � Z e j d � e j � GHd S( i����Nt Tracingc B s e Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( s Create a new class.N( t __name__t __bases__t
__namespace__( t selft namet basest namespace( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt __init__ s c C s
t | � S( s Create a new instance.( t Instance( R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt __call__ s ( R t
__module__R R
( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s R c B s e Z d � Z d � Z RS( c C s
| | _ d S( N( t __klass__( R t klass( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s c C sW y | j j | } Wn t k
r0 t | � n Xt | � t j k rJ | St | | � S( N( R R t KeyErrort AttributeErrort typet typest FunctionTypet BoundMethod( R R t value( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt __getattr__ s
( R R R R ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR
s R c B s e Z d � Z d � Z RS( c C s | | _ | | _ d S( N( t functiont instance( R R R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s c G s9 d G| j Gd G| j Gd G| GHt | j | j f | � S( Nt callingt fort with( R R t apply( R t args( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR
s ( R R R R
( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR s t Tracet
MyTracedClassc B s e Z d � Z d � Z RS( c C s
| | _ d S( N( t a( R R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt method1$ s c C s | j S( N( R ( R ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt method2& s ( R R R R! ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyR # s i
( ( ( ( ( R R R R R R t
aninstanceR R! ( ( ( s/ /usr/lib64/python2.7/Demo/metaclasses/Simple.pyt <module> s
PK z��Z,.K��
�
Eiffel.pynu �[��� """Support Eiffel-style preconditions and postconditions.
For example,
class C:
def m1(self, arg):
require arg > 0
return whatever
ensure Result > arg
can be written (clumsily, I agree) as:
class C(Eiffel):
def m1(self, arg):
return whatever
def m1_pre(self, arg):
assert arg > 0
def m1_post(self, Result, arg):
assert Result > arg
Pre- and post-conditions for a method, being implemented as methods
themselves, are inherited independently from the method. This gives
much of the same effect of Eiffel, where pre- and post-conditions are
inherited when a method is overridden by a derived class. However,
when a derived class in Python needs to extend a pre- or
post-condition, it must manually merge the base class' pre- or
post-condition with that defined in the derived class', for example:
class D(C):
def m1(self, arg):
return arg**2
def m1_post(self, Result, arg):
C.m1_post(self, Result, arg)
assert Result < 100
This gives derived classes more freedom but also more responsibility
than in Eiffel, where the compiler automatically takes care of this.
In Eiffel, pre-conditions combine using contravariance, meaning a
derived class can only make a pre-condition weaker; in Python, this is
up to the derived class. For example, a derived class that takes away
the requirement that arg > 0 could write:
def m1_pre(self, arg):
pass
but one could equally write a derived class that makes a stronger
requirement:
def m1_pre(self, arg):
require arg > 50
It would be easy to modify the classes shown here so that pre- and
post-conditions can be disabled (separately, on a per-class basis).
A different design would have the pre- or post-condition testing
functions return true for success and false for failure. This would
make it possible to implement automatic combination of inherited
and new pre-/post-conditions. All this is left as an exercise to the
reader.
"""
from Meta import MetaClass, MetaHelper, MetaMethodWrapper
class EiffelMethodWrapper(MetaMethodWrapper):
def __init__(self, func, inst):
MetaMethodWrapper.__init__(self, func, inst)
# Note that the following causes recursive wrappers around
# the pre-/post-condition testing methods. These are harmless
# but inefficient; to avoid them, the lookup must be done
# using the class.
try:
self.pre = getattr(inst, self.__name__ + "_pre")
except AttributeError:
self.pre = None
try:
self.post = getattr(inst, self.__name__ + "_post")
except AttributeError:
self.post = None
def __call__(self, *args, **kw):
if self.pre:
apply(self.pre, args, kw)
Result = apply(self.func, (self.inst,) + args, kw)
if self.post:
apply(self.post, (Result,) + args, kw)
return Result
class EiffelHelper(MetaHelper):
__methodwrapper__ = EiffelMethodWrapper
class EiffelMetaClass(MetaClass):
__helper__ = EiffelHelper
Eiffel = EiffelMetaClass('Eiffel', (), {})
def _test():
class C(Eiffel):
def m1(self, arg):
return arg+1
def m1_pre(self, arg):
assert arg > 0, "precondition for m1 failed"
def m1_post(self, Result, arg):
assert Result > arg
x = C()
x.m1(12)
## x.m1(-1)
if __name__ == '__main__':
_test()
PK z��Z��C C Enum.pynu �[��� """Enumeration metaclass.
XXX This is very much a work in progress.
"""
import string
class EnumMetaClass:
"""Metaclass for enumeration.
To define your own enumeration, do something like
class Color(Enum):
red = 1
green = 2
blue = 3
Now, Color.red, Color.green and Color.blue behave totally
different: they are enumerated values, not integers.
Enumerations cannot be instantiated; however they can be
subclassed.
"""
def __init__(self, name, bases, dict):
"""Constructor -- create an enumeration.
Called at the end of the class statement. The arguments are
the name of the new class, a tuple containing the base
classes, and a dictionary containing everything that was
entered in the class' namespace during execution of the class
statement. In the above example, it would be {'red': 1,
'green': 2, 'blue': 3}.
"""
for base in bases:
if base.__class__ is not EnumMetaClass:
raise TypeError, "Enumeration base class must be enumeration"
bases = filter(lambda x: x is not Enum, bases)
self.__name__ = name
self.__bases__ = bases
self.__dict = {}
for key, value in dict.items():
self.__dict[key] = EnumInstance(name, key, value)
def __getattr__(self, name):
"""Return an enumeration value.
For example, Color.red returns the value corresponding to red.
XXX Perhaps the values should be created in the constructor?
This looks in the class dictionary and if it is not found
there asks the base classes.
The special attribute __members__ returns the list of names
defined in this class (it does not merge in the names defined
in base classes).
"""
if name == '__members__':
return self.__dict.keys()
try:
return self.__dict[name]
except KeyError:
for base in self.__bases__:
try:
return getattr(base, name)
except AttributeError:
continue
raise AttributeError, name
def __repr__(self):
s = self.__name__
if self.__bases__:
s = s + '(' + string.join(map(lambda x: x.__name__,
self.__bases__), ", ") + ')'
if self.__dict:
list = []
for key, value in self.__dict.items():
list.append("%s: %s" % (key, int(value)))
s = "%s: {%s}" % (s, string.join(list, ", "))
return s
class EnumInstance:
"""Class to represent an enumeration value.
EnumInstance('Color', 'red', 12) prints as 'Color.red' and behaves
like the integer 12 when compared, but doesn't support arithmetic.
XXX Should it record the actual enumeration rather than just its
name?
"""
def __init__(self, classname, enumname, value):
self.__classname = classname
self.__enumname = enumname
self.__value = value
def __int__(self):
return self.__value
def __repr__(self):
return "EnumInstance(%r, %r, %r)" % (self.__classname,
self.__enumname,
self.__value)
def __str__(self):
return "%s.%s" % (self.__classname, self.__enumname)
def __cmp__(self, other):
return cmp(self.__value, int(other))
# Create the base class for enumerations.
# It is an empty enumeration.
Enum = EnumMetaClass("Enum", (), {})
def _test():
class Color(Enum):
red = 1
green = 2
blue = 3
print Color.red
print dir(Color)
print Color.red == Color.red
print Color.red == Color.blue
print Color.red == 1
print Color.red == 2
class ExtendedColor(Color):
white = 0
orange = 4
yellow = 5
purple = 6
black = 7
print ExtendedColor.orange
print ExtendedColor.red
print Color.red == ExtendedColor.red
class OtherColor(Enum):
white = 4
blue = 5
class MergedColor(Color, OtherColor):
pass
print MergedColor.red
print MergedColor.white
print Color
print ExtendedColor
print OtherColor
print MergedColor
if __name__ == '__main__':
_test()
PK z��Z�BO- - meta-vladimir.txtnu �[��� Subject: Re: The metaclass saga using Python
From: Vladimir Marangozov <Vladimir.Marangozov@imag.fr>
To: tim_one@email.msn.com (Tim Peters)
Cc: python-list@cwi.nl
Date: Wed, 5 Aug 1998 15:59:06 +0200 (DFT)
[Tim]
>
> building-on-examples-tends-to-prevent-abstract-thrashing-ly y'rs - tim
>
OK, I stand corrected. I understand that anybody's interpretation of
the meta-class concept is likely to be difficult to digest by others.
Here's another try, expressing the same thing, but using the Python
programming model, examples and, perhaps, more popular terms.
1. Classes.
This is pure Python of today. Sorry about the tutorial, but it is
meant to illustrate the second part, which is the one we're
interested in and which will follow the same development scenario.
Besides, newbies are likely to understand that the discussion is
affordable even for them :-)
a) Class definition
A class is meant to define the common properties of a set of objects.
A class is a "package" of properties. The assembly of properties
in a class package is sometimes called a class structure (which isn't
always appropriate).
>>> class A:
attr1 = "Hello" # an attribute of A
def method1(self, *args): pass # method1 of A
def method2(self, *args): pass # method2 of A
>>>
So far, we defined the structure of the class A. The class A is
of type <class>. We can check this by asking Python: "what is A?"
>>> A # What is A?
<class __main__.A at 2023e360>
b) Class instantiation
Creating an object with the properties defined in the class A is
called instantiation of the class A. After an instantiation of A, we
obtain a new object, called an instance, which has the properties
packaged in the class A.
>>> a = A() # 'a' is the 1st instance of A
>>> a # What is 'a'?
<__main__.A instance at 2022b9d0>
>>> b = A() # 'b' is another instance of A
>>> b # What is 'b'?
<__main__.A instance at 2022b9c0>
The objects, 'a' and 'b', are of type <instance> and they both have
the same properties. Note, that 'a' and 'b' are different objects.
(their adresses differ). This is a bit hard to see, so let's ask Python:
>>> a == b # Is 'a' the same object as 'b'?
0 # No.
Instance objects have one more special property, indicating the class
they are an instance of. This property is named __class__.
>>> a.__class__ # What is the class of 'a'?
<class __main__.A at 2023e360> # 'a' is an instance of A
>>> b.__class__ # What is the class of 'b'?
<class __main__.A at 2023e360> # 'b' is an instance of A
>>> a.__class__ == b.__class__ # Is it really the same class A?
1 # Yes.
c) Class inheritance (class composition and specialization)
Classes can be defined in terms of other existing classes (and only
classes! -- don't bug me on this now). Thus, we can compose property
packages and create new ones. We reuse the property set defined
in a class by defining a new class, which "inherits" from the former.
In other words, a class B which inherits from the class A, inherits
the properties defined in A, or, B inherits the structure of A.
In the same time, at the definition of the new class B, we can enrich
the inherited set of properties by adding new ones and/or modify some
of the inherited properties.
>>> class B(A): # B inherits A's properties
attr2 = "World" # additional attr2
def method2(self, arg1): pass # method2 is redefined
def method3(self, *args): pass # additional method3
>>> B # What is B?
<class __main__.B at 2023e500>
>>> B == A # Is B the same class as A?
0 # No.
Classes define one special property, indicating whether a class
inherits the properties of another class. This property is called
__bases__ and it contains a list (a tuple) of the classes the new
class inherits from. The classes from which a class is inheriting the
properties are called superclasses (in Python, we call them also --
base classes).
>>> A.__bases__ # Does A have any superclasses?
() # No.
>>> B.__bases__ # Does B have any superclasses?
(<class __main__.A at 2023e360>,) # Yes. It has one superclass.
>>> B.__bases__[0] == A # Is it really the class A?
1 # Yes, it is.
--------
Congratulations on getting this far! This was the hard part.
Now, let's continue with the easy one.
--------
2. Meta-classes
You have to admit, that an anonymous group of Python wizards are
not satisfied with the property packaging facilities presented above.
They say, that the Real-World bugs them with problems that cannot be
modelled successfully with classes. Or, that the way classes are
implemented in Python and the way classes and instances behave at
runtime isn't always appropriate for reproducing the Real-World's
behavior in a way that satisfies them.
Hence, what they want is the following:
a) leave objects as they are (instances of classes)
b) leave classes as they are (property packages and object creators)
BUT, at the same time:
c) consider classes as being instances of mysterious objects.
d) label mysterious objects "meta-classes".
Easy, eh?
You may ask: "Why on earth do they want to do that?".
They answer: "Poor soul... Go and see how cruel the Real-World is!".
You - fuzzy: "OK, will do!"
And here we go for another round of what I said in section 1 -- Classes.
However, be warned! The features we're going to talk about aren't fully
implemented yet, because the Real-World don't let wizards to evaluate
precisely how cruel it is, so the features are still highly-experimental.
a) Meta-class definition
A meta-class is meant to define the common properties of a set of
classes. A meta-class is a "package" of properties. The assembly
of properties in a meta-class package is sometimes called a meta-class
structure (which isn't always appropriate).
In Python, a meta-class definition would have looked like this:
>>> metaclass M:
attr1 = "Hello" # an attribute of M
def method1(self, *args): pass # method1 of M
def method2(self, *args): pass # method2 of M
>>>
So far, we defined the structure of the meta-class M. The meta-class
M is of type <metaclass>. We cannot check this by asking Python, but
if we could, it would have answered:
>>> M # What is M?
<metaclass __main__.M at 2023e4e0>
b) Meta-class instantiation
Creating an object with the properties defined in the meta-class M is
called instantiation of the meta-class M. After an instantiation of M,
we obtain a new object, called an class, but now it is called also
a meta-instance, which has the properties packaged in the meta-class M.
In Python, instantiating a meta-class would have looked like this:
>>> A = M() # 'A' is the 1st instance of M
>>> A # What is 'A'?
<class __main__.A at 2022b9d0>
>>> B = M() # 'B' is another instance of M
>>> B # What is 'B'?
<class __main__.B at 2022b9c0>
The metaclass-instances, A and B, are of type <class> and they both
have the same properties. Note, that A and B are different objects.
(their adresses differ). This is a bit hard to see, but if it was
possible to ask Python, it would have answered:
>>> A == B # Is A the same class as B?
0 # No.
Class objects have one more special property, indicating the meta-class
they are an instance of. This property is named __metaclass__.
>>> A.__metaclass__ # What is the meta-class of A?
<metaclass __main__.M at 2023e4e0> # A is an instance of M
>>> A.__metaclass__ # What is the meta-class of B?
<metaclass __main__.M at 2023e4e0> # B is an instance of M
>>> A.__metaclass__ == B.__metaclass__ # Is it the same meta-class M?
1 # Yes.
c) Meta-class inheritance (meta-class composition and specialization)
Meta-classes can be defined in terms of other existing meta-classes
(and only meta-classes!). Thus, we can compose property packages and
create new ones. We reuse the property set defined in a meta-class by
defining a new meta-class, which "inherits" from the former.
In other words, a meta-class N which inherits from the meta-class M,
inherits the properties defined in M, or, N inherits the structure of M.
In the same time, at the definition of the new meta-class N, we can
enrich the inherited set of properties by adding new ones and/or modify
some of the inherited properties.
>>> metaclass N(M): # N inherits M's properties
attr2 = "World" # additional attr2
def method2(self, arg1): pass # method2 is redefined
def method3(self, *args): pass # additional method3
>>> N # What is N?
<metaclass __main__.N at 2023e500>
>>> N == M # Is N the same meta-class as M?
0 # No.
Meta-classes define one special property, indicating whether a
meta-class inherits the properties of another meta-class. This property
is called __metabases__ and it contains a list (a tuple) of the
meta-classes the new meta-class inherits from. The meta-classes from
which a meta-class is inheriting the properties are called
super-meta-classes (in Python, we call them also -- super meta-bases).
>>> M.__metabases__ # Does M have any supermetaclasses?
() # No.
>>> N.__metabases__ # Does N have any supermetaclasses?
(<metaclass __main__.M at 2023e360>,) # Yes. It has a supermetaclass.
>>> N.__metabases__[0] == M # Is it really the meta-class M?
1 # Yes, it is.
--------
Triple congratulations on getting this far!
Now you know everything about meta-classes and the Real-World!
<unless-wizards-want-meta-classes-be-instances-of-mysterious-objects!>
--
Vladimir MARANGOZOV | Vladimir.Marangozov@inrialpes.fr
http://sirac.inrialpes.fr/~marangoz | tel:(+33-4)76615277 fax:76615252
PK z��Z���]P ]P
index.htmlnu �[��� <HTML>
<HEAD>
<TITLE>Metaclasses in Python 1.5</TITLE>
</HEAD>
<BODY BGCOLOR="FFFFFF">
<H1>Metaclasses in Python 1.5</H1>
<H2>(A.k.a. The Killer Joke :-)</H2>
<HR>
(<i>Postscript:</i> reading this essay is probably not the best way to
understand the metaclass hook described here. See a <A
HREF="meta-vladimir.txt">message posted by Vladimir Marangozov</A>
which may give a gentler introduction to the matter. You may also
want to search Deja News for messages with "metaclass" in the subject
posted to comp.lang.python in July and August 1998.)
<HR>
<P>In previous Python releases (and still in 1.5), there is something
called the ``Don Beaudry hook'', after its inventor and champion.
This allows C extensions to provide alternate class behavior, thereby
allowing the Python class syntax to be used to define other class-like
entities. Don Beaudry has used this in his infamous <A
HREF="http://maigret.cog.brown.edu/pyutil/">MESS</A> package; Jim
Fulton has used it in his <A
HREF="http://www.digicool.com/releases/ExtensionClass/">Extension
Classes</A> package. (It has also been referred to as the ``Don
Beaudry <i>hack</i>,'' but that's a misnomer. There's nothing hackish
about it -- in fact, it is rather elegant and deep, even though
there's something dark to it.)
<P>(On first reading, you may want to skip directly to the examples in
the section "Writing Metaclasses in Python" below, unless you want
your head to explode.)
<P>
<HR>
<P>Documentation of the Don Beaudry hook has purposefully been kept
minimal, since it is a feature of incredible power, and is easily
abused. Basically, it checks whether the <b>type of the base
class</b> is callable, and if so, it is called to create the new
class.
<P>Note the two indirection levels. Take a simple example:
<PRE>
class B:
pass
class C(B):
pass
</PRE>
Take a look at the second class definition, and try to fathom ``the
type of the base class is callable.''
<P>(Types are not classes, by the way. See questions 4.2, 4.19 and in
particular 6.22 in the <A
HREF="http://www.python.org/cgi-bin/faqw.py" >Python FAQ</A>
for more on this topic.)
<P>
<UL>
<LI>The <b>base class</b> is B; this one's easy.<P>
<LI>Since B is a class, its type is ``class''; so the <b>type of the
base class</b> is the type ``class''. This is also known as
types.ClassType, assuming the standard module <code>types</code> has
been imported.<P>
<LI>Now is the type ``class'' <b>callable</b>? No, because types (in
core Python) are never callable. Classes are callable (calling a
class creates a new instance) but types aren't.<P>
</UL>
<P>So our conclusion is that in our example, the type of the base
class (of C) is not callable. So the Don Beaudry hook does not apply,
and the default class creation mechanism is used (which is also used
when there is no base class). In fact, the Don Beaudry hook never
applies when using only core Python, since the type of a core object
is never callable.
<P>So what do Don and Jim do in order to use Don's hook? Write an
extension that defines at least two new Python object types. The
first would be the type for ``class-like'' objects usable as a base
class, to trigger Don's hook. This type must be made callable.
That's why we need a second type. Whether an object is callable
depends on its type. So whether a type object is callable depends on
<i>its</i> type, which is a <i>meta-type</i>. (In core Python there
is only one meta-type, the type ``type'' (types.TypeType), which is
the type of all type objects, even itself.) A new meta-type must
be defined that makes the type of the class-like objects callable.
(Normally, a third type would also be needed, the new ``instance''
type, but this is not an absolute requirement -- the new class type
could return an object of some existing type when invoked to create an
instance.)
<P>Still confused? Here's a simple device due to Don himself to
explain metaclasses. Take a simple class definition; assume B is a
special class that triggers Don's hook:
<PRE>
class C(B):
a = 1
b = 2
</PRE>
This can be though of as equivalent to:
<PRE>
C = type(B)('C', (B,), {'a': 1, 'b': 2})
</PRE>
If that's too dense for you, here's the same thing written out using
temporary variables:
<PRE>
creator = type(B) # The type of the base class
name = 'C' # The name of the new class
bases = (B,) # A tuple containing the base class(es)
namespace = {'a': 1, 'b': 2} # The namespace of the class statement
C = creator(name, bases, namespace)
</PRE>
This is analogous to what happens without the Don Beaudry hook, except
that in that case the creator function is set to the default class
creator.
<P>In either case, the creator is called with three arguments. The
first one, <i>name</i>, is the name of the new class (as given at the
top of the class statement). The <i>bases</i> argument is a tuple of
base classes (a singleton tuple if there's only one base class, like
the example). Finally, <i>namespace</i> is a dictionary containing
the local variables collected during execution of the class statement.
<P>Note that the contents of the namespace dictionary is simply
whatever names were defined in the class statement. A little-known
fact is that when Python executes a class statement, it enters a new
local namespace, and all assignments and function definitions take
place in this namespace. Thus, after executing the following class
statement:
<PRE>
class C:
a = 1
def f(s): pass
</PRE>
the class namespace's contents would be {'a': 1, 'f': <function f
...>}.
<P>But enough already about writing Python metaclasses in C; read the
documentation of <A
HREF="http://maigret.cog.brown.edu/pyutil/">MESS</A> or <A
HREF="http://www.digicool.com/papers/ExtensionClass.html" >Extension
Classes</A> for more information.
<P>
<HR>
<H2>Writing Metaclasses in Python</H2>
<P>In Python 1.5, the requirement to write a C extension in order to
write metaclasses has been dropped (though you can still do
it, of course). In addition to the check ``is the type of the base
class callable,'' there's a check ``does the base class have a
__class__ attribute.'' If so, it is assumed that the __class__
attribute refers to a class.
<P>Let's repeat our simple example from above:
<PRE>
class C(B):
a = 1
b = 2
</PRE>
Assuming B has a __class__ attribute, this translates into:
<PRE>
C = B.__class__('C', (B,), {'a': 1, 'b': 2})
</PRE>
This is exactly the same as before except that instead of type(B),
B.__class__ is invoked. If you have read <A HREF=
"http://www.python.org/cgi-bin/faqw.py?req=show&file=faq06.022.htp"
>FAQ question 6.22</A> you will understand that while there is a big
technical difference between type(B) and B.__class__, they play the
same role at different abstraction levels. And perhaps at some point
in the future they will really be the same thing (at which point you
would be able to derive subclasses from built-in types).
<P>At this point it may be worth mentioning that C.__class__ is the
same object as B.__class__, i.e., C's metaclass is the same as B's
metaclass. In other words, subclassing an existing class creates a
new (meta)inststance of the base class's metaclass.
<P>Going back to the example, the class B.__class__ is instantiated,
passing its constructor the same three arguments that are passed to
the default class constructor or to an extension's metaclass:
<i>name</i>, <i>bases</i>, and <i>namespace</i>.
<P>It is easy to be confused by what exactly happens when using a
metaclass, because we lose the absolute distinction between classes
and instances: a class is an instance of a metaclass (a
``metainstance''), but technically (i.e. in the eyes of the python
runtime system), the metaclass is just a class, and the metainstance
is just an instance. At the end of the class statement, the metaclass
whose metainstance is used as a base class is instantiated, yielding a
second metainstance (of the same metaclass). This metainstance is
then used as a (normal, non-meta) class; instantiation of the class
means calling the metainstance, and this will return a real instance.
And what class is that an instance of? Conceptually, it is of course
an instance of our metainstance; but in most cases the Python runtime
system will see it as an instance of a helper class used by the
metaclass to implement its (non-meta) instances...
<P>Hopefully an example will make things clearer. Let's presume we
have a metaclass MetaClass1. It's helper class (for non-meta
instances) is callled HelperClass1. We now (manually) instantiate
MetaClass1 once to get an empty special base class:
<PRE>
BaseClass1 = MetaClass1("BaseClass1", (), {})
</PRE>
We can now use BaseClass1 as a base class in a class statement:
<PRE>
class MySpecialClass(BaseClass1):
i = 1
def f(s): pass
</PRE>
At this point, MySpecialClass is defined; it is a metainstance of
MetaClass1 just like BaseClass1, and in fact the expression
``BaseClass1.__class__ == MySpecialClass.__class__ == MetaClass1''
yields true.
<P>We are now ready to create instances of MySpecialClass. Let's
assume that no constructor arguments are required:
<PRE>
x = MySpecialClass()
y = MySpecialClass()
print x.__class__, y.__class__
</PRE>
The print statement shows that x and y are instances of HelperClass1.
How did this happen? MySpecialClass is an instance of MetaClass1
(``meta'' is irrelevant here); when an instance is called, its
__call__ method is invoked, and presumably the __call__ method defined
by MetaClass1 returns an instance of HelperClass1.
<P>Now let's see how we could use metaclasses -- what can we do
with metaclasses that we can't easily do without them? Here's one
idea: a metaclass could automatically insert trace calls for all
method calls. Let's first develop a simplified example, without
support for inheritance or other ``advanced'' Python features (we'll
add those later).
<PRE>
import types
class Tracing:
def __init__(self, name, bases, namespace):
"""Create a new class."""
self.__name__ = name
self.__bases__ = bases
self.__namespace__ = namespace
def __call__(self):
"""Create a new instance."""
return Instance(self)
class Instance:
def __init__(self, klass):
self.__klass__ = klass
def __getattr__(self, name):
try:
value = self.__klass__.__namespace__[name]
except KeyError:
raise AttributeError, name
if type(value) is not types.FunctionType:
return value
return BoundMethod(value, self)
class BoundMethod:
def __init__(self, function, instance):
self.function = function
self.instance = instance
def __call__(self, *args):
print "calling", self.function, "for", self.instance, "with", args
return apply(self.function, (self.instance,) + args)
Trace = Tracing('Trace', (), {})
class MyTracedClass(Trace):
def method1(self, a):
self.a = a
def method2(self):
return self.a
aninstance = MyTracedClass()
aninstance.method1(10)
print "the answer is %d" % aninstance.method2()
</PRE>
Confused already? The intention is to read this from top down. The
Tracing class is the metaclass we're defining. Its structure is
really simple.
<P>
<UL>
<LI>The __init__ method is invoked when a new Tracing instance is
created, e.g. the definition of class MyTracedClass later in the
example. It simply saves the class name, base classes and namespace
as instance variables.<P>
<LI>The __call__ method is invoked when a Tracing instance is called,
e.g. the creation of aninstance later in the example. It returns an
instance of the class Instance, which is defined next.<P>
</UL>
<P>The class Instance is the class used for all instances of classes
built using the Tracing metaclass, e.g. aninstance. It has two
methods:
<P>
<UL>
<LI>The __init__ method is invoked from the Tracing.__call__ method
above to initialize a new instance. It saves the class reference as
an instance variable. It uses a funny name because the user's
instance variables (e.g. self.a later in the example) live in the same
namespace.<P>
<LI>The __getattr__ method is invoked whenever the user code
references an attribute of the instance that is not an instance
variable (nor a class variable; but except for __init__ and
__getattr__ there are no class variables). It will be called, for
example, when aninstance.method1 is referenced in the example, with
self set to aninstance and name set to the string "method1".<P>
</UL>
<P>The __getattr__ method looks the name up in the __namespace__
dictionary. If it isn't found, it raises an AttributeError exception.
(In a more realistic example, it would first have to look through the
base classes as well.) If it is found, there are two possibilities:
it's either a function or it isn't. If it's not a function, it is
assumed to be a class variable, and its value is returned. If it's a
function, we have to ``wrap'' it in instance of yet another helper
class, BoundMethod.
<P>The BoundMethod class is needed to implement a familiar feature:
when a method is defined, it has an initial argument, self, which is
automatically bound to the relevant instance when it is called. For
example, aninstance.method1(10) is equivalent to method1(aninstance,
10). In the example if this call, first a temporary BoundMethod
instance is created with the following constructor call: temp =
BoundMethod(method1, aninstance); then this instance is called as
temp(10). After the call, the temporary instance is discarded.
<P>
<UL>
<LI>The __init__ method is invoked for the constructor call
BoundMethod(method1, aninstance). It simply saves away its
arguments.<P>
<LI>The __call__ method is invoked when the bound method instance is
called, as in temp(10). It needs to call method1(aninstance, 10).
However, even though self.function is now method1 and self.instance is
aninstance, it can't call self.function(self.instance, args) directly,
because it should work regardless of the number of arguments passed.
(For simplicity, support for keyword arguments has been omitted.)<P>
</UL>
<P>In order to be able to support arbitrary argument lists, the
__call__ method first constructs a new argument tuple. Conveniently,
because of the notation *args in __call__'s own argument list, the
arguments to __call__ (except for self) are placed in the tuple args.
To construct the desired argument list, we concatenate a singleton
tuple containing the instance with the args tuple: (self.instance,) +
args. (Note the trailing comma used to construct the singleton
tuple.) In our example, the resulting argument tuple is (aninstance,
10).
<P>The intrinsic function apply() takes a function and an argument
tuple and calls the function for it. In our example, we are calling
apply(method1, (aninstance, 10)) which is equivalent to calling
method(aninstance, 10).
<P>From here on, things should come together quite easily. The output
of the example code is something like this:
<PRE>
calling <function method1 at ae8d8> for <Instance instance at 95ab0> with (10,)
calling <function method2 at ae900> for <Instance instance at 95ab0> with ()
the answer is 10
</PRE>
<P>That was about the shortest meaningful example that I could come up
with. A real tracing metaclass (for example, <A
HREF="#Trace">Trace.py</A> discussed below) needs to be more
complicated in two dimensions.
<P>First, it needs to support more advanced Python features such as
class variables, inheritance, __init__ methods, and keyword arguments.
<P>Second, it needs to provide a more flexible way to handle the
actual tracing information; perhaps it should be possible to write
your own tracing function that gets called, perhaps it should be
possible to enable and disable tracing on a per-class or per-instance
basis, and perhaps a filter so that only interesting calls are traced;
it should also be able to trace the return value of the call (or the
exception it raised if an error occurs). Even the Trace.py example
doesn't support all these features yet.
<P>
<HR>
<H1>Real-life Examples</H1>
<P>Have a look at some very preliminary examples that I coded up to
teach myself how to write metaclasses:
<DL>
<DT><A HREF="Enum.py">Enum.py</A>
<DD>This (ab)uses the class syntax as an elegant way to define
enumerated types. The resulting classes are never instantiated --
rather, their class attributes are the enumerated values. For
example:
<PRE>
class Color(Enum):
red = 1
green = 2
blue = 3
print Color.red
</PRE>
will print the string ``Color.red'', while ``Color.red==1'' is true,
and ``Color.red + 1'' raise a TypeError exception.
<P>
<DT><A NAME=Trace></A><A HREF="Trace.py">Trace.py</A>
<DD>The resulting classes work much like standard
classes, but by setting a special class or instance attribute
__trace_output__ to point to a file, all calls to the class's methods
are traced. It was a bit of a struggle to get this right. This
should probably redone using the generic metaclass below.
<P>
<DT><A HREF="Meta.py">Meta.py</A>
<DD>A generic metaclass. This is an attempt at finding out how much
standard class behavior can be mimicked by a metaclass. The
preliminary answer appears to be that everything's fine as long as the
class (or its clients) don't look at the instance's __class__
attribute, nor at the class's __dict__ attribute. The use of
__getattr__ internally makes the classic implementation of __getattr__
hooks tough; we provide a similar hook _getattr_ instead.
(__setattr__ and __delattr__ are not affected.)
(XXX Hm. Could detect presence of __getattr__ and rename it.)
<P>
<DT><A HREF="Eiffel.py">Eiffel.py</A>
<DD>Uses the above generic metaclass to implement Eiffel style
pre-conditions and post-conditions.
<P>
<DT><A HREF="Synch.py">Synch.py</A>
<DD>Uses the above generic metaclass to implement synchronized
methods.
<P>
<DT><A HREF="Simple.py">Simple.py</A>
<DD>The example module used above.
<P>
</DL>
<P>A pattern seems to be emerging: almost all these uses of
metaclasses (except for Enum, which is probably more cute than useful)
mostly work by placing wrappers around method calls. An obvious
problem with that is that it's not easy to combine the features of
different metaclasses, while this would actually be quite useful: for
example, I wouldn't mind getting a trace from the test run of the
Synch module, and it would be interesting to add preconditions to it
as well. This needs more research. Perhaps a metaclass could be
provided that allows stackable wrappers...
<P>
<HR>
<H2>Things You Could Do With Metaclasses</H2>
<P>There are lots of things you could do with metaclasses. Most of
these can also be done with creative use of __getattr__, but
metaclasses make it easier to modify the attribute lookup behavior of
classes. Here's a partial list.
<P>
<UL>
<LI>Enforce different inheritance semantics, e.g. automatically call
base class methods when a derived class overrides<P>
<LI>Implement class methods (e.g. if the first argument is not named
'self')<P>
<LI>Implement that each instance is initialized with <b>copies</b> of
all class variables<P>
<LI>Implement a different way to store instance variables (e.g. in a
list kept outside the instance but indexed by the instance's id())<P>
<LI>Automatically wrap or trap all or certain methods
<UL>
<LI>for tracing
<LI>for precondition and postcondition checking
<LI>for synchronized methods
<LI>for automatic value caching
</UL>
<P>
<LI>When an attribute is a parameterless function, call it on
reference (to mimic it being an instance variable); same on assignment<P>
<LI>Instrumentation: see how many times various attributes are used<P>
<LI>Different semantics for __setattr__ and __getattr__ (e.g. disable
them when they are being used recursively)<P>
<LI>Abuse class syntax for other things<P>
<LI>Experiment with automatic type checking<P>
<LI>Delegation (or acquisition)<P>
<LI>Dynamic inheritance patterns<P>
<LI>Automatic caching of methods<P>
</UL>
<P>
<HR>
<H4>Credits</H4>
<P>Many thanks to David Ascher and Donald Beaudry for their comments
on earlier draft of this paper. Also thanks to Matt Conway and Tommy
Burnette for putting a seed for the idea of metaclasses in my
mind, nearly three years ago, even though at the time my response was
``you can do that with __getattr__ hooks...'' :-)
<P>
<HR>
</BODY>
</HTML>
PK z��Z6Q�} Synch.pynu �[��� """Synchronization metaclass.
This metaclass makes it possible to declare synchronized methods.
"""
import thread
# First we need to define a reentrant lock.
# This is generally useful and should probably be in a standard Python
# library module. For now, we in-line it.
class Lock:
"""Reentrant lock.
This is a mutex-like object which can be acquired by the same
thread more than once. It keeps a reference count of the number
of times it has been acquired by the same thread. Each acquire()
call must be matched by a release() call and only the last
release() call actually releases the lock for acquisition by
another thread.
The implementation uses two locks internally:
__mutex is a short term lock used to protect the instance variables
__wait is the lock for which other threads wait
A thread intending to acquire both locks should acquire __wait
first.
The implementation uses two other instance variables, protected by
locking __mutex:
__tid is the thread ID of the thread that currently has the lock
__count is the number of times the current thread has acquired it
When the lock is released, __tid is None and __count is zero.
"""
def __init__(self):
"""Constructor. Initialize all instance variables."""
self.__mutex = thread.allocate_lock()
self.__wait = thread.allocate_lock()
self.__tid = None
self.__count = 0
def acquire(self, flag=1):
"""Acquire the lock.
If the optional flag argument is false, returns immediately
when it cannot acquire the __wait lock without blocking (it
may still block for a little while in order to acquire the
__mutex lock).
The return value is only relevant when the flag argument is
false; it is 1 if the lock is acquired, 0 if not.
"""
self.__mutex.acquire()
try:
if self.__tid == thread.get_ident():
self.__count = self.__count + 1
return 1
finally:
self.__mutex.release()
locked = self.__wait.acquire(flag)
if not flag and not locked:
return 0
try:
self.__mutex.acquire()
assert self.__tid == None
assert self.__count == 0
self.__tid = thread.get_ident()
self.__count = 1
return 1
finally:
self.__mutex.release()
def release(self):
"""Release the lock.
If this thread doesn't currently have the lock, an assertion
error is raised.
Only allow another thread to acquire the lock when the count
reaches zero after decrementing it.
"""
self.__mutex.acquire()
try:
assert self.__tid == thread.get_ident()
assert self.__count > 0
self.__count = self.__count - 1
if self.__count == 0:
self.__tid = None
self.__wait.release()
finally:
self.__mutex.release()
def _testLock():
done = []
def f2(lock, done=done):
lock.acquire()
print "f2 running in thread %d\n" % thread.get_ident(),
lock.release()
done.append(1)
def f1(lock, f2=f2, done=done):
lock.acquire()
print "f1 running in thread %d\n" % thread.get_ident(),
try:
f2(lock)
finally:
lock.release()
done.append(1)
lock = Lock()
lock.acquire()
f1(lock) # Adds 2 to done
lock.release()
lock.acquire()
thread.start_new_thread(f1, (lock,)) # Adds 2
thread.start_new_thread(f1, (lock, f1)) # Adds 3
thread.start_new_thread(f2, (lock,)) # Adds 1
thread.start_new_thread(f2, (lock,)) # Adds 1
lock.release()
import time
while len(done) < 9:
print len(done)
time.sleep(0.001)
print len(done)
# Now, the Locking metaclass is a piece of cake.
# As an example feature, methods whose name begins with exactly one
# underscore are not synchronized.
from Meta import MetaClass, MetaHelper, MetaMethodWrapper
class LockingMethodWrapper(MetaMethodWrapper):
def __call__(self, *args, **kw):
if self.__name__[:1] == '_' and self.__name__[1:] != '_':
return apply(self.func, (self.inst,) + args, kw)
self.inst.__lock__.acquire()
try:
return apply(self.func, (self.inst,) + args, kw)
finally:
self.inst.__lock__.release()
class LockingHelper(MetaHelper):
__methodwrapper__ = LockingMethodWrapper
def __helperinit__(self, formalclass):
MetaHelper.__helperinit__(self, formalclass)
self.__lock__ = Lock()
class LockingMetaClass(MetaClass):
__helper__ = LockingHelper
Locking = LockingMetaClass('Locking', (), {})
def _test():
# For kicks, take away the Locking base class and see it die
class Buffer(Locking):
def __init__(self, initialsize):
assert initialsize > 0
self.size = initialsize
self.buffer = [None]*self.size
self.first = self.last = 0
def put(self, item):
# Do we need to grow the buffer?
if (self.last+1) % self.size != self.first:
# Insert the new item
self.buffer[self.last] = item
self.last = (self.last+1) % self.size
return
# Double the buffer size
# First normalize it so that first==0 and last==size-1
print "buffer =", self.buffer
print "first = %d, last = %d, size = %d" % (
self.first, self.last, self.size)
if self.first <= self.last:
temp = self.buffer[self.first:self.last]
else:
temp = self.buffer[self.first:] + self.buffer[:self.last]
print "temp =", temp
self.buffer = temp + [None]*(self.size+1)
self.first = 0
self.last = self.size-1
self.size = self.size*2
print "Buffer size doubled to", self.size
print "new buffer =", self.buffer
print "first = %d, last = %d, size = %d" % (
self.first, self.last, self.size)
self.put(item) # Recursive call to test the locking
def get(self):
# Is the buffer empty?
if self.first == self.last:
raise EOFError # Avoid defining a new exception
item = self.buffer[self.first]
self.first = (self.first+1) % self.size
return item
def producer(buffer, wait, n=1000):
import time
i = 0
while i < n:
print "put", i
buffer.put(i)
i = i+1
print "Producer: done producing", n, "items"
wait.release()
def consumer(buffer, wait, n=1000):
import time
i = 0
tout = 0.001
while i < n:
try:
x = buffer.get()
if x != i:
raise AssertionError, \
"get() returned %s, expected %s" % (x, i)
print "got", i
i = i+1
tout = 0.001
except EOFError:
time.sleep(tout)
tout = tout*2
print "Consumer: done consuming", n, "items"
wait.release()
pwait = thread.allocate_lock()
pwait.acquire()
cwait = thread.allocate_lock()
cwait.acquire()
buffer = Buffer(1)
n = 1000
thread.start_new_thread(consumer, (buffer, cwait, n))
thread.start_new_thread(producer, (buffer, pwait, n))
pwait.acquire()
print "Producer done"
cwait.acquire()
print "All done"
print "buffer size ==", len(buffer.buffer)
if __name__ == '__main__':
_testLock()
_test()
PK z��ZLԯC# # Enum.pycnu �[��� �
��^c @ sm d Z d d l Z d d
d � � YZ d d d � � YZ e d d i � Z d � Z e d k ri e � n d S(
sC Enumeration metaclass.
XXX This is very much a work in progress.
i����Nt
EnumMetaClassc B s) e Z d Z d � Z d � Z d � Z RS( sh Metaclass for enumeration.
To define your own enumeration, do something like
class Color(Enum):
red = 1
green = 2
blue = 3
Now, Color.red, Color.green and Color.blue behave totally
different: they are enumerated values, not integers.
Enumerations cannot be instantiated; however they can be
subclassed.
c C s� x) | D]! } | j t k r t d � q q Wt d � | � } | | _ | | _ i | _ x3 | j � D]% \ } } t | | | � | j | <qf Wd S( s� Constructor -- create an enumeration.
Called at the end of the class statement. The arguments are
the name of the new class, a tuple containing the base
classes, and a dictionary containing everything that was
entered in the class' namespace during execution of the class
statement. In the above example, it would be {'red': 1,
'green': 2, 'blue': 3}.
s* Enumeration base class must be enumerationc S s
| t k S( N( t Enum( t x( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt <lambda>) t N( t __class__R t TypeErrort filtert __name__t __bases__t _EnumMetaClass__dictt itemst EnumInstance( t selft namet basest dictt baset keyt value( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __init__ s
c C s� | d k r | j j � Sy | j | SWnM t k
rw x= | j D]. } y t | | � SWqB t k
ro qB qB XqB Wn Xt | � d S( s� Return an enumeration value.
For example, Color.red returns the value corresponding to red.
XXX Perhaps the values should be created in the constructor?
This looks in the class dictionary and if it is not found
there asks the base classes.
The special attribute __members__ returns the list of names
defined in this class (it does not merge in the names defined
in base classes).
t __members__N( R
t keyst KeyErrorR t getattrt AttributeError( R
R R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __getattr__0 s
c C s� | j } | j rB | d t j t d � | j � d � d } n | j r� g } x: | j j � D]) \ } } | j d | t | � f � qa Wd | t j | d � f } n | S( Nt (c S s | j S( N( R ( R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR P R s , t )s %s: %ss %s: {%s}( R R t stringt joint mapR
R t appendt int( R
t st listR R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __repr__M s 0 ! ( R t
__module__t __doc__R R R$ ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR s R c B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( s
Class to represent an enumeration value.
EnumInstance('Color', 'red', 12) prints as 'Color.red' and behaves
like the integer 12 when compared, but doesn't support arithmetic.
XXX Should it record the actual enumeration rather than just its
name?
c C s | | _ | | _ | | _ d S( N( t _EnumInstance__classnamet _EnumInstance__enumnamet _EnumInstance__value( R
t classnamet enumnameR ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR e s c C s | j S( N( R) ( R
( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __int__j s c C s d | j | j | j f S( Ns EnumInstance(%r, %r, %r)( R' R( R) ( R
( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR$ m s c C s d | j | j f S( Ns %s.%s( R' R( ( R
( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __str__r s c C s t | j t | � � S( N( t cmpR) R! ( R
t other( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __cmp__u s ( R R% R& R R, R$ R- R0 ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR Z s R c C s� d t f d � � Y} | j GHt | � GH| j | j k GH| j | j k GH| j d k GH| j d k GHd | f d � � Y} | j GH| j GH| j | j k GHd t f d � � Y} d | | f d
� � Y} | j GH| j GH| GH| GH| GH| GHd S( Nt Colorc B s e Z d Z d Z d Z RS( i i i ( R R% t redt greent blue( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR1 � s i i t
ExtendedColorc B s& e Z d Z d Z d Z d Z d Z RS( i i i i i ( R R% t whitet oranget yellowt purplet black( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR5 � s
t
OtherColorc B s e Z d Z d Z RS( i i ( R R% R6 R4 ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR; � s t MergedColorc B s e Z RS( ( R R% ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR< � s ( R R2 t dirR4 R7 R6 ( R1 R5 R; R< ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt _test~ s& t __main__( ( ( ( R& R R R R R> R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt <module> s Q! * PK z��Z>Ͼo% % Trace.pynu �[��� """Tracing metaclass.
XXX This is very much a work in progress.
"""
import types, sys
class TraceMetaClass:
"""Metaclass for tracing.
Classes defined using this metaclass have an automatic tracing
feature -- by setting the __trace_output__ instance (or class)
variable to a file object, trace messages about all calls are
written to the file. The trace formatting can be changed by
defining a suitable __trace_call__ method.
"""
__inited = 0
def __init__(self, name, bases, dict):
self.__name__ = name
self.__bases__ = bases
self.__dict = dict
# XXX Can't define __dict__, alas
self.__inited = 1
def __getattr__(self, name):
try:
return self.__dict[name]
except KeyError:
for base in self.__bases__:
try:
return base.__getattr__(name)
except AttributeError:
pass
raise AttributeError, name
def __setattr__(self, name, value):
if not self.__inited:
self.__dict__[name] = value
else:
self.__dict[name] = value
def __call__(self, *args, **kw):
inst = TracingInstance()
inst.__meta_init__(self)
try:
init = inst.__getattr__('__init__')
except AttributeError:
init = lambda: None
apply(init, args, kw)
return inst
__trace_output__ = None
class TracingInstance:
"""Helper class to represent an instance of a tracing class."""
def __trace_call__(self, fp, fmt, *args):
fp.write((fmt+'\n') % args)
def __meta_init__(self, klass):
self.__class = klass
def __getattr__(self, name):
# Invoked for any attr not in the instance's __dict__
try:
raw = self.__class.__getattr__(name)
except AttributeError:
raise AttributeError, name
if type(raw) != types.FunctionType:
return raw
# It's a function
fullname = self.__class.__name__ + "." + name
if not self.__trace_output__ or name == '__trace_call__':
return NotTracingWrapper(fullname, raw, self)
else:
return TracingWrapper(fullname, raw, self)
class NotTracingWrapper:
def __init__(self, name, func, inst):
self.__name__ = name
self.func = func
self.inst = inst
def __call__(self, *args, **kw):
return apply(self.func, (self.inst,) + args, kw)
class TracingWrapper(NotTracingWrapper):
def __call__(self, *args, **kw):
self.inst.__trace_call__(self.inst.__trace_output__,
"calling %s, inst=%s, args=%s, kw=%s",
self.__name__, self.inst, args, kw)
try:
rv = apply(self.func, (self.inst,) + args, kw)
except:
t, v, tb = sys.exc_info()
self.inst.__trace_call__(self.inst.__trace_output__,
"returning from %s with exception %s: %s",
self.__name__, t, v)
raise t, v, tb
else:
self.inst.__trace_call__(self.inst.__trace_output__,
"returning from %s with value %s",
self.__name__, rv)
return rv
Traced = TraceMetaClass('Traced', (), {'__trace_output__': None})
def _test():
global C, D
class C(Traced):
def __init__(self, x=0): self.x = x
def m1(self, x): self.x = x
def m2(self, y): return self.x + y
__trace_output__ = sys.stdout
class D(C):
def m2(self, y): print "D.m2(%r)" % (y,); return C.m2(self, y)
__trace_output__ = None
x = C(4321)
print x
print x.x
print x.m1(100)
print x.m1(10)
print x.m2(33)
print x.m1(5)
print x.m2(4000)
print x.x
print C.__init__
print C.m2
print D.__init__
print D.m2
y = D()
print y
print y.m1(10)
print y.m2(100)
print y.x
if __name__ == '__main__':
_test()
PK z��ZNι�u u Meta.pynu �[��� """Generic metaclass.
XXX This is very much a work in progress.
"""
import types
class MetaMethodWrapper:
def __init__(self, func, inst):
self.func = func
self.inst = inst
self.__name__ = self.func.__name__
def __call__(self, *args, **kw):
return apply(self.func, (self.inst,) + args, kw)
class MetaHelper:
__methodwrapper__ = MetaMethodWrapper # For derived helpers to override
def __helperinit__(self, formalclass):
self.__formalclass__ = formalclass
def __getattr__(self, name):
# Invoked for any attr not in the instance's __dict__
try:
raw = self.__formalclass__.__getattr__(name)
except AttributeError:
try:
ga = self.__formalclass__.__getattr__('__usergetattr__')
except (KeyError, AttributeError):
raise AttributeError, name
return ga(self, name)
if type(raw) != types.FunctionType:
return raw
return self.__methodwrapper__(raw, self)
class MetaClass:
"""A generic metaclass.
This can be subclassed to implement various kinds of meta-behavior.
"""
__helper__ = MetaHelper # For derived metaclasses to override
__inited = 0
def __init__(self, name, bases, dict):
try:
ga = dict['__getattr__']
except KeyError:
pass
else:
dict['__usergetattr__'] = ga
del dict['__getattr__']
self.__name__ = name
self.__bases__ = bases
self.__realdict__ = dict
self.__inited = 1
def __getattr__(self, name):
try:
return self.__realdict__[name]
except KeyError:
for base in self.__bases__:
try:
return base.__getattr__(name)
except AttributeError:
pass
raise AttributeError, name
def __setattr__(self, name, value):
if not self.__inited:
self.__dict__[name] = value
else:
self.__realdict__[name] = value
def __call__(self, *args, **kw):
inst = self.__helper__()
inst.__helperinit__(self)
try:
init = inst.__getattr__('__init__')
except AttributeError:
init = lambda: None
apply(init, args, kw)
return inst
Meta = MetaClass('Meta', (), {})
def _test():
class C(Meta):
def __init__(self, *args):
print "__init__, args =", args
def m1(self, x):
print "m1(x=%r)" % (x,)
print C
x = C()
print x
x.m1(12)
class D(C):
def __getattr__(self, name):
if name[:2] == '__': raise AttributeError, name
return "getattr:%s" % name
x = D()
print x.foo
print x._foo
## print x.__foo
## print x.__foo__
if __name__ == '__main__':
_test()
PK z��Z��Y� Trace.pyonu �[��� �
��^c @ s� d Z d d l Z d d l Z d d d � � YZ d d d � � YZ d d d � � YZ d e f d
� � YZ e d d i d d 6� Z d
� Z e
d k r� e � n d S( s? Tracing metaclass.
XXX This is very much a work in progress.
i����Nt TraceMetaClassc B s> e Z d Z d Z d � Z d � Z d � Z d � Z d Z RS( sU Metaclass for tracing.
Classes defined using this metaclass have an automatic tracing
feature -- by setting the __trace_output__ instance (or class)
variable to a file object, trace messages about all calls are
written to the file. The trace formatting can be changed by
defining a suitable __trace_call__ method.
i c C s( | | _ | | _ | | _ d | _ d S( Ni ( t __name__t __bases__t _TraceMetaClass__dictt _TraceMetaClass__inited( t selft namet basest dict( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __init__ s c C si y | j | SWnS t k
rd x6 | j D]+ } y | j | � SWq) t k
rS q) Xq) Wt | � n Xd S( N( R t KeyErrorR t __getattr__t AttributeError( R R t base( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR s
c C s* | j s | | j | <n
| | j | <d S( N( R t __dict__R ( R R t value( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __setattr__( s c O sZ t � } | j | � y | j d � } Wn t k
rE d � } n Xt | | | � | S( NR c S s d S( N( t None( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt <lambda>4 t ( t TracingInstancet
__meta_init__R R t apply( R t argst kwt instt init( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __call__. s
N(
R t
__module__t __doc__R R R R R R t __trace_output__( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR s
R c B s) e Z d Z d � Z d � Z d � Z RS( s9 Helper class to represent an instance of a tracing class.c G s | j | d | � d S( Ns
( t write( R t fpt fmtR ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt __trace_call__= s c C s
| | _ d S( N( t _TracingInstance__class( R t klass( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR @ s c C s� y | j j | � } Wn t k
r2 t | � n Xt | � t j k rL | S| j j d | } | j sv | d k r� t | | | � St | | | � Sd S( Nt .R" (
R# R R t typet typest FunctionTypeR R t NotTracingWrappert TracingWrapper( R R t rawt fullname( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR C s
( R R R R" R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR : s R) c B s e Z d � Z d � Z RS( c C s | | _ | | _ | | _ d S( N( R t funcR ( R R R- R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR S s c O s t | j | j f | | � S( N( R R- R ( R R R ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR W s ( R R R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR) R s R* c B s e Z d � Z RS( c O s� | j j | j j d | j | j | | � y# t | j | j f | | � } WnM t j � \ } } } | j j | j j d | j | | � | | | � n' X| j j | j j d | j | � | Sd S( Ns# calling %s, inst=%s, args=%s, kw=%ss' returning from %s with exception %s: %ss returning from %s with value %s( R R" R R R R- t syst exc_info( R R R t rvt tt vt tb( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR [ s #
( R R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR* Z s t TracedR c C s� d t f d � � Ya d t f d � � Ya t d � } | GH| j GH| j d � GH| j d � GH| j d � GH| j d � GH| j d
� GH| j GHt j GHt j GHt j GHt j GHt � } | GH| j d � GH| j d � GH| j GHd S( Nt Cc B s/ e Z d d � Z d � Z d � Z e j Z RS( i c S s
| | _ d S( N( t x( R R6 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR s R c S s
| | _ d S( N( R6 ( R R6 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt m1t R c S s | j | S( N( R6 ( R t y( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt m2u R ( R R R R7 R9 R. t stdoutR ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR5 r s t Dc B s e Z d � Z d Z RS( c S s d | f GHt j | | � S( Ns D.m2(%r)( R5 R9 ( R R8 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR9 x s N( R R R9 R R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyR; w s i� id i
i! i i� ( R4 R5 R; R6 R7 R9 R ( R6 R8 ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt _testp s( t __main__( ( ( ( ( R R' R. R R R) R* R R4 R< R ( ( ( s. /usr/lib64/python2.7/Demo/metaclasses/Trace.pyt <module> s 1 PK z��ZLԯC# # Enum.pyonu �[��� �
��^c @ sm d Z d d l Z d d
d � � YZ d d d � � YZ e d d i � Z d � Z e d k ri e � n d S(
sC Enumeration metaclass.
XXX This is very much a work in progress.
i����Nt
EnumMetaClassc B s) e Z d Z d � Z d � Z d � Z RS( sh Metaclass for enumeration.
To define your own enumeration, do something like
class Color(Enum):
red = 1
green = 2
blue = 3
Now, Color.red, Color.green and Color.blue behave totally
different: they are enumerated values, not integers.
Enumerations cannot be instantiated; however they can be
subclassed.
c C s� x) | D]! } | j t k r t d � q q Wt d � | � } | | _ | | _ i | _ x3 | j � D]% \ } } t | | | � | j | <qf Wd S( s� Constructor -- create an enumeration.
Called at the end of the class statement. The arguments are
the name of the new class, a tuple containing the base
classes, and a dictionary containing everything that was
entered in the class' namespace during execution of the class
statement. In the above example, it would be {'red': 1,
'green': 2, 'blue': 3}.
s* Enumeration base class must be enumerationc S s
| t k S( N( t Enum( t x( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt <lambda>) t N( t __class__R t TypeErrort filtert __name__t __bases__t _EnumMetaClass__dictt itemst EnumInstance( t selft namet basest dictt baset keyt value( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __init__ s
c C s� | d k r | j j � Sy | j | SWnM t k
rw x= | j D]. } y t | | � SWqB t k
ro qB qB XqB Wn Xt | � d S( s� Return an enumeration value.
For example, Color.red returns the value corresponding to red.
XXX Perhaps the values should be created in the constructor?
This looks in the class dictionary and if it is not found
there asks the base classes.
The special attribute __members__ returns the list of names
defined in this class (it does not merge in the names defined
in base classes).
t __members__N( R
t keyst KeyErrorR t getattrt AttributeError( R
R R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __getattr__0 s
c C s� | j } | j rB | d t j t d � | j � d � d } n | j r� g } x: | j j � D]) \ } } | j d | t | � f � qa Wd | t j | d � f } n | S( Nt (c S s | j S( N( R ( R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR P R s , t )s %s: %ss %s: {%s}( R R t stringt joint mapR
R t appendt int( R
t st listR R ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __repr__M s 0 ! ( R t
__module__t __doc__R R R$ ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR s R c B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( s
Class to represent an enumeration value.
EnumInstance('Color', 'red', 12) prints as 'Color.red' and behaves
like the integer 12 when compared, but doesn't support arithmetic.
XXX Should it record the actual enumeration rather than just its
name?
c C s | | _ | | _ | | _ d S( N( t _EnumInstance__classnamet _EnumInstance__enumnamet _EnumInstance__value( R
t classnamet enumnameR ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR e s c C s | j S( N( R) ( R
( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __int__j s c C s d | j | j | j f S( Ns EnumInstance(%r, %r, %r)( R' R( R) ( R
( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR$ m s c C s d | j | j f S( Ns %s.%s( R' R( ( R
( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __str__r s c C s t | j t | � � S( N( t cmpR) R! ( R
t other( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt __cmp__u s ( R R% R& R R, R$ R- R0 ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR Z s R c C s� d t f d � � Y} | j GHt | � GH| j | j k GH| j | j k GH| j d k GH| j d k GHd | f d � � Y} | j GH| j GH| j | j k GHd t f d � � Y} d | | f d
� � Y} | j GH| j GH| GH| GH| GH| GHd S( Nt Colorc B s e Z d Z d Z d Z RS( i i i ( R R% t redt greent blue( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR1 � s i i t
ExtendedColorc B s& e Z d Z d Z d Z d Z d Z RS( i i i i i ( R R% t whitet oranget yellowt purplet black( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR5 � s
t
OtherColorc B s e Z d Z d Z RS( i i ( R R% R6 R4 ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR; � s t MergedColorc B s e Z RS( ( R R% ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyR< � s ( R R2 t dirR4 R7 R6 ( R1 R5 R; R< ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt _test~ s& t __main__( ( ( ( R& R R R R R> R ( ( ( s- /usr/lib64/python2.7/Demo/metaclasses/Enum.pyt <module> s Q! * PK z��ZyH� � �
Eiffel.pyonu �[��� PK z��Z�z�
� Eiffel.pycnu �[��� PK z��Z��Y� >$ Trace.pycnu �[��� PK z��Z�L! ! �< Synch.pycnu �[��� PK z��Zá�>�
�
�] Simple.pycnu �[��� PK z��ZǪ�>z z �h Synch.pyonu �[��� PK z��Z�VA�� � �� Meta.pyonu �[��� PK z��Z��� � �� Simple.pynu �[��� PK z��Z�VA�� � ~� Meta.pycnu �[��� PK z��Zá�>�
�
�� Simple.pyonu �[��� PK z��Z,.K��
�
�� Eiffel.pynu �[��� PK z��Z��C C R� Enum.pynu �[��� PK z��Z�BO- - �� meta-vladimir.txtnu �[��� PK z��Z���]P ]P
index.htmlnu �[��� PK z��Z6Q�} �Z Synch.pynu �[��� PK z��ZLԯC# # �y Enum.pycnu �[��� PK z��Z>Ͼo% % @� Trace.pynu �[��� PK z��ZNι�u u �� Meta.pynu �[��� PK z��Z��Y� I� Trace.pyonu �[��� PK z��ZLԯC# # �� Enum.pyonu �[��� PK � ��