(Node child)
| 212 | } |
| 213 | |
| 214 | public Node getChildBefore(Node child) { |
| 215 | if (child == first) return null; |
| 216 | Node n = first; |
| 217 | while (n.next != child) { |
| 218 | n = n.next; |
| 219 | if (n == null) throw new RuntimeException("node is not a child"); |
| 220 | } |
| 221 | return n; |
| 222 | } |
| 223 | |
| 224 | public Node getLastSibling() { |
| 225 | Node n = this; |
no outgoing calls
no test coverage detected