lineage2/l2j_mobius
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Define minimum positive numbers close to zero.

Browse Source
This commit is contained in:
MobiusDevelopment
2021-10-15 23:31:27 +00:00
parent 5e58c7bd7a
commit 30b212ad79
24 changed files with 168 additions and 72 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
L2J_Mobius_7.0_PreludeOfWar/java/org/l2jmobius/commons/util/Rnd.java
View File

@@ -23,6 +23,10 @@ import java.util.concurrent.ThreadLocalRandom;
*/
public class Rnd
{
private static final int MINIMUM_POSITIVE_INT = 1;
private static final long MINIMUM_POSITIVE_LONG = 1L;
private static final double MINIMUM_POSITIVE_DOUBLE = Double.longBitsToDouble(0x1L);
/**
* @return a random boolean value.
*/
@@ -56,7 +60,7 @@ public class Rnd
*/
public static int get(int origin, int bound)
{
return ThreadLocalRandom.current().nextInt(origin, bound == Integer.MAX_VALUE ? bound : bound + 1);
return ThreadLocalRandom.current().nextInt(origin, bound == Integer.MAX_VALUE ? bound : bound + MINIMUM_POSITIVE_INT);
}
/**
@@ -83,7 +87,7 @@ public class Rnd
*/
public static long get(long origin, long bound)
{
return ThreadLocalRandom.current().nextLong(origin, bound == Long.MAX_VALUE ? bound : bound + 1L);
return ThreadLocalRandom.current().nextLong(origin, bound == Long.MAX_VALUE ? bound : bound + MINIMUM_POSITIVE_LONG);
}
/**
@@ -110,7 +114,7 @@ public class Rnd
*/
public static double get(double origin, double bound)
{
return ThreadLocalRandom.current().nextDouble(origin, bound == Double.MAX_VALUE ? bound : bound + 0.000000000000001d);
return ThreadLocalRandom.current().nextDouble(origin, bound == Double.MAX_VALUE ? bound : bound + MINIMUM_POSITIVE_DOUBLE);
}
/**