Package statechum.analysis.learning.experiments.PairSelection.MarkovPassivePairSelection

Examples of statechum.analysis.learning.experiments.PairSelection.MarkovPassivePairSelection.PairScoreWithDistance

180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
           return outcome;
       }
      
       public static Stack<PairScoreWithDistance> getChoicesother_distance(ArrayList<PairScoreWithDistance> possibleResults)
       {
         PairScoreWithDistance bestPair=null;
       for(PairScoreWithDistance P:possibleResults)
       {       
        if(bestPair == null || P.getDistanceScore() > bestPair.getDistanceScore())
          bestPair=P;
       }
           Stack<PairScoreWithDistance> outcome = new Stack<PairScoreWithDistance>();
           PairScoreWithDistance top = bestPair;
           outcome.add(top);
           int i=possibleResults.size()-2;
           while(i>=0)
           {
             PairScoreWithDistance curr = possibleResults.get(i);--i;
                 if (curr.getDistanceScore() == top.getDistanceScore() && !outcome.contains(curr))
                   outcome.add(curr);
           }
           return outcome;
       }
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
       }
      
       public static PairScore ordercountChoices(Stack<PairScoreWithDistance> stack)
       {
         ArrayList<PairScoreWithDistance> toptop = new ArrayList<PairScoreWithDistance>();
         PairScoreWithDistance top = stack.peek();        
           int i=stack.size()-1;
           while(i>=0)
           {
             PairScoreWithDistance curr = stack.get(i);--i;
                 if (curr.getScore() != top.getScore())
               break; 
               toptop.add(curr);                      
           }
           PairScoreWithDistance high_pair = top;
           for(PairScoreWithDistance t:toptop)
           {
            if(t!=top)
            {
              System.out.println("Distance Score of high= "+high_pair.getDistanceScore());
              System.out.println("Distance Score of t= "+t.getDistanceScore());
          if( t.getDistanceScore() > high_pair.getDistanceScore())
            high_pair=t;
            }
           }
           return high_pair;
       }
View Full Code Here
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
       }
      
       public static PairScoreWithDistance ordercountChoices_improved(Stack<PairScoreWithDistance> stack)
       {
         Stack<PairScoreWithDistance> toptop = new Stack<PairScoreWithDistance>();
         PairScoreWithDistance top = stack.peek();        
           int i=stack.size()-1;
           while(i>=0)
           {
             PairScoreWithDistance curr = stack.get(i);--i;
                 if (curr.getScore() != top.getScore())
               break; 
               toptop.add(curr);                      
           }
           PairScoreWithDistance high_pair = top;
           for(PairScoreWithDistance t:toptop)
           {
            if(t!=top)
            {
               if(t.getDistanceScore() > high_pair.getDistanceScore())
                 high_pair=t;
            }
           }
                    
           return high_pair;
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
           return outcome;
       }
      
       public static Stack<PairScoreWithDistance> getChoicesother_distance(ArrayList<PairScoreWithDistance> possibleResults)
       {
         PairScoreWithDistance bestPair=null;
       for(PairScoreWithDistance P:possibleResults)
       {       
        if(bestPair == null || P.getDistanceScore() > bestPair.getDistanceScore())
          bestPair=P;
       }
           Stack<PairScoreWithDistance> outcome = new Stack<PairScoreWithDistance>();
           PairScoreWithDistance top = bestPair;
           outcome.add(top);
           int i=possibleResults.size()-2;
           while(i>=0)
           {
             PairScoreWithDistance curr = possibleResults.get(i);--i;
                 if (curr.getDistanceScore() == top.getDistanceScore() && !outcome.contains(curr))
                   outcome.add(curr);
           }
           return outcome;
       }
View Full Code Here
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
       }
      
       public static PairScore ordercountChoices(Stack<PairScoreWithDistance> stack)
       {
         ArrayList<PairScoreWithDistance> toptop = new ArrayList<PairScoreWithDistance>();
         PairScoreWithDistance top = stack.peek();        
           int i=stack.size()-1;
           while(i>=0)
           {
             PairScoreWithDistance curr = stack.get(i);--i;
                 if (curr.getScore() != top.getScore())
               break; 
               toptop.add(curr);                      
           }
           PairScoreWithDistance high_pair = top;
           for(PairScoreWithDistance t:toptop)
           {
            if(t!=top)
            {
              System.out.println("Distance Score of high= "+high_pair.getDistanceScore());
              System.out.println("Distance Score of t= "+t.getDistanceScore());
          if( t.getDistanceScore() > high_pair.getDistanceScore())
            high_pair=t;
            }
           }
           return high_pair;
       }
View Full Code Here
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
       }
      
       public static PairScoreWithDistance ordercountChoices_improved(Stack<PairScoreWithDistance> stack)
       {
         Stack<PairScoreWithDistance> toptop = new Stack<PairScoreWithDistance>();
         PairScoreWithDistance top = stack.peek();        
           int i=stack.size()-1;
           while(i>=0)
           {
             PairScoreWithDistance curr = stack.get(i);--i;
                 if (curr.getScore() != top.getScore())
               break; 
               toptop.add(curr);                      
           }
           PairScoreWithDistance high_pair = top;
           for(PairScoreWithDistance t:toptop)
           {
            if(t!=top)
            {
               if(t.getDistanceScore() > high_pair.getDistanceScore())
                 high_pair=t;
            }
           }
                    
           return high_pair;
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
           return outcome;
       }
      
       public static Stack<PairScoreWithDistance> getChoicesother_distance(ArrayList<PairScoreWithDistance> possibleResults)
       {
         PairScoreWithDistance bestPair=null;
       for(PairScoreWithDistance P:possibleResults)
       {       
        if(bestPair == null || P.getDistanceScore() > bestPair.getDistanceScore())
          bestPair=P;
       }
           Stack<PairScoreWithDistance> outcome = new Stack<PairScoreWithDistance>();
           PairScoreWithDistance top = bestPair;
           outcome.add(top);
           int i=possibleResults.size()-2;
           while(i>=0)
           {
             PairScoreWithDistance curr = possibleResults.get(i);--i;
                 if (curr.getDistanceScore() == top.getDistanceScore() && !outcome.contains(curr))
                   outcome.add(curr);
           }
           return outcome;
       }
View Full Code Here
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
       }
      
       public static PairScore ordercountChoices(Stack<PairScoreWithDistance> stack)
       {
         ArrayList<PairScoreWithDistance> toptop = new ArrayList<PairScoreWithDistance>();
         PairScoreWithDistance top = stack.peek();        
           int i=stack.size()-1;
           while(i>=0)
           {
             PairScoreWithDistance curr = stack.get(i);--i;
                 if (curr.getScore() != top.getScore())
               break; 
               toptop.add(curr);                      
           }
           PairScoreWithDistance high_pair = top;
           for(PairScoreWithDistance t:toptop)
           {
            if(t!=top)
            {
              System.out.println("Distance Score of high= "+high_pair.getDistanceScore());
              System.out.println("Distance Score of t= "+t.getDistanceScore());
          if( t.getDistanceScore() > high_pair.getDistanceScore())
            high_pair=t;
            }
           }
           return high_pair;
       }
View Full Code Here
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
       }
      
       public static PairScoreWithDistance ordercountChoices_improved(Stack<PairScoreWithDistance> stack)
       {
         Stack<PairScoreWithDistance> toptop = new Stack<PairScoreWithDistance>();
         PairScoreWithDistance top = stack.peek();        
           int i=stack.size()-1;
           while(i>=0)
           {
             PairScoreWithDistance curr = stack.get(i);--i;
                 if (curr.getScore() != top.getScore())
               break; 
               toptop.add(curr);                      
           }
           PairScoreWithDistance high_pair = top;
           for(PairScoreWithDistance t:toptop)
           {
            if(t!=top)
            {
               if(t.getDistanceScore() > high_pair.getDistanceScore())
                 high_pair=t;
            }
           }
                    
           return high_pair;
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
           return outcome;
       }
      
       public static Stack<PairScoreWithDistance> getChoicesother_distance(ArrayList<PairScoreWithDistance> possibleResults)
       {
         PairScoreWithDistance bestPair=null;
       for(PairScoreWithDistance P:possibleResults)
       {       
        if(bestPair == null || P.getDistanceScore() > bestPair.getDistanceScore())
          bestPair=P;
       }
           Stack<PairScoreWithDistance> outcome = new Stack<PairScoreWithDistance>();
           PairScoreWithDistance top = bestPair;
           outcome.add(top);
           int i=possibleResults.size()-2;
           while(i>=0)
           {
             PairScoreWithDistance curr = possibleResults.get(i);--i;
                 if (curr.getDistanceScore() == top.getDistanceScore() && !outcome.contains(curr))
                   outcome.add(curr);
           }
           return outcome;
       }
View Full Code Here
TOP

Related Classes of statechum.analysis.learning.experiments.PairSelection.MarkovPassivePairSelection.PairScoreWithDistance

  • statechum.analysis.learning.experiments.PairSelection.MarkovScoreComputation
    • 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.