org.ginsim.core.graph.hierarchicaltransitiongraph

Class HierarchicalNodeSet

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractSet<E>

java.util.HashSet<HierarchicalNode>

org.ginsim.core.graph.hierarchicaltransitiongraph.HierarchicalNodeSet

All Implemented Interfaces:

Serializable, Cloneable, Iterable<HierarchicalNode>, Collection<HierarchicalNode>, Set<HierarchicalNode>

public class HierarchicalNodeSet
extends HashSet<HierarchicalNode>

Define a set of nodes for the Hierarchical Transition Graph.
It is used to have an HashSet of HierarchicalNode.

A common question is to know if a certain state has already been encountered, this question is answered using the function :

          public DynamicalHierarchicalNode getHNodeForState(byte[] state)

The java 1.5 definition should be HierarchicalNodeSet<HierarchicalNode>

Author:

Duncan Berenguier

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
HierarchicalNodeSet()

Method Summary

Modifier and Type	Method and Description
boolean	add(HierarchicalNode e)
void	buildHashCode() Initialize the value of the hashCode from the content of the set.
HierarchicalNode	getHNodeForState(byte[] state) Iterate over all the DynamicalHierarchicalNode in the HashSet and test if it contains state using the function contains(state) of HierarchicalNode
int	hashCode()
String	toString()

Methods inherited from class java.util.HashSet

clear, clone, contains, isEmpty, iterator, remove, size, spliterator

Methods inherited from class java.util.AbstractSet

equals, removeAll

Methods inherited from class java.util.AbstractCollection

addAll, containsAll, retainAll, toArray, toArray

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Set

addAll, containsAll, equals, removeAll, retainAll, toArray, toArray

Methods inherited from interface java.util.Collection

parallelStream, removeIf, stream

Methods inherited from interface java.lang.Iterable

forEach

Constructor Detail

HierarchicalNodeSet

public HierarchicalNodeSet()

Method Detail

getHNodeForState

public HierarchicalNode getHNodeForState(byte[] state)

Iterate over all the DynamicalHierarchicalNode in the HashSet and test if it contains state using the function contains(state) of HierarchicalNode

The complexity is equal to the count of HierarchicalNode times the function contains. That is O(|States|x|Genes|).

Parameters:

state - The state to test

Returns:

The node containing the state or null if it is not found

add

public boolean add(HierarchicalNode e)

Specified by:

add in interface Collection<HierarchicalNode>

Specified by:

add in interface Set<HierarchicalNode>

Overrides:

add in class HashSet<HierarchicalNode>

hashCode

public int hashCode()

Specified by:

hashCode in interface Collection<HierarchicalNode>

Specified by:

hashCode in interface Set<HierarchicalNode>

Overrides:

hashCode in class AbstractSet<HierarchicalNode>

buildHashCode

public void buildHashCode()

Initialize the value of the hashCode from the content of the set. Basically its just the sum of the HierarchicalNode's uids.

toString

public String toString()

Overrides:

toString in class AbstractCollection<HierarchicalNode>