diff options
| author | Andrew Dolgov <fox@fakecake.org> | 2026-05-25 14:12:01 +0300 |
|---|---|---|
| committer | Andrew Dolgov <fox@fakecake.org> | 2026-05-25 14:12:01 +0300 |
| commit | 9600be1703ba3083c38386930fa940938394f53e (patch) | |
| tree | a8fcbc476914881915eab236ee99f88459dfb09b /vendor/phpunit/php-code-coverage/src/Node/Iterator.php | |
| parent | cae514dddfc59f533a93a47afc283371d5949843 (diff) | |
| download | the-epube-9600be1703ba3083c38386930fa940938394f53e.tar.gz the-epube-9600be1703ba3083c38386930fa940938394f53e.tar.xz | |
add phpunit
Diffstat (limited to 'vendor/phpunit/php-code-coverage/src/Node/Iterator.php')
| -rw-r--r-- | vendor/phpunit/php-code-coverage/src/Node/Iterator.php | 90 |
1 files changed, 90 insertions, 0 deletions
diff --git a/vendor/phpunit/php-code-coverage/src/Node/Iterator.php b/vendor/phpunit/php-code-coverage/src/Node/Iterator.php new file mode 100644 index 0000000..0d1c735 --- /dev/null +++ b/vendor/phpunit/php-code-coverage/src/Node/Iterator.php @@ -0,0 +1,90 @@ +<?php declare(strict_types=1); +/* + * This file is part of phpunit/php-code-coverage. + * + * (c) Sebastian Bergmann <sebastian@phpunit.de> + * + * For the full copyright and license information, please view the LICENSE + * file that was distributed with this source code. + */ +namespace SebastianBergmann\CodeCoverage\Node; + +use function count; +use RecursiveIterator; + +/** + * @internal This class is not covered by the backward compatibility promise for phpunit/php-code-coverage + */ +final class Iterator implements RecursiveIterator +{ + /** + * @var int + */ + private $position; + + /** + * @var AbstractNode[] + */ + private $nodes; + + public function __construct(Directory $node) + { + $this->nodes = $node->children(); + } + + /** + * Rewinds the Iterator to the first element. + */ + public function rewind(): void + { + $this->position = 0; + } + + /** + * Checks if there is a current element after calls to rewind() or next(). + */ + public function valid(): bool + { + return $this->position < count($this->nodes); + } + + /** + * Returns the key of the current element. + */ + public function key(): int + { + return $this->position; + } + + /** + * Returns the current element. + */ + public function current(): ?AbstractNode + { + return $this->valid() ? $this->nodes[$this->position] : null; + } + + /** + * Moves forward to next element. + */ + public function next(): void + { + $this->position++; + } + + /** + * Returns the sub iterator for the current element. + */ + public function getChildren(): self + { + return new self($this->nodes[$this->position]); + } + + /** + * Checks whether the current element has children. + */ + public function hasChildren(): bool + { + return $this->nodes[$this->position] instanceof Directory; + } +} |
