blob: 6ece50e6325a2c484faf533ed119a94cc0867c7e (
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
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libavoid - Fast, Incremental, Object-avoiding Line Router
* Copyright (C) 2004-2005 Michael Wybrow <mjwybrow@users.sourceforge.net>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "libavoid/shape.h"
namespace Avoid {
Polygn newPoly(int size)
{
Polygn newpoly;
newpoly.pn = size;
newpoly.ps = (Point *) calloc(size, sizeof(Point));
if (!newpoly.ps)
{
fprintf(stderr,
"Error: Unable to allocate Point array in Avoid::newPoly\n");
abort();
}
return newpoly;
}
Polygn copyPoly(Polygn poly)
{
Polygn newpoly = newPoly(poly.pn);
newpoly.id = poly.id;
for (int i = 0; i < poly.pn; i++)
{
newpoly.ps[i] = poly.ps[i];
}
return newpoly;
}
Polygn copyPoly(ShapeRef *shape)
{
Polygn poly = shape->poly();
Polygn newpoly = newPoly(poly.pn);
newpoly.id = poly.id;
for (int i = 0; i < poly.pn; i++)
{
newpoly.ps[i] = poly.ps[i];
}
return newpoly;
}
void freePoly(Polygn& poly)
{
std::free(poly.ps);
}
void freePtrPoly(Polygn *poly)
{
std::free(poly->ps);
std::free(poly);
}
}
|
