All Downloads are FREE. Search and download functionalities are using the official Maven repository.
Please wait. This can take some minutes ...
Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
org.refactoringminer.astDiff.matchers.BasicTreeMatcher Maven / Gradle / Ivy
package org.refactoringminer.astDiff.matchers;
import com.github.gumtreediff.matchers.Mapping;
import com.github.gumtreediff.matchers.MappingStore;
import com.github.gumtreediff.tree.Tree;
import com.github.gumtreediff.utils.Pair;
import org.refactoringminer.astDiff.utils.TreeUtilFunctions;
import java.util.ArrayList;
import java.util.List;
/**
* @author Pourya Alikhani Fard [email protected]
*/
public class BasicTreeMatcher implements TreeMatcher {
private int minP = 0;
public void setMinP(int minP) {
this.minP = minP;
}
public int getMinP() {
return minP;
}
@Override
public void match(Tree src, Tree dst, ExtendedMultiMappingStore mappingStore) {
basicMatcher(src, dst, mappingStore);
}
private void basicMatcher(Tree src, Tree dst, ExtendedMultiMappingStore mappingStore) {
mappingStore.add(process(src, dst));
}
public MappingStore process(Tree src, Tree dst) {
MappingStore match;
match = new CustomGreedy(minP).match(src, dst);
CustomBottomUpMatcher customBottomUpMatcher = new CustomBottomUpMatcher();
customBottomUpMatcher.match(src, dst, match);
optimizeMappings(match);
return match;
}
private static void optimizeMappings(MappingStore match) {
List> removeList = new ArrayList<>();
for (Mapping mapping : match) {
if (mapping.first.getType().name.equals(Constants.METHOD_INVOCATION)) {
Tree srcMethodName = TreeUtilFunctions.findChildByType(mapping.first, Constants.SIMPLE_NAME);
Tree dstMethodName = TreeUtilFunctions.findChildByType(mapping.second, Constants.SIMPLE_NAME);
if (srcMethodName == null || dstMethodName == null) continue;
if (!srcMethodName.getLabel().equals(dstMethodName.getLabel())) {
Tree srcMethodInvocationReceiver = TreeUtilFunctions.findChildByType(mapping.first, Constants.METHOD_INVOCATION_RECEIVER);
Tree dstMethodInvocationReceiver = TreeUtilFunctions.findChildByType(mapping.second, Constants.METHOD_INVOCATION_RECEIVER);
if ((srcMethodInvocationReceiver == null && dstMethodInvocationReceiver != null)
||
(srcMethodInvocationReceiver != null && dstMethodInvocationReceiver == null)) {
Tree srcMethodInvocationArguments = TreeUtilFunctions.findChildByType(mapping.first, Constants.METHOD_INVOCATION_ARGUMENTS);
Tree dstMethodInvocationArguments = TreeUtilFunctions.findChildByType(mapping.second, Constants.METHOD_INVOCATION_ARGUMENTS);
boolean _notEmptyIsoStructuralArguments = false;
if (srcMethodInvocationArguments != null && dstMethodInvocationArguments != null)
_notEmptyIsoStructuralArguments = srcMethodInvocationArguments.isIsoStructuralTo(dstMethodInvocationArguments);
if (!_notEmptyIsoStructuralArguments) {
removeList.add(new Pair<>(mapping.first, mapping.second));
removeList.add(new Pair<>(srcMethodName, dstMethodName));
removeList.add(new Pair<>(srcMethodInvocationArguments, dstMethodInvocationArguments));
}
}
}
}
}
for (Pair treeTreePair : removeList) {
if (match.getDstForSrc(treeTreePair.first) != null && match.getDstForSrc(treeTreePair.first).equals(treeTreePair.second))
match.removeMapping(treeTreePair.first, treeTreePair.second);
}
List> addList = new ArrayList<>();
for (Mapping mapping : match)
{
if (mapping.first.getType().name.equals(Constants.SIMPLE_NAME))
{
if (mapping.first.getParent().getType().name.equals(Constants.METHOD_INVOCATION)
&&
mapping.second.getParent().getType().name.equals(Constants.METHOD_INVOCATION))
{
if (match.getDstForSrc(mapping.first.getParent()) != mapping.second.getParent())
addList.add(new Pair<>(mapping.first.getParent() , mapping.second.getParent()));
}
}
}
for (Pair treeTreePair : addList) {
match.removeMapping(treeTreePair.first, match.getSrcForDst(treeTreePair.first));
match.removeMapping(match.getSrcForDst(treeTreePair.second), treeTreePair.second);
Tree srcMIR = TreeUtilFunctions.findChildByType(treeTreePair.first, Constants.METHOD_INVOCATION_RECEIVER);
Tree dstMIR = TreeUtilFunctions.findChildByType(treeTreePair.second, Constants.METHOD_INVOCATION_RECEIVER);
if (match.isSrcMapped(srcMIR)) {
match.removeMapping(srcMIR, match.getDstForSrc(srcMIR));
}
if (match.isDstMapped(dstMIR)) {
match.removeMapping(match.getSrcForDst(dstMIR), dstMIR);
}
}
for (Pair treeTreePair : addList) {
match.addMapping(treeTreePair.first, treeTreePair.second);
Tree srcMIR = TreeUtilFunctions.findChildByType(treeTreePair.first, Constants.METHOD_INVOCATION_RECEIVER);
Tree dstMIR = TreeUtilFunctions.findChildByType(treeTreePair.second, Constants.METHOD_INVOCATION_RECEIVER);
if (srcMIR != null && dstMIR != null)
match.addMapping(srcMIR, dstMIR);
}
}
}