PriorityQueue is similar to a Queue data structure. The elements of the priority queue are pushed into the queue with a given priority. The highest priority element will always been present at the front of the queue. The priority queue is implemented using the max heap.
Requirements: PHP 7 is required for both extension and the compatibility polyfill.
Installation: The easiest way to install data structure by using the PECL extension.
pecl install ds
Syntax:
public Ds\PriorityQueue::functionName()
Example: Below programs illustrate the Ds\PriorityQueue::count() Function in PHP:
PHP
<?php
$pq = new \Ds\PriorityQueue();
$pq ->push( "One" , 1);
$pq ->push( "Two" , 2);
$pq ->push( "Three" , 3);
print_r( $pq -> count ());
?>
|
Output:
3
Complete list of PHP Ds\PriorityQueue Functions:
PHP Ds\PriorityQueue Functions
|
Description
|
allocate() |
Allocate memory for a PriorityQueue class instance |
capacity() |
Check the current capacity of a PriorityQueue instance. |
clear() |
Clear all of the elements from a PriorityQueue instance. |
copy() |
Create a shallow copy of a particular PriorityQueue instance. |
count() |
Get the count of elements present in a Priority Queue instance. |
peek() |
Get the value present at the front of a PriorityQueue. |
pop() |
Remove and return the value present at the top of the PriorityQueue. |
push() |
Push or insert values in a PriorityQueue instance. |
toArray() |
Convert a PriorityQueue into an associative array in PHP. |
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!