# Set集合

Set集合

特点:无序、无下标、元素不可重复

方法：全部继承自Collection中的方法.

两个实现类:HashSet，TreeSet

/**
 * 测试Set接口的使用
 *特点:（1）无序、（2）无下标、（3）不能重复
 */
public class Demo01 {
    public static void main(String[] args) {

        //创建集合
        Set<String> set = new HashSet<String>();
        //1.添加数据
        set.add("B");
        set.add("A");
        set.add("C");
        System.out.println("Num:"+set.size());
        System.out.println(set.toString());

        //2.删除数据
        //set.remove("A");
        //System.out.println(set.toString());

        //3.遍历
        //3.1 增强for
        System.out.println("======增强for");
        for (String str:set) {
            System.out.println(str);
        }

        //3.2迭代器
        System.out.println("=====迭代器");
        Iterator<String> it = set.iterator();
        while(it.hasNext()){
            System.out.println(it.next());
        }

        //4.判断
        System.out.println(set.contains("B"));
        System.out.println(set.isEmpty());
    }
}

1.HashSet

• 基于HashCode计算元素存放位置
• 当存入元素的哈希码相同时，会调用equals进行确认，如果为true，则拒绝后者存入

public class Person {
    private String name;
    private int age;

    public Person(String name, int age) {
        this.name = name;
        this.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;
    }

    @Override
    public String toString() {
        return "[Name:"+this.name+" Age:"+this.age+"]";
    }

//    @Override
//    public int hashCode() {
//        int n1 = this.name.hashCode();
//        int n2 = this.age;
//
//        return n1+n2;
//    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Person person = (Person) o;
        return age == person.age &&
                name.equals(person.name);
    }

    @Override
    public int hashCode() {
        //(1) 31是一个质数，尽量减少散列冲突
        //(2) 31提高执行效率 31*i = (i<<5)-i
        return Objects.hash(name, age);
    }


//    @Override
//    public boolean equals(Object obj) {
//        if(this == obj)
//            return true;
//        if(obj == null)
//            return false;
//        if(obj instanceof Person){
//            Person person =(Person)obj;
//            if (person.name.equals(this.name) && person.age==this.age){
//                return true;
//            }
//        }
//        return false;
//    }
}

/**
 * HashSet使用
 * 存储结构：哈希表(数组+链表+红黑树)
 * 存储过程
 * (1)根据hashcode计算保存的位置,如果此位置为空，则直接保存；如果不为空，执行第二步
 * (2)再执行equals，如果equals方法为true，则认为是重复，否则，形成链表
 * 
 */
public class Demo02 {
    public static void main(String[] args){
        //创建集合
        HashSet<Person> hashSet = new HashSet<Person>();

        //1.添加数据
        Person p1 = new Person("B",5);
        Person p2 = new Person("C",6);
        Person p3 = new Person("A",7);
        hashSet.add(p1);
        hashSet.add(p2);
        hashSet.add(p3);
        hashSet.add(new Person("A",7));
        //hashSet.add(p3); 重复
        System.out.println("Num:"+hashSet.size());
        System.out.println(hashSet.toString());

        //2.删除操作
//        hashSet.remove(p1);
//        hashSet.remove(new Person("C",6));
//        System.out.println("Delete:"+hashSet.toString());

        //3.遍历
        //3.1增强for
        System.out.println("====增强for");
        for (Person p:hashSet) {
            System.out.println(p);
        }
        //3.2迭代器
        System.out.println("====迭代器");
        Iterator<Person> iterator = hashSet.iterator();
        while (iterator.hasNext()){
            System.out.println(iterator.next());
        }

        //4.判断
        System.out.println(hashSet.contains(new Person("B",5) ) );
        System.out.println(hashSet.isEmpty());

    }
}

2.TreeSet

• 基于排序实现元素不重复
• 实现了SortedSet接口，对集合元素自动排序
• 元素对象的类型必须实现Comparable接口，指定排序规则.
• 通过CompareTo方法确定是否为重复元素

/**
 * TreeSet使用
 * 存储结构：红黑树
 */
public class Demo01 {
    public static void main(String[] args){

        //创建集合
        TreeSet<String> treeSet = new TreeSet<String>();
        //1.添加元素
        treeSet.add("A");
        treeSet.add("abc");
        treeSet.add("X");
        treeSet.add("xyz");
        System.out.println("Num:"+treeSet.size());
        System.out.println(treeSet.toString());

        //2.删除元素
//        treeSet.remove("xyz");
//        System.out.println("Del:"+treeSet.size());

        //3.遍历
        //3.1 增强for
        System.out.println("====增强for");
        for (String str:treeSet) {
            System.out.println(str);
        }
        //3.2 迭代器
        System.out.println("====迭代器");
        Iterator<String> iterator = treeSet.iterator();
        while (iterator.hasNext()){
            System.out.println(iterator.next());
        }

        //4.判断
        System.out.println(treeSet.contains("abc"));
        System.out.println(treeSet.isEmpty());

    }
}

public class Person implements Comparable<Person>{
    private String name;
    private int age;

    //先按姓名比，然后再按年龄比
    @Override
    public int compareTo(Person o) {
        int n1 = this.getName().compareTo(o.getName());
        int n2 = this.age - o.age;
        return n1==0 ? n2 : n1 ;
    }

    public Person(String name, int age) {
        this.name = name;
        this.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;
    }

    @Override
    public String toString() {
        return "[Name:"+this.name+" Age:"+this.age+"]";
    }

//    @Override
//    public int hashCode() {
//        int n1 = this.name.hashCode();
//        int n2 = this.age;
//
//        return n1+n2;
//    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Person person = (Person) o;
        return age == person.age &&
                name.equals(person.name);
    }

    @Override
    public int hashCode() {
        //(1) 31是一个质数，尽量减少散列冲突
        //(2) 31提高执行效率 31*i = (i<<5)-i
        return Objects.hash(name, age);
    }


//    @Override
//    public boolean equals(Object obj) {
//        if(this == obj)
//            return true;
//        if(obj == null)
//            return false;
//        if(obj instanceof Person){
//            Person person =(Person)obj;
//            if (person.name.equals(this.name) && person.age==this.age){
//                return true;
//            }
//        }
//        return false;
//    }
}

/**
 * 使用TreeSet保存数据
 * 存储结构：红黑树
 * 要求：元素必须要实现Comparable接口，compareTo()方法返回值为0，认为是重复元素
 */
public class Demo02 {
    public static void main(String[] args) {

        //创建集合
        TreeSet<Person> treeSet = new TreeSet<Person>();
        //1.添加元素
        Person p1 = new Person("B",5);
        Person p2 = new Person("C",6);
        Person p3 = new Person("A",7);
        Person p4 = new Person("A",7);
        treeSet.add(p1);
        treeSet.add(p2);
        treeSet.add(p3);
        treeSet.add(p4);
        System.out.println("Num:"+treeSet.size());
        System.out.println(treeSet.toString());

        //2.删除
        //treeSet.remove(p1);
//        treeSet.remove(new Person("B",5));
        System.out.println("Num:"+treeSet.size());

        //3.遍历
        //3.1 增强for
        System.out.println("====增强for");
        for (Person p: treeSet) {
            System.out.println(p);
        }
        //3.2迭代器
        System.out.println("====迭代器");
        Iterator<Person> iterator = treeSet.iterator();
        while(iterator.hasNext()){
            System.out.println(iterator.next());
        }

        //4.判断
        System.out.println(treeSet.contains(new Person("A",7) ) );
        System.out.println(treeSet.isEmpty());

    }
}

/**
 * TreeSet使用
 * Comparator:实现定制比较（比较器）
 * Comparable:可比较的
 */
public class Demo03 {
    public static void main(String[] args) {

        //创建集合
        TreeSet<Person> treeSet = new TreeSet<>(new Comparator<Person>(){
            @Override
            public int compare(Person o1, Person o2) {
                int n1 = o1.getAge() - o2.getAge();
                int n2 = o1.getName().compareTo(o2.getName());
                return n1==0?n2:n1;
            }
        });
        Person p1 = new Person("B",7);
        Person p2 = new Person("C",6);
        Person p3 = new Person("A",8);
        treeSet.add(p1);
        treeSet.add(p2);
        treeSet.add(p3);
        System.out.println(treeSet.toString());

    }
}

/**
 * 使用TreeSet集合实现字符串按照长度进行排序
 * helloworld zhang lisi wangwu beijing xian nanjing
 */
public class Demo04 {
    public static void main(String[] args) {

        //创建集合
        TreeSet<String> treeSet = new TreeSet<String>(new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                int n1 = o1.length()-o2.length();
                int n2 = o1.compareTo(o2);
                return n1==0?n2:n1;
            }
        });
        //1.添加数据
        treeSet.add("helloworld");
        treeSet.add("zhang");
        treeSet.add("lisi");
        treeSet.add("wangwu");
        treeSet.add("beijing");
        treeSet.add("xian");
        treeSet.add("nanjing");
        System.out.println("Num:"+treeSet.size());
        System.out.println(treeSet.toString());


    }
}