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

Finished working on the new color lookup system.

Browse Source 
There is room for optimization and maybe bugfixing.
The cluster table size is now:
511*15 = 7665bytes, this is 1094 times better than the color table.

Please test and report your results !


git-svn-id: svn://pulkomandy.tk/GrafX2/trunk@1874 416bcca6-2ee7-4201-b75f-2eb2f807beb1
This commit is contained in:
Adrien Destugues
2011-11-22 21:38:03 +00:00
parent 91e7d459a3
commit d3a107bb7c
6 changed files with 178 additions and 262 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/colorred.h
View File

@@ -46,18 +46,26 @@ typedef struct CT_Node_s
byte Gmax;
byte Bmax;
// possible optimization: a cluster has either two childs or a color index.
// if the first child is NULL, then the other can be used to store the index
// when the tree is being built, a node may have child0 set and not child1, but not the reverse)
// possible optimization: there can't be more than 511 clusters in the tree
// for a 256 color picture, so use int16 as pointers and store everything in a table :
// * makes them smaller
// * helps with cache locality
// palette index (valid iff any child is NULL)
byte index;
// child nodes
struct CT_Node_s* children[8];
//rgb rgB rGb rGB Rgb RgB RGb RGB
struct CT_Node_s* children[2];
} CT_Node;
CT_Node* CT_new();
void CT_delete(CT_Node* t);
byte CT_get(CT_Node* t,byte r,byte g,byte b);
void CT_set(CT_Node* colorTree, byte Rmin, byte Gmin, byte Bmin,
void CT_set(CT_Node** colorTree, byte Rmin, byte Gmin, byte Bmin,
byte Rmax, byte Gmax, byte Bmax, byte index);
#endif