-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathtests.py
629 lines (452 loc) · 19.3 KB
/
tests.py
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
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
from unittest import TestCase
from mock import Mock
from time import sleep
from rediset import Rediset
from rediset.sets import SetNode, IntersectionNode
from rediset.sortedsets import SortedIntersectionNode, SortedUnionNode
class KeyGenerationTestCase(TestCase):
def test_key_generation(self):
rs = Rediset(key_prefix='some-prefix')
key = rs.create_key('foo')
self.assertEqual(key, 'some-prefix:foo')
def test_key_hashing(self):
# hashing disabled
rs = Rediset(hash_generated_keys=False)
key = rs.create_key('foo')
self.assertEqual(key, 'foo')
key = rs.create_key('foo', generated=True)
self.assertEqual(key, 'rediset:foo')
# hashing enabled
rs = Rediset(hash_generated_keys=True)
key = rs.create_key('foo')
self.assertEqual(key, 'foo')
key = rs.create_key('foo', generated=True)
self.assertEqual(key, 'rediset:acbd18db4cc2f85cedef654fccc4a4d8')
class RedisTestCase(TestCase):
PREFIX = 'rediset-tests'
def setUp(self):
self.rediset = Rediset(key_prefix=self.PREFIX)
self.rediset.redis = Mock(wraps=self.rediset.redis)
def tearDown(self):
redis = self.rediset.redis
keys = redis.keys('%s*' % self.PREFIX)
if keys:
redis.delete(*keys)
class HashingTestCase(RedisTestCase):
def setUp(self):
super(HashingTestCase, self).setUp()
self.rediset.hash_generated_keys = True
def test_sets_are_not_hashed(self):
s = self.rediset.Set('key')
self.assertEqual(s.key, 'key')
self.assertEqual(s.prefixed_key, 'rediset-tests:key')
def test_operations_are_hashed(self):
i = self.rediset.Intersection('key1', 'key2')
self.assertEqual(i.key, 'intersection(key1,key2)')
self.assertEqual(i.prefixed_key, 'rediset-tests:rediset:e98e8da811c3c5597e0d48f47010bf91')
self.assertEqual(i.prefixed_cache_key, 'rediset-tests:rediset:cached:e98e8da811c3c5597e0d48f47010bf91')
class SetTestCase(RedisTestCase):
def test_basic_set(self):
s = self.rediset.Set('key')
s.add('a')
s.add('b')
s.add('c')
self.assertEqual(len(s), 3)
self.assertEqual(s.members(), set(['a', 'b', 'c']))
self.assertTrue(s.contains('a'))
self.assertFalse(s.contains('d'))
s.remove('a')
self.assertFalse(s.contains('a'))
s.remove('b', 'c')
self.assertEqual(len(s), 0)
class SortedSetTestCase(RedisTestCase):
def test_basic_sorted_set(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1))
s.add(('b', 2), ('c', 3))
self.assertEqual(len(s), 3)
self.assertEqual(s.members(), ['a', 'b', 'c'])
self.assertEqual(set(s), set(['a', 'b', 'c']))
self.assertTrue('a' in s)
self.assertFalse('d' in s)
s.remove('a')
self.assertFalse(s.contains('a'))
s.remove('b', 'c')
self.assertEqual(len(s), 0)
def test_get_members(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3))
self.assertEqual(s.members(), ['a', 'b', 'c'])
self.assertEqual(s.members(withscores=True), [('a', 1), ('b', 2), ('c', 3)])
def test_get_item(self):
s = self.rediset.SortedSet('key')
s.add(('abc', 1), ('b', 2), ('c', 3))
self.assertEqual(s.get(0), 'abc')
self.assertEqual(s.get(2), 'c')
self.assertTrue(s.get(3) is None)
self.assertEqual(s.get(0, withscores=True), ('abc', 1.0))
self.assertEqual(s[0], 'abc')
self.assertEqual(s[2], 'c')
def should_raise_index_error():
s[3]
self.assertRaises(IndexError, should_raise_index_error)
def test_get_range(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3))
self.assertEqual(s.range(0, 1), ['a', 'b'])
self.assertEqual(s.range(1, 2), ['b', 'c'])
self.assertEqual(s.range(2, 10), ['c'])
self.assertEqual(s.range(0, 2, withscores=True), [('a', 1), ('b', 2), ('c', 3)])
self.assertEqual(s[0:1], ['a'])
self.assertEqual(s[1:], ['b', 'c'])
self.assertEqual(s[:1], ['a'])
self.assertEqual(s[0:10], ['a', 'b', 'c'])
def test_big_slice(self):
s = self.rediset.SortedSet('key')
for counter in range(100):
s.add((str(counter), counter))
middle = s[25:74]
self.assertEqual(len(middle), 49)
for item in middle:
pass
self.assertEqual(self.rediset.redis.zrange.call_count, 1)
def test_slicing_regression(self):
s = self.rediset.SortedSet('key')
[s.add(('item%s' % i, i)) for i in range(10)]
self.assertEqual(len(s[0:5]), 5)
self.assertEqual(len(s[0:0]), 0)
self.assertEqual(len(s[100:0]), 0)
self.assertEqual(len(s[5:3]), 0)
self.assertEqual(len(s[:]), 10)
self.assertEqual(len(s[0:-1]), 9)
self.assertEqual(len(s[:5]), 5)
self.assertEqual(len(s.descending[0:5]), 5)
self.assertEqual(len(s.descending[0:0]), 0)
self.assertEqual(len(s.descending[100:0]), 0)
self.assertEqual(len(s.descending[5:3]), 0)
self.assertEqual(len(s.descending[:]), 10)
self.assertEqual(len(s.descending[0:-1]), 9)
self.assertEqual(len(s.descending[:5]), 5)
def test_withscores_property(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3))
self.assertEqual(s[0:-1], ['a', 'b'])
self.assertEqual(s.withscores[0:-1], [('a', 1), ('b', 2)])
self.assertEqual(s.withscores[0], ('a', 1))
def test_descending_property(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3))
self.assertEqual(s[0:-1], ['a', 'b'])
self.assertEqual(s.descending[0:-1], ['c', 'b'])
self.assertEqual(s.descending[0], 'c')
def test_descending_withscores(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3))
self.assertEqual(s[0:-1], ['a', 'b'])
self.assertEqual(s.descending.withscores[0:-1], [('c', 3), ('b', 2)])
self.assertEqual(s.descending.withscores[0], ('c', 3))
self.assertEqual(s.withscores.descending[0:-1], [('c', 3), ('b', 2)])
self.assertEqual(s.withscores.descending[0], ('c', 3))
def test_range_views_pass_through_method_calls(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3))
self.assertEqual(s.descending.cardinality(), 3)
self.assertEqual(len(s.descending), 3)
self.assertTrue('a' in s.descending)
self.assertFalse('z' in s.descending)
self.assertEqual([item for item in s.descending], ['c','b', 'a'])
def test_iteration(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3))
results = [item for item in s]
self.assertEqual(results, ['a', 'b', 'c'])
self.assertEqual(self.rediset.redis.zrange.call_count, 1)
def test_get_score(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2))
self.assertEqual(s.score('a'), 1)
self.assertEqual(s.score('b'), 2)
self.assertTrue(s.score('notmember') is None)
def test_increment_and_decrement(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1))
s.increment('a')
self.assertEqual(s.score('a'), 2)
s.increment('a', 3)
self.assertEqual(s.score('a'), 5)
s.increment('b')
self.assertEqual(s.score('b'), 1)
s.decrement('a')
self.assertEqual(s.score('a'), 4)
s.decrement('a', amount=2)
self.assertEqual(s.score('a'), 2)
result = s.increment('a')
self.assertEqual(result, 3)
def test_remrangebyrank(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7))
s.remrangebyrank(0, 1)
self.assertEqual(s.members(), ['c', 'd', 'e', 'f', 'g'])
s.remrangebyrank(0, -3)
self.assertEqual(s.members(), ['f', 'g'])
def test_remrangebyrank(self):
s = self.rediset.SortedSet('key')
s.add(('a', 1), ('b', 2), ('c', 3), ('d', 4), ('e', 5), ('f', 6), ('g', 7))
s.remrangebyscore(3, 5)
self.assertEqual(s.members(), ['a', 'b', 'f', 'g'])
s.remrangebyscore('(6', 'inf')
self.assertEqual(s.members(), ['a', 'b', 'f'])
class SortedSetOperationTestCase(RedisTestCase):
def test_sorted_set_intersection(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
i = self.rediset.Intersection(s1, s2)
self.assertTrue(isinstance(i, SortedIntersectionNode))
def test_sorted_set_intersection_with_weights(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
i = self.rediset.Intersection((s1, 0.1), (s2, 2))
self.assertTrue(isinstance(i, SortedIntersectionNode))
self.assertEqual(i.weights, [0.1, 2])
def test_sorted_set_union(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
u = self.rediset.Union(s1, s2)
self.assertTrue(isinstance(u, SortedUnionNode))
def test_sorted_set_union_with_weights(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
u = self.rediset.Union((s1,0.2), (s2,1))
self.assertTrue(isinstance(u, SortedUnionNode))
self.assertEqual(u.weights, [0.2, 1])
def test_sorted_set_difference(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
self.assertRaises(TypeError, self.rediset.Difference, s1, s2)
def test_sorted_set_difference_with_weights(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
self.assertRaises(TypeError, self.rediset.Difference, (s1, 1), (s2, 2))
def test_mixing_types(self):
s1 = self.rediset.Set('key1')
s1.add('a', 'b')
s2 = self.rediset.SortedSet('key2')
s2.add(('a', 1))
self.assertRaises(TypeError, self.rediset.Intersection, s1, s2)
self.assertRaises(TypeError, self.rediset.Union, s1, s2)
self.assertRaises(TypeError, self.rediset.Difference, s1, s2)
def test_mixing_weighted_and_non_weighted(self):
s1 = self.rediset.SortedSet('key1')
s1.add(('a', 1))
s2 = self.rediset.SortedSet('key2')
s2.add(('a', 1))
self.assertRaises(TypeError, self.rediset.Intersection, (s1, 1), s2)
self.assertRaises(TypeError, self.rediset.Union, s1, (s2, 1))
self.assertRaises(TypeError, self.rediset.Difference, (s1, 0.1), s2)
class IntersectionTestCase(RedisTestCase):
def test_basic_intersection(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s1.add('a', 'b')
s2.add('b', 'c')
i = self.rediset.Intersection(s1, s2)
self.assertEqual(len(i), 1)
self.assertEqual(i.members(), set(['b']))
i2 = s1.intersection(s2)
self.assertEqual(i.members(), i2.members())
def test_intersection_tree(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s3 = self.rediset.Set('key3')
s1.add('a', 'b', 'c')
s2.add('b', 'c', 'd')
s3.add('b', 'z', 'x')
i1 = self.rediset.Intersection(s1, s2)
self.assertEqual(len(i1), 2)
i2 = self.rediset.Intersection(i1, s3)
self.assertEqual(len(i2), 1)
self.assertEqual(i2.members(), set(['b']))
def test_key_generation(self):
i1 = self.rediset.Intersection('a', 'b', 'c')
i2 = self.rediset.Intersection('c', 'b', 'a')
i3 = self.rediset.Intersection('b' ,'c', 'a')
self.assertTrue(i1.key == i2.key == i3.key)
def test_sorted_set_intersection(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
s1.add(('a', 2), ('b', 2))
s2.add(('b', 1), ('c', 2))
i = self.rediset.Intersection(s1, s2)
self.assertEqual(len(i), 1)
self.assertEqual(i.members(), ['b'])
i2 = s1.intersection(s2)
self.assertEqual(i.members(), i2.members())
i3 = self.rediset.Intersection(s1, s2, aggregate='SUM')
self.assertEqual(i3.members(withscores=True), [('b', 3)])
i4 = self.rediset.Intersection(s1, s2, aggregate='MAX')
self.assertEqual(i4.members(withscores=True), [('b', 2)])
i5 = self.rediset.Intersection(s1, s2, aggregate='MIN')
self.assertEqual(i5.members(withscores=True), [('b', 1)])
class UnionTestCase(RedisTestCase):
def test_basic_union(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s1.add('a', 'b')
s2.add('b', 'c')
u = self.rediset.Union(s1, s2)
self.assertEqual(len(u), 3)
self.assertEqual(u.members(), set(['a', 'b', 'c']))
u2 = s1.union(s2)
self.assertEqual(u.members(), u2.members())
def test_union_tree(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s3 = self.rediset.Set('key3')
s1.add('a', 'b', 'c')
s2.add('b', 'c', 'd')
s3.add('b', 'z', 'x')
i1 = self.rediset.Union(s1, s2)
self.assertEqual(len(i1), 4)
i2 = self.rediset.Union(i1, s3)
self.assertEqual(len(i2), 6)
self.assertEqual(i2.members(), set(['a', 'b', 'c', 'd', 'z', 'x']))
def test_key_generation(self):
i1 = self.rediset.Union('a', 'b', 'c')
i2 = self.rediset.Union('c', 'b', 'a')
i3 = self.rediset.Union('b' ,'c', 'a')
self.assertTrue(i1.key == i2.key == i3.key)
def test_sorted_set_union(self):
s1 = self.rediset.SortedSet('key1')
s2 = self.rediset.SortedSet('key2')
s1.add(('a', 1), ('b', 2))
s2.add(('b', 3), ('c', 6))
u = self.rediset.Union(s1, s2)
self.assertEqual(len(u), 3)
self.assertEqual(u.members(), ['a', 'b', 'c'])
u2 = s1.union(s2)
self.assertEqual(u.members(), u2.members())
u3 = self.rediset.Union(s1, s2, aggregate='SUM')
self.assertEqual(u3.members(withscores=True), [('a', 1), ('b', 5), ('c', 6)])
u4 = self.rediset.Union(s1, s2, aggregate='MAX')
self.assertEqual(u4.members(withscores=True), [('a', 1), ('b', 3), ('c', 6)])
u5 = self.rediset.Union(s1, s2, aggregate='MIN')
self.assertEqual(u5.members(withscores=True), [('a', 1), ('b', 2), ('c', 6)])
class DifferenceTestCase(RedisTestCase):
def test_basic_difference(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s3 = self.rediset.Set('key3')
s1.add('a', 'b', 'c', 'x')
s2.add('b')
s3.add('c', 'd')
d = self.rediset.Difference(s1, s2, s3)
self.assertEqual(len(d), 2)
self.assertEqual(d.members(), set(['a', 'x']))
d2 = s1.difference(s2, s3)
self.assertEqual(d.members(), d2.members())
def test_difference_tree(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s3 = self.rediset.Set('key3')
s1.add('a', 'b', 'c')
s2.add('b', 'd', 'e')
s3.add('c', 'z', 'x')
d1 = self.rediset.Difference(s1, s2)
self.assertEqual(len(d1), 2)
self.assertEqual(d1.members(), set(['a', 'c']))
d2 = self.rediset.Difference(d1, s3)
self.assertEqual(len(d2), 1)
self.assertEqual(d2.members(), set(['a']))
def test_key_generation(self):
d1 = self.rediset.Difference('a', 'b', 'c')
d2 = self.rediset.Difference('a', 'c', 'b')
d3 = self.rediset.Difference('b' ,'c', 'a')
self.assertEqual(d1.key, d2.key)
self.assertNotEqual(d1.key, d3.key)
class ShortcutTestCase(RedisTestCase):
def test_string_shortcuts(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s1.add('a', 'b')
s2.add('b', 'c')
intersection = self.rediset.Intersection('key1', s2)
for child in intersection.children:
self.assertTrue(isinstance(child, SetNode))
self.assertEqual(len(intersection), 1)
def test_single_item(self):
s1 = self.rediset.Set('key1')
s1.add('a', 'b')
intersection = self.rediset.Intersection(s1)
self.assertTrue(isinstance(intersection, SetNode))
intersection = self.rediset.Intersection('key1')
self.assertTrue(isinstance(intersection, SetNode))
s2 = self.rediset.Set('key2')
s2.add('b', 'c')
intersection = self.rediset.Intersection(s1, s2)
union = self.rediset.Union(intersection)
self.assertTrue(isinstance(union, IntersectionNode))
class CombinationTestCase(RedisTestCase):
def test_complex_tree(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s3 = self.rediset.Set('key3')
s4 = self.rediset.Set('key4')
s5 = self.rediset.Set('key5')
s1.add('a', 'b')
s2.add('b', 'c')
s3.add('b', 'd')
s4.add('e', 'f')
s5.add('b', 'z')
result = self.rediset.Union(
self.rediset.Intersection(
s1,
s2,
s3
),
s4,
s5
)
self.assertEqual(len(result), 4)
self.assertEqual(result.members(), set(['b', 'e', 'f', 'z']))
class ConversionTestCase(RedisTestCase):
def test_iterable(self):
s1 = self.rediset.Set('key1')
s1.add('a', 'b', 'c')
self.assertEqual(set(s1), set(['a', 'b', 'c']))
def test_contains(self):
s1 = self.rediset.Set('key1')
s1.add('a', 'b', 'c')
self.assertTrue('a' in s1)
self.rediset.redis.sismember.assert_called_with('%s:key1' % self.PREFIX, 'a')
self.assertFalse('x' in s1)
self.rediset.redis.sismember.assert_called_with('%s:key1' % self.PREFIX, 'x')
class CachingTestCase(RedisTestCase):
def test_default_caching_and_override(self):
self.rediset = Rediset(key_prefix=self.PREFIX, default_cache_seconds=10)
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
intersection = self.rediset.Intersection(s1, s2)
self.assertEqual(intersection.cache_seconds, 10)
intersection = self.rediset.Intersection(s1, s2, cache_seconds=5)
self.assertEqual(intersection.cache_seconds, 5)
def test_caching(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s1.add('a', 'b')
s2.add('b', 'c')
intersection = self.rediset.Intersection(s1, s2, cache_seconds=1)
len(intersection)
len(intersection)
self.assertEqual(intersection.rs.redis.sinterstore.call_count, 1)
sleep(2)
len(intersection)
self.assertEqual(intersection.rs.redis.sinterstore.call_count, 2)
def test_caching_empty_sets(self):
s1 = self.rediset.Set('key1')
s2 = self.rediset.Set('key2')
s1.add('a', 'b')
s2.add('c', 'd')
intersection = self.rediset.Intersection(s1, s2, cache_seconds=1)
len(intersection)
len(intersection)
self.assertEqual(intersection.rs.redis.sinterstore.call_count, 1)