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 priorities in order to place elements correctly in the heap while sifting up. | Manual | Tutorial | Help

SEO Services



Website Programming in PHP / MYSQL



Friends


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

    SplPriorityQueue::compare

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

    SplPriorityQueue::compare — Compare priorities in order to place elements correctly in the heap while sifting up.

    Description

    void SplPriorityQueue::compare ( mixed $priority1 , mixed $priority1 )

    Compare priority1 with priority2 .

    Parameters

    priority1

    The priority of the first node being compared.

    priority2

    The priority of the second node being compared.

    Return Values

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

    Note: Multiple elements with the same priority will get dequeued in no particular order.


    SEO Tutorial / Articles





    Php / Mysql Tutorial



    Articles



      Portfolio


      SEO by Jainsachin