Commit: 50636160dafa089cc2644690d739a9418a2ca6ec - cit_bach (git)

Testcase generation tool for combinatorial interaction testing

Commit MetaInfo

• Revision: 50636160dafa089cc2644690d739a9418a2ca6ec (tree)
• Time: 2015-05-01 15:36:00
• Author: t-tutiya <tatsuhiro@ieee...>
• Commiter: t-tutiya

Log Message

1.01

Change Summary

• modified: src/v1/ConstraintHandler.java
• modified: src/v1/Generator.java
• modified: src/v1/Main.java

Incremental Difference

--- a/src/v1/ConstraintHandler.java
+++ b/src/v1/ConstraintHandler.java
@@ -115,10 +115,15 @@ class ConstraintHandler {
 			bdd.deref(g);
 		}
 //		bdd.ref(f);
+		// 消すこと
+		bdd.printSet(f);
 		
 		// *を付加
 		f = extendBddConstraint(f);
-		
+
+		// 消すこと
+		bdd.printSet(f);
+
 		return f;
 	}
 	

--- a/src/v1/Generator.java
+++ b/src/v1/Generator.java
@@ -56,7 +56,6 @@ abstract class Generator {
 	// groupで全網羅するtupleの列を生成
 	protected List<List<Testcase>> generateTupleSequenceList() {
 //		protected List<TupleSequence> generateTupleSequence() {
-		// TODO Auto-generated method stub
 		List<List<Testcase>> listOfTupleSequence = new ArrayList<List<Testcase>>();
 		for (Group g: groupList) {
 			listOfTupleSequence.add(generateTupleSequence(g));
@@ -64,6 +63,7 @@ abstract class Generator {
 		return listOfTupleSequence;
 	}
 
+	// groupを網羅するtuple列を生成し返す
 	private List<Testcase> generateTupleSequence(Group g) {
 		int numOfCombinations = 1;
 		for (int i = 0; i < g.member.length; i++) {
@@ -100,6 +100,7 @@ abstract class Generator {
 		return testSet;
 	}
 	
+	// 未カバーのtupleがあればture, そうでなければ false
 	protected boolean hasTuplesToCover(List<List<Testcase>> tupleSequenceList) {
 		// TODO Auto-generated method stub
 		for (List<Testcase> tupleSequence : tupleSequenceList) {
@@ -299,7 +300,6 @@ class Generator2 extends Generator {
 
 
 	private void addGroupedTuples(Testcase tmp, List<List<Testcase>> tupleSequenceList) {
-		// TODO Auto-generated method stub
 		for (List<Testcase> TupleSequence : tupleSequenceList) {
 			for (int i = 0; i < TupleSequence.size(); i++) {
 				Testcase tuple = TupleSequence.get(i);
@@ -510,7 +510,6 @@ class PairTable extends TupleTable {
 	}
 	
 	boolean get(int p1, byte v1, int p2, byte v2) {
-		// TODO Auto-generated method stub
 		if (p2 < p1) {
 			int tmp = p1; p1 = p2; p2 = tmp;
 			byte tmv = v1; v1 = v2; v2 = tmv;

--- a/src/v1/Main.java
+++ b/src/v1/Main.java
@@ -39,7 +39,7 @@ public class Main {
 			// 制約処理 BDD作成
 			ConstraintHandler conhndl = new ConstraintHandler(inputfiledata.parameterList, inputfiledata.constraintList);
 			// DEBUG: BDDの表示
-			/* conhndl.printConstraintBDD(); */
+			// conhndl.printConstraintBDD(); // コメントアウト必要
 
 			//　シード読み込み
 			List<Testcase> seed = Inputer.readSeed(seedFile, inputfiledata);