8989cf37532f11910ef0f6a66b9fb278c22f8248
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 #ifndef AVOID_SHAPE_H
24 #define AVOID_SHAPE_H
26 #include "libavoid/geometry.h"
27 #include <list>
30 namespace Avoid {
32 class VertInf;
33 class Router;
34 class ShapeRef;
35 typedef std::list<ShapeRef *> ShapeRefList;
38 class ShapeRef
39 {
40 public:
41 ShapeRef(Router *router, unsigned int id, Polygn& poly);
42 ~ShapeRef();
43 VertInf *firstVert(void);
44 VertInf *lastVert(void);
45 unsigned int id(void);
46 Polygn poly(void);
47 Router *router(void);
48 void boundingBox(BBox& bbox);
50 void makeActive(void);
51 void makeInactive(void);
53 void removeFromGraph(void);
55 private:
56 Router *_router;
57 unsigned int _id;
58 Polygn _poly;
59 bool _active;
60 ShapeRefList::iterator _pos;
61 VertInf *_firstVert;
62 VertInf *_lastVert;
63 };
66 }
69 #endif