MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / Enqueue

Method Enqueue

Python/circular queue.py:37–48  ·  view source on GitHub ↗
(self,value)

Source from the content-addressed store, hash-verified

35
36 # insert elements
37 def Enqueue(self,value):
38 if self.isFull():
39 return "queue is full"
40 else:
41 if self.top+1==self.maxsize:
42 self.top=0
43 else:
44 self.top+=1
45 if self.start==-1:
46 self.start=0
47 self.items[self.top]=value
48 return "element inserted"
49
50
51

Callers

nothing calls this directly

Calls 1

isFullMethod · 0.95

Tested by

no test coverage detected