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

Improve XOR table computation.

Browse Source 
Set the initial state to XOR[i]=i, so that on very low color images, the algorithm will try 
to swap around the first colors.


git-svn-id: svn://pulkomandy.tk/GrafX2/trunk@2049 416bcca6-2ee7-4201-b75f-2eb2f807beb1
This commit is contained in:
Adrien Destugues 2013-02-02 08:38:08 +00:00
parent 878c926ce4
commit 1dce247656
2 changed files with 1 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/palette.c
View File

@ -841,7 +841,6 @@ void Draw_all_palette_sliders(T_Scroller_button * red_slider,
{ {
RGB_to_HSL(j1,j2,j3,&j1,&j2,&j3); RGB_to_HSL(j1,j2,j3,&j1,&j2,&j3);
} }
DEBUG("j1",j1);
Format_component(j1*Color_count/256,str); Format_component(j1*Color_count/256,str);
red_slider->Position=Color_max-Expand_component(j1); red_slider->Position=Color_max-Expand_component(j1);
Window_draw_slider(red_slider); Window_draw_slider(red_slider);

12
src/windows.c
View File

@ -2972,22 +2972,12 @@ static void compute_xor_table()
// Initialize the table with some "random" values // Initialize the table with some "random" values
for(i = 0; i < 256; i++) for(i = 0; i < 256; i++)
{ {
xor_lut[i] = 255 - i; xor_lut[i] = i;
} }
do { do {
// Find the smallest difference in the table // Find the smallest difference in the table
//int mindiff = INT_MAX;
int idx; int idx;
/*
for(i = 0; i < 256; i++)
{
int diff = Diff(i, xor_lut[i]);
if (diff < mindiff) {
idx = i;
mindiff = diff;
}
}*/
// Try to pair these two colors better // Try to pair these two colors better
found = 0; found = 0;