Package org.spout.api.geo.cuboid

Examples of org.spout.api.geo.cuboid.Block.translate()

55
56
57
58
59
60
61
62
63
64
65
  public int getLevels() {
    Block block = getBlock();
    for (int lvl = 1; lvl <= 4; lvl++) {
      for (int dx = -lvl; dx <= lvl; dx++) {
        for (int dz = -lvl; dz <= lvl; dz++) {
          if (!isPyramidMaterial(block.translate(dx, -lvl, dz).getMaterial())) {
            return lvl - 1;
          }
        }
      }
    }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
      for (int dz = -1; dz <= 1; dz++) {
        if (dx == 0 && dz == 0) {
          continue; // Ignore the enchantment table itself
        }
        for (int dy = 0; dy <= 1; dy++) {
          if (!VanillaMaterials.AIR.equals(block.translate(dx, dy, dz).getMaterial())) {
            break;
          }
          if (VanillaMaterials.BOOKSHELF.equals(block.translate(2 * dx, dy, 2 * dz).getMaterial())) {
            ++bookshelves;
          }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
        }
        for (int dy = 0; dy <= 1; dy++) {
          if (!VanillaMaterials.AIR.equals(block.translate(dx, dy, dz).getMaterial())) {
            break;
          }
          if (VanillaMaterials.BOOKSHELF.equals(block.translate(2 * dx, dy, 2 * dz).getMaterial())) {
            ++bookshelves;
          }
          if (dx != 0 && dz != 0) {
            if (VanillaMaterials.BOOKSHELF.equals(block.translate(dx, dy, 2 * dz).getMaterial())) {
              ++bookshelves;
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
          }
          if (VanillaMaterials.BOOKSHELF.equals(block.translate(2 * dx, dy, 2 * dz).getMaterial())) {
            ++bookshelves;
          }
          if (dx != 0 && dz != 0) {
            if (VanillaMaterials.BOOKSHELF.equals(block.translate(dx, dy, 2 * dz).getMaterial())) {
              ++bookshelves;
            }
            if (VanillaMaterials.BOOKSHELF.equals(block.translate(2 * dx, dy, dz).getMaterial())) {
              ++bookshelves;
            }
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
          }
          if (dx != 0 && dz != 0) {
            if (VanillaMaterials.BOOKSHELF.equals(block.translate(dx, dy, 2 * dz).getMaterial())) {
              ++bookshelves;
            }
            if (VanillaMaterials.BOOKSHELF.equals(block.translate(2 * dx, dy, dz).getMaterial())) {
              ++bookshelves;
            }
          }
        }
      }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
  @Override
  public void setOpened(Player player, boolean opened) {
    if (isDouble()) {
      Block block = getBlock();
      //MC will only play the chest open/close animation if you play it on the NE-most chest block in double chests
      if (block.translate(BlockFace.EAST).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.EAST), (byte) 1, opened ? (byte) 1 : (byte) 0);
      } else if (block.translate(BlockFace.NORTH).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.NORTH), (byte) 1, opened ? (byte) 1 : (byte) 0);
      }
    }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
  public void setOpened(Player player, boolean opened) {
    if (isDouble()) {
      Block block = getBlock();
      //MC will only play the chest open/close animation if you play it on the NE-most chest block in double chests
      if (block.translate(BlockFace.EAST).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.EAST), (byte) 1, opened ? (byte) 1 : (byte) 0);
      } else if (block.translate(BlockFace.NORTH).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.NORTH), (byte) 1, opened ? (byte) 1 : (byte) 0);
      }
    }
    super.setOpened(player, opened);
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
    if (isDouble()) {
      Block block = getBlock();
      //MC will only play the chest open/close animation if you play it on the NE-most chest block in double chests
      if (block.translate(BlockFace.EAST).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.EAST), (byte) 1, opened ? (byte) 1 : (byte) 0);
      } else if (block.translate(BlockFace.NORTH).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.NORTH), (byte) 1, opened ? (byte) 1 : (byte) 0);
      }
    }
    super.setOpened(player, opened);
  }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
      Block block = getBlock();
      //MC will only play the chest open/close animation if you play it on the NE-most chest block in double chests
      if (block.translate(BlockFace.EAST).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.EAST), (byte) 1, opened ? (byte) 1 : (byte) 0);
      } else if (block.translate(BlockFace.NORTH).getMaterial() == VanillaMaterials.CHEST) {
        VanillaBlockMaterial.playBlockAction(block.translate(BlockFace.NORTH), (byte) 1, opened ? (byte) 1 : (byte) 0);
      }
    }
    super.setOpened(player, opened);
  }
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
    final Block topLeftBlock = bottomLeftBlock.translate(BlockFace.TOP, 4);

    bottomLeftBlock.setMaterial(VanillaMaterials.OBSIDIAN);
    bottomRightBlock.setMaterial(VanillaMaterials.OBSIDIAN);
    topLeftBlock.setMaterial(VanillaMaterials.OBSIDIAN);
    topLeftBlock.translate(direction, 3).setMaterial(VanillaMaterials.OBSIDIAN);

    // Build vertical columns
    for (int dy = 0; dy < 4; dy++) {
      bottomLeftBlock.translate(BlockFace.TOP, dy).setMaterial(VanillaMaterials.OBSIDIAN);
      bottomRightBlock.translate(BlockFace.TOP, dy).setMaterial(VanillaMaterials.OBSIDIAN);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.