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

Adds a value with its priority to the max-priority queue.

The examples focus on the operation itself, including the important distinction: extract removes the highest-priority entry.

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::insert(mixed $value, mixed $priority)

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.

Parameters

• value: required.
• priority: required.

Example 1: Basic Use

The queue is a max-priority queue; equal priorities have no guaranteed FIFO order. The insert 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->insert('urgent', 17);
echo json_encode($heap->top());

Output from a successful local PHP 8.4 run:

"urgent"

Example 2: Checking Behavior

The queue is a max-priority queue; equal priorities have no guaranteed FIFO order. The insert 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->insert('urgent', 18);
echo json_encode($heap->top());

Output from a successful local PHP 8.4 run:

"urgent"

Example 3: Practical Example

The queue is a max-priority queue; equal priorities have no guaranteed FIFO order. The insert 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->insert('urgent', 19);
echo json_encode($heap->top());

Output from a successful local PHP 8.4 run:

"task-19"

Important Behavior and Edge Cases

A higher priority wins; equal priorities are not guaranteed stable.

Comparison with Related Approaches

Common Beginner Mistakes

Key Takeaways

• Adds a value with its priority to the max-priority queue.
• A higher priority wins; equal priorities are not guaranteed stable.
• extract removes the highest-priority entry.

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