每天CookBook之Python-005

• 使用heapq实现优先队列

# -*- coding: utf-8 -*-
import heapq


class PriorityQueue(object):
    """docstring for PriorityQueue"""

    def __init__(self):
        self._queue = []
        self._index = 0

    def push(self, item, priority):
        heapq.heappush(self._queue, (-priority, self._index, item))
        self._index += 1

    def pop(self):
        if len(self._queue) == 0:
            return None
        return heapq.heappop(self._queue)[-1]


class Item(object):
    """docstring for Item"""

    def __init__(self, name):
        self.name = name

    def __repr__(self):
        return 'Item(%s)' % self.name


q = PriorityQueue()
q.push(Item('foo'), 1)
q.push(Item('bar'), 5)
q.push(Item('spam'), 4)
q.push(Item('grok'), 1)
print q.pop()
print q.pop()
print q.pop()
print q.pop()

Out:

Item(bar)
Item(spam)
Item(foo)
Item(grok)

转载于:https://www.cnblogs.com/4thing/p/5648299.html