©
本文檔使用 php中文網手册 發布
(PHP 5 >= 5.3.0)
SplPriorityQueue::compare — Compare priorities in order to place elements correctly in the heap while sifting up.
$priority1
, mixed $priority2
)
Compare priority1
with priority2
.
priority1
The priority of the first node being compared.
priority2
The priority of the second node being compared.
Result of the comparison, positive integer if priority1
is greater than priority2
, 0 if they are equal, negative integer otherwise.
Note:
Multiple elements with the same priority will get dequeued in no particular order.
[#1] Anonymous [2009-10-10 16:51:14]
At this time, the documentation sais "Note: Multiple elements with the same priority will get dequeued in no particular order."
If you need elements of equal priority to maintain insertion order, you can use something like:
<?php
class StablePriorityQueue extends SplPriorityQueue {
protected $serial = PHP_INT_MAX;
public function insert($value, $priority) {
parent::insert($value, array($priority, $this->serial--));
}
}
?>