forked from JavaTX/JavaCompilerCore
Parallelisierung mit Fork-Join Pool
This commit is contained in:
parent
7d75f18319
commit
856f5da86b
@ -32,7 +32,9 @@ import de.dhbwstuttgart.typeinference.unify.model.UnifyType;
|
|||||||
* @author Florian Steurer
|
* @author Florian Steurer
|
||||||
*/
|
*/
|
||||||
public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>> {
|
public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>> {
|
||||||
|
|
||||||
|
private static final long serialVersionUID = 1L;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* The implementation of setOps that will be used during the unification
|
* The implementation of setOps that will be used during the unification
|
||||||
*/
|
*/
|
||||||
@ -163,8 +165,6 @@ public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>> {
|
|||||||
/*
|
/*
|
||||||
* Step 6 a) Restart (fork) for pairs where subst was applied
|
* Step 6 a) Restart (fork) for pairs where subst was applied
|
||||||
*/
|
*/
|
||||||
Set<TypeUnifyTask> restart = new HashSet<>();
|
|
||||||
|
|
||||||
if (eqPrime.equals(eq))
|
if (eqPrime.equals(eq))
|
||||||
eqPrimePrimeSet.add(eqPrime);
|
eqPrimePrimeSet.add(eqPrime);
|
||||||
else if(eqPrimePrime.isPresent()) {
|
else if(eqPrimePrime.isPresent()) {
|
||||||
@ -172,12 +172,10 @@ public class TypeUnifyTask extends RecursiveTask<Set<Set<UnifyPair>>> {
|
|||||||
forks.add(fork);
|
forks.add(fork);
|
||||||
fork.fork();
|
fork.fork();
|
||||||
}
|
}
|
||||||
//eqPrimePrimeSet.addAll(this.unify(eqPrimePrime.get(), fc));
|
|
||||||
else {
|
else {
|
||||||
TypeUnifyTask fork = new TypeUnifyTask(eqPrime, fc);
|
TypeUnifyTask fork = new TypeUnifyTask(eqPrime, fc);
|
||||||
forks.add(fork);
|
forks.add(fork);
|
||||||
fork.fork();
|
fork.fork();
|
||||||
// eqPrimePrimeSet.addAll(this.unify(eqPrime, fc));
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user