From f4e8f79e16ab88e89550cee23ac94cbfa7880ad4 Mon Sep 17 00:00:00 2001 From: Dennis Hendriks Date: Fri, 23 Feb 2024 18:32:52 +0100 Subject: [PATCH] Fix typo in a comment. --- .../src/nl/tno/mids/compare/compute/CompleteLattice.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/plugins/nl.tno.mids.compare/src/nl/tno/mids/compare/compute/CompleteLattice.java b/plugins/nl.tno.mids.compare/src/nl/tno/mids/compare/compute/CompleteLattice.java index 07497fd..ab98242 100644 --- a/plugins/nl.tno.mids.compare/src/nl/tno/mids/compare/compute/CompleteLattice.java +++ b/plugins/nl.tno.mids.compare/src/nl/tno/mids/compare/compute/CompleteLattice.java @@ -110,7 +110,7 @@ private void computeCombinedLattice(List>> lattice, // themselves, as that would result in the node itself, given the idempotent property of the combine // function, which also reduces the number of required computations. To exploit these properties, we combine // the current node only with nodes with a higher index. - // - If two nodes are already related (one is an ancestor or descendent of the other), the combined variant + // - If two nodes are already related (one is an ancestor or descendant of the other), the combined variant // will be equal to one of the two nodes being combined, which are already in the lattice and are already // related to each other. We can thus forgo combining such nodes, further improving performance. Set>> others = inputNodes.stream()