package dictionary;

import java.util.Arrays;
import java.util.Iterator;
import java.util.NoSuchElementException;

/**
   A class that implements the ADT dictionary by using a resizable array.
   The dictionary is unsorted and has distinct search keys.
  
   @author Frank M. Carrano
   @author Timothy M. Henry
   @version 4.0
*/
public class ArrayDictionary<K, V> implements DictionaryInterface<K, V>
{
	protected Entry<K, V>[] dictionary; // Array of unsorted entries
	protected int numberOfEntries;
   	private boolean initialized = false;
	private final static int DEFAULT_CAPACITY = 25;
	private static final int MAX_CAPACITY = 10000;
	
	public ArrayDictionary()
	{
		this(DEFAULT_CAPACITY);        // Call next constructor
	} // end default constructor
	
	public ArrayDictionary(int initialCapacity)
	{
      checkCapacity(initialCapacity);
		// The cast is safe because the new array contains null entries
      @SuppressWarnings("unchecked")
      Entry<K, V>[] tempDictionary = (Entry<K, V>[])new Entry[initialCapacity];
      dictionary = tempDictionary;
	  numberOfEntries = 0;
      initialized = true;
	} // end constructor

	public V add(K key, V value)
	{
		checkInitialization();
		if ((key == null) || (value == null))
			throw new IllegalArgumentException("Cannot add null to a dictionary.");
		else
		{
			V result = null;
			int keyIndex = locateIndex(key);
			if (keyIndex < numberOfEntries)
			{
				// Key found, return and replace entry's value
				result = dictionary[keyIndex].getValue(); // Get old value
				dictionary[keyIndex].setValue(value); 		// Replace value
			}
			else // Key not found; add new entry to dictionary
			{
				// Add at end of array
				dictionary[numberOfEntries] = new Entry<>(key, value);
				numberOfEntries++;
				ensureCapacity(); // Ensure enough room for next add
			} // end if
			return result;
		} // end if
	} // end add

	// Returns the array index of the entry that contains key, or
	// returns numberOfEntries if no such entry exists.
	private int locateIndex(K key)
	{
		// Sequential search
		int index = 0;
		while ( (index < numberOfEntries) && !key.equals(dictionary[index].getKey()) )
			index++;
		return index;
	} // end locateIndex

	public V remove(K key)
	{
		checkInitialization();
		V result = null;
		int keyIndex = locateIndex(key);
		if (keyIndex < numberOfEntries)
		{
			// Key found; remove entry and return its value
			result = dictionary[keyIndex].getValue();
			dictionary[keyIndex] = dictionary[numberOfEntries - 1];
			dictionary[numberOfEntries - 1] = null;
			numberOfEntries--;
		} // end if
		// Else result is null
		return result;
	} // end remove

	public V getValue(K key)
	{
		checkInitialization();
		V result = null;
		int keyIndex = locateIndex(key);
		if (keyIndex < numberOfEntries)
		{
			result = dictionary[keyIndex].getValue(); // Key found; return value
		} // end if
		return result;
	} // end getValue

	public boolean contains(K key)
	{
		return getValue(key) != null;
	} // end contains

	public boolean isEmpty()
	{
		return numberOfEntries == 0;
	} // end isEmpty

	public int getSize()
	{
		return numberOfEntries;
	} // end getSize

	public final void clear()
	{
		checkInitialization();
		// Clear entries but retain array; no need to create a new array
		for (int index = 0; index < numberOfEntries; index++)
			dictionary[index] = null;
		numberOfEntries = 0;
	} // end clear

	protected void ensureCapacity()
	{
		if (numberOfEntries >= dictionary.length)
		{
			int newCapacity = 2 * dictionary.length;
			checkCapacity(newCapacity);
			dictionary = Arrays.copyOf(dictionary, newCapacity);
		} // end if
	} // end ensureCapacity

	// Throws an exception if this object is not initialized.
	protected void checkInitialization()
	{
		if (!initialized)
		{
			throw new SecurityException ("ArrayDictionary object is not initialized properly.");
		}
	}

	// Throws an exception if the client requests a capacity that is too large.
	protected void checkCapacity(int capacity)
	{
		if (capacity > MAX_CAPACITY)
		{
			throw new IllegalStateException("Attempt to create a HashedDictionary " +
					"whose capacity exceeds " +
					"allowed maximum.");
		}
	}


	public Iterator<K> getKeyIterator()
	{
		return new KeyIterator();
	} // end getKeyIterator

	public Iterator<V> getValueIterator()
	{
		return new ValueIterator();
	} // end getValueIterator

	protected class Entry<S, T>
	{
		private S key;
		private T value;

		protected Entry(S searchKey, T dataValue)
		{
         key = searchKey;
         value = dataValue;
		} // end constructor

		protected S getKey()
		{
			return key;
		} // end getKey

		protected T getValue()
		{
			return value;
		} // end getValue

		protected void setValue(T dataValue)
		{
		 	value = dataValue;
		} // end setValue
	} // end Entry



	// Since iterators implement Iterator, methods must be public.
	// Same as SortedArrayDictionary.

	private class KeyIterator implements Iterator<K>
	{
		private int currentIndex;

		private KeyIterator()
		{
			currentIndex = 0;
		} // end default constructor

		public boolean hasNext()
		{
			return currentIndex < numberOfEntries;
		} // end hasNext

		public K next()
		{
			K result = null;
			if (hasNext())
			{
				Entry<K,V> currentEntry = dictionary[currentIndex];
				result = currentEntry.getKey();
				currentIndex++;
			}
			else
			{
				throw new NoSuchElementException();
			} // end if
			return result;
		} // end next

		public void remove()
		{
			throw new UnsupportedOperationException();
		} // end remove

	} // end KeyIterator

	private class ValueIterator implements Iterator<V>
	{
		private int currentIndex;

		private ValueIterator()
		{
			currentIndex = 0;
		} // end default constructor

		public boolean hasNext()
		{
			return currentIndex < numberOfEntries;
		} // end hasNext

		public V next()
		{
			V result = null;
			if (hasNext())
			{
				Entry<K,V> currentEntry = dictionary[currentIndex];
				result = currentEntry.getValue();
				currentIndex++;
			}
			else
			{
				throw new NoSuchElementException();
			} // end if
			return result;
		} // end next

		public void remove()
		{
			throw new UnsupportedOperationException();
		} // end remove

	} // end getValueIterator

} // end dictionary.ArrayDictionary