(Node child)
| 289 | } |
| 290 | |
| 291 | public void removeChild(Node child) { |
| 292 | Node prev = getChildBefore(child); |
| 293 | if (prev == null) first = first.next; |
| 294 | else prev.next = child.next; |
| 295 | if (child == last) last = prev; |
| 296 | child.next = null; |
| 297 | } |
| 298 | |
| 299 | public void replaceChild(Node child, Node newChild) { |
| 300 | if (child == newChild) return; |