return current.nextNode ();
Node ret = current.nextNode (); current = null; return ret;
    public Node item(int index)    {      if (current == null)        {          current = createIterator();          lastIndex = -1;        }            // last node or before?  go backwards      if (index <= lastIndex) {        while (index != lastIndex) {          current.previousNode ();          lastIndex--;        }        return current.previousNode ();      }             // somewhere after last node      while (++lastIndex != index)        current.nextNode ();        return current.nextNode ();    }