iSharkFly-Docs/java-tutorials
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

N to NUMBER_OF_CHECKS

Browse Source
This commit is contained in:
@hangga 2023-11-02 11:25:19 +07:00
parent 8f1a091a43
commit 69d17b634d
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
core-java-modules/core-java-uuid/src/test/java/com/baeldung/uuid/UUIDPositiveLongGeneratorUnitTest.java
View File

@ -12,7 +12,7 @@ import java.util.Set;
import static org.assertj.core.api.Assertions.assertThat; import static org.assertj.core.api.Assertions.assertThat;
public class UUIDPositiveLongGeneratorUnitTest { public class UUIDPositiveLongGeneratorUnitTest {
private final static int N = 1000000; private final static int NUMBER_OF_CHECKS = 1000000;
private final static double COLLISION_THRESHOLD = 0.001; private final static double COLLISION_THRESHOLD = 0.001;
private final UUIDPositiveLongGenerator uuidLongGenerator = new UUIDPositiveLongGenerator(); private final UUIDPositiveLongGenerator uuidLongGenerator = new UUIDPositiveLongGenerator();
private final Logger logger = LoggerFactory.getLogger(UUIDPositiveLongGeneratorUnitTest.class); private final Logger logger = LoggerFactory.getLogger(UUIDPositiveLongGeneratorUnitTest.class);
@ -40,14 +40,14 @@ public class UUIDPositiveLongGeneratorUnitTest {
private void collisionCheck(Method method) throws Exception { private void collisionCheck(Method method) throws Exception {
Set<Long> uniqueValues = new HashSet<>(); Set<Long> uniqueValues = new HashSet<>();
int collisions = 0; int collisions = 0;
for (int i = 0; i < N; i++) { for (int i = 0; i < NUMBER_OF_CHECKS; i++) {
long uniqueValue = (long) method.invoke(uuidLongGenerator); long uniqueValue = (long) method.invoke(uuidLongGenerator);
assertThat(uniqueValue).isPositive(); assertThat(uniqueValue).isPositive();
if (!uniqueValues.add(uniqueValue)) { if (!uniqueValues.add(uniqueValue)) {
collisions++; collisions++;
} }
} }
double collisionsProbability = (double) collisions / N; double collisionsProbability = (double) collisions / NUMBER_OF_CHECKS;
printOutput(method.getName(), collisions, collisionsProbability); printOutput(method.getName(), collisions, collisionsProbability);
assertThat(collisionsProbability).isLessThan(COLLISION_THRESHOLD); assertThat(collisionsProbability).isLessThan(COLLISION_THRESHOLD);
} }