Package org.cishell.testing.convertertester.core.tester.graphcomparison

Examples of org.cishell.testing.convertertester.core.tester.graphcomparison.ComparisonResult

107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
      Graph resultGraph = (Graph) originalInMemory[0].getData();
      Graph origGraph = (Graph) resultInMemory[0].getData();

      NewGraphComparer comparer = testData.getComparer();
      ComparisonResult graphComparisonPhaseResult = comparer.compare(
          origGraph, resultGraph);

      if (!graphComparisonPhaseResult.comparisonSucceeded()) {
        String explanation =
          graphComparisonPhaseResult.getLog();
        FilePassFailure failure = createFailResult(originalFileData,
            explanation, PassPhase.GRAPH_COMPARE_PHASE,
            null,
            allDataFromTestPhase,
            allDataFromOrigComparePhase,
View Full Code Here
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
  public ComparisonResult compare(Graph g1, Graph g2) {
    this.log = new RunningLog();
   
    if (g1 == null || g2 == null) {
      log.prepend("At least one of the provided graphs was null");
      return new ComparisonResult(false, log);
    }
    //basic tests 
    if (! isSameDirectedness(g1, g2)) {
      log.prepend("Directedness not of the same type");
      return new ComparisonResult(false, log);
    } else if (! isEqualNodeCount(g1, g2)) {
      log.prepend("Node counts not equal.");
      return new ComparisonResult(false, log);
    } else if (! isEqualEdgeCount(g1, g2)) {
      log.prepend("Edge counts not equal");
      return new ComparisonResult(false, log);
    }
   
    //all tests succeeded.
    return new ComparisonResult(true, log);
  }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
   
    public ComparisonResult compare(Graph g1, Graph g2) {
      super.clearLog();
      this.log = super.getLog();
     
      ComparisonResult simpleCompareResult = super.compare(g1, g2);
     
      if (! simpleCompareResult.comparisonSucceeded()) {
        return simpleCompareResult;
      }
     
      log.append(simpleCompareResult.getLog());
   
      if (! areEqual(g1, g2,  true))  {
        log.prepend("Graphs do not have the same contents");
        return new ComparisonResult(false, log); 
      }
       
    //all tests passed
      log.prepend("All comparison tests succeeded.");
      return new ComparisonResult(true, log);
    }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
  private RunningLog log;
 
  public ComparisonResult compare(Graph g1, Graph g2) {
    super.clearLog();
    this.log = super.getLog();
    ComparisonResult simpleCompareResult = super.compare(g1, g2);
   
    if (! simpleCompareResult.comparisonSucceeded()) {
      return simpleCompareResult;
    }
   
    log.append(simpleCompareResult.getLog());
   
    if (! nodeDegreeFrequenciesEqual(g1, g2)) {
      log.prepend("The number of nodes" +
          "with a certain number of edges is not the same in" +
          "both graphs.");
      return new ComparisonResult(false, log);
    }
   
    /*
     * TODO: we could really use a graph isomorphism comparison right
     * here. nodeDegreeFrequencies will catch some errors, but lets
     * a lot through.
     */ 
   
    if (! haveSameNodeAttributes(g1, g2)) {
      log.prepend("Node attributes are not " +
          "the same in both graphs.");
      return new ComparisonResult(false, log);
    }
   
    if (! haveSameEdgeAttributes(g1, g2)) {
      log.prepend("Edge attributes are not " +
          "the same in both graphs.");
      return new ComparisonResult(false, log);
    }
 
  //all tests passed
   
    log.prepend("All comparison tests succeeded");
    return new ComparisonResult(true, log);
  }
View Full Code Here
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
  public ComparisonResult compare(Graph g1, Graph g2) {
    this.log = new RunningLog();
   
    if (g1 == null || g2 == null) {
      log.prepend("At least one of the provided graphs was null");
      return new ComparisonResult(false, log);
    }

    if (! isEqualNodeCount(g1, g2)) {
      log.prepend("Node counts not equal.");
      return new ComparisonResult(false, log);
    } else if (! isEqualEdgeCount(g1, g2)) {
      log.prepend("Edge counts not equal.");
      return new ComparisonResult(false, log);
    }
   
    //all tests succeeded.
    return new ComparisonResult(true, log);
  }
View Full Code Here
TOP

Related Classes of org.cishell.testing.convertertester.core.tester.graphcomparison.ComparisonResult

  • org.cishell.testing.convertertester.core.tester2.DefaultTestRunner
  • org.cishell.testing.convertertester.core.tester2.graphcomparison.IdsNotPreservedComparer
  • org.cishell.testing.convertertester.core.tester2.graphcomparison.IdsPreservedComparer
  • org.cishell.testing.convertertester.core.tester2.graphcomparison.LossyComparer
  • org.cishell.testing.convertertester.core.tester2.graphcomparison.SimpleGraphComparer
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.