Java(17) Set

Set

Book

package bean;

import lombok.AllArgsConstructor;
import lombok.Data;
import lombok.NoArgsConstructor;


@Data
@NoArgsConstructor
@AllArgsConstructor
public class Book implements Comparable {
    /**
     * 书名
     */
    private String name;
    /**
     * 作者
     */
    private String author;
    /**
     * 单价
     */
    private int price;
    /**
     * 销量
     */
    private int sales;

    @Override
    public int compareTo(Object o) {
        Book book = (Book) o;
        int x = this.author.compareTo(book.getAuthor());
        int y = this.price - book.getPrice();
        int z = this.sales - book.getSales();
        int k = this.name.compareTo(book.getName());
        if (x != 0) {
            return x;
        } else if (y != 0) {
            return -y;
        } else if (z != 0) {
            return -z;
        } else if (k != 0) {
            return k;
        } else {
            return 0;
        }
    }
}

TreeSetTest

package Test.set;

import bean.Book;
import org.junit.jupiter.api.Test;

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


public class TreeSetTest {
    @Test
    public void test(){
        Set<Book> books = new TreeSet<>();
        // books.add(new Book("f", "B", 35, 180));
        books.add(new Book("a", "A", 35, 150));
        books.add(new Book("b", "B", 35, 150));
        books.add(new Book("c", "A", 33, 150));
        books.add(new Book("d", "B", 33, 150));
        books.add(new Book("e", "A", 35, 180));
        books.add(new Book("f", "B", 35, 180));
        Iterator<Book> it = books.iterator();
        while (it.hasNext()){
            Book book = it.next();
            System.out.println(book);
        }
        /*
Book(name=e, author=A, price=35, sales=180)
Book(name=a, author=A, price=35, sales=150)
Book(name=c, author=A, price=33, sales=150)
Book(name=f, author=B, price=35, sales=180)
Book(name=b, author=B, price=35, sales=150)
Book(name=d, author=B, price=33, sales=150)
         */
    }
}

LinkedHashSetTest

package Test.set;

import org.junit.jupiter.api.Test;

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

/**
 * List: 有序可重复 有序指的是下标有序 可重复指的是不同下标位置上可以存储相同值的元素
 * Set: 无序不可重复 录入的顺序和存储的顺序不一致 不可重复指的是相同值的元素不可重复存储
 */
public class LinkedHashSetTest {
    @Test
    public void test01() {
        Set set = new HashSet();
        byte a = 1;
        short b = 2;
        int c = 3;
        long d = 4L;
        double e = 5.0d;
        float f = 6.0f;
        char g = 'a';
        boolean h = false;
        set.add(a);
        set.add(b);
        set.add(c);
        set.add(d);
        set.add(e);
        set.add(f);
        set.add(g);
        set.add(h);
        set.add(a);
        System.out.println(set);
    }
//[6.0, 1, a, 2, 3, 4, 5.0, false]
    @Test
    public void test02() {
        Set set = new LinkedHashSet();
        byte a = 1;
        short b = 2;
        int c = 3;
        long d = 4L;
        double e = 5.0d;
        float f = 6.0f;
        char g = 'a';
        boolean h = false;
        set.add(a);
        set.add(b);
        set.add(c);
        set.add(d);
        set.add(e);
        set.add(f);
        set.add(g);
        set.add(h);
        set.add(a);
        System.out.println(set);
    }
//[1, 2, 3, 4, 5.0, 6.0, a, false]
    @Test
    public void test03() {
        Set set = new LinkedHashSet();
        set.add(2);
        set.add(1);
        set.add(1);
        System.out.println(set);
    }
//[2, 1]
    @Test
    public void test04() {
        Set<String> set = new LinkedHashSet<>();
        for (int i = 0; i < 5; i++) {
            set.add("xm" + (i + 1));
        }
        System.out.println(set);
        for (String name : set) {
            System.out.println(name);
        }
    }
/*
[xm1, xm2, xm3, xm4, xm5]
xm1
xm2
xm3
xm4
xm5
 */
    @Test
    public void test05() {
        Set<String> set = new LinkedHashSet<>();
        for (int i = 0; i < 5; i++) {
            set.add("xm" + (i + 1));
        }
        System.out.println(set);
        Iterator<String> it = set.iterator();
        while (it.hasNext()) {
            String name = it.next();
            System.out.println(name);
        }
    }
/*
[xm1, xm2, xm3, xm4, xm5]
xm1
xm2
xm3
xm4
xm5

 */
}

HashSetTest

package Test.set;

import org.junit.jupiter.api.Test;

import java.util.*;

/**
 * List: 有序可重复 有序指的是下标有序 可重复指的是不同下标位置上可以存储相同值的元素
 * Set: 无序不可重复 录入的顺序和存储的顺序不一致 不可重复指的是相同值的元素不可重复存储
 */
public class HashSetTest {
    @Test
    public void test01() {
        List list = new ArrayList();
        byte a = 1;
        short b = 2;
        int c = 3;
        long d = 4L;
        double e = 5.0d;
        float f = 6.0f;
        char g = 'a';
        boolean h = false;
        list.add(a);
        list.add(b);
        list.add(c);
        list.add(d);
        list.add(e);
        list.add(f);
        list.add(g);
        list.add(h);
        list.add(a);
        System.out.println(list);
    }
//[1, 2, 3, 4, 5.0, 6.0, a, false, 1]
    @Test
    public void test02() {
        Set set = new HashSet();
        byte a = 1;
        short b = 2;
        int c = 3;
        long d = 4L;
        double e = 5.0d;
        float f = 6.0f;
        char g = 'a';
        boolean h = false;
        set.add(a);
        set.add(b);
        set.add(c);
        set.add(d);
        set.add(e);
        set.add(f);
        set.add(g);
        set.add(h);
        set.add(a);
        System.out.println(set);
    }
//[6.0, 1, a, 2, 3, 4, 5.0, false]
    @Test
    public void test03() {
        Set set = new HashSet();
        set.add(2);
        set.add(1);
        set.add(1);
        System.out.println(set);
    }
//[1, 2]
    @Test
    public void test04() {
        Set<String> set = new HashSet<>();
        for (int i = 0; i < 5; i++) {
            set.add("xm" + (i + 1));
        }
        System.out.println(set);
        for (String name : set) {
            System.out.println(name);
        }
    }
/*
[xm5, xm2, xm1, xm4, xm3]
xm5
xm2
xm1
xm4
xm3
 */
    @Test
    public void test05() {
        Set<String> set = new HashSet<>();
        for (int i = 0; i < 5; i++) {
            set.add("xm" + (i + 1));
        }
        System.out.println(set);
        Iterator<String> it = set.iterator();
        while (it.hasNext()) {
            String name = it.next();
            System.out.println(name);
        }
    }
/*
[xm5, xm2, xm1, xm4, xm3]
xm5
xm2
xm1
xm4
xm3
 */
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值