repositories
/
SugarCubes.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Few tiny cleanups
[SugarCubes.git]
/
_Mappings.pde
diff --git
a/_Mappings.pde
b/_Mappings.pde
index b7b6a86d483279fa9fbcc1973f9b089b297ee39d..8798fb59fea91797853017ed978d5ad191538e71 100644
(file)
--- a/
_Mappings.pde
+++ b/
_Mappings.pde
@@
-24,7
+24,6
@@
static final float FLOOR = 0;
* The second value is the offset moving NW (negative comes forward-right).
*/
static final float[][] TOWER_CONFIG = new float[][] {
* The second value is the offset moving NW (negative comes forward-right).
*/
static final float[][] TOWER_CONFIG = new float[][] {
- // x, z, y, #
new float[] { 0, 0, RISER, 4 },
new float[] { 25, -10, RISER, 4 },
new float[] { 50, -22.5, FLOOR, 5 },
new float[] { 0, 0, RISER, 4 },
new float[] { 25, -10, RISER, 4 },
new float[] { 50, -22.5, FLOOR, 5 },
@@
-39,11
+38,6
@@
static final float[][] TOWER_CONFIG = new float[][] {
public Model buildModel() {
public Model buildModel() {
- // TODO: (Mark Slee, Alex Green, or Ben Morrow): The Cube # is determined by the order in this list.
- // "raw object index" is serialized by running through towermapping and then individual cube mapping below.
- // We can do better than this. The raw object index should be obvious from the code-- looking through the
- // rendered simulation and counting through cubes in mapping mode is grossly inefficient.
-
List<Tower> towers = new ArrayList<Tower>();
Cube[] cubes = new Cube[200];
int cubeIndex = 1;
List<Tower> towers = new ArrayList<Tower>();
Cube[] cubes = new Cube[200];
int cubeIndex = 1;