1e20086799
* Extracts item comparison from Platform into their own helper. Renamed methods to be more more fitting for the actual comparison. Added documentation about each methods behaviour.
223 lines
4.7 KiB
Java
223 lines
4.7 KiB
Java
/*
|
|
* This file is part of Applied Energistics 2.
|
|
* Copyright (c) 2013 - 2014, AlgorithmX2, All rights reserved.
|
|
*
|
|
* Applied Energistics 2 is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Applied Energistics 2 is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with Applied Energistics 2. If not, see <http://www.gnu.org/licenses/lgpl>.
|
|
*/
|
|
|
|
package appeng.util.inv;
|
|
|
|
|
|
import java.util.Iterator;
|
|
import java.util.List;
|
|
|
|
import net.minecraft.item.ItemStack;
|
|
|
|
import appeng.api.config.FuzzyMode;
|
|
import appeng.util.InventoryAdaptor;
|
|
import appeng.util.Platform;
|
|
import appeng.util.iterators.StackToSlotIterator;
|
|
|
|
|
|
public class AdaptorList extends InventoryAdaptor
|
|
{
|
|
|
|
private final List<ItemStack> i;
|
|
|
|
public AdaptorList( final List<ItemStack> s )
|
|
{
|
|
this.i = s;
|
|
}
|
|
|
|
@Override
|
|
public ItemStack removeItems( int amount, final ItemStack filter, final IInventoryDestination destination )
|
|
{
|
|
final int s = this.i.size();
|
|
for( int x = 0; x < s; x++ )
|
|
{
|
|
final ItemStack is = this.i.get( x );
|
|
if( is != null && ( filter == null || Platform.itemComparisons().isSameItem( is, filter ) ) )
|
|
{
|
|
if( amount > is.stackSize )
|
|
{
|
|
amount = is.stackSize;
|
|
}
|
|
if( destination != null && !destination.canInsert( is ) )
|
|
{
|
|
amount = 0;
|
|
}
|
|
|
|
if( amount > 0 )
|
|
{
|
|
final ItemStack rv = is.copy();
|
|
rv.stackSize = amount;
|
|
is.stackSize -= amount;
|
|
|
|
// remove it..
|
|
if( is.stackSize <= 0 )
|
|
{
|
|
this.i.remove( x );
|
|
}
|
|
|
|
return rv;
|
|
}
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
@Override
|
|
public ItemStack simulateRemove( int amount, final ItemStack filter, final IInventoryDestination destination )
|
|
{
|
|
for( final ItemStack is : this.i )
|
|
{
|
|
if( is != null && ( filter == null || Platform.itemComparisons().isSameItem( is, filter ) ) )
|
|
{
|
|
if( amount > is.stackSize )
|
|
{
|
|
amount = is.stackSize;
|
|
}
|
|
if( destination != null && !destination.canInsert( is ) )
|
|
{
|
|
amount = 0;
|
|
}
|
|
|
|
if( amount > 0 )
|
|
{
|
|
final ItemStack rv = is.copy();
|
|
rv.stackSize = amount;
|
|
return rv;
|
|
}
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
@Override
|
|
public ItemStack removeSimilarItems( int amount, final ItemStack filter, final FuzzyMode fuzzyMode, final IInventoryDestination destination )
|
|
{
|
|
final int s = this.i.size();
|
|
for( int x = 0; x < s; x++ )
|
|
{
|
|
final ItemStack is = this.i.get( x );
|
|
if( is != null && ( filter == null || Platform.itemComparisons().isFuzzyEqualItem( is, filter, fuzzyMode ) ) )
|
|
{
|
|
if( amount > is.stackSize )
|
|
{
|
|
amount = is.stackSize;
|
|
}
|
|
if( destination != null && !destination.canInsert( is ) )
|
|
{
|
|
amount = 0;
|
|
}
|
|
|
|
if( amount > 0 )
|
|
{
|
|
final ItemStack rv = is.copy();
|
|
rv.stackSize = amount;
|
|
is.stackSize -= amount;
|
|
|
|
// remove it..
|
|
if( is.stackSize <= 0 )
|
|
{
|
|
this.i.remove( x );
|
|
}
|
|
|
|
return rv;
|
|
}
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
@Override
|
|
public ItemStack simulateSimilarRemove( int amount, final ItemStack filter, final FuzzyMode fuzzyMode, final IInventoryDestination destination )
|
|
{
|
|
for( final ItemStack is : this.i )
|
|
{
|
|
if( is != null && ( filter == null || Platform.itemComparisons().isFuzzyEqualItem( is, filter, fuzzyMode ) ) )
|
|
{
|
|
if( amount > is.stackSize )
|
|
{
|
|
amount = is.stackSize;
|
|
}
|
|
if( destination != null && !destination.canInsert( is ) )
|
|
{
|
|
amount = 0;
|
|
}
|
|
|
|
if( amount > 0 )
|
|
{
|
|
final ItemStack rv = is.copy();
|
|
rv.stackSize = amount;
|
|
return rv;
|
|
}
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
@Override
|
|
public ItemStack addItems( final ItemStack toBeAdded )
|
|
{
|
|
if( toBeAdded == null )
|
|
{
|
|
return null;
|
|
}
|
|
if( toBeAdded.stackSize == 0 )
|
|
{
|
|
return null;
|
|
}
|
|
|
|
final ItemStack left = toBeAdded.copy();
|
|
|
|
for( final ItemStack is : this.i )
|
|
{
|
|
if( Platform.itemComparisons().isEqualItem( is, left ) )
|
|
{
|
|
is.stackSize += left.stackSize;
|
|
return null;
|
|
}
|
|
}
|
|
|
|
this.i.add( left );
|
|
return null;
|
|
}
|
|
|
|
@Override
|
|
public ItemStack simulateAdd( final ItemStack toBeSimulated )
|
|
{
|
|
return null;
|
|
}
|
|
|
|
@Override
|
|
public boolean containsItems()
|
|
{
|
|
for( final ItemStack is : this.i )
|
|
{
|
|
if( is != null )
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
@Override
|
|
public Iterator<ItemSlot> iterator()
|
|
{
|
|
return new StackToSlotIterator( this.i.iterator() );
|
|
}
|
|
}
|