目录
1.3.1 HashSet:以某种特定的规则对集合中的元素进行排序(升序和降序)
1.3.2 TreeSet:根据某种(规则)对里面的元素进行排序
一. Set
1.1 特点:无序、对象不能重复
package com.zking.collection02.util;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
import com.zking.collection02.entity.Student;
public class Demo {
public static void main(String[] args) {
//Set
//1.特点:无序,唯一
//1)无序:元素添加的顺序与输出的顺序不一致
//2)唯一:不允许添加重复元素(被过滤了)
//
/*Set<String> set = new HashSet<>();
set.add("zs");
set.add("ls");
set.add("ww");
set.add("zs");
set.forEach(System.out::println);*/
Set<Student> set = new HashSet<>();
set.add(new Student(1,"zs",100f));
set.add(new Student(2,"ls",30f));
set.add(new Student(3,"ww",20f));
set.add(new Student(1,"zs",120f));
//1)默认使用equals比较,Object类型是引用类型,默认比较的是内存地址
//2)重写hashcode和equals方法,先比较hashcode值是否相同,在比较equals
//2.1)hashcode值相同,则比较equals
//2.2)hashcode值不相同,则不比较equals
/*Student stu = new Student();
stu.equals(null);*/
// set.forEach(System.out::println);
1.2 遍历(两种)
1.2.1 foreach
//1)foreach
for (Student student : set) {
System.out.println(student);
}
1.2.2 迭代器
//2)iterator(迭代器)
//获取迭代器
Iterator<Student> it = set.iterator();
while(it.hasNext()) {
System.out.println(it.next());
}
1.3 常用实现类
1.3.1 HashSet:以某种特定的规则对集合中的元素进行排序(升序和降序)
java.lang.Comparable:自然比较接口
java.util.Comparator:比较器(推荐)
测试代码:
集合添加数据:
Set<Student> 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);
实体类:
package com.zking.collection02.entity;
import java.io.Serializable;
import java.util.Comparator;
public class Student implements Serializable,Comparable<Student> {
private Integer sid;
private String sname;
private Float 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;
}
public Student() {
super();
}
public Student(Integer sid, String sname, Float score) {
super();
this.sid = sid;
this.sname = sname;
this.score = score;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
// result = prime * result + ((score == null) ? 0 : score.hashCode());
result = prime * result + ((sid == null) ? 0 : sid.hashCode());
result = prime * result + ((sname == null) ? 0 : sname.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
//true代表已存在,false代表允许添加(不存在)
//当前对象是否与obj对象相同
if (this == obj)
return true;
//obj对象是否为空
if (obj == null)
return false;
//当前对象类型与obj对象类型不同
if (getClass() != obj.getClass())
return false;
Student other = (Student) obj;
if(this.getSid()!=other.getSid())
return false;
return true;
}
@Override
public String toString() {
return "Student [sid=" + sid + ", sname=" + sname + ", score=" + score + "]";
}
@Override
public int compareTo(Student o) {
//比较者大于被比较者 返回1
//比较者等于被比较者 返回0
//比较者小于被比较者 返回-1
/*if(this.getSid()>o.getSid())
return 1;
else {
if(this.getSid()==o.getSid())
return 0;
else
return -1;
}*/
return this.getSid()-o.getSid();
}
}
除了这个之外,还可以进行代码封装
package com.zking.collection02.util;
import java.util.Comparator;
import com.zking.collection02.entity.Student;
public class NameComparator implements Comparator<Student> {
@Override
public int compare(Student o1, Student o2) {
// TODO Auto-generated method stub
return o1.getSid()-o2.getSid();
}
}
1.3.2 TreeSet:根据某种(规则)对里面的元素进行排序
自然比较接口: java.lang.Comparable
比较器: java.util.Comparator
String以AscII码进行比较,返回差值
LinkedHashSet:
1)元素是有顺序的
2)元素是不重复的
3)底层数据结构是按照链表的结构存储的 Linked