downloads | documentation | faq | getting help | mailing lists | reporting bugs | php.net sites | links | my php.net 
search for in the  

<SplMinHeapSplPriorityQueue>
Last updated: Thu, 26 Jun 2008

SplMinHeap::compare

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

SplMinHeap::compare — Compare 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 noteadd a note User Contributed Notes
Compare elements in order to place them correctly in the heap while sifting up.
There are no user contributed notes for this page.




<SplMinHeapSplPriorityQueue>
Last updated: Thu, 26 Jun 2008
show source | credits | sitemap | contact | advertising | mirror sites
Copyright © 2001-2005 The PHP Group
All rights reserved.
This unofficial mirror is operated at: http://phpbuilder.com/
Last updated: Tue Nov 1 20:20:59 2005 EST
Columns / Articles | Tips / Quickies | News | News Linking and RSS Feeds | Shared Code Library
Mail Archives | Support / Discussion Forums | Get Started! Links | Contribute! | Docs