aboutsummaryrefslogtreecommitdiff
path: root/src/main/java/gregtech/api
diff options
context:
space:
mode:
authorRecursivePineapple <recursive_pineapple@proton.me>2024-10-15 16:20:27 -0400
committerGitHub <noreply@github.com>2024-10-15 22:20:27 +0200
commit1d894089d0d14efde4195afc967c9be9d3db97dd (patch)
treed42693ee50f960c01a5091fd8b02e1c19b54275a /src/main/java/gregtech/api
parentb7aaa0598761166b7c3e8ad6d347ca1d729d61b8 (diff)
downloadGT5-Unofficial-1d894089d0d14efde4195afc967c9be9d3db97dd.tar.gz
GT5-Unofficial-1d894089d0d14efde4195afc967c9be9d3db97dd.tar.bz2
GT5-Unofficial-1d894089d0d14efde4195afc967c9be9d3db97dd.zip
Improved & cleaned up wormhole generator (#3334)
Diffstat (limited to 'src/main/java/gregtech/api')
-rw-r--r--src/main/java/gregtech/api/enums/GTValues.java2
-rw-r--r--src/main/java/gregtech/api/util/GTUtility.java16
2 files changed, 18 insertions, 0 deletions
diff --git a/src/main/java/gregtech/api/enums/GTValues.java b/src/main/java/gregtech/api/enums/GTValues.java
index c91800933f..ad09c2b98a 100644
--- a/src/main/java/gregtech/api/enums/GTValues.java
+++ b/src/main/java/gregtech/api/enums/GTValues.java
@@ -683,6 +683,8 @@ public class GTValues {
+ EnumChatFormatting.BOLD
+ "APenguin";
+ public static final String AuthorPineapple = "Author: " + EnumChatFormatting.BLUE + "Recursive Pineapple";
+
// 7.5F comes from GT_Tool_Turbine_Large#getBaseDamage() given huge turbines are the most efficient now.
public static double getMaxPlasmaTurbineEfficiencyFromMaterial(Materials material) {
return (5F + (7.5F + material.mToolQuality)) / 10.0;
diff --git a/src/main/java/gregtech/api/util/GTUtility.java b/src/main/java/gregtech/api/util/GTUtility.java
index 1d75772803..83cd5ced7a 100644
--- a/src/main/java/gregtech/api/util/GTUtility.java
+++ b/src/main/java/gregtech/api/util/GTUtility.java
@@ -4516,6 +4516,22 @@ public class GTUtility {
return MathHelper.clamp_int(val, lo, hi);
}
+ public static long min(long first, long... rest) {
+ for (int i = 0; i < rest.length; i++) {
+ long l = rest[i];
+ if (l < first) first = l;
+ }
+ return first;
+ }
+
+ public static long max(long first, long... rest) {
+ for (int i = 0; i < rest.length; i++) {
+ long l = rest[i];
+ if (l > first) first = l;
+ }
+ return first;
+ }
+
public static int ceilDiv(int lhs, int rhs) {
return (lhs + rhs - 1) / rhs;
}