mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-07 14:19:31 +00:00
7f04e5cd34
* spelling corrections * review * improved documentation, removed redundant variables, added testing * added type hint * camel case to snake case * spelling fix * review * python --> Python # it is a brand name, not a snake * explicit cast to int * spaces in int list * "!= None" to "is not None" * Update comb_sort.py * various spelling corrections in documentation & several variables naming conventions fix * + char in file name * import dependency - bug fix Co-authored-by: John Law <johnlaw.po@gmail.com>
53 lines
1.2 KiB
Python
53 lines
1.2 KiB
Python
"""Queue represented by a Python list"""
|
|
|
|
|
|
class Queue:
|
|
def __init__(self):
|
|
self.entries = []
|
|
self.length = 0
|
|
self.front = 0
|
|
|
|
def __str__(self):
|
|
printed = "<" + str(self.entries)[1:-1] + ">"
|
|
return printed
|
|
|
|
"""Enqueues {@code item}
|
|
@param item
|
|
item to enqueue"""
|
|
|
|
def put(self, item):
|
|
self.entries.append(item)
|
|
self.length = self.length + 1
|
|
|
|
"""Dequeues {@code item}
|
|
@requirement: |self.length| > 0
|
|
@return dequeued
|
|
item that was dequeued"""
|
|
|
|
def get(self):
|
|
self.length = self.length - 1
|
|
dequeued = self.entries[self.front]
|
|
# self.front-=1
|
|
# self.entries = self.entries[self.front:]
|
|
self.entries = self.entries[1:]
|
|
return dequeued
|
|
|
|
"""Rotates the queue {@code rotation} times
|
|
@param rotation
|
|
number of times to rotate queue"""
|
|
|
|
def rotate(self, rotation):
|
|
for i in range(rotation):
|
|
self.put(self.get())
|
|
|
|
"""Enqueues {@code item}
|
|
@return item at front of self.entries"""
|
|
|
|
def front(self):
|
|
return self.entries[0]
|
|
|
|
"""Returns the length of this.entries"""
|
|
|
|
def size(self):
|
|
return self.length
|