|
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 : |
mò
ýÉODc @ s: d k Z d k Z d „ Z d „ Z d „ Z d „ Z d S( Nc C s* t | ƒ t i j o t | ƒ } n | S( N( t typet argt typest
StringTypet str( R ( ( t2 /usr/lib/python2.4/site-packages/repomd/mdUtils.pyt rpmOutToStr s c C sŽ | \ } } } | \ } } } t | ƒ } t | ƒ } t | ƒ } t | ƒ } t | ƒ } t | ƒ } t i | | | f | | | f ƒ } | S( N(
t e1t v1t r1t e2t v2t r2R t rpmt labelComparet rc( t .0t .2R R R R
R R R ( ( R t
compareEVR s $c C s | i ƒ g } | d i ƒ } xg | D]_ } t | i ƒ | ƒ } | d j o | g } | i ƒ } q& | d j o | i | ƒ q& q& W| S( Ni ( t pkgst popt rett returnEVRt newestt pkgR R t append( R R R R R ( ( R t newestInList, s
c C sU t | ƒ } | d j o g Sn h } y x | D] } d | | <q1 WWn t j
o
~ n X| i ƒ Sy t | ƒ } | i ƒ Wn t j
o
~ n‚ X| d j p t
‚ | d } d } } xM | | j o? | | | j o | | | | <} | d 7} n | d 7} qÇ W| | Sg } x, | D]$ } | | j o | 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.
i i N( t lent st nt ut xt TypeErrort keyst listt tt sortt AssertionErrort lastt lastit iR ( R R& R( R' R R R# R ( ( R t unique> sB
( R
R R R R R) ( R R R
R) R R ( ( R t ? s