|
1 | 1 | package de.rwth.idsg.steve.utils; |
2 | 2 |
|
3 | 3 | import de.rwth.idsg.steve.repository.dto.ConnectorStatus; |
4 | | -import ocpp.cs._2012._06.ChargePointStatus; |
5 | 4 |
|
6 | | -import java.util.LinkedHashMap; |
| 5 | +import java.util.EnumSet; |
| 6 | +import java.util.HashSet; |
7 | 7 | import java.util.List; |
8 | 8 | import java.util.Map; |
9 | | - |
10 | | -import static ocpp.cs._2012._06.ChargePointStatus.AVAILABLE; |
11 | | -import static ocpp.cs._2012._06.ChargePointStatus.FAULTED; |
12 | | -import static ocpp.cs._2012._06.ChargePointStatus.OCCUPIED; |
13 | | -import static ocpp.cs._2012._06.ChargePointStatus.RESERVED; |
14 | | -import static ocpp.cs._2012._06.ChargePointStatus.UNAVAILABLE; |
| 9 | +import java.util.Set; |
| 10 | +import java.util.TreeMap; |
15 | 11 |
|
16 | 12 | /** |
17 | 13 | * @author Sevket Goekay <goekay@dbis.rwth-aachen.de> |
18 | 14 | * @since 10.03.2016 |
19 | 15 | */ |
20 | 16 | public final class ConnectorStatusCountFilter { |
21 | 17 |
|
22 | | - private ConnectorStatusCountFilter() { } |
23 | | - |
24 | | - /** |
25 | | - * ChargePointStatus in Ocpp 1.5 is a super set of the one in Ocpp 1.2. Therefore, |
26 | | - * using Ocpp 1.5 will cover 1.2 too. |
27 | | - */ |
28 | | - public static Map<ChargePointStatus, Integer> getStatusCountMap(List<ConnectorStatus> latestList) { |
29 | | - List<ConnectorStatus> filteredList = ConnectorStatusFilter.filterAndPreferZero(latestList); |
30 | | - |
31 | | - int countAvailable = 0; |
32 | | - int countOccupied = 0; |
33 | | - int countFaulted = 0; |
34 | | - int countUnavailable = 0; |
35 | | - int countReserved = 0; |
36 | | - |
37 | | - for (ConnectorStatus cs : filteredList) { |
38 | | - ChargePointStatus cps = ChargePointStatus.fromValue(cs.getStatus()); |
39 | | - switch (cps) { |
40 | | - case AVAILABLE: |
41 | | - countAvailable++; |
42 | | - break; |
| 18 | + private static final Set<String> allStatusValues = allStatusValues(); |
43 | 19 |
|
44 | | - case OCCUPIED: |
45 | | - countOccupied++; |
46 | | - break; |
47 | | - |
48 | | - case FAULTED: |
49 | | - countFaulted++; |
50 | | - break; |
| 20 | + private ConnectorStatusCountFilter() { } |
51 | 21 |
|
52 | | - case UNAVAILABLE: |
53 | | - countUnavailable++; |
54 | | - break; |
| 22 | + public static Map<String, Integer> getStatusCountMap(List<ConnectorStatus> latestList) { |
| 23 | + return getStatusCountMap(latestList, false); |
| 24 | + } |
55 | 25 |
|
56 | | - case RESERVED: |
57 | | - countReserved++; |
58 | | - break; |
| 26 | + public static Map<String, Integer> getStatusCountMap(List<ConnectorStatus> latestList, boolean printZero) { |
| 27 | + List<ConnectorStatus> filteredList = ConnectorStatusFilter.filterAndPreferZero(latestList); |
59 | 28 |
|
60 | | - default: |
61 | | - break; |
| 29 | + // TreeMap because we want a consistent order of the listing on the page |
| 30 | + TreeMap<String, Integer> map = new TreeMap<>(); |
| 31 | + for (ConnectorStatus item : filteredList) { |
| 32 | + Integer count = map.get(item.getStatus()); |
| 33 | + if (count == null) { |
| 34 | + count = 1; |
| 35 | + } else { |
| 36 | + count += 1; |
62 | 37 | } |
| 38 | + map.put(item.getStatus(), count); |
| 39 | + } |
| 40 | + |
| 41 | + if (printZero) { |
| 42 | + allStatusValues.forEach(s -> map.putIfAbsent(s, 0)); |
63 | 43 | } |
64 | 44 |
|
65 | | - // LinkedHashMap because we want a consistent order of the listing on the page |
66 | | - Map<ChargePointStatus, Integer> tmp = new LinkedHashMap<>(5); |
67 | | - tmp.put(AVAILABLE, countAvailable); |
68 | | - tmp.put(OCCUPIED, countOccupied); |
69 | | - tmp.put(RESERVED, countReserved); |
70 | | - tmp.put(UNAVAILABLE, countUnavailable); |
71 | | - tmp.put(FAULTED, countFaulted); |
72 | | - return tmp; |
| 45 | + return map; |
73 | 46 | } |
| 47 | + |
| 48 | + private static Set<String> allStatusValues() { |
| 49 | + HashSet<String> set = new HashSet<>(); |
| 50 | + EnumSet.allOf(ocpp.cs._2010._08.ChargePointStatus.class).forEach(k -> set.add(k.value())); |
| 51 | + EnumSet.allOf(ocpp.cs._2012._06.ChargePointStatus.class).forEach(k -> set.add(k.value())); |
| 52 | + EnumSet.allOf(ocpp.cs._2015._10.ChargePointStatus.class).forEach(k -> set.add(k.value())); |
| 53 | + return set; |
| 54 | + } |
| 55 | + |
74 | 56 | } |
0 commit comments