首页 / JAVA / Java TreeSet with Comparator sorting

Java TreeSet with Comparator sorting

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了Java TreeSet with Comparator sorting，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1686字，纯文字阅读大概需要3分钟。

内容图文

TreeSet guarantees no duplicate data, also guarantees long(n) time complexity for add(), remove(), contains().

            import
             java.util.Comparator;

            import
             java.util.TreeSet;
 

            public
            class
             MySetWithCompr {
 
    
            public
            static
            void
             main(String b[]){
         
        TreeSet<MyComp> ts = new TreeSet<MyComp>(new MyCompC());
        ts.add(new MyComp("RED", 1));
        System.out.println("added");
        ts.add(new MyComp("ORANGE", 1));
        System.out.println("added");
        ts.add(new MyComp("BLUE", 1));
        System.out.println("added");
        ts.add(new MyComp("GREEN", 1));
        System.out.println("added");
        ts.add(new MyComp("GREEN", 2));           
        System.out.println("green 2 added");
        for(MyComp a:ts) {
            System.out.println(a.name + " " + a.i);
        }
    }
}
 
class MyComp implements Comparable<MyComp> {
    public String name;
    publicint i;

    public MyComp(String n, int x) {name = n; i = x;}

    @Override
    publicint compareTo(MyComp entry) {
        if(name.equals(entry.name)) {
            System.out.println("local name = " + name);
            System.out.println("local i = " + i);
            System.out.println("entry name = " + entry.name);
            System.out.println("entry i = " + entry.i);
            entry.i = i; // update this as the duplicate data gets in
            System.out.println("local name = " + name);
            System.out.println("local i = " + i);
            System.out.println("entry name = " + entry.name);
            System.out.println("entry i = " + entry.i);
            return 0;
        }
        else {
            return name.equals(entry.name) ? -1 : 1;
        }
    }
}

class MyCompC implements Comparator<MyComp>{
 
    @Override
    publicint compare(MyComp str1, MyComp str2) {
        return str1.compareTo(str2);
    }     
}

entry name = GREEN
entry i = 2
green 2 added
RED 1
ORANGE 1
BLUE 1
GREEN 2 (see, this value is updated)

原文：http://www.cnblogs.com/RuiYan/p/5463989.html

内容总结

以上是互联网集市为您收集整理的Java TreeSet with Comparator sorting全部内容，希望文章能够帮你解决Java TreeSet with Comparator sorting所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/1241015.html

来源：【匿名】