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

Examples of org.cishell.testing.convertertester.core.tester2.graphcomparison.ComplexGraphComparer

184
185
186
187
188
189
190
191
192
193
194
195
196
    for (int ii = 0; ii < crs.length; ii++) {
      ConvResult cr = crs[ii];
     
      ChanceAtFault[] cafs = cr.getAllChanceAtFaults();
      for (int jj = 0; jj < cafs.length; jj++) {
        ChanceAtFault caf = cafs[jj];
       
        String expln = caf.getExplanation();
       
        if(explnToCafs.get(expln) != null) {
          ((List)explnToCafs.get(expln)).add(caf);
        }
        else {
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
217
 
  //Map<test, Map<pass, List<cafs>>>
  private Map categorizeByTestAndPass(List cafList) {
    Map testToPassesToCafs = new HashMap();
    for (int ii = 0; ii < cafList.size(); ii++) {
      ChanceAtFault caf = (ChanceAtFault) cafList.get(ii); 
      FilePassResult pass = caf.getFailedFilePass();
      TestResult test = pass.getParent();
     
      Map passToCafs;
      List cafs;
     
View Full Code Here
243
244
245
246
247
248
249
250
251
252
253
254
255
 
  public ChanceAtFault getCafAssociatedWithProvidedConverter(
      List cafs, Converter conv) {
    Iterator cafIter = cafs.iterator();
    while (cafIter.hasNext()) {
      ChanceAtFault caf = (ChanceAtFault) cafIter.next();
     
      if (caf.getConverter() == conv) {
        return caf;
      }
    }
   
    return null;
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
   
    Iterator iter = this.failedInvolvedPasses.iterator();
    while (iter.hasNext()) {
      FilePassFailure failFP = (FilePassFailure) iter.next();
     
      ChanceAtFault chanceAtFault =
        failFP.getChanceAtFaultFor(this.conv);
     
      //add to list for all involved chance at faults
      this.chanceAtFaults.add(chanceAtFault);
     
      /*
       * potentially add to list for chance at faults with unique
       *  explanations.
       */
     
      String explanation = chanceAtFault.getExplanation();
     
      boolean unique =
        ! containsChanceAtFaultWithExpln(
            this.uniqueExplnChanceAtFaults, explanation);
     
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
149
150
151
    if (wasTested()) {
      float chanceCorrectSoFar = 1.0f;
   
      Iterator iter = this.uniqueExplnChanceAtFaults.iterator();
      while (iter.hasNext()) {
        ChanceAtFault uniqueExplnCAF = (ChanceAtFault) iter.next();
     
        float chanceCorrectForThisError =
          uniqueExplnCAF.getChanceNotAtFault();
     
        chanceCorrectSoFar *= chanceCorrectForThisError;
     
      }
   
View Full Code Here
262
263
264
265
266
267
268
269
270
271
272
273
274
 
  private boolean containsChanceAtFaultWithExpln(List chanceAtFaultList,
      String explanation) {
    Iterator iter = chanceAtFaultList.iterator();
    while (iter.hasNext()) {
      ChanceAtFault caf = (ChanceAtFault) iter.next();
     
      if (explanation.equals(caf.getExplanation())) {
        return true;
      }
    }
   
    return false;
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
 
  private ChanceAtFault[] removeDuplicateConverters(List cafs) {
    List newCafs = new ArrayList();
    List newCafConvs = new ArrayList();
    for (int ii = 0; ii < cafs.size(); ii++) {
      ChanceAtFault caf  = (ChanceAtFault) cafs.get(ii);
      if (! newCafConvs.contains(caf.getConverter())) {
        newCafs.add(caf);
        newCafConvs.add(caf.getConverter());
      }
    }
   
    return (ChanceAtFault[]) newCafs.toArray(new ChanceAtFault[0]);
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
        //set potential culprits to be intersection of
        //new potential culprits and old.
        List newPCs = new ArrayList();

        for (int ii = 0; ii < this.pcs.size(); ii++) {
          ChanceAtFault pc = (ChanceAtFault) this.pcs.get(ii);

          for (int jj = 0; jj < otherPCs.length; jj++) {
            ChanceAtFault otherPC = otherPCs[jj];

            if (pc.getConverter() == otherPC.getConverter()
                && otherPC.getChanceAtFault() > 0.0f) {

              ChanceAtFault newPC = new ChanceAtFault(pc
                  .getFailedFilePass(), pc.getConverter(), pc
                  .getChanceAtFault()
                  + otherPC.getChanceAtFault());

              newPCs.add(pc);

              break;
            }
          }
        }

        this.pcs = newPCs;

      } else {
        //add all chance at faults > 0.0f to potential culprit list
        List newPCs = new ArrayList();
        for (int ii = 0; ii < otherPCs.length; ii++) {
          ChanceAtFault pc = (ChanceAtFault) otherPCs[ii];
         
          if (pc.getChanceAtFault() > 0.0f) {
            newPCs.add(pc);
          }
        }
       
        this.pcs = newPCs;
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
   
    public ChanceAtFault[] getCulprits() {
      //normalize chance at faults
      float totalChanceAtFaults = 0.0f;
      for (int ii = 0; ii <  pcs.size(); ii++) {
        ChanceAtFault pc = (ChanceAtFault) pcs.get(ii);
       
        totalChanceAtFaults += pc.getChanceAtFault();
      }
     
      ChanceAtFault[] uniqueCafs =
        removeDuplicateConverters(this.pcs);
     
      List uniqueNormalizedCafs = new ArrayList();
      for (int ii = 0; ii < uniqueCafs.length; ii++) {
        ChanceAtFault pc = uniqueCafs[ii];
       
        ChanceAtFault normPC = new ChanceAtFault(
            pc.getFailedFilePass(),
            pc.getConverter(),
            pc.getChanceAtFault() / totalChanceAtFaults);
       
        uniqueNormalizedCafs.add(normPC);
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
   
    //analyze the test results to extract more useful info
   
    Converter[] allConverters = converterGraph.getAllConverters();
   
    ChanceAtFaultHeuristic faultHeuristic =
      new ErrorProximityHeuristic();
    AllConvsResult allConvertersResult =
      ConvResultMaker.generate(allTestsResult, allConverters,
          faultHeuristic);
   
View Full Code Here
TOP

Related Classes of org.cishell.testing.convertertester.core.tester2.graphcomparison.ComplexGraphComparer

  • org.cishell.framework.data.BasicData
  • org.cishell.framework.data.Data
  • org.cishell.testing.convertertester.algorithm.ConverterTesterAlgorithm$DataUpdater
  • org.cishell.testing.convertertester.commandline.Activator
  • org.cishell.testing.convertertester.core.converter.graph.Converter
  • org.cishell.testing.convertertester.core.converter.graph.ConverterGraph
  • org.cishell.testing.convertertester.core.converter.graph.ConverterPath
  • org.cishell.testing.convertertester.core.tester.graphcomparison.ComparisonResult
  • org.cishell.testing.convertertester.core.tester.graphcomparison.RunningLog
  • org.cishell.testing.convertertester.core.tester2.ConverterTester2
    • 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.