/src/WallGen.java

https://github.com/Theino/Towny-Obsidian · Java · 294 lines · 219 code · 29 blank · 46 comment · 76 complexity · c401102ae7adbf09ce8d3d93433ac38b MD5 · raw file 

    

  1. import java.util.*;

    2. 

  2. import java.util.logging.Logger;

    3. 

  3. 

    4. 

  4. public class WallGen {

    5. 

  5. 	public static final int topSection = 4; //How many layers the top part of the wall is.

    6. 

  6. 

    7. 

  7. 	protected static final Logger log = Logger.getLogger("Minecraft");

    8. 

  8. 	/*

    9. 

  9. 		WallBlock type:

    10. 

  10. 			0 = Wall

    11. 

  11. 			1 = Turret wall (3 enemy sides)

    12. 

  12. 			2 = Turret wall (1 enemy sides)

    13. 

  13. 	*/

    14. 

  14. 	

    15. 

  15. 	public static boolean deleteTownWall(TownyWorld world, Town town) {

    16. 

  16. 		BlockQueue blockQueue = BlockQueue.getInstance();

    17. 

  17. 		//Delete old wall

    18. 

  18. 		//ArrayList<TownBlock> townblocks = world.getTownBlocks(town);

    19. 

  19. 		for (WallBlock wb : town.wall.sections) {

    20. 

  20. 			for (int z = 0; z < 4; z++) {

    21. 

  21. 				//for (int y = 0; y < town.wall.walkwayHeight+topSection-(int)wb.p.y; y++) {

    22. 

  22. 				for (int y = 0; y < town.wall.height+topSection; y++) {

    23. 

  23. 					for (int x = 0; x < 4; x++) {

    24. 

  24. 						blockQueue.addWork(new Block(0, (int)wb.p.x+x, (int)wb.p.y+y, (int)wb.p.z+z));

    25. 

  25. 					}

    26. 

  26. 				}

    27. 

  27. 			}

    28. 

  28. 		}

    29. 

  29. 		town.wall.sections.clear();

    30. 

  30. 		

    31. 

  31. 		return true;

    32. 

  32. 	}

    33. 

  33. 	

    34. 

  34. 	public static boolean townGen(TownyWorld world, Town town) {

    35. 

  35. 		ArrayList<TownBlock> townblocks = world.getTownBlocks(town);

    36. 

  36. 		

    37. 

  37. 		// Assign Turrets

    38. 

  38. 		for (TownBlock tb : townblocks) {

    39. 

  39. 			if (!isPartOfTown(tb.x-1, tb.z, town)) {

    40. 

  40. 				for (int z = 0; z < TownyProperties.blockSize; z += 4)

    41. 

  41. 					town.wall.sections.add(new WallBlock(lowestInGrid(tb.x*TownyProperties.blockSize, z+tb.z*TownyProperties.blockSize, 4, 4), 0, 0));	

    42. 

  42. 			}

    43. 

  43. 			if (!isPartOfTown(tb.x, tb.z-1, town)) {

    44. 

  44. 				for (int x = 0; x < TownyProperties.blockSize; x += 4)

    45. 

  45. 					town.wall.sections.add(new WallBlock(lowestInGrid(x+tb.x*TownyProperties.blockSize, tb.z*TownyProperties.blockSize, 4, 4), 3, 0));

    46. 

  46. 			}

    47. 

  47. 			if (!isPartOfTown(tb.x+1, tb.z, town)) {

    48. 

  48. 				for (int z = 0; z < TownyProperties.blockSize; z += 4)

    49. 

  49. 					town.wall.sections.add(new WallBlock(lowestInGrid(tb.x*TownyProperties.blockSize+(TownyProperties.blockSize-4), z+tb.z*TownyProperties.blockSize, 4, 4), 2, 0));

    50. 

  50. 			}

    51. 

  51. 			if (!isPartOfTown(tb.x, tb.z+1, town)) {

    52. 

  52. 				for (int x = 0; x < TownyProperties.blockSize; x += 4)

    53. 

  53. 					town.wall.sections.add(new WallBlock(lowestInGrid(x+tb.x*TownyProperties.blockSize, tb.z*TownyProperties.blockSize+(TownyProperties.blockSize-4), 4, 4), 1, 0));

    54. 

  54. 			}

    55. 

  55. 			

    56. 

  56. 			// x = current townblock, f = town, e = else

    57. 

  57. 			

    58. 

  58. 			// ef    ee

    59. 

  59. 			// fx or ex

    60. 

  60. 			if (!isPartOfTown(tb.x-1, tb.z+1, town) &&

    61. 

  61. 				(isPartOfTown(tb.x-1, tb.z, town) && isPartOfTown(tb.x, tb.z+1, town)) ||

    62. 

  62. 				(!isPartOfTown(tb.x-1, tb.z, town) && !isPartOfTown(tb.x, tb.z+1, town)) )

    63. 

  63. 				town.wall.sections.add(new WallBlock(lowestInGrid(tb.x*TownyProperties.blockSize, tb.z*TownyProperties.blockSize+(TownyProperties.blockSize-4), 4, 4), 1, (isPartOfTown(tb.x-1, tb.z, town) && isPartOfTown(tb.x, tb.z+1, town)) ? 2 : 1));

    64. 

  64. 			// fe    ee

    65. 

  65. 			// xf or xe

    66. 

  66. 			if (!isPartOfTown(tb.x+1, tb.z+1, town) &&

    67. 

  67. 				(isPartOfTown(tb.x+1, tb.z, town) && isPartOfTown(tb.x, tb.z+1, town)) ||	

    68. 

  68. 				(!isPartOfTown(tb.x+1, tb.z, town) && !isPartOfTown(tb.x, tb.z+1, town)) )

    69. 

  69. 				town.wall.sections.add(new WallBlock(lowestInGrid(tb.x*TownyProperties.blockSize+(TownyProperties.blockSize-4), tb.z*TownyProperties.blockSize+(TownyProperties.blockSize-4), 4, 4), 2, (isPartOfTown(tb.x+1, tb.z, town) && isPartOfTown(tb.x, tb.z+1, town)) ? 2 : 1));

    70. 

  70. 			// xf    xe

    71. 

  71. 			// fe or ee

    72. 

  72. 			if (!isPartOfTown(tb.x+1, tb.z-1, town) &&

    73. 

  73. 				(isPartOfTown(tb.x+1, tb.z, town) && isPartOfTown(tb.x, tb.z-1, town)) ||	

    74. 

  74. 				(!isPartOfTown(tb.x+1, tb.z, town) && !isPartOfTown(tb.x, tb.z-1, town)) )

    75. 

  75. 				town.wall.sections.add(new WallBlock(lowestInGrid(tb.x*TownyProperties.blockSize+(TownyProperties.blockSize-4), tb.z*TownyProperties.blockSize, 4, 4), 3, (isPartOfTown(tb.x+1, tb.z, town) && isPartOfTown(tb.x, tb.z-1, town)) ? 2 : 1));

    76. 

  76. 			// fx    ex

    77. 

  77. 			// ef or ee

    78. 

  78. 			if (!isPartOfTown(tb.x-1, tb.z-1, town) &&

    79. 

  79. 				(isPartOfTown(tb.x-1, tb.z, town) && isPartOfTown(tb.x, tb.z-1, town)) ||

    80. 

  80. 				(!isPartOfTown(tb.x-1, tb.z, town) && !isPartOfTown(tb.x, tb.z-1, town)) )

    81. 

  81. 				town.wall.sections.add(new WallBlock(lowestInGrid(tb.x*TownyProperties.blockSize, tb.z*TownyProperties.blockSize, 4, 4), 0, (isPartOfTown(tb.x-1, tb.z, town) && isPartOfTown(tb.x, tb.z-1, town)) ? 2 : 1));

    82. 

  82. 			

    83. 

  83. 			//TODO: delete walls where turrets are. Don't

    84. 

  84. 		}

    85. 

  85. 		

    86. 

  86. 		/*

    87. 

  87. 		for (WallBlock wb : town.wall.sections) {

    88. 

  88. 			if ((int)wb.p.y > town.wall.walkwayHeight)

    89. 

  89. 				town.wall.walkwayHeight = (int)wb.p.y+town.wall.height+3;

    90. 

  90. 		}

    91. 

  91. 		*/

    92. 

  92. 				

    93. 

  93. 		for (WallBlock wb : town.wall.sections)

    94. 

  94. 			drawWallBlock(town.wall, wb);

    95. 

  95. 			

    96. 

  96. 		return true;

    97. 

  97. 	}

    98. 

  98. 	

    99. 

  99. 	public static void drawWallBlock(Wall wall, WallBlock wb) {

    100. 

  100. 		BlockQueue blockQueue = BlockQueue.getInstance();

    101. 

  101. 		// Even wall height

    102. 

  102. 		//int[][][] arr = getBuildArray(wall.blockType, wall.walkwayHeight-(int)wb.p.y, wb.t, wb.r);

    103. 

  103. 		

    104. 

  104. 		int[][][] arr = getBuildArray(wall.blockType, wall.height, wb.t, wb.r);

    105. 

  105. 		ArrayList<Block> addAfter = new ArrayList<Block>();

    106. 

  106. 		

    107. 

  107. 		for (int z = 0; z < 4; z++) {

    108. 

  108. 			for (int y = 0; y < arr.length; y++) { 

    109. 

  109. 				for (int x = 0; x < 4; x++) {

    110. 

  110. 					int bid = arr[y][x][z];

    111. 

  111. 

    112. 

  112. 					if (bid == 65) {

    113. 

  113. 						int ladderRot = 2;

    114. 

  114. 						if (wb.r == 0) ladderRot = 3;

    115. 

  115. 						else if (wb.r == 1) ladderRot = 4;

    116. 

  116. 						else if (wb.r == 2) ladderRot = 2;

    117. 

  117. 						else if (wb.r == 3) ladderRot = 5;

    118. 

  118. 						addAfter.add(new Block(bid, (int)wb.p.x+x, (int)wb.p.y+y, (int)wb.p.z+z, ladderRot));

    119. 

  119. 					} else {

    120. 

  120. 						blockQueue.addWork(new Block(bid, (int)wb.p.x+x, (int)wb.p.y+y, (int)wb.p.z+z));

    121. 

  121. 					}

    122. 

  122. 				}

    123. 

  123. 			}

    124. 

  124. 		}

    125. 

  125. 		

    126. 

  126. 		for (Block block : addAfter)

    127. 

  127. 			blockQueue.addWork(block);

    128. 

  128. 	}

    129. 

  129. 	

    130. 

  130. 	public static Point lowestInGrid(long x, long z, int w, int h) {

    131. 

  131. 		int y;

    132. 

  132. 		int lowest = 127;

    133. 

  133. 		for (long iz = z; iz < z+h; iz++) {

    134. 

  134. 			for (long ix = x; ix < x+w; ix++) {

    135. 

  135. 				y = etc.getServer().getHighestBlockY((int)ix, (int)iz);

    136. 

  136. 				if (y < lowest)

    137. 

  137. 					lowest = y;

    138. 

  138. 			}

    139. 

  139. 		}

    140. 

  140. 		return new Point(x, lowest, z);

    141. 

  141. 	}

    142. 

  142. 	

    143. 

  143. 	public static boolean isPartOfTown(long x, long z, Town town) {

    144. 

  144. 		String key = x + "," + z;

    145. 

  145. 		TownBlock tb = TownyWorld.getInstance().townblocks.get(key);

    146. 

  146. 		if (tb != null && tb.town != null && tb.town == town)

    147. 

  147. 			return true;

    148. 

  148. 		return false;

    149. 

  149. 	}

    150. 

  150. 	

    151. 

  151. 	public static int[][][] getBuildArray(int b, int h, int type, int rotation) {

    152. 

  152. 		int s = 65; // Ladder

    153. 

  153. 		

    154. 

  154. 		int[][][] buildArray = {

    155. 

  155. 			// Wall section

    156. 

  156. 			{

    157. 

  157. 				{ 0, 0, 0, 0 },

    158. 

  158. 				{ b, b, b, b },

    159. 

  159. 				{ b, b, b, b },

    160. 

  160. 				{ 0, 0, 0, 0 }

    161. 

  161. 			},

    162. 

  162. 			// Wall walkway

    163. 

  163. 			{

    164. 

  164. 				{ b, b, b, b },

    165. 

  165. 				{ b, b, b, b },

    166. 

  166. 				{ b, b, b, b },

    167. 

  167. 				{ b, b, b, b }

    168. 

  168. 			},

    169. 

  169. 			// Wall section walkway wall

    170. 

  170. 			{

    171. 

  171. 				{ b, b, b, b },

    172. 

  172. 				{ 0, 0, 0, 0 },

    173. 

  173. 				{ 0, 0, 0, 0 },

    174. 

  174. 				{ b, b, b, b }

    175. 

  175. 			},

    176. 

  176. 			// Wall section walkway wall crenelation

    177. 

  177. 			{

    178. 

  178. 				{ 44, 0, 0, 44 },

    179. 

  179. 				{ 0, 0, 0, 0 },

    180. 

  180. 				{ 0, 0, 0, 0 },

    181. 

  181. 				{ 44, 0, 0, 44 }

    182. 

  182. 			},

    183. 

  183. 			// Turret wall (3 enemy sides)

    184. 

  184. 			{

    185. 

  185. 				{ 0, 0, 0, 0 },

    186. 

  186. 				{ 0, b, b, b },

    187. 

  187. 				{ 0, b, s, 0 },

    188. 

  188. 				{ 0, b, 0, 0 }

    189. 

  189. 			},

    190. 

  190. 			// Turret wall (1 enemy side)

    191. 

  191. 			{

    192. 

  192. 				{ 0, b, b, 0 },

    193. 

  193. 				{ b, b, b, 0 },

    194. 

  194. 				{ b, b, s, 0 },

    195. 

  195. 				{ 0, 0, 0, 0 }

    196. 

  196. 			},

    197. 

  197. 			// Turret walkway

    198. 

  198. 			{

    199. 

  199. 				{ b, b, b, b },

    200. 

  200. 				{ b, b, b, b },

    201. 

  201. 				{ b, b, s, b },

    202. 

  202. 				{ b, b, b, b }

    203. 

  203. 			},

    204. 

  204. 			// Turret wall (3 enemies) (is rotated twice to match (1 enemy)

    205. 

  205. 			{

    206. 

  206. 				{ b, b, b, b },

    207. 

  207. 				{ b, 0, 0, 0 },

    208. 

  208. 				{ b, 0, 0, 0 },

    209. 

  209. 				{ b, 0, 0, b }

    210. 

  210. 			},

    211. 

  211. 			// Wall section Afv. crenels

    212. 

  212. 			{

    213. 

  213. 				{ b, 0, 0, b },

    214. 

  214. 				{ b, b, b, b },

    215. 

  215. 				{ b, b, b, b },

    216. 

  216. 				{ 0, 0, 0, 0 }

    217. 

  217. 			},

    218. 

  218. 		};

    219. 

  219. 		

    220. 

  220. 		ArrayList<int[][]> out = new ArrayList<int[][]>();

    221. 

  221. 		int[][] layer;

    222. 

  222. 		// Walkway

    223. 

  223. 		if (type == 0) {

    224. 

  224. 			layer = rotate(buildArray[0], rotation);

    225. 

  225. 			for (int i = 0; i < h; i++)

    226. 

  226. 				out.add(layer);

    227. 

  227. 				

    228. 

  228. 			// Top Section

    229. 

  229. 			out.add(rotate(buildArray[8], rotation));

    230. 

  230. 			out.add(buildArray[1]); //No need to rotate the walkway

    231. 

  231. 			out.add(rotate(buildArray[2], rotation));

    232. 

  232. 			out.add(rotate(buildArray[3], rotation));

    233. 

  233. 		}

    234. 

  234. 		// Turret wall (3 enemy sides)

    235. 

  235. 		else if (type == 1) {

    236. 

  236. 			layer = rotate(buildArray[4], rotation);

    237. 

  237. 			for (int i = 0; i < h; i++)

    238. 

  238. 				out.add(layer);

    239. 

  239. 				

    240. 

  240. 			// Top Section

    241. 

  241. 			layer = rotate(buildArray[6], rotation);

    242. 

  242. 			for (int i=0;i<2;i++)

    243. 

  243. 				out.add(layer);

    244. 

  244. 			out.add(rotate(buildArray[7], rotation));

    245. 

  245. 			out.add(rotate(buildArray[3], rotation));

    246. 

  246. 		}

    247. 

  247. 		// Turret wall (1 enemy sides)

    248. 

  248. 		else if (type == 2) {

    249. 

  249. 			layer = rotate(buildArray[5], rotation);

    250. 

  250. 			for (int i = 0; i < h; i++)

    251. 

  251. 				out.add(layer);

    252. 

  252. 				

    253. 

  253. 			// Top Section

    254. 

  254. 			layer = rotate(buildArray[6], rotation);

    255. 

  255. 			for (int i=0;i<2;i++)

    256. 

  256. 				out.add(layer);

    257. 

  257. 			out.add(rotate(buildArray[7], rotation+2)); //rotate wall to fit

    258. 

  258. 			out.add(rotate(buildArray[3], rotation));

    259. 

  259. 		}

    260. 

  260. 		

    261. 

  261. 		int[][][] toReturn = new int[out.size()][4][4];

    262. 

  262. 		for (int z = 0; z < 4; z++) {

    263. 

  263. 			for (int y = 0; y < out.size(); y++) {

    264. 

  264. 				for (int x = 0; x < 4; x++) {

    265. 

  265. 					toReturn[y][x][z] = out.get(y)[x][z];

    266. 

  266. 				}

    267. 

  267. 			}

    268. 

  268. 		}

    269. 

  269. 		

    270. 

  270. 		return toReturn;

    271. 

  271. 		//return (int[][][])out.toArray();

    272. 

  272. 	}

    273. 

  273. 	

    274. 

  274. 	public static int[][] rotate(int[][] arr, int times) {

    275. 

  275. 		int[][] temp = arr.clone();

    276. 

  276. 		for (int i = 0; i < times; i++)

    277. 

  277. 			temp = rotateMatrixRight(temp);

    278. 

  278. 		return temp;

    279. 

  279. 	}

    280. 

  280. 	

    281. 

  281. 	// http://stackoverflow.com/questions/42519/how-do-you-rotate-a-two-dimensional-array

    282. 

  282. 	public static int[][] rotateMatrixRight(int[][] matrix) {

    283. 

  283. 		/* W and H are already swapped */

    284. 

  284. 		int w = matrix.length;

    285. 

  285. 		int h = matrix[0].length;

    286. 

  286. 		int[][] ret = new int[h][w];

    287. 

  287. 		for (int i = 0; i < h; ++i) {

    288. 

  288. 			for (int j = 0; j < w; ++j) {

    289. 

  289. 				ret[i][j] = matrix[w - j - 1][i];

    290. 

  290. 			}

    291. 

  291. 		}

    292. 

  292. 		return ret;

    293. 

  293. 	}

    294. 

  294. }
    295.