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
|
//----------------------------------------------------------------------------
// Anti-Grain Geometry - Version 2.4
// 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
//----------------------------------------------------------------------------
#ifndef AGG_VCGEN_VERTEX_SEQUENCE_INCLUDED
#define AGG_VCGEN_VERTEX_SEQUENCE_INCLUDED
#include "agg_basics.h"
#include "agg_vertex_sequence.h"
#include "agg_shorten_path.h"
namespace agg
{
//===================================================vcgen_vertex_sequence
class vcgen_vertex_sequence
{
public:
typedef vertex_dist_cmd vertex_type;
typedef vertex_sequence<vertex_type, 6> vertex_storage;
vcgen_vertex_sequence() :
m_flags(0),
m_cur_vertex(0),
m_shorten(0.0),
m_ready(false)
{
}
// Vertex Generator Interface
void remove_all();
void add_vertex(double x, double y, unsigned cmd);
// Vertex Source Interface
void rewind(unsigned path_id);
unsigned vertex(double* x, double* y);
void shorten(double s) { m_shorten = s; }
double shorten() const { return m_shorten; }
private:
vcgen_vertex_sequence(const vcgen_vertex_sequence&);
const vcgen_vertex_sequence& operator = (const vcgen_vertex_sequence&);
vertex_storage m_src_vertices;
unsigned m_flags;
unsigned m_cur_vertex;
double m_shorten;
bool m_ready;
};
//------------------------------------------------------------------------
inline void vcgen_vertex_sequence::remove_all()
{
m_ready = false;
m_src_vertices.remove_all();
m_cur_vertex = 0;
m_flags = 0;
}
//------------------------------------------------------------------------
inline void vcgen_vertex_sequence::add_vertex(double x, double y, unsigned cmd)
{
m_ready = false;
if(is_move_to(cmd))
{
m_src_vertices.modify_last(vertex_dist_cmd(x, y, cmd));
}
else
{
if(is_vertex(cmd))
{
m_src_vertices.add(vertex_dist_cmd(x, y, cmd));
}
else
{
m_flags = cmd & path_flags_mask;
}
}
}
//------------------------------------------------------------------------
inline void vcgen_vertex_sequence::rewind(unsigned)
{
if(!m_ready)
{
m_src_vertices.close(is_closed(m_flags));
shorten_path(m_src_vertices, m_shorten, get_close_flag(m_flags));
}
m_ready = true;
m_cur_vertex = 0;
}
//------------------------------------------------------------------------
inline unsigned vcgen_vertex_sequence::vertex(double* x, double* y)
{
if(!m_ready)
{
rewind(0);
}
if(m_cur_vertex == m_src_vertices.size())
{
++m_cur_vertex;
return path_cmd_end_poly | m_flags;
}
if(m_cur_vertex > m_src_vertices.size())
{
return path_cmd_stop;
}
vertex_type& v = m_src_vertices[m_cur_vertex++];
*x = v.x;
*y = v.y;
return v.cmd;
}
}
#endif
|
