Skip to content
Snippets Groups Projects
Verified Commit c8f5e882 authored by David Procházka's avatar David Procházka
Browse files

FIX: updated constructor arguments

parent a1afa79d
No related branches found
No related tags found
No related merge requests found
......@@ -5,7 +5,6 @@ import messif.objects.LocalAbstractObject;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Set;
public class Histogram {
private final HashMap<Integer, HashMap<Long, Integer>> levelToHullsCoveredToObjectCount = new HashMap<>();
......@@ -17,7 +16,7 @@ public class Histogram {
Histogram histogram = new Histogram();
for (int level = 1; level <= x.getHeight() + 1; level++) {
Set<Node> levelNodes = x.getNodesOnLevel(level);
List<Node> levelNodes = x.getNodesOnLevel(level);
for (LocalAbstractObject object : x.getObjects()) {
long coveredObjectCount = levelNodes.stream()
......
......@@ -35,11 +35,11 @@ public class MHTree extends Algorithm implements Serializable {
@AlgorithmConstructor(description = "MH-Tree", arguments = {
"list of objects",
"number of objects in leaf node",
"number of objects in a leaf node",
"arity",
"number of threads used in precomputing distances",
"insert type",
"distance measure",
"object to node distance type",
"node to node distance type",
"storage class for buckets",
"storage class parameters"
})
......@@ -130,7 +130,7 @@ public class MHTree extends Algorithm implements Serializable {
System.out.println("Number of hull objects in each level:");
for (int level = 1; level <= root.getHeight() + 1; level++) {
Set<Node> levelNodes = root.getNodesOnLevel(level);
List<Node> levelNodes = root.getNodesOnLevel(level);
System.out.println("- Level " + level + " -> " + levelNodes.stream().mapToInt(n -> n.getHullObjects().size()).summaryStatistics());
}
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment