def remove(self,x): h = None if len(self)>0: h = self[0] deque.remove(self, x) if ( len(self)>0 and h!=self[0] ): self[0].handle_head_of_queue()
def remove(self,value): try: # python 2.5 deque.remove(self,value) except: # python 2.4 #yuck, two copies ... x=self.tolist() x.remove(value) self.clear() for i in x:self.append(i)
def remove_process(self, process): # 删除就绪队列里面指定的进程 priority = process.get_priority() deque = self.deques[priority] deque.remove(process) return
#other functions. print('Search index.') # index(ele, beg, end) print(deque.index(7,5,9)) print('Count') print(deque.count(0)) print('Extend Left') deque.extendleft([0]) print(deque) print('Remove first occurence.') deque.remove('abc') print(deque) print('Rotate by 2.') deque.rotate(2) print(deque) print('Rotate left by 2.') deque.rotate(-2) print(deque) print('Reverse.') deque.reverse() print(deque)