@@ 93-96 (lines=4) @@ | ||
90 | ||
91 | $current = $this->head; |
|
92 | $i = 0; |
|
93 | while($i < $index && $current->next !== null) { |
|
94 | $current = $current->next; |
|
95 | $i++; |
|
96 | } |
|
97 | ||
98 | return $current; |
|
99 | } |
|
@@ 232-236 (lines=5) @@ | ||
229 | $i = 0; |
|
230 | $current = $this->head; |
|
231 | $prev = $current; |
|
232 | while($i < $index && $current->next !== null) { |
|
233 | $prev = $current; |
|
234 | $current = $current->next; |
|
235 | $i++; |
|
236 | } |
|
237 | ||
238 | $prev->next = &$newNode; |
|
239 | $newNode->next = &$current; |
|
@@ 275-278 (lines=4) @@ | ||
272 | $i = 0; |
|
273 | $current = $this->head; |
|
274 | $prev = $current; |
|
275 | while($i < $index && $current->next !== null) { |
|
276 | $prev = $current; |
|
277 | $current = $current->next; |
|
278 | } |
|
279 | ||
280 | if($index === $this->size - 1) { |
|
281 | $prev->next = null; |