import java.util.ArrayList;
import java.util.Collection;
-import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
-import java.util.concurrent.atomic.AtomicLong;
import org.wamblee.xmlrouter.common.Id;
import org.wamblee.xmlrouter.config.Transformation;
+/**
+ * This class manages transformations and computes the shortest transformations
+ * paths based on the provided transformations.
+ *
+ * @author Erik Brakkee
+ *
+ */
public class Transformations {
- private AtomicLong sequenceNumber;
private Map<Id<Transformation>, Transformation> transformations;
private List<String> vertices;
private TransformationPath[][] matrix;
private Map<String, List<TransformationPath>> sequences;
+ /**
+ * Construct the transformations.
+ */
public Transformations() {
- sequenceNumber = new AtomicLong(1);
transformations = new LinkedHashMap<Id<Transformation>, Transformation>();
vertices = new ArrayList<String>();
matrix = new TransformationPath[0][0];
}
- public Id<Transformation> addTransformation(Transformation aTransformation) {
- long seqno = sequenceNumber.getAndIncrement();
- Id<Transformation> id = new Id<Transformation>(seqno);
- transformations.put(id, new RobustTransformation(id, aTransformation));
+ public void replaceTransformations(
+ Map<Id<Transformation>, Transformation> aTransformations) {
+ transformations = aTransformations;
computeTransformationSequences();
- return id;
}
+ /**
+ * Gets the possible target types based on an input type.
+ *
+ * @param aType
+ * Input type.
+ * @return Possible target types.
+ */
public Collection<String> getPossibleTargetTypes(String aType) {
int index = vertices.indexOf(aType);
Set<String> res = new HashSet<String>();
return matrix[i][j];
}
+ /**
+ * Computest the transformation sequences using Floyd's algorithm.
+ */
private void computeTransformationSequences() {
vertices = new ArrayList<String>();
.size();
}
- public void removeTransformation(Id<Transformation> aId) {
- transformations.remove(aId);
- computeTransformationSequences();
- }
-
- public Collection<Id<Transformation>> getTransformations() {
- return Collections.unmodifiableCollection(transformations.keySet());
- }
-
- public Transformation getTransformation(Id<Transformation> aId) {
- return transformations.get(aId);
- }
-
@Override
public String toString() {
StringBuffer buf = new StringBuffer();