From 2399dc798abda0528582d179dbfbb131b8e57c68 Mon Sep 17 00:00:00 2001
From: Rouven Walter <rouven.walter@booleworks.com>
Date: Tue, 29 Aug 2023 23:01:27 +0200
Subject: [PATCH] remove unused parameter from
 UBTree#getAllNodesContainingElementsLessThan

---
 src/main/java/org/logicng/datastructures/ubtrees/UBTree.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/main/java/org/logicng/datastructures/ubtrees/UBTree.java b/src/main/java/org/logicng/datastructures/ubtrees/UBTree.java
index ecb761a4..a65edadf 100644
--- a/src/main/java/org/logicng/datastructures/ubtrees/UBTree.java
+++ b/src/main/java/org/logicng/datastructures/ubtrees/UBTree.java
@@ -185,7 +185,7 @@ private void allSubsets(final SortedSet<T> set, final SortedMap<T, UBNode<T>> fo
     }
 
     private void allSupersets(final SortedSet<T> set, final SortedMap<T, UBNode<T>> forest, final Set<SortedSet<T>> supersets) {
-        final Set<UBNode<T>> nodes = getAllNodesContainingElementsLessThan(set, forest, set.first());
+        final Set<UBNode<T>> nodes = getAllNodesContainingElementsLessThan(forest, set.first());
         for (final UBNode<T> node : nodes) {
             allSupersets(set, node.children(), supersets);
         }
@@ -219,7 +219,7 @@ private Set<UBNode<T>> getAllNodesContainingElements(final SortedSet<T> set, fin
         return nodes;
     }
 
-    private Set<UBNode<T>> getAllNodesContainingElementsLessThan(final SortedSet<T> set, final SortedMap<T, UBNode<T>> forest, final T element) {
+    private Set<UBNode<T>> getAllNodesContainingElementsLessThan(final SortedMap<T, UBNode<T>> forest, final T element) {
         final Set<UBNode<T>> nodes = new LinkedHashSet<>();
         for (final UBNode<T> node : forest.values()) {
             if (node != null && node.element().compareTo(element) < 0) {