diff options
author | OszkarSemerath <semerath@mit.bme.hu> | 2023-08-08 20:18:12 +0200 |
---|---|---|
committer | OszkarSemerath <semerath@mit.bme.hu> | 2023-08-08 20:18:12 +0200 |
commit | eef4d3b16789e19c35be38e012d45540a226eca1 (patch) | |
tree | 2839f451f562a6e8dd0f299d2fd97cacd54ebd7b /subprojects/store | |
parent | SuppressWarnings for using deterministic random in hash code generation. (diff) | |
download | refinery-eef4d3b16789e19c35be38e012d45540a226eca1.tar.gz refinery-eef4d3b16789e19c35be38e012d45540a226eca1.tar.zst refinery-eef4d3b16789e19c35be38e012d45540a226eca1.zip |
Unused condition simplified.
Diffstat (limited to 'subprojects/store')
-rw-r--r-- | subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java b/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java index 2877bd0f..decff1d5 100644 --- a/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java +++ b/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java | |||
@@ -57,8 +57,7 @@ public class CombinationNodePairing implements NodePairing { | |||
57 | for (var permutation : previousPermutations) { | 57 | for (var permutation : previousPermutations) { |
58 | for (int pos = 0; pos <= max; pos++) { | 58 | for (int pos = 0; pos <= max; pos++) { |
59 | int[] newPermutation = new int[max + 1]; | 59 | int[] newPermutation = new int[max + 1]; |
60 | if (pos >= 0) | 60 | System.arraycopy(permutation, 0, newPermutation, 0, pos); |
61 | System.arraycopy(permutation, 0, newPermutation, 0, pos); | ||
62 | newPermutation[pos] = max; | 61 | newPermutation[pos] = max; |
63 | if (max - (pos + 1) >= 0) | 62 | if (max - (pos + 1) >= 0) |
64 | System.arraycopy(permutation, pos + 1, newPermutation, pos + 1 + 1, max - (pos + 1)); | 63 | System.arraycopy(permutation, pos + 1, newPermutation, pos + 1 + 1, max - (pos + 1)); |