Method
addAfter
(LinkedList.Node<T> nodePrev, LinkedList.Node<T> tNode)
Source from the content-addressed store, hash-verified
| 43 | } |
| 44 | |
| 45 | public void addAfter(LinkedList.Node<T> nodePrev, LinkedList.Node<T> tNode) { |
| 46 | if (nodePrev == null) { |
| 47 | this.addFirst(tNode); |
| 48 | } else if (nodePrev == this.last) { |
| 49 | this.addLast(tNode); |
| 50 | } else { |
| 51 | this.checkParent(nodePrev); |
| 52 | this.checkNoParent(tNode); |
| 53 | LinkedList.Node<T> nodeNext = nodePrev.getNext(); |
| 54 | nodePrev.setNext(tNode); |
| 55 | tNode.setPrev(nodePrev); |
| 56 | nodeNext.setPrev(tNode); |
| 57 | tNode.setNext(nodeNext); |
| 58 | tNode.setParent(this); |
| 59 | ++this.size; |
| 60 | } |
| 61 | } |
| 62 | |
| 63 | public LinkedList.Node<T> remove(LinkedList.Node<T> tNode) { |
| 64 | this.checkParent(tNode); |