public class AlarmQueue extends java.util.concurrent.ConcurrentHashMap<java.lang.String,AlarmQueue.AlarmToQueue>
The alarms are stored in a map because we want to storein the vector are ordered following their arrival time i.e. the oldest item is in the head.
The class is thread safe.
For the implementation a Set would have been enough but the ConcurrentHashMap is thread safe and there should not be big perfromance difference between this and a concrete Set.
| Modifier and Type | Class and Description |
|---|---|
static class |
AlarmQueue.AlarmToQueue
An alarm to be queued.
|
java.util.concurrent.ConcurrentHashMap.KeySetView<K,V>| Constructor and Description |
|---|
AlarmQueue() |
| Modifier and Type | Method and Description |
|---|---|
void |
add(java.lang.String faultFamily,
java.lang.String faultMember,
int faultCode,
java.util.Properties properties,
boolean active)
Stores the alarm, overwriting any previous settings for the same triplet.
|
clear, compute, computeIfAbsent, computeIfPresent, contains, containsKey, containsValue, elements, entrySet, equals, forEach, forEach, forEach, forEachEntry, forEachEntry, forEachKey, forEachKey, forEachValue, forEachValue, get, getOrDefault, hashCode, isEmpty, keys, keySet, keySet, mappingCount, merge, newKeySet, newKeySet, put, putAll, putIfAbsent, reduce, reduceEntries, reduceEntries, reduceEntriesToDouble, reduceEntriesToInt, reduceEntriesToLong, reduceKeys, reduceKeys, reduceKeysToDouble, reduceKeysToInt, reduceKeysToLong, reduceToDouble, reduceToInt, reduceToLong, reduceValues, reduceValues, reduceValuesToDouble, reduceValuesToInt, reduceValuesToLong, remove, remove, replace, replace, replaceAll, search, searchEntries, searchKeys, searchValues, size, toString, valuespublic void add(java.lang.String faultFamily,
java.lang.String faultMember,
int faultCode,
java.util.Properties properties,
boolean active)
faultFamily - The fault familyfaultMember - The fault memberfaultCode - The fault codeproperties - The user propertiesactive - The state active/terminate