rename: VariationTree::root() -> VariationTree::getRoot()

for consistency

Author: pmbittner

src/main/java/org/variantsync/diffdetective/variation/diff/bad/BadVDiff.java

@@ -352,8 +352,8 @@ public EdgeToConstruct(
         final List<EdgeToConstruct<L>>               edgesToConstruct = new ArrayList<>();
         final Map<VariationTreeNode<L>, DiffNode<L>> nodeTranslation  = new HashMap<>();
 
-        final DiffNode<L> root = toGood(diff.root());
-        nodeTranslation.put(diff.root(), root);
+        final DiffNode<L> root = toGood(diff.getRoot());
+        nodeTranslation.put(diff.getRoot(), root);
 
         diff.forAllPreorder(vtnode -> {
             // If a node was already translated (because it was merged), it does not have to be translated anymore.
@@ -452,7 +452,7 @@ private void prettyPrint(final String indent, StringBuilder b, VariationTreeNode
 
     public String prettyPrint() {
         final StringBuilder b = new StringBuilder();
-        prettyPrint("", b, diff.root());
+        prettyPrint("", b, diff.getRoot());
         return b.toString();
     }
 

src/main/java/org/variantsync/diffdetective/variation/diff/construction/GumTreeDiff.java

@@ -43,8 +43,8 @@ public static <L extends Label> VariationDiff<L> diffUsingMatching(VariationTree
      */
     public static <L extends Label> VariationDiff<L> diffUsingMatching(VariationTree<L> before, VariationTree<L> after, Matcher matcher) {
         DiffNode<L> root = diffUsingMatching(
-            before.root(),
-            after.root(),
+            before.getRoot(),
+            after.getRoot(),
             matcher
         );
 

src/main/java/org/variantsync/diffdetective/variation/diff/view/DiffView.java

@@ -120,7 +120,7 @@ public static <L extends Label> VariationDiff<DiffLinesLabel> naive(final Variat
 
             // TODO: Avoid inversion by building the map in the correct way in the first place.
             final Map<VariationTreeNode<L>, Projection<L>> invCopyMemory = CollectionUtils.invert(copyMemory, HashMap::new);
-            TreeView.treeInline(treeView.root(), v -> inView.test(t, invCopyMemory.get(v)));
+            TreeView.treeInline(treeView.getRoot(), v -> inView.test(t, invCopyMemory.get(v)));
 
             projectionViewText[i] = treeView.unparse();
         }

src/main/java/org/variantsync/diffdetective/variation/tree/VariationTree.java

@@ -140,7 +140,7 @@ public static <T extends VariationNode<T, L>, L extends Label> VariationTree<L>
 
     public VariationDiff<L> toVariationDiff(final Function<VariationTreeNode<L>, DiffNode<L>> nodeConverter) {
         return new VariationDiff<>(
-                DiffNode.unchanged(nodeConverter, root()),
+                DiffNode.unchanged(nodeConverter, root),
                 new CompositeSource("VariationTree.toVariationDiff", source)
         );
     }
@@ -176,7 +176,7 @@ public VariationTree<L> forAllPostorder(final Consumer<VariationTreeNode<L>> act
      * @return True iff the given condition returns true for at least one node in this tree.
      */
     public boolean anyMatch(final Predicate<VariationTreeNode<L>> condition) {
-        return root().anyMatch(condition);
+        return root.anyMatch(condition);
     }
 
     /**
@@ -218,7 +218,7 @@ public VariationTree<L> deepCopy(final Map<VariationTreeNode<L>, VariationTreeNo
 
     public String unparse() {
         var result = new StringBuilder();
-        root().unparse(result);
+        root.unparse(result);
         return result.toString();
     }
 
@@ -233,7 +233,7 @@ public void assertConsistency() {
         forAllPreorder(VariationTreeNode::assertConsistency);
     }
 
-    public VariationTreeNode<L> root() {
+    public VariationTreeNode<L> getRoot() {
         return root;
     }
 

src/main/java/org/variantsync/diffdetective/variation/tree/view/TreeView.java

@@ -55,8 +55,8 @@ private TreeView() {}
      */
     public static <L extends Label> void treeInline(final VariationTree<L> t, final Relevance r) {
         final Set<VariationTreeNode<L>> interestingNodes = new HashSet<>();
-        r.computeViewNodes(t.root(), interestingNodes::add);
-        treeInline(t.root(), interestingNodes::contains);
+        r.computeViewNodes(t.getRoot(), interestingNodes::add);
+        treeInline(t.getRoot(), interestingNodes::contains);
         t.setSource(new ViewSource(t.getSource(), r, "view_tree"));
     }