m/grafX2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Reverted r1477: 'Faster translucency effect when perfect matches are available'. When duplicates were available in the palette, it wasn't choosing always the same

Browse Source 
git-svn-id: svn://pulkomandy.tk/GrafX2/trunk@1575 416bcca6-2ee7-4201-b75f-2eb2f807beb1
This commit is contained in:
Yves Rizoud 2010-08-15 18:34:25 +00:00
parent c474208860
commit 1cad25e4b5
1 changed files with 3 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
src/windows.c
View File

@ -2625,22 +2625,14 @@ byte Best_color(byte r,byte g,byte b)
byte Best_color_nonexcluded(byte red,byte green,byte blue) byte Best_color_nonexcluded(byte red,byte green,byte blue)
{ {
// This "static" allows the loop to start on the last successful match. int col;
// If the same color is requested again (and it happens often) and the match
// was perfect, it allows an early exit that avoids
// 255 computations of color distance.
// This system still works with no bad effects when the palette changes.
static byte col=0;
byte end_color;
int delta_r,delta_g,delta_b; int delta_r,delta_g,delta_b;
int dist; int dist;
int best_dist=0x7FFFFFFF; int best_dist=0x7FFFFFFF;
int rmean; int rmean;
byte best_color=0; byte best_color=0;
end_color=col; for (col=0; col<256; col++)
do
{ {
delta_r=(int)Main_palette[col].R-red; delta_r=(int)Main_palette[col].R-red;
delta_g=(int)Main_palette[col].G-green; delta_g=(int)Main_palette[col].G-green;
@ -2658,11 +2650,7 @@ byte Best_color_nonexcluded(byte red,byte green,byte blue)
best_dist=dist; best_dist=dist;
best_color=col; best_color=col;
} }
}
// Loop
col++;
} while(col!=end_color);
return best_color; return best_color;
} }