LinkedHashSet说明
LinkedHashSet底层机制
LinkedHashSet加入顺序和取出元素/数据的顺序一致
LinkedHashSet底层源码分析
LinkedHashSet练习题
练习题代码
package com.example.hspedu;
import java.util.LinkedHashSet;
import java.util.Objects;
public class exercise03 {
public static void main(String[] args) {
LinkedHashSet linkedHashSet = new LinkedHashSet();
linkedHashSet.add(new Car("奥拓",1000));
linkedHashSet.add(new Car("奥迪",3000000));
linkedHashSet.add(new Car("法拉利",100000000));
linkedHashSet.add(new Car("奥迪",3000000));
linkedHashSet.add(new Car("保时捷",700000000));
linkedHashSet.add(new Car("奥迪",3000000));
System.out.println("linkedHashSet = " + linkedHashSet);
}
}
class Car {
private String name;
private double price;
public Car(String name, double price) {
this.name = name;
this.price = price;
}
//重写equals方法 和hashCode
//当name 和price相同时,返回相同的和hashCode
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Car car = (Car) o;
return Double.compare(car.price, price) == 0 &&
Objects.equals(name, car.name);
}
@Override
public int hashCode() {
return Objects.hash(name, price);
}
@Override
public String toString() {
return "Car{" +
"name='" + name + '\'' +
", price=" + price +
'}';
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
}
结果如下