From f647884184e7f686870979cf7259cc0587177c08 Mon Sep 17 00:00:00 2001
From: oblonski <jsprit.vehicle.routing@gmail.com>
Date: Thu, 29 Jun 2017 09:58:38 +0200
Subject: [PATCH] make getMostLikely a static method

---
 .../core/util/UnassignedJobReasonTracker.java | 30 +++++++++----------
 1 file changed, 15 insertions(+), 15 deletions(-)

diff --git a/jsprit-core/src/main/java/com/graphhopper/jsprit/core/util/UnassignedJobReasonTracker.java b/jsprit-core/src/main/java/com/graphhopper/jsprit/core/util/UnassignedJobReasonTracker.java
index 0a999953..65ce40fb 100644
--- a/jsprit-core/src/main/java/com/graphhopper/jsprit/core/util/UnassignedJobReasonTracker.java
+++ b/jsprit-core/src/main/java/com/graphhopper/jsprit/core/util/UnassignedJobReasonTracker.java
@@ -29,6 +29,21 @@ import java.util.*;
  */
 public class UnassignedJobReasonTracker implements JobUnassignedListener {
 
+    public static String getMostLikely(Frequency reasons) {
+        if (reasons == null) return "no reason found";
+        Iterator<Map.Entry<Comparable<?>, Long>> entryIterator = reasons.entrySetIterator();
+        int maxCount = 0;
+        String mostLikely = null;
+        while (entryIterator.hasNext()) {
+            Map.Entry<Comparable<?>, Long> entry = entryIterator.next();
+            if (entry.getValue() > maxCount) {
+                Comparable<?> key = entry.getKey();
+                mostLikely = key.toString();
+            }
+        }
+        return mostLikely;
+    }
+
     Map<String, Frequency> reasons = new HashMap<>();
 
     Map<Integer, String> codesToReason = new HashMap<>();
@@ -141,20 +156,5 @@ public class UnassignedJobReasonTracker implements JobUnassignedListener {
         else return -1;
     }
 
-    private String getMostLikely(Frequency reasons) {
-        if (reasons == null) return "no reason found";
-        Iterator<Map.Entry<Comparable<?>, Long>> entryIterator = reasons.entrySetIterator();
-        int maxCount = 0;
-        String mostLikely = null;
-        while (entryIterator.hasNext()) {
-            Map.Entry<Comparable<?>, Long> entry = entryIterator.next();
-            if (entry.getValue() > maxCount) {
-                Comparable<?> key = entry.getKey();
-                mostLikely = key.toString();
-            }
-        }
-        return mostLikely;
-    }
-
 
 }