All Downloads are FREE. Search and download functionalities are using the official Maven repository.
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.
holmos.reflect.reflectCheck.comparator.HolmosIgnoreOrderCollectionComparator Maven / Gradle / Ivy
package holmos.reflect.reflectCheck.comparator;
import holmos.reflect.basetool.HolmosCollectionTool;
import holmos.reflect.reflectCheck.HolmosMatchingScoreCalculator;
import holmos.reflect.reflectCheck.HolmosReflectionComparator;
import holmos.reflect.reflectCheck.difference.HolmosCollectionIgnoreOrderDifference;
import holmos.reflect.reflectCheck.difference.HolmosDifference;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
/**两个Collection对象的比较器，对Collection立面的元素的顺序没有要求
* @author 吴银龙(15857164387)
* */
public class HolmosIgnoreOrderCollectionComparator implements HolmosComparator{
/**当leftValue和rightValue都不为null或者都为Collection和Array的时候返回true*/
public boolean canCompare(Object leftValue, Object rightValue) {
if(leftValue == null || rightValue == null)
return false;
else if((leftValue.getClass().isArray()||leftValue instanceof Collection)
&&(rightValue.getClass().isArray()||rightValue instanceof Collection))
return true;
return false;
}
/**可以采用两中常规方法进行比较双重循环，如果找到匹配的那么将这个匹配的值从rightList和rightList中删除，如果最后leftList和rightList中再无元素，则匹配成功
* 采用递归，如果找到匹配的那么将这个匹配的值从rightList中删除，继续用leftList中的下一个元素与接下来的rightList中的元素比较，成功的条件和第一种方法一致
* 在此采用循环法，因为这种速度快，其实两者的时间复杂度都是一样的，只是这种方法没有递归开销leftList=new ArrayList(HolmosCollectionTool.convertToCollection(leftValue));
ArrayListrightList=new ArrayList(HolmosCollectionTool.convertToCollection(rightValue));
boolean isEqual=isEqualIgnoreOrder(leftList, rightList, holmosReflectionComparator);
if(isEqual){
//左右匹配了，全部匹配
return null;
}
//如果不匹配，找到所有的不同的可能性
HolmosCollectionIgnoreOrderDifference collectionIgnoreOrderDifference=new
HolmosCollectionIgnoreOrderDifference(leftValue, rightValue, leftList, rightList, "无序数组或者List比较器");
if(onlyIfFirstDifference){
return collectionIgnoreOrderDifference;
}
fillAllDifferenceElments(leftList, rightList, holmosReflectionComparator, collectionIgnoreOrderDifference);
fillBestMatches(leftList, rightList, collectionIgnoreOrderDifference);
return collectionIgnoreOrderDifference;
}
/***双重循环法*/
protected boolean isEqualIgnoreOrder(ArrayListleftList,ArrayListrightList,
HolmosReflectionComparator holmosReflectionComparator){
IteratorleftIterator=leftList.iterator();
IteratorrightIterator=rightList.iterator();
while(leftIterator.hasNext()){
Object leftValue=leftIterator.next();
rightIterator=rightList.iterator();
while(rightIterator.hasNext()){
Object rightValue=rightIterator.next();
if(holmosReflectionComparator.getDifference(leftValue, rightValue, true)==null){
leftIterator.remove();
rightIterator.remove();
break;
}
}
}
if(leftList.isEmpty()&&rightList.isEmpty())
return true;
return false;
}
/**递归法*/
protected boolean isEqualIgnoreOrderRecursively(ArrayListleftList,ArrayListrightList,
HolmosReflectionComparator holmosReflectionComparator){
if(rightList.isEmpty()&&leftList.isEmpty())
return true;
else if(rightList.isEmpty()||leftList.isEmpty())
return false;
else{
for(Object left:leftList){
for(Object right:rightList){
if(holmosReflectionComparator.getDifference(left, right, true)==null){
leftList.remove(left);
rightList.remove(right);
if(isEqualIgnoreOrderRecursively(leftList, rightList, holmosReflectionComparator))
return true;
}
}
return false;
}
return false;
}
}
/**找到在最佳匹配下所有不同的节点，并将其放入difference里leftList,ArrayListrightList,
HolmosReflectionComparator reflectionComparator,HolmosCollectionIgnoreOrderDifference difference){
for(int leftIndex=0;leftIndex
* @param leftIndexes 左值的索引信息
* @param rightIndexes 右值的索引信息
* @param difference 本无序集合的差异信息
* */
protected void removeMatchIndexes(ArrayListleftIndexes,ArrayListrightIndexes,HolmosCollectionIgnoreOrderDifference difference){
IteratorleftIterator,rightIterator;
leftIterator=leftIndexes.iterator();
rightIterator=rightIndexes.iterator();
while(leftIterator.hasNext()){
int leftIndex=leftIterator.next();
while(rightIterator.hasNext()){
int rightIndex=rightIterator.next();
if(difference.getElementDifference().get(leftIndex).get(rightIndex)==null){
leftIterator.remove();
rightIterator.remove();
}
}
}
}
/**在剩余的没有匹配的元素中，寻找最佳组合*/
protected void setBestMatchIndexes(ArrayListleftIndexes,ArrayListrightIndexes,HolmosCollectionIgnoreOrderDifference difference){
int score=Integer.MAX_VALUE;
HolmosMatchingScoreCalculator matchingScoreCalculator=getMatchingScoreCalculator();
for(Integer leftIndex:leftIndexes){
score=Integer.MAX_VALUE;
for(Integer rightIndex:rightIndexes){
int matchScore=matchingScoreCalculator.calculateMatchingScore(difference);
if(score>matchScore){
score=matchScore;
difference.setBestMatch(leftIndex, rightIndex);
}
}
}
}
/**设置最佳组合*/
protected void fillBestMatches(ArrayListleftList,ArrayListrightList,HolmosCollectionIgnoreOrderDifference collectionIgnoreOrderDifference){
ArrayListleftIndexes=createIndexList(leftList.size());
ArrayListrightIndexes=createIndexList(rightList.size());
removeMatchIndexes(leftIndexes, rightIndexes, collectionIgnoreOrderDifference);
setBestMatchIndexes(leftIndexes, rightIndexes, collectionIgnoreOrderDifference);
}
/**一个工具方法，新建一个索引列表，索引值从0开始，到size-1结束createIndexList(int size){
ArrayListindexes=new ArrayList();
for(int i=0;i
