Examples with BlockHugeMushroomBrown cn.nukkit.block.BlockHugeMushroomBrown used on opensource projects

Example 1 with BlockHugeMushroomBrown

use of cn.nukkit.block.BlockHugeMushroomBrown in project Nukkit by Nukkit.

the class BigMushroom method generate.

public boolean generate(ChunkManager level, NukkitRandom rand, Vector3 position) {
    int block = this.mushroomType;
    if (block < 0) {
        block = rand.nextBoolean() ? RED : BROWN;
    }
    Block mushroom = block == 0 ? new BlockHugeMushroomBrown() : new BlockHugeMushroomRed();
    int i = rand.nextBoundedInt(3) + 4;
    if (rand.nextBoundedInt(12) == 0) {
        i *= 2;
    }
    boolean flag = true;
    if (position.getY() >= 1 && position.getY() + i + 1 < 256) {
        for (int j = position.getFloorY(); j <= position.getY() + 1 + i; ++j) {
            int k = 3;
            if (j <= position.getY() + 3) {
                k = 0;
            }
            Vector3 pos = new Vector3();
            for (int l = position.getFloorX() - k; l <= position.getX() + k && flag; ++l) {
                for (int i1 = position.getFloorZ() - k; i1 <= position.getZ() + k && flag; ++i1) {
                    if (j >= 0 && j < 256) {
                        pos.setComponents(l, j, i1);
                        int material = level.getBlockIdAt(pos.getFloorX(), pos.getFloorY(), pos.getFloorZ());
                        if (material != Block.AIR && material != Block.LEAVES) {
                            flag = false;
                        }
                    } else {
                        flag = false;
                    }
                }
            }
        }
        if (!flag) {
            return false;
        } else {
            Vector3 pos2 = position.down();
            int block1 = level.getBlockIdAt(pos2.getFloorX(), pos2.getFloorY(), pos2.getFloorZ());
            if (block1 != Block.DIRT && block1 != Block.GRASS && block1 != Block.MYCELIUM) {
                return false;
            } else {
                int k2 = position.getFloorY() + i;
                if (block == RED) {
                    k2 = position.getFloorY() + i - 3;
                }
                for (int l2 = k2; l2 <= position.getY() + i; ++l2) {
                    int j3 = 1;
                    if (l2 < position.getY() + i) {
                        ++j3;
                    }
                    if (block == BROWN) {
                        j3 = 3;
                    }
                    int k3 = position.getFloorX() - j3;
                    int l3 = position.getFloorX() + j3;
                    int j1 = position.getFloorZ() - j3;
                    int k1 = position.getFloorZ() + j3;
                    for (int l1 = k3; l1 <= l3; ++l1) {
                        for (int i2 = j1; i2 <= k1; ++i2) {
                            int j2 = 5;
                            if (l1 == k3) {
                                --j2;
                            } else if (l1 == l3) {
                                ++j2;
                            }
                            if (i2 == j1) {
                                j2 -= 3;
                            } else if (i2 == k1) {
                                j2 += 3;
                            }
                            int meta = j2;
                            if (block == BROWN || l2 < position.getY() + i) {
                                if ((l1 == k3 || l1 == l3) && (i2 == j1 || i2 == k1)) {
                                    continue;
                                }
                                if (l1 == position.getX() - (j3 - 1) && i2 == j1) {
                                    meta = NORTH_WEST;
                                }
                                if (l1 == k3 && i2 == position.getZ() - (j3 - 1)) {
                                    meta = NORTH_WEST;
                                }
                                if (l1 == position.getX() + (j3 - 1) && i2 == j1) {
                                    meta = NORTH_EAST;
                                }
                                if (l1 == l3 && i2 == position.getZ() - (j3 - 1)) {
                                    meta = NORTH_EAST;
                                }
                                if (l1 == position.getX() - (j3 - 1) && i2 == k1) {
                                    meta = SOUTH_WEST;
                                }
                                if (l1 == k3 && i2 == position.getZ() + (j3 - 1)) {
                                    meta = SOUTH_WEST;
                                }
                                if (l1 == position.getX() + (j3 - 1) && i2 == k1) {
                                    meta = SOUTH_EAST;
                                }
                                if (l1 == l3 && i2 == position.getZ() + (j3 - 1)) {
                                    meta = SOUTH_EAST;
                                }
                            }
                            if (meta == CENTER && l2 < position.getY() + i) {
                                meta = ALL_INSIDE;
                            }
                            if (position.getY() >= position.getY() + i - 1 || meta != ALL_INSIDE) {
                                Vector3 blockPos = new Vector3(l1, l2, i2);
                                if (!Block.solid[level.getBlockIdAt(blockPos.getFloorX(), blockPos.getFloorY(), blockPos.getFloorZ())]) {
                                    mushroom.setDamage(meta);
                                    this.setBlockAndNotifyAdequately(level, blockPos, mushroom);
                                }
                            }
                        }
                    }
                }
                for (int i3 = 0; i3 < i; ++i3) {
                    Vector3 pos = position.up(i3);
                    int id = level.getBlockIdAt(pos.getFloorX(), pos.getFloorY(), pos.getFloorZ());
                    if (!Block.solid[id]) {
                        mushroom.setDamage(STEM);
                        this.setBlockAndNotifyAdequately(level, pos, mushroom);
                    }
                }
                return true;
            }
        }
    } else {
        return false;
    }
}