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
=
"""
A dynamically growable, lock-free non-blocking MPMC queue.
Core operations detach from the python GIL, to ensure concurrent performance.
"""
"""
Constructs a new `DynamicQueue` with initial capacity `size`.
"""
...
"""
Attempts to push an element into the queue.
Returns the item, if the queue was full.
"""
...
"""
Attempts to pop an item from the queue.
Returns `None` if the queue was empty.
"""
...
"""
Returns the current length of the queue.
This method should not be used for synchronization.
"""
...
"""
Returns the current capacity of the queue.
This method should not be used for synchronization.
"""
...
"""
Indicates whether the queue is currently empty.
This method should not be used for synchronization.
"""
...
"""
Indicates whether the queue is currently full.
This method should not be used for synchronization.
"""
...
"""
Pushes an item into the queue.
This method may take some time under heavy contention.
This method may pop an arbitrary amount of items from the queue.
Returns the last popped item, if the queue was full. All other items are dropped.
"""
...
"""
Pushes an item into the queue.
This method may take some time under heavy contention.
This method may pop an arbitrary amount of items from the queue.
Applies `f` to each popped item.
"""
...
"""
Attempts to grow the queue's capacity by `by` items.
This method may spuriously fail.
Returns `True` if the capacity was successfully grown.
"""
...
"""
Attempts to grow the queue's capacity using limited exponential growth.
This method may spuriously fail.
Returns `True` if the capacity was successfully grown.
"""
...
"""
A lock-free non-blocking MPMC queue.
Core operations detach from the python GIL, to ensure concurrent performance.
"""
"""
Constructs a new `Queue` with initial capacity `size`.
"""
...
"""
Attempts to push an element into the queue.
Returns the item, if the queue was full.
"""
...
"""
Attempts to pop an item from the queue.
Returns `None` if the queue was empty.
"""
...
"""
Returns the current length of the queue.
This method should not be used for synchronization.
"""
...
"""
Returns the current capacity of the queue.
This method should not be used for synchronization.
"""
...
"""
Indicates whether the queue is currently empty.
This method should not be used for synchronization.
"""
...
"""
Indicates whether the queue is currently full.
This method should not be used for synchronization.
"""
...
"""
Pushes an item into the queue.
This method may take some time under heavy contention.
This method may pop an arbitrary amount of items from the queue.
Returns the last popped item, if the queue was full. All other items are dropped.
"""
...
"""
Pushes an item into the queue.
This method may take some time under heavy contention.
This method may pop an arbitrary amount of items from the queue.
Applies `f` to each popped item.
"""
...