broken-arrow

Untitled

May 22nd, 2021
995
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.25 KB | None | 0 0
  1.     public boolean AddItemsToChest(int i, Location location, ItemStack itemStack, Inventory from) {
  2.         Inventory firstPage = getPage(0, location);
  3.         /*List<ItemStack> itemsList = Arrays.asList(itemStack);
  4.         Collections.shuffle(itemsList);
  5.         ItemStack[] contents = itemsList.toArray(new ItemStack[0]);*/
  6.         if (firstPage == null)
  7.             return false;
  8.  
  9.         int pageSize = firstPage.getSize();
  10.         int page = i / pageSize;
  11.         int slot = i % pageSize;
  12.         int pages = 0;
  13.         int inventorySize = 0;
  14.  
  15.         if (firstPage.firstEmpty() == -1 || firstPage.first(itemStack) == itemStack.getMaxStackSize())
  16.             for (ItemStack itemStack1 : firstPage) {
  17.                 inventorySize++;
  18.                 if (itemStack1 != null && itemStack1.getAmount() == itemStack1.getMaxStackSize() && inventorySize == pageSize)
  19.                     pages++;
  20.             }
  21.         System.out.println("pages " + pages);
  22.         Inventory actualPage = getPage(pages, location);
  23.         if (actualPage == null)
  24.             return false;
  25.         HashMap<Integer, ItemStack> leftOvers = actualPage.addItem(itemStack);
  26.         pages = 0;
  27.         if (getPageIndex >= (pages + 1)) {
  28.             for (ItemStack leftOver : leftOvers.values()) {
  29.                 from.addItem(leftOver);
  30.                 System.out.println("Items leftOver " + leftOver);
  31.                 if (itemStack.equals(leftOver))
  32.                     return false;
  33.  
  34.             }
  35.         }
  36.         return true;
  37.     }
  38.  
Advertisement
Add Comment
Please, Sign In to add comment