Fix for new MCP mappings.
Fixed the distribution of flowers with bonemeal. Fixed accidentally making obsidian easy to mine.
This commit is contained in:
parent
8a7c087e34
commit
a64a47b24c
3 changed files with 8 additions and 7 deletions
|
@ -96,10 +96,10 @@ public class ForgeHooks {
|
|||
static {
|
||||
plantGrassList=new ArrayList<ProbableItem>();
|
||||
plantGrassList.add(new ProbableItem(
|
||||
Block.plantYellow.blockID,0,1,0,30));
|
||||
Block.plantYellow.blockID,0,1,0,20));
|
||||
plantGrassList.add(new ProbableItem(
|
||||
Block.plantRed.blockID,0,1,30,40));
|
||||
plantGrassWeight=40;
|
||||
Block.plantRed.blockID,0,1,20,30));
|
||||
plantGrassWeight=30;
|
||||
|
||||
seedGrassList=new ArrayList<ProbableItem>();
|
||||
seedGrassList.add(new ProbableItem(
|
||||
|
@ -212,6 +212,7 @@ public class ForgeHooks {
|
|||
MinecraftForge.setBlockHarvestLevel(Block.oreRedstoneGlowing,"pickaxe",2);
|
||||
MinecraftForge.removeBlockEffectiveness(Block.oreRedstone,"pickaxe");
|
||||
MinecraftForge.removeBlockEffectiveness(Block.oreRedstoneGlowing,"pickaxe");
|
||||
MinecraftForge.removeBlockEffectiveness(Block.obsidian,"pickaxe");
|
||||
|
||||
Block[] pickeff ={
|
||||
Block.cobblestone, Block.stairDouble,
|
||||
|
|
|
@ -70,7 +70,7 @@ public class MinecraftForge {
|
|||
* @param bid The block ID to plant.
|
||||
* @param md The metadata to plant.
|
||||
* @param prop The relative probability of the plant, where red flowers are
|
||||
* 10 and yellow flowers are 30.
|
||||
* 10 and yellow flowers are 20.
|
||||
*/
|
||||
public static void addGrassPlant(int item, int md, int prop) {
|
||||
ForgeHooks.addPlantGrass(item,md,prop);
|
||||
|
|
|
@ -18,7 +18,7 @@
|
|||
+ public TileEntity getBlockEntity(int md) {
|
||||
+ return getBlockEntity();
|
||||
+ }
|
||||
+
|
||||
public void playBlock(World world, int i, int j, int k, int l, int i1)
|
||||
+
|
||||
public void powerBlock(World world, int i, int j, int k, int l, int i1)
|
||||
{
|
||||
super.playBlock(world, i, j, k, l, i1);
|
||||
super.powerBlock(world, i, j, k, l, i1);
|
||||
|
|
Loading…
Reference in a new issue