Fix test

modified:   ../src/main/java/de/dhbwstuttgart/core/JavaTXCompiler.java
	modified:   ../src/test/java/TestComplete.java

resources/bytecode/javFiles/Bug365.jav

@@ -1,12 +1,13 @@
 import java.lang.String;
+import java.lang.Object;
 
 public class Bug365{
   swap(f){
     return x -> y -> f.apply(y).apply(x);
   }
 
-  swap(f){
-    return x -> y -> z -> f.apply(z).apply(x).apply(y);
+  swap(Fun1$$<String, Fun1$$<String, Fun1$$<String, Object>>> f){
+    return x -> y -> z -> f.apply(z).apply(y).apply(x);
   }
 
   public ex1() {

resources/bytecode/javFiles/Bug365a.jav

@@ -1,13 +0,0 @@
-import java.lang.String;
-
-public class Bug365a{
-  swap(f){
-    return x -> y -> f.apply(y).apply(x);
-  }
-
- 
-  public ex2() {
-    var func = x -> y -> x + y;
-    return swap(func).apply("A").apply("B");
-  }
-}

resources/bytecode/javFiles/Bug371.jav

@@ -0,0 +1,10 @@
+import java.lang.Boolean;
+
+public class Bug371 {
+    static m1(x, y) { return x || y; }
+    static m2(x, y) { return x && y; }
+
+    public static test() {
+        return m2(m1(true, false), true);
+    }
+}

resources/bytecode/javFiles/BugXXX.jav

@@ -1,16 +0,0 @@
-import java.util.ArrayList;
-import java.util.List;
-import java.util.Optional;
-import java.lang.String;
-import java.util.stream.Stream;
-import java.util.function.Function;
-import java.util.function.Predicate;
-import java.lang.Integer;
-
-class BugXXX {
-    public main() {
-        List<Integer> i = new ArrayList<>(List.of(1,2,3,4,5,6,7,8,9,10));
-        Optional<Integer> tmp = i.stream().filter(x -> x == 5).map(x -> x*2).findFirst();
-        return tmp;
-    }
-}

src/main/java/de/dhbwstuttgart/bytecode/FunNGenerator.java

@@ -39,6 +39,10 @@ public class FunNGenerator {
         public final List<TargetType> inParams;
         public final List<TargetType> realParams;
 
+        public GenericParameters(TargetFunNType funNType) {
+            this(funNType.funNParams(), funNType.returnArguments());
+        }
+
         public GenericParameters(List<TargetType> params, int numReturns) {
             this.realParams = params;
             this.inParams = flattenTypeParams(params);

src/main/java/de/dhbwstuttgart/core/JavaTXCompiler.java

@@ -393,7 +393,12 @@ public class JavaTXCompiler {
 			logFile.write(ASTTypePrinter.print(sf));
 			System.out.println(ASTTypePrinter.print(sf));
 			logFile.flush();
-			System.out.println("Unify nach Oder-Constraints-Anpassung:" + unifyCons.toString());
+			List<UnifyPair> andConstraintsSorted = unifyCons.getUndConstraints().stream()
+					.sorted(Comparator.comparing(UnifyPair::getPairOp).thenComparing(UnifyPair::getLhsType, Comparator.comparing(UnifyType::getName)))
+					.collect(Collectors.toList());
+
+			System.out.println(andConstraintsSorted);
+
 			Set<PlaceholderType> varianceTPHold;
 			Set<PlaceholderType> varianceTPH = new HashSet<>();
 			varianceTPH = varianceInheritanceConstraintSet(unifyCons);
@@ -416,7 +421,14 @@ public class JavaTXCompiler {
 				UnifyResultListenerImpl li = new UnifyResultListenerImpl();
 				urm.addUnifyResultListener(li);
 				unify.unifyParallel(unifyCons.getUndConstraints(), oderConstraints, finiteClosure, logFile, log, urm, usedTasks);
-				System.out.println("RESULT Final: " + li.getResults());
+				//System.out.println("RESULT Final: " + li.getResults());
+				var finalResults = li.getResults().stream().sorted().toList();
+				int i = 0;
+				System.out.println("RESULT Final: ");
+				for (var result : finalResults){
+					System.out.println("Result: " + i++);
+					System.out.println(result.getSortedResults());
+				}
 				System.out.println("Constraints for Generated Generics: " + " ???");
 				logFile.write("RES_FINAL: " + li.getResults().toString() + "\n");
 				logFile.flush();

src/main/java/de/dhbwstuttgart/parser/SyntaxTreeGenerator/StatementGenerator.java

@@ -1099,9 +1099,9 @@ public class StatementGenerator {
             block = lambdaGenerator.convert(expression.lambdaBody().block(), true);
         }
         List<RefTypeOrTPHOrWildcardOrGeneric> funNParams = new ArrayList<>();
-        funNParams.add(TypePlaceholder.fresh(expression.getStart()));// ret-Type
+        funNParams.add(TypePlaceholder.fresh(expression.getStart(), -1, false));// ret-Type
         params.getFormalparalist().forEach(formalParameter -> // Für jeden Parameter einen TPH anfügen:
-        funNParams.add(TypePlaceholder.fresh(expression.getStart())));
+        	funNParams.add(TypePlaceholder.fresh(expression.getStart(), 1, false)));
         RefTypeOrTPHOrWildcardOrGeneric lambdaType = TypePlaceholder.fresh(expression.getStart());
         // RefType lambdaType = new
         // RefType(reg.getName("Fun"+params.getFormalparalist().size()),

src/main/java/de/dhbwstuttgart/parser/scope/JavaClassRegistry.java

@@ -7,7 +7,7 @@ import java.util.*;
 /**
  * Speichert die Klassen f<>r einen bestimmten Projektscope
  */
-public class JavaClassRegistry {
+public class JavaClassRegistry{
     final Map<JavaClassName, Integer> existingClasses = new HashMap<>();
 
     public JavaClassRegistry(Map<String, Integer> initialNames) {
@@ -22,6 +22,10 @@ public class JavaClassRegistry {
         }
     }
 
+    public Set<JavaClassName> getAllClassNames(){
+        return existingClasses.keySet();
+    }
+
     public void addName(String className, int numberOfGenerics) {
         existingClasses.put(new JavaClassName(className), numberOfGenerics);
     }

src/main/java/de/dhbwstuttgart/target/generate/ASTToTargetAST.java

@@ -11,6 +11,8 @@ import de.dhbwstuttgart.syntaxtree.Record;
 import de.dhbwstuttgart.syntaxtree.factory.ASTFactory;
 import de.dhbwstuttgart.syntaxtree.statement.*;
 import de.dhbwstuttgart.syntaxtree.type.*;
+import de.dhbwstuttgart.syntaxtree.visual.ASTPrinter;
+import de.dhbwstuttgart.syntaxtree.visual.OutputGenerator;
 import de.dhbwstuttgart.target.tree.*;
 import de.dhbwstuttgart.target.tree.expression.*;
 import de.dhbwstuttgart.target.tree.type.*;
@@ -780,7 +782,15 @@ public class ASTToTargetAST {
         return TargetFunNType.fromParams(params, filteredParams, gep.getReturnType() != null ? 1 : 0);
     }
 
+    private FunNGenerator.GenericParameters convertToParameters(TargetFunNType input) {
+        return null;
+    }
+
     private boolean isSubtype(TargetType test, TargetType other) {
+        if (other.equals(TargetType.Object)) return true;
+        if (test instanceof TargetFunNType tfun && other instanceof TargetFunNType ofun)
+            return isSubtype(new FunNGenerator.GenericParameters(tfun), new FunNGenerator.GenericParameters(ofun));
+
         var testClass = compiler.getClass(new JavaClassName(test.name()));
         var otherClass = compiler.getClass(new JavaClassName(other.name()));
         if (testClass == null) return false;

src/main/java/de/dhbwstuttgart/target/generate/StatementToTargetExpression.java

@@ -138,7 +138,10 @@ public class StatementToTargetExpression implements ASTVisitor {
 
     @Override
     public void visit(BoolExpression bool) {
-        System.out.println("BoolExpression");
+        result = switch(bool.operation) {
+        case OR -> new TargetBinaryOp.Or(converter.convert(bool.getType()), converter.convert(bool.lexpr), converter.convert(bool.rexpr));
+        case AND -> new TargetBinaryOp.And(converter.convert(bool.getType()), converter.convert(bool.lexpr), converter.convert(bool.rexpr));
+        };
     }
 
     @Override

src/main/java/de/dhbwstuttgart/typeinference/constraints/Constraint.java

@@ -6,7 +6,7 @@ import java.util.Collection;
 import java.util.HashSet;
 import java.util.Set;
 
-public class Constraint<A> extends HashSet<A> {
+public class Constraint<A> extends HashSet<A> implements Comparable<Constraint<A>> {
 	private static final long serialVersionUID = 1L;
 	private Boolean isInherited = false;//wird beides nur für die Method-Constraints benoetigt
 	private Boolean isImplemented = false;
@@ -74,4 +74,8 @@ public class Constraint<A> extends HashSet<A> {
 		return super.toString();
 	}
 
+	@Override
+	public int compareTo(Constraint<A> o) {
+		return this.toString().compareTo(o.toString());
+	}
 }

src/main/java/de/dhbwstuttgart/typeinference/result/ResultPair.java

@@ -5,7 +5,7 @@ import de.dhbwstuttgart.syntaxtree.type.RefTypeOrTPHOrWildcardOrGeneric;
 /**
  * Paare, welche das Unifikationsergebnis darstellen
  */
-public abstract class ResultPair<A extends RefTypeOrTPHOrWildcardOrGeneric,B extends RefTypeOrTPHOrWildcardOrGeneric> {
+public abstract class ResultPair<A extends RefTypeOrTPHOrWildcardOrGeneric, B extends RefTypeOrTPHOrWildcardOrGeneric> implements Comparable<ResultPair<A,B>> {
     private final A left;
     private final B right;
 
@@ -59,4 +59,13 @@ public abstract class ResultPair<A extends RefTypeOrTPHOrWildcardOrGeneric,B ext
 		return true;
 	}
 
+	@Override
+	public int compareTo(ResultPair<A, B> o) {
+		if (o == null) {
+			return 1; // this is greater than null
+		}
+
+		return o.left.toString().compareTo(this.left.toString());
+	}
+   
 }

src/main/java/de/dhbwstuttgart/typeinference/result/ResultSet.java

@@ -1,6 +1,8 @@
 package de.dhbwstuttgart.typeinference.result;
 
+import java.util.Collections;
 import java.util.HashSet;
+import java.util.List;
 import java.util.Set;
 
 import de.dhbwstuttgart.exceptions.NotImplementedException;
@@ -12,7 +14,7 @@ import de.dhbwstuttgart.syntaxtree.type.SuperWildcardType;
 import de.dhbwstuttgart.syntaxtree.type.TypePlaceholder;
 
 @SuppressWarnings("rawtypes")
-public class ResultSet {
+public class ResultSet implements Comparable<ResultSet>{
 
     public final Set<ResultPair> results;
     public Set<ResultPair<TypePlaceholder, TypePlaceholder>> genIns;
@@ -23,6 +25,10 @@ public class ResultSet {
         results.forEach(x -> { if (x instanceof PairTPHsmallerTPH) { this.genIns.add(x);}} );
     }
 
+    public List<ResultPair> getSortedResults() {
+    	return results.stream().sorted().toList();
+    }
+    
     public boolean contains(ResultPair toCheck) {
     	return this.results.contains(toCheck);
     }
@@ -63,6 +69,21 @@ public class ResultSet {
 	public int hashCode() {
 		return results.hashCode();
 	}
+
+    @Override
+    public int compareTo(ResultSet o) {
+        List<ResultPair> thisSorted = this.getSortedResults();
+        List<ResultPair> otherSorted = o.getSortedResults();
+        int sizeCompare = Integer.compare(thisSorted.size(), otherSorted.size());
+        if (sizeCompare != 0) return sizeCompare;
+
+        for (int i = 0; i < thisSorted.size(); i++) {
+            int cmp = thisSorted.get(i).compareTo(otherSorted.get(i));
+            if (cmp != 0) return cmp;
+        }
+
+        return 0;
+    }
 }
 
 class Resolver implements ResultSetVisitor {

src/main/java/de/dhbwstuttgart/typeinference/typeAlgo/TYPEStmt.java

@@ -73,7 +73,7 @@ public class TYPEStmt implements StatementVisitor {
 
     @Override
     public void visit(LambdaExpression lambdaExpression) {
-        TypePlaceholder tphRetType = TypePlaceholder.fresh(new NullToken());
+        TypePlaceholder tphRetType = TypePlaceholder.fresh(new NullToken(), -1, false);
         List<RefTypeOrTPHOrWildcardOrGeneric> lambdaParams = lambdaExpression.params.getFormalparalist().stream().map((formalParameter -> formalParameter.getType())).collect(Collectors.toList());
         lambdaParams.add(tphRetType);
         // lambdaParams.add(0,tphRetType);
@@ -635,18 +635,8 @@ public class TYPEStmt implements StatementVisitor {
             params.add(resolver.resolve(new GenericRefType(gtv.getName(), new NullToken())));
         }
         RefTypeOrTPHOrWildcardOrGeneric receiverType;
-        //alle Variance auf COntravariant setzen
+        
         if (receiver instanceof FunNClass) {
-        	params.forEach(x -> {
-        		if (x instanceof TypePlaceholder) {
-        			((TypePlaceholder) x).setVariance(1);
-        		}}
-        		);
-        	//Returntyp auf Contravariance setzen.
-        	RefTypeOrTPHOrWildcardOrGeneric para;
-        	if ((para= params.getLast()) instanceof TypePlaceholder) {
-        		((TypePlaceholder) para).setVariance(-1);
-        	}
             receiverType = new RefType(new JavaClassName(receiver.getClassName().toString() + "$$"), params, new NullToken()); // new FunN(params);
         } else {
             receiverType = new RefType(receiver.getClassName(), params, new NullToken());

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

@@ -5,14 +5,7 @@ import java.io.IOException;
 import java.io.Writer;
 import java.lang.reflect.Modifier;
 import java.sql.Array;
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.HashMap;
-import java.util.HashSet;
-import java.util.Hashtable;
-import java.util.List;
-import java.util.Optional;
-import java.util.Set;
+import java.util.*;
 import java.util.function.BiFunction;
 import java.util.function.BinaryOperator;
 import java.util.function.Predicate;
@@ -40,18 +33,21 @@ import org.apache.commons.io.output.NullWriter;
 
 /**
  * The finite closure for the type unification
+ *
  * @author Florian Steurer
  */
 public class FiniteClosure //extends Ordering<UnifyType> //entfernt PL 2018-12-11
-implements IFiniteClosure  {
+        implements IFiniteClosure {
 
     final JavaTXCompiler compiler;
 
     Writer logFile;
     static Boolean log = false;
+
     public void setLogTrue() {
         log = true;
     }
+
     /**
      * A map that maps every type to the node in the inheritance graph that contains that type.
      */
@@ -88,7 +84,7 @@ implements IFiniteClosure  {
         inheritanceGraph = new HashMap<UnifyType, Node<UnifyType>>();
 
         // Build the transitive closure of the inheritance tree
-		for(UnifyPair pair : pairs) {
+        for (UnifyPair pair : pairs) {
 			
 			/*
 			try { 
@@ -100,7 +96,7 @@ implements IFiniteClosure  {
 			}
 			*/
 
-			if(pair.getPairOp() != PairOperator.SMALLER)
+            if (pair.getPairOp() != PairOperator.SMALLER)
                 continue;
 
             //VERSUCH PL 18-02-06
@@ -109,11 +105,11 @@ implements IFiniteClosure  {
             //if (!pair.getLhsType().getTypeParams().arePlaceholders()
             //		&& !pair.getRhsType().getTypeParams().arePlaceholders())
             //	continue;
-;			
+            ;
             // Add nodes if not already in the graph
-			if(!inheritanceGraph.containsKey(pair.getLhsType()))
+            if (!inheritanceGraph.containsKey(pair.getLhsType()))
                 inheritanceGraph.put(pair.getLhsType(), new Node<UnifyType>(pair.getLhsType()));
-			if(!inheritanceGraph.containsKey(pair.getRhsType()))
+            if (!inheritanceGraph.containsKey(pair.getRhsType()))
                 inheritanceGraph.put(pair.getRhsType(), new Node<UnifyType>(pair.getRhsType()));
 
             Node<UnifyType> childNode = inheritanceGraph.get(pair.getLhsType());
@@ -127,14 +123,55 @@ implements IFiniteClosure  {
             childNode.getDescendants().stream().forEach(x -> x.addPredecessor(parentNode));
 
             //PL eingefuegt 2020-05-07 File UnitTest InheritTest.java
-			this.inheritanceGraph.forEach((x,y) -> { if (y.getDescendants().contains(parentNode)) { y.addDescendant(childNode); y.addAllDescendant(childNode.getDescendants());};
-													 if (y.getPredecessors().contains(childNode)) { y.addPredecessor(parentNode); y.addAllPredecessor(parentNode.getPredecessors());};} );
+            this.inheritanceGraph.forEach((x, y) -> {
+                if (y.getDescendants().contains(parentNode)) {
+                    y.addDescendant(childNode);
+                    y.addAllDescendant(childNode.getDescendants());
+                }
+                ;
+                if (y.getPredecessors().contains(childNode)) {
+                    y.addPredecessor(parentNode);
+                    y.addAllPredecessor(parentNode.getPredecessors());
+                }
+                ;
+            });
+        }
+
+        List<String> classesToKeep = new ArrayList<>(compiler.classRegistry.getAllClassNames().stream().map(JavaClassName::toString).toList());
+
+        classesToKeep.add("java.lang.Object");
+        classesToKeep.add("java.lang.Number");
+        classesToKeep.add("java.util.Collection");
+        classesToKeep.add("java.lang.Iterable");
+
+        //filter out all types not imported
+        Iterator<Map.Entry<UnifyType, Node<UnifyType>>> iterator = inheritanceGraph.entrySet().iterator();
+
+        while (iterator.hasNext()) {
+            Map.Entry<UnifyType, Node<UnifyType>> entry = iterator.next();
+            var name = entry.getKey().getName();
+
+            if (!classesToKeep.contains(name)) {
+                iterator.remove();
+            } else {
+                Node<UnifyType> node = entry.getValue();
+
+                // Remove unwanted predecessors
+                node.getPredecessors().removeIf(pred ->
+                        !classesToKeep.contains(pred.getContent().getName())
+                );
+
+                // Remove unwanted descendants
+                node.getDescendants().removeIf(desc ->
+                        !classesToKeep.contains(desc.getContent().getName())
+                );
+            }
         }
 
         // Build the alternative representation with strings as keys
         strInheritanceGraph = new HashMap<>();
-		for(UnifyType key : inheritanceGraph.keySet()) {
-			if(!strInheritanceGraph.containsKey(key.getName()))
+        for (UnifyType key : inheritanceGraph.keySet()) {
+            if (!strInheritanceGraph.containsKey(key.getName()))
                 strInheritanceGraph.put(key.getName(), new HashSet<>());
 
             strInheritanceGraph.get(key.getName()).add(inheritanceGraph.get(key));
@@ -159,6 +196,7 @@ implements IFiniteClosure  {
 
     /**
      * Returns all types of the finite closure that are subtypes of the argument.
+     *
      * @return The set of subtypes of the argument.
      */
     @Override
@@ -170,10 +208,10 @@ implements IFiniteClosure  {
             return new HashSet<>(ret);
         }
 
-		if(type instanceof FunNType)
+        if (type instanceof FunNType)
             return computeSmallerFunN((FunNType) type, fBounded);
 
-		Set<Pair<UnifyType,Set<UnifyType>>> ts = new HashSet<>();
+        Set<Pair<UnifyType, Set<UnifyType>>> ts = new HashSet<>();
         ts.add(new Pair<>(type, fBounded));
         Set<UnifyType> result = computeSmaller(ts);
         smallerHash.put(new hashKeyType(type), result);
@@ -191,48 +229,47 @@ implements IFiniteClosure  {
     /**
      * Computes the smaller functions for every type except FunNTypes.
      */
-	private Set<UnifyType> computeSmaller(Set<Pair<UnifyType,Set<UnifyType>>> types) {
-		Set<Pair<UnifyType,Set<UnifyType>>> result = new HashSet<>();
+    private Set<UnifyType> computeSmaller(Set<Pair<UnifyType, Set<UnifyType>>> types) {
+        Set<Pair<UnifyType, Set<UnifyType>>> result = new HashSet<>();
 
         //PL 18-02-05 Unifier durch Matcher ersetzt
         //IUnify unify = new MartelliMontanariUnify();
         Match match = new Match();
 
-		for(Pair<UnifyType,Set<UnifyType>> pt : types) {
+        for (Pair<UnifyType, Set<UnifyType>> pt : types) {
             UnifyType t = pt.getKey();
             Set<UnifyType> fBounded = pt.getValue().get();
 
             // if T = T' then T <* T'
             try {
                 result.add(new Pair<>(t, fBounded));
-			}
-			catch (StackOverflowError e) {
+            } catch (StackOverflowError e) {
                 System.out.println("");
             }
 
             // if C<...> <* C<...> then ... (third case in definition of <*)
-			if(t.getTypeParams().size() > 0) {
+            if (t.getTypeParams().size() > 0) {
                 ArrayList<Set<UnifyType>> paramCandidates = new ArrayList<>();
                 for (int i = 0; i < t.getTypeParams().size(); i++)
                     paramCandidates.add(smArg(t.getTypeParams().get(i), fBounded));
                 permuteParams(paramCandidates).forEach(x -> result.add(new Pair<>(t.setTypeParams(x), fBounded)));
             }
 
-			if(!strInheritanceGraph.containsKey(t.getName()))
+            if (!strInheritanceGraph.containsKey(t.getName()))
                 continue;
 
             // if T <* T' then sigma(T) <* sigma(T')
             Set<Node<UnifyType>> candidates = strInheritanceGraph.get(t.getName()); //cadidates= [???Node(java.util.Vector<java.util.Vector<java.lang.Integer>>)???
             // , Node(java.util.Vector<gen_hv>)
             //]
-			for(Node<UnifyType> candidate :  candidates) {
+            for (Node<UnifyType> candidate : candidates) {
                 UnifyType theta2 = candidate.getContent();
                 //PL 18-02-05 Unifier durch Matcher ersetzt ANFANG
-				ArrayList<UnifyPair> termList= new ArrayList<UnifyPair>();
-				termList.add(new UnifyPair(theta2,t, PairOperator.EQUALSDOT));
+                ArrayList<UnifyPair> termList = new ArrayList<UnifyPair>();
+                termList.add(new UnifyPair(theta2, t, PairOperator.EQUALSDOT));
                 Optional<Unifier> optSigma = match.match(termList);
                 //PL 18-02-05 Unifier durch Matcher ersetzt ENDE
-				if(!optSigma.isPresent())
+                if (!optSigma.isPresent())
                     continue;
 
                 Unifier sigma = optSigma.get();
@@ -240,13 +277,13 @@ implements IFiniteClosure  {
 
                 Set<UnifyType> theta1Set = candidate.getContentOfDescendants();
 
-				for(UnifyType theta1 : theta1Set)
+                for (UnifyType theta1 : theta1Set)
                     result.add(new Pair<>(theta1.apply(sigma), fBounded));
             }
         }
 
         HashSet<UnifyType> resut = result.stream().map(x -> x.getKey()).collect(Collectors.toCollection(HashSet::new));
-		if(resut.equals(types.stream().map(x -> x.getKey()).collect(Collectors.toCollection(HashSet::new))))
+        if (resut.equals(types.stream().map(x -> x.getKey()).collect(Collectors.toCollection(HashSet::new))))
             return resut;
         return computeSmaller(result);
     }
@@ -273,6 +310,7 @@ implements IFiniteClosure  {
 
     /**
      * Returns all types of the finite closure that are supertypes of the argument.
+     *
      * @return The set of supertypes of the argument.
      */
     @Override
@@ -285,19 +323,19 @@ implements IFiniteClosure  {
         }
 
 
-		if(type instanceof FunNType) {
+        if (type instanceof FunNType) {
             return computeGreaterFunN((FunNType) type, fBounded);
         }
 
         Set<UnifyType> result = new HashSet<>();
-		Set<Pair<UnifyType,Set<UnifyType>>> PairResultFBounded = new HashSet<>();
+        Set<Pair<UnifyType, Set<UnifyType>>> PairResultFBounded = new HashSet<>();
 
         Match match = new Match();
 
 
         // if T = T' then T <=* T'
         result.add(type);
-		if(!strInheritanceGraph.containsKey(type.getName()))
+        if (!strInheritanceGraph.containsKey(type.getName()))
             return result;
 
         // if T <* T' then sigma(T) <* sigma(T')
@@ -313,15 +351,15 @@ implements IFiniteClosure  {
 		}
 		*/
 
-		for(Node<UnifyType> candidate :  candidates) {
+        for (Node<UnifyType> candidate : candidates) {
             UnifyType theta1 = candidate.getContent();
 
             //PL 18-04-05 Unifier durch Matcher ersetzt ANFANG
-			ArrayList<UnifyPair> termList= new ArrayList<UnifyPair>();
-			termList.add(new UnifyPair(theta1,type, PairOperator.EQUALSDOT, location));
+            ArrayList<UnifyPair> termList = new ArrayList<UnifyPair>();
+            termList.add(new UnifyPair(theta1, type, PairOperator.EQUALSDOT, location));
             Optional<Unifier> optSigma = match.match(termList);
             //PL 18-04-05 Unifier durch Matcher ersetzt ENDE
-			if(!optSigma.isPresent()) {
+            if (!optSigma.isPresent()) {
                 continue;
             }
             Unifier sigma = optSigma.get();
@@ -331,7 +369,7 @@ implements IFiniteClosure  {
             fBoundedNew.add(theta1);
             Set<UnifyType> theta2Set = candidate.getContentOfPredecessors();
             //System.out.println("");
-			for(UnifyType theta2 : theta2Set) {
+            for (UnifyType theta2 : theta2Set) {
                 result.add(theta2.apply(sigma));
                 PairResultFBounded.add(new Pair<>(theta2.apply(sigma), fBoundedNew));
             }
@@ -345,35 +383,34 @@ implements IFiniteClosure  {
 			System.err.println("no LogFile");
 		}
 		*/
-		for(Pair<UnifyType,Set<UnifyType>> pt : PairResultFBounded) {
+        for (Pair<UnifyType, Set<UnifyType>> pt : PairResultFBounded) {
             UnifyType t = pt.getKey();
             Set<UnifyType> lfBounded = pt.getValue().get();
 
             // if C<...> <* C<...> then ... (third case in definition of <*)
             //TypeParams typeparams = t.getTypeParams();
-			if(t.getTypeParams().size() > 0) {
+            if (t.getTypeParams().size() > 0) {
                 ArrayList<Set<UnifyType>> paramCandidates = new ArrayList<>();
 
                 for (int i = 0; i < t.getTypeParams().size(); i++) {
                     //UnifyType parai = t.getTypeParams().get(i);
                     int i_ef = i;
-					BiFunction<Boolean,UnifyType,Boolean> f = (x,y) -> 
+                    BiFunction<Boolean, UnifyType, Boolean> f = (x, y) ->
                     {
                         ArrayList<UnifyPair> termList = new ArrayList<UnifyPair>();
-					    termList.add(new UnifyPair(y,t.getTypeParams().get(i_ef), PairOperator.EQUALSDOT, location));
+                        termList.add(new UnifyPair(y, t.getTypeParams().get(i_ef), PairOperator.EQUALSDOT, location));
                         return ((match.match(termList).isPresent()) || x);
                     };
                     //if (parai.getName().equals("java.lang.Integer")) {
                     //	System.out.println("");
                     //}
-					BinaryOperator<Boolean> bo = (a,b) -> (a || b);
-					if (lfBounded.stream().reduce(false,f,bo)) {
+                    BinaryOperator<Boolean> bo = (a, b) -> (a || b);
+                    if (lfBounded.stream().reduce(false, f, bo)) {
                         //F-Bounded Endlosrekursion
                         HashSet<UnifyType> res = new HashSet<UnifyType>();
                         paramCandidates.add(res);
-					}
-					else {
-						paramCandidates.add(grArg(t.getTypeParams().get(i), new HashSet<>(fBounded) ));
+                    } else {
+                        paramCandidates.add(grArg(t.getTypeParams().get(i), new HashSet<>(fBounded)));
                     }
                 }
                 permuteParams(paramCandidates).forEach(x -> result.add(t.setTypeParams(x)));
@@ -513,7 +550,7 @@ implements IFiniteClosure  {
         Set<UnifyType> result = new HashSet<UnifyType>();
         result.add(type);
         smaller(type, fBounded).forEach(x -> result.add(new SuperType(x)));
-        greater(type,fBounded).forEach(x -> result.add(new ExtendsType(x)));
+        greater(type, fBounded).forEach(x -> result.add(new ExtendsType(x)));
         return result;
     }
 
@@ -607,18 +644,18 @@ implements IFiniteClosure  {
 
     @Override
     public Set<UnifyType> getAllTypesByName(String typeName) {
-		if(!strInheritanceGraph.containsKey(typeName))
+        if (!strInheritanceGraph.containsKey(typeName))
             return new HashSet<>();
         return strInheritanceGraph.get(typeName).stream().map(x -> x.getContent()).collect(Collectors.toCollection(HashSet::new));
     }
 
     @Override
     public Optional<UnifyType> getLeftHandedType(String typeName) {
-		if(!strInheritanceGraph.containsKey(typeName))
+        if (!strInheritanceGraph.containsKey(typeName))
             return Optional.empty();
 
-		for(UnifyPair pair : pairs)
-			if(pair.getLhsType().getName().equals(typeName) && pair.getLhsType().typeParams.arePlaceholders())
+        for (UnifyPair pair : pairs)
+            if (pair.getLhsType().getName().equals(typeName) && pair.getLhsType().typeParams.arePlaceholders())
                 return Optional.of(pair.getLhsType());
 
         return Optional.empty();
@@ -626,11 +663,11 @@ implements IFiniteClosure  {
 
     @Override
     public Optional<UnifyType> getRightHandedFunctionalInterfaceType(String typeName) {
-		if(!strInheritanceGraph.containsKey(typeName))
+        if (!strInheritanceGraph.containsKey(typeName))
             return Optional.empty();
 
-		for(UnifyPair pair : pairs)
-			if(pair.getRhsType().getName().equals(typeName))
+        for (UnifyPair pair : pairs)
+            if (pair.getRhsType().getName().equals(typeName))
                 return Optional.of(pair.getRhsType());
 
         return Optional.empty();
@@ -638,7 +675,7 @@ implements IFiniteClosure  {
 
     @Override
     public Set<UnifyType> getAncestors(UnifyType t) {
-		if(!inheritanceGraph.containsKey(t))
+        if (!inheritanceGraph.containsKey(t))
             return new HashSet<>();
         Set<UnifyType> result = inheritanceGraph.get(t).getContentOfPredecessors();
         result.add(t);
@@ -647,7 +684,7 @@ implements IFiniteClosure  {
 
     @Override
     public Set<UnifyType> getChildren(UnifyType t) {
-		if(!inheritanceGraph.containsKey(t))
+        if (!inheritanceGraph.containsKey(t))
             return new HashSet<>();
         Set<UnifyType> result = inheritanceGraph.get(t).getContentOfDescendants();
         result.add(t);
@@ -656,6 +693,7 @@ implements IFiniteClosure  {
 
     /**
      * Takes a set of candidates for each position and computes all possible permutations.
+     *
      * @param candidates The length of the list determines the number of type params. Each set
      *                   contains the candidates for the corresponding position.
      */
@@ -667,6 +705,7 @@ implements IFiniteClosure  {
 
     /**
      * Takes a set of candidates for each position and computes all possible permutations.
+     *
      * @param candidates The length of the list determines the number of type params. Each set
      *                   contains the candidates for the corresponding position.
      * @param idx        Idx for the current permutatiton.
@@ -674,21 +713,21 @@ implements IFiniteClosure  {
      * @param current    The permutation of type params that is currently explored
      */
     protected void permuteParams(ArrayList<Set<UnifyType>> candidates, int idx, Set<TypeParams> result, UnifyType[] current) {
-		if(candidates.size() == idx) {
+        if (candidates.size() == idx) {
             result.add(new TypeParams(Arrays.copyOf(current, current.length)));
             return;
         }
 
         Set<UnifyType> localCandidates = candidates.get(idx);
 
-		for(UnifyType t : localCandidates) {
+        for (UnifyType t : localCandidates) {
             current[idx] = t;
-			permuteParams(candidates, idx+1, result, current);
+            permuteParams(candidates, idx + 1, result, current);
         }
     }
 
     @Override
-	public String toString(){
+    public String toString() {
         return this.inheritanceGraph.toString();
     }
 	
@@ -698,8 +737,11 @@ implements IFiniteClosure  {
 	}
 	*/
 
-	public int compare (UnifyType left, UnifyType right, PairOperator pairop) {
-		try {logFile.write("left: "+ left + " right: " + right + " pairop: " + pairop +"\n");} catch (IOException ie) {}
+    public int compare(UnifyType left, UnifyType right, PairOperator pairop) {
+        try {
+            logFile.write("left: " + left + " right: " + right + " pairop: " + pairop + "\n");
+        } catch (IOException ie) {
+        }
         if (left.getName().equals("Matrix") || right.getName().equals("Matrix"))
             System.out.println("");
 		/*
@@ -733,21 +775,19 @@ implements IFiniteClosure  {
         UnifyType ex;
         if (left instanceof PlaceholderType) {
             if ((right instanceof WildcardType)
-						&& ((ex = ((WildcardType)right).wildcardedType) instanceof PlaceholderType)
-						&& ((PlaceholderType)left).getName().equals(((PlaceholderType)ex).getName())) {// a <.? ? extends a oder a <.? ? super a
+                    && ((ex = ((WildcardType) right).wildcardedType) instanceof PlaceholderType)
+                    && ((PlaceholderType) left).getName().equals(((PlaceholderType) ex).getName())) {// a <.? ? extends a oder a <.? ? super a
                 return -1;
-				}
-				else {
+            } else {
                 return 0;
             }
         }
         if (right instanceof PlaceholderType) {//&& (left instanceof WildcardType)) {PL geloescht 2019-01-15 analog zu oben
             if ((left instanceof WildcardType) //PL eingefuegt 2019-01-15 analog zu oben
-					&& ((ex = ((WildcardType)left).wildcardedType) instanceof PlaceholderType)
-					&& ((PlaceholderType)right).getName().equals(((PlaceholderType)ex).getName())) {// ? extends a <. a oder ? super a <. a
+                    && ((ex = ((WildcardType) left).wildcardedType) instanceof PlaceholderType)
+                    && ((PlaceholderType) right).getName().equals(((PlaceholderType) ex).getName())) {// ? extends a <. a oder ? super a <. a
                 return 1;
-			}
-			else {
+            } else {
                 return 0;
             }
         }
@@ -758,26 +798,28 @@ implements IFiniteClosure  {
         Set<UnifyPair> smallerRes = unifyTask.applyTypeUnificationRules(hs, this);
 
         //if (left.getName().equals("Vector") || right.getName().equals("AbstractList"))
-		{try { 
+        {
+            try {
                 logFile.write("\nsmallerRes: " + smallerRes);//"smallerHash: " + greaterHash.toString());
                 logFile.flush();
+            } catch (IOException e) {
+                System.err.println("no LogFile");
+            }
         }
-		catch (IOException e) {
-			System.err.println("no LogFile");}}
 
         //Gleichungen der Form a <./=. Theta oder Theta <./=. a oder a <./=. b sind ok.
         Predicate<UnifyPair> delFun = x -> !((x.getLhsType() instanceof PlaceholderType ||
                 x.getRhsType() instanceof PlaceholderType)
                 && !((x.getLhsType() instanceof WildcardType) &&   //? extends/super a <.? a
-													 ((WildcardType)x.getLhsType()).getWildcardedType().equals(x.getRhsType()))
+                ((WildcardType) x.getLhsType()).getWildcardedType().equals(x.getRhsType()))
         );
         long smallerLen = smallerRes.stream().filter(delFun).count();
         try {
-			logFile.write("\nsmallerLen: " + smallerLen +"\n");
+            logFile.write("\nsmallerLen: " + smallerLen + "\n");
             logFile.flush();
+        } catch (IOException e) {
+            System.err.println("no LogFile");
         }
-		catch (IOException e) {
-			System.err.println("no LogFile");}
         if (smallerLen == 0) return -1;
         else {
             up = new UnifyPair(right, left, pairop);
@@ -787,12 +829,14 @@ implements IFiniteClosure  {
             Set<UnifyPair> greaterRes = unifyTask.applyTypeUnificationRules(hs, this);
 
             //if (left.getName().equals("Vector") || right.getName().equals("AbstractList"))
-			{try { 
+            {
+                try {
                     logFile.write("\ngreaterRes: " + greaterRes);//"smallerHash: " + greaterHash.toString());
                     logFile.flush();
+                } catch (IOException e) {
+                    System.err.println("no LogFile");
+                }
             }
-			catch (IOException e) {
-				System.err.println("no LogFile");}}
 
             //Gleichungen der Form a <./=. Theta oder Theta <./=. a oder a <./=. b sind ok.
             long greaterLen = greaterRes.stream().filter(delFun).count();

src/test/java/TestComplete.java

@@ -1441,18 +1441,8 @@ public class TestComplete {
         var instance = clazz.getDeclaredConstructor().newInstance();
         var m = clazz.getDeclaredMethod("ex1");
         assertEquals("ABC", m.invoke(instance));
-        //var ex2 = clazz.getDeclaredMethod("ex2");
-        //assertEquals(0.0, ex2.invoke(instance));
-    }
-    @Test
-    public void testBug365a() throws Exception {
-        var classFiles = generateClassFiles(createClassLoader(), "Bug365a.jav");
-        var clazz = classFiles.get("Bug365");
-        var instance = clazz.getDeclaredConstructor().newInstance();
-        var m = clazz.getDeclaredMethod("ex1");
-        assertEquals("ABC", m.invoke(instance));
-        //var ex2 = clazz.getDeclaredMethod("ex2");
-        //assertEquals(0.0, ex2.invoke(instance));
+        var ex2 = clazz.getDeclaredMethod("ex2");
+        assertEquals("BAC", ex2.invoke(instance));
     }
     @Test
     public void testBug366() throws Exception {
@@ -1461,4 +1451,12 @@ public class TestComplete {
         var m = clazz.getDeclaredMethod("test");
         assertEquals(30, m.invoke(null));
     }
+
+    @Test
+    public void testBug371() throws Exception {
+        var classFiles = generateClassFiles(createClassLoader(), "Bug371.jav");
+        var clazz = classFiles.get("Bug371");
+        var m = clazz.getDeclaredMethod("test");
+        assertEquals(true, m.invoke(null));
+    }
 }