The SplPriorityQueue class

Introduction

The SplPriorityQueue class provides the main functionalities of an prioritized queue, implemented using a heap.

Class synopsis

SplPriorityQueue
SplPriorityQueue implements Iterator , Countable {
/* Methods */
void SplPriorityQueue::compare ( mixed $priority1 , mixed $priority1 )
void SplPriorityQueue::insert ( mixed $value , mixed $priority )
mixed SplPriorityQueue::key ( void )
void SplPriorityQueue::next ( void )
mixed SplPriorityQueue::top ( void )
}

Table of Contents


    

 

 

Home || Web Directroy || Web Designing || Get a Domain Name || Host your web site || Free Blogs || Free Tutorial || Free E-cards || Free GuestBook || Email