重写对象的hashCode()方法来对无序集合排序

最新推荐文章于 2023-06-06 07:29:49 发布

cg_program

最新推荐文章于 2023-06-06 07:29:49 发布

阅读量1.2k

点赞数

本文链接：https://blog.csdn.net/foart/article/details/4438276

版权

package com.entity; public class Aa { private String name; private Integer code; public Aa() { } public Aa(Integer code, String name) { this.code = code; this.name = name; } public String getName() { return name; } public void setName(String name) { this.name = name; } public int hashCode() { return code; } }

package com.run; import java.util.HashSet; import java.util.Set; import com.entity.Aa; public class Run { public static void main(String[] args) { Aa a = new Aa(1, "壹"); Aa b = new Aa(2, "贰"); Aa c = new Aa(3, "叁"); Aa d = new Aa(4, "肆"); Set<Aa> map = new HashSet<Aa>(); map.add(a); map.add(d); map.add(c); map.add(b); // 输出 for (Aa aa : map) { System.out.println(aa.getName()); } } }