TreeMap

 

package MapInterface;

import List.Person;
import org.junit.Test;

import java.util.*;

public class TreeMapTest {
    @Test
    public void test1(){
        TreeMap map = new TreeMap();
        map.put(new Person("ff",123),81);
        map.put(new Person("bb",123),100);
        map.put(new Person("cc",123),82);
        map.put(new Person("dd",123),93);

        Set entrySet = map.entrySet();
        Iterator iterator = entrySet.iterator();
        while (iterator.hasNext()){
            Object key = iterator.next();
            Map.Entry entry = (Map.Entry)key;
            System.out.println(entry.getKey()+"====>"+entry.getValue());
        }
    }

    @Test
    public void test2(){


        TreeMap map = new TreeMap(new Comparator() {
            @Override
            public int compare(Object o1, Object o2) {
                if(o1 instanceof Person && o2 instanceof Person){
                    Person p1 = (Person) o1;
                    Person p2 = (Person) o2;
                    return Integer.compare(p1.getAge(),p2.getAge());
                }else{
                    throw new RuntimeException("类型不一致");
                }
            }
        });

        map.put(new Person("ff",123),81);
        map.put(new Person("bb",11),100);
        map.put(new Person("cc",12),82);
        map.put(new Person("dd",13),93);

        Set entrySet = map.entrySet();
        Iterator iterator = entrySet.iterator();
        while (iterator.hasNext()){
            Object key = iterator.next();
            Map.Entry entry = (Map.Entry)key;
            System.out.println(entry.getKey()+"====>"+entry.getValue());
        }
    }

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值