栈 队列 （面向对象列表实现）

import pickle
class Foo:
    def __init__(self):
        self.l=[]
    def get(self, key):
        self.l.append(key)
    def put(self):
        print(self.l.pop()) if self.index==-1 else print(self.l.pop(0))
class Queue(Foo):
    def __init__(self):
        self.index=-1
        Foo.__init__(self)
class Stack(Foo):
    def __init__(self):
        self.index = 0
        Foo.__init__(self)
class My_pickle:
    def __init__(self,file_path):
        self.file_path=file_path
    def _dump(self,obj):
        with open(self.file_path,mode="wb") as f:
            pickle.dump(obj,f)
    def _load(self):
        with open(self.file_path, mode="rb") as f1:
            while 1:
                try:
                    yield pickle.load(f1)
                except EOFError:
                    break
s=Queue()
s.get(10)
s.get(100)
s.get(1000)
m=My_pickle('pickle_file')
m._dump(s)
print(m._load())
for i in m._load():
    print(i,i.l)