特点:无序,唯一
无序:元素添加的顺序与输出的顺序不一致
唯一:不允许添加重复元素
相同元素会被过滤
默认使用equals比较,Object类型是引用类型,默认比较的是内存地址
重写hashcode和equals方法,先比较hashcode值是否相同,再比较equals
hashcode值相同,则比较equals
hashcode值不相同,则不比较equals
HashSet
TreeSet:根据某种(规则)对里面的元素进行排序
自然比较接口: java.lang.Comparable
比较器: java.util.Comparator
String以AscII码进行比较,返回差值
LinkedHashSet:
1)元素是有顺序的
2)元素是不重复的
3)底层数据结构是按照链表的结构存储的 Linked
package com.zking.util; import java.io.Serializable; import java.util.Comparator; public class Student implements Serializable,Comparable{ private Integer sid; private String sname; private float score; public Student() { super(); } public Student(Integer sid, String sname, float score) { super(); this.sid = sid; this.sname = sname; this.score = score; } public Integer getSid() { return sid; } public void setSid(Integer sid) { this.sid = sid; } public String getSname() { return sname; } public void setSname(String sname) { this.sname = sname; } public float getScore() { return score; } public void setScore(float score) { this.score = score; } @Override public int hashCode() { final int prime = 31; int result = 1; //result = prime * result + Float.floatToIntBits(score); result = prime * result + ((sid == null) ? 0 : sid.hashCode()); //result = prime * result + ((sname == null) ? 0 : sname.hashCode()); return result; } @Override public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (getClass() != obj.getClass()) return false; Student other = (Student) obj; if(this.getSid()==other.getSid()) return true; return true; } @Override public String toString() { return "Student [sid=" + sid + ", sname=" + sname + ", score=" + score + "]"; } @Override public int compareTo(Student o) { // TODO Auto-generated method stub return (this.getSid()- o.getSid()); } }
package com.zking.util;
import java.util.Set;
import java.util.TreeSet;
import com.zking.util.Student;
public class Demo2 {
public static void main(String[] args) {
//TreeSet:以某种特定的规则对集合中的元素进行排序
//java.lang.Comparable:自然比较接口
//java.util.Compartor:比较器(推荐)
Set set1=new TreeSet<>();
set1.add("zs");
set1.add("lx");
set1.add("ww");
Set set=new TreeSet<>();
set.add(new Student(1, "zs", 100f));
set.add(new Student(2, "ls", 30f));
set.add(new Student(3, "ww", 20f));
set.forEach(System.out::println);
}
}



