mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-06 05:39:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added toString and rotate

Browse Source
This commit is contained in:
2016-10-09 11:51:43 -04:00
parent 78f99d2a42
commit 13dd4a1e5d
1 changed files with 12 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
data_structures/QueueOnList.py
View File

@ -4,13 +4,17 @@ class Queue():
self.entries = [] self.entries = []
self.length = 0 self.length = 0
def __str__(self):
printed = '<' + str(self.entries)[1:-1] + '>'
return printed
"""Enqueues {@code item} """Enqueues {@code item}
@param item @param item
item to enqueue""" item to enqueue"""
def put(self, item): def put(self, item):
self.entries.append(item) self.entries.append(item)
self.length = self.length + 1 self.length = self.length + 1
print(self.entries)
"""Dequeues {@code item} """Dequeues {@code item}
@requirement: |self.length| > 0 @requirement: |self.length| > 0
@ -22,6 +26,13 @@ class Queue():
self.entries = self.entries[1:] self.entries = self.entries[1:]
return dequeued 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} """Enqueues {@code item}
@return item at front of self.entries""" @return item at front of self.entries"""
def front(self): def front(self):
@ -30,6 +41,3 @@ class Queue():
"""Returns the length of this.entries""" """Returns the length of this.entries"""
def size(self): def size(self):
return self.length return self.length