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 /// more item is added to the container.
144 /// The add() member function notificates the observer about more 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 /// \brief The member function to notificate the observer about
164 /// more item is erased from the container.
166 /// The erase() member function notificates the observer about more item
167 /// is erased from the container. It have to be overrided in the
169 virtual void erase(const std::vector<Item>& items) {
170 for (int i = 0; i < (int)items.size(); ++i) {
175 /// \brief The member function to notificate the observer about the
176 /// container is built.
178 /// The build() member function notificates the observer about the
179 /// container is built from an empty container. It have to be
180 /// overrided in the subclasses.
182 virtual void build() = 0;
184 /// \brief The member function to notificate the observer about all
185 /// items are erased from the container.
187 /// The clear() member function notificates the observer about all
188 /// items are erased from the container. It have to be overrided in
191 virtual void clear() = 0;
198 typedef std::vector<ObserverBase*> Container;
205 /// Default constructor.
208 /// The default constructor of the AlterationNotifier.
209 /// It creates an empty registry.
210 AlterationNotifier() {}
212 /// Copy Constructor of the AlterationNotifier.
214 /// Copy constructor of the AlterationNotifier.
215 /// It creates only an empty registry because the copiable
216 /// registry's observers have to be registered still into that registry.
217 AlterationNotifier(const AlterationNotifier&) {}
221 /// Assign operator for the AlterationNotifier.
222 /// It makes the notifier only empty because the copiable
223 /// notifier's observers have to be registered still into that registry.
224 AlterationNotifier& operator=(const AlterationNotifier&) {
225 typename Container::iterator it;
226 for (it = container.begin(); it != container.end(); ++it) {
233 /// Destructor of the AlterationNotifier.
235 ~AlterationNotifier() {
236 typename Container::iterator it;
237 for (it = container.begin(); it != container.end(); ++it) {
245 void attach(ObserverBase& observer) {
246 container.push_back(&observer);
247 observer.registry = this;
248 observer.registry_index = container.size()-1;
251 void detach(ObserverBase& base) {
252 container.back()->registry_index = base.registry_index;
253 container[base.registry_index] = container.back();
254 container.pop_back();
260 /// \brief Notifies all the registered observers about an Item added to
263 /// It notifies all the registered observers about an Item added to
266 void add(const Item& item) {
267 typename Container::iterator it;
268 for (it = container.begin(); it != container.end(); ++it) {
273 /// \brief Notifies all the registered observers about more Item added to
276 /// It notifies all the registered observers about more Item added to
279 void add(const std::vector<Item>& items) {
280 typename Container::iterator it;
281 for (it = container.begin(); it != container.end(); ++it) {
286 /// \brief Notifies all the registered observers about an Item erased from
289 /// It notifies all the registered observers about an Item erased from
292 void erase(const Item& key) {
293 typename Container::iterator it;
294 for (it = container.begin(); it != container.end(); ++it) {
299 /// \brief Notifies all the registered observers about more Item erased
300 /// from the container.
302 /// It notifies all the registered observers about more Item erased from
305 void erase(const std::vector<Item>& items) {
306 typename Container::iterator it;
307 for (it = container.begin(); it != container.end(); ++it) {
312 /// \brief Notifies all the registered observers about the container is
315 /// Notifies all the registered observers about the container is built
316 /// from an empty container.
318 typename Container::iterator it;
319 for (it = container.begin(); it != container.end(); ++it) {
325 /// \brief Notifies all the registered observers about all Items are
328 /// Notifies all the registered observers about all Items are erased
329 /// from the container.
331 typename Container::iterator it;
332 for (it = container.begin(); it != container.end(); ++it) {
339 /// \brief Class to extend a graph with the functionality of alteration
342 /// AlterableGraphExtender extends the _Base graphs functionality with
343 /// the possibility of alteration observing. It defines two observer
344 /// registrys for the nodes and mapes.
346 /// \todo Document what "alteration observing" is. And probably find a
347 /// better (shorter) name.
349 /// \param _Base is the base class to extend.
351 /// \pre _Base is conform to the BaseGraphComponent concept.
353 /// \post AlterableGraphExtender<_Base> is conform to the
354 /// AlterableGraphComponent concept.
356 /// \author Balazs Dezso
358 template <typename _Base>
359 class AlterableGraphExtender : public _Base {
362 typedef AlterableGraphExtender Graph;
363 typedef _Base Parent;
365 typedef typename Parent::Node Node;
366 typedef typename Parent::Edge Edge;
368 /// The edge observer registry.
369 typedef AlterationNotifier<Edge> EdgeNotifier;
370 /// The node observer registry.
371 typedef AlterationNotifier<Node> NodeNotifier;
376 mutable EdgeNotifier edge_notifier;
378 mutable NodeNotifier node_notifier;
382 /// \brief Gives back the edge alteration notifier.
384 /// Gives back the edge alteration notifier.
385 EdgeNotifier& getNotifier(Edge) const {
386 return edge_notifier;
389 /// \brief Gives back the node alteration notifier.
391 /// Gives back the node alteration notifier.
392 NodeNotifier& getNotifier(Node) const {
393 return node_notifier;
396 ~AlterableGraphExtender() {
397 node_notifier.clear();
398 edge_notifier.clear();
403 /// \brief Class to extend an undirected graph with the functionality of
404 /// alteration observing.
408 /// \sa AlterableGraphExtender
410 /// \bug This should be done some other way. Possibilities: template
411 /// specialization (not very easy, if at all possible); some kind of
412 /// enable_if boost technique?
414 template <typename _Base>
415 class AlterableUndirGraphExtender
416 : public AlterableGraphExtender<_Base> {
419 typedef AlterableUndirGraphExtender Graph;
420 typedef AlterableGraphExtender<_Base> Parent;
422 typedef typename Parent::UndirEdge UndirEdge;
424 /// The edge observer registry.
425 typedef AlterationNotifier<UndirEdge> UndirEdgeNotifier;
429 mutable UndirEdgeNotifier undir_edge_notifier;
433 using Parent::getNotifier;
434 UndirEdgeNotifier& getNotifier(UndirEdge) const {
435 return undir_edge_notifier;
438 ~AlterableUndirGraphExtender() {
439 undir_edge_notifier.clear();
444 template <typename _Base>
445 class AlterableUndirBipartiteGraphExtender : public _Base {
448 typedef _Base Parent;
449 typedef AlterableUndirBipartiteGraphExtender Graph;
451 typedef typename Parent::Node Node;
452 typedef typename Parent::LowerNode LowerNode;
453 typedef typename Parent::UpperNode UpperNode;
454 typedef typename Parent::Edge Edge;
455 typedef typename Parent::UndirEdge UndirEdge;
458 typedef AlterationNotifier<Node> NodeNotifier;
459 typedef AlterationNotifier<LowerNode> LowerNodeNotifier;
460 typedef AlterationNotifier<UpperNode> UpperNodeNotifier;
461 typedef AlterationNotifier<Edge> EdgeNotifier;
462 typedef AlterationNotifier<UndirEdge> UndirEdgeNotifier;
466 mutable NodeNotifier nodeNotifier;
467 mutable LowerNodeNotifier lowerNodeNotifier;
468 mutable UpperNodeNotifier upperNodeNotifier;
469 mutable EdgeNotifier edgeNotifier;
470 mutable UndirEdgeNotifier undirEdgeNotifier;
474 NodeNotifier& getNotifier(Node) const {
478 LowerNodeNotifier& getNotifier(LowerNode) const {
479 return lowerNodeNotifier;
482 UpperNodeNotifier& getNotifier(UpperNode) const {
483 return upperNodeNotifier;
486 EdgeNotifier& getNotifier(Edge) const {
490 UndirEdgeNotifier& getNotifier(UndirEdge) const {
491 return undirEdgeNotifier;
494 ~AlterableUndirBipartiteGraphExtender() {
495 nodeNotifier.clear();
496 lowerNodeNotifier.clear();
497 upperNodeNotifier.clear();
498 edgeNotifier.clear();
499 undirEdgeNotifier.clear();