-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue_spec.py
110 lines (83 loc) · 2.95 KB
/
queue_spec.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
import pytest
from optional import Optional, Something
from queue import Queue
class QueueSpec:
class A_new_queue:
def is_empty(self):
queue = Queue(1)
assert queue.length() == 0
def preserves_positive_bounding_capacity(self):
capacity = 1
queue = Queue(capacity)
assert queue.capacity() == capacity
def rejects_a_zero_bounding_capacity(self):
with pytest.raises(ValueError):
Queue(0)
def rejects_a_negative_bounding_capacity(self):
with pytest.raises(ValueError):
Queue(-1)
class An_empty_queue:
def dequeues_an_empty_optional(self):
queue = Queue(1)
assert queue.dequeue() == Optional.empty()
def becomes_non_empty_when_value_enqueued(self):
queue = Queue(1)
queue.enqueue('rock')
assert queue.length() > 0
class A_non_empty_queue:
class that_is_not_full:
def becomes_longer_when_value_enqueued(self):
# given ->
queue = Queue(2)
queue.enqueue('rock')
old_length = queue.length()
# when ->
queue.enqueue('paper')
# then ->
assert queue.length() > old_length
def becomes_full_when_enqueued_up_to_capacity(self):
# given ->
queue = Queue(2)
queue.enqueue('rock')
# when ->
queue.enqueue('paper')
# then ->
assert queue.length() == queue.capacity()
class that_is_full:
def ignores_further_enqueued_values(self):
# given ->
queue = Queue(1)
queue.enqueue('rock')
# when ->
queue.enqueue('paper')
# then ->
assert queue.length() == 1
assert queue.dequeue() == Something('rock')
def becomes_non_full_when_dequeued(self):
# given ->
queue = Queue(1)
queue.enqueue('rock')
# when ->
queue.dequeue()
# then ->
assert queue.length() < queue.capacity()
def becomes_shorter_when_dequeued(self):
# given ->
queue = Queue(1)
queue.enqueue('rock')
old_length = queue.length()
# when ->
queue.dequeue()
# then ->
assert queue.length() < old_length
def dequeues_values_in_order_enqueued(self):
# given ->
rock = "rock"
paper = "paper"
queue = Queue(2)
# when ->
queue.enqueue(rock)
queue.enqueue(paper)
# then ->
assert queue.dequeue() == Something(rock)
assert queue.dequeue() == Something(paper)