我定义了这个简单的方法:
public static boolean isBorder(int x, int y) throws CollisionDetectionException {
try {
if ( (levelItems[x][y] instanceof StaticGameObject && levelItems[x][y].isVisible()) ||
(levelItems[x-1][y] instanceof StaticGameObject && levelItems[x-1][y].isVisible()) ||
(levelItems[x][y+1] instanceof StaticGameObject && levelItems[x][y+1].isVisible()) ||
(levelItems[x][y-1] instanceof StaticGameObject && levelItems[x][y-1].isVisible()) ||
(levelItems[x-1][y-1] instanceof StaticGameObject && levelItems[x-1][y-1].isVisible()) ||
(levelItems[x-1][y+1] instanceof StaticGameObject &&levelItems[x-1][y+1].isVisible()) ||
(levelItems[x+1][y] instanceof StaticGameObject && levelItems[x+1][y].isVisible()) ||
(levelItems[x+1][y+1] instanceof StaticGameObject && levelItems[x+1][y+1].isVisible()) ||
(levelItems[x+1][y-1] instanceof StaticGameObject && levelItems[x+1][y-1].isVisible()) ) {
return true;
} else {
return false;
}
} catch (ArrayIndexOutOfBoundsException e) {
throw new CollisionDetectionException("Collision couldn't be checked because checking position " + x + "/" + y + " caluclated values below (0/0)");
}
}
Run Code Online (Sandbox Code Playgroud)
如你所见,我有一个2维数组.现在我想检查一个特定的位置((x/y) - >方法参数),如果在2维数组的相邻字段中有任何可见的StaticGameObject.
levelItems数组由所谓的GameObject组成.StaticGameObject是GameObject的直接子类.
任何提示如何改进这种方法?
Lou*_*nco 13
向GameObject添加方法
bool isBorderObject() { return false; }
Run Code Online (Sandbox Code Playgroud)
然后在StaticGameObject中覆盖
bool isBorderObject() { return true; }
Run Code Online (Sandbox Code Playgroud)
将测试更改为
(levelItems[x][y].isBorderObject() && levelItems[x][y].isVisible())
Run Code Online (Sandbox Code Playgroud)
此外,if可能是嵌套的
for (int i = x-1; i <= x+1; ++i) {
for (int j = y-1; j <= y+1; ++j) {
GameObject item = levelItems[i][j];
if (item.isBorderObject() && item.isVisible())
return true;
}
}
return false;
Run Code Online (Sandbox Code Playgroud)