107 lines
2.2 KiB
C++
107 lines
2.2 KiB
C++
#include "CanvasPixel.h"
|
|
|
|
#include <cstring>
|
|
|
|
CanvasPixel::CanvasPixel()
|
|
{
|
|
count = 0;
|
|
composite = COLOR_BLACK;
|
|
}
|
|
|
|
const CanvasFragment *CanvasPixel::getFrontFragment() const
|
|
{
|
|
if (count == 0)
|
|
{
|
|
return NULL;
|
|
}
|
|
else
|
|
{
|
|
return fragments + (count - 1);
|
|
}
|
|
}
|
|
|
|
void CanvasPixel::reset()
|
|
{
|
|
count = 0;
|
|
}
|
|
|
|
void CanvasPixel::pushFragment(const CanvasFragment &fragment)
|
|
{
|
|
if (count == 0)
|
|
{
|
|
fragments[0] = fragment;
|
|
count = 1;
|
|
}
|
|
else
|
|
{
|
|
if (fragments[0].getOpaque() and fragment.getZ() < fragments[0].getZ())
|
|
{
|
|
// behind opaque fragment, don't bother
|
|
return;
|
|
}
|
|
|
|
// find expected position
|
|
int i = 0;
|
|
while (i < count and fragment.getZ() > fragments[i].getZ())
|
|
{
|
|
i++;
|
|
}
|
|
|
|
if (fragment.getOpaque())
|
|
{
|
|
// Discard fragments masked by the incoming opaque one
|
|
if (i < count)
|
|
{
|
|
memmove(fragments + 1, fragments + i, sizeof(CanvasFragment) * (count - i));
|
|
count -= i;
|
|
}
|
|
else
|
|
{
|
|
count = 1;
|
|
}
|
|
fragments[0] = fragment;
|
|
}
|
|
else if (i < count)
|
|
{
|
|
// Need to make room for the incoming fragment
|
|
if (count < MAX_FRAGMENT_COUNT)
|
|
{
|
|
memmove(fragments + i + 1, fragments + i, sizeof(CanvasFragment) * (count - i));
|
|
fragments[i] = fragment;
|
|
count++;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (count == MAX_FRAGMENT_COUNT)
|
|
{
|
|
// Replace nearest fragment
|
|
fragments[count - 1] = fragment;
|
|
}
|
|
else
|
|
{
|
|
// Append
|
|
fragments[count] = fragment;
|
|
count++;
|
|
}
|
|
}
|
|
}
|
|
|
|
updateComposite();
|
|
}
|
|
|
|
void CanvasPixel::updateComposite()
|
|
{
|
|
Color result(0.0, 0.0, 0.0, 1.0);
|
|
for (int i = 0; i < count; i++)
|
|
{
|
|
result.mask(fragments[i].getColor());
|
|
}
|
|
composite = result;
|
|
}
|
|
|
|
void CanvasPixel::setComposite(const Color &color)
|
|
{
|
|
composite = color;
|
|
}
|