Repository navigation
Expand file tree
/
Copy pathSplPriorityQueue.php
More file actions
66 lines (59 loc) · 1.52 KB
/
Copy pathSplPriorityQueue.php
File metadata and controls
66 lines (59 loc) · 1.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
<?php
declare(strict_types=1);
/**
* This file is part of Hyperf.
*
* @link https://www.hyperf.io
* @document https://hyperf.wiki
* @contact [email protected]
* @license https://github.com/hyperf/hyperf/blob/master/LICENSE
*/
namespace Hyperf\Stdlib;
use ReturnTypeWillChange;
use const PHP_INT_MAX;
/**
* Serializable version of SplPriorityQueue.
*
* Also, provides predictable heap order for datums added with the same priority
* (i.e., they will be emitted in the same order they are enqueued).
*
* @template TValue
* @template TPriority
* @extends \SplPriorityQueue<TPriority, TValue>
*/
class SplPriorityQueue extends \SplPriorityQueue
{
/**
* Seed used to ensure queue order for items of the same priority.
*/
protected int $serial = PHP_INT_MAX;
/**
* Insert a value with a given priority.
*
* Utilizes {@var to $serial} ensure that values of equal priority are
* emitted in the same order in which they are inserted.
*
* @param TValue $value
* @param TPriority $priority
*/
#[ReturnTypeWillChange]
public function insert(mixed $value, mixed $priority): bool
{
return parent::insert($value, [$priority, $this->serial--]);
}
/**
* Serialize to an array.
*
* Array will be priority => data pairs
*
* @return list<TValue>
*/
public function toArray(): array
{
$array = [];
foreach (clone $this as $item) {
$array[] = $item;
}
return $array;
}
}