private ArrayList<Result> accumulateResults(ArrayList<RaceRun> runs) {
Result res;
results = new ArrayList<Result>();
for (RaceRun r : runs) {
res = findRacer(r);
if (res == null) {
res = new Result();
results.add(res);
}
res.setRacer(r.getBoat().getRacer());
res.setBoat(r.getBoat());
switch (r.getRunNumber()) {
case 1:
res.setRun1(r);
break;
case 2:
res.setRun2(r);
break;
}
}
float run1Time;
float run2Time;
for (Result res1 : results) {
// run1Time = (float)999999.99;
// run2Time = (float)999999.99;
try {
if (res1.getRun1() == null || res1.getRun2() == null) {
if (res1.getRun1() == null) {
res1.setBestRun(res1.getRun2());
}
if (res1.getRun2() == null) {
res1.setBestRun(res1.getRun1());
}
} else {
run1Time = res1.getRun1().getElapsed() + res1.getRun1().getTotalPenalties();
run2Time = res1.getRun2().getElapsed() + res1.getRun2().getTotalPenalties();
if (run1Time <= run2Time) {
res1.setBestRun(res1.getRun1());
} else {
res1.setBestRun(res1.getRun2());
}
}
} catch (Exception e) {
log.write(e);
}
}
ArrayList<Result> sorted = Result.getResultsByClassTime(results);
results = sorted; // A10112013
String lastBoatClass = "";
int place = 1;
for (Result r : sorted) {
try {
r.getRun1()
.setGold(false); // / TODO: if skipping 1st runs fro some reason, this will cause a null
// pointer reference
r.getRun1().setSilver(false);
r.getRun1().setBronze(false);
} catch (NullPointerException e) {
// Intentionally empty exception block
}
try {
r.getRun2().setGold(false);
r.getRun2().setSilver(false);
r.getRun2().setBronze(false);
} catch (NullPointerException e) {
// Intentionally empty exception block
}
// todo check this logic 20141122
try {
if (lastBoatClass.compareTo(r.getBoat().getBoatClass()) != 0) {
lastBoatClass = r.getBoat().getBoatClass();
place = 1;
}
switch (place) {
case 1:
r.getBestRun().setGold(true);
break;
case 2:
r.getBestRun().setSilver(true);
break;
case 3:
r.getBestRun().setBronze(true);
break;
default:
break;
}
} catch (NullPointerException e) {
// Intentionally empty exception block
}
r.getBestRun().setPlaceInClass(place++);
}
return (sorted);
}
