fd@dZddlmZddlmZddlmZddlmZddlmZddlm Z ddlm Z dd lm Z dd lm Z e Zee Gd d e Zee Gd de ZdZee Gdde ZGddeZee Gdde ZdadZdZdZ ddlmZee[y#e$rYywxYw)zVocabulary support for schema. ) OrderedDict)directlyProvides) implementer) providedBy)ITitledTokenizedTerm)ITokenizedTerm)ITreeVocabulary)IVocabularyRegistry)IVocabularyTokenizedc*eZdZdZddZdZdZdZy) SimpleTermz Simple tokenized term used by SimpleVocabulary. .. versionchanged:: 4.6.0 Implement equality and hashing based on the value, token and title. Nc||_||}t|tr|jd}nt|ts t |}|j ddjd}||_||_|t|tyy)a Create a term for *value* and *token*. If *token* is omitted, str(value) is used for the token, escaping any non-ASCII characters. If *title* is provided, term implements :class:`zope.schema.interfaces.ITitledTokenizedTerm`. Nraw_unicode_escapeasciibackslashreplace) value isinstancebytesdecodestrencodetokentitlerr)selfrrrs n/var/dept/share/cheung/public_html/OutSchool/python/env/lib/python3.12/site-packages/zope/schema/vocabulary.py__init__zSimpleTerm.__init__*s =E eU #LL!56EE3'JE W&89@@I    T#7 8 c||uryt|tsy|j|jk(xr4|j|jk(xr|j|jk(SNTF)rr rrrrothers r__eq__zSimpleTerm.__eq__FsZ D=%, JJ%++ % * ekk) * ekk) rc&|j| SNr"r s r__ne__zSimpleTerm.__ne__S;;u%%%rcZt|j|j|jfSr$)hashrrrrs r__hash__zSimpleTerm.__hash__Vs TZZTZZ899r)NN)__name__ __module__ __qualname____doc__rr"r&r+rrr r !s98  &:rr cveZdZdZdZedZedZedZdZ dZ dZ d Z d Z d Zd Zd Zy)SimpleVocabularyz Vocabulary that works from a sequence of terms. .. versionchanged:: 4.6.0 Implement equality and hashing based on the terms list and interfaces implemented by this object. ci|_i|_||_|jdd}|jD]}|sr|j|jvr!t dt |jz|j|jvr!t dt |jz||j|j<||j|j<|r t|g|yy)a0Initialize the vocabulary given a list of terms. The vocabulary keeps a reference to the list of terms passed in; it should never be modified while the vocabulary is used. One or more interfaces may also be provided so that alternate widgets may be bound without subclassing. By default, ValueErrors are thrown if duplicate values or tokens are passed in. If you want to swallow these exceptions, pass in ``swallow_duplicates=True``. In this case, the values will override themselves. swallow_duplicatesFzterm values must be unique: %szterm tokens must be unique: %sN) by_valueby_token_termsgetr ValueErrorreprrr)rterms interfaceskwargs swallow_dupesterms rrzSimpleVocabulary.__init__ds    #7? KK -D ::.$84 ;KKMM::.$84 ;KKMM(,DMM$** %(,DMM$** % -  T /J / rc r|Dcgc]}|j|d|dg|dd!}}||g|Scc}w)aB Construct a vocabulary from a list of (token, value) pairs or (token, value, title) triples. The list does not have to be homogeneous. The order of the items is preserved as the order of the terms in the vocabulary. Terms are created by calling the class method :meth:`createTerm`` with the pair or triple. One or more interfaces may also be provided so that alternate widgets may be bound without subclassing. .. versionchanged:: 4.6.0 Allow passing in triples to set item titles. rN createTerm)clsitemsr<itemr;s r fromItemszSimpleVocabulary.fromItemssV$#$ Qa<48<$$5&:&&$s$4cZ|Dcgc]}|j|}}||g|Scc}w)aConstruct a vocabulary from a simple list. Values of the list become both the tokens and values of the terms in the vocabulary. The order of the values is preserved as the order of the terms in the vocabulary. Tokens are created by calling the class method :meth:`createTerm()` with the value as the only parameter. One or more interfaces may also be provided so that alternate widgets may be bound without subclassing. rC)rEvaluesr<rr;s r fromValueszSimpleVocabulary.fromValuess55;;5&;;5&:&& ||jvS#t$rYywxYw)*See zope.schema.interfaces.IBaseVocabularyF)r5 TypeErrorrrs r __contains__zSimpleVocabulary.__contains__s( DMM) )    cR |j|S#t$r t|wxYwrO)r5KeyError LookupErrorrQs rgetTermzSimpleVocabulary.getTerm0 %==' ' %e$ $ %&cR |j|S#t$r t|wxYwz/See zope.schema.interfaces.IVocabularyTokenized)r6rVrWrrs rgetTermByTokenzSimpleVocabulary.getTermByTokenrYrZc,t|jSz.See zope.schema.interfaces.IIterableVocabulary)iterr7r*s r__iter__zSimpleVocabulary.__iter__sDKK  rc,t|jSr`)lenr5r*s r__len__zSimpleVocabulary.__len__s4==!!rc||uryt|tsy|j|jk(xrt|t|k(Sr)rr2r7rr s rr"zSimpleVocabulary.__eq__sH D=%!12 KK5<< ' 64 Ju$55 rc&|j| Sr$r%r s rr&zSimpleVocabulary.__ne__r'rc>tt|jSr$)r)tupler7r*s rr+zSimpleVocabulary.__hash__sE$++&''rN)r,r-r.r/r classmethodrHrKrDrRrXr^rbrer"r&r+r0rrr2r2Zsp0>''( ' '!!%%!"  &(rr2ct|jD]A}t|d|dg|dd}tj ||<t ||||C|S)z Helper method that creates a tree-like dict with ITokenizedTerm objects as keys from a similar tree with tuples as keys. See fromDict for more details. rArrBN)sortedkeysr TreeVocabulary terms_factory_createTermTree)ttreedict_keyr?s rrprpsh ejjl#1#a&#a&33qr73$224d d U3Z01 LrczeZdZdZeZdZdZdZdZ dZ ddZ d Z d Z d Zed Zd ZdZdZdZdZy)rnz> Vocabulary that relies on a tree (i.e nested) structure. c|j|_|jj|i|_i|_i|_|j ||r t|g|yy)aInitialize the vocabulary given a recursive dict (i.e a tree) with ITokenizedTerm objects for keys and self-similar dicts representing the branches for values. Refer to the method fromDict for more details. Concerning the ITokenizedTerm keys, the 'value' and 'token' attributes of each key (including nested ones) must be unique. One or more interfaces may also be provided so that alternate widgets may be bound without subclassing. N)ror7update path_by_value term_by_value term_by_token_populateIndexesr)rr;r<s rrzTreeVocabulary.__init__sa((*  5! e$  T /J / rc> ||jvS#t$rYywxYw)zt See zope.schema.interfaces.IBaseVocabulary D.__contains__(k) -> True if D has a key k, else False F)rxrPrQs rrRzTreeVocabulary.__contains__s*  D... .  rSc8|jj|S)z#x.__getitem__(y) <==> x[y] )r7 __getitem__)rrss rr}zTreeVocabulary.__getitem__s{{&&s++rc6|jjS)zZSee zope.schema.interfaces.IIterableVocabulary x.__iter__() <==> iter(x) )r7rbr*s rrbzTreeVocabulary.__iter__ s {{##%%rc6|jjS)z x.__len__() <==> len(x) )r7rer*s rrezTreeVocabulary.__len__'s{{""$$rNc:|jj||S)zaGet a value for a key The default is returned if there is no value for the key. )r7r8)rrsdefaults rr8zTreeVocabulary.get,s {{sG,,rc6|jjS)z/Return the keys of the mapping object. )r7rmr*s rrmzTreeVocabulary.keys3s{{!!rc6|jjS)z1Return the values of the mapping object. )r7rJr*s rrJzTreeVocabulary.values8s{{!!##rc6|jjS)z0Return the items of the mapping object. )r7rFr*s rrFzTreeVocabulary.items=s{{  ""rcD|t|j|g|S)aConstructs a vocabulary from a dictionary-like object (like dict or OrderedDict), that has tuples for keys. The tuples should have either 2 or 3 values, i.e: (token, value, title) or (token, value). Only tuples that have three values will create a :class:`zope.schema.interfaces.ITitledTokenizedTerm`. For example, a dict with 2-valued tuples:: dict_ = { ('exampleregions', 'Regions used in ATVocabExample'): { ('aut', 'Austria'): { ('tyr', 'Tyrol'): { ('auss', 'Ausserfern'): {}, } }, ('ger', 'Germany'): { ('bav', 'Bavaria'):{} }, } } One or more interfaces may also be provided so that alternate widgets may be bound without subclassing. .. versionchanged:: 4.6.0 Only create ``ITitledTokenizedTerm`` when a title is actually provided. )rpro)rErrr<s rfromDictzTreeVocabulary.fromDictBs%@?3#4#4#6>LLLrc|jD]}t|d}t|d}||jvrtd|z||jvrtd|z||j|<||j|<||j vr|j |||j |<|j||y)a The TreeVocabulary contains three helper indexes for quick lookups. They are: term_by_value, term_by_token and path_by_value This method recurses through the tree and populates these indexes. tree: The tree (a nested/recursive dictionary). rrz Term values must be unique: '%s'z Term tokens must be unique: '%s'N)rmgetattrrxr9ryrw_getPathToTreeNoderz)rtreer?rrs rrzzTreeVocabulary._populateIndexesdsIIK .DD'*ED'*E*** 6>@@*** 6>@@)-D  u %(,D  u %D...,0,C,CDDI-K""5)  ! !$t* -% .rcR |j|S#t$r t|wxYwrU)rxrVrWrQs rrXzTreeVocabulary.getTerm2 %%%e, , %e$ $ %rZcR |j|S#t$r t|wxYwr\)ryrVrWr]s rr^zTreeVocabulary.getTermByTokenrrZcg}|jD]L\}}||jk(r|gcS|j||}|s/|jd|j|S|S)zHelper method that computes the path in the tree from the root to the given node. The tree must be a recursive IEnumerableMapping object. r)rFrrinsert)rrnodepathparentchilds rrz!TreeVocabulary._getPathToTreeNodesk !ZZ\ MFEv||#v **5$7D Av||,   rc:|jj|gS)zReturns a list of strings representing the path from the root node to the node with the given value in the tree. Returns an empty string if no node has that value. )rwr8rQs r getTermPathzTreeVocabulary.getTermPaths !!%%eR00rr$)r,r-r.r/rrorrRr}rbrer8rmrJrFrjrrzrXr^rrr0rrrnrnsk  M00 , &% -" $ # MMB.8%% 1rrnc(eZdZdZfdZdZxZS)VocabularyRegistryErrorz A specialized subclass of `LookupError` raised for unknown (unregistered) vocabularies. .. seealso:: `VocabularyRegistry` cL||_tt|t |yr$)namesuperrrr)rr __class__s rrz VocabularyRegistryError.__init__s  %t5c$i@rc d|jzS)Nzunknown vocabulary: %r)rr*s r__str__zVocabularyRegistryError.__str__s'$))33r)r,r-r.r/rr __classcell__)rs@rrrs A4rrc&eZdZdZdZdZdZdZy)VocabularyRegistryaR Default implementation of :class:`zope.schema.interfaces.IVocabularyRegistry`. An instance of this class is used by default by :func:`getVocabularyRegistry`, which in turn is used by :class:`~.Choice` fields. Named vocabularies must be manually registered with this object using :meth:`register`. This associates a vocabulary name with a :class:`zope.schema.interfaces.IVocabularyFactory`. An alternative to this is to use the :mod:`zope.component` registry via `zope.vocabularyregistry `_. _mapci|_yr$rr*s rrzVocabularyRegistry.__init__s  rcb |j|}||S#t$r t|wxYw)z.See zope.schema.interfaces.IVocabularyRegistry)rrVr)rcontextrvtypes rr8zVocabularyRegistry.gets< 0IIdOEW~ 0)$/ / 0s.c"||j|<y)z>Register a *factory* for the vocabulary with the given *name*.Nr)rrfactorys rregisterzVocabularyRegistry.registers! $rN)r,r-r.r/ __slots__rr8rr0rrrrs I"rrNc@ttttS)zReturn the vocabulary registry. If the registry has not been created yet, an instance of VocabularyRegistry will be installed and used. ) _vocabulariessetVocabularyRegistryrr0rrgetVocabularyRegistryrs 023 rc|ay)zSet the vocabulary registry.Nr)registrys rrrs Mrcday)z)Remove the registries (for use by tests).Nrr0rr_clearrs Mr) addCleanUp)r/ collectionsrzope.interfacerrrzope.schema.interfacesrrr r r object_markerr r2rprnrWrrrrrrzope.testing.cleanupr ImportErrorr0rrrs #+&%71267 ( ^5:5:5:p !"D(vD(#D(N  _t1Vt1t1p 4k 4 ! " "" "F   / v   s2CC  C