| Total Complexity | 7 |
| Total Lines | 72 |
| Duplicated Lines | 0 % |
| Coverage | 100% |
| Changes | 1 | ||
| Bugs | 0 | Features | 0 |
| 1 | <?php |
||
| 21 | class BoxList implements IteratorAggregate |
||
| 22 | { |
||
| 23 | /** |
||
| 24 | * List containing boxes. |
||
| 25 | * |
||
| 26 | * @var Box[] |
||
| 27 | */ |
||
| 28 | private $list = []; |
||
| 29 | |||
| 30 | /** |
||
| 31 | * Has this list already been sorted? |
||
| 32 | * |
||
| 33 | * @var bool |
||
| 34 | */ |
||
| 35 | private $isSorted = false; |
||
| 36 | |||
| 37 | /** |
||
| 38 | * Do a bulk create. |
||
| 39 | * |
||
| 40 | * @param Box[] $boxes |
||
| 41 | * |
||
| 42 | * @return BoxList |
||
| 43 | */ |
||
| 44 | 2 | public static function fromArray(array $boxes, bool $preSorted = false): self |
|
| 45 | { |
||
| 46 | 2 | $list = new static(); |
|
| 47 | 2 | $list->list = $boxes; |
|
| 48 | 2 | $list->isSorted = $preSorted; |
|
| 49 | |||
| 50 | 2 | return $list; |
|
| 51 | } |
||
| 52 | |||
| 53 | /** |
||
| 54 | * @return Traversable|Box[] |
||
| 55 | */ |
||
| 56 | 34 | public function getIterator(): Traversable |
|
| 57 | { |
||
| 58 | 34 | if (!$this->isSorted) { |
|
| 59 | 33 | usort($this->list, [$this, 'compare']); |
|
| 60 | 33 | $this->isSorted = true; |
|
| 61 | } |
||
| 62 | |||
| 63 | 34 | return new ArrayIterator($this->list); |
|
| 64 | } |
||
| 65 | |||
| 66 | 31 | public function insert(Box $item): void |
|
| 69 | 31 | } |
|
| 70 | |||
| 71 | /** |
||
| 72 | * @param Box $boxA |
||
| 73 | * @param Box $boxB |
||
| 74 | */ |
||
| 75 | 17 | public static function compare($boxA, $boxB): int |
|
| 93 | } |
||
| 94 | } |
||
| 95 |