PHP SplPriorityQueue::next() Method: Usage and Examples

Consumes the current priority queue item and advances to the next highest priority.

The examples focus on the operation itself, including the important distinction: top provides a non-destructive peek.

What It Does

Use the examples below to observe the behavior on a small dataset before extending it to application code.

Syntax and Return Value

SplPriorityQueue::next()

The displayed signature describes the API or identifies any correction or optional dependency. When a parameter is optional, supply it only when the task requires it.

Example 1: Basic Use

The queue is a max-priority queue; equal priorities have no guaranteed FIFO order. The next call is shown on a small, inspectable dataset.

<?php
$heap = new SplPriorityQueue();
$heap->insert('task-4', 4);
$heap->insert('task-12', 12);
$heap->insert('task-7', 7);
$heap->rewind();
$before = $heap->current();
$heap->next();
echo json_encode([$before, $heap->current()]);

Output from a successful local PHP 8.4 run:

["task-12","task-7"]

Example 2: Checking Behavior

The queue is a max-priority queue; equal priorities have no guaranteed FIFO order. The next call is shown on a small, inspectable dataset.

<?php
$heap = new SplPriorityQueue();
$heap->insert('task-2', 2);
$heap->insert('task-9', 9);
$heap->insert('task-5', 5);
$heap->insert('task-1', 1);
$heap->rewind();
$before = $heap->current();
$heap->next();
echo json_encode([$before, $heap->current()]);

Output from a successful local PHP 8.4 run:

["task-9","task-5"]

Example 3: Practical Example

The queue is a max-priority queue; equal priorities have no guaranteed FIFO order. The next call is shown on a small, inspectable dataset.

<?php
$heap = new SplPriorityQueue();
$heap->insert('task-19', 19);
$heap->insert('task-3', 3);
$heap->insert('task-11', 11);
$heap->rewind();
$before = $heap->current();
$heap->next();
echo json_encode([$before, $heap->current()]);

Output from a successful local PHP 8.4 run:

["task-19","task-11"]

Important Behavior and Edge Cases

Iterating a SplPriorityQueue drains it; clone the queue if values must be retained.

Comparison with Related Approaches

Common Beginner Mistakes

Key Takeaways

• Consumes the current priority queue item and advances to the next highest priority.
• Iterating a SplPriorityQueue drains it; clone the queue if values must be retained.
• top provides a non-destructive peek.

Use SplPriorityQueue::next when its documented behavior matches the problem. Test the relevant edge cases in your own runtime before deploying it.