\Zend_Search_Lucene_PriorityQueue
Abstract Priority Queue
It implements a priority queue.
Please go to "Data Structures and Algorithms",
Aho, Hopcroft, and Ullman, Addison-Wesley, 1983 (corrected 1987 edition),
for implementation details.
It provides O(log(N)) time of put/pop operations, where N is a size of queue
- Copyright: Copyright (c) 2005-2010 Zend Technologies USA Inc. (http://www.zend.com)
- License: http://framework.zend.com/license/new-bsd New BSD License
Synopsis
class Zend_Search_Lucene_PriorityQueue
{
- // members
- private array $_heap = ;
- // methods
- public void put()
- public mixed top()
- public mixed pop()
- public void clear()
- protected abstract boolean _less()
Members
private
- $_heap
—
array
Queue heap