Skip to content

Add doctest for circular queue overflow condition #13590

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Oct 19, 2025
Merged

Add doctest for circular queue overflow condition #13590

Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
b69bfca
Add doctest for circular queue overflow condition
Tejasrahane Oct 19, 2025
f9971af
Update circular_queue.py
MaximSmolskiy Oct 19, 2025
3814c01
Update circular_queue.py
MaximSmolskiy Oct 19, 2025
80c9139
Update circular_queue.py
MaximSmolskiy Oct 19, 2025
8985c7d
Update circular_queue.py
MaximSmolskiy Oct 19, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 11 additions & 3 deletions data_structures/queues/circular_queue.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ def __len__(self) -> int:
>>> len(cq)
0
>>> cq.enqueue("A") # doctest: +ELLIPSIS
<data_structures.queues.circular_queue.CircularQueue object at ...
<data_structures.queues.circular_queue.CircularQueue object at ...>
>>> cq.array
['A', None, None, None, None]
>>> len(cq)
Expand Down Expand Up @@ -51,17 +51,24 @@ def enqueue(self, data):
"""
This function inserts an element at the end of the queue using self.rear value
as an index.

>>> cq = CircularQueue(5)
>>> cq.enqueue("A") # doctest: +ELLIPSIS
<data_structures.queues.circular_queue.CircularQueue object at ...
<data_structures.queues.circular_queue.CircularQueue object at ...>
>>> (cq.size, cq.first())
(1, 'A')
>>> cq.enqueue("B") # doctest: +ELLIPSIS
<data_structures.queues.circular_queue.CircularQueue object at ...
<data_structures.queues.circular_queue.CircularQueue object at ...>
>>> cq.array
['A', 'B', None, None, None]
>>> (cq.size, cq.first())
(2, 'A')
>>> cq.enqueue("C").enqueue("D").enqueue("E") # doctest: +ELLIPSIS
<data_structures.queues.circular_queue.CircularQueue object at ...>
>>> cq.enqueue("F")
Traceback (most recent call last):
...
Exception: QUEUE IS FULL
"""
if self.size >= self.n:
raise Exception("QUEUE IS FULL")
Expand All @@ -75,6 +82,7 @@ def dequeue(self):
"""
This function removes an element from the queue using on self.front value as an
index and returns it

>>> cq = CircularQueue(5)
>>> cq.dequeue()
Traceback (most recent call last):
Expand Down