mirror of
https://github.com/graphhopper/jsprit.git
synced 2020-01-24 07:45:05 +01:00
Merge pull request #390 from Jullil/unassigned_job_reason_tracker_returns_the_last_failed_constraint
UnassignedJobReasonTracker returns the last failed constraint
This commit is contained in:
commit
9144a05886
1 changed files with 2 additions and 1 deletions
|
|
@ -32,12 +32,13 @@ public class UnassignedJobReasonTracker implements JobUnassignedListener {
|
||||||
public static String getMostLikelyFailedConstraintName(Frequency failedConstraintNamesFrequency) {
|
public static String getMostLikelyFailedConstraintName(Frequency failedConstraintNamesFrequency) {
|
||||||
if (failedConstraintNamesFrequency == null) return "no reason found";
|
if (failedConstraintNamesFrequency == null) return "no reason found";
|
||||||
Iterator<Map.Entry<Comparable<?>, Long>> entryIterator = failedConstraintNamesFrequency.entrySetIterator();
|
Iterator<Map.Entry<Comparable<?>, Long>> entryIterator = failedConstraintNamesFrequency.entrySetIterator();
|
||||||
int maxCount = 0;
|
long maxCount = 0;
|
||||||
String mostLikely = null;
|
String mostLikely = null;
|
||||||
while (entryIterator.hasNext()) {
|
while (entryIterator.hasNext()) {
|
||||||
Map.Entry<Comparable<?>, Long> entry = entryIterator.next();
|
Map.Entry<Comparable<?>, Long> entry = entryIterator.next();
|
||||||
if (entry.getValue() > maxCount) {
|
if (entry.getValue() > maxCount) {
|
||||||
Comparable<?> key = entry.getKey();
|
Comparable<?> key = entry.getKey();
|
||||||
|
maxCount = entry.getValue();
|
||||||
mostLikely = key.toString();
|
mostLikely = key.toString();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue