private void removeNext(Node<T> prev) { Node<T> node = prev.getNext(); prev.setNext(node.getNext()); node.setItem(null); node.setNext(null); size.decrementAndGet(); }
public void addLast(Item item) { if (item == null) { throw new NullPointerException(); } if (isEmpty()) { last = new Node(); last.setItem(item); last.setPrev(first); last.setNext(null); first = last; } else { Node newItem = new Node(); newItem.setItem(item); newItem.setPrev(last); last.setNext(newItem); newItem.setNext(null); last = newItem; } count++; }
public void add(T item) { Node<T> node = new Node<>(); node.setItem(item); // is empty ? if (first == null) { first = node; last = first; } else { last.setNext(node); last = node; } size.incrementAndGet(); }
@Override public boolean add(T e) { if (pj.contains(e)) { return false; } Node newNode = new Node(e); newNode.setItem(e); if (getHead() == null) { setHead(newNode); } else { Node last = getLastNode(); last.setNext(newNode); } return true; }