TreeMap笔记

都是一些垃圾笔记，随便写的，没必要看。

package map;

import java.util.Comparator;
import java.util.Map;
import java.util.TreeMap;

public class treemapTest {
    public static void main(String[] args) {
        TreeMap<student,String> t1 =new TreeMap<>(new Comparator<student>() {
            @Override
            public int compare(student o1, student o2) {
                 int n1 =o1.num-o2.num;
                 int n2 =o1.name.compareTo(o2.name);
                 return n1==0?n2:n1;
            }
        });
        student s1 =new student("棋棋",01);
        student s2 =new student("瑶瑶",02);
        student s3 =new student("杨杨",03);

        //treemap要求其添加的元素实现Comparable接口。因为它的存储结构是红黑树
        t1.put(s1,"广州");
        t1.put(s2,"广州");
        t1.put(s3,"广州");
        t1.put(new student("瑶瑶",02),"婠婠");
        System.out.println(t1.size());
        System.out.println(t1);

        //删除
        t1.remove(s1);
        t1.remove(new student("杨杨",03));
        System.out.println(t1.size());
        System.out.println(t1);


        //遍历
        for (student a:t1.keySet()) {
            System.out.println(a+"------"+t1.get(a));
        }

        for (Map.Entry<student,String> a:t1.entrySet()) {
            System.out.println(a.getKey()+"------"+a.getValue());
        }

        //判断
        System.out.println(t1.containsKey(s1));
        System.out.println(t1.containsKey(new student("瑶瑶",02)));
        System.out.println(t1.containsValue("婠婠"));
    }
}

输出结果：

3
{student{name='棋棋', num=1}=广州, student{name='瑶瑶', num=2}=婠婠, student{name='杨杨', num=3}=广州}
1
{student{name='瑶瑶', num=2}=婠婠}
student{name='瑶瑶', num=2}------婠婠
student{name='瑶瑶', num=2}------婠婠
false
true
true