nz.ac.waikato.modeljunit.storytest.MCDCSuggestionStrategy Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of paramedit Show documentation

A tool for editing test parameters and suggesting additional parameter values. It provides several heuristics (including PairWise and MC/DC) for analyzing a set of input tuples and suggesting missing/extra values.

The newest version!

package nz.ac.waikato.modeljunit.storytest;

import java.util.HashSet;
import java.util.ArrayList;
import java.util.Set;
import java.util.List;
import java.lang.NumberFormatException;

/**
 * Implements the MCDC (Modified Condition Decision Coverage) strategy.
 *
 *  * For each test t in the Table:
 *  For each parameter p in the test:
 *    if p is an integer the MCDC suggestion strategy generates two suggestions
 *      s1 and s2 for possible testing strategies. Both suggestions s1 and s2
 *      are identical to the test t except that for parameter p, instead of
 *      having p, s1 has p minus one and s2 has p plus one. Then as a heuristic to cut
 *      down on the number of suggestions, s1 and s2 will only be added to the
 *      suggestion set if neither s1 or s2 is already contained in the Table.
 * 
 *
 * The rationale behind this is that if one of the suggestions is already contained
 * in the test suite then the other suggestion is unlikely to be needed to cover that boundary.
 * @author Simon Ware
 */
public class MCDCSuggestionStrategy
   extends AbstractSuggestionStrategy
   implements Observer, Subject, SuggestionStrategy
{
   private final List mSuggestions;
   
   public MCDCSuggestionStrategy(CalcTable calc)
   {
      super(calc);
      mSuggestions = new ArrayList();
      MCDC();
   }
   
   private void MCDC()
   {
      CalcTable calc = getCalcTable();
      Set alreadythier = new HashSet();
      for (int r = 0; r < calc.rows(); r++) {
         List thing = new ArrayList(calc.getRow(r));
         for (int c = 0; c < calc.columns(); c++) {
            if (calc.isResult(c)) {thing.set(c, "?");}
         }
         alreadythier.add(new DefaultSuggestion(thing));
      }
      Set suggestionset = new HashSet(alreadythier);
      List suggestions = new ArrayList();
      for (int c = 0; c < calc.columns(); c++) {
         if (calc.isResult(c)) {continue;}
         for (int r = 0; r < calc.rows(); r++) {
            try {
               int value = Integer.parseInt(calc.getValue(r, c));
               List possible1 = new ArrayList(calc.getRow(r));
               List possible2 = new ArrayList(calc.getRow(r));
               possible1.set(c, ((value - 1) + ""));
               possible2.set(c, ((value + 1) + ""));
               for (int c2 = 0; c2 < calc.columns(); c2++) {
                  if (calc.isResult(c2)) {
                     possible1.set(c2, "?"); possible2.set(c2, "?");
                  }
               }
               Suggestion suggestion1 = new DefaultSuggestion(possible1);
               Suggestion suggestion2 = new DefaultSuggestion(possible2);
               if (alreadythier.add(suggestion1)
                   && alreadythier.add(suggestion2)) {
                  if (suggestionset.add(suggestion1)) {suggestions.add(suggestion1);}
                  if (suggestionset.add(suggestion2)) {suggestions.add(suggestion2);}
               }
            } catch (NumberFormatException ex) {}
         }
      }
      mSuggestions.clear();
      mSuggestions.addAll(suggestions);
   }
   
   public List getSuggestions()
   {
      return mSuggestions;
   }
   
   public void update()
   {
      MCDC();
      inform();
   }
}