MCPcopy Index your code
hub / github.com/OmkarPathak/pygorithm / insert_rear

Method insert_rear

pygorithm/data_structures/queue.py:101–108  ·  view source on GitHub ↗

inserts an element at the rear end of the deque

(self, data)

Source from the content-addressed store, hash-verified

99 return len(self.queue) >= self.limit
100
101 def insert_rear(self, data):
102 """
103 inserts an element at the rear end of the deque
104 """
105 if self.is_full():
106 return
107 else:
108 self.queue.insert(0, data)
109
110 def insert_front(self, data):
111 """

Callers 1

test_dequeMethod · 0.95

Calls 2

is_fullMethod · 0.95
insertMethod · 0.45

Tested by 1

test_dequeMethod · 0.76