Zend_Search_Lucene_PriorityQueueAbstract 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 |
|---|---|
Zend_Search_Lucene_Index_SegmentInfoPriorityQueue
|
clear (line 153)
Clear queue
pop (line 105)
Removes and return least element of the queue
O(log(N)) time
put (line 62)
Add element to the queue
O(log(N)) time
top (line 88)
Return least element of the queue
Constant time
_less (line 168)
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