import java.util.HashMap;
import java.util.Map;
class Employee{
private int id;
private String ename;
private double salary;
public Employee(int id,String ename,Double salary){
super();
this.id=id;
this.ename=ename;
this.salary=salary;
}
@Override
public String toString() {
return "id:"+id+"ename:"+ename+"salary:"+salary;
}
public int getId(){
return id;
}
public void setId(int id){
this.id=id;
}
public String getEname(){
return ename;
}
public void setEname(String ename){
this.ename=ename;
}
public double getSalary(){
return salary;
}
public void setSalary(double salary){
this.salary=salary;
}
}
//Map 就是用来存储 键值对 的 Map类中存储的键值对通过键来标识 所以键对象不能重复
//测试 HashMapde 的使用
public class MapAndSet {
public static void main(String[] args) {
Map<Integer,String> m1=new HashMap<>();
m1.put(1,"one");
m1.put(2,"two");
m1.put(3,"three");
//put存放键值对 get通过键值对查找对象 remove删除键对象对对应的值
m1.get(1);
System.out.println(m1.get(1));
System.out.println(m1.size());
System.out.println(m1.isEmpty());
System.out.println(m1.containsKey(2));
System.out.println(m1.containsValue("one"));
Map<Integer,String> m2=new HashMap<>();
m2.put(4,"si");
m2.put(5,"wu");
m2.put(6,"liu");
m1.putAll(m2);
//键是不能重复的 如果重复则新的会覆盖旧的 判断是否重复是使用equals方法来判断
System.out.println(m1);
Employee e1=new Employee(1001,"小人",2000.0);
Employee e2=new Employee(1002,"大人",3000.0);
Employee e3=new Employee(1003,"人",4000.0);
Map<Integer,Employee> map=new HashMap<>();
map.put(1001,e1);
map.put(1002,e2);
map.put(1003,e3);
Employee emp=map.get(1001);
System.out.println(emp.getEname());
System.out.println(map);
}
}
输出结果: