Typo Recurive
This commit is contained in:
@@ -60,7 +60,7 @@ public class CraftingTreeNode
|
|||||||
for (ICraftingPatternDetails details : cc.getCraftingFor( what, parent == null ? null : parent.details, slot, world ))// in
|
for (ICraftingPatternDetails details : cc.getCraftingFor( what, parent == null ? null : parent.details, slot, world ))// in
|
||||||
// order.
|
// order.
|
||||||
{
|
{
|
||||||
if ( parent == null || parent.notRecurive( details ) )
|
if ( parent == null || parent.notRecursive( details ) )
|
||||||
nodes.add( new CraftingTreeProcess( cc, job, details, this, depth + 1, world ) );
|
nodes.add( new CraftingTreeProcess( cc, job, details, this, depth + 1, world ) );
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -73,7 +73,7 @@ public class CraftingTreeNode
|
|||||||
return is;
|
return is;
|
||||||
}
|
}
|
||||||
|
|
||||||
boolean notRecurive(ICraftingPatternDetails details)
|
boolean notRecursive(ICraftingPatternDetails details)
|
||||||
{
|
{
|
||||||
IAEItemStack[] o = details.getCondensedOutputs();
|
IAEItemStack[] o = details.getCondensedOutputs();
|
||||||
for (IAEItemStack i : o)
|
for (IAEItemStack i : o)
|
||||||
@@ -88,7 +88,7 @@ public class CraftingTreeNode
|
|||||||
if ( parent == null )
|
if ( parent == null )
|
||||||
return true;
|
return true;
|
||||||
|
|
||||||
return parent.notRecurive( details );
|
return parent.notRecursive( details );
|
||||||
}
|
}
|
||||||
|
|
||||||
public IAEItemStack request(MECraftingInventory inv, long l, BaseActionSource src) throws CraftBranchFailure, InterruptedException
|
public IAEItemStack request(MECraftingInventory inv, long l, BaseActionSource src) throws CraftBranchFailure, InterruptedException
|
||||||
|
|||||||
@@ -135,9 +135,9 @@ public class CraftingTreeProcess
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
public boolean notRecurive(ICraftingPatternDetails details)
|
public boolean notRecursive(ICraftingPatternDetails details)
|
||||||
{
|
{
|
||||||
return parent == null || parent.notRecurive( details );
|
return parent == null || parent.notRecursive( details );
|
||||||
}
|
}
|
||||||
|
|
||||||
long getTimes(long remaining, long stackSize)
|
long getTimes(long remaining, long stackSize)
|
||||||
|
|||||||
Reference in New Issue
Block a user