2021-09-05

Map接口

import java.util.HashMap;
import java.util.Map;

public class TestMap {
    public static void main(String[] args) {
//        创建一个Map集合:无序，唯一
        Map<String,Integer> map = new HashMap();
        map.put("lili",1021);
        map.put("wuwu",10241);
        map.put("lili",10251);
        map.put("liwli",10621);
        map.put("liwlri",10721);
        map.put("qlili",14021);
        System.out.println(map.put("lirli", 18021));
        map.clear();
        map.remove("wuwu");
        System.out.println(map.size());
        System.out.println(map);
        System.out.println(map.containsKey("lili"));
        System.out.println(map.containsValue(10721));

        Map<String,Integer> map2 = new HashMap();
        map2.put("lili",1021);
        map2.put("wuwu",10241);
        map2.put("lili",10251);
        map2.put("liwli",10621);
        map2.put("liwlri",10721);
        map2.put("qlili",14021);
        System.out.println(map == map2);
        System.out.println(map.equals(map2));
        System.out.println(map.isEmpty());
        System.out.println(map.get("lili"));

    }
}

Map遍历方法

public class TestMap {
    public static void main(String[] args) {
//        创建一个Map集合:无序，唯一
        Map<String,Integer> map = new HashMap();
        map.put("lili",1021);
        map.put("wuwu",10241);
        map.put("lili",10251);
        map.put("liwli",10621);
        map.put("liwlri",10721);
        map.put("qlili",14021);
        
        System.out.println("-----------------------------------------");
//        keySet()对集合中的key进行查看
        Set<String> set = map.keySet();
        for (String s : set) {
            System.out.println(s);
        }
        System.out.println("------------------------------------------");
//        values()对集合中的value进行查看
        Collection<Integer> values = map.values();
        for (Integer v : values) {
            System.out.println(v);

        }
        System.out.println("-------------------------");

        Set<String> set2 = map.keySet();
        for (String s : set2) {
            System.out.println(map.get(s));
        }
        System.out.println("--------------------------------");
        Set<Map.Entry<String,Integer>> entries = map.entrySet();
        for (Map.Entry<String, Integer> e : entries) {
            System.out.println(e.getKey()+"-------"+e.getValue());
        }
    }
}

Map接口TreeMap实现类

public class Student_05{
    private int age;
    private String name;
    private double height;

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public double getHeight() {
        return height;
    }

    public void setHeight(double height) {
        this.height = height;
    }

    @Override
    public String toString() {
        return "Student_05{" +
                "age=" + age +
                ", name='" + name + '\'' +
                ", height=" + height +
                '}';
    }

    public Student_05(int age, String name, double height) {
        this.age = age;
        this.name = name;
        this.height = height;

    }
}


//外部比较器
public class TestStudent_05 {
    public static void main(String[] args) {
        Map<Student_05,Integer> map = new TreeMap<>(new Comparator<Student_05>() {
            @Override
            public int compare(Student_05 o1, Student_05 o2) {
                return ((Double)(o1.getHeight())).compareTo((Double)(o2.getHeight()));
            }
        }
    );
        map.put(new Student_05(19,"blili",170.5),1001);
        map.put(new Student_05(18,"blili",150.5),10321);
        map.put(new Student_05(19,"alili",180.5),1321);
        map.put(new Student_05(17,"clili",140.5),10231);
        map.put(new Student_05(10,"dlili",160.5),12301);
        System.out.println(map.size());
        System.out.println(map);


    }
}

HashMap原理