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-2005 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 */
24 #include "libavoid/shape.h"
26 namespace Avoid {
29 Polygn newPoly(int size)
30 {
31 Polygn newpoly;
33 newpoly.pn = size;
34 newpoly.ps = (Point *) calloc(size, sizeof(Point));
35 if (!newpoly.ps)
36 {
37 fprintf(stderr,
38 "Error: Unable to allocate Point array in Avoid::newPoly\n");
39 abort();
40 }
41 return newpoly;
42 }
45 Polygn copyPoly(Polygn poly)
46 {
47 Polygn newpoly = newPoly(poly.pn);
49 newpoly.id = poly.id;
50 for (int i = 0; i < poly.pn; i++)
51 {
52 newpoly.ps[i] = poly.ps[i];
53 }
54 return newpoly;
55 }
58 Polygn copyPoly(ShapeRef *shape)
59 {
60 Polygn poly = shape->poly();
61 Polygn newpoly = newPoly(poly.pn);
63 newpoly.id = poly.id;
64 for (int i = 0; i < poly.pn; i++)
65 {
66 newpoly.ps[i] = poly.ps[i];
67 }
68 return newpoly;
69 }
72 void freePoly(Polygn& poly)
73 {
74 std::free(poly.ps);
75 }
78 void freePtrPoly(Polygn *poly)
79 {
80 std::free(poly->ps);
81 std::free(poly);
82 }
85 }