PrioritizedList.php
1.6 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
67
68
69
70
71
72
73
<?php
declare(strict_types=1);
/*
* This file is part of the league/commonmark package.
*
* (c) Colin O'Dell <colinodell@gmail.com>
*
* Original code based on the CommonMark JS reference parser (https://bitly.com/commonmark-js)
* - (c) John MacFarlane
*
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*/
namespace League\CommonMark\Util;
/**
* @internal
*
* @phpstan-template T
* @phpstan-implements \IteratorAggregate<T>
*/
final class PrioritizedList implements \IteratorAggregate
{
/**
* @var array<int, array<mixed>>
* @phpstan-var array<int, array<T>>
*/
private array $list = [];
/**
* @var \Traversable<mixed>|null
* @phpstan-var \Traversable<T>|null
*/
private ?\Traversable $optimized = null;
/**
* @param mixed $item
*
* @phpstan-param T $item
*/
public function add($item, int $priority): void
{
$this->list[$priority][] = $item;
$this->optimized = null;
}
/**
* @return \Traversable<int, mixed>
*
* @phpstan-return \Traversable<int, T>
*/
#[\ReturnTypeWillChange]
public function getIterator(): \Traversable
{
if ($this->optimized === null) {
\krsort($this->list);
$sorted = [];
foreach ($this->list as $group) {
foreach ($group as $item) {
$sorted[] = $item;
}
}
$this->optimized = new \ArrayIterator($sorted);
}
return $this->optimized;
}
}