import java.util.TreeMap;
public class HashTableDynamic {
// 链地å€æ³•
private static final int upperTol = 10;
private static final int lowerTol = 2;
private static final int initCapacity = 7;
private TreeMap[] hashTable;
private int M;
private int size;
public HashTableDynamic(int M) {
this.M = M;
size = 0;
hashTable = new TreeMap[M];
for (int i = 0; i < M; i++) {
hashTable[i] = new TreeMap<>();
}
}
public HashTableDynamic() {
this(initCapacity);
}
private int hash(K key) {
return (key.hashCode() & 0x7fffffff) % M;
}
public int getSize() {
return size;
}
public void add(K key, V value) {
TreeMap map = hashTable[hash(key)];
if (map.containsKey(key)) {
map.put(key, value);
} else {
map.put(key, value);
size++;
if (size >= upperTol * M) {
resize(2 * M);
}
}
}
public V remove(K key) {
TreeMap map = hashTable[hash(key)];
V ret = null;
if (map.containsKey(key)) {
ret = map.remove(key);
size--;
// if (size< lowerTol * M&&M/2>0){
if (size < lowerTol * M && M / 2 >= initCapacity) {
resize(M / 2);
}
}
return ret;
}
public void set(K key, V value) {
TreeMap map = hashTable[hash(key)];
if (!map.containsKey(key)) {
throw new IllegalArgumentException(key + " doesn't exist!");
}
map.put(key, value);
}
public boolean contains(K key) {
return hashTable[hash(key)].containsKey(key);
}
public V get(K key) {
return hashTable[hash(key)].get(key);
}
private void resize(int newM) {
TreeMap[] newHashTable = new TreeMap[newM];
for (int i = 0; i < newM; i++) {
newHashTable[i] = new TreeMap<>();
}
// 注æ„，Mçš„å˜åŒ–
int oldM = M;
this.M = newM;
for (int i = 0; i < oldM; i++) {
TreeMap map = hashTable[i];
for (K key : map.keySet()) {
// hash(key) Mçš„å˜åŒ–
newHashTable[hash(key)].put(key, map.get(key));
}
}
this.hashTable = newHashTable;
}
}