/usr/share/pyshared/kombu/utils/__init__.py is in python-kombu 1.4.3-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 | """
kombu.utils
===========
Internal utilities.
:copyright: (c) 2009 - 2011 by Ask Solem.
:license: BSD, see LICENSE for more details.
"""
import sys
from time import sleep
from uuid import UUID, uuid4 as _uuid4, _uuid_generate_random
from kombu.utils.encoding import safe_repr as _safe_repr
try:
import ctypes
except:
ctypes = None # noqa
class HashingDict(dict):
def __getitem__(self, key):
h = hash(key)
if h not in self:
return self.__missing__(key)
return dict.__getitem__(self, h)
def __setitem__(self, key, value):
return dict.__setitem__(self, hash(key), value)
def __delitem__(self, key):
return dict.__delitem__(self, hash(key))
def say(m, *s):
sys.stderr.write(str(m) % s + "\n")
def uuid4():
# Workaround for http://bugs.python.org/issue4607
if ctypes and _uuid_generate_random:
buffer = ctypes.create_string_buffer(16)
_uuid_generate_random(buffer)
return UUID(bytes=buffer.raw)
return _uuid4()
def uuid():
"""Generate a unique id, having - hopefully - a very small chance of
collission.
For now this is provided by :func:`uuid.uuid4`.
"""
return str(uuid4())
gen_unique_id = uuid
if sys.version_info >= (3, 0):
def kwdict(kwargs):
return kwargs
else:
def kwdict(kwargs): # noqa
"""Make sure keyword arguments are not in unicode.
This should be fixed in newer Python versions,
see: http://bugs.python.org/issue4978.
"""
return dict((key.encode("utf-8"), value)
for key, value in kwargs.items())
def maybe_list(v):
if v is None:
return []
if hasattr(v, "__iter__"):
return v
return [v]
def fxrange(start=1.0, stop=None, step=1.0, repeatlast=False):
cur = start * 1.0
while 1:
if cur <= stop:
yield cur
cur += step
else:
if not repeatlast:
break
yield cur - step
def fxrangemax(start=1.0, stop=None, step=1.0, max=100.0):
sum_, cur = 0, start * 1.0
while 1:
if sum_ >= max:
break
yield cur
if stop:
cur = min(cur + step, stop)
else:
cur += step
sum_ += cur
def retry_over_time(fun, catch, args=[], kwargs={}, errback=None,
max_retries=None, interval_start=2, interval_step=2, interval_max=30):
"""Retry the function over and over until max retries is exceeded.
For each retry we sleep a for a while before we try again, this interval
is increased for every retry until the max seconds is reached.
:param fun: The function to try
:param catch: Exceptions to catch, can be either tuple or a single
exception class.
:keyword args: Positional arguments passed on to the function.
:keyword kwargs: Keyword arguments passed on to the function.
:keyword errback: Callback for when an exception in ``catch`` is raised.
The callback must take two arguments: ``exc`` and ``interval``, where
``exc`` is the exception instance, and ``interval`` is the time in
seconds to sleep next..
:keyword max_retries: Maximum number of retries before we give up.
If this is not set, we will retry forever.
:keyword interval_start: How long (in seconds) we start sleeping between
retries.
:keyword interval_step: By how much the interval is increased for each
retry.
:keyword interval_max: Maximum number of seconds to sleep between retries.
"""
retries = 0
interval_range = fxrange(interval_start,
interval_max + interval_start,
interval_step, repeatlast=True)
for retries, interval in enumerate(interval_range):
try:
return fun(*args, **kwargs)
except catch, exc:
if max_retries and retries > max_retries:
raise
if errback:
errback(exc, interval)
sleep(interval)
def emergency_dump_state(state, open_file=open, dump=None):
from pprint import pformat
from tempfile import mktemp
if dump is None:
import pickle
dump = pickle.dump
persist = mktemp()
say("EMERGENCY DUMP STATE TO FILE -> %s <-" % persist)
fh = open_file(persist, "w")
try:
try:
dump(state, fh, protocol=0)
except Exception, exc:
say("Cannot pickle state: %r. Fallback to pformat." % (exc, ))
fh.write(pformat(state))
finally:
fh.flush()
fh.close()
return persist
############## str.partition/str.rpartition #################################
def _compat_rl_partition(S, sep, direction=None, reverse=False):
items = direction(sep, 1)
if len(items) == 1:
if reverse:
return '', '', items[0]
return items[0], '', ''
return items[0], sep, items[1]
def _compat_partition(S, sep):
"""``partition(S, sep) -> (head, sep, tail)``
Search for the separator ``sep`` in ``S``, and return the part before
it, the separator itself, and the part after it. If the separator is not
found, return ``S`` and two empty strings.
"""
return _compat_rl_partition(S, sep, direction=S.split)
def _compat_rpartition(S, sep):
"""``rpartition(S, sep) -> (tail, sep, head)``
Search for the separator ``sep`` in ``S``, starting at the end of ``S``,
and return the part before it, the separator itself, and the part
after it. If the separator is not found, return two empty
strings and ``S``.
"""
return _compat_rl_partition(S, sep, direction=S.rsplit, reverse=True)
def partition(S, sep):
if hasattr(S, 'partition'):
return S.partition(sep)
else: # Python <= 2.4:
return _compat_partition(S, sep)
def rpartition(S, sep):
if hasattr(S, 'rpartition'):
return S.rpartition(sep)
else: # Python <= 2.4:
return _compat_rpartition(S, sep)
class cached_property(object):
"""Property descriptor that caches the return value
of the get function.
*Examples*
.. code-block:: python
@cached_property
def connection(self):
return Connection()
@connection.setter # Prepares stored value
def connection(self, value):
if value is None:
raise TypeError("Connection must be a connection")
return value
@connection.deleter
def connection(self, value):
# Additional action to do at del(self.attr)
if value is not None:
print("Connection %r deleted" % (value, ))
"""
def __init__(self, fget=None, fset=None, fdel=None, doc=None):
self.__get = fget
self.__set = fset
self.__del = fdel
self.__doc__ = doc or fget.__doc__
self.__name__ = fget.__name__
self.__module__ = fget.__module__
def __get__(self, obj, type=None):
if obj is None:
return self
try:
return obj.__dict__[self.__name__]
except KeyError:
value = obj.__dict__[self.__name__] = self.__get(obj)
return value
def __set__(self, obj, value):
if obj is None:
return self
if self.__set is not None:
value = self.__set(obj, value)
obj.__dict__[self.__name__] = value
def __delete__(self, obj):
if obj is None:
return self
try:
value = obj.__dict__.pop(self.__name__)
except KeyError:
pass
else:
if self.__del is not None:
self.__del(obj, value)
def setter(self, fset):
return self.__class__(self.__get, fset, self.__del)
def deleter(self, fdel):
return self.__class__(self.__get, self.__set, fdel)
def reprkwargs(kwargs, sep=', ', fmt="%s=%s"):
return sep.join(fmt % (k, _safe_repr(v)) for k, v in kwargs.iteritems())
def reprcall(name, args=(), kwargs=(), sep=', '):
return "%s(%s%s%s)" % (name, sep.join(map(_safe_repr, args)),
(args and kwargs) and sep or "",
reprkwargs(kwargs, sep))
|