circularqueue.py

class CircularQueue():
    def __init__(self,length):
        self.queue = [None] * length
        self.length = length
        self.count = 0
        self.rear = None
        self.first = None
    
    def isFull(self):
        if self.count == self.length:
            return True
        else:
            return False
        
    def isEmpty(self):
        if self.count == 0:
            return True
        else:
            return False
        
    def enqueue(self,value):
        if self.isFull():
            raise Exception("Queue is Full")
        elif self.count == 0:
            self.queue[0] = value
            self.first = self.rear = 0
            self.rear = (self.rear + 1) % self.length
            self.count += 1
        else:
            self.queue[self.rear] = value
            self.rear = (self.rear + 1) % self.length
            self.count += 1
    
    def dequeue(self):
        if self.isEmpty():
            raise Exception("Queue is empty")
        else:
            self.queue[self.first] = None
            self.first = (self.first +1 ) % self.length
            self.count -= 1
    def __str__(self):
        return self.queue.__str__()


cqueue = CircularQueue(4)
cqueue.enqueue(4)
cqueue.enqueue(5)
cqueue.dequeue()
cqueue.enqueue(6)
cqueue.enqueue(2)
cqueue.dequeue()
cqueue.enqueue(3)
cqueue.dequeue()
cqueue.enqueue(7)
print(cqueue)
# print(cqueue.isFull())