org.evosuite.ga.metaheuristics.mosa.structural.StructuralGoalManager Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of evosuite-client Show documentation
The newest version!
/**
 * Copyright (C) 2010-2018 Gordon Fraser, Andrea Arcuri and EvoSuite
 * contributors
 *
 * This file is part of EvoSuite.
 *
 * EvoSuite is free software: you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published
 * by the Free Software Foundation, either version 3.0 of the License, or
 * (at your option) any later version.
 *
 * EvoSuite is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * Lesser Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with EvoSuite. If not, see .
 */
package org.evosuite.ga.metaheuristics.mosa.structural;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;

import org.evosuite.ga.Chromosome;
import org.evosuite.ga.FitnessFunction;
import org.evosuite.testcase.TestChromosome;
import org.evosuite.testcase.TestFitnessFunction;

/**
 * 
 * 
 * @author Annibale Panichella
 */
public abstract class StructuralGoalManager {

	/** Set of yet to cover goals **/
	protected Set> uncoveredGoals;

	/** Set of goals currently used as objectives **/
	protected Set> currentGoals;

	/** Map of covered goals **/
	protected Map, T> coveredGoals;

	/** Map of test to archive and corresponding covered targets*/
	protected Map>> archive;

	protected StructuralGoalManager(List> fitnessFunctions){
		uncoveredGoals = new HashSet>(fitnessFunctions.size());
		currentGoals = new HashSet>(fitnessFunctions.size());
		coveredGoals = new HashMap, T>(fitnessFunctions.size());
		archive = new HashMap>>();
	}

	/**
	 * Update the set of covered goals and the set of current goals (actual objectives)
	 * @param population list of TestChromosome
	 * @return covered goals along with the corresponding test case
	 */
	public abstract void calculateFitness(T c);

	public Set> getUncoveredGoals() {
		return uncoveredGoals;
	}

	public Set> getCurrentGoals() {
		return currentGoals;
	}

	public Map, T> getCoveredGoals() {
		return coveredGoals;
	}

	protected boolean isAlreadyCovered(FitnessFunction target){
		if (uncoveredGoals.size() < coveredGoals.keySet().size()){
			if (!uncoveredGoals.contains(target))
				return true;
		} else {
			if (coveredGoals.keySet().contains(target))
				return true;
		}
		return false;
	}

	protected void updateCoveredGoals(FitnessFunction f, T tc) {
		// the next two lines are needed since that coverage information are used
		// during EvoSuite post-processing
		TestChromosome tch = (TestChromosome) tc;
		tch.getTestCase().getCoveredGoals().add((TestFitnessFunction) f);

		// update covered targets
		boolean toArchive = false;
		T best = coveredGoals.get(f);
		if (best == null){
			toArchive = true;
			coveredGoals.put(f, tc);
			uncoveredGoals.remove(f);
			currentGoals.remove(f);
		} else {
			double bestSize = best.size();
			double size = tc.size();
			if (size < bestSize && size > 1){
				toArchive = true;
				coveredGoals.put(f, tc);
				archive.get(best).remove(f);
				if (archive.get(best).size() == 0)
					archive.remove(best);
			}
		}

		// update archive
		if (toArchive){
			List> coveredTargets = archive.get(tc);
			if (coveredTargets == null){
				List> list = new ArrayList>();
				list.add(f);
				archive.put(tc, list);
			} else {
				coveredTargets.add(f);
			}
		}
	}

	public Set getArchive(){
		return this.archive.keySet();
	}

}