Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package net.minecraft.src;
- import java.util.Random;
- public class WorldGenRubberTree extends WorldGenerator
- {
- public WorldGenRubberTree()
- {
- }
- public boolean generate(World world, Random random, int i, int j, int k)
- {
- int l = random.nextInt(1) + 4;
- boolean flag = true;
- if(j < 1 || j + l + 1 > 256)
- {
- return false;
- }
- for(int i1 = j; i1 <= j + 1 + l; i1++)
- {
- byte byte0 = 1;
- if(i1 == j)
- {
- byte0 = 0;
- }
- if(i1 >= (j + 1 + l) - 2)
- {
- byte0 = 2;
- }
- for(int i2 = i - byte0; i2 <= i + byte0 && flag; i2++)
- {
- for(int l2 = k - byte0; l2 <= k + byte0 && flag; l2++)
- {
- if(i1 >= 0 && i1 < 256)
- {
- int j3 = world.getBlockId(i2, i1, l2);
- if(j3 != 0 && j3 != mod_BTP.rubberLeaves.blockID) //Change this to your leaf block.
- {
- flag = false;
- }
- } else
- {
- flag = false;
- }
- }
- }
- }
- if(!flag)
- {
- return false;
- }
- int j1 = world.getBlockId(i, j - 1, k);
- if(j1 != Block.grass.blockID && j1 != Block.dirt.blockID || j >= 256 - l - 1) //This determines on what blocks your tree can generate.
- {
- return false;
- }
- world.setBlock(i, j - 1, k, Block.dirt.blockID); //Also determines what block your tree can generate on.
- for(int k1 = (j - 3) + l; k1 <= j + l; k1++)
- {
- int j2 = k1 - (j + l);
- int i3 = 1 - j2 / 2;
- for(int k3 = i - i3; k3 <= i + i3; k3++)
- {
- int l3 = k3 - i;
- for(int i4 = k - i3; i4 <= k + i3; i4++)
- {
- int j4 = i4 - k;
- if((Math.abs(l3) != i3 || Math.abs(j4) != i3 || random.nextInt(2) != 0 && j2 != 0) && !Block.opaqueCubeLookup[world.getBlockId(k3, k1, i4)])
- {
- setBlockAndMetadata(world, k3, k1, i4, mod_BTP.rubberLeaves.blockID, 0); //Change to your leaf block.
- }
- }
- }
- }
- for(int l1 = 0; l1 < l; l1++)
- {
- int k2 = world.getBlockId(i, j + l1, k);
- if(k2 == 0 || k2 == mod_BTP.rubberLeaves.blockID)
- {
- setBlockAndMetadata(world, i, j + l1, k, mod_BTP.rubberLog.blockID, 0); //Change to your wood block.
- }
- }
- return true;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement