summaryrefslogtreecommitdiff
path: root/agg/inc/agg_scanline_bin.h
blob: aa60ed061e07dd73c8901b1716e2d4638c1046dd (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
//----------------------------------------------------------------------------
// Anti-Grain Geometry - Version 2.3
// Copyright (C) 2002-2005 Maxim Shemanarev (http://www.antigrain.com)
//
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
//
//----------------------------------------------------------------------------
// Contact: mcseem@antigrain.com
//          mcseemagg@yahoo.com
//          http://www.antigrain.com
//----------------------------------------------------------------------------
//
// Class scanline_bin - binary scanline.
//
//----------------------------------------------------------------------------
#ifndef AGG_SCANLINE_BIN_INCLUDED
#define AGG_SCANLINE_BIN_INCLUDED

#include "agg_basics.h"

namespace agg
{

    //=============================================================scanline_bin
    //
    // This is binary scaline container which supports the interface
    // used in the rasterizer::render(). See description of agg_scanline_u8
    // for details.
    //
    // Rendering:
    //-------------------------------------------------------------------------
    //
    //  int y = sl.y();
    //
    // ************************************
    // ...Perform vertical clipping here...
    // ************************************
    //
    //  unsigned num_spans = sl.num_spans();
    //  const agg::scanline_bin::span* cur_span = sl.spans();
    //
    //  do
    //  {
    //      x = cur_span->x;
    //      len = cur_span->len;
    //
    //      **************************************
    //      ...Perform horizontal clipping here...
    //      **************************************
    //
    //      hor_line(x, y, len)
    //      ++cur_span;
    //  }
    //  while(--num_spans);
    //
    //------------------------------------------------------------------------
    class scanline_bin
    {
    public:
        struct span
        {
            int16 x;
            int16 len;
        };

        typedef const span* const_iterator;

        ~scanline_bin()
        {
            delete [] m_spans;
        }

        scanline_bin() :
            m_max_len(0),
            m_last_x(0x7FFF),
            m_spans(0),
            m_cur_span(0)
        {
        }

        void reset(int min_x, int max_x);
        void add_cell(int x, unsigned);
        void add_cells(int x, unsigned len, const void*);
        void add_span(int x, unsigned len, unsigned);
        void finalize(int y) { m_y = y; }
        void reset_spans();

        int            y()         const { return m_y; }
        unsigned       num_spans() const { return unsigned(m_cur_span - m_spans); }
        const_iterator begin()     const { return m_spans + 1; }

    private:
        scanline_bin(const scanline_bin&);
        const scanline_bin operator = (const scanline_bin&);

        unsigned  m_max_len;
        int       m_last_x;
        int       m_y;
        span*     m_spans;
        span*     m_cur_span;
    };


    //------------------------------------------------------------------------
    inline void scanline_bin::reset(int min_x, int max_x)
    {
        unsigned max_len = max_x - min_x + 3;
        if(max_len > m_max_len)
        {
            delete [] m_spans;
            m_spans   = new span [max_len];
            m_max_len = max_len;
        }
        m_last_x    = 0x7FFF;
        m_cur_span  = m_spans;
    }


    //------------------------------------------------------------------------
    inline void scanline_bin::reset_spans()
    {
        m_last_x    = 0x7FFF;
        m_cur_span  = m_spans;
    }


    //------------------------------------------------------------------------
    inline void scanline_bin::add_cell(int x, unsigned)
    {
        if(x == m_last_x+1)
        {
            m_cur_span->len++;
        }
        else
        {
            ++m_cur_span;
            m_cur_span->x = (int16)x;
            m_cur_span->len = 1;
        }
        m_last_x = x;
    }


    //------------------------------------------------------------------------
    inline void scanline_bin::add_span(int x, unsigned len, unsigned)
    {
        if(x == m_last_x+1)
        {
            m_cur_span->len = (int16)(m_cur_span->len + len);
        }
        else
        {
            ++m_cur_span;
            m_cur_span->x = (int16)x;
            m_cur_span->len = (int16)len;
        }
        m_last_x = x + len - 1;
    }

    //------------------------------------------------------------------------
    inline void scanline_bin::add_cells(int x, unsigned len, const void*)
    {
        add_span(x, len, 0);
    }
}


#endif