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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/*
* 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
*
*/
#ifndef AVOID_VERTICES_H
#define AVOID_VERTICES_H
#include <list>
#include <set>
#include <map>
#include <iostream>
#include "libavoid/geomtypes.h"
namespace Avoid {
class EdgeInf;
typedef std::list<EdgeInf *> EdgeInfList;
class VertID
{
public:
unsigned int objID;
bool isShape;
int vn;
static const int src;
static const int tar;
VertID();
VertID(unsigned int id, bool s, int n);
VertID(const VertID& other);
VertID& operator= (const VertID& rhs);
bool operator==(const VertID& rhs) const;
bool operator!=(const VertID& rhs) const;
bool operator<(const VertID& rhs) const;
VertID operator+(const int& rhs) const;
VertID operator-(const int& rhs) const;
VertID& operator++(int);
void print(FILE *file = stdout) const;
void db_print(void) const;
};
class VertInf
{
public:
VertInf(const VertID& vid, const Point& vpoint);
void Reset(const Point& vpoint);
void removeFromGraph(const bool isConnVert = true);
VertID id;
Point point;
VertInf *lstPrev;
VertInf *lstNext;
VertInf *shPrev;
VertInf *shNext;
EdgeInfList visList;
unsigned int visListSize;
EdgeInfList invisList;
unsigned int invisListSize;
VertInf *pathNext;
double pathDist;
};
bool directVis(VertInf *src, VertInf *dst);
class VertInfList
{
public:
VertInfList();
void addVertex(VertInf *vert);
void removeVertex(VertInf *vert);
VertInf *shapesBegin(void);
VertInf *connsBegin(void);
VertInf *end(void);
void stats(void)
{
printf("Conns %d, shapes %d\n", _connVertices, _shapeVertices);
}
private:
VertInf *_firstShapeVert;
VertInf *_firstConnVert;
VertInf *_lastShapeVert;
VertInf *_lastConnVert;
unsigned int _shapeVertices;
unsigned int _connVertices;
};
typedef std::set<unsigned int> ShapeSet;
typedef std::map<VertID, ShapeSet> ContainsMap;
extern ContainsMap contains;
extern VertInfList vertices;
}
#endif
|
