Jump to content

[SOLVED]tiny problem


ralphyrafa

Recommended Posts

have a container which is like a chest but with a bit more inventory space when i save all the items in the chest the stay in them when reseting the game but the only problem is that 3 slots wont save anyone might know the reason

I like helping people because i was also in a same problem and i do not like unfinished work, so a thank you will be enough for the people im helping and a thank you to the people that helped me :)

Link to comment
Share on other sites

here is the container

package medieval.medievalitems.containers;

import medieval.medievalblocks.blocks.barrel.Barrel_Tile;
import net.minecraft.entity.player.EntityPlayer;
import net.minecraft.entity.player.EntityPlayerMP;
import net.minecraft.entity.player.InventoryPlayer;
import net.minecraft.inventory.Container;
import net.minecraft.inventory.IInventory;
import net.minecraft.inventory.Slot;
import net.minecraft.item.ItemStack;
import net.minecraft.world.World;

public class Barrel_Container extends Container
{
private IInventory bottombarrel;
private int numOfRows;



public Barrel_Container(EntityPlayer player, World world, int x, int y, int z)

{
Barrel_Tile bartile = (Barrel_Tile) world.getBlockTileEntity(x, y, z);

this.bottombarrel = bartile;
this.numOfRows = bartile.getSizeInventory() / 11;

bartile.openChest();

int i = (this.numOfRows - 4) *18;
int j;
int k;
int l = 6;
int m;
int n = 7;
int o;
int p;
int q;

//Chest inv middle
for(j = 0;  j < this.numOfRows; j++)
{
   for (k = 0; k < 7; k++)
   {
   this.addSlotToContainer(new Slot(bartile, k + j * 18, 44 + k * 18 - 8, 18 + j *18 + 41));
   }
}
//chest inv down
   for (m = 0; m < 5; m++)
   {
   this.addSlotToContainer(new Slot(bartile, m + l * 18, 44 + m * 18 + 10, 18 + l *18 + 23));
   }
//Chest invup
   for (o = 0; o < 5; o++)
   {
   this.addSlotToContainer(new Slot(bartile, o + n * 18, 44 + o * 18 + 10, 18 +n *18 - 103));
   }



   //Player inv
   for(j = 0;  j < 3; j++)
   {
      for (k = 0; k < 9; k++)
      {
   	   this.addSlotToContainer(new Slot(player.inventory , k + j * 9 + 9, 8 + k * 18 + 10, 108 + j *18 + i + 58));
      }
}
   
   
   //Player itembar
   for(j = 0;  j < 9; j++)
   {
     
   	   this.addSlotToContainer(new Slot(player.inventory , j, 8 + j * 18 + 10, 161 + i + 63));
   }
}


public boolean canInteractWith(EntityPlayer entityplayer) 
{
	return this.bottombarrel.isUseableByPlayer(entityplayer);
}

public ItemStack transferStackInSlot(EntityPlayer player, int index)
{
	ItemStack stack = null;
	Slot slot = (Slot) this.inventorySlots.get(index);
	if(slot!=null&&slot.getHasStack())
	{
		ItemStack slotstack = slot.getStack();
		stack = slotstack.copy();
		if(index<45)
		{
			if(!this.mergeItemStack(slotstack,45,this.inventorySlots.size(),true)) return null;
		}
		else if(!this.getSlot(0).isItemValid(slotstack)||!this.mergeItemStack(slotstack,0,45,true)) return null;
		if(slotstack.stackSize==0)
		{
			slot.putStack((ItemStack) null);
		}
		else
		{
			slot.onSlotChanged();
		}
		if(slotstack.stackSize==stack.stackSize) return null;
		slot.onPickupFromSlot(player,slotstack);
	}
	return stack;
}

@Override
public boolean mergeItemStack(ItemStack stack, int start, int end, boolean reverse){
	return super.mergeItemStack(stack,start,end,reverse);
}

/**
 * Does the same as mergeItemStack with the same args, except does not
 * actually merge— just returns the number of items that can be merged
 * (usually either stack.stackSize or 0, but can be in between)
 * @param stack
 * @param start
 * @param end
 * @param reverse
 * @return
 */
int dryMerge(ItemStack stack, int start, int end, boolean reverse)
{
	boolean flag1 = false;
	int i = start;
	if(reverse)
	{
		i = end-1;
	}
	int quantity = stack.stackSize;
	Slot slot;
	ItemStack slotstack;
	if(stack.isStackable())
	{
		while(stack.stackSize>0&&(!reverse&&i<end||reverse&&i>=start))
		{
			slot = this.getSlot(i);
			slotstack = slot.getStack();
			if(slotstack!=null&&slotstack.itemID==stack.itemID&&(!stack.getHasSubtypes()||stack.getItemDamage()==slotstack.getItemDamage())&&ItemStack.areItemStackTagsEqual(stack,slotstack))
			{
				int l = slotstack.stackSize+stack.stackSize;
				if(l<=stack.getMaxStackSize())
				{
					quantity -= slotstack.stackSize;
				}else if(slotstack.stackSize<stack.getMaxStackSize())
				{
					quantity -= (stack.getMaxStackSize() - slotstack.stackSize);
				}
			}
			if(reverse) --i;
			else ++i;
		}
	}
	if(stack.stackSize>0){
		if(reverse){
			i = end-1;
		}else{
			i = start;
		}
		while(!reverse&&i<end||reverse&&i>=start){
			slot = (Slot) this.inventorySlots.get(i);
			slotstack = slot.getStack();
			if(slotstack==null){
				quantity = 0;
				break;
			}
			if(reverse){
				--i;
			}else{
				++i;
			}
		}
	}
	return stack.stackSize-quantity;
}
}

 

here is the tile

package medieval.medievalblocks.blocks.barrel;

import net.minecraft.entity.player.EntityPlayer;
import net.minecraft.inventory.ISidedInventory;
import net.minecraft.item.ItemStack;
import net.minecraft.nbt.NBTTagCompound;
import net.minecraft.nbt.NBTTagList;
import net.minecraft.tileentity.TileEntity;

public final class Barrel_Tile extends TileEntity implements ISidedInventory
{

private ItemStack[] inventoryitems = new ItemStack[2240];
private String localizedName;
public int playersCurrentlyUsingChest;
private String stuffname;


public int getSizeInventory() 
{
	return 65;
}

 public ItemStack getStackInSlot(int slot) {
         return inventoryitems[slot];
}

@Override
public void setInventorySlotContents(int slot, ItemStack stack) {
         inventoryitems[slot] = stack;
         if (stack != null && stack.stackSize > getInventoryStackLimit()) {
                 stack.stackSize = getInventoryStackLimit();
         }               
}

@Override
public ItemStack decrStackSize(int slot, int amt) {
         ItemStack stack = getStackInSlot(slot);
         if (stack != null) {
                 if (stack.stackSize <= amt) {
                         setInventorySlotContents(slot, null);
                 } else {
                         stack = stack.splitStack(amt);
                         if (stack.stackSize == 0) {
                                 setInventorySlotContents(slot, null);
                         }
                 }
         }
         return stack;
}

@Override
public ItemStack getStackInSlotOnClosing(int slot) {
         ItemStack stack = getStackInSlot(slot);
         if (stack != null) {
                 setInventorySlotContents(slot, null);
         }
         return stack;
}


@Override
public boolean isUseableByPlayer(EntityPlayer player) {
         return worldObj.getBlockTileEntity(xCoord, yCoord, zCoord) == this &&
         player.getDistanceSq(xCoord + 0.5, yCoord + 0.5, zCoord + 0.5) < 64;
}

@Override
public void readFromNBT(NBTTagCompound tagCompound) {
         super.readFromNBT(tagCompound);
         
         NBTTagList tagList = tagCompound.getTagList("Inventory");
         for (int i = 0; i < tagList.tagCount(); i++) {
                 NBTTagCompound tag = (NBTTagCompound) tagList.tagAt(i);
                 byte slot = tag.getByte("Slot");
                 if (slot >= 0 && slot < inventoryitems.length) {
                         inventoryitems[slot] = ItemStack.loadItemStackFromNBT(tag);
                 }
         }
}

@Override
public void writeToNBT(NBTTagCompound tagCompound) {
         super.writeToNBT(tagCompound);
                         
         NBTTagList itemList = new NBTTagList();
         for (int i = 0; i < inventoryitems.length; i++) {
                 ItemStack stack = inventoryitems[i];
                 if (stack != null) {
                         NBTTagCompound tag = new NBTTagCompound();
                         tag.setByte("Slot", (byte) i);
                         stack.writeToNBT(tag);
                         itemList.appendTag(tag);
                 }
         }
         tagCompound.setTag("Inventory", itemList);
}


public String getInvName() {
	return this.isInvNameLocalized() ? this.localizedName : "medieval.container.barrel";
}


public boolean isInvNameLocalized() {
	return this.localizedName != null && this.localizedName.length() > 0;
}

/**
 * Setting the localizedName Variable
 * @param localizedName
 */
public void func_94043_a(String par1Str)
{
this.localizedName = par1Str;
}


public int getInventoryStackLimit() 
{
	return 64;
}


@Override
public void openChest() {
//TODO

}

@Override
public void closeChest() {
	// TODO Auto-generated method stub

}


public boolean isItemValidForSlot(int i, ItemStack itemstack) 
{
	return true;
}

@Override
public int[] getAccessibleSlotsFromSide(int var1) {
	// TODO Auto-generated method stub
	return null;
}


public boolean canInsertItem(int i, ItemStack itemstack, int j) {
	return true;
}


public boolean canExtractItem(int i, ItemStack itemstack, int j) {
	return true;
}

}

I like helping people because i was also in a same problem and i do not like unfinished work, so a thank you will be enough for the people im helping and a thank you to the people that helped me :)

Link to comment
Share on other sites

and like i said all the slots work exept  on barrel_container //Chest inv up  last 3

 

 

I like helping people because i was also in a same problem and i do not like unfinished work, so a thank you will be enough for the people im helping and a thank you to the people that helped me :)

Link to comment
Share on other sites

I'm not really sure this has something to to with your saving problem, but 2240 ItemStacks??!

private ItemStack[] inventoryitems = new ItemStack[2240];

Also I'm noticing that you're telling ISidedInventory that you're only holding 65 stacks?

public int getSizeInventory() 
{
	return 65;
}

Apart from that I can't see anything strange...

Author of PneumaticCraft, MineChess, Minesweeper Mod and Sokoban Mod. Visit www.minemaarten.com to take a look at them.

Link to comment
Share on other sites

here is the container

this.numOfRows = bartile.getSizeInventory() / 11;

 

here is the tile

public final class Barrel_Tile extends TileEntity implements ISidedInventory
{
private ItemStack[] inventoryitems = new ItemStack[2240];

public int getSizeInventory() 
{
	return 65;
}
}

I don't think 65 can be properly divided by 11.

Link to comment
Share on other sites

nevermind i fixed it:D it was a simple problem and it was that the number of rows was determined by multiplying the numofrows :)

I like helping people because i was also in a same problem and i do not like unfinished work, so a thank you will be enough for the people im helping and a thank you to the people that helped me :)

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.

Guest
Unfortunately, your content contains terms that we do not allow. Please edit your content to remove the highlighted words below.
Reply to this topic...

×   Pasted as rich text.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Announcements



  • Recently Browsing

    • No registered users viewing this page.
  • Posts

    • I want to make a tree decorator that will generate a beehive under branches of my tree. I have no idea how to check for branches and make beehives generate because TreeDecorator.Context.logs() is just a block pos and i dont understand how it works. i hope ill get an answer here.
    • Imagine this: you've painstakingly accumulated $97,000 worth of Bitcoin, only to see it vanish into the digital abyss at the hands of cunning scammers. It's a devastating blow, leaving you feeling helpless and betrayed. But fear not, for Lee Ultimate Hacker is here to turn the tide in your favor. After conducting extensive research on cryptocurrency recovery options, I stumbled upon Lee Ultimate Hacker, and it proved to be the most suitable choice for the daunting task at hand. Despite my initial skepticism, they shattered my doubts by successfully retrieving $92,000 of the lost Bitcoin—a feat I once deemed impossible. From the moment I reached out to Lee Ultimate Hacker and provided them with all the pertinent information about the fraudulent transaction, they sprang into action with unwavering determination. True to their word, they delivered on their promise to recover the lost Bitcoin within an impressive timeframe of 24 to 72 hours. Their professionalism, expertise, and commitment to their clients were truly commendable, transforming what seemed like an insurmountable ordeal into a resounding triumph. In my eyes, the investment of both time and money was more than justified by the remarkable outcome achieved by Lee Ultimate Hacker. So, if you've fallen victim to cryptocurrency scams and are grappling with the anguish of lost funds, don't despair. Reach out to Lee Ultimate Hacker and let them work their magic. Their track record of success speaks for itself, and with their assistance, you can reclaim what's rightfully yours and emerge stronger than ever before. Don't let the darkness of cybercrime overshadow your financial future. Take a stand against fraudsters with the help of Lee Ultimate Hacker, and witness the transformation from despair to triumph. Your journey to recovery starts here. LEEULTIMATEHACKER@ AOL. COM or Support @ leeultimatehacker . com. telegram:LEEULTIMATE or wh@tsapp +1  (715) 314  -  9248 https://leeultimatehacker.com Thank you.
    • There's a scheme I got into where they promised to trade Bitcoin for me and take a cut as a commission. Seemed like a good idea at the time. But then, things went south real fast. They ended up transferring   $190,000 worth of my Bitcoin. I was devastated and felt completely helpless. That's when I stumbled upon the Wizard Web Recovery Tool. It was like a beacon of hope amid chaos. With this tool, I could finally start digging into what went wrong and hopefully get my Bitcoin back. Using Wizard Web was surprisingly easy. I just had to plug in some details about my Bitcoin account and let it do its thing. It started scanning the internet, looking for any clues about what happened to my Bitcoin. It felt like having a detective on my side, searching for answers. And guess what? Wizard Web found some leads. It uncovered evidence of the scheme's shady dealings and helped me track down the people responsible for losing my Bitcoin. Armed with this information, I took the case to court. After a long and hard-fought legal battle, the court ruled in my favor. The perpetrators were held accountable for their actions and faced criminal charges for their involvement in the scheme. It was a victory not just for me, but for anyone who's been taken advantage of by these kinds of scams. Thanks to Wizard Web Recovery, I was able to get justice and reclaim what was rightfully mine. It showed me that even in the face of adversity, there's always a way to fight back. And with the right tools and determination, anything is possible.   The following is the contact information for Wizard Web Recovery.   Email: wizard web recovery((@))programmer . net
    • Hello, good morning. I know some programming and I'm interested in mod creation. That's why I've decided to follow a tutorial guide on YouTube by TurtyWurty. https://www.youtube.com/watch?v=DhoX9cmAZqA&t=160s&ab_channel=TurtyWurty I've followed the tutorial perfectly. The problem is that when checking the food, the texture doesn't load for me. However, everything seems fine no matter how much I check. I'm sure it's something trivial, the problem is that I can't find it. Could you help me solve it, please? I leave a zip of my file so you can edit it freely. forge-1.20-Civicraft.rar
    • If you have nvidia graphics, it's important that you make sure Minecraft (and anything Minecraft-related) is set to prefer high performance graphics first. If you only update your AMD drivers it might fix the issue but cause severe performance loss vs Vanilla as it'll be running on the integrated graphics instead of dedicated nvidia graphics
  • Topics

×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.