Package Hexel.blocks.types

Examples of Hexel.blocks.types.BlockWood

80
81
82
83
84
85
86
87
88
89
90
    }
    else if (b instanceof BlockStone){
      return BlockStone.Make(newHealth);
    }
    else if (b instanceof BlockWood){
      BlockWood bw = (BlockWood)b;
      return BlockWood.Make(new BlockWoodData(newHealth, bw.data.level, bw.data.branchLevel, bw.data.branches, bw.data.alive));
    }
    else{
      try {
        throw new Exception("can't update health, unknown block type");
View Full Code Here
18
19
20
21
22
23
24
25
26
  private Vector3i tmp3i = new Vector3i();
 
  @Override
  public int run(int bx, int by, int bz, boolean fastMode, Block b, Chunk c,
      HighestBlockChunk hbc, Chunks chunks, int step, BlockDeltaAdder blockDeltaAdder) {
    BlockWood woodBlock = BlockWood.Make(new BlockWoodData(BlockWood.MAX_HEALTH, 0, 0, 0, true));
    blockDeltaAdder.addBlockDelta(BlockDelta.Aquire(bx, by, bz, woodBlock, chunks.getStepsToSim(bx, by, bz, tmp3i, c)));
    return BlockSimulator.DONT_RUN;
  }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
        @Override
        public boolean canApply(int bx, int by, int bz, boolean fastMode, Block b, Chunk c,
            HighestBlockChunk hbc, Chunks chunks, int step, BlockDeltaAdder blockDeltaAdder) {
          Vector3i[] neighbors = HexGeometry.getAllNeighbors(bx);
          Vector3i neighbor = neighbors[neighborIndex];
          BlockWood wb = (BlockWood) b;
          if (!wb.data.alive)
            return false;
          Block nb = chunks.getBlock(bx + neighbor.x, by + neighbor.y, bz + neighbor.z, tmp3i, c);
          if (!(nb instanceof BlockEmpty || nb instanceof BlockLeaf))
            return false;
         
          int nx = bx + neighbor.x;
          int ny = by + neighbor.y;
          int nz = bz + neighbor.z;
         
          boolean isBranch = nx != bx || ny != by;

          if (nz < bz)
            return false;
          if(wb.data.level < 4 && isBranch)
            return false;
 
          int h = 1;
          h = 31*h + nx;
          h = 31*h + ny;
          h = 31*h + nz;
         
          if (wb.data.level != 0){
            double chanceGrow = 0;
            if (isBranch){
              chanceGrow =   (  .5*((wb.data.level-wb.data.branchLevel)%2) +
                        .05*(wb.data.level-10)
                       )
                       *(1-wb.data.branchLevel*.25)
                       *(1-wb.data.branches*.25);
            }
            else {
              chanceGrow = 3.0 - .1*wb.data.level*(wb.data.branchLevel*10000+1);
            }
            if (Util.hashToDouble(h) > chanceGrow)
              return false;
          }
         
          return true;
        }

        @Override
        public int probabilisticRun(int bx, int by, int bz, boolean fastMode, Block b, Chunk c,
            HighestBlockChunk hbc, Chunks chunks, int step, BlockDeltaAdder blockDeltaAdder) {
          BlockWood wb = (BlockWood) b;
         
          Vector3i[] neighbors = HexGeometry.getAllNeighbors(bx);
          Vector3i neighbor = neighbors[neighborIndex];
         
          int nx = bx + neighbor.x;
          int ny = by + neighbor.y;
          int nz = bz + neighbor.z;
         
          boolean isBranch = nx != bx || ny != by;
         
          tmp3i.x = nx;
          tmp3i.y = ny;
          tmp3i.z = nz;
          if (blockDeltaAdder.hasBlockDelta(tmp3i)){
            return 1;
          }
          tmp3i.x = bx;
          tmp3i.y = by;
          tmp3i.z = bz;
          if (blockDeltaAdder.hasBlockDelta(tmp3i)){
            return 1;
          }

          BlockWood grownWB;
          BlockWood newWB;
          if (isBranch){
            grownWB = BlockWood.Make(new BlockWoodData(BlockWood.MAX_HEALTH, wb.data.level+1, wb.data.branchLevel+1, 0, true));
            newWB = BlockWood.Make(new BlockWoodData(BlockWood.MAX_HEALTH, wb.data.level, wb.data.branchLevel, wb.data.branches+1, true));
          }
          else {
            grownWB = BlockWood.Make(new BlockWoodData(BlockWood.MAX_HEALTH, wb.data.level+1, wb.data.branchLevel, 0, true));
            newWB = BlockWood.Make(new BlockWoodData(BlockWood.MAX_HEALTH, wb.data.level, wb.data.branchLevel, wb.data.branches, true));
          }
          blockDeltaAdder.addBlockDelta(BlockDelta.Aquire(nx, ny, nz, grownWB, chunks.getStepsToSim(bx, by, bz, tmp3i, c)));
          blockDeltaAdder.addBlockDelta(BlockDelta.Aquire(bx, by, bz, newWB, chunks.getStepsToSim(bx, by, bz, tmp3i, c)));
          return BlockSimulator.DONT_RUN;
        }
      });
//
      //==========LEAFS=========
      woodRules.add(new ProbabilisticFreqBlockRule(500, .5){
       
        @Override
        public boolean canApply(int bx, int by, int bz, boolean fastMode, Block b, Chunk c,
            HighestBlockChunk hbc, Chunks chunks, int step, BlockDeltaAdder blockDeltaAdder) {
          Vector3i[] neighbors = HexGeometry.getAllNeighbors(bx);
          Vector3i neighbor = neighbors[neighborIndex];
          BlockWood wb = (BlockWood) b;
          if (!wb.data.alive)
            return false;
          if(wb.data.level < 4)
            return false;
          if (!(chunks.getBlock(bx + neighbor.x, by + neighbor.y, bz + neighbor.z, tmp3i, c) instanceof BlockEmpty))
            return false;
         
          int nx = bx + neighbor.x;
          int ny = by + neighbor.y;
          int nz = bz + neighbor.z;
 
          int h = 1;
          h = 31*h + nx;
          h = 31*h + ny;
          h = 31*h + nz;
          if (wb.data.level != 0){
            double chanceGrow = 0;
            chanceGrow = Math.min(Math.max(.1*(wb.data.level-5), 0), .75) + Math.min(.5*wb.data.branchLevel, .75);
            if (Util.hashToDouble(h) > chanceGrow)
              return false;
          }
          return true;
        }

        @Override
        public int probabilisticRun(int bx, int by, int bz, boolean fastMode, Block b, Chunk c,
            HighestBlockChunk hbc, Chunks chunks, int step, BlockDeltaAdder blockDeltaAdder) {
          BlockWood wb = (BlockWood) b;
         
          Vector3i[] neighbors = HexGeometry.getAllNeighbors(bx);
          Vector3i neighbor = neighbors[neighborIndex];
         
          int nx = bx + neighbor.x;
View Full Code Here
TOP

Related Classes of Hexel.blocks.types.BlockWood

  • Hexel.blocks.BlockTools
  • Hexel.blocks.rules.SeedRule
  • Hexel.blocks.rules.TreeRules
    • 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.