Package com.sk89q.worldedit

Examples of com.sk89q.worldedit.BlockVector

69
70
71
72
73
74
75
76
77
78
79
    @Override
    public BlockVector next() {
        if (!hasNext()) throw new java.util.NoSuchElementException();

        BlockVector answer = new BlockVector(nextX, nextY, nextZ);

        forwardOne();
        forward();

        return answer;
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
    public BlockVector next() {
        if (!hasNext()) {
            throw new NoSuchElementException();
        }

        BlockVector current = new BlockVector(next2D.getBlockX(), nextY, next2D.getBlockZ());
        if (nextY < maxY) {
            nextY++;
        } else if (flatIterator.hasNext()) {
            next2D = flatIterator.next();
            nextY = minY;
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
  /* (non-Javadoc)
   * @see de.beimax.simplespleef.util.Cuboid#setSerializedBlocks(de.beimax.simplespleef.util.SerializableBlockData[][][])
   */
  @Override
  public void setSerializedBlocks(SerializableBlockData[][][] blockData) {
    BlockVector max = region.getMaximumPoint();
    BlockVector min = region.getMinimumPoint();

    LinkedList<Chunk> chunksChanged = new LinkedList<Chunk>();

    final int[] coords = {(min.getBlockX()<max.getBlockX()?min.getBlockX():max.getBlockX()),
        (min.getBlockY()<max.getBlockY()?min.getBlockY():max.getBlockY()),
        (min.getBlockZ()<max.getBlockZ()?min.getBlockZ():max.getBlockZ())};

    for (int x = 0; x < blockData.length; x++)
      for (int y = 0; y < blockData[0].length; y++)
        for (int z = 0; z < blockData[0][0].length; z++) {
          if (this.region.contains(coords[0] + x, coords[1] + y, coords[2] + z)) { // only restore, if within the region
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
    return new Location(this.world, coords[3], coords[4], coords[5]);
  }

  @Override
  public final int[] getMinMaxCoords() {
    BlockVector max = region.getMaximumPoint();
    BlockVector min = region.getMinimumPoint();
   
    final int[] coords = {(min.getBlockX()<max.getBlockX()?min.getBlockX():max.getBlockX()),
        (min.getBlockY()<max.getBlockY()?min.getBlockY():max.getBlockY()),
        (min.getBlockZ()<max.getBlockZ()?min.getBlockZ():max.getBlockZ()),
        (min.getBlockX()>max.getBlockX()?min.getBlockX():max.getBlockX()),
        (min.getBlockY()>max.getBlockY()?min.getBlockY():max.getBlockY()),
        (min.getBlockZ()>max.getBlockZ()?min.getBlockZ():max.getBlockZ())};
    return coords;
  }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
      return r;
    }
   
    @Override
    public Iterator<Block> getBlocks() {
      final BlockVector min = region.getMinimumPoint(), max = region.getMaximumPoint();
      return new AABB(world, new Vector(min.getBlockX(), min.getBlockY(), min.getBlockZ()), new Vector(max.getBlockX() + 1, max.getBlockY() + 1, max.getBlockZ() + 1)).iterator();
//      final Iterator<BlockVector2D> iter = region.getPoints().iterator();
//      if (!iter.hasNext())
//        return EmptyIterator.get();
//      return new Iterator<Block>() {
//        @SuppressWarnings("null")
View Full Code Here
TOP

Related Classes of com.sk89q.worldedit.BlockVector

  • ch.njol.skript.hooks.regions.WorldGuardHook$WorldGuardRegion
  • com.sk89q.worldedit.bukkit.BukkitUtil
  • com.sk89q.worldedit.extent.buffer.ForgetfulExtentBuffer
  • com.sk89q.worldedit.extent.cache.LastAccessExtentCache
  • com.sk89q.worldedit.extent.clipboard.io.SchematicReader
  • com.sk89q.worldedit.extent.reorder.MultiStageReorder$Stage3Committer
  • com.sk89q.worldedit.function.visitor.BreadthFirstSearch
  • com.sk89q.worldedit.history.changeset.BlockOptimizedHistory
  • com.sk89q.worldedit.regions.EllipsoidRegion
  • com.sk89q.worldedit.regions.iterator.FlatRegion3DIterator
    • Copyright © 2018 www.massapicom. 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.