Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Delete circular_queue_list.py

Browse Source
This commit is contained in:
marina 2023-08-07 18:06:54 -07:00 committed by GitHub
parent afe695c69f
commit ad2c24a519
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 0 additions and 55 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

55
queues/circular_queue_list.py
View File

@ -1,55 +0,0 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# author: bt3gl
class CircularQueue:
def __init__(self, k: int):
self.head = -1
self.tail = -1
self.size = k
self.queue = [None] * self.size
def _get_next_position(self, end) -> int:
return (end + 1) % self.size
def enqueue(self, value: int) -> bool:
if self.is_full():
return False
if self.is_empty() :
self.head = 0;
self.tail = self._get_next_position(self.tail)
self.queue[self.tail] = value
return True
def dequeue(self) -> bool:
if self.is_empty():
return False
if self.head == self.tail:
self.head = -1
self.tail = -1
return True
self.head = self._get_next_position(self.head)
return True
def front(self) -> int:
if self.is_empty():
return -1
return self.queue[self.head]
def rear(self) -> int:
if self.is_empty():
return -1
return self.queue[self.tail]
def is_empty(self) -> bool:
return self.head == -1
def is_full(self) -> bool:
return self._get_next_position(self.tail) == self.head