Related Links : Search Engine Optimization | | Search Engine Marketing | Online Marketing | Freelance Programmer| SEO Thailand | SEO Expert | SEO services | PHP Programmer Thailand | SEO Tutorial | What is SEO |

  Home Our SEO Services SEO Expert Consultant Php Programmer Scripts| Email : sachin {at} jainsachin {dot} com

PHP | Compare elements in order to place them correctly in the heap while sifting up. | Manual | Tutorial | Help

SEO Services



Website Programming in PHP / MYSQL



Friends


    Compare elements in order to place them correctly in the heap while sifting up.

    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.


    SEO Tutorial / Articles





    Php / Mysql Tutorial



    Articles



      Portfolio


      SEO by Jainsachin