|
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/proc/self/root/usr/lib/python2.4/site-packages/yum/ |
Upload File : |
m
ODc @ s d k Z d k Z d k Z d k Z d k l Z d k Z d k Z d k Z d k Z d k
Z
d k Z d k Z d k
Z
d k Td k Z d k l Z d Z d d d Z d Z d f d
YZ d Z d Z d
Z d Z d d Z d Z d S( N( s StringIO( t *( s MiscErrorc C sA 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
~ nn X| d } d } } xM | | j o? | | | j o | | | | <} | d 7} n | d 7} q W| | Sg } x, | D]$ } | | j o | i
| qqW| 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 lastt lastit it append( R R R
R R R R R ( ( t, /usr/lib/python2.4/site-packages/yum/misc.pyt unique sB
i i c C s# y t | t i j o
| } n t | d | } | d j o d k } | i } n4 | d j o d k } | i } n t d | | i
} x( | o | i
| } | i | q Wt | t i j o | i ~ n | i SWn( t t f j
o } t d | n Xd S( s takes filename, hand back Checksum of it
sumtype = md5 or sha
filename = /path/to/file
CHUNK=65536 by defaultt rt md5Nt shas- Error Checksumming file, bad checksum type %ss# Error opening file for checksum: %s( t typet filet typest
StringTypet fot opent CHUNKt sumtypeR t newt sumR t MiscErrort readt chunkt updatet closet hexdigestt IOErrort OSErrort e( R R R R& R R R R R ( ( R t checksum\ s.
c C s t | } y t i | } Wn( t j
o } t d | | f n Xx | D] } t i i | d | o t | d | | | } qQ t i | | d | j o+ t i i | d | } | i | qQ qQ W| S( sf Return all files in path matching ext, store them in filelist,
recurse dirs return list objects Error accessing directory %s, %st /s %sN( R t extt extlent ost listdirt patht dir_listR% R& R t dt isdirt getFileListt filelistt stringt lowert normpatht newpathR ( R- R) R2 R* R6 R& R/ R. ( ( R R1 ~ s t
GenericHolderc B s t Z d Z d Z RS( s Generic Holder class used to hold other objects of known types
It exists purely to be able to do object.somestuff, object.someotherstuff
or object[key] and pass object to another function that will
understand itc C s. t | | o t | | Sn
t | d S( N( t hasattrt selft itemt getattrt KeyError( R9 R: ( ( R t __getitem__ s ( t __name__t
__module__t __doc__R= ( ( ( R R7 s c C s t i d i d | } t } d } d } x | i d D] } | i
d o
d } q@ | o | i d j o
d } q@ | o | i
d o Pq@ | o | i
d o Pq@ | o | i | d q@ q@ Wt
i | i S(
s- Convert ASCII armoured GPG key to binary
s (
|
|
)s
i s$ -----BEGIN PGP PUBLIC KEY BLOCK-----i t s" -----END PGP PUBLIC KEY BLOCK-----t =N( t ret compilet subt rawkeyt StringIOt blockt inblockt pastheaderst splitt linet
startswitht stript writet base64t decodestringt getvalue( RF RJ RI RL RH ( ( R t
procgpgkey s$
c C s< y t i | } Wn' t j
o } t t | n X| d j o t d n | i i
} h d | i <d t
i d | d <d | i i <} x | i d D] } t | t i p q n | i
| j oP t | d o< | i t i } | d j o t | d | d <Pq0q4q q W| S(
s Return a dict of info for the given ASCII armoured key text
Returned dict will have the following keys: 'userid', 'keyid', 'timestamp'
Will raise ValueError if there was a problem decoding the key.
s No key found in given key datat useridt keyids >Qi t timestampt hashed_subpaksi N( t pgpmsgt
decode_msgRF t keyt ExceptionR& t
ValueErrort strt Nonet
public_keyt key_idt
keyid_blobt user_idt structt unpackRV t infot user_idsRT t
isinstancet signatureR8 t get_hashed_subpakt SIG_SUB_TYPE_CREATE_TIMEt tspktt int( RF Re R& RT RZ Rk Ra ( ( R t
getgpgkeyinfo s(
:
c C s d | d @S( s[ Convert an integer representing a GPG key ID to the hex version string
used by RPM
s %08xl N( RU ( RU ( ( R t
keyIdToRPMVer s c C s t | } xp | i d d D]\ } | d | j oE t | d d } | | j o d Sq{ | | j o d Sq{ d Sq q Wd S( sW Return if the GPG key described by the given keyid and timestamp are
installed in the rpmdb.
The keyid and timestamp should both be passed as integers.
The ts is an rpm transaction set object
Return values:
-1 key is not installed
0 key with matching ID and timestamp is installed
1 key with matching ID is installed but has a older timestamp
2 key with matching ID is installed but has a newer timestamp
No effort is made to handle duplicates. The first matching keyid is used to
calculate the return result.
t names
gpg-pubkeyt versiont releasei i i i iN( Rn RU t tst dbMatcht hdrRl t installedtsRV ( Rr RU RV Rt Ru ( ( R t keyInstalled s
s /var/tmpc
C s t i } y t i | } | d } Wn t j
o d Sn Xd | } d | | f } t i | } x^ | D]V } t i | } t | d o0 t | d d j o | d | j o | Sqs qs Wt i d | d | } | S( sq return a path to a valid and safe cachedir - only used when not running
as root or when --tempcache is seti s yum-%s-s %s/%s*i i t prefixt dirN( R+ t geteuidt uidt pwdt getpwuidt usertupt usernameR< R^ Rw t tmpdirt dirpatht globt cachedirst thisdirt lstatt statst S_ISDIRt S_IMODEt tempfilet mkdtempt cachedir(
R R~ R R Rz Rw R R R} R ( ( R t getCacheDir
s"
9 c C s> | i | i j o d Sn | i | i j o d Sn d Sd S( s+ sorts a list of yum package objects by namei i iN( t pkg1Ro t pkg2( R R ( ( R t
sortPkgObj# s ( R R3 R+ t os.patht cStringIORG RP Rc RC RX R R t rpmR{ t statt rpmUtilst ErrorsR R R' R1 R7 RS Rm Rn Rv R R ( Rv R1 RS R Rc R RP RC R R R3 R R{ Rn R R RG R' RX R7 R Rm R R+ ( ( R t ? s2
D" (