V0.1.0 Partial Commit
changed package and application names to differentiate from main PD release
This commit is contained in:
Evan Debenham
@@ -0,0 +1,98 @@
|
||||
/*
|
||||
* Pixel Dungeon
|
||||
* Copyright (C) 2012-2014 Oleg Dolya
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>
|
||||
*/
|
||||
package com.shatteredpixel.shatteredpixeldungeon.mechanics;
|
||||
|
||||
import com.shatteredpixel.shatteredpixeldungeon.actors.Actor;
|
||||
import com.shatteredpixel.shatteredpixeldungeon.levels.Level;
|
||||
|
||||
public class Ballistica {
|
||||
|
||||
public static int[] trace = new int[Math.max( Level.WIDTH, Level.HEIGHT )];
|
||||
public static int distance;
|
||||
|
||||
public static int cast( int from, int to, boolean magic, boolean hitChars ) {
|
||||
|
||||
int w = Level.WIDTH;
|
||||
|
||||
int x0 = from % w;
|
||||
int x1 = to % w;
|
||||
int y0 = from / w;
|
||||
int y1 = to / w;
|
||||
|
||||
int dx = x1 - x0;
|
||||
int dy = y1 - y0;
|
||||
|
||||
int stepX = dx > 0 ? +1 : -1;
|
||||
int stepY = dy > 0 ? +1 : -1;
|
||||
|
||||
dx = Math.abs( dx );
|
||||
dy = Math.abs( dy );
|
||||
|
||||
int stepA;
|
||||
int stepB;
|
||||
int dA;
|
||||
int dB;
|
||||
|
||||
if (dx > dy) {
|
||||
|
||||
stepA = stepX;
|
||||
stepB = stepY * w;
|
||||
dA = dx;
|
||||
dB = dy;
|
||||
|
||||
} else {
|
||||
|
||||
stepA = stepY * w;
|
||||
stepB = stepX;
|
||||
dA = dy;
|
||||
dB = dx;
|
||||
|
||||
}
|
||||
|
||||
distance = 1;
|
||||
trace[0] = from;
|
||||
|
||||
int cell = from;
|
||||
|
||||
int err = dA / 2;
|
||||
while (cell != to || magic) {
|
||||
|
||||
cell += stepA;
|
||||
|
||||
err += dB;
|
||||
if (err >= dA) {
|
||||
err = err - dA;
|
||||
cell = cell + stepB;
|
||||
}
|
||||
|
||||
trace[distance++] = cell;
|
||||
|
||||
if (!Level.passable[cell] && !Level.avoid[cell]) {
|
||||
return trace[--distance - 1];
|
||||
}
|
||||
|
||||
if (Level.losBlocking[cell] || (hitChars && Actor.findChar( cell ) != null)) {
|
||||
return cell;
|
||||
}
|
||||
}
|
||||
|
||||
trace[distance++] = cell;
|
||||
|
||||
return to;
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,152 @@
|
||||
/*
|
||||
* Pixel Dungeon
|
||||
* Copyright (C) 2012-2014 Oleg Dolya
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>
|
||||
*/
|
||||
package com.shatteredpixel.shatteredpixeldungeon.mechanics;
|
||||
|
||||
import java.util.Arrays;
|
||||
|
||||
import com.shatteredpixel.shatteredpixeldungeon.levels.Level;
|
||||
|
||||
public final class ShadowCaster {
|
||||
|
||||
private static final int MAX_DISTANCE = 8;
|
||||
|
||||
private static final int WIDTH = Level.WIDTH;
|
||||
private static final int HEIGHT = Level.HEIGHT;
|
||||
|
||||
private static int distance;
|
||||
private static int limits[];
|
||||
|
||||
private static boolean[] losBlocking;
|
||||
private static boolean[] fieldOfView;
|
||||
|
||||
private static int[][] rounding;
|
||||
static {
|
||||
rounding = new int[MAX_DISTANCE+1][];
|
||||
for (int i=1; i <= MAX_DISTANCE; i++) {
|
||||
rounding[i] = new int[i+1];
|
||||
for (int j=1; j <= i; j++) {
|
||||
rounding[i][j] = (int)Math.min( j, Math.round( i * Math.cos( Math.asin( j / (i + 0.5) ))));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
private static Obstacles obs = new Obstacles();
|
||||
|
||||
public static void castShadow( int x, int y, boolean[] fieldOfView, int distance ) {
|
||||
|
||||
losBlocking = Level.losBlocking;
|
||||
|
||||
ShadowCaster.distance = distance;
|
||||
limits = rounding[distance];
|
||||
|
||||
ShadowCaster.fieldOfView = fieldOfView;
|
||||
Arrays.fill( fieldOfView, false );
|
||||
fieldOfView[y * WIDTH + x] = true;
|
||||
|
||||
scanSector( x, y, +1, +1, 0, 0 );
|
||||
scanSector( x, y, -1, +1, 0, 0 );
|
||||
scanSector( x, y, +1, -1, 0, 0 );
|
||||
scanSector( x, y, -1, -1, 0, 0 );
|
||||
scanSector( x, y, 0, 0, +1, +1 );
|
||||
scanSector( x, y, 0, 0, -1, +1 );
|
||||
scanSector( x, y, 0, 0, +1, -1 );
|
||||
scanSector( x, y, 0, 0, -1, -1 );
|
||||
}
|
||||
|
||||
private static void scanSector( int cx, int cy, int m1, int m2, int m3, int m4 ) {
|
||||
|
||||
obs.reset();
|
||||
|
||||
for (int p=1; p <= distance; p++) {
|
||||
|
||||
float dq2 = 0.5f / p;
|
||||
|
||||
int pp = limits[p];
|
||||
for (int q=0; q <= pp; q++) {
|
||||
|
||||
int x = cx + q * m1 + p * m3;
|
||||
int y = cy + p * m2 + q * m4;
|
||||
|
||||
if (y >= 0 && y < HEIGHT && x >= 0 && x < WIDTH) {
|
||||
|
||||
float a0 = (float)q / p;
|
||||
float a1 = a0 - dq2;
|
||||
float a2 = a0 + dq2;
|
||||
|
||||
int pos = y * WIDTH + x;
|
||||
|
||||
if (obs.isBlocked( a0 ) && obs.isBlocked( a1 ) && obs.isBlocked( a2 )) {
|
||||
|
||||
} else {
|
||||
fieldOfView[pos] = true;
|
||||
}
|
||||
|
||||
if (losBlocking[pos]) {
|
||||
obs.add( a1, a2 );
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
obs.nextRow();
|
||||
}
|
||||
}
|
||||
|
||||
private static final class Obstacles {
|
||||
|
||||
private static int SIZE = (MAX_DISTANCE+1) * (MAX_DISTANCE+1) / 2;
|
||||
private static float[] a1 = new float[SIZE];
|
||||
private static float[] a2 = new float[SIZE];
|
||||
|
||||
private int length;
|
||||
private int limit;
|
||||
|
||||
public void reset() {
|
||||
length = 0;
|
||||
limit = 0;
|
||||
}
|
||||
|
||||
public void add( float o1, float o2 ) {
|
||||
|
||||
if (length > limit && o1 <= a2[length-1]) {
|
||||
|
||||
a2[length-1] = o2;
|
||||
|
||||
} else {
|
||||
|
||||
a1[length] = o1;
|
||||
a2[length++] = o2;
|
||||
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
public boolean isBlocked( float a ) {
|
||||
for (int i=0; i < limit; i++) {
|
||||
if (a >= a1[i] && a <= a2[i]) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
public void nextRow() {
|
||||
limit = length;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user