数据结构是通向各种各种实用算法的基石。
HashMap的概况的看:http://blog.youkuaiyun.com/linsongbin1/article/details/54667453
HashMap的源代码分析:http://blog.youkuaiyun.com/feixiaohuijava/article/details/51283005(想看的都在这里)
测试:
package HashMapTest;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
public class Test {
private String name;
private int age;
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + age;
//result = prime * result + ((name == null) ? 0 : name.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Test other = (Test) obj;
if (age != other.age)
return false;
/*if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;*/
return true;
}
public static void main(String[] args) {
Test test1 = new Test("3s", 18);
Test test2 = new Test("5s", 18);
HashMap<Test,String> hash = new HashMap<Test,String>(4);
hash.put(test1, "test1");
hash.put(test2, "test2");
System.out.println(hash.size());
System.out.println(test1.equals(test2));
//遍历
Iterator iter = hash.entrySet().iterator();
while(iter.hasNext()){
Map.Entry entry = (Map.Entry)iter.next();
System.out.println(entry.toString());
}
}
public Test(String name,int age){
this.name = name;
this.age = age;
}
@Override
public String toString() {
return "Test [name=" + name + ", age=" + age + "]";
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
}
输出:
1
true
Test [name=3s, age=18]=test2