array ( 0 => 'index.php', 1 => 'PHP Manual', ), 'head' => array ( 0 => 'UTF-8', 1 => 'de', ), 'this' => array ( 0 => 'splminheap.compare.php', 1 => 'SplMinHeap::compare', 2 => 'Compare elements in order to place them correctly in the heap while sifting up', ), 'up' => array ( 0 => 'class.splminheap.php', 1 => 'SplMinHeap', ), 'prev' => array ( 0 => 'class.splminheap.php', 1 => 'SplMinHeap', ), 'next' => array ( 0 => 'class.splpriorityqueue.php', 1 => 'SplPriorityQueue', ), 'alternatives' => array ( ), 'source' => array ( 'lang' => 'en', 'path' => 'reference/spl/splminheap/compare.xml', ), 'history' => array ( ), ); $setup["toc"] = $TOC; $setup["toc_deprecated"] = $TOC_DEPRECATED; $setup["parents"] = $PARENTS; manual_setup($setup); contributors($setup); ?>

SplMinHeap::compare

(PHP 5 >= 5.3.0, PHP 7, PHP 8)

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

Beschreibung

protected SplMinHeap::compare(mixed $value1, mixed $value2): int

Compare value1 with value2.

Parameter-Liste

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

Rückgabewerte

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

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