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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
<?php /* * This file is part of the php-code-coverage package. * * (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;
/** * Recursive iterator for node object graphs. */ class Iterator implements \RecursiveIterator { /** * @var int */ private $position;
/** * @var AbstractNode[] */ private $nodes;
/** * @param Directory $node */ public function __construct(Directory $node) { $this->nodes = $node->getChildNodes(); }
/** * Rewinds the Iterator to the first element. */ public function rewind() { $this->position = 0; }
/** * Checks if there is a current element after calls to rewind() or next(). * * @return bool */ public function valid() { return $this->position < count($this->nodes); }
/** * Returns the key of the current element. * * @return int */ public function key() { return $this->position; }
/** * Returns the current element. * * @return \PHPUnit_Framework_Test */ public function current() { return $this->valid() ? $this->nodes[$this->position] : null; }
/** * Moves forward to next element. */ public function next() { $this->position++; }
/** * Returns the sub iterator for the current element. * * @return Iterator */ public function getChildren() { return new self( $this->nodes[$this->position] ); }
/** * Checks whether the current element has children. * * @return bool */ public function hasChildren() { return $this->nodes[$this->position] instanceof Directory; } }
|