Implement basic functionality of MyHashTable

This commit is contained in:
Manuel Thalmann 2022-11-16 21:53:44 +01:00
parent aaea1a9d87
commit 11983e0f08

View file

@ -6,37 +6,69 @@ import java.util.Set;
@SuppressWarnings("unchecked") @SuppressWarnings("unchecked")
public class MyHashtable<K, V> implements Map<K, V> { public class MyHashtable<K, V> implements Map<K, V> {
private int capacity;
private int size;
private K[] keys = (K[]) new Object[10]; private K[] keys = (K[]) new Object[10];
private V[] values = (V[]) new Object[10]; private V[] values = (V[]) new Object[10];
public MyHashtable(int size) {
capacity = size;
clear();
}
private boolean hashEquals(Object x, Object y) {
if (x == null || y == null) {
return x == y;
} else {
return x.hashCode() == y.hashCode();
}
}
private int hash(Object k) { private int hash(Object k) {
int h = Math.abs(k.hashCode()); int h = Math.abs(k.hashCode());
return h % keys.length; return h % keys.length;
} }
public MyHashtable(int size) {
// to be done
}
// Removes all mappings from this map (optional operation). // Removes all mappings from this map (optional operation).
public void clear() { public void clear() {
// to be done keys = (K[]) new Object[capacity];
throw new UnsupportedOperationException(); values = (V[]) new Object[capacity];
} }
// Associates the specified value with the specified key in this map (optional operation). // Associates the specified value with the specified key in this map (optional
// operation).
public V put(K key, V value) { public V put(K key, V value) {
// to be done int hashCode = hash(key);
throw new UnsupportedOperationException(); int index = hashCode;
for (int i = 0; keys[index] != null && !hashEquals(keys[index], key); i++) {
index = hash(hashCode + (int) Math.pow(i, 2));
}
if (keys[index] == null) {
size++;
}
keys[index] = key;
values[index] = value;
return value;
} }
// Returns the value to which this map maps the specified key. // Returns the value to which this map maps the specified key.
public V get(Object key) { public V get(Object key) {
// to be done // to be done
throw new UnsupportedOperationException(); for (int i = 0; i < keys.length; i++) {
if (hashEquals(key, keys[i])) {
return values[i];
}
} }
// Removes the mapping for this key from this map if present (optional operation). return null;
}
// Removes the mapping for this key from this map if present (optional
// operation).
public V remove(Object key) { public V remove(Object key) {
// to be done (Aufgabe 3) // to be done (Aufgabe 3)
throw new UnsupportedOperationException(); throw new UnsupportedOperationException();
@ -44,11 +76,11 @@ public class MyHashtable<K, V> implements Map<K, V> {
// Returns the number of key-value mappings in this map. // Returns the number of key-value mappings in this map.
public int size() { public int size() {
// to be done return size;
throw new UnsupportedOperationException();
} }
// UnsupportedOperationException =================================================================== // UnsupportedOperationException
// ===================================================================
// Returns a collection view of the values contained in this map. // Returns a collection view of the values contained in this map.
public Collection<V> values() { public Collection<V> values() {
throw new UnsupportedOperationException(); throw new UnsupportedOperationException();
@ -74,7 +106,8 @@ public class MyHashtable<K, V> implements Map<K, V> {
throw new UnsupportedOperationException(); throw new UnsupportedOperationException();
} }
// Copies all of the mappings from the specified map to this map (optional operation). // Copies all of the mappings from the specified map to this map (optional
// operation).
public void putAll(Map<? extends K, ? extends V> t) { public void putAll(Map<? extends K, ? extends V> t) {
throw new UnsupportedOperationException(); throw new UnsupportedOperationException();
} }