gr.uom.java.xmi.decomposition.ScopedLeafMappingComparatorForExtract Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of refactoring-miner Show documentation

RefactoringMiner is a library/API written in Java that can detect refactorings applied in the history of a Java project.

There is a newer version: 3.0.9

Show newest version

package gr.uom.java.xmi.decomposition;

import java.util.Comparator;

public class ScopedLeafMappingComparatorForExtract implements Comparator {
	private AbstractCodeMapping parentMapping;
	
	public ScopedLeafMappingComparatorForExtract(AbstractCodeMapping parentMapping) {
		this.parentMapping = parentMapping;
	}

	@Override
	public int compare(LeafMapping o1, LeafMapping o2) {
		if(parentMapping != null) {
			if(parentMapping.getFragment1().getLocationInfo().subsumes(o1.getFragment1().getLocationInfo()) &&
					!parentMapping.getFragment1().getLocationInfo().subsumes(o2.getFragment1().getLocationInfo())) {
				return -1;
			}
			else if(!parentMapping.getFragment1().getLocationInfo().subsumes(o1.getFragment1().getLocationInfo()) &&
					parentMapping.getFragment1().getLocationInfo().subsumes(o2.getFragment1().getLocationInfo())) {
				return 1;
			}
		}
		/*
		AbstractCodeMapping previousMapping = scopedMappingData.getPreviousMapping();
		AbstractCodeMapping nextMapping = scopedMappingData.getNextMapping();
		if(previousMapping != null && nextMapping != null) {
			boolean o1IsWithinRange = o1.getFragment1().getLocationInfo().getStartLine() > previousMapping.getFragment1().getLocationInfo().getStartLine() &&
					o1.getFragment1().getLocationInfo().getStartLine() < nextMapping.getFragment1().getLocationInfo().getStartLine();
			boolean o2IsWithinRange = o2.getFragment1().getLocationInfo().getStartLine() > previousMapping.getFragment1().getLocationInfo().getStartLine() &&
					o2.getFragment1().getLocationInfo().getStartLine() < nextMapping.getFragment1().getLocationInfo().getStartLine();
			if(o1IsWithinRange && !o2IsWithinRange) {
				return -1;
			}
			else if(!o1IsWithinRange && o2IsWithinRange) {
				return 1;
			}
		}
		*/
		return o1.compareTo(o2);
	}
}