TreeMap基本应用

需求:

键:整数表示id

值:字符串表示商品名称

要求:按照id的升序排序、按照id的降序排序

代码: 

public class sp implements Comparable<sp>{
    private int id;

    public sp() {
    }

    public sp(int id) {
        this.id = id;
    }

    /**
     * 获取
     * @return id
     */
    public int getId() {
        return id;
    }

    /**
     * 设置
     * @param id
     */
    public void setId(int id) {
        this.id = id;
    }

    public String toString() {
        return  id + "";
    }

    /**
     * Compares this object with the specified object for order.  Returns a
     * negative integer, zero, or a positive integer as this object is less
     * than, equal to, or greater than the specified object.
     *
     * <p>The implementor must ensure <tt>sgn(x.compareTo(y)) ==
     * -sgn(y.compareTo(x))</tt> for all <tt>x</tt> and <tt>y</tt>.  (This
     * implies that <tt>x.compareTo(y)</tt> must throw an exception iff
     * <tt>y.compareTo(x)</tt> throws an exception.)
     *
     * <p>The implementor must also ensure that the relation is transitive:
     * <tt>(x.compareTo(y)&gt;0 &amp;&amp; y.compareTo(z)&gt;0)</tt> implies
     * <tt>x.compareTo(z)&gt;0</tt>.
     *
     * <p>Finally, the implementor must ensure that <tt>x.compareTo(y)==0</tt>
     * implies that <tt>sgn(x.compareTo(z)) == sgn(y.compareTo(z))</tt>, for
     * all <tt>z</tt>.
     *
     * <p>It is strongly recommended, but <i>not</i> strictly required that
     * <tt>(x.compareTo(y)==0) == (x.equals(y))</tt>.  Generally speaking, any
     * class that implements the <tt>Comparable</tt> interface and violates
     * this condition should clearly indicate this fact.  The recommended
     * language is "Note: this class has a natural ordering that is
     * inconsistent with equals."
     *
     * <p>In the foregoing description, the notation
     * <tt>sgn(</tt><i>expression</i><tt>)</tt> designates the mathematical
     * <i>signum</i> function, which is defined to return one of <tt>-1</tt>,
     * <tt>0</tt>, or <tt>1</tt> according to whether the value of
     * <i>expression</i> is negative, zero or positive.
     *
     * @param o the object to be compared.
     * @return a negative integer, zero, or a positive integer as this object
     * is less than, equal to, or greater than the specified object.
     * @throws NullPointerException if the specified object is null
     * @throws ClassCastException   if the specified object's type prevents it
     *                              from being compared to this object.
     */
    @Override
    public int compareTo(sp o) {
        return this.id-o.id;//从小到大
        // return o.id-this.id; 从大到小
    }
}

实现类:

import java.util.TreeMap;
import java.util.function.BiConsumer;

public class Demo1 {
    public static void main(String[] args) {
        TreeMap<sp, String> map = new TreeMap<>();
        sp sp2 = new sp(5);
        sp sp3 = new sp(4);
        sp sp4 = new sp(3);
        sp sp5 = new sp(2);
        sp sp = new sp(1);
        map.put(sp5,"西瓜");
        map.put(sp3,"哈密瓜");
        map.put(sp4,"苦瓜");
        map.put(sp,"东瓜");
        map.put(sp2,"冰瓜");
        map.forEach(new BiConsumer<Gather.TreeMap.sp, String>() {
            @Override
            public void accept(Gather.TreeMap.sp Key, String Value) {
                System.out.println(Key+"="+Value);
                //1=东瓜
                //2=西瓜
                //3=苦瓜
                //4=哈密瓜
                //5=冰瓜
            }
        });
    }
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值