JavaHashMap常用方法

class qb {
    private Integer num;
    private String  type;


    public String getType() {
        return type;
    }

    public void setType(String type) {
        this.type = type;
    }

    public Integer getNum() {
        return num;
    }

    public void setNum(Integer num) {
        this.num = num;
    }

    public qb(Integer num, String type) {
        this.num = num;
        this.type = type;
    }

    @Override
    public String toString() {
        return "qb{" +
                "num=" + num +
                ", type='" + type + '\'' +
                '}';
    }
}

public class qq {
    public static void main(String[] args) {
        //使用Treemap实现一个Map
        Map<qb,String> p=new HashMap<>();
        qb  qb1=new qb(100,"宝哥");
        qb  qb2=new qb(600,"旭哥");
        qb  qb3=new qb(200,"条哥");
        qb  qb4=new qb(50,"洞主");
        p.put(qb1,"1");
        p.put(qb2,"2");
        p.put(qb3,"3");
        p.put(qb4,"4");

        //使用内置的keyset()方法获取键的set集合，注意返回的是一个set集合。
        Set pkey=p.keySet();
        //返回的是一个Object对象 对这个集合进行遍历
        for (Object o:pkey
        ){
            System.out.println(o.toString());
        }
        qb qbx1=new qb(1,"D");
        qb qbx2=new qb(100,"GG");
        //找TreeMap中键为qbx1的一个对象  找到return true  else return false
        System.out.println(p.containsKey(qbx1));
        //找TreeMap中键为qbx2的一个对象  找到return true  else return false
        System.out.println(p.containsKey(qbx2));
        //get方法获取对应键的值
        System.out.println(p.get(qb3).toString());

    }
}