Shape keeping movement is implemented, at last. Many thanks to Alpar.
2 * lemon/notifier.h - Part of LEMON, a generic C++ optimization library
4 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Research Group on Combinatorial Optimization, EGRES).
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
17 #ifndef LEMON_ALTERATION_OBSERVER_REGISTRY_H
18 #define LEMON_ALTERATION_OBSERVER_REGISTRY_H
23 ///\ingroup graphmapfactory
25 ///\brief Observer registry for graph alteration observers.
29 /// \addtogroup graphmapfactory
32 /// \brief Registry class to register objects observes alterations in
35 /// This class is a registry for the objects which observe the
36 /// alterations in a container. The alteration observers can be attached
37 /// to and detached from the registry. The observers have to inherit
38 /// from the \ref AlterationNotifier::ObserverBase and override
39 /// the virtual functions in that.
41 /// The most important application of the alteration observing is the
42 /// dynamic map implementation.
44 /// \param _Item The item type what the observers are observing, usually
47 /// \author Balazs Dezso
49 template <typename _Item>
50 class AlterationNotifier {
54 /// ObserverBase is the base class for the observers.
56 /// ObserverBase is the abstract base class for the observers.
57 /// It will be notified about an item was inserted into or
58 /// erased from the graph.
60 /// The observer interface contains some pure virtual functions
61 /// to override. The add() and erase() functions are
62 /// to notify the oberver when one item is added or
65 /// The build() and clear() members are to notify the observer
66 /// about the container is built from an empty container or
67 /// is cleared to an empty container.
69 /// \author Balazs Dezso
73 typedef AlterationNotifier Registry;
75 friend class AlterationNotifier;
77 /// \brief Default constructor.
79 /// Default constructor for ObserverBase.
81 ObserverBase() : registry(0) {}
83 ObserverBase(const ObserverBase& copy) {
84 if (copy.attached()) {
85 copy.getRegistry()->attach(*this);
89 virtual ~ObserverBase() {}
91 /// \brief Attaches the observer into an AlterationNotifier.
93 /// This member attaches the observer into an AlterationNotifier.
95 void attach(AlterationNotifier& r) {
97 registry->attach(*this);
100 /// \brief Detaches the observer into an AlterationNotifier.
102 /// This member detaches the observer from an AlterationNotifier.
106 registry->detach(*this);
111 /// Gives back a pointer to the registry what the map attached into.
113 /// This function gives back a pointer to the registry what the map
116 Registry* getRegistry() const { return const_cast<Registry*>(registry); }
118 /// Gives back true when the observer is attached into a registry.
119 bool attached() const { return registry != 0; }
123 ObserverBase& operator=(const ObserverBase& copy);
132 /// \brief The member function to notificate the observer about an
133 /// item is added to the container.
135 /// The add() member function notificates the observer about an item
136 /// is added to the container. It have to be overrided in the
139 virtual void add(const Item&) = 0;
141 /// \brief The member function to notificate the observer about
142 /// simulitem is added to the container.
144 /// The add() member function notificates the observer about an item
145 /// is added to the container. It have to be overrided in the
148 virtual void add(const std::vector<Item>& items) {
149 for (int i = 0; i < (int)items.size(); ++i) {
154 /// \brief The member function to notificate the observer about an
155 /// item is erased from the container.
157 /// The erase() member function notificates the observer about an
158 /// item is erased from the container. It have to be overrided in
161 virtual void erase(const Item&) = 0;
163 virtual void erase(const std::vector<Item>& items) {
164 for (int i = 0; i < (int)items.size(); ++i) {
169 /// \brief The member function to notificate the observer about the
170 /// container is built.
172 /// The build() member function notificates the observer about the
173 /// container is built from an empty container. It have to be
174 /// overrided in the subclasses.
176 virtual void build() = 0;
178 /// \brief The member function to notificate the observer about all
179 /// items are erased from the container.
181 /// The clear() member function notificates the observer about all
182 /// items are erased from the container. It have to be overrided in
185 virtual void clear() = 0;
192 typedef std::vector<ObserverBase*> Container;
199 /// Default constructor.
202 /// The default constructor of the AlterationNotifier.
203 /// It creates an empty registry.
204 AlterationNotifier() {}
206 /// Copy Constructor of the AlterationNotifier.
208 /// Copy constructor of the AlterationNotifier.
209 /// It creates only an empty registry because the copiable
210 /// registry's observers have to be registered still into that registry.
211 AlterationNotifier(const AlterationNotifier&) {}
215 /// Assign operator for the AlterationNotifier.
216 /// It makes the notifier only empty because the copiable
217 /// notifier's observers have to be registered still into that registry.
218 AlterationNotifier& operator=(const AlterationNotifier&) {
219 typename Container::iterator it;
220 for (it = container.begin(); it != container.end(); ++it) {
227 /// Destructor of the AlterationNotifier.
229 ~AlterationNotifier() {
230 typename Container::iterator it;
231 for (it = container.begin(); it != container.end(); ++it) {
239 void attach(ObserverBase& observer) {
240 container.push_back(&observer);
241 observer.registry = this;
242 observer.registry_index = container.size()-1;
245 void detach(ObserverBase& base) {
246 container.back()->registry_index = base.registry_index;
247 container[base.registry_index] = container.back();
248 container.pop_back();
254 /// \brief Notifies all the registered observers about an Item added to
257 /// It notifies all the registered observers about an Item added to
260 void add(const Item& item) {
261 typename Container::iterator it;
262 for (it = container.begin(); it != container.end(); ++it) {
267 /// \brief Notifies all the registered observers about more Item added to
270 /// It notifies all the registered observers about more Item added to
273 void add(const std::vector<Item>& items) {
274 typename Container::iterator it;
275 for (it = container.begin(); it != container.end(); ++it) {
280 /// \brief Notifies all the registered observers about an Item erased from
283 /// It notifies all the registered observers about an Item erased from
286 void erase(const Item& key) {
287 typename Container::iterator it;
288 for (it = container.begin(); it != container.end(); ++it) {
293 /// \brief Notifies all the registered observers about more Item erased
294 /// from the container.
296 /// It notifies all the registered observers about more Item erased from
299 void erase(const std::vector<Item>& items) {
300 typename Container::iterator it;
301 for (it = container.begin(); it != container.end(); ++it) {
307 /// \brief Notifies all the registered observers about the container is
310 /// Notifies all the registered observers about the container is built
311 /// from an empty container.
313 typename Container::iterator it;
314 for (it = container.begin(); it != container.end(); ++it) {
320 /// \brief Notifies all the registered observers about all Items are
323 /// Notifies all the registered observers about all Items are erased
324 /// from the container.
326 typename Container::iterator it;
327 for (it = container.begin(); it != container.end(); ++it) {
334 /// \brief Class to extend a graph with the functionality of alteration
337 /// AlterableGraphExtender extends the _Base graphs functionality with
338 /// the possibility of alteration observing. It defines two observer
339 /// registrys for the nodes and mapes.
341 /// \todo Document what "alteration observing" is. And probably find a
342 /// better (shorter) name.
344 /// \param _Base is the base class to extend.
346 /// \pre _Base is conform to the BaseGraphComponent concept.
348 /// \post AlterableGraphExtender<_Base> is conform to the
349 /// AlterableGraphComponent concept.
351 /// \author Balazs Dezso
353 template <typename _Base>
354 class AlterableGraphExtender : public _Base {
357 typedef AlterableGraphExtender Graph;
358 typedef _Base Parent;
360 typedef typename Parent::Node Node;
361 typedef typename Parent::Edge Edge;
363 /// The edge observer registry.
364 typedef AlterationNotifier<Edge> EdgeNotifier;
365 /// The node observer registry.
366 typedef AlterationNotifier<Node> NodeNotifier;
371 mutable EdgeNotifier edge_notifier;
373 mutable NodeNotifier node_notifier;
377 /// \brief Gives back the edge alteration notifier.
379 /// Gives back the edge alteration notifier.
380 EdgeNotifier& getNotifier(Edge) const {
381 return edge_notifier;
384 /// \brief Gives back the node alteration notifier.
386 /// Gives back the node alteration notifier.
387 NodeNotifier& getNotifier(Node) const {
388 return node_notifier;
391 ~AlterableGraphExtender() {
392 node_notifier.clear();
393 edge_notifier.clear();
398 /// \brief Class to extend an undirected graph with the functionality of
399 /// alteration observing.
403 /// \sa AlterableGraphExtender
405 /// \bug This should be done some other way. Possibilities: template
406 /// specialization (not very easy, if at all possible); some kind of
407 /// enable_if boost technique?
409 template <typename _Base>
410 class AlterableUndirGraphExtender
411 : public AlterableGraphExtender<_Base> {
414 typedef AlterableUndirGraphExtender Graph;
415 typedef AlterableGraphExtender<_Base> Parent;
417 typedef typename Parent::UndirEdge UndirEdge;
419 /// The edge observer registry.
420 typedef AlterationNotifier<UndirEdge> UndirEdgeNotifier;
424 mutable UndirEdgeNotifier undir_edge_notifier;
428 using Parent::getNotifier;
429 UndirEdgeNotifier& getNotifier(UndirEdge) const {
430 return undir_edge_notifier;
433 ~AlterableUndirGraphExtender() {
434 undir_edge_notifier.clear();