package d16开放地址值;
public class Info {
private String key;
private String name;
public Info(String key ,String name){
this.key=key;
this.name=name;
}
public String getKey() {
return key;
}
public void setKey(String key) {
this.key = key;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
}
package d16开放地址值;
import java.math.BigInteger;
public class HashTable {
private Info [] arr;
public HashTable(){
arr= new Info[100];
}
public HashTable(int maxSize){
arr = new Info[maxSize];
}
public void insert( Info info){
String key = info.getKey();
int hasVal = hashCode(key);
while(arr[hasVal]!=null&&arr[hasVal].getName()!=null){
++hasVal;
hasVal%=arr.length;
}
arr[hasVal]=info;
}
private int hashCode(String key) {
BigInteger hashVal = new BigInteger("0");
BigInteger pow27 = new BigInteger("1");
for(int i = key.length()-1;i>=0;i--){
int letter = key.charAt(i)-96;
BigInteger letterB = new BigInteger(String.valueOf(letter));
hashVal=hashVal.add(letterB.multiply(pow27));
pow27 = pow27.multiply(new BigInteger(String.valueOf(27)));
}
return hashVal.mod(new BigInteger(String.valueOf(arr.length))).intValue();
}
public Info find (String key ){
int hashVal = hashCode(key);
while(arr[hashVal]!=null){
if(arr[hashVal].getKey().equals(key)){
return arr[hashVal];
}
++hashVal;
hashVal%=arr.length;
}
return null;
}
public Info delete(String key){
int hasVal = hashCode(key);
while(arr[hasVal]!=null){
if(arr[hasVal].getKey().equals(key)){
Info tmp = arr[hasVal];
tmp.setName(null);
return tmp;
}
++hasVal;
hasVal%=arr.length;
}
return null;
}
}