Skip to content

Change_method_name #1938

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
104 changes: 52 additions & 52 deletions data_structures/queue/queue_on_list.py
Original file line number Diff line number Diff line change
@@ -1,52 +1,52 @@
"""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
"""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 first(self):
return self.entries[0]

"""Returns the length of this.entries"""

def size(self):
return self.length