memoizeit

fixed descending order for ranking

6/28/2020 8:11:54 AM

Details

diff --git a/src/main/java/br/ufrgs/inf/prosoft/memoizeit/MemoizeIt.java b/src/main/java/br/ufrgs/inf/prosoft/memoizeit/MemoizeIt.java
index c311e1a..60da686 100644
--- a/src/main/java/br/ufrgs/inf/prosoft/memoizeit/MemoizeIt.java
+++ b/src/main/java/br/ufrgs/inf/prosoft/memoizeit/MemoizeIt.java
@@ -256,7 +256,7 @@ public class MemoizeIt {
                         cluster -> cluster.stream().map(method -> method.getSavedTime()).max(Double::compare).get()));
 
         Collections.sort(clusters, (cluster1, cluster2)
-                -> (Double.compare(clusterHasSavedTime.get(cluster1), clusterHasSavedTime.get(cluster2))));
+                -> (Double.compare(clusterHasSavedTime.get(cluster2), clusterHasSavedTime.get(cluster1))));
     }
 
 //    3.3 clustering and ranking
@@ -272,6 +272,7 @@ public class MemoizeIt {
             System.out.println("Cluster#" + i);
             cluster.forEach(method -> {
                 System.out.println("\t" + method.getName());
+                System.out.println("\tOccurrences " + method.getOccurrencesSize() + "(" + method.getDistinctOccurrencesSize() + ") Representativeness " + method.getRepresentativeness() + " ExecutionTime " + method.getTotalExecutionTime() + "(" + method.getAverageExecutionTime() + ") PotentialHitRatio " + method.getPotentialHitRatio() + " SavedTime " + method.getSavedTime());
                 suggestImplementation(method);
             });
         }