PHP
downloads | documentation | faq | getting help | mailing lists | reporting bugs | php.net sites | links | conferences | my php.net

search for in the

SplPriorityQueue> <SplMinHeap
Last updated: Fri, 10 Oct 2008

view this page in

SplMinHeap::compare

(No version information available, might be only in CVS)

SplMinHeap::compareCompare elements in order to place them correctly in the heap while sifting up.

Description

void SplMinHeap::compare ( mixed $value1 , mixed $value2 )

Compare value1 with value2 .

Parameters

value1

The value of the first node being compared.

value2

The value of the second node being compared.

Return Values

Result of the comparison, positive integer if value1 is lower 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.



add a note add a note User Contributed Notes
SplMinHeap::compare
There are no user contributed notes for this page.

SplPriorityQueue> <SplMinHeap
Last updated: Fri, 10 Oct 2008
 
 
show source | credits | stats | sitemap | contact | advertising | mirror sites