17644a5778
of default tiles and their zoomed counterparts (saves reloading the default tile, and keeps the scale levels of the map consistent during a fullrender and otherwise)
101 lines
3.2 KiB
Java
101 lines
3.2 KiB
Java
package org.dynmap.kzedmap;
|
|
|
|
import java.awt.Color;
|
|
import java.util.HashSet;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
|
|
import org.bukkit.World;
|
|
|
|
public class HighlightTileRenderer extends DefaultTileRenderer {
|
|
protected HashSet<Integer> highlightBlocks = new HashSet<Integer>();
|
|
|
|
public HighlightTileRenderer(Map<String, Object> configuration) {
|
|
super(configuration);
|
|
Object highlightObj = configuration.get("highlight");
|
|
if (highlightObj instanceof List<?>) {
|
|
for(Object o : (List<?>)highlightObj) {
|
|
highlightBlocks.add((Integer)o);
|
|
}
|
|
} else if (highlightObj instanceof Integer) {
|
|
highlightBlocks.add((Integer)highlightObj);
|
|
}
|
|
}
|
|
|
|
@Override
|
|
protected Color scan(World world, int x, int y, int z, int seq) {
|
|
Color result = translucent;
|
|
for (;;) {
|
|
if (y < 0) {
|
|
break;
|
|
}
|
|
|
|
int id = world.getBlockTypeIdAt(x, y, z);
|
|
byte data = 0;
|
|
if(colorScheme.datacolors[id] != null) { /* If data colored */
|
|
data = world.getBlockAt(x, y, z).getData();
|
|
}
|
|
|
|
switch (seq) {
|
|
case 0:
|
|
x--;
|
|
break;
|
|
case 1:
|
|
y--;
|
|
break;
|
|
case 2:
|
|
z++;
|
|
break;
|
|
case 3:
|
|
y--;
|
|
break;
|
|
}
|
|
|
|
seq = (seq + 1) & 3;
|
|
|
|
if (id != 0) {
|
|
Color[] colors;
|
|
if(data != 0)
|
|
colors = colorScheme.datacolors[id][data];
|
|
else
|
|
colors = colorScheme.colors[id];
|
|
if (colors != null) {
|
|
Color c = colors[seq];
|
|
|
|
if (highlightBlocks.contains(id)) {
|
|
return c;
|
|
}
|
|
|
|
if (c.getAlpha() > 0) {
|
|
|
|
/* we found something that isn't transparent! */
|
|
/*
|
|
* if (c.getAlpha() == 255) { return c; }
|
|
*/
|
|
/* this block is transparent, so recurse */
|
|
|
|
// No need to blend if result is opaque.
|
|
if (result.getAlpha() < 255) {
|
|
Color bg = c;
|
|
c = result;
|
|
|
|
int cr = c.getRed();
|
|
int cg = c.getGreen();
|
|
int cb = c.getBlue();
|
|
int ca = c.getAlpha();
|
|
cr *= ca;
|
|
cg *= ca;
|
|
cb *= ca;
|
|
int na = 255 - ca;
|
|
|
|
result = new Color((bg.getRed() * na + cr) >> 8, (bg.getGreen() * na + cg) >> 8, (bg.getBlue() * na + cb) >> 8,
|
|
Math.min(255, bg.getAlpha()+c.getAlpha()) // Not really correct, but gets the job done without recursion while still looking ok.
|
|
);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
}
|