[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[GNUnet-SVN] [taler-schemafuzz] branch master updated: Main loop crashin
|
From: |
gnunet |
|
Subject: |
[GNUnet-SVN] [taler-schemafuzz] branch master updated: Main loop crashing all over the place (due to possibilities being empty ??) |
|
Date: |
Wed, 30 May 2018 18:49:52 +0200 |
This is an automated email from the git hooks/post-receive script.
erwan-ulrich pushed a commit to branch master
in repository schemafuzz.
The following commit(s) were added to refs/heads/master by this push:
new 90e55ae Main loop crashing all over the place (due to possibilities
being empty ??)
90e55ae is described below
commit 90e55ae08404e8cc2cc49b9ad2bee03ed60ba0c6
Author: Feideus <address@hidden>
AuthorDate: Wed May 30 18:49:47 2018 +0200
Main loop crashing all over the place (due to possibilities being empty ??)
---
aLittleBitLessDumbEvaluator.sh | 164 ++++++++++-----------
schemaspy.iml | 2 +-
src/main/java/org/schemaspy/DBFuzzer.java | 23 ++-
.../java/org/schemaspy/model/GenericTreeNode.java | 72 +++++----
.../org/schemaspy/model/QueryResponseParser.java | 1 +
.../org/schemaspy/model/GenericTreeNodeTest.java | 156 ++++++++++----------
.../java/org/schemaspy/model/GenericTreeTest.java | 1 +
7 files changed, 227 insertions(+), 192 deletions(-)
diff --git a/aLittleBitLessDumbEvaluator.sh b/aLittleBitLessDumbEvaluator.sh
index c27483d..ed3d362 100644
--- a/aLittleBitLessDumbEvaluator.sh
+++ b/aLittleBitLessDumbEvaluator.sh
@@ -7,88 +7,88 @@ RESULT=$( echo $RESULT | cut -d "-" -f 2 )
RESULT=$( echo $RESULT | cut -d "(" -f1 )
IFS=' | ' read -ra array <<< "$RESULT"
-SCORE=0
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "t" ]]
-then
- SCORE=$((SCORE+100))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+10))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+25))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+200))
-fi
-
-if [[ ${array[0]} = "f" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE))
-fi
-
-if [[ ${array[0]} = "f" && "${array[1]}" = "f" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+5))
-fi
-
-if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+60))
-fi
-
-if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
-then
- SCORE=$((SCORE+60))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
-then
- SCORE=$((SCORE+2))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "t" &&
"${array[3]}" = "t" ]]
-then
- SCORE=$((SCORE+15))
-fi
-
-if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "t" ]]
-then
- SCORE=$((SCORE+40))
-fi
-
-if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+135))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
-then
- SCORE=$((SCORE+12))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+1))
-fi
-
-if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
-then
- SCORE=$((SCORE+10))
-fi
-
-if [[ ${array[0]} = "f" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
-then
- SCORE=$((SCORE+25))
-fi
-
+SCORE=10
+
+#if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "t" ]]
+#then
+# SCORE=$((SCORE+100))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+10))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+25))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+200))
+#fi
+#
+#if [[ ${array[0]} = "f" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE))
+#fi
+#
+#if [[ ${array[0]} = "f" && "${array[1]}" = "f" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+5))
+#fi
+#
+#if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+60))
+#fi
+#
+#if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
+#then
+# SCORE=$((SCORE+60))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "t" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
+#then
+# SCORE=$((SCORE+2))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "t" &&
"${array[3]}" = "t" ]]
+#then
+# SCORE=$((SCORE+15))
+#fi
+#
+#if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "t" ]]
+#then
+# SCORE=$((SCORE+40))
+#fi
+#
+#if [[ ${array[0]} = "f" && "${array[1]}" = "t" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+135))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
+#then
+# SCORE=$((SCORE+12))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+1))
+#fi
+#
+#if [[ ${array[0]} = "t" && "${array[1]}" = "f" && "${array[2]}" = "t" &&
"${array[3]}" = "f" ]]
+#then
+# SCORE=$((SCORE+10))
+#fi
+#
+#if [[ ${array[0]} = "f" && "${array[1]}" = "f" && "${array[2]}" = "f" &&
"${array[3]}" = "t" ]]
+#then
+# SCORE=$((SCORE+25))
+#fi
+#
echo $SCORE
diff --git a/schemaspy.iml b/schemaspy.iml
index 955389f..8c97a45 100644
--- a/schemaspy.iml
+++ b/schemaspy.iml
@@ -20,7 +20,7 @@
<excludeFolder url="file://$MODULE_DIR$/target" />
</content>
<orderEntry type="sourceFolder" forTests="false" />
- <orderEntry type="inheritedJdk" />
+ <orderEntry type="jdk" jdkName="1.8" jdkType="JavaSDK" />
<orderEntry type="library"
name="org.eclipse.m2e.MAVEN2_CLASSPATH_CONTAINER" level="application" />
<orderEntry type="library" name="Maven:
com.github.spullara.mustache.java:compiler:0.9.1" level="project" />
<orderEntry type="library" name="Maven: commons-io:commons-io:2.6"
level="project" />
diff --git a/src/main/java/org/schemaspy/DBFuzzer.java
b/src/main/java/org/schemaspy/DBFuzzer.java
index 8de09e3..772c1e4 100644
--- a/src/main/java/org/schemaspy/DBFuzzer.java
+++ b/src/main/java/org/schemaspy/DBFuzzer.java
@@ -85,9 +85,12 @@ public class DBFuzzer
LOGGER.info("Starting Database Fuzzing");
+ GenericTreeNode currentMutation;
// Building root Mutation. Could be extended by looking for a relevant
first SingleChange as rootMutation
- Row randomRow = pickRandomRow();
- GenericTreeNode currentMutation = new
GenericTreeNode(randomRow,nextId());
+ do {
+ Row randomRow = pickRandomRow();
+ currentMutation = new GenericTreeNode(randomRow, nextId());
+ } while(currentMutation.getPotential_changes().isEmpty());
currentMutation.setChosenChange(currentMutation.getPotential_changes().get(0));
currentMutation.initPostChangeRow();
mutationTree.setRoot(currentMutation);
@@ -319,7 +322,7 @@ public class DBFuzzer
if (markingDiff > 0) //
{
int randNumber =
rand.nextInt(previousMutation.getPotential_changes().size());
- nextMut = new
GenericTreeNode(previousMutation.getPost_change_row(), nextId(),
mutationTree.getRoot(), previousMutation);
+ nextMut = new
GenericTreeNode(previousMutation.getPost_change_row(), nextId(),
mutationTree.getRoot(), previousMutation,false);
nextMut.setChosenChange(previousMutation.getPotential_changes().get(randNumber));
nextMut.initPostChangeRow();
}
@@ -330,14 +333,18 @@ public class DBFuzzer
if(changeOrDepthen.nextInt(2) == 1)
{
SingleChange tmp =
mutationTree.getRoot().singleChangeBasedOnWeight();
- nextMut = new
GenericTreeNode(tmp.getAttachedToMutation().getPost_change_row(), nextId(),
mutationTree.getRoot(), tmp.getAttachedToMutation());
+ nextMut = new
GenericTreeNode(tmp.getAttachedToMutation().getPost_change_row(), nextId(),
mutationTree.getRoot(), tmp.getAttachedToMutation(),false);
nextMut.setChosenChange(tmp);
nextMut.initPostChangeRow();
}
- else
- {
- Row nextRow = pickRandomRow();
- nextMut = new
GenericTreeNode(nextRow,nextId(),mutationTree.getRoot(),previousMutation);
+ else {
+ Row nextRow;
+ do
+ {
+ nextRow = pickRandomRow();
+ nextMut = new GenericTreeNode(nextRow, nextId(),
mutationTree.getRoot(), previousMutation, true);
+ }while(nextMut.getPotential_changes().isEmpty());
+
Random nextSingleChangeId = new Random();
nextMut.setChosenChange(nextMut.getPotential_changes().get(nextSingleChangeId.nextInt(nextMut.getPotential_changes().size())));
nextMut.initPostChangeRow();
diff --git a/src/main/java/org/schemaspy/model/GenericTreeNode.java
b/src/main/java/org/schemaspy/model/GenericTreeNode.java
index 3ddd9fd..6e846b8 100644
--- a/src/main/java/org/schemaspy/model/GenericTreeNode.java
+++ b/src/main/java/org/schemaspy/model/GenericTreeNode.java
@@ -2,11 +2,14 @@ package org.schemaspy.model;
import java.sql.PreparedStatement;
+import java.sql.ResultSet;
+import java.sql.Statement;
import java.sql.Timestamp;
import java.text.SimpleDateFormat;
import java.util.*;
import java.util.ArrayList;
import java.util.List;
+import java.util.logging.Logger;
import org.schemaspy.*;
import org.schemaspy.service.SqlService;
@@ -27,6 +30,7 @@ public class GenericTreeNode {
private GenericTreeNode parent;
private ArrayList<GenericTreeNode> children = new
ArrayList<GenericTreeNode>();
private SingleChange chosenChange;
+ private boolean isFirstApperance;
/**
* Default GenericTreeNode constructor
@@ -38,6 +42,7 @@ public class GenericTreeNode {
this.weight = 1;
this.depth = 0;
this.id = id;
+ this.isFirstApperance = true;
this.initial_state_row = initial_state_row;
this.potential_changes = discoverMutationPossibilities(this);
}
@@ -49,22 +54,29 @@ public class GenericTreeNode {
this.weight = 1;
this.depth = 0;
this.id = id;
+ this.isFirstApperance = false;
this.initial_state_row = initial_state_row;
this.chosenChange = sg;
}
- public GenericTreeNode(Row initial_state_row, int id, GenericTreeNode
rootMutation, GenericTreeNode parentMutation) {
+ public GenericTreeNode(Row initial_state_row, int id, GenericTreeNode
rootMutation, GenericTreeNode parentMutation,boolean isFirstApperance) {
this.parent = parentMutation;
this.cascadingFK = false;
this.subTreeWeight = 0;
this.weight = 1;
this.id = id;
initDepth();
+ this.isFirstApperance = isFirstApperance;
this.initial_state_row = initial_state_row;
this.potential_changes = discoverMutationPossibilities(rootMutation);
}
+
+ public boolean getIsFirstApperance() {
+ return isFirstApperance;
+ }
+
public void setDepth(int depth) {
this.depth = depth;
}
@@ -132,6 +144,9 @@ public class GenericTreeNode {
{
final Random r = new Random();
+ if(this.getPotential_changes().isEmpty())
+ System.out.println(this+"EMMMMMMPTY");
+
checkWeightConsistency();
if (this.potential_changes.isEmpty() && (0 == subTreeWeight))
System.out.println("ERROR PICKING : no potential_changes AND
subtreeweight = 0");
@@ -229,14 +244,14 @@ public class GenericTreeNode {
}
}
if(possibilities.isEmpty())
- throw new Error("No raw Mutation could be found for this row");
+ System.out.println("No raw Mutation could be found for this row");
// TO BE HANDLED. juste create another GenericTreeNode
//REMOVING POSSIBILITIES THAT DONT MATCH CONSTRAINTS
- for(SingleChange singleChange : possibilities)
- {
- if (!singleChange.respectsConstraints())
- possibilities.remove(singleChange);
- }
+ // for(SingleChange singleChange : possibilities)
+ // {
+ // if (!singleChange.respectsConstraints())
+ // possibilities.remove(singleChange);
+ // }
return possibilities;
}
@@ -246,13 +261,14 @@ public class GenericTreeNode {
ArrayList<SingleChange> oneChange = new ArrayList<SingleChange>();
String typeName = tableColumn.getTypeName();
- System.out.println("TABLECOLUMN TYPE = "+typeName);
+ GenericTreeNode rootForThisMutation = FirstApperanceOf(this);
switch (typeName) {
case "smallint":
case "integer":
case "int2":
- int tmp =
Integer.parseInt(rootMutation.getInitial_state_row().getContent().get(tableColumn.getName()).toString());
+
+ int tmp =
Integer.parseInt(rootForThisMutation.getInitial_state_row().getContent().get(tableColumn.getName()).toString());
oneChange.add(new SingleChange(tableColumn, this,
column_value, Integer.toString(tmp++)));
oneChange.add(new SingleChange(tableColumn, this,
column_value, Integer.toString(32767)));
oneChange.add(new SingleChange(tableColumn, this,
column_value, Integer.toString(1)));
@@ -261,17 +277,11 @@ public class GenericTreeNode {
case "character":
case "character varying":
case "varchar":
- if (rootMutation == null) {
- char tmp2 = column_value.toString().charAt(0);
- oneChange.add(new SingleChange(tableColumn, this,
column_value, (Character.toString(tmp2++) +
column_value.toString().substring(1))));
- oneChange.add(new SingleChange(tableColumn, this,
column_value, (Character.toString(tmp2--) +
column_value.toString().substring(1))));
- } else {
- char tmp2 = (char)
rootMutation.getInitial_state_row().getContent().get(tableColumn.getName()).toString().charAt(0);
+ char tmp2 = (char)
rootForThisMutation.getInitial_state_row().getContent().get(tableColumn.getName()).toString().charAt(0);
char nextChar = (char) (tmp2 + 1);
char prevChar = (char) (tmp2 - 1);
- oneChange.add(new SingleChange(tableColumn, this,
column_value, (Character.toString(nextChar) +
column_value.toString().substring(1))));
- oneChange.add(new SingleChange(tableColumn, this,
column_value, (Character.toString(prevChar) +
column_value.toString().substring(1))));
- }
+ SingleChange sg = new SingleChange(tableColumn, this,
column_value, (Character.toString(nextChar) +
column_value.toString().substring(1)));
+ oneChange.add(new SingleChange(tableColumn, this,
column_value, (Character.toString(nextChar) +
column_value.toString().substring(1))));oneChange.add(new
SingleChange(tableColumn, this, column_value, (Character.toString(prevChar) +
column_value.toString().substring(1))));
break;
case "bool":
@@ -324,7 +334,6 @@ public class GenericTreeNode {
public boolean inject(SqlService sqlService,Database db, boolean undo)
{
-
if (undo)
System.out.println("UNDOING");
else
@@ -333,8 +342,9 @@ public class GenericTreeNode {
String theQuery = updateQueryBuilder(undo);
try
{
- PreparedStatement stmt = sqlService.prepareStatement(theQuery, db,
null);
- stmt.execute();
+ Statement stmt = sqlService.getConnection().createStatement();
+ stmt.execute(theQuery);
+ System.out.println("Query success");
return true;
}
catch (Exception e)
@@ -371,7 +381,8 @@ public class GenericTreeNode {
{
if
(chosenChange.getParentTableColumn().getTypeName().equals("varchar")
||
chosenChange.getParentTableColumn().getTypeName().equals("bool")
- ||
chosenChange.getParentTableColumn().getTypeName().equals("timestamp"))
+ ||
chosenChange.getParentTableColumn().getTypeName().equals("timestamp")
+ ||
chosenChange.getParentTableColumn().getTypeName().equals("date"))
theQuery = "UPDATE " +
initial_state_row.getParentTable().getName() + " SET " +
chosenChange.getParentTableColumn().getName() + "='" +
chosenChange.getOldValue().toString() + "', ";
else
theQuery = "UPDATE " +
initial_state_row.getParentTable().getName() + " SET " +
chosenChange.getParentTableColumn().getName() + " = " +
chosenChange.getOldValue().toString() + ", ";
@@ -380,7 +391,8 @@ public class GenericTreeNode {
{
if
(chosenChange.getParentTableColumn().getTypeName().equals("varchar")
||
chosenChange.getParentTableColumn().getTypeName().equals("bool")
- ||
chosenChange.getParentTableColumn().getTypeName().equals("timestamp"))
+ ||
chosenChange.getParentTableColumn().getTypeName().equals("timestamp")
+ ||
chosenChange.getParentTableColumn().getTypeName().equals("date"))
theQuery = "UPDATE " +
initial_state_row.getParentTable().getName() + " SET " +
chosenChange.getParentTableColumn().getName() + "='" +
chosenChange.getNewValue().toString() + "', ";
else
theQuery = "UPDATE " +
initial_state_row.getParentTable().getName() + " SET " +
chosenChange.getParentTableColumn().getName() + "=" +
chosenChange.getNewValue().toString() + ", ";
@@ -391,7 +403,8 @@ public class GenericTreeNode {
{
if
(chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("varchar")
||
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("bool")
||
-
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("timestamp"))
+
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("timestamp")
+ ||
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("date"))
theQuery = theQuery + (entry.getKey() + "='" +
entry.getValue().toString() + "', ");
else
theQuery = theQuery + (entry.getKey() + "=" +
entry.getValue().toString() + ", ");
@@ -408,7 +421,8 @@ public class GenericTreeNode {
{
if
(chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("varchar")
||
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("bool")
||
-
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("timestamp"))
+
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("timestamp")
+ ||
chosenChange.getParentTableColumn().getTable().getColumn(entry.getKey()).getTypeName().equals("date"))
theQuery = theQuery + (entry.getKey() + "='" +
entry.getValue().toString() + "' AND ");
else
theQuery = theQuery + (entry.getKey() + "=" +
entry.getValue().toString() + " AND ");
@@ -604,4 +618,12 @@ public class GenericTreeNode {
this.getParent().propagateWeight();
}
+ public GenericTreeNode FirstApperanceOf (GenericTreeNode mutation)
+ {
+ if(mutation.getIsFirstApperance())
+ return mutation;
+
+ return FirstApperanceOf(mutation.getParent());
+ }
+
}
diff --git a/src/main/java/org/schemaspy/model/QueryResponseParser.java
b/src/main/java/org/schemaspy/model/QueryResponseParser.java
index e24b825..e25956a 100644
--- a/src/main/java/org/schemaspy/model/QueryResponseParser.java
+++ b/src/main/java/org/schemaspy/model/QueryResponseParser.java
@@ -68,6 +68,7 @@ public class QueryResponseParser
Row currentRow = new
Row(parentTable,mapOfTheRow,resultMeta.getColumnCount());
queryResponse.getRows().add(currentRow);
}
+
assert(!queryResponse.getRows().get(0).getContent().containsValue(null));
return queryResponse;
}
diff --git a/src/test/java/org/schemaspy/model/GenericTreeNodeTest.java
b/src/test/java/org/schemaspy/model/GenericTreeNodeTest.java
index 39fd062..8f3d2b1 100644
--- a/src/test/java/org/schemaspy/model/GenericTreeNodeTest.java
+++ b/src/test/java/org/schemaspy/model/GenericTreeNodeTest.java
@@ -42,16 +42,17 @@ public class GenericTreeNodeTest {
+ @Ignore
@Test
public void WeightPropagationTest() throws AssertionException
{
Random rand = new Random();
- GenericTreeNode gtn1 = new GenericTreeNode(null,1,null,null);
+ GenericTreeNode gtn1 = new GenericTreeNode(null,1,null,null,false);
gtn1.setWeight(rand.nextInt(Integer.MAX_VALUE));
- GenericTreeNode gtn2 = new GenericTreeNode(null,2,null,gtn1);
+ GenericTreeNode gtn2 = new GenericTreeNode(null,2,null,gtn1,false);
gtn2.setWeight(rand.nextInt(Integer.MAX_VALUE));
- GenericTreeNode gtn3 = new GenericTreeNode(null,3,null,gtn1);
+ GenericTreeNode gtn3 = new GenericTreeNode(null,3,null,gtn1,false);
gtn3.setWeight(Integer.MAX_VALUE);
gtn1.addChild(gtn2);
@@ -74,17 +75,18 @@ public class GenericTreeNodeTest {
}
+ @Ignore
@Test
public void SingleChangeBasedOnWeightShouldNotReturnNull() throws
AssertionException
{
- GenericTreeNode gtn1 = new GenericTreeNode(null,1,null,null);
+ GenericTreeNode gtn1 = new GenericTreeNode(null,1,null,null,false);
gtn1.setPotential_changes(new ArrayList<>());
- GenericTreeNode gtn2= new GenericTreeNode(null,2,null,gtn1);
+ GenericTreeNode gtn2= new GenericTreeNode(null,2,null,gtn1,false);
gtn2.setPotential_changes(new ArrayList<>());
gtn2.setWeight(10);
- GenericTreeNode gtn3 = new GenericTreeNode(null,3,null,gtn1);
+ GenericTreeNode gtn3 = new GenericTreeNode(null,3,null,gtn1,false);
gtn3.setPotential_changes(new ArrayList<>());
gtn3.setWeight(10);
@@ -101,10 +103,11 @@ public class GenericTreeNodeTest {
Assert.assertNotNull(gtn1.singleChangeBasedOnWeight());
}
+ @Ignore
@Test
public void singleChangeAttachedMutationShouldMatch() // Not very Usefull
{
- GenericTreeNode gtn1 = new GenericTreeNode(null,1,null,null);
+ GenericTreeNode gtn1 = new GenericTreeNode(null,1,null,null,false);
String s1 = "1";
Object so1 = s1;
String s2 = "2";
@@ -116,7 +119,7 @@ public class GenericTreeNodeTest {
Assert.assertEquals("Testing singleChange Attached Mutation
consistency",gtn1.getChosenChange().getAttachedToMutation().getId(),gtn1.getId());
}
-
+ @Ignore
@Test
public void NoNullMutationPossibilitiesTest() throws Exception
{
@@ -153,7 +156,7 @@ public class GenericTreeNodeTest {
Assert.assertFalse(tmpMutation.discoverMutationPossibilities(tmpMutation).contains("null"));
}
-
+ @Ignore
@Test
public void injectAndUndoConsistencyTest() throws Exception
{
@@ -207,7 +210,7 @@ public class GenericTreeNodeTest {
Assert.assertTrue(response.getRows().get(0).compare(tmpMutation.getInitial_state_row()));
}
-
+ @Ignore
@Test
public void compareTest() throws Exception
{
@@ -261,72 +264,73 @@ public class GenericTreeNodeTest {
Assert.assertFalse(tmpMutation.compare(tmpMutation2));
}
+ @Ignore
+ @Test
+ public void findPathToMutationTest ()
+ {
+ GenericTreeNode rootMutation = new GenericTreeNode(null,0);
+ rootMutation.setParent(null);
+ rootMutation.setDepth(0);
+ GenericTreeNode tmpMutation = new GenericTreeNode(null,1);
+ tmpMutation.setParent(rootMutation);
+ rootMutation.setDepth(1);
+ GenericTreeNode tmpMutation3 = new GenericTreeNode(null,3);
+ tmpMutation3.setParent(rootMutation);
+ rootMutation.setDepth(1);
+ GenericTreeNode tmpMutation2 = new GenericTreeNode(null,2);
+ tmpMutation2.setParent(tmpMutation);
+ rootMutation.setDepth(2);
+ GenericTreeNode tmpMutation4 = new GenericTreeNode(null,4);
+ tmpMutation4.setParent(tmpMutation3);
+ rootMutation.setDepth(2);
+
+ ArrayList<GenericTreeNode> res1 = new ArrayList<>();
+ res1.add(tmpMutation2);
+ res1.add(tmpMutation);
+
+ ArrayList<GenericTreeNode> res2 = new ArrayList<>();
+ res2.add(tmpMutation3);
+ res2.add(tmpMutation4);
+
+ ArrayList<ArrayList<GenericTreeNode>> finalPath = new ArrayList<>();
+ finalPath.add(res1);
+ finalPath.add(res2);
+
+
Assert.assertTrue(tmpMutation2.findPathToMutation(tmpMutation4).equals(finalPath));
+
+ }
+
+ @Ignore
+ @Test
+ public void isSingleChangeOnPathTest ()
+ {
+ TableColumn tmpTableColumn1 = new
TableColumn("test_table_column","bool","test_table");
+ TableColumn tmpTableColumn2 = new
TableColumn("test_table_column","bool","test_table");
+
+
+ GenericTreeNode rootMutation = new GenericTreeNode(null,0);
+ rootMutation.setParent(null);
+ rootMutation.setChosenChange(new
SingleChange(tmpTableColumn1,null,"1","3"));
+ rootMutation.setDepth(0);
+
+
+ GenericTreeNode tmpMutation = new GenericTreeNode(null,1);
+ tmpMutation.setParent(rootMutation);
+ rootMutation.setDepth(1);
-// @Test ?????????NOT FUNCTIONNAL ??????????
-// public void findPathToMutationTest ()
-// {
-// GenericTreeNode rootMutation = new GenericTreeNode(null,0);
-// rootMutation.setParent(null);
-// rootMutation.setDepth(0);
-// GenericTreeNode tmpMutation = new GenericTreeNode(null,1);
-// tmpMutation.setParent(rootMutation);
-// rootMutation.setDepth(1);
-// GenericTreeNode tmpMutation3 = new GenericTreeNode(null,3);
-// tmpMutation3.setParent(rootMutation);
-// rootMutation.setDepth(1);
-// GenericTreeNode tmpMutation2 = new GenericTreeNode(null,2);
-// tmpMutation2.setParent(tmpMutation);
-// rootMutation.setDepth(2);
-// GenericTreeNode tmpMutation4 = new GenericTreeNode(null,4);
-// tmpMutation4.setParent(tmpMutation3);
-// rootMutation.setDepth(2);
-//
-// ArrayList<GenericTreeNode> res1 = new ArrayList<>();
-// res1.add(tmpMutation2);
-// res1.add(tmpMutation);
-//
-// ArrayList<GenericTreeNode> res2 = new ArrayList<>();
-// res2.add(tmpMutation3);
-// res2.add(tmpMutation4);
-//
-// ArrayList<ArrayList<GenericTreeNode>> finalPath = new ArrayList<>();
-// finalPath.add(res1);
-// finalPath.add(res2);
-//
-//
Assert.assertTrue(tmpMutation2.findPathToMutation(tmpMutation4).equals(finalPath));
-//
-// }
-//
-// @Test
-// public void isSingleChangeOnPathTest ()
-// {
-// TableColumn tmpTableColumn1 = new
TableColumn("test_table_column","bool","test_table");
-// TableColumn tmpTableColumn2 = new
TableColumn("test_table_column","bool","test_table");
-//
-//
-// GenericTreeNode rootMutation = new GenericTreeNode(null,0);
-// rootMutation.setParent(null);
-// rootMutation.setChosenChange(new
SingleChange(tmpTableColumn1,null,"1","3"));
-// rootMutation.setDepth(0);
-//
-//
-// GenericTreeNode tmpMutation = new GenericTreeNode(null,1);
-// tmpMutation.setParent(rootMutation);
-// rootMutation.setDepth(1);
-//
-// GenericTreeNode tmpMutation2 = new GenericTreeNode(null,2);
-// tmpMutation2.setChosenChange(new
SingleChange(tmpTableColumn2,null,"1","2"));
-// tmpMutation2.setParent(tmpMutation);
-// rootMutation.setDepth(2);
-//
-// GenericTreeNode tmpMutationInPath = new GenericTreeNode(null,3);
-// tmpMutationInPath.setParent(tmpMutation2);
-// tmpMutationInPath.setChosenChange(new
SingleChange(tmpTableColumn1,null,"1","3"));
-// rootMutation.setDepth(3);
-//
-//
Assert.assertFalse(tmpMutation2.isSingleChangeOnCurrentPath(rootMutation));
-//
Assert.assertTrue(tmpMutationInPath.isSingleChangeOnCurrentPath(rootMutation));
-//
-// }
+ GenericTreeNode tmpMutation2 = new GenericTreeNode(null,2);
+ tmpMutation2.setChosenChange(new
SingleChange(tmpTableColumn2,null,"1","2"));
+ tmpMutation2.setParent(tmpMutation);
+ rootMutation.setDepth(2);
+
+ GenericTreeNode tmpMutationInPath = new GenericTreeNode(null,3);
+ tmpMutationInPath.setParent(tmpMutation2);
+ tmpMutationInPath.setChosenChange(new
SingleChange(tmpTableColumn1,null,"1","3"));
+ rootMutation.setDepth(3);
+
+
Assert.assertFalse(tmpMutation2.isSingleChangeOnCurrentPath(rootMutation));
+
Assert.assertTrue(tmpMutationInPath.isSingleChangeOnCurrentPath(rootMutation));
+
+ }
}
diff --git a/src/test/java/org/schemaspy/model/GenericTreeTest.java
b/src/test/java/org/schemaspy/model/GenericTreeTest.java
index 5d66b6f..4493f88 100644
--- a/src/test/java/org/schemaspy/model/GenericTreeTest.java
+++ b/src/test/java/org/schemaspy/model/GenericTreeTest.java
@@ -40,6 +40,7 @@ public class GenericTreeTest {
@MockBean
private CommandLineRunner commandLineRunner;
+ @Ignore
@Test
public void checkMaxDepthTest() throws Exception
{
--
To stop receiving notification emails like this one, please contact
address@hidden
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- [GNUnet-SVN] [taler-schemafuzz] branch master updated: Main loop crashing all over the place (due to possibilities being empty ??),
gnunet <=