1 /*
2 * vim: ts=4 sw=4 et tw=0 wm=0
3 *
4 * libavoid - Fast, Incremental, Object-avoiding Line Router
5 * Copyright (C) 2004-2006 Michael Wybrow <mjwybrow@users.sourceforge.net>
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 */
23 #include <cassert>
24 #include <cstdlib>
26 #include "libavoid/polyutil.h"
27 #include "libavoid/geomtypes.h"
28 #include "libavoid/vertices.h"
29 #include "libavoid/shape.h"
31 namespace Avoid {
34 Polygn newPoly(int size)
35 {
36 Polygn newpoly;
38 newpoly.pn = size;
39 newpoly.ps = (Point *) calloc(size, sizeof(Point));
40 if (!newpoly.ps)
41 {
42 fprintf(stderr,
43 "Error: Unable to allocate Point array in Avoid::newPoly\n");
44 abort();
45 }
46 return newpoly;
47 }
50 Polygn copyPoly(Polygn poly)
51 {
52 Polygn newpoly = newPoly(poly.pn);
54 newpoly.id = poly.id;
55 for (int i = 0; i < poly.pn; i++)
56 {
57 newpoly.ps[i] = poly.ps[i];
58 }
59 return newpoly;
60 }
63 Polygn copyPoly(ShapeRef *shape)
64 {
65 Polygn poly = shape->poly();
66 Polygn newpoly = newPoly(poly.pn);
68 newpoly.id = poly.id;
69 for (int i = 0; i < poly.pn; i++)
70 {
71 newpoly.ps[i] = poly.ps[i];
72 }
73 return newpoly;
74 }
77 void freePoly(Polygn& poly)
78 {
79 std::free(poly.ps);
80 }
83 void freePtrPoly(Polygn *poly)
84 {
85 std::free(poly->ps);
86 std::free(poly);
87 }
90 }