Custom iterator for custom list.

Question

I'm trying to write a custom iterator for custom linked list. What I don't understand is, whether the iterator should be in the link(node) inner-class or in the linked-list outer-class.
I seem to be getting errors in the outer-class, but in the inner-class it compiles fine. Whether or not it works is another story.
The code below is without errors in eclipse, however it doesn't make much sense to me to have the next() and hasNext() methods in the Node when the Iterator needs to iterate the list.
import java.util.*;
public class OctoList<T> extends AbstractCollection<T> implements Iterable<T>
    // Inner Class
    private class Octo<E>
        // Octo will be a Node with 8 elements not including size, and links.
        public Octo<T> next()
          if (!hasNext())
            throw new NoSuchElementException();
          current = current.next();
          return current;
        public boolean hasNext()
          return (current.next() != null);
    // outer class
    private Octo<T> head;
    private Octo<T> tail;
    private Octo<T> current = head;
    private final int ARRAY_SIZE = 8;
    @Override
    public Iterator<T> iterator()
        return null;
    @Override
    public int size()
        return 0;
    @Override
    public boolean isEmpty()
        return size() == 0;
}

Answer 1

Gcampton wrote:
I'm trying to write a custom iterator for custom linked list. What I don't understand is, whether the iterator should be in the link(node) inner-class or in the linked-list outer-class.In the list class. After all, you're iterating a list, not a node.
I seem to be getting errors in the outer-class, but in the inner-class it compiles fine. Whether or not it works is another story.Then you'll have to fix those errors so it both compiles and works as intended.
You can create the iterator as an inner class in the list.