MartanLV /
koki
| Total Complexity | 56 |
| Total Lines | 231 |
| Duplicated Lines | 0 % |
| Changes | 0 | ||
Complex classes like Node often do a lot of different things. To break such a class down, we need to identify a cohesive component within that class. A common approach to find such a component is to look for fields/methods that share the same prefixes, or suffixes.
Once you have determined the fields that belong together, you can apply the Extract Class refactoring. If the component makes sense as a sub-class, Extract Subclass is also a candidate, and is often faster.
While breaking up the class, it is a good idea to analyze how other classes use Node, and based on these observations, apply Extract Interface, too.
| 1 | <?php |
||
| 12 | class Node |
||
| 13 | { |
||
| 14 | public $root; |
||
| 15 | /** |
||
| 16 | * @var Interval |
||
| 17 | */ |
||
| 18 | public $interval; |
||
| 19 | /** |
||
| 20 | * @var int |
||
| 21 | */ |
||
| 22 | public $max; |
||
| 23 | /** |
||
| 24 | * @var Node |
||
| 25 | */ |
||
| 26 | public $left; |
||
| 27 | /** |
||
| 28 | * @var Node |
||
| 29 | */ |
||
| 30 | public $right; |
||
| 31 | |||
| 32 | /** |
||
| 33 | * undocumented function. |
||
| 34 | * |
||
| 35 | * @return void |
||
| 36 | */ |
||
| 37 | public function __construct(IntervalInterface $interval, $left = null, $right = null, $max = 0) |
||
| 38 | { |
||
| 39 | $this->interval = $interval; |
||
|
|
|||
| 40 | $this->left = $left; |
||
| 41 | $this->right = $right; |
||
| 42 | $this->max = $max ? $max : $interval->getEnd(); |
||
| 43 | } |
||
| 44 | |||
| 45 | /** |
||
| 46 | * returns intervals that fall within interval range. |
||
| 47 | * |
||
| 48 | * @return void |
||
| 49 | */ |
||
| 50 | public function all(): array |
||
| 51 | { |
||
| 52 | return iterator_to_array($this->yieldAll(), false); |
||
| 53 | } |
||
| 54 | |||
| 55 | /** |
||
| 56 | * undocumented function. |
||
| 57 | * |
||
| 58 | * @return void |
||
| 59 | */ |
||
| 60 | public function yieldAll() |
||
| 61 | { |
||
| 62 | return $this->yieldSelect(-1, $this->max + 1); |
||
| 63 | } |
||
| 64 | |||
| 65 | /** |
||
| 66 | * returns intervals that touches a given range. |
||
| 67 | * |
||
| 68 | * @return void |
||
| 69 | */ |
||
| 70 | public function interSelectNode(int $low, int $high): array |
||
| 71 | { |
||
| 72 | return iterator_to_array($this->yieldInterSelectNode($low, $high), false); |
||
| 73 | } |
||
| 74 | /** |
||
| 75 | * returns intervals that touches a given range. |
||
| 76 | * |
||
| 77 | * @return void |
||
| 78 | */ |
||
| 79 | public function interSelect(int $low, int $high): array |
||
| 80 | { |
||
| 81 | return iterator_to_array($this->yieldInterSelect($low, $high), false); |
||
| 82 | } |
||
| 83 | |||
| 84 | /** |
||
| 85 | * returns intervals that fall within interval range. |
||
| 86 | * |
||
| 87 | * @return void |
||
| 88 | */ |
||
| 89 | public function select(int $low, int $high): array |
||
| 90 | { |
||
| 91 | return iterator_to_array($this->yieldSelect($low, $high), false); |
||
| 92 | } |
||
| 93 | |||
| 94 | public function selectNode(int $low, int $high): array |
||
| 97 | } |
||
| 98 | /** |
||
| 99 | * returns intervals that touches a given range. |
||
| 100 | * |
||
| 101 | * @return generator |
||
| 102 | */ |
||
| 103 | public function yieldInterSelectNode(int $low, int $high) |
||
| 121 | } |
||
| 122 | } |
||
| 123 | /** |
||
| 124 | * returns intervals that touches a given range. |
||
| 125 | * |
||
| 126 | * @return generator |
||
| 127 | */ |
||
| 128 | public function yieldInterSelect(int $low, int $high) |
||
| 129 | { |
||
| 130 | $edgeR = $high >= $this->interval->getStart() && $high <= $this->interval->getEnd(); |
||
| 131 | $edgeL = $low >= $this->interval->getStart() && $low <= $this->interval->getEnd(); |
||
| 132 | $part = $this->interval->getStart() >= $low && $this->interval->getEnd() <= $high; |
||
| 133 | $whole = $this->interval->getStart() <= $low && $this->interval->getEnd() >= $high; |
||
| 134 | |||
| 135 | $currentNodeMatches = $edgeR || $edgeL || $part || $whole; |
||
| 136 | if ($currentNodeMatches) { |
||
| 137 | yield $this->interval; |
||
| 138 | } |
||
| 139 | |||
| 140 | if ($this->right && $this->interval->getStart() <= $high) { |
||
| 141 | yield from $this->right->yieldInterSelect($low, $high); |
||
| 142 | } |
||
| 143 | |||
| 144 | if ($this->left && $this->left->max >= $low) { |
||
| 145 | yield from $this->left->yieldInterSelect($low, $high); |
||
| 146 | } |
||
| 147 | } |
||
| 148 | |||
| 149 | /** |
||
| 150 | * returns intervals that fall within interval range. |
||
| 151 | * |
||
| 152 | * @return generator |
||
| 153 | */ |
||
| 154 | public function yieldSelectNode(int $low, int $high) |
||
| 155 | { |
||
| 156 | /* |
||
| 157 | * does current node matches? |
||
| 158 | */ |
||
| 159 | if ($this->interval->getEnd() < $high && $this->interval->getStart() > $low) { |
||
| 160 | yield $this; |
||
| 161 | } |
||
| 162 | |||
| 163 | /* |
||
| 164 | * since the node's low value is less than the "select end" value, |
||
| 165 | * we must search in the right subtree. If it exists. |
||
| 166 | */ |
||
| 167 | if ($this->right && $this->interval->getStart() < $high) { |
||
| 168 | yield from $this->right->yieldSelectNode($low, $high); |
||
| 169 | } |
||
| 170 | /* |
||
| 171 | * If the left subtree's max exceeds the quiery's low value, |
||
| 172 | * so we must search the left subtree as well. |
||
| 173 | */ |
||
| 174 | if ($this->left && $this->left->max > $low) { |
||
| 175 | yield from $this->left->yieldSelectNode($low, $high); |
||
| 176 | } |
||
| 177 | } |
||
| 178 | |||
| 179 | /** |
||
| 180 | * returns intervals that fall within interval range. |
||
| 181 | * |
||
| 182 | * @return generator |
||
| 183 | */ |
||
| 184 | public function yieldSelect(int $low, int $high) |
||
| 185 | { |
||
| 186 | /* |
||
| 187 | * does current node matches? |
||
| 188 | */ |
||
| 189 | if ($this->interval->getEnd() < $high && $this->interval->getStart() > $low) { |
||
| 190 | yield $this->interval; |
||
| 191 | } |
||
| 192 | |||
| 193 | /* |
||
| 194 | * since the node's low value is less than the "select end" value, |
||
| 195 | * we must search in the right subtree. If it exists. |
||
| 196 | */ |
||
| 197 | if ($this->right && $this->interval->getStart() < $high) { |
||
| 198 | yield from $this->right->yieldSelect($low, $high); |
||
| 199 | } |
||
| 200 | /* |
||
| 201 | * If the left subtree's max exceeds the quiery's low value, |
||
| 202 | * so we must search the left subtree as well. |
||
| 203 | */ |
||
| 204 | if ($this->left && $this->left->max > $low) { |
||
| 205 | yield from $this->left->yieldSelect($low, $high); |
||
| 206 | } |
||
| 207 | } |
||
| 208 | |||
| 209 | public function remove() |
||
| 210 | { |
||
| 211 | if ($this->max > $i->getEnd()) { |
||
| 212 | if ($this->left) { |
||
| 213 | $this->left->add($i); |
||
| 214 | } else { |
||
| 215 | $this->left = new Node($i); |
||
| 216 | } |
||
| 217 | } else { |
||
| 218 | $this->max = $i->getEnd(); |
||
| 219 | if ($this->right) { |
||
| 220 | $this->right->add($i); |
||
| 221 | } else { |
||
| 222 | $this->right = new Node($i); |
||
| 223 | } |
||
| 224 | } |
||
| 225 | } |
||
| 226 | |||
| 227 | public function add(IntervalInterface $i) |
||
| 243 | } |
||
| 244 | } |
||
| 245 | } |
||
| 246 | } |
||
| 247 |
Loading history...
Our type inference engine has found a suspicous assignment of a value to a property. This check raises an issue when a value that can be of a given class or a super-class is assigned to a property that is type hinted more strictly.
Either this assignment is in error or an instanceof check should be added for that assignment.