title: Is linkedList.listIterator(linkedList.size()) optimized?
body: <p>I'm trying to create a reverse <code>ListIterator</code> for a <code>LinkedList</code>, and was going to just implement it as a wrapper to <code>linkedList.listIterator(linkedList.size())</code> that swaps the <code>next</code> and <code>previous</code> operations, but then realized that if <code>LinkedList#listIterator(int)</code> is implemented to just traverse forwards to the position specified, using it to start at the end would be terribly unoptimized, having to traverse the list twice rather than once, when the list supports going directly to the end. Is <code>linkedList.listIterator(linkedList.size())</code> optimized to not traverse the entire list?</p>