本文整理汇总了Java中ethanjones.cubes.world.storage.Area.getLight方法的典型用法代码示例。如果您正苦于以下问题：Java Area.getLight方法的具体用法？Java Area.getLight怎么用？Java Area.getLight使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类ethanjones.cubes.world.storage.Area的用法示例。
在下文中一共展示了Area.getLight方法的8个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: removeLight
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
public static void removeLight(int x, int y, int z, Area area, LightWorldSection lws) {
if (y > 0 && y <= area.maxY) {
ArrayDeque<LightNode> removeQueue = new ArrayDeque<LightNode>(1000);
ArrayDeque<LightNode> addQueue = new ArrayDeque<LightNode>(1000);
int prev = area.getLight(x - area.minBlockX, y, z - area.minBlockZ);
area.setLight(x - area.minBlockX, y, z - area.minBlockZ, 0);
removeQueue.add(new LightNode(x, y, z, prev));
propagateRemove(removeQueue, addQueue, lws);
propagateAdd(addQueue, lws);
}
}
示例2: randomTick
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
@Override
public int randomTick(World world, Area area, int x, int y, int z, int meta) {
if ((world.isDay() && area.getSunlight(x, y + 1, z) >= 10) || area.getLight(x, y + 1, z) >= 10) {
if (meta >= 7) {
new TreeGenerator().generateTree(x + area.minBlockX, y, z + area.minBlockZ,
3 + ThreadRandom.get().nextInt(3), area);
} else {
meta++;
}
}
return meta;
}
示例3: validGrass
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
private boolean validGrass(World world, Area area, int x, int y, int z, boolean skipTimeCheck) {
Block above = area.getBlock(x, y + 1, z);
int aboveMeta = area.getMeta(x, y + 1, z);
if (above != null && !above.isTransparent(aboveMeta)) {
return false;
} else if (((skipTimeCheck || world.isDay()) && area.getSunlight(x, y + 1, z) >= 10)
|| area.getLight(x, y + 1, z) >= 10) {
return true;
}
return false;
}
示例4: removeLight
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
public static void removeLight(int x, int y, int z, Area area, LightWorldSection lws) {
if (y > 0 && y <= area.maxY) {
ArrayDeque<LightNode> removeQueue = new ArrayDeque<LightNode>(1000);
ArrayDeque<LightNode> addQueue = new ArrayDeque<LightNode>(1000);
int prev = area.getLight(x - area.minBlockX, y, z - area.minBlockZ);
area.setLight(x - area.minBlockX, y, z - area.minBlockZ, 0);
removeQueue.add(new LightNode(x, y, z, prev));
propagateRemove(removeQueue, addQueue, lws);
propagateAdd(addQueue, lws);
}
}
示例5: randomTick
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
@Override
public int randomTick(World world, Area area, int x, int y, int z, int meta) {
if ((world.isDay() && area.getSunlight(x, y + 1, z) >= 10) || area.getLight(x, y + 1, z) >= 10) {
if (meta >= 7) {
new TreeGenerator().generateTree(x + area.minBlockX, y, z + area.minBlockZ, 3 + ThreadRandom.get().nextInt(3), area);
} else {
meta++;
}
}
return meta;
}
示例6: validGrass
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
private boolean validGrass(World world, Area area, int x, int y, int z, boolean skipTimeCheck) {
Block above = area.getBlock(x, y + 1, z);
int aboveMeta = area.getMeta(x, y + 1, z);
if (above != null && !above.isTransparent(aboveMeta)) {
return false;
} else if (((skipTimeCheck || world.isDay()) && area.getSunlight(x, y + 1, z) >= 10) || area.getLight(x, y + 1, z) >= 10) {
return true;
}
return false;
}
示例7: getLight
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
public int getLight(int x, int y, int z) {
Area area = getArea(CoordinateConverter.area(x), CoordinateConverter.area(z));
return area == null || y < 0 || y > area.maxY ? 0 : area.getLight(x - area.minBlockX, y, z - area.minBlockZ);
}
示例8: getLight
import ethanjones.cubes.world.storage.Area; //导入方法依赖的package包/类
public int getLight(int x, int y, int z) {
Area area = getArea(CoordinateConverter.area(x), CoordinateConverter.area(z));
return area == null || y < 0 || y > area.maxY ? 0 : area.getLight(x - area.minBlockX, y, z - area.minBlockZ);
}