blob: 28f38298d5aed1e8fa3a6afb795ba891343472dc (
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
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libavoid - Fast, Incremental, Object-avoiding Line Router
* Copyright (C) 2004-2006 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
*
*/
#ifndef AVOID_SHAPE_H
#define AVOID_SHAPE_H
#include "libavoid/geometry.h"
#include <list>
namespace Avoid {
class VertInf;
class Router;
class ShapeRef;
typedef std::list<ShapeRef *> ShapeRefList;
class ShapeRef
{
public:
ShapeRef(Router *router, unsigned int id, Polygn& poly);
~ShapeRef();
void setNewPoly(Polygn& poly);
VertInf *firstVert(void);
VertInf *lastVert(void);
unsigned int id(void);
Polygn poly(void);
Router *router(void);
void boundingBox(BBox& bbox);
void makeActive(void);
void makeInactive(void);
void removeFromGraph(void);
void markForMove(void);
void clearMoveMark(void);
VertInf *getPointVertex(const Point& point);
private:
Router *_router;
unsigned int _id;
Polygn _poly;
bool _active;
bool _inMoveList;
ShapeRefList::iterator _pos;
VertInf *_firstVert;
VertInf *_lastVert;
};
}
#endif
|
