mirror of
https://github.com/ZDoom/qzdoom.git
synced 2024-11-07 21:41:25 +00:00
80 lines
3.4 KiB
C++
80 lines
3.4 KiB
C++
/*
|
|
** colormatcher.h
|
|
**
|
|
**---------------------------------------------------------------------------
|
|
** Copyright 1998-2006 Randy Heit
|
|
** All rights reserved.
|
|
**
|
|
** Redistribution and use in source and binary forms, with or without
|
|
** modification, are permitted provided that the following conditions
|
|
** are met:
|
|
**
|
|
** 1. Redistributions of source code must retain the above copyright
|
|
** notice, this list of conditions and the following disclaimer.
|
|
** 2. Redistributions in binary form must reproduce the above copyright
|
|
** notice, this list of conditions and the following disclaimer in the
|
|
** documentation and/or other materials provided with the distribution.
|
|
** 3. The name of the author may not be used to endorse or promote products
|
|
** derived from this software without specific prior written permission.
|
|
**
|
|
** THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
** IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
** OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
** IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
** INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
** NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
** THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
**---------------------------------------------------------------------------
|
|
**
|
|
*/
|
|
|
|
#ifndef __COLORMATCHER_H__
|
|
#define __COLORMATCHER_H__
|
|
|
|
// This class implements a "pretty good" color matcher for palettized images.
|
|
// In many cases, it is able to choose the "best" color with only a few
|
|
// comparisons. In all other cases, it chooses an "almost best" color in only
|
|
// a few comparisons. This is much faster than scanning the entire palette
|
|
// when you want to pick a color, so the somewhat lesser quality should be
|
|
// acceptable unless quality is the highest priority.
|
|
//
|
|
// The reason for the lesser quality is because this algorithm stores groups
|
|
// of colors into cells in a color cube and then spreads those color groups
|
|
// around into neighboring cells. When asked to pick a color, it looks in a
|
|
// single cell and sees which of the colors stored in that cell is closest
|
|
// to the requested color. For borderline cases, the chosen color may not
|
|
// actually be the best color in the entire palette, but it is still close.
|
|
//
|
|
// The accuracy of this class depends on the input palette and on HIBITS.
|
|
// HIBITS 4 seems to be a reasonable compromise between preprocessing time,
|
|
// space, and accuracy.
|
|
|
|
class FColorMatcher
|
|
{
|
|
public:
|
|
FColorMatcher ();
|
|
FColorMatcher (const DWORD *palette);
|
|
FColorMatcher (const FColorMatcher &other);
|
|
|
|
void SetPalette (const DWORD *palette);
|
|
byte Pick (int r, int g, int b);
|
|
FColorMatcher &operator= (const FColorMatcher &other);
|
|
|
|
private:
|
|
enum { CHIBITS=4, CLOBITS=8-CHIBITS, CHISIZE=1<<CHIBITS, CLOSIZE=1<<CLOBITS};
|
|
struct Seed;
|
|
struct PalEntry;
|
|
|
|
const PalEntry *Pal;
|
|
byte FirstColor[CHISIZE+1][CHISIZE+1][CHISIZE+1];
|
|
byte NextColor[256];
|
|
|
|
int FillPlane (int r1, int r2, int g1, int g2, int b1, int b2,
|
|
byte seedspread[CHISIZE+1][CHISIZE+1][CHISIZE+1],
|
|
Seed *seeds, int thisseed);
|
|
};
|
|
|
|
#endif //__COLORMATCHER_H__
|