pstlab / PLATINUm

import java.util.ArrayList;

import java.util.Collection;

import java.util.Collections;

import java.util.Comparator;

import java.util.HashSet;

import java.util.List;

import java.util.Set;

import it.cnr.istc.pst.platinum.ai.framework.microkernel.lang.flaw.Flaw;

import it.cnr.istc.pst.platinum.ai.framework.microkernel.resolver.ex.UnsolvableFlawException;

/**

 * 

 * @author alessandro

 *

 */

public class FailFirstFlawInspector extends FlawInspector implements Comparator<Flaw> {

	/**

	 * 

	 */

	protected FailFirstFlawInspector() {

		super("FailFirstFlawInspector");

	}

	/**

	 * 

	 */

	@Override

	public Set<Flaw> detectFlaws() 

			throws UnsolvableFlawException {

		// set of filtered list

		Set<Flaw> set = new HashSet<>();

		// filtered set

		List<Flaw> list = new ArrayList<>(this.pdb.detectFlaws());

		// check list 

		if (!list.isEmpty()) {

			// sort flaws according to their degree (i.e. number of available solutions

			Collections.sort(list, this);

			// get the first element of the list

			Flaw flaw = list.remove(0);

			// add flaw to the result set

			set.add(flaw);

		}

		// get flaws

		return set;

	}

	/**

	 * 

	 */

	/**

	 * 

	 */

	@Override

	public Set<Flaw> filter(Collection<Flaw> flaws) {

		// filtered set

		Set<Flaw> set = new HashSet<>();

		// list of flaws

		List<Flaw> list = new ArrayList<>(flaws);

		// check flaws

		if (!list.isEmpty()) {

			// sort flaws according to their degree (i.e. number of available solutions

			Collections.sort(list, this);

			// get the first element of the list

			Flaw flaw = list.remove(0);

			// add the hardest flaw to solve i.e., the flaw with fewest solutions

			set.add(flaw);

		}

		// get filtered set

		return set;

	}

	/**

	 * 

	 */

	@Override

	public int compare(Flaw o1, Flaw o2) {

		// compare the number of available solutions

		return o1.getSolutions().size() < o2.getSolutions().size() ? -1 : 

			o1.getSolutions().size() > o2.getSolutions().size() ? 1 : 0;

	}

}