1 /*
2 * vim: ts=4 sw=4 et tw=0 wm=0
3 *
4 * libavoid - Fast, Incremental, Object-avoiding Line Router
5 *
6 * Copyright (C) 2004-2008 Monash University
7 *
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation; either
11 * version 2.1 of the License, or (at your option) any later version.
12 * See the file LICENSE.LGPL distributed with the library.
13 *
14 * Licensees holding a valid commercial license may use this file in
15 * accordance with the commercial license agreement provided with the
16 * library.
17 *
18 * This library is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
21 *
22 * Author(s): Michael Wybrow <mjwybrow@users.sourceforge.net>
23 */
26 #ifndef AVOID_CLUSTER_H
27 #define AVOID_CLUSTER_H
29 #include <list>
31 #include "libavoid/geometry.h"
34 namespace Avoid {
36 class Router;
37 class ClusterRef;
38 typedef std::list<ClusterRef *> ClusterRefList;
41 class ClusterRef
42 {
43 public:
44 ClusterRef(Router *router, unsigned int id, Polygon& poly);
45 ~ClusterRef();
46 void setNewPoly(Polygon& poly);
47 unsigned int id(void);
48 ReferencingPolygon& polygon(void);
49 Router *router(void);
50 void makeActive(void);
51 void makeInactive(void);
53 private:
54 Router *_router;
55 unsigned int _id;
56 ReferencingPolygon _poly;
57 bool _active;
58 ClusterRefList::iterator _pos;
59 };
62 }
65 #endif