Gielfeldt\Iterators\RecursiveSortIterator

Complexity

Total Complexity

9

Size/Duplication

Total Lines	42
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Test Coverage

Coverage

100%

Importance

Changes

0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	8	3
A	getSortedIterator()	0	18	4
A	hasChildren()	0	4	1
A	getChildren()	0	4	1

<?php

namespace Gielfeldt\Iterators;

class RecursiveSortIterator extends SortIterator implements \RecursiveIterator
{
    protected $children = [];

    public function __construct(\Traversable $iterator, int $direction = self::SORT_ASC, int $flags = 0, callable $callback = self::SORT_CURRENT)
    {
        $iterator = $iterator instanceof \IteratorAggregate ? $iterator->getIterator() : $iterator;
        if (!$iterator instanceof \RecursiveIterator) {
            throw new \InvalidArgumentException('An instance of RecursiveIterator or IteratorAggregate creating it is required');
        }
        parent::__construct($iterator, $direction, $flags, $callback);
    }

    public function getSortedIterator($iterator)
    {
        $sortedIterator = new \RecursiveArrayIterator();
        $sorted = [];
        foreach ($iterator as $key => $value) {
            if ($iterator->hasChildren()) {
                $this->children[$key] = $iterator->getChildren();
            }
            $sorted[] = $this->generateElement($key, $value, $iterator);
        }

        usort($sorted, $this->realCallback);

        foreach ($sorted as $data) {
            $sortedIterator->append($data);
        }
        return $sortedIterator;
    }

    public function hasChildren()
    {
        return isset($this->children[$this->key()]);
    }

    public function getChildren()
    {
        return new self($this->children[$this->key()], $this->direction, $this->flags, $this->callback);
    }
}