1、EnumMap
public enum Size {
SMALL, MEDIUM, LAGER
}
public class Clothes {
private String id;
private Size size;
public Clothes(String id, Size size) {
this.id = id;
this.size = size;
}
public static void main(String[] args) {
List<Clothes> clothes = Arrays.asList(new Clothes[] { new Clothes("C001", Size.SMALL),
new Clothes("C002", Size.LAGER), new Clothes("C003", Size.LAGER), new Clothes("C004", Size.MEDIUM),
new Clothes("C005", Size.SMALL), new Clothes("C006", Size.SMALL), });
System.out.println(countBySize(clothes));
}
public static Map<Size, Integer> countBySize(List<Clothes> colthes) {
final Map<Size, Integer> map = new EnumMap<>(Size.class);
colthes.forEach(col -> {
map.merge(col.getSize(), 1, Integer::sum);
});
return map;
}
}
统计衣服各个尺寸所对应的总数。
2、EnumSet
EnumSet是一个抽象类,不能直接通过new新建。一下做法是错误的
EnumSet<Size> set = new EnumSet<Size>();
应用场景:
想象一个场景,在一些工作中(如医生、客服),不是每个工作人员每天都在的,每个人可工作的时间是不一样的,比如张三可能是周一和周三,李四可能是周四,和周六,给定每个人可工作的时间,我们可能有一些问题需要回答:
- 有没有哪天一个人都不会来?
class Worker {
String name;
Set<Day> availableDays;
public Worker(String name, Set<Day> availableDays) {
this.name = name;
this.availableDays = availableDays;
}
//省略getter、setter方法
}
List<Worker> workers = Arrays.asList({
new Worker("张三", EnumSet.of(
Day.MONDAY, Day.TUESDAY, Day.WEDNESDAY, Day.FRIDAY)),
new Worker("李四", EnumSet.of(
Day.TUESDAY, Day.THURSDAY, Day.SATURDAY)),
new Worker("王五", EnumSet.of(Day.TUESDAY, Day.THURSDAY)),
});
回到问题,哪些天一个人都不会来?
Set<Day> days=EnumSet.allOf(Day.class);
workers.stream.forEach(
worker->days.removeAll(woker.getAvailableDays())
)
System.out.println(days);
2.有哪些天至少会有一个人来?就是求worker时间的并集
Set<Day> days=EnumSet.noneOf(Day.class);
workers.stream.forEach(
worker->days.addAll(worker.getAvailableDays())
)
System.out.println(days);
3.有哪些天所有人都会来,就是求worker时间的交际
workers.stream.forEach(
worker->days.retainAll(worker.getAvailableDays());
)
4.哪些人周一和周二都会来
Set<Worker> availableWorkers = new HashSet<Worker>();
for(Worker w : workers){
if(w.getAvailableDays().containsAll(
EnumSet.of(Day.MONDAY,Day.TUESDAY))){
availableWorkers.add(w);
}
}
for(Worker w : availableWorkers){
System.out.println(w.getName());
}
5、哪些天至少会有两个人来
Map<Day, Integer> countMap = new EnumMap<>(Day.class);
for(Worker w : workers){
for(Day d : w.getAvailableDays()){
Integer count = countMap.get(d);
countMap.put(d, count==null?1:count+1);
}
}
Set<Day> days = EnumSet.noneOf(Day.class);
for(Map.Entry<Day, Integer> entry : countMap.entrySet()){
if(entry.getValue()>=2){
days.add(entry.getKey());
}
}
System.out.println(days);
摘自《JAVA编程的逻辑》