Testcase generation tool for combinatorial interaction testing
| Revision | 50636160dafa089cc2644690d739a9418a2ca6ec (tree) |
|---|---|
| Time | 2015-05-01 15:36:00 |
| Author |  t-tutiya <tatsuhiro@ieee...> |
| Commiter | t-tutiya |
1.01
src/v1/ConstraintHandler.java (diff) src/v1/Generator.java (diff) src/v1/Main.java (diff)| @@ -115,10 +115,15 @@ class ConstraintHandler { | ||
| 115 | 115 | bdd.deref(g); |
| 116 | 116 | } |
| 117 | 117 | // bdd.ref(f); |
| 118 | + // 消すこと | |
| 119 | + bdd.printSet(f); | |
| 118 | 120 | |
| 119 | 121 | // *を付加 |
| 120 | 122 | f = extendBddConstraint(f); |
| 121 | - | |
| 123 | + | |
| 124 | + // 消すこと | |
| 125 | + bdd.printSet(f); | |
| 126 | + | |
| 122 | 127 | return f; |
| 123 | 128 | } |
| 124 | 129 |
| @@ -56,7 +56,6 @@ abstract class Generator { | ||
| 56 | 56 | // groupで全網羅するtupleの列を生成 |
| 57 | 57 | protected List<List<Testcase>> generateTupleSequenceList() { |
| 58 | 58 | // protected List<TupleSequence> generateTupleSequence() { |
| 59 | - // TODO Auto-generated method stub | |
| 60 | 59 | List<List<Testcase>> listOfTupleSequence = new ArrayList<List<Testcase>>(); |
| 61 | 60 | for (Group g: groupList) { |
| 62 | 61 | listOfTupleSequence.add(generateTupleSequence(g)); |
| @@ -64,6 +63,7 @@ abstract class Generator { | ||
| 64 | 63 | return listOfTupleSequence; |
| 65 | 64 | } |
| 66 | 65 | |
| 66 | + // groupを網羅するtuple列を生成し返す | |
| 67 | 67 | private List<Testcase> generateTupleSequence(Group g) { |
| 68 | 68 | int numOfCombinations = 1; |
| 69 | 69 | for (int i = 0; i < g.member.length; i++) { |
| @@ -100,6 +100,7 @@ abstract class Generator { | ||
| 100 | 100 | return testSet; |
| 101 | 101 | } |
| 102 | 102 | |
| 103 | + // 未カバーのtupleがあればture, そうでなければ false | |
| 103 | 104 | protected boolean hasTuplesToCover(List<List<Testcase>> tupleSequenceList) { |
| 104 | 105 | // TODO Auto-generated method stub |
| 105 | 106 | for (List<Testcase> tupleSequence : tupleSequenceList) { |
| @@ -299,7 +300,6 @@ class Generator2 extends Generator { | ||
| 299 | 300 | |
| 300 | 301 | |
| 301 | 302 | private void addGroupedTuples(Testcase tmp, List<List<Testcase>> tupleSequenceList) { |
| 302 | - // TODO Auto-generated method stub | |
| 303 | 303 | for (List<Testcase> TupleSequence : tupleSequenceList) { |
| 304 | 304 | for (int i = 0; i < TupleSequence.size(); i++) { |
| 305 | 305 | Testcase tuple = TupleSequence.get(i); |
| @@ -510,7 +510,6 @@ class PairTable extends TupleTable { | ||
| 510 | 510 | } |
| 511 | 511 | |
| 512 | 512 | boolean get(int p1, byte v1, int p2, byte v2) { |
| 513 | - // TODO Auto-generated method stub | |
| 514 | 513 | if (p2 < p1) { |
| 515 | 514 | int tmp = p1; p1 = p2; p2 = tmp; |
| 516 | 515 | byte tmv = v1; v1 = v2; v2 = tmv; |
| @@ -39,7 +39,7 @@ public class Main { | ||
| 39 | 39 | // 制約処理 BDD作成 |
| 40 | 40 | ConstraintHandler conhndl = new ConstraintHandler(inputfiledata.parameterList, inputfiledata.constraintList); |
| 41 | 41 | // DEBUG: BDDの表示 |
| 42 | - /* conhndl.printConstraintBDD(); */ | |
| 42 | + // conhndl.printConstraintBDD(); // コメントアウト必要 | |
| 43 | 43 | |
| 44 | 44 | // シード読み込み |
| 45 | 45 | List<Testcase> seed = Inputer.readSeed(seedFile, inputfiledata); |
Fork