SplPriorityQueue::compare

(PHP 5 >= 5.3.0, PHP 7)

SplPriorityQueue::compare — Compare priorities in order to place elements correctly in the heap while sifting up

说明

public SplPriorityQueue::compare ( mixed $priority1 , mixed $priority2 ) : int

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.

相关文章
php deque sorts the deque in placephp db++ 函数 give up write lock on relationphp pdf 函数 place table on pagephp locale returns a key value array of locale id subtag elementsphp quickhashintstringhash returns the number of elements in the hashphp splheap compare elements in order to place them correctly in the heap while sifting upphp splheap counts the number of elements in the heapphp splheap extracts a node from top of the heap and sift upphp splheap inserts an element in the heap by sifting it upphp splheap recover from the corrupted state and allow further actions on the heapphp splmaxheap compare elements in order to place them correctly in the heap while sifting upphp splminheap compare elements in order to place them correctly in the heap while sifting upphp splpriorityqueue compare priorities in order to place elements correctly in the heap while sifting upphp splpriorityqueue counts the number of elements in the queuephp splpriorityqueue return current node pointed by the iteratorphp splpriorityqueue extracts a node from top of the heap and sift upphp splpriorityqueue get the flags of extractionphp splpriorityqueue inserts an element in the queue by sifting it upphp swfdisplayitem sets z orderphp swoole table count the rows in the table or count all the elements in the table if $mode = 1.
关注编程学问公众号