185d13d5de
Two new AGG classes were needed to handle subpixel scanline coverage values. git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@26358 a95241bf-73f2-0310-859d-f6bbb57e9c96
118 lines
3.4 KiB
C++
Executable File
118 lines
3.4 KiB
C++
Executable File
/*
|
|
* Copyright 2008, Andrej Spielmann <andrej.spielmann@seh.ox.ac.uk>.
|
|
* All rights reserved. Distributed under the terms of the MIT License.
|
|
*
|
|
* Copyright 2002-2004 Maxim Shemanarev (http://www.antigrain.com)
|
|
*
|
|
*
|
|
* Class scanline_u8_subpix, a slightly modified version of
|
|
* scanline_u8 customized to store 3 covers per pixel
|
|
*
|
|
*/
|
|
|
|
#ifndef AGG_SCANLINE_U_SUBPIX_INCLUDED
|
|
#define AGG_SCANLINE_U_SUBPIX_INCLUDED
|
|
|
|
#include <agg_array.h>
|
|
|
|
namespace agg
|
|
{
|
|
//======================================================scanline_u8_subpix
|
|
//------------------------------------------------------------------------
|
|
class scanline_u8_subpix
|
|
{
|
|
public:
|
|
typedef scanline_u8_subpix self_type;
|
|
typedef int8u cover_type;
|
|
typedef int16 coord_type;
|
|
|
|
//--------------------------------------------------------------------
|
|
struct span
|
|
{
|
|
coord_type x;
|
|
coord_type len;
|
|
cover_type* covers;
|
|
};
|
|
|
|
typedef span* iterator;
|
|
typedef const span* const_iterator;
|
|
|
|
//--------------------------------------------------------------------
|
|
scanline_u8_subpix() :
|
|
m_min_x(0),
|
|
m_last_x(0x7FFFFFF0),
|
|
m_cur_span(0)
|
|
{}
|
|
|
|
//--------------------------------------------------------------------
|
|
void reset(int min_x, int max_x)
|
|
{
|
|
unsigned max_len = 3*(max_x - min_x + 2);
|
|
if(max_len > m_spans.size())
|
|
{
|
|
m_spans.resize(max_len);
|
|
m_covers.resize(max_len);
|
|
}
|
|
m_last_x = 0x7FFFFFF0;
|
|
m_min_x = min_x;
|
|
m_cur_span = &m_spans[0];
|
|
}
|
|
|
|
//--------------------------------------------------------------------
|
|
void add_cell(int x, unsigned cover1, unsigned cover2, unsigned cover3)
|
|
{
|
|
x -= m_min_x;
|
|
m_covers[3*x] = (cover_type)cover1;
|
|
m_covers[3*x+1] = (cover_type)cover2;
|
|
m_covers[3*x+2] = (cover_type)cover3;
|
|
if(x == m_last_x+1)
|
|
{
|
|
m_cur_span->len += 3;
|
|
}
|
|
else
|
|
{
|
|
m_cur_span++;
|
|
m_cur_span->x = (coord_type)(x + m_min_x);
|
|
m_cur_span->len = 3;
|
|
m_cur_span->covers = &m_covers[3*x];
|
|
}
|
|
m_last_x = x;
|
|
}
|
|
|
|
//--------------------------------------------------------------------
|
|
void finalize(int y)
|
|
{
|
|
m_y = y;
|
|
}
|
|
|
|
//--------------------------------------------------------------------
|
|
void reset_spans()
|
|
{
|
|
m_last_x = 0x7FFFFFF0;
|
|
m_cur_span = &m_spans[0];
|
|
}
|
|
|
|
//--------------------------------------------------------------------
|
|
int y() const { return m_y; }
|
|
unsigned num_spans() const { return unsigned(m_cur_span - &m_spans[0]); }
|
|
const_iterator begin() const { return &m_spans[1]; }
|
|
iterator begin() { return &m_spans[1]; }
|
|
|
|
private:
|
|
scanline_u8_subpix(const self_type&);
|
|
const self_type& operator = (const self_type&);
|
|
|
|
private:
|
|
int m_min_x;
|
|
int m_last_x;
|
|
int m_y;
|
|
pod_array<cover_type> m_covers;
|
|
pod_array<span> m_spans;
|
|
span* m_cur_span;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|
|
|