|
Classes |
struct | acolorhist_item |
struct | acolorhist_list_item |
struct | acolorhash_hash |
struct | error_t |
struct | box |
Defines |
#define | PAM_GETR(p) ((p)[0]) |
#define | PAM_GETG(p) ((p)[1]) |
#define | PAM_GETB(p) ((p)[2]) |
#define | PAM_GETA(p) ((p)[3]) |
#define | PAM_ASSIGN(p, red, grn, blu, alf) do { (p)[0] = (red); (p)[1] = (grn); (p)[2] = (blu); (p)[3] = (alf); } while (0) |
#define | PAM_EQUAL(p, q) ((p)[0] == (q)[0] && (p)[1] == (q)[1] && (p)[2] == (q)[2] && (p)[3] == (q)[3]) |
#define | PAM_DEPTH(newp, p, oldmaxval, newmaxval) |
#define | MAXCOLORS 32767 |
#define | FS_SCALE 1024 /* Floyd-Steinberg scaling factor */ |
#define | REP_AVERAGE_PIXELS |
#define | HASH_SIZE 20023 |
#define | pam_hashapixel(p) |
Typedefs |
typedef uint8_t | pixval |
typedef uint8_t | apixel [4] |
typedef acolorhist_list_item * | acolorhist_list |
typedef box * | box_vector |
Functions |
acolorhist_item * | mediancut (acolorhist_item *achv, int colors, int sum, int maxval, int newcolors) |
bool | redcompare (const acolorhist_item &ch1, const acolorhist_item &ch2) |
bool | greencompare (const acolorhist_item &ch1, const acolorhist_item &ch2) |
bool | bluecompare (const acolorhist_item &ch1, const acolorhist_item &ch2) |
bool | alphacompare (const acolorhist_item &ch1, const acolorhist_item &ch2) |
acolorhist_item * | pam_computeacolorhist (const RageSurface *src, int maxacolors, int *acolorsP) |
void | pam_addtoacolorhash (acolorhash_hash &acht, const uint8_t acolorP[4], int value) |
int | pam_lookupacolor (const acolorhash_hash &acht, const uint8_t acolorP[4]) |
void | pam_freeacolorhist (acolorhist_item *achv) |
bool | CompareBySumDescending (const box &b1, const box &b2) |
bool | pam_computeacolorhash (const RageSurface *src, int maxacolors, int *acolorsP, acolorhash_hash &hash) |
acolorhist_item * | pam_acolorhashtoacolorhist (const acolorhash_hash &acht, int maxacolors) |