python算法之——队列

class PyQueue:
    def __init__(self,size=20):
        self.queue=[]
        self.size=size
        self.end=-1
    def setSize(self,size):
        self.size=size
    def In(self,element):
        if self.end<self.size-1:
            self.queue.append(element)
            self.end=self.end+1
        else:
            raise 'PyQueueFull'
    def Out(self):
        if self.end !=-1:
            element=self.queue[0]   #出队
            self.queue=self.queue[1:]
            self.end=self.end-1
            return element
        else:
            raise'PyQueueEmpty'
    def End(self):              #取队尾的元素
        return self.end
    def empty(self):          #让队列置空
        self.queue=[]
        self.end=-1
    def isEmpty(self):        #判断队列为空否
        if self.end==-1:
            return True
        else:
            return False
if __name__=='__main__':
    queue=PyQueue()
    for i in range(10):
        queue.In(i)
    print queue.End()
    for i in range(10):
        print queue.Out()
    queue.empty()
    for i in range(10):
        print queue.Out()    #报队列为空的错