no message
This commit is contained in:
@@ -10,7 +10,6 @@ import com.google.gson.annotations.Expose;
|
||||
import javax.swing.tree.DefaultMutableTreeNode;
|
||||
import java.io.Serializable;
|
||||
import java.nio.file.Paths;
|
||||
import java.util.Comparator;
|
||||
import java.util.List;
|
||||
import java.util.Vector;
|
||||
public class SapforPackage_json implements Serializable {
|
||||
@@ -30,55 +29,49 @@ public class SapforPackage_json implements Serializable {
|
||||
//--
|
||||
@Expose
|
||||
public List<SapforTask> tasks = new Vector<>();
|
||||
public boolean containsKey(String key) {
|
||||
for (SapforTask task : tasks) {
|
||||
if (task.getUniqueKey().equals(key))
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
public SapforTask getTaskByKey(String key) {
|
||||
for (SapforTask task : tasks) {
|
||||
if (task.getUniqueKey().equals(key))
|
||||
return task;
|
||||
}
|
||||
return null;
|
||||
}
|
||||
//-
|
||||
public PackageSummary root = null;
|
||||
public PackageComparisonSummary comparison_root = null;
|
||||
//--
|
||||
// public LinkedHashMap<String, SapforTask> allTasks = new LinkedHashMap<>(); //задачи по ключам (?)
|
||||
// public LinkedHashMap<TaskState, Vector<SapforTask>> sortedTasks = new LinkedHashMap<>();
|
||||
// public LinkedHashMap<String, SapforTask> allTasks = new LinkedHashMap<>(); //задачи по ключам (?)
|
||||
// public LinkedHashMap<TaskState, Vector<SapforTask>> sortedTasks = new LinkedHashMap<>();
|
||||
// public LinkedHashMap<TaskState, LinkedHashMap<Integer, LinkedHashMap<String, Vector<SapforTask>>>> sortedTasks = new LinkedHashMap<>();
|
||||
//-- задачи, отсортированные для сравнения.
|
||||
// public LinkedHashMap<MatchState, LinkedHashMap<TaskState, LinkedHashMap<Integer, LinkedHashMap<String, Vector<SapforTask>>>>> comparisonSortedTasks = new LinkedHashMap<>();
|
||||
// public LinkedHashMap<MatchState, LinkedHashMap<TaskState, Vector<SapforTask>>> comparisonSortedTasks = new LinkedHashMap<>();
|
||||
// public LinkedHashMap<MatchState, LinkedHashMap<TaskState, Vector<SapforTask>>> comparisonSortedTasks = new LinkedHashMap<>();
|
||||
//----
|
||||
//---------
|
||||
public void DropComparison() {
|
||||
// UI.Info("DROP COMPARISON");
|
||||
comparison_root = null;
|
||||
// comparisonSortedTasks.clear();
|
||||
for (SapforTask task: tasks)
|
||||
// comparisonSortedTasks.clear();
|
||||
for (SapforTask task : tasks)
|
||||
task.comparisonState = MatchState.Unknown;
|
||||
}
|
||||
public void SortTasksForComparison() {
|
||||
/*
|
||||
comparisonSortedTasks.clear();
|
||||
for (MatchState matchState : MatchState.values()) {
|
||||
LinkedHashMap<TaskState, Vector<SapforTask>> match_state_tasks = new LinkedHashMap<>();
|
||||
//-
|
||||
for (TaskState state : TaskState.values()) {
|
||||
Vector<SapforTask> stateTasks = new Vector<>();
|
||||
for (SapforTask task : tasks) {
|
||||
if (task.state.equals(state) && task.matchState.equals(matchState))
|
||||
stateTasks.add(task);
|
||||
}
|
||||
if (!stateTasks.isEmpty()) {
|
||||
match_state_tasks.put(state, stateTasks);
|
||||
}
|
||||
}
|
||||
comparisonSortedTasks.put(matchState, match_state_tasks);
|
||||
}
|
||||
*/
|
||||
}
|
||||
public void buildTree(SapforPackage package_in) {
|
||||
// tasks.sort(Comparator.comparing(SapforTask::getPK));
|
||||
for (SapforTask task: tasks)
|
||||
//--
|
||||
for (SapforTask task : tasks)
|
||||
task.comparisonState = MatchState.Unknown;
|
||||
//---
|
||||
root = new PackageSummary();
|
||||
root.count = package_in.package_json.tasks.size();
|
||||
root.errors_count=0;
|
||||
root.count = tasks.size();
|
||||
root.errors_count = 0;
|
||||
//--
|
||||
for (SapforTask task: tasks){
|
||||
for (SapforTask task : tasks) {
|
||||
DefaultMutableTreeNode taskNode = task.getNode(Paths.get(
|
||||
package_in.getLocalWorkspace().getAbsolutePath(),
|
||||
String.valueOf(task.set_id),
|
||||
@@ -90,30 +83,22 @@ public class SapforPackage_json implements Serializable {
|
||||
}
|
||||
}
|
||||
public void buildComparisonTree(SapforPackage package_in) {
|
||||
/*
|
||||
System.out.println(package_in.id);
|
||||
comparison_root = new PackageComparisonSummary();
|
||||
comparison_root.count = package_in.package_json.allTasks.size();
|
||||
comparison_root.count = tasks.size();
|
||||
comparison_root.mismatches_count = 0;
|
||||
//--
|
||||
for (MatchState match_state : comparisonSortedTasks.keySet()) {
|
||||
int count = 0;
|
||||
LinkedHashMap<TaskState, Vector<SapforTask>> task_states = comparisonSortedTasks.get(match_state);
|
||||
//---
|
||||
for (TaskState state : task_states.keySet()) {
|
||||
Vector<SapforTask> tasks = task_states.get(state);
|
||||
//-
|
||||
for (SapforTask task : tasks) {
|
||||
DefaultMutableTreeNode taskNode = task.getNode(Paths.get(
|
||||
package_in.getLocalWorkspace().getAbsolutePath(),
|
||||
String.valueOf(task.set_id),
|
||||
String.valueOf(task.sapfor_configuration_id)
|
||||
).toFile());
|
||||
comparison_root.add(taskNode);
|
||||
count++;
|
||||
}
|
||||
}
|
||||
if (match_state.equals(MatchState.NotMatch))
|
||||
comparison_root.mismatches_count+=count;
|
||||
for (SapforTask task : tasks) {
|
||||
System.out.println(task.getUniqueKey()+":"+task.comparisonState);
|
||||
DefaultMutableTreeNode taskNode = task.getNode(Paths.get(
|
||||
package_in.getLocalWorkspace().getAbsolutePath(),
|
||||
String.valueOf(task.set_id),
|
||||
String.valueOf(task.sapfor_configuration_id)
|
||||
).toFile());
|
||||
comparison_root.add(taskNode);
|
||||
if (task.comparisonState.equals(MatchState.NotMatch))
|
||||
comparison_root.mismatches_count++;
|
||||
}
|
||||
*/
|
||||
System.out.println("====");
|
||||
}
|
||||
}
|
||||
|
||||
@@ -152,12 +152,16 @@ public class SapforTask extends DBObject {
|
||||
//todo Для каждого случая подобрать иконку (?)
|
||||
if (!state.equals(task2.state)) {
|
||||
System.out.println("Не совпадение состояний задачи " + getUniqueKey());
|
||||
//--
|
||||
comparisonState = MatchState.NotMatch;
|
||||
task2.comparisonState = MatchState.NotMatch;
|
||||
//--
|
||||
} else if ((versions.size() != task2.versions.size())|| (variants.size() != task2.variants.size())) {
|
||||
System.out.println("Не совпадение количества версий в задаче " + getUniqueKey());
|
||||
//--
|
||||
comparisonState = MatchState.NotMatch;
|
||||
task2.comparisonState = MatchState.NotMatch;
|
||||
//--
|
||||
} else {
|
||||
LinkedHashMap<String, SapforVersion_json> versions1 = getSortedVersions();
|
||||
LinkedHashMap<String, SapforVersion_json> versions2 = task2.getSortedVersions();
|
||||
@@ -165,8 +169,10 @@ public class SapforTask extends DBObject {
|
||||
for (String name1 : versions1.keySet()) {
|
||||
if (!versions2.containsKey(name1)) {
|
||||
System.out.println("Не совпадение имен версий в задаче " + getUniqueKey());
|
||||
//--
|
||||
comparisonState = MatchState.NotMatch;
|
||||
task2.comparisonState = MatchState.NotMatch;
|
||||
//--
|
||||
return;
|
||||
}
|
||||
}
|
||||
@@ -178,9 +184,11 @@ public class SapforTask extends DBObject {
|
||||
SapforVersion_json version2 = versions2.get(name1);
|
||||
//---
|
||||
if (!version1.isMatch(version2)) {
|
||||
System.out.println("Не совпадение версий в задаче " + getUniqueKey());
|
||||
System.out.println("Не совпадение кода версий в задаче " + getUniqueKey());
|
||||
//-
|
||||
comparisonState = MatchState.NotMatch;
|
||||
task2.comparisonState = MatchState.NotMatch;
|
||||
//-
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user