Tree Generation Tutorial Part 2

WorldGenCandyTrees
--------------------------------------------
package net.minecraft.src;

import java.util.Random;

// Referenced classes of package net.minecraft.src:
//            WorldGenerator, World, Block, BlockLeaves,
//            BlockGrass

public class WorldGenCandyTrees extends WorldGenerator
{

    public WorldGenCandyTrees()
    {
        super();
    }

    public boolean generate(World world, Random random, int i, int j, int k)
    {
        int l = random.nextInt(3) + 4;
        boolean flag = true;
        if(j < 1 || j + l + 1 > world.worldYMax)
        {
            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 < world.worldYMax)
                    {
                        int j3 = world.getBlockId(i2, i1, l2);
                        if(j3 != 0 && j3 != mod_mobs.candyleaves.blockID)
                        {
                            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 >= world.worldYMax - l - 1)
        {
            return false;
        }
        world.setBlock(i, j - 1, k, Block.dirt.blockID);
        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)])
                    {
                        func_41060_a(world, k3, k1, i4, mod_mobs.candyleaves.blockID, 0);
                    }
                }

            }

        }

        for(int l1 = 0; l1 < l; l1++)
        {
            int k2 = world.getBlockId(i, j + l1, k);
            if(k2 == 0 || k2 == mod_mobs.candyleaves.blockID)
            {
                func_41060_a(world, i, j + l1, k, mod_mobs.candylog.blockID, 0);
            }
        }

        return true;
    }
}


mod_ file snippet
----------------------------------------

    public void GenerateSurface(World world, Random ran, int baseX, int baseZ)
    {
    BiomeGenBase biome = world.getWorldChunkManager().getBiomeGenAt(baseX, baseZ);
    WorldGenCandyTrees tree = new WorldGenCandyTrees();
    if((biome instanceof BiomeGenPlains)||(biome instanceof BiomeGenForest)||(biome instanceof BiomeGenHills)
      ||(biome instanceof BiomeGenDesert)||(biome instanceof BiomeGenSwamp)||(biome instanceof BiomeGenTaiga)){


     for(int x = 0;x<5;x++){
      int k = baseX + ran.nextInt(16) + 8;
      int l = baseZ + ran.nextInt(16) + 8;
      int i1 = world.getHeightValue(k, l);
      tree.generate(world, ran, k, i1, l);

      }
     }
    }