mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-09-28 21:45:27 +08:00
priya-sundaram-dev
945b5ab9ee
Annotate the unambiguous, primitive/container-returning public methods flagged by ruff ANN201 across data_structures/ (int/bool/float/list/dict and one fluent self-return). Reduces ANN201 in this directory from 58 to 36. Element-typed and sentinel-union returns (e.g. node .data getters, dict|False in the Sudoku solver) are intentionally left for follow-up, since they warrant generics/TypeVar or a type checker rather than a guess. Refs #15296
110 lines
3.1 KiB
Python
110 lines
3.1 KiB
Python
# Implementation of Circular Queue (using Python lists)
|
|
|
|
|
|
class CircularQueue:
|
|
"""Circular FIFO queue with a fixed capacity"""
|
|
|
|
def __init__(self, n: int) -> None:
|
|
self.n = n
|
|
self.array = [None] * self.n
|
|
self.front = 0 # index of the first element
|
|
self.rear = 0
|
|
self.size = 0
|
|
|
|
def __len__(self) -> int:
|
|
"""
|
|
>>> cq = CircularQueue(5)
|
|
>>> len(cq)
|
|
0
|
|
>>> cq.enqueue("A") # doctest: +ELLIPSIS
|
|
<data_structures.queues.circular_queue.CircularQueue object at ...>
|
|
>>> cq.array
|
|
['A', None, None, None, None]
|
|
>>> len(cq)
|
|
1
|
|
"""
|
|
return self.size
|
|
|
|
def is_empty(self) -> bool:
|
|
"""
|
|
Checks whether the queue is empty or not
|
|
>>> cq = CircularQueue(5)
|
|
>>> cq.is_empty()
|
|
True
|
|
>>> cq.enqueue("A").is_empty()
|
|
False
|
|
"""
|
|
return self.size == 0
|
|
|
|
def first(self):
|
|
"""
|
|
Returns the first element of the queue
|
|
>>> cq = CircularQueue(5)
|
|
>>> cq.first()
|
|
False
|
|
>>> cq.enqueue("A").first()
|
|
'A'
|
|
"""
|
|
return False if self.is_empty() else self.array[self.front]
|
|
|
|
def enqueue(self, data) -> "CircularQueue":
|
|
"""
|
|
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 ...>
|
|
>>> (cq.size, cq.first())
|
|
(1, 'A')
|
|
>>> cq.enqueue("B") # doctest: +ELLIPSIS
|
|
<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")
|
|
|
|
self.array[self.rear] = data
|
|
self.rear = (self.rear + 1) % self.n
|
|
self.size += 1
|
|
return self
|
|
|
|
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):
|
|
...
|
|
Exception: UNDERFLOW
|
|
>>> cq.enqueue("A").enqueue("B").dequeue()
|
|
'A'
|
|
>>> (cq.size, cq.first())
|
|
(1, 'B')
|
|
>>> cq.dequeue()
|
|
'B'
|
|
>>> cq.dequeue()
|
|
Traceback (most recent call last):
|
|
...
|
|
Exception: UNDERFLOW
|
|
"""
|
|
if self.size == 0:
|
|
raise Exception("UNDERFLOW")
|
|
|
|
temp = self.array[self.front]
|
|
self.array[self.front] = None
|
|
self.front = (self.front + 1) % self.n
|
|
self.size -= 1
|
|
return temp
|