mirror of
https://github.com/1dot13/source.git
synced 2026-07-22 13:40:22 +02:00
Merged New Inventory Project into main branch
git-svn-id: https://ja2svn.mooo.com/source/ja2/trunk/GameSource/ja2_v1.13/Build@1871 3b4a5df2-a311-0410-b5c6-a8a6f20db521
This commit is contained in:
lalien
+134
-134
@@ -10,199 +10,199 @@
|
||||
|
||||
CQuantizer::CQuantizer (UINT nMaxColors, UINT nColorBits)
|
||||
{
|
||||
m_pTree = NULL;
|
||||
m_nLeafCount = 0;
|
||||
for (int i=0; i<=(int) nColorBits; i++)
|
||||
m_pReducibleNodes[i] = NULL;
|
||||
m_nMaxColors = nMaxColors;
|
||||
m_nColorBits = nColorBits;
|
||||
m_pTree = NULL;
|
||||
m_nLeafCount = 0;
|
||||
for (int i=0; i<=(int) nColorBits; i++)
|
||||
m_pReducibleNodes[i] = NULL;
|
||||
m_nMaxColors = nMaxColors;
|
||||
m_nColorBits = nColorBits;
|
||||
}
|
||||
|
||||
CQuantizer::~CQuantizer ()
|
||||
{
|
||||
if (m_pTree != NULL)
|
||||
DeleteTree (&m_pTree);
|
||||
if (m_pTree != NULL)
|
||||
DeleteTree (&m_pTree);
|
||||
}
|
||||
|
||||
BOOL CQuantizer::ProcessImage (BYTE *pData, int iWidth, int iHeight )
|
||||
{
|
||||
BYTE* pbBits;
|
||||
BYTE r, g, b;
|
||||
int i, j;
|
||||
BYTE* pbBits;
|
||||
BYTE r, g, b;
|
||||
int i, j;
|
||||
|
||||
|
||||
pbBits = (BYTE*)pData;
|
||||
for (i=0; i<iHeight; i++) {
|
||||
for (j=0; j<iWidth; j++) {
|
||||
b = *pbBits++;
|
||||
g = *pbBits++;
|
||||
r = *pbBits++;
|
||||
AddColor (&m_pTree, r, g, b, m_nColorBits, 0, &m_nLeafCount,
|
||||
m_pReducibleNodes);
|
||||
while (m_nLeafCount > m_nMaxColors)
|
||||
ReduceTree (m_nColorBits, &m_nLeafCount, m_pReducibleNodes);
|
||||
}
|
||||
pbBits = (BYTE*)pData;
|
||||
for (i=0; i<iHeight; i++) {
|
||||
for (j=0; j<iWidth; j++) {
|
||||
b = *pbBits++;
|
||||
g = *pbBits++;
|
||||
r = *pbBits++;
|
||||
AddColor (&m_pTree, r, g, b, m_nColorBits, 0, &m_nLeafCount,
|
||||
m_pReducibleNodes);
|
||||
while (m_nLeafCount > m_nMaxColors)
|
||||
ReduceTree (m_nColorBits, &m_nLeafCount, m_pReducibleNodes);
|
||||
}
|
||||
//Padding
|
||||
//pbBits ++;
|
||||
}
|
||||
return TRUE;
|
||||
//pbBits ++;
|
||||
}
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
int CQuantizer::GetLeftShiftCount (DWORD dwVal)
|
||||
{
|
||||
int nCount = 0;
|
||||
for (int i=0; i<sizeof (DWORD) * 8; i++) {
|
||||
if (dwVal & 1)
|
||||
nCount++;
|
||||
dwVal >>= 1;
|
||||
}
|
||||
return (8 - nCount);
|
||||
int nCount = 0;
|
||||
for (int i=0; i<sizeof (DWORD) * 8; i++) {
|
||||
if (dwVal & 1)
|
||||
nCount++;
|
||||
dwVal >>= 1;
|
||||
}
|
||||
return (8 - nCount);
|
||||
}
|
||||
|
||||
int CQuantizer::GetRightShiftCount (DWORD dwVal)
|
||||
{
|
||||
for (int i=0; i<sizeof (DWORD) * 8; i++) {
|
||||
if (dwVal & 1)
|
||||
return i;
|
||||
dwVal >>= 1;
|
||||
}
|
||||
return -1;
|
||||
for (int i=0; i<sizeof (DWORD) * 8; i++) {
|
||||
if (dwVal & 1)
|
||||
return i;
|
||||
dwVal >>= 1;
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
void CQuantizer::AddColor (NODE** ppNode, BYTE r, BYTE g, BYTE b,
|
||||
UINT nColorBits, UINT nLevel, UINT* pLeafCount, NODE** pReducibleNodes)
|
||||
UINT nColorBits, UINT nLevel, UINT* pLeafCount, NODE** pReducibleNodes)
|
||||
{
|
||||
static BYTE mask[8] = { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 };
|
||||
static BYTE mask[8] = { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 };
|
||||
|
||||
//
|
||||
// If the node doesn't exist, create it.
|
||||
//
|
||||
if (*ppNode == NULL)
|
||||
*ppNode = CreateNode (nLevel, nColorBits, pLeafCount,
|
||||
pReducibleNodes);
|
||||
//
|
||||
// If the node doesn't exist, create it.
|
||||
//
|
||||
if (*ppNode == NULL)
|
||||
*ppNode = CreateNode (nLevel, nColorBits, pLeafCount,
|
||||
pReducibleNodes);
|
||||
|
||||
//
|
||||
// Update color information if it's a leaf node.
|
||||
//
|
||||
if ((*ppNode)->bIsLeaf) {
|
||||
(*ppNode)->nPixelCount++;
|
||||
(*ppNode)->nRedSum += r;
|
||||
(*ppNode)->nGreenSum += g;
|
||||
(*ppNode)->nBlueSum += b;
|
||||
}
|
||||
//
|
||||
// Update color information if it's a leaf node.
|
||||
//
|
||||
if ((*ppNode)->bIsLeaf) {
|
||||
(*ppNode)->nPixelCount++;
|
||||
(*ppNode)->nRedSum += r;
|
||||
(*ppNode)->nGreenSum += g;
|
||||
(*ppNode)->nBlueSum += b;
|
||||
}
|
||||
|
||||
//
|
||||
// Recurse a level deeper if the node is not a leaf.
|
||||
//
|
||||
else {
|
||||
int shift = 7 - nLevel;
|
||||
int nIndex = (((r & mask[nLevel]) >> shift) << 2) |
|
||||
(((g & mask[nLevel]) >> shift) << 1) |
|
||||
((b & mask[nLevel]) >> shift);
|
||||
AddColor (&((*ppNode)->pChild[nIndex]), r, g, b, nColorBits,
|
||||
nLevel + 1, pLeafCount, pReducibleNodes);
|
||||
}
|
||||
//
|
||||
// Recurse a level deeper if the node is not a leaf.
|
||||
//
|
||||
else {
|
||||
int shift = 7 - nLevel;
|
||||
int nIndex = (((r & mask[nLevel]) >> shift) << 2) |
|
||||
(((g & mask[nLevel]) >> shift) << 1) |
|
||||
((b & mask[nLevel]) >> shift);
|
||||
AddColor (&((*ppNode)->pChild[nIndex]), r, g, b, nColorBits,
|
||||
nLevel + 1, pLeafCount, pReducibleNodes);
|
||||
}
|
||||
}
|
||||
|
||||
NODE* CQuantizer::CreateNode (UINT nLevel, UINT nColorBits, UINT* pLeafCount,
|
||||
NODE** pReducibleNodes)
|
||||
NODE** pReducibleNodes)
|
||||
{
|
||||
NODE* pNode;
|
||||
NODE* pNode;
|
||||
|
||||
if ((pNode = (NODE*) HeapAlloc (GetProcessHeap (), HEAP_ZERO_MEMORY,
|
||||
sizeof (NODE))) == NULL)
|
||||
return NULL;
|
||||
if ((pNode = (NODE*) HeapAlloc (GetProcessHeap (), HEAP_ZERO_MEMORY,
|
||||
sizeof (NODE))) == NULL)
|
||||
return NULL;
|
||||
|
||||
pNode->bIsLeaf = (nLevel == nColorBits) ? TRUE : FALSE;
|
||||
if (pNode->bIsLeaf)
|
||||
(*pLeafCount)++;
|
||||
else {
|
||||
pNode->pNext = pReducibleNodes[nLevel];
|
||||
pReducibleNodes[nLevel] = pNode;
|
||||
}
|
||||
return pNode;
|
||||
pNode->bIsLeaf = (nLevel == nColorBits) ? TRUE : FALSE;
|
||||
if (pNode->bIsLeaf)
|
||||
(*pLeafCount)++;
|
||||
else {
|
||||
pNode->pNext = pReducibleNodes[nLevel];
|
||||
pReducibleNodes[nLevel] = pNode;
|
||||
}
|
||||
return pNode;
|
||||
}
|
||||
|
||||
void CQuantizer::ReduceTree (UINT nColorBits, UINT* pLeafCount,
|
||||
NODE** pReducibleNodes)
|
||||
NODE** pReducibleNodes)
|
||||
{
|
||||
//
|
||||
// Find the deepest level containing at least one reducible node.
|
||||
//
|
||||
//
|
||||
// Find the deepest level containing at least one reducible node.
|
||||
//
|
||||
int i = 0;
|
||||
|
||||
for (i=nColorBits - 1; (i>0) && (pReducibleNodes[i] == NULL); i--);
|
||||
for (i=nColorBits - 1; (i>0) && (pReducibleNodes[i] == NULL); i--);
|
||||
|
||||
//
|
||||
// Reduce the node most recently added to the list at level i.
|
||||
//
|
||||
//
|
||||
// Reduce the node most recently added to the list at level i.
|
||||
//
|
||||
|
||||
NODE* pNode = pReducibleNodes[i];
|
||||
pReducibleNodes[i] = pNode->pNext;
|
||||
NODE* pNode = pReducibleNodes[i];
|
||||
pReducibleNodes[i] = pNode->pNext;
|
||||
|
||||
UINT nRedSum = 0;
|
||||
UINT nGreenSum = 0;
|
||||
UINT nBlueSum = 0;
|
||||
UINT nChildren = 0;
|
||||
UINT nRedSum = 0;
|
||||
UINT nGreenSum = 0;
|
||||
UINT nBlueSum = 0;
|
||||
UINT nChildren = 0;
|
||||
|
||||
for (i=0; i<8; i++) {
|
||||
if (pNode->pChild[i] != NULL) {
|
||||
nRedSum += pNode->pChild[i]->nRedSum;
|
||||
nGreenSum += pNode->pChild[i]->nGreenSum;
|
||||
nBlueSum += pNode->pChild[i]->nBlueSum;
|
||||
pNode->nPixelCount += pNode->pChild[i]->nPixelCount;
|
||||
HeapFree (GetProcessHeap (), 0, pNode->pChild[i]);
|
||||
pNode->pChild[i] = NULL;
|
||||
nChildren++;
|
||||
}
|
||||
}
|
||||
for (i=0; i<8; i++) {
|
||||
if (pNode->pChild[i] != NULL) {
|
||||
nRedSum += pNode->pChild[i]->nRedSum;
|
||||
nGreenSum += pNode->pChild[i]->nGreenSum;
|
||||
nBlueSum += pNode->pChild[i]->nBlueSum;
|
||||
pNode->nPixelCount += pNode->pChild[i]->nPixelCount;
|
||||
HeapFree (GetProcessHeap (), 0, pNode->pChild[i]);
|
||||
pNode->pChild[i] = NULL;
|
||||
nChildren++;
|
||||
}
|
||||
}
|
||||
|
||||
pNode->bIsLeaf = TRUE;
|
||||
pNode->nRedSum = nRedSum;
|
||||
pNode->nGreenSum = nGreenSum;
|
||||
pNode->nBlueSum = nBlueSum;
|
||||
*pLeafCount -= (nChildren - 1);
|
||||
pNode->bIsLeaf = TRUE;
|
||||
pNode->nRedSum = nRedSum;
|
||||
pNode->nGreenSum = nGreenSum;
|
||||
pNode->nBlueSum = nBlueSum;
|
||||
*pLeafCount -= (nChildren - 1);
|
||||
}
|
||||
|
||||
void CQuantizer::DeleteTree (NODE** ppNode)
|
||||
{
|
||||
for (int i=0; i<8; i++) {
|
||||
if ((*ppNode)->pChild[i] != NULL)
|
||||
DeleteTree (&((*ppNode)->pChild[i]));
|
||||
}
|
||||
HeapFree (GetProcessHeap (), 0, *ppNode);
|
||||
*ppNode = NULL;
|
||||
for (int i=0; i<8; i++) {
|
||||
if ((*ppNode)->pChild[i] != NULL)
|
||||
DeleteTree (&((*ppNode)->pChild[i]));
|
||||
}
|
||||
HeapFree (GetProcessHeap (), 0, *ppNode);
|
||||
*ppNode = NULL;
|
||||
}
|
||||
|
||||
void CQuantizer::GetPaletteColors (NODE* pTree, RGBQUAD* prgb, UINT* pIndex)
|
||||
{
|
||||
if (pTree->bIsLeaf) {
|
||||
prgb[*pIndex].rgbRed =
|
||||
(BYTE) ((pTree->nRedSum) / (pTree->nPixelCount));
|
||||
prgb[*pIndex].rgbGreen =
|
||||
(BYTE) ((pTree->nGreenSum) / (pTree->nPixelCount));
|
||||
prgb[*pIndex].rgbBlue =
|
||||
(BYTE) ((pTree->nBlueSum) / (pTree->nPixelCount));
|
||||
prgb[*pIndex].rgbReserved = 0;
|
||||
(*pIndex)++;
|
||||
}
|
||||
else {
|
||||
for (int i=0; i<8; i++) {
|
||||
if (pTree->pChild[i] != NULL)
|
||||
GetPaletteColors (pTree->pChild[i], prgb, pIndex);
|
||||
}
|
||||
}
|
||||
if (pTree->bIsLeaf) {
|
||||
prgb[*pIndex].rgbRed =
|
||||
(BYTE) ((pTree->nRedSum) / (pTree->nPixelCount));
|
||||
prgb[*pIndex].rgbGreen =
|
||||
(BYTE) ((pTree->nGreenSum) / (pTree->nPixelCount));
|
||||
prgb[*pIndex].rgbBlue =
|
||||
(BYTE) ((pTree->nBlueSum) / (pTree->nPixelCount));
|
||||
prgb[*pIndex].rgbReserved = 0;
|
||||
(*pIndex)++;
|
||||
}
|
||||
else {
|
||||
for (int i=0; i<8; i++) {
|
||||
if (pTree->pChild[i] != NULL)
|
||||
GetPaletteColors (pTree->pChild[i], prgb, pIndex);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
UINT CQuantizer::GetColorCount ()
|
||||
{
|
||||
return m_nLeafCount;
|
||||
return m_nLeafCount;
|
||||
}
|
||||
|
||||
void CQuantizer::GetColorTable (RGBQUAD* prgb)
|
||||
{
|
||||
UINT nIndex = 0;
|
||||
GetPaletteColors (m_pTree, prgb, &nIndex);
|
||||
UINT nIndex = 0;
|
||||
GetPaletteColors (m_pTree, prgb, &nIndex);
|
||||
}
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user