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
Located in /Zend/Search/Lucene/PriorityQueue.php (line 37)
Class | Description |
---|---|
![]() |
Clear queue
Removes and return least element of the queue
O(log(N)) time
Add element to the queue
O(log(N)) time
Return least element of the queue
Constant time
Compare elements
Returns true, if $el1 is less than $el2; else otherwise
Documentation generated on Wed, 21 Feb 2007 11:57:51 -0800 by phpDocumentor 1.3.1