I want to start at the end of the list and iterate it using ListIterators previous method
public void add(E obj) {
ListIterator <E> iter = theList.listIterator();
while (iter.hasNext()) {
if (obj.compareTo(iter.next()) < 0) {
iter.previous();
iter.add(obj);
return;
}
}
iter.add(obj);
}
Every time I run my test class it iterators from the beginning.
to get iterator in reverse order use method list.listIterator(int index) this method will return iterator from specified position, you should put size of list means last element index. after that you can use hasPrevious() and previous() method. this will work,
// declare arraylist
ArrayList<...> a = new ArrayList<...>();
// Add elements to list.
// Generate an iterator. Start just after the last element.
ListIterator li = a.listIterator(a.size());
// Iterate in reverse.
while(li.hasPrevious()) {
System.out.println(li.previous());
}
ListIterator, like all Iterators, always start at the beginning. The previous method allows for less constrained movement, but it still starts at the beginning. You overall intent is unclear, so it's possible you're coming at this the wrong way, but the most straightforward way for you would be to reorder the list first and then do your iteration.
UPDATE Nevermind, Rajj has it.
In Java 21 and later:
myList.reversed().listIterator()
SequencedCollection#reversedIn Java 21+, List is a SequencedCollection. That brings the method reversed, returning a reverse-ordered view of this collection.
for ( Person person : persons.reversed() )
{
IO.println( person ) ;
}
If you really need an Iterator, use this:
ListIterator < Person > personsIterator = persons.reversed().listIterator() ;
…
ReverseListIteratorthat can traverse from the last element backwards.