A hash table implementation of the DictionaryADT interface. Using chaining. Only

Question

A hash table implementation of the DictionaryADT interface. Using chaining.

Only public functions are the ones in dictionary adt. Don't use the default hashcode() instead replace it with a exponential hashcode.

import java.util.Iterator;

import java.util.NoSuchElementException;

public interface DictionaryADT<K,V> {

// Returns true if the dictionary has an object identified by

// key in it, otherwise false.

public boolean contains(K key);

// Adds the given key/value pair to the dictionary. Returns

// false if the dictionary is full, or if the key is a duplicate.

// Returns true if addition succeeded.

public boolean insert(K key, V value);

// Deletes the key/value pair identified by the key parameter.

// Returns true if the key/value pair was found and removed,

// otherwise false.

public boolean remove(K key);

// Returns the value associated with the parameter key. Returns

// null if the key is not found or the dictionary is empty.

public V getValue(K key);

// Returns the key associated with the parameter value. Returns

// null if the value is not found in the dictionary. If more

// than one key exists that matches the given value, returns the

// first one found.

public K getKey(V value);

// Returns the number of key/value pairs currently stored

// in the dictionary

public int size();

// Returns true if the dictionary is at max capacity

public boolean isFull();

// Returns true if the dictionary is empty

public boolean isEmpty();

// Returns the Dictionary object to an empty state.

public void clear();

// Returns an Iterator of the keys in the dictionary, in ascending

// sorted order. The iterator must be fail-fast.

public Iterator<K> keys();

// Returns an Iterator of the values in the dictionary. The

// order of the values must match the order of the keys.

// The iterator must be fail-fast.

public Iterator<V> values();

}

Explanation / Answer

package data_structures;

import java.util.Iterator;

import java.util.NoSuchElementException;

public class UnorderedList<E> implements Iterable<E>

{

public E find(E object)

{

Node<E> current=head;

Node<E> previous = head;

Node<E> temp=null;

while(current!=null && ((Comparable<E>)object).compareTo((current.data))!=0)

{

previous=current;

current=current.next;

temp=current;

}

return temp.data;

}

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.