³ò 3ÒÇIc@sCdefd„ƒYZdefd„ƒYZddd„ƒYZdS(t SortedDictcBsVeZdZd„Zd„Zd„Zd„Zd„Zd„Zd„Z d„Z RS( s· A very rudamentary sorted dictionary, whose main purpose is to allow dictionaries to be displayed in a consistent order in regression tests. keys(), items(), values(), iter*(), and __repr__ all sort their return values before returning them. (note that the sort order for values() does *not* correspond to the sort order for keys(). I.e., zip(d.keys(), d.values()) is not necessarily equal to d.items(). cCstti|ƒƒS(N(tsortedtdicttkeys(tself((s%/p/zhu/06/nlp/nltk/nltk/containers.pyRscCstti|ƒƒS(N(RRtitems(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyRscCstti|ƒƒS(N(RRtvalues(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyRscCsttti|ƒƒƒS(N(titerRRR(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pytiterkeysscCsttti|ƒƒƒS(N(RRRR(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyt iteritemsscCsttti|ƒƒƒS(N(RRRR(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyt itervaluesscCsttti|ƒƒƒS(N(RRRR(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyt__iter__scCsBg}t|iƒƒD]}|d|q~}ddi|ƒS(Ns%s=%ss{%s}s, (RRtjoin(Rt_[1]ttR((s%/p/zhu/06/nlp/nltk/nltk/containers.pytreprs1( t__name__t __module__t__doc__RRRRR R R R(((s%/p/zhu/06/nlp/nltk/nltk/containers.pyRs        t OrderedDictcBs€eZdZhd„Zd„Zd„Zd„Zd„Zd„Zd„Z e d„Z d „Z d „Z d „Zd „ZRS( sg This implementation of a dictionary keeps track of the order in which keys were inserted. cCs#|iƒ|_ti||ƒdS(N(Rt_keysRt__init__(Rtd((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR&scCs$ti||ƒ|ii|ƒdS(N(Rt __delitem__Rtremove(Rtkey((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR*scCs[ti|||ƒt|dƒp|g|_n||ijo|ii|ƒndS(NR(Rt __setitem__thasattrRtappend(RRtitem((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR.s cCsti|ƒg|_dS(N(RtclearR(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR7s ccs'x |iD]}|||fVq WdS(N(R(Rti((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR;s cCs|iS(N(R(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR?scCsRt|iƒdjotdƒ‚n)|id}||}||=||fSdS(Nisdictionary is emptyiÿÿÿÿ(tlenRtKeyError(RRtval((s%/p/zhu/06/nlp/nltk/nltk/containers.pytpopitemBs   cCs;ti|||ƒ||ijo|ii|ƒndS(N(Rt setdefaultRR(RRtfailobj((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR$KscCsLx5|iƒD]'}||jo|ii|ƒq q Wti||ƒdS(N(RRRRtupdate(RRR((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR&Ps   ccs!x|iD]}||Vq WdS(N(R(RR((s%/p/zhu/06/nlp/nltk/nltk/containers.pyRVs cCsty|ii|ƒ}Wntj ot|ƒ‚nX|ii||ƒ||jo|d}n|i|=dS(s< Move the specified to key to *before* the specified index. iN(Rtindext ValueErrorR!tinsert(RRR'tcur((s%/p/zhu/06/nlp/nltk/nltk/containers.pytmoveZscCs-||jot|ƒ‚n|ii|ƒS(N(R!RR'(RR((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR'gs (RRRRRRRRRR#tNoneR$R&RR+R'(((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR s         tTriecBs†eZdZed„Zd„Zd„Zd„Zd„Zd„Z d„Z d„Z d „Z d „Z d „Zd „Zd „ZRS(sÌA Trie is like a dictionary in that it maps keys to values. However, because of the way keys are stored, it allows look up based on the longest prefix that matches. Keys must be strings. cCs0|djodhdg|_n ||_dS(Ni(R,t_root(Rttrie((s%/p/zhu/06/nlp/nltk/nltk/containers.pyR{s cCsdhdg|_dS(Ni(R,R.(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyRscCsQ|i}x7|D]/}|d}||jo||}qtSqW|dtj S(sWReturn True if the key is present and it's a leaf of the Trie, False otherwise.ii(R.tFalseR,(RRt curr_nodetchart curr_node_1((s%/p/zhu/06/nlp/nltk/nltk/containers.pytisleaf„s   cCsi|i}|}xI|D]A}||djo|d|}n|d|fS|d}qW|d|fS(s­Find as much of the key as one can, by using the longest prefix that has a value. Return (value, remainder) where remainder is the rest of the given string.ii(R.(RRR1t remainderR2((s%/p/zhu/06/nlp/nltk/nltk/containers.pyt find_prefix‘s cCs5|i}x|D]}|d|}qWtd|ƒS(NiR/(R.R-(RRR1R2((s%/p/zhu/06/nlp/nltk/nltk/containers.pytsubtrie s  cCs |idS(Ni(R.(R((s%/p/zhu/06/nlp/nltk/nltk/containers.pyt__len__¦scCs|i|ijS(N(R.(Rtother((s%/p/zhu/06/nlp/nltk/nltk/containers.pyt__eq__©scCs ||j S(N((RR9((s%/p/zhu/06/nlp/nltk/nltk/containers.pyt__ne__¬scCsg|i}x=|D]5}|dcd7<|di|dhdgƒ}qW||d<|dcd7sT