energy.evaluation

Class EvaluationGraphNodeByTime

java.lang.Object

java.util.AbstractMap<K,V>

java.util.concurrent.ConcurrentHashMap<java.lang.Long,java.util.HashMap<java.lang.Integer,EvaluationGraphNode>>

energy.evaluation.EvaluationGraphNodeByTime

All Implemented Interfaces:

java.io.Serializable, java.util.concurrent.ConcurrentMap<java.lang.Long,java.util.HashMap<java.lang.Integer,EvaluationGraphNode>>, java.util.Map<java.lang.Long,java.util.HashMap<java.lang.Integer,EvaluationGraphNode>>

public class EvaluationGraphNodeByTime
extends java.util.concurrent.ConcurrentHashMap<java.lang.Long,java.util.HashMap<java.lang.Integer,EvaluationGraphNode>>

The Class EvaluationGraphNodeByTime serves as an organiser of all EvaluationGraphNodes over time within the EvaluationGraph. Thus, it provides corresponding help methods.

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class java.util.concurrent.ConcurrentHashMap

java.util.concurrent.ConcurrentHashMap.KeySetView<K,V>

Nested classes/interfaces inherited from class java.util.AbstractMap

java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V>

Nested classes/interfaces inherited from interface java.util.Map

java.util.Map.Entry<K,V>

Constructor Summary

Constructors

Constructor and Description
EvaluationGraphNodeByTime()

Method Summary

Modifier and Type	Method and Description
java.util.Vector<java.lang.Long>	getTimeVector() Returns a copy of the current time as vector (to avoid concurrent exceptions).
java.util.Vector<java.lang.Long>	getTimeVector(javax.swing.SortOrder sortOrder) Returns a copy of the current time as vector (to avoid concurrent exceptions).
void	put(EvaluationGraphNode evaluationGraphNode) Put method that enables to simply put an EvaluationGraphNode into the local hash structure.
void	remove(EvaluationGraphNode evaluationGraphNode) Removes the specified EvaluationGraphNode out of the local hash structure.

Methods inherited from class java.util.concurrent.ConcurrentHashMap

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, values

Methods inherited from class java.util.AbstractMap

clone

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

EvaluationGraphNodeByTime

public EvaluationGraphNodeByTime()

Method Detail

getTimeVector

public java.util.Vector<java.lang.Long> getTimeVector()

Returns a copy of the current time as vector (to avoid concurrent exceptions).

Returns:

the current time vector

getTimeVector

public java.util.Vector<java.lang.Long> getTimeVector(javax.swing.SortOrder sortOrder)

Returns a copy of the current time as vector (to avoid concurrent exceptions).

Returns:

the current time vector

put

public void put(EvaluationGraphNode evaluationGraphNode)

Put method that enables to simply put an EvaluationGraphNode into the local hash structure.

Parameters:

evaluationGraphNode - the evaluation graph node

remove

public void remove(EvaluationGraphNode evaluationGraphNode)

Removes the specified EvaluationGraphNode out of the local hash structure.

Parameters:

evaluationGraphNode - the evaluation graph node