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
|
// primShape.h
// Context Free
// ---------------------
// Copyright (C) 2006-2012 John Horigan
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// John Horigan can be contacted at john@glyphic.com or at
// John Horigan, 1209 Villa St., Mountain View, CA 94041-1123, USA
//
//
#ifndef INCLUDE_PRIMSHAPE_H
#define INCLUDE_PRIMSHAPE_H
#include "agg2/agg_path_storage.h"
#include <initializer_list>
#include <utility>
#include <cassert>
#include <string>
#include <array>
class primShape : public agg::path_storage
{
public:
enum {circleType = 0, squareType = 1, triangleType = 2, fillType = 3,
numTypes = 4};
using primShapes_t = std::array<primShape, numTypes>;
using primNames_t = std::array<std::string, numTypes>;
primShape(std::initializer_list<std::pair<double, double>> l)
{
auto p = l.begin();
if (p == l.end()) return; // just default init for an empty list
move_to(p->first, p->second);
for (++p; p != l.end(); ++p)
line_to(p->first, p->second);
end_poly(agg::path_flags_close);
}
primShape() = default;
static const primShapes_t shapeMap;
static const primNames_t shapeNames;
static bool isPrimShape(unsigned v) { return v < numTypes; }
};
class primIter
{
public:
primIter() = default;
primIter(const primShape* data) : mData(data) {}
unsigned vertex(double* x, double* y);
void rewind(unsigned i);
void init(const primShape* shape);
private:
const primShape* mData = nullptr;
unsigned mIndex = 0;
};
#endif // INCLUDE_PRIMSHAPE_H
|
