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 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464
|
import pickle
from collections.abc import Mapping
from itertools import count
from time import monotonic
from unittest.mock import Mock
import pytest
from billiard.einfo import ExceptionInfo
import t.skip
from celery.utils.collections import (AttributeDict, BufferMap, ChainMap, ConfigurationView, DictAttribute,
LimitedSet, Messagebuffer)
from celery.utils.objects import Bunch
class test_DictAttribute:
def test_get_set_keys_values_items(self):
x = DictAttribute(Bunch())
x['foo'] = 'The quick brown fox'
assert x['foo'] == 'The quick brown fox'
assert x['foo'] == x.obj.foo
assert x.get('foo') == 'The quick brown fox'
assert x.get('bar') is None
with pytest.raises(KeyError):
x['bar']
x.foo = 'The quick yellow fox'
assert x['foo'] == 'The quick yellow fox'
assert ('foo', 'The quick yellow fox') in list(x.items())
assert 'foo' in list(x.keys())
assert 'The quick yellow fox' in list(x.values())
def test_setdefault(self):
x = DictAttribute(Bunch())
x.setdefault('foo', 'NEW')
assert x['foo'] == 'NEW'
x.setdefault('foo', 'XYZ')
assert x['foo'] == 'NEW'
def test_contains(self):
x = DictAttribute(Bunch())
x['foo'] = 1
assert 'foo' in x
assert 'bar' not in x
def test_items(self):
obj = Bunch(attr1=1)
x = DictAttribute(obj)
x['attr2'] = 2
assert x['attr1'] == 1
assert x['attr2'] == 2
class test_ConfigurationView:
def setup_method(self):
self.view = ConfigurationView(
{'changed_key': 1, 'both': 2},
[
{'default_key': 1, 'both': 1},
],
)
def test_setdefault(self):
self.view.setdefault('both', 36)
assert self.view['both'] == 2
self.view.setdefault('new', 36)
assert self.view['new'] == 36
def test_get(self):
assert self.view.get('both') == 2
sp = object()
assert self.view.get('nonexisting', sp) is sp
def test_update(self):
changes = dict(self.view.changes)
self.view.update(a=1, b=2, c=3)
assert self.view.changes == dict(changes, a=1, b=2, c=3)
def test_contains(self):
assert 'changed_key' in self.view
assert 'default_key' in self.view
assert 'new' not in self.view
def test_repr(self):
assert 'changed_key' in repr(self.view)
assert 'default_key' in repr(self.view)
def test_iter(self):
expected = {
'changed_key': 1,
'default_key': 1,
'both': 2,
}
assert dict(self.view.items()) == expected
assert sorted(list(iter(self.view))) == sorted(list(expected.keys()))
assert sorted(list(self.view.keys())) == sorted(list(expected.keys()))
assert (sorted(list(self.view.values())) ==
sorted(list(expected.values())))
assert 'changed_key' in list(self.view.keys())
assert 2 in list(self.view.values())
assert ('both', 2) in list(self.view.items())
def test_add_defaults_dict(self):
defaults = {'foo': 10}
self.view.add_defaults(defaults)
assert self.view.foo == 10
def test_add_defaults_object(self):
defaults = Bunch(foo=10)
self.view.add_defaults(defaults)
assert self.view.foo == 10
def test_clear(self):
self.view.clear()
assert self.view.both == 1
assert 'changed_key' not in self.view
def test_bool(self):
assert bool(self.view)
self.view.maps[:] = []
assert not bool(self.view)
def test_len(self):
assert len(self.view) == 3
self.view.KEY = 33
assert len(self.view) == 4
self.view.clear()
assert len(self.view) == 2
def test_isa_mapping(self):
from collections.abc import Mapping
assert issubclass(ConfigurationView, Mapping)
def test_isa_mutable_mapping(self):
from collections.abc import MutableMapping
assert issubclass(ConfigurationView, MutableMapping)
class test_ExceptionInfo:
def test_exception_info(self):
try:
raise LookupError('The quick brown fox jumps...')
except Exception:
einfo = ExceptionInfo()
assert str(einfo) == einfo.traceback
assert isinstance(einfo.exception.exc, LookupError)
assert einfo.exception.exc.args == ('The quick brown fox jumps...',)
assert einfo.traceback
assert repr(einfo)
@t.skip.if_win32
class test_LimitedSet:
def test_add(self):
s = LimitedSet(maxlen=2)
s.add('foo')
s.add('bar')
for n in 'foo', 'bar':
assert n in s
s.add('baz')
for n in 'bar', 'baz':
assert n in s
assert 'foo' not in s
s = LimitedSet(maxlen=10)
for i in range(150):
s.add(i)
assert len(s) <= 10
# make sure heap is not leaking:
assert len(s._heap) < len(s) * (
100. + s.max_heap_percent_overload) / 100
def test_purge(self):
# purge now enforces rules
# can't purge(1) now. but .purge(now=...) still works
s = LimitedSet(maxlen=10)
[s.add(i) for i in range(10)]
s.maxlen = 2
s.purge()
assert len(s) == 2
# expired
s = LimitedSet(maxlen=10, expires=1)
[s.add(i) for i in range(10)]
s.maxlen = 2
s.purge(now=monotonic() + 100)
assert len(s) == 0
# not expired
s = LimitedSet(maxlen=None, expires=1)
[s.add(i) for i in range(10)]
s.maxlen = 2
s.purge(now=lambda: monotonic() - 100)
assert len(s) == 2
# expired -> minsize
s = LimitedSet(maxlen=10, minlen=10, expires=1)
[s.add(i) for i in range(20)]
s.minlen = 3
s.purge(now=monotonic() + 3)
assert s.minlen == len(s)
assert len(s._heap) <= s.maxlen * (
100. + s.max_heap_percent_overload) / 100
def test_pickleable(self):
s = LimitedSet(maxlen=2)
s.add('foo')
s.add('bar')
assert pickle.loads(pickle.dumps(s)) == s
def test_iter(self):
s = LimitedSet(maxlen=3)
items = ['foo', 'bar', 'baz', 'xaz']
for item in items:
s.add(item)
l = list(iter(s))
for item in items[1:]:
assert item in l
assert 'foo' not in l
assert l == items[1:], 'order by insertion time'
def test_repr(self):
s = LimitedSet(maxlen=2)
items = 'foo', 'bar'
for item in items:
s.add(item)
assert 'LimitedSet(' in repr(s)
def test_discard(self):
s = LimitedSet(maxlen=2)
s.add('foo')
s.discard('foo')
assert 'foo' not in s
assert len(s._data) == 0
s.discard('foo')
def test_clear(self):
s = LimitedSet(maxlen=2)
s.add('foo')
s.add('bar')
assert len(s) == 2
s.clear()
assert not s
def test_update(self):
s1 = LimitedSet(maxlen=2)
s1.add('foo')
s1.add('bar')
s2 = LimitedSet(maxlen=2)
s2.update(s1)
assert sorted(list(s2)) == ['bar', 'foo']
s2.update(['bla'])
assert sorted(list(s2)) == ['bar', 'bla']
s2.update(['do', 're'])
assert sorted(list(s2)) == ['do', 're']
s1 = LimitedSet(maxlen=10, expires=None)
s2 = LimitedSet(maxlen=10, expires=None)
s3 = LimitedSet(maxlen=10, expires=None)
s4 = LimitedSet(maxlen=10, expires=None)
s5 = LimitedSet(maxlen=10, expires=None)
for i in range(12):
s1.add(i)
s2.add(i * i)
s3.update(s1)
s3.update(s2)
s4.update(s1.as_dict())
s4.update(s2.as_dict())
s5.update(s1._data) # revoke is using this
s5.update(s2._data)
assert s3 == s4
assert s3 == s5
s2.update(s4)
s4.update(s2)
assert s2 == s4
def test_iterable_and_ordering(self):
s = LimitedSet(maxlen=35, expires=None)
clock = count(1)
for i in reversed(range(15)):
s.add(i, now=next(clock))
j = 40
for i in s:
assert i < j # each item is smaller and smaller
j = i
assert i == 0 # last item is zero
def test_pop_and_ordering_again(self):
s = LimitedSet(maxlen=5)
for i in range(10):
s.add(i)
j = -1
for _ in range(5):
i = s.pop()
assert j < i
i = s.pop()
assert i is None
def test_as_dict(self):
s = LimitedSet(maxlen=2)
s.add('foo')
assert isinstance(s.as_dict(), Mapping)
def test_add_removes_duplicate_from_small_heap(self):
s = LimitedSet(maxlen=2)
s.add('foo')
s.add('foo')
s.add('foo')
assert len(s) == 1
assert len(s._data) == 1
assert len(s._heap) == 1
def test_add_removes_duplicate_from_big_heap(self):
s = LimitedSet(maxlen=1000)
[s.add(i) for i in range(2000)]
assert len(s) == 1000
[s.add('foo') for i in range(1000)]
# heap is refreshed when 15% larger than _data
assert len(s._heap) < 1150
[s.add('foo') for i in range(1000)]
assert len(s._heap) < 1150
class test_AttributeDict:
def test_getattr__setattr(self):
x = AttributeDict({'foo': 'bar'})
assert x['foo'] == 'bar'
with pytest.raises(AttributeError):
x.bar
x.bar = 'foo'
assert x['bar'] == 'foo'
class test_Messagebuffer:
def assert_size_and_first(self, buf, size, expected_first_item):
assert len(buf) == size
assert buf.take() == expected_first_item
def test_append_limited(self):
b = Messagebuffer(10)
for i in range(20):
b.put(i)
self.assert_size_and_first(b, 10, 10)
def test_append_unlimited(self):
b = Messagebuffer(None)
for i in range(20):
b.put(i)
self.assert_size_and_first(b, 20, 0)
def test_extend_limited(self):
b = Messagebuffer(10)
b.extend(list(range(20)))
self.assert_size_and_first(b, 10, 10)
def test_extend_unlimited(self):
b = Messagebuffer(None)
b.extend(list(range(20)))
self.assert_size_and_first(b, 20, 0)
def test_extend_eviction_time_limited(self):
b = Messagebuffer(3000)
b.extend(range(10000))
assert len(b) > 3000
b.evict()
assert len(b) == 3000
def test_pop_empty_with_default(self):
b = Messagebuffer(10)
sentinel = object()
assert b.take(sentinel) is sentinel
def test_pop_empty_no_default(self):
b = Messagebuffer(10)
with pytest.raises(b.Empty):
b.take()
def test_repr(self):
assert repr(Messagebuffer(10, [1, 2, 3]))
def test_iter(self):
b = Messagebuffer(10, list(range(10)))
assert len(b) == 10
for i, item in enumerate(b):
assert item == i
assert len(b) == 0
def test_contains(self):
b = Messagebuffer(10, list(range(10)))
assert 5 in b
def test_reversed(self):
assert (list(reversed(Messagebuffer(10, list(range(10))))) ==
list(reversed(range(10))))
def test_getitem(self):
b = Messagebuffer(10, list(range(10)))
for i in range(10):
assert b[i] == i
class test_BufferMap:
def test_append_limited(self):
b = BufferMap(10)
for i in range(20):
b.put(i, i)
self.assert_size_and_first(b, 10, 10)
def assert_size_and_first(self, buf, size, expected_first_item):
assert buf.total == size
assert buf._LRUpop() == expected_first_item
def test_append_unlimited(self):
b = BufferMap(None)
for i in range(20):
b.put(i, i)
self.assert_size_and_first(b, 20, 0)
def test_extend_limited(self):
b = BufferMap(10)
b.extend(1, list(range(20)))
self.assert_size_and_first(b, 10, 10)
def test_extend_unlimited(self):
b = BufferMap(None)
b.extend(1, list(range(20)))
self.assert_size_and_first(b, 20, 0)
def test_pop_empty_with_default(self):
b = BufferMap(10)
sentinel = object()
assert b.take(1, sentinel) is sentinel
def test_pop_empty_no_default(self):
b = BufferMap(10)
with pytest.raises(b.Empty):
b.take(1)
def test_repr(self):
assert repr(Messagebuffer(10, [1, 2, 3]))
class test_ChainMap:
def test_observers_not_shared(self):
a = ChainMap()
b = ChainMap()
callback = Mock()
a.bind_to(callback)
b.update(x=1)
callback.assert_not_called()
a.update(x=1)
callback.assert_called_once_with(x=1)
|