From 0d8d37eb85eeab2d30fec9539447931c32616df2 Mon Sep 17 00:00:00 2001
From: Phoenix616 <max@themoep.de>
Date: Wed, 1 Mar 2023 17:54:31 +0100
Subject: [PATCH] Cleanup: Use 0-sized arrays and fix division

---
 src/main/java/com/Acrobot/Breeze/Utils/InventoryUtil.java | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/main/java/com/Acrobot/Breeze/Utils/InventoryUtil.java b/src/main/java/com/Acrobot/Breeze/Utils/InventoryUtil.java
index 99e35c5..113e718 100644
--- a/src/main/java/com/Acrobot/Breeze/Utils/InventoryUtil.java
+++ b/src/main/java/com/Acrobot/Breeze/Utils/InventoryUtil.java
@@ -351,7 +351,7 @@ public class InventoryUtil {
             itemList.add(item.clone());
         }
 
-        return itemList.toArray(new ItemStack[itemList.size()]);
+        return itemList.toArray(new ItemStack[0]);
     }
 
     /**
@@ -413,7 +413,7 @@ public class InventoryUtil {
                 stackedItems.add(item.clone());
                 continue;
             }
-            for (int i = 0; i < Math.floor(item.getAmount() / maxStackSize); i++) {
+            for (int i = 0; i < Math.floor((double) item.getAmount() / maxStackSize); i++) {
                 ItemStack itemClone = item.clone();
                 itemClone.setAmount(maxStackSize);
                 stackedItems.add(itemClone);
@@ -424,6 +424,6 @@ public class InventoryUtil {
                 stackedItems.add(rest);
             }
         }
-        return stackedItems.toArray(new ItemStack[stackedItems.size()]);
+        return stackedItems.toArray(new ItemStack[0]);
     }
 }