// Helene Martin, CSE 143
// A LinkedIntList object represents an ordered list of linked nodes.  
// Like ArrayIntList, LinkedIntList is an implementation of the List ADT.

// Today's version added:
//* generics so that we can store any type of value
//* a common abstract class and interface so that ArrayList and LinkedList can 
// be used interchangeably in client code.
public class LinkedList<E> extends AbstractList<E> {
	private ListNode front;

	// Constructs an empty list.
	public LinkedList() {
		front = null;
	}

	// Adds a value at a given index.
	// pre: 0 <= index <= size
	// Throws a NullPointerException if index > size.
	public void add(int index, E value) {
		if (index == 0) {
			front = new ListNode(value, front);
		} else {
			ListNode current = front;
			for (int i = 0; i < index - 1; i++) {
				current = current.next;
			}
			ListNode temp = new ListNode(value, current.next);
			current.next = temp;
			// also ok: current.next = new ListNode(value, current.next);
		}
	}

	// Sets the given index to store the given value.
	// pre: 0 <= index < size, throws ArrayIndexOutOfBoundsException otherwise
	public void set(int index, E value) {
		if (index < 0 || index >= size()) {
			throw new ArrayIndexOutOfBoundsException();
		}
		ListNode current = front;
		for (int i = 0; i < index; i++) {
			current = current.next;
		}
		current.data = value;
	}

	// Returns the value at a given index
	// pre: 0 <= index < number of nodes; front != null
	// throws NullPointerException if index > size.
	public E get(int index) {
		ListNode current = front;
		for (int i = 0; i < index; i++) {
			current = current.next;
		}
		return current.data;
	}

	// Removes the value at the given index.
	// Pre: 0 <= index < size
	// Throws a NullPointerException if index > size.
	public void remove(int index) {
		if (index == 0) {
			front = front.next;
		} else {
			ListNode current = front;
			for (int i = 0; i < index - 1; i++) {
				current = current.next;
			}
			current.next = current.next.next;
		}
	}

	// Returns the index of the first occurrence of the given value in the list,
	// or -1 if the value is not found in the list.
	public int indexOf(E value) {
		int index = 0;
		ListNode current = front;
		while (current != null) {
			if (current.data.equals(value)) {
				return index;
			}
			index++;
			current = current.next;
		}
		return -1;
	}

	// Returns the size of this list (inefficient -- could use a size field).
	public int size() {
		ListNode current = front;
		int count = 0;
		while (current != null) {
			current = current.next;
			count++;
		}
		return count;
	}

	// Returns a comma-separated String representation of this list.
	public String toString() {
		if (front == null) {
			return "~[]";
		} else {
			String result = "~[" + front.data;
			ListNode current = front.next;
			while (current != null) {
				result += ", " + current.data;
				current = current.next;
			}
			result += "]";
			return result;
		}
	}

	// A ListNode represents a single node in a linked list. It stores an
	// integer
	// value and a link to the next node.
	private class ListNode {
		public E data;
		public ListNode next;

		// Creates a ListNode with the specified integer data and next node.
		public ListNode(E data, ListNode next) {
			this.data = data;
			this.next = next;
		}
	}
}