集合框架SET

下面是一张关于Set的思维导图

一，set集合的特点：

        不可重复 

        元素存取的无序性

        没有索引（有特定的遍历方式）

 

package com.LSZ.set;

import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class demo1 {

	public static void main(String[] args) {
		Set<String> s = new HashSet<String>();
		s.add("a");
		s.add("b");
		s.add("d");
		s.add("a");

		System.out.println("------迭代器输出------");
		// foreach遍历
		for (String string : s) {
			System.out.println(string);}
		System.out.println("------迭代器输出------");
		// 迭代器
		Iterator<String> iterator = s.iterator();
		while (iterator.hasNext()) {
			System.out.println(iterator.next());}
	}

}

 

 上面是一组set集合的使用，输出结果为：

HashSet元素存储底层原理 

HashSet底层数据结构是哈希表 ------哈希表根据关键值（key value）直接进行访问的数据结构   

package com.LSZ.set;

import java.util.HashSet;
import java.util.Set;

public class demo2 {

	public static void main(String[] args) {
		Set<Object> set=new HashSet<Object>();
		set.add(new fruit("西瓜","1"));
		set.add(new fruit("苹果","12"));
		set.add(new fruit("香蕉","123"));
		set.add(new fruit("葡萄","1234"));
		set.add(new fruit("西瓜","1"));
		
		for (Object s : set) {
			System.out.println(s);
		}
	}
}

class fruit{
	private String name;
	private String logo;
	public fruit() {
		// TODO Auto-generated constructor stub
	}
	public fruit(String name, String logo) {
		super();
		this.name = name;
		this.logo = logo;
	}
	@Override
	public String toString() {
		return "fruit [name=" + name + ", logo=" + logo + "]";
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public String getLogo() {
		return logo;
	}
	public void setLogo(String logo) {
		this.logo = logo;
	}
	@Override
	public int hashCode() {
		System.out.println("hashCode方法被调用");
		final int prime = 31;
		int result = 1;
		result = prime * result + ((logo == null) ? 0 : logo.hashCode());
		result = prime * result + ((name == null) ? 0 : name.hashCode());
		return result;
	}
	@Override
	public boolean equals(Object obj) {
		System.out.println("equals方法被调用");
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		fruit other = (fruit) obj;
		if (logo == null) {
			if (other.logo != null)
				return false;
		} else if (!logo.equals(other.logo))
			return false;
		if (name == null) {
			if (other.name != null)
				return false;
		} else if (!name.equals(other.name))
			return false;
		return true;
	}

}

输出结果为：

 在第5次添加对象西瓜时hashCode值出现重复，所以调用了equals方法 

SET集合排序

自然排序

TREESET  可以对元素根据特有方法进行排序

在添加元素时会调用Comparable接口的compareTo方法

package com.LSZ.set;

import java.util.Set;
import java.util.TreeSet;

public class demo3 {

	public static void main(String[] args) {

		Set<rappers> t = new TreeSet<>();
		t.add(new rappers("xxloki", 12));
		t.add(new rappers("法老", 34));
		t.add(new rappers("刘聪", 45));
		t.add(new rappers("Jony J", 10));

		for (rappers rapper : t) {
			System.out.println(rapper);
		}
	}
}

class rappers implements Comparable {
	private String name;
	private int age;

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public int getAge() {
		return age;
	}

	public void setAge(int age) {
		this.age = age;
	}

	@Override
	public String toString() {
		return "rappers [name=" + name + ", age=" + age + "]";
	}

	public rappers(String name, int age) {
		super();
		this.name = name;
		this.age = age;
	}

	public rappers() {
		// TODO Auto-generated constructor stub
	}

	@Override
	public int compareTo(Object o) {
	rappers r=(rappers)o;
		return this.age-r.getAge();
	}

}

输出结果：

 比较器排序

使用内部类创建Comparator实现类    比较器排序相对于自然排序更加灵活 

package com.LSZ.set;

import java.util.Comparator;
import java.util.Set;
import java.util.TreeSet;

public class demo4 {

	public static void main(String[] args) {
		// 使用内部类创建Comparator实现类
		Set<stars> s = new TreeSet<>(new Comparator<stars>() {

			@Override
			public int compare(stars o1, stars o2) {
				// TODO Auto-generated method stub
				return o1.getAge() - o2.getAge();
			}
		});

		s.add(new stars("吴亦凡", 66));
		s.add(new stars("王宝强", 99));
		s.add(new stars("贾乃亮", 77));
		s.add(new stars("罗志祥", 88));

		for (stars star : s) {
			System.out.println(star);
		}
	}
}

class stars {
	private String name;
	private int age;

	public stars() {
		// TODO Auto-generated constructor stub
	}

	public stars(String name, int age) {
		super();
		this.name = name;
		this.age = age;
	}

	@Override
	public String toString() {
		return "stars [name=" + name + ", age=" + age + "]";
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public int getAge() {
		return age;
	}

	public void setAge(int age) {
		this.age = age;
	}

}

输出结果：

    输出结果：可以根据自己设定的排序方式排序

🐷