performance optimization

src/de/dhbwstuttgart/typeinference/unify/MartelliMontanariUnify.java

@@ -50,12 +50,6 @@ public class MartelliMontanariUnify implements IUnify {
 			TypeParams rhsTypeParams = rhsType.getTypeParams();
 			TypeParams lhsTypeParams = lhsType.getTypeParams();
 			
-			// DELETE - Rule
-			if(pair.getRhsType().equals(pair.getLhsType())) {
-				termsList.remove(idx);
-				continue; 
-			}
-			
 			// REDUCE - Rule
 			if(!(rhsType instanceof PlaceholderType) && !(lhsType instanceof PlaceholderType)) {
 				Set<UnifyPair> result = new HashSet<>();
@@ -79,6 +73,12 @@ public class MartelliMontanariUnify implements IUnify {
 				continue;
 			}
 			
+			// DELETE - Rule
+			if(pair.getRhsType().equals(pair.getLhsType())) {
+				termsList.remove(idx);
+				continue; 
+			}
+
 			// SWAP - Rule
 			if(!(lhsType instanceof PlaceholderType) && (rhsType instanceof PlaceholderType)) {
 				termsList.remove(idx);

src/de/dhbwstuttgart/typeinference/unify/model/FiniteClosure.java

@@ -106,10 +106,10 @@ public class FiniteClosure implements IFiniteClosure {
 	    
 	    // Permute all params with values that are in smArg() of that type.
 	    // This corresponds to Case 3 in the definition of the subtyping relation.
-		{ArrayList<Set<UnifyType>> paramCandidates = new ArrayList<>();
+		/*{ArrayList<Set<UnifyType>> paramCandidates = new ArrayList<>();
 		for (UnifyType param : type.getTypeParams())
 				paramCandidates.add(smArg(param));
-		permuteParams(paramCandidates).forEach(x -> result1.add(type.setTypeParams(x)));}
+		permuteParams(paramCandidates).forEach(x -> result1.add(type.setTypeParams(x)));}*/
 		
 		// This is case 2 of the definition of the subtyping relation.
 		Set<UnifyType> result2 = new HashSet<>();
@@ -117,16 +117,18 @@ public class FiniteClosure implements IFiniteClosure {
 			HashSet<UnifyType> candidates = new HashSet<>();
 			// All types with the same name
 			strInheritanceGraph.get(type.getName()).forEach(x -> candidates.add(x.getContent()));
-			for(UnifyType typePrime : result1) {
+			//for(UnifyType typePrime : result1) {
 			for (UnifyType theta2 : candidates) {
 				// Find the substitution
-					Optional<Unifier> sigma2Opt = unify.unify(typePrime, theta2);
+				Optional<Unifier> sigma2Opt = unify.unify(type, theta2);
 				if (!sigma2Opt.isPresent())
 					continue;
 				Unifier sigma2 = sigma2Opt.get();
-					sigma2.swapPlaceholderSubstitutions(typePrime.getTypeParams());
+				if(sigma2.size() == 0)
-					if(type.equals(theta2))
 					continue;
+				sigma2.swapPlaceholderSubstitutions(type.getTypeParams());
+				//if(type.equals(theta2))
+				//	continue;
 				Set<UnifyType> theta1s = smaller(theta2);
 				for (UnifyType theta1 : theta1s) {
 					// Because only the most general type is calculated, sigma1 = sigma2
@@ -135,7 +137,6 @@ public class FiniteClosure implements IFiniteClosure {
 			     }
 			}
 		}
-		}
 		else
 			result2 = result1;
 		
@@ -210,10 +211,10 @@ public class FiniteClosure implements IFiniteClosure {
 	    
 	    // Permute all params with values that are in smArg() of that type.
 	    // This corresponds to Case 3 in the definition of the subtyping relation.
-		{ArrayList<Set<UnifyType>> paramCandidates = new ArrayList<>();
+		/*{ArrayList<Set<UnifyType>> paramCandidates = new ArrayList<>();
 		for (UnifyType param : type.getTypeParams())
 				paramCandidates.add(grArg(param));
-		permuteParams(paramCandidates).forEach(x -> result1.add(type.setTypeParams(x)));}
+		permuteParams(paramCandidates).forEach(x -> result1.add(type.setTypeParams(x)));}*/
 		
 		// This is case 2 of the definition of the subtyping relation.
 		Set<UnifyType> result2 = new HashSet<>();
@@ -222,23 +223,26 @@ public class FiniteClosure implements IFiniteClosure {
 			// All types with the same name
 			strInheritanceGraph.get(type.getName()).forEach(x -> candidates.add(x.getContent()));
 
-			for(UnifyType typePrime : result1) {
+			// for(UnifyType typePrime : result1)
 			for (UnifyType theta2 : candidates) {
 				// Find the substitution
-					Optional<Unifier> sigma2Opt = unify.unify(typePrime, theta2);
+				Optional<Unifier> sigma2Opt = unify.unify(type, theta2);
 				if (!sigma2Opt.isPresent())
 					continue;
-					if(type.equals(theta2))
+				//if (type.equals(theta2))
-						continue;
+				//	continue;
 				Unifier sigma2 = sigma2Opt.get();
-					sigma2.swapPlaceholderSubstitutions(typePrime.getTypeParams());
+				if(sigma2.size() == 0) // type.equals(theta2)
+					continue;
+				sigma2.swapPlaceholderSubstitutions(type.getTypeParams());
 				Set<UnifyType> theta1s = greater(theta2);
 				for (UnifyType theta1 : theta1s) {
-						// Because only the most general type is calculated, sigma1 = sigma2
+					// Because only the most general type is calculated, sigma1
+					// = sigma2
 					UnifyType sigma1Theta1 = sigma2.apply(theta1);
 					result2.add(sigma1Theta1);
 				}
-				}
+			// }
 			}
 		}
 		

src/de/dhbwstuttgart/typeinference/unify/model/TypeParams.java

@@ -15,6 +15,11 @@ public final class TypeParams implements Iterable<UnifyType>{
 	 */
 	private final UnifyType[] typeParams;
 
+	/**
+	 * Hashcode calculation is expensive and must be cached.
+	 */
+	private final int hashCode;
+	
 	/**
 	 * Creates a new set of type parameters.
 	 * @param types The type parameters.
@@ -23,6 +28,9 @@ public final class TypeParams implements Iterable<UnifyType>{
 		typeParams = new UnifyType[types.size()];
 		for(int i=0;i<types.size();i++)
 			typeParams[i] = types.get(i);
+		
+		// Hashcode calculation is expensive and must be cached.
+		hashCode = Arrays.hashCode(typeParams);
 	}
 	
 	/**
@@ -31,6 +39,9 @@ public final class TypeParams implements Iterable<UnifyType>{
 	 */
 	public TypeParams(UnifyType... types) {
 		typeParams = types;
+		
+		// Hashcode calculation is expensive and must be cached.
+		hashCode = Arrays.hashCode(typeParams);
 	}
 	
 	/**
@@ -108,7 +119,7 @@ public final class TypeParams implements Iterable<UnifyType>{
 	
 	@Override
 	public int hashCode() {
-		return Arrays.hashCode(typeParams);
+		return hashCode;
 	}
 	
 	@Override

src/de/dhbwstuttgart/typeinference/unify/model/Unifier.java

@@ -81,6 +81,13 @@ public class Unifier implements Function<UnifyType, UnifyType>, Iterable<Entry<P
 		return substitutions.get(t);
 	}
 
+	/**
+	 * The number of substitutions in the unifier. If zero, this is the identity function.
+	 */
+	public int size() {
+		return substitutions.size();
+	}
+	
 	/**
 	 * Garantuees that if there is a substitutions (a -> b) in this unifier,
 	 * a is not an element of the targetParams. Substitutions that do not

src/de/dhbwstuttgart/typeinference/unify/model/UnifyPair.java

@@ -9,18 +9,20 @@ public class UnifyPair {
 	/**
 	 * The type on the left hand side of the pair.
 	 */
-	private UnifyType lhs;
+	private final UnifyType lhs;
 	
 	/**
 	 * The type on the right hand side of the pair.
 	 */
-	private UnifyType rhs;
+	private final UnifyType rhs;
 	
 	/**
 	 * The operator that determines the relation between the left and right hand side type.
 	 */
 	private PairOperator pairOp;
 	
+	private final int hashCode;
+	
 	/**
 	 * Creates a new instance of the pair.
 	 * @param lhs The type on the left hand side of the pair.
@@ -31,6 +33,9 @@ public class UnifyPair {
 		this.lhs = lhs;
 		this.rhs = rhs;
 		pairOp = op;
+		
+		// Caching hashcode
+		hashCode = 17 + 31 * lhs.hashCode() + 31 * rhs.hashCode() + 31 * pairOp.hashCode();
 	}	
 	
 	/**
@@ -68,7 +73,7 @@ public class UnifyPair {
 
 	@Override
 	public int hashCode() {
-		return 17 + 31 * lhs.hashCode() + 31 * rhs.hashCode() + 31 * pairOp.hashCode();
+		return hashCode;
 	}
 	
 	@Override