Skip to content

Commit

Permalink
remove unused parameter from UBTree#getAllNodesContainingElementsLess…
Browse files Browse the repository at this point in the history
…Than
  • Loading branch information
rouven-walter committed Aug 29, 2023
1 parent 068d647 commit 2399dc7
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions src/main/java/org/logicng/datastructures/ubtrees/UBTree.java
Original file line number Diff line number Diff line change
Expand Up @@ -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);
}
Expand Down Expand Up @@ -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) {
Expand Down

0 comments on commit 2399dc7

Please sign in to comment.