B `X@sddlmZddlZddlmZddlZddlZddlZddlm Z e Z e dkZyddlZdZWnek rdZdZYnXGdd d e Z d>d d Zd?ddZddZddZddZddZGdddZGdddZGdddZGdddZd d!Zd"d#Zd$d%ZGd&d'd'Zed(Z ed)Z!Gd*d+d+Z"d,d-Z#ed.d/Z$d0d1Z%d2d3Z&d@d4d5Z'Gd6d7d7Z(d8d9Z)d:d;Z*dAds  r!cCst|s|f}tt|}|S)N)r tuplesorted)valr r r as_sorted_tupleEs r%c@seZdZddZdddZdS)SettablePropertycCs||_t||dS)N)wrapped functoolsupdate_wrapper)rr'r r r rOszSettableProperty.__init__NcCs|dkr |S||S)N)r')robjtyper r r __get__SszSettableProperty.__get__)N)r r rrr,r r r r r&Lsr&c@sReZdZdZddZedddZedd Zedd d Zdd d Z ddZ dS)InstancePropertyHelperaA helper object for assigning properties and descriptors to instances. It is not normally possible to do this because descriptors must be defined on the class itself. This class is optimized for adding multiple properties at once to an instance. This is done by calling :meth:`.add_property` once per-property and then invoking :meth:`.apply` on target objects. cCs i|_dS)N) properties)rr r r rdszInstancePropertyHelper.__init__NFcs|dkr tdstdj}t|}t}|rB|rBtd|rL}n<fdd}||_j|_|rddl}|j |}nt |}||fS)zConvert a callable into one suitable for adding to the instance. This will return a 2-tuple containing the computed (name, property) pair. Nr z2missing __name__, must specify "name" for propertyzcannot reify a data descriptorcs|S)Nr )this)callabler r {z6InstancePropertyHelper.make_property..r) r ValueErrorr get_callable_nameinspectisdatadescriptor__doc__Zpyramid.decorator decoratorreifyr&)clsr0namer9Zis_data_descriptorfnr'Zpyramidr )r0r make_propertygs&   z$InstancePropertyHelper.make_propertycCsjt|}|rf|j}|d|jt|j|tf|}x,dD]$}t||t}|tk r8t |||q8W||_dS)zAccept a list or dict of ``properties`` generated from :meth:`.make_property` and apply them to a ``target`` object. r )Z__implemented__Z __provides__N) dict __class__ setdefaultr r+r objectgetattr_markersetattr)r:targetr.attrsparentZnewclsr;r$r r r apply_propertiess  z'InstancePropertyHelper.apply_propertiescCs"|j|||d}|||gdS)z:A helper method to apply a single property to an instance.)r;r9N)r=rH)r:rEr0r;r9propr r r set_propertysz#InstancePropertyHelper.set_propertycCs"|j|||d\}}||j|<dS)zAdd a new property configuration. This should be used in combination with :meth:`.apply` as a more efficient version of :meth:`.set_property`. )r;r9N)r=r.)rr0r;r9r<r r r add_propertysz#InstancePropertyHelper.add_propertycCs|jr|||jdS)z< Apply all configured properties to the ``target`` instance.N)r.rH)rrEr r r applyszInstancePropertyHelper.apply)NF)NF)NF) r r rr7r classmethodr=rHrJrKrLr r r r r-Ys  !  r-c@seZdZdZdddZdS)InstancePropertyMixinzMixin that will allow an instance to add properties at run-time as if they had been defined via @property or @reify on the class itself. NFcCstj||||ddS)aAdd a callable or a property descriptor to the instance. Properties, unlike attributes, are lazily evaluated by executing an underlying callable when accessed. They can be useful for adding features to an object without any cost if those features go unused. A property may also be reified via the :class:`pyramid.decorator.reify` decorator by setting ``reify=True``, allowing the result of the evaluation to be cached. Using this method, the value of the property is only computed once for the lifetime of the object. ``callable`` can either be a callable that accepts the instance as its single positional parameter, or it can be a property descriptor. If the ``callable`` is a property descriptor, the ``name`` parameter must be supplied or a ``ValueError`` will be raised. Also note that a property descriptor cannot be reified, so ``reify`` must be ``False``. If ``name`` is None, the name of the property will be computed from the name of the ``callable``. .. code-block:: python :linenos: class Foo(InstancePropertyMixin): _x = 1 def _get_x(self): return _x def _set_x(self, value): self._x = value foo = Foo() foo.set_property(property(_get_x, _set_x), name='x') foo.set_property(_get_x, name='y', reify=True) >>> foo.x 1 >>> foo.y 1 >>> foo.x = 5 >>> foo.x 5 >>> foo.y # notice y keeps the original value 1 )r;r9N)r-rJ)rr0r;r9r r r rJs4z"InstancePropertyMixin.set_property)NF)r r rr7rJr r r r rNsrNc@s\eZdZdZddZddZddZdd Zd d Zd d Z ddZ ddZ e ddZ dS)WeakOrderedSetaMaintain a set of items. Each item is stored as a weakref to avoid extending their lifetime. The values may be iterated over or the last item added may be accessed via the ``last`` property. If items are added more than once, the most recent addition will be remembered in the order: order = WeakOrderedSet() order.add('1') order.add('2') order.add('1') list(order) == ['2', '1'] order.last == '1' cCsi|_g|_dS)N)_items_order)rr r r rszWeakOrderedSet.__init__cs^t|jkr.jjdSt|fdd}|j<jdS)z Add an item to the set.Ncs S)N) _remove_by_id)x)oidrr r r1r2z$WeakOrderedSet.add..)idrPrQremoveappendweakrefref)ritemrYr )rTrr adds    zWeakOrderedSet.addcCs"||jkr|j|=|j|dS)z Remove an item from the set.N)rPrQrV)rrTr r r rR s zWeakOrderedSet._remove_by_idcCs|t|dS)z Remove an item from the set.N)rRrU)rrZr r r rV&szWeakOrderedSet.removecCsi|_g|_dS)z Clear all objects from the set.N)rPrQ)rr r r empty*szWeakOrderedSet.emptycCs t|jS)N)lenrQ)rr r r __len__/szWeakOrderedSet.__len__cCst|}||jkS)N)rUrP)rrZrTr r r __contains__2szWeakOrderedSet.__contains__csfddjDS)Nc3s|]}j|VqdS)N)rP).0rT)rr r 7sz*WeakOrderedSet.__iter__..)rQ)rr )rr r6szWeakOrderedSet.__iter__cCs |jr|jd}|j|SdS)N)rQrP)rrTr r r last9s zWeakOrderedSet.lastN)r r rr7rr[rRrVr\r^r_rpropertyrcr r r r rOs rOcCsBt|t|k}|rd}|}nd}|}|}|t|| 7}|dkS)aCheck whether two strings differ while avoiding timing attacks. This function returns True if the given strings differ and False if they are equal. It's careful not to leak information about *where* they differ as a result of its running time, which can be very important to avoid certain timing-related crypto attacks: http://seb.dbzteam.org/crypto/python-oauth-timing-hmac.pdf .. versionchanged:: 1.6 Support :func:`hmac.compare_digest` if it is available (Python 2.7.7+ and Python 3.3+). r)r]r)Zstring1Zstring2Zlen_eqZ invalid_bitsleftrightr r r strings_differ@srhcCs<t|tr|St|tr t|St|tttdfr>> object_description(None) 'None' >>> from xml.dom import minidom >>> object_description(minidom) 'module xml.dom.minidom' >>> object_description(minidom.Attr) 'class xml.dom.minidom.Attr' >>> object_description(minidom.Attr.appendChild) 'method appendChild of class xml.dom.minidom.Attr' If this method cannot identify the type of the object, a generic description ala ``object `` will be returned. If the object passed is already a string, it is simply returned. If it is a boolean, an integer, a list, a tuple, a set, or ``None``, a (possibly shortened) string representation is returned. N})]z object %sz module %s__self__zmethod %s of class %s.%sz%s.%szclass %sz function %s)rrintboolfloatr+set shortreprr"listr>r5 getmoduler ismoduleismethodrBr?isclass isfunction)rAmodule modulenameZoselfZ dottednamer r r object_description\sB                  rzcCs,t|}t|dkr(|ddd|}|S)Ndz ... %s)rr])rAcloserrr r r rqs rqc@seZdZddZddZdS)SentinelcCs ||_dS)N)repr)rrr r r rszSentinel.__init__cCs|jS)N)r)rr r r __repr__szSentinel.__repr__N)r r rrrr r r r r~sr~FIRSTLASTc@sDeZdZdZedeefddZddZddZd d d Z d d Z dS)TopologicalSorterz[A utility class which can be used to perform topological sorts against tuple-like data.NcCsJg|_t|_t|_i|_i|_i|_g|_||_||_ ||_ ||_ dS)N) namesrp req_before req_after name2before name2aftername2valorderdefault_before default_afterfirstrc)rrrrrcr r r rszTopologicalSorter.__init__cCs |jS)N)rvalues)rr r r rszTopologicalSorter.valuescCs|j||j|=|j|g}|rP|j|x|D]}|j||fq8W|j|g}|r|j|x|D]}|j||fqtWdS)z# Remove a node from the sort input N) rrVrrpoprrrr)rr;afterubeforer r r rVs     zTopologicalSorter.removecs|jkr||j||j<|dkrF|dkrF|j}|j}|dk rt|s\|f}||j<|jfdd|D7_|j |dk rt|s|f}||j <|jfdd|D7_|j dS)aAdd a node to the sort input. The ``name`` should be a string or any other hashable object, the ``val`` should be the sortable (doesn't need to be hashable). ``after`` and ``before`` represents the name of one of the other sortables (or a sequence of such named) or one of the special sentinel values :attr:`pyramid.util.FIRST`` or :attr:`pyramid.util.LAST` representing the first or last positions respectively. ``FIRST`` and ``LAST`` can also be part of a sequence passed as ``before`` or ``after``. A sortable should not be added after LAST or before FIRST. An example:: sorter = TopologicalSorter() sorter.add('a', {'a':1}, before=LAST, after='b') sorter.add('b', {'b':2}, before=LAST, after='c') sorter.add('c', {'c':3}) sorter.sorted() # will be {'c':3}, {'b':2}, {'a':1} Ncsg|] }|fqSr r )r`r)r;r r sz)TopologicalSorter.add..csg|] }|fqSr r )r`o)r;r r rs) rrVrWrrrr rrrr[rr)rr;r$rrr )r;r r[s&       zTopologicalSorter.addcs<|j|jfg}gi|j|jg}||jx |jD]\}}|||fq6Wfdd}fdd}x|D] }||qrWtt}} x>|D]6\}}||kr||kr|||||| |qW|j |sddl m } | dd t |j||j | s.add_nodecs8|||dd7<|kr4|dS)Nrre)rWrV)ZfromnodeZtonode)rrr r add_arcsz)TopologicalSorter.sorted..add_arcr)ConfigurationErrorz#Unsatisfied before dependencies: %sz, z"Unsatisfied after dependencies: %sreN)CyclicDependencyError)rrcextendrrrWrpr[rissubsetpyramid.exceptionsrjoinr#rrinsertritemsr)rrrabrrr;Z has_beforeZ has_afterrZ sorted_namesrootchildrenchildZarcsrZ cycledepskrresultr )rrr r#sd                  zTopologicalSorter.sorted)NN) r r rr7rrrrrVr[r#r r r r rs  'rc CsByt|Sttfk r<ddlm}d}|||YnXdS)zg Verifies that the ``name`` is ascii and will raise a ``ConfigurationError`` if it is not. r)rzY`name="%s"` is invalid. `name` must be ascii because it is used on __name__ of the methodN)rUnicodeEncodeErrorUnicodeDecodeErrorrr)r;rmsgr r r r4Gs  r4c gs||dk r|jni}i}x|D]}||t||<qWz dVWdx4|D],}||}|tk rd|||<qF||krF||=qFWXdS)z@ Temporarily delete object attrs and restore afterward. N)__dict__rrC)r*rFZobj_valsZ saved_valsr;Z saved_valr r r hide_attrsYs    rcCs>|sdS|}|ddkr6||p<||ddkp<||kS)a3 Return ``True`` if the host is either an exact match or a match to the wildcard pattern. Any pattern beginning with a period matches a domain and all of its subdomains. (e.g. ``.example.com`` matches ``example.com`` and ``foo.example.com``). Anything else is an exact string match. Fr.reN)lowerendswith)hostpatternr r r is_same_domainms  rcs@trtSdkr"ddttfdd}|S)Nc_sdS)Nr )rkwr r r r1r2z%make_contextmanager..c?s||VdS)Nr )rr)r<r r wrappersz$make_contextmanager..wrapper)r5isgeneratorfunctionrr(wraps)r<rr )r<r make_contextmanagers rcCsd}|dkrd}t|r |}n@t|r<|j}t|d}n$yt||}Wntk r^dSXt|}|d}t|ds|r|sdS|dd}|sdSt|dkrdS|r|d}|dkrd}|d|krt|t|dkrdSdS) NF__call__r__func__reTr ) r5 isroutinervrrrBAttributeErrorgetfullargspecr])Zcalleeattrargnamerur<Zargspecargsdefaultsr r r takes_one_args<       rc@seZdZddZddZdS)SimpleSerializercCst|S)N)r)rZbstructr r r loadsszSimpleSerializer.loadscCst|S)N)r)rZ appstructr r r dumpsszSimpleSerializer.dumpsN)r r rrrr r r r rsrcCst|ot|dddk S)Nrl)r5rurB)obr r r is_bound_methodsrcCsRt|}|sNt|rNt|}t|jdko:|jddk}t|rN|rNdSdS)zO This consistently verifies that the callable is bound to a class. rrTF)rr5rrr]rrw)r<Zis_boundspecZhas_selfr r r is_unbound_methods rcCs:z*|dkr|}|j|k r$|||Wdd}d}XdS)N) __traceback__with_traceback)tpvaluetbr r r reraises  r)rr)rr)NN)N), contextlibrr(hmacrr5platformrXZ pyramid.pathrrrArCsystemZWINZ__pypy__ZPYPY BaseExceptionrrrr r!r%r&r-rNrOrhrzrqr~rrrr4rrrrrrrrr r r r sT         e?C:  +