, 1 min read
FIFO Data Structure in Python
This post is obselete, see this more recent discussion.
For some odd reason, Python doesn’t come with a good FIFO data structure (as of 2.4). Here’s one.
class Fifo:
def init(self):
self.data = [[], []]
def append(self, value):
self.data[1].append(value)
def pop(self):
if not self.data[0]:
self.data.reverse()
self.data[0].reverse()
return self.data[0].pop()
def len(self):
return len(self.data[0])+len(self.data[1])
def tolist(self):
temp= self.data[0][:]
temp.reverse()
return temp+self.data[1]