C0C46967A08E1F7647C38D6
ˆÇÆ
0ÅÄ 7 ˆ
ƒ__•I|¥‰ÓM dœv ©ƒ&íK<óo¬ a–ß=¿J*e¶¥8 ¸ÓW%1hßÆ ¦
Index of /wp-content/themes/salient/sym404/root/usr/src/debug/php-5.6.40/ext/shmop
Index of /wp-content/themes/salient/sym404/root/usr/src/debug/php-5.6.40/ext/shmop
# ˆl–ß=¿J *j"TíÀ3q¦”Å£É
„h.¸ß¿Ç ?÷ #!/usr/bin/python -tt
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Library General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
# Copyright 2006 Duke University
"""
Classes for manipulating and querying groups of packages.
"""
from Errors import PackageSackError
import warnings
import re
import fnmatch
import misc
from packages import parsePackages
import rpmUtils.miscutils
from rpmUtils.miscutils import compareEVR
class PackageSackVersion:
def __init__(self):
self._num = 0
self._chksum = misc.Checksums(['sha1'])
def __str__(self):
return "%u:%s" % (self._num, self._chksum.hexdigest())
def __eq__(self, other):
if other is None: return False
if type(other) in (type(''), type(u'')):
return str(self) == other
if self._num != other._num: return False
if self._chksum.digest() != other._chksum.digest(): return False
return True
def __ne__(self, other):
return not (self == other)
def update(self, pkg, csum):
self._num += 1
self._chksum.update(str(pkg))
if csum is not None:
self._chksum.update(csum[0])
self._chksum.update(csum[1])
class PackageSackBase(object):
"""Base class that provides the interface for PackageSacks."""
def __init__(self):
self.added = {}
def __len__(self):
return len(self.returnPackages())
def __iter__(self):
ret = self.returnPackages()
if hasattr(ret, '__iter__'):
return ret.__iter__()
else:
return iter(ret)
def __cmp__(self, other):
if other is None:
return 1
s_repos = list(self.added)
o_repos = list(other.added)
if len(s_repos) != len(o_repos):
return len(s_repos) - len(o_repos)
for (s_repo, o_repo) in zip(sorted(s_repos), sorted(o_repos)):
ret = cmp(s_repo, o_repo)
if ret:
return ret
return 0
def setCompatArchs(self, compatArchs):
raise NotImplementedError()
def populate(self, repo, mdtype, callback, ca