PHP Manual
SplHeap
Compare elements in order to place them correctly in the heap while sifting up

SplHeap::compare

(PHP 5 >= 5.3.0, PHP 7)

SplHeap::compare — Compare elements in order to place them correctly in the heap while sifting up

说明

abstract protected SplHeap::compare ( mixed $value1 , mixed $value2 ) : int

Compare value1 with value2.

Warning

Throwing exceptions in SplHeap::compare() can corrupt the Heap and place it in a blocked state. You can unblock it by calling SplHeap::recoverFromCorruption(). However, some elements might not be placed correctly and it may hence break the heap-property.

参数

value1: The value of the first node being compared.
value2: The value of the second node being compared.

返回值

Result of the comparison, positive integer if value1 is greater than value2, 0 if they are equal, negative integer otherwise.

Note:

Having multiple elements with the same value in a Heap is not recommended. They will end up in an arbitrary relative position.

php deque reverses the deque in place php set reverses the set in place php trader 函数 up/down gap side by side white lines php mysql xdevapi collectionfind skip given number of elements to be returned php splheap compare elements in order to place them correctly in the heap while sifting up php splheap constructs a new empty heap php splheap counts the number of elements in the heap php splheap return current node pointed by the iterator php splheap extracts a node from top of the heap and sift up php splheap inserts an element in the heap by sifting it up php splheap tells if the heap is in a corrupted state php splheap checks whether the heap is empty php splheap recover from the corrupted state and allow further actions on the heap php splheap peeks at the node from the top of the heap php splheap check whether the heap contains more nodes php splmaxheap compare elements in order to place them correctly in the heap while sifting up php splminheap compare elements in order to place them correctly in the heap while sifting up php splpriorityqueue compare priorities in order to place elements correctly in the heap while sifting up php splpriorityqueue extracts a node from top of the heap and sift up php splpriorityqueue inserts an element in the queue by sifting it up