lemon/bits/alteration_notifier.h
author alpar
Wed, 02 Nov 2005 16:32:29 +0000
changeset 1756 b1f441f24d08
parent 1718 6a958ab38386
child 1820 22099ef840d7
permissions -rw-r--r--
GRAPH_TYPEDEFS and UNDIRGRAPH_TYPEDEFS macros added to graph_utils.h.
klao@946
     1
/* -*- C++ -*-
ladanyi@1435
     2
 * lemon/notifier.h - Part of LEMON, a generic C++ optimization library
klao@946
     3
 *
alpar@1164
     4
 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@1359
     5
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
klao@946
     6
 *
klao@946
     7
 * Permission to use, modify and distribute this software is granted
klao@946
     8
 * provided that this copyright notice appears in all copies. For
klao@946
     9
 * precise terms see the accompanying LICENSE file.
klao@946
    10
 *
klao@946
    11
 * This software is provided "AS IS" with no warranty of any kind,
klao@946
    12
 * express or implied, and with no claim as to its suitability for any
klao@946
    13
 * purpose.
klao@946
    14
 *
klao@946
    15
 */
klao@946
    16
klao@946
    17
#ifndef LEMON_ALTERATION_OBSERVER_REGISTRY_H
klao@946
    18
#define LEMON_ALTERATION_OBSERVER_REGISTRY_H
klao@946
    19
klao@946
    20
#include <vector>
klao@946
    21
#include <algorithm>
klao@946
    22
alpar@1587
    23
///\ingroup graphmapfactory
klao@946
    24
///\file
klao@946
    25
///\brief Observer registry for graph alteration observers.
klao@946
    26
klao@946
    27
namespace lemon {
klao@946
    28
alpar@1587
    29
  /// \addtogroup graphmapfactory
klao@946
    30
  /// @{
klao@946
    31
deba@1414
    32
  /// \brief Registry class to register objects observes alterations in 
deba@1414
    33
  /// the graph.
deba@1414
    34
  ///
klao@946
    35
  /// This class is a registry for the objects which observe the
klao@946
    36
  /// alterations in a container. The alteration observers can be attached
klao@946
    37
  /// to and detached from the registry. The observers have to inherit
deba@1038
    38
  /// from the \ref AlterationNotifier::ObserverBase and override
klao@946
    39
  /// the virtual functions in that.
klao@946
    40
  ///
klao@946
    41
  /// The most important application of the alteration observing is the
deba@1414
    42
  /// dynamic map implementation.
klao@946
    43
  ///
klao@946
    44
  /// \param _Item The item type what the observers are observing, usually
klao@946
    45
  /// edge or node.
klao@946
    46
  ///
klao@946
    47
  /// \author Balazs Dezso
klao@946
    48
klao@946
    49
  template <typename _Item>
deba@1038
    50
  class AlterationNotifier {
klao@946
    51
  public:
klao@946
    52
    typedef _Item Item;
klao@946
    53
klao@946
    54
    /// ObserverBase is the base class for the observers.
klao@946
    55
	
klao@946
    56
    /// ObserverBase is the abstract base class for the observers.
klao@946
    57
    /// It will be notified about an item was inserted into or
klao@946
    58
    /// erased from the graph.
klao@946
    59
    ///
klao@946
    60
    /// The observer interface contains some pure virtual functions
klao@946
    61
    /// to override. The add() and erase() functions are
klao@946
    62
    /// to notify the oberver when one item is added or
klao@946
    63
    /// erased.
klao@946
    64
    ///
klao@946
    65
    /// The build() and clear() members are to notify the observer
alpar@1204
    66
    /// about the container is built from an empty container or
klao@946
    67
    /// is cleared to an empty container. 
klao@946
    68
    /// 
klao@946
    69
    /// \author Balazs Dezso
klao@946
    70
klao@946
    71
    class ObserverBase {
klao@946
    72
    protected:
deba@1038
    73
      typedef AlterationNotifier Registry;
klao@946
    74
deba@1038
    75
      friend class AlterationNotifier;
klao@946
    76
deba@1414
    77
      /// \brief Default constructor.
deba@1414
    78
      ///
klao@946
    79
      /// Default constructor for ObserverBase.
klao@946
    80
      /// 
klao@946
    81
      ObserverBase() : registry(0) {}
klao@946
    82
deba@1685
    83
      ObserverBase(const ObserverBase& copy) {
deba@1685
    84
	if (copy.attached()) {
deba@1685
    85
	  copy.getRegistry()->attach(*this);
deba@1685
    86
	}
deba@1685
    87
      }
deba@1685
    88
	
klao@946
    89
      virtual ~ObserverBase() {}
klao@946
    90
deba@1414
    91
      /// \brief Attaches the observer into an AlterationNotifier.
deba@1414
    92
      ///
deba@1038
    93
      /// This member attaches the observer into an AlterationNotifier.
klao@946
    94
      ///
deba@1038
    95
      void attach(AlterationNotifier& r) {
klao@946
    96
	registry = &r;
klao@946
    97
	registry->attach(*this);
klao@946
    98
      }
klao@946
    99
deba@1414
   100
      /// \brief Detaches the observer into an AlterationNotifier.
deba@1414
   101
      ///
deba@1038
   102
      /// This member detaches the observer from an AlterationNotifier.
klao@946
   103
      ///
klao@946
   104
      void detach() {
klao@946
   105
	if (registry) {
klao@946
   106
	  registry->detach(*this);
klao@946
   107
	}
klao@946
   108
      }
klao@946
   109
	
klao@946
   110
klao@946
   111
      /// Gives back a pointer to the registry what the map attached into.
klao@946
   112
klao@946
   113
      /// This function gives back a pointer to the registry what the map
klao@946
   114
      /// attached into.
klao@946
   115
      ///
klao@946
   116
      Registry* getRegistry() const { return const_cast<Registry*>(registry); }
klao@946
   117
      
klao@946
   118
      /// Gives back true when the observer is attached into a registry.
klao@946
   119
      bool attached() const { return registry != 0; }
deba@1685
   120
klao@946
   121
    private:
klao@946
   122
klao@946
   123
      ObserverBase& operator=(const ObserverBase& copy);
klao@946
   124
klao@946
   125
    protected:
klao@946
   126
      
klao@946
   127
      Registry* registry;
klao@946
   128
      int registry_index;
klao@946
   129
klao@946
   130
    public:
klao@946
   131
klao@946
   132
      /// \brief The member function to notificate the observer about an
klao@946
   133
      /// item is added to the container.
klao@946
   134
      ///
klao@946
   135
      /// The add() member function notificates the observer about an item
klao@946
   136
      /// is added to the container. It have to be overrided in the
klao@946
   137
      /// subclasses.
klao@946
   138
	
deba@1414
   139
      virtual void add(const Item&) = 0;
klao@946
   140
deba@1414
   141
      /// \brief The member function to notificate the observer about 
deba@1718
   142
      /// more item is added to the container.
deba@1414
   143
      ///
deba@1718
   144
      /// The add() member function notificates the observer about more item
deba@1414
   145
      /// is added to the container. It have to be overrided in the
deba@1414
   146
      /// subclasses.
deba@1414
   147
deba@1414
   148
      virtual void add(const std::vector<Item>& items) {
deba@1414
   149
	for (int i = 0; i < (int)items.size(); ++i) {
deba@1414
   150
	  add(items[i]);
deba@1414
   151
	}
deba@1414
   152
      }
klao@946
   153
klao@946
   154
      /// \brief The member function to notificate the observer about an
klao@946
   155
      /// item is erased from the container.
klao@946
   156
      ///
klao@946
   157
      /// The erase() member function notificates the observer about an
klao@946
   158
      /// item is erased from the container. It have to be overrided in
klao@946
   159
      /// the subclasses.
klao@946
   160
	
klao@946
   161
      virtual void erase(const Item&) = 0;
klao@946
   162
deba@1718
   163
      /// \brief The member function to notificate the observer about 
deba@1718
   164
      /// more item is erased from the container.
deba@1718
   165
      ///
deba@1718
   166
      /// The erase() member function notificates the observer about more item
deba@1718
   167
      /// is erased from the container. It have to be overrided in the
deba@1718
   168
      /// subclasses.
deba@1414
   169
      virtual void erase(const std::vector<Item>& items) {
deba@1414
   170
	for (int i = 0; i < (int)items.size(); ++i) {
deba@1701
   171
	  erase(items[i]);
deba@1414
   172
	}
deba@1414
   173
      }
deba@1414
   174
klao@946
   175
      /// \brief The member function to notificate the observer about the
alpar@1204
   176
      /// container is built.
klao@946
   177
      ///
klao@946
   178
      /// The build() member function notificates the observer about the
alpar@1204
   179
      /// container is built from an empty container. It have to be
klao@946
   180
      /// overrided in the subclasses.
klao@946
   181
klao@946
   182
      virtual void build() = 0;
klao@946
   183
klao@946
   184
      /// \brief The member function to notificate the observer about all
klao@946
   185
      /// items are erased from the container.
klao@946
   186
      ///
klao@946
   187
      /// The clear() member function notificates the observer about all
klao@946
   188
      /// items are erased from the container. It have to be overrided in
klao@946
   189
      /// the subclasses.
klao@946
   190
      
klao@946
   191
      virtual void clear() = 0;
klao@946
   192
klao@946
   193
    };
klao@946
   194
	
klao@946
   195
  protected:
klao@946
   196
	
klao@946
   197
klao@946
   198
    typedef std::vector<ObserverBase*> Container; 
klao@946
   199
klao@946
   200
    Container container;
klao@946
   201
klao@946
   202
		
klao@946
   203
  public:
klao@946
   204
klao@946
   205
    /// Default constructor.
klao@946
   206
	
klao@946
   207
    ///
deba@1038
   208
    /// The default constructor of the AlterationNotifier. 
klao@946
   209
    /// It creates an empty registry.
deba@1038
   210
    AlterationNotifier() {}
klao@946
   211
deba@1038
   212
    /// Copy Constructor of the AlterationNotifier. 
klao@946
   213
	
deba@1038
   214
    /// Copy constructor of the AlterationNotifier. 
klao@946
   215
    /// It creates only an empty registry because the copiable
klao@946
   216
    /// registry's observers have to be registered still into that registry.
deba@1039
   217
    AlterationNotifier(const AlterationNotifier&) {}
klao@946
   218
klao@946
   219
    /// Assign operator.
klao@946
   220
		
deba@1038
   221
    /// Assign operator for the AlterationNotifier. 
deba@1040
   222
    /// It makes the notifier only empty because the copiable
deba@1040
   223
    /// notifier's observers have to be registered still into that registry.
deba@1039
   224
    AlterationNotifier& operator=(const AlterationNotifier&) {
klao@946
   225
      typename Container::iterator it;
klao@946
   226
      for (it = container.begin(); it != container.end(); ++it) {
klao@946
   227
	(*it)->registry = 0;
klao@946
   228
      }
klao@946
   229
    }
klao@946
   230
klao@946
   231
    /// Destructor.
klao@946
   232
				
deba@1038
   233
    /// Destructor of the AlterationNotifier.
klao@946
   234
    ///
deba@1038
   235
    ~AlterationNotifier() {
klao@946
   236
      typename Container::iterator it;
klao@946
   237
      for (it = container.begin(); it != container.end(); ++it) {
klao@946
   238
	(*it)->registry = 0;
klao@946
   239
      }
klao@946
   240
    }
klao@946
   241
	
klao@946
   242
	
klao@946
   243
  protected:
klao@946
   244
klao@946
   245
    void attach(ObserverBase& observer) {
klao@946
   246
      container.push_back(&observer);
klao@946
   247
      observer.registry = this;
klao@946
   248
      observer.registry_index = container.size()-1;
klao@946
   249
    } 
klao@946
   250
klao@946
   251
    void detach(ObserverBase& base) {
klao@946
   252
      container.back()->registry_index = base.registry_index; 
klao@946
   253
      container[base.registry_index] = container.back();
klao@946
   254
      container.pop_back();
klao@946
   255
      base.registry = 0;
klao@946
   256
    }
klao@946
   257
klao@946
   258
  public:
klao@946
   259
	
deba@1414
   260
    /// \brief Notifies all the registered observers about an Item added to 
deba@1414
   261
    /// the container.
deba@1414
   262
    ///
deba@1414
   263
    /// It notifies all the registered observers about an Item added to 
deba@1414
   264
    /// the container.
klao@946
   265
    /// 
deba@1414
   266
    void add(const Item& item) {
klao@946
   267
      typename Container::iterator it;
klao@946
   268
      for (it = container.begin(); it != container.end(); ++it) {
deba@1414
   269
	(*it)->add(item);
klao@946
   270
      }
klao@946
   271
    }	
klao@946
   272
deba@1414
   273
    /// \brief Notifies all the registered observers about more Item added to 
deba@1414
   274
    /// the container.
deba@1414
   275
    ///
deba@1414
   276
    /// It notifies all the registered observers about more Item added to 
deba@1414
   277
    /// the container.
deba@1414
   278
    /// 
deba@1414
   279
    void add(const std::vector<Item>& items) {
deba@1414
   280
      typename Container::iterator it;
deba@1414
   281
      for (it = container.begin(); it != container.end(); ++it) {
deba@1414
   282
	(*it)->add(items);
deba@1414
   283
      }
deba@1414
   284
    }	
deba@1414
   285
deba@1414
   286
    /// \brief Notifies all the registered observers about an Item erased from 
deba@1414
   287
    /// the container.
deba@1414
   288
    ///	
deba@1414
   289
    /// It notifies all the registered observers about an Item erased from 
deba@1414
   290
    /// the container.
klao@946
   291
    /// 
klao@946
   292
    void erase(const Item& key) {
klao@946
   293
      typename Container::iterator it;
klao@946
   294
      for (it = container.begin(); it != container.end(); ++it) {
klao@946
   295
	(*it)->erase(key);
klao@946
   296
      }
klao@946
   297
    }
deba@1414
   298
deba@1414
   299
    /// \brief Notifies all the registered observers about more Item erased  
deba@1414
   300
    /// from the container.
deba@1414
   301
    ///	
deba@1414
   302
    /// It notifies all the registered observers about more Item erased from 
deba@1414
   303
    /// the container.
deba@1414
   304
    /// 
deba@1414
   305
    void erase(const std::vector<Item>& items) {
deba@1414
   306
      typename Container::iterator it;
deba@1414
   307
      for (it = container.begin(); it != container.end(); ++it) {
deba@1414
   308
	(*it)->erase(items);
deba@1414
   309
      }
deba@1414
   310
    }
klao@946
   311
deba@1414
   312
    /// \brief Notifies all the registered observers about the container is 
deba@1414
   313
    /// built.
deba@1414
   314
    ///		
alpar@1204
   315
    /// Notifies all the registered observers about the container is built
klao@946
   316
    /// from an empty container.
klao@946
   317
    void build() {
klao@946
   318
      typename Container::iterator it;
klao@946
   319
      for (it = container.begin(); it != container.end(); ++it) {
klao@946
   320
	(*it)->build();
klao@946
   321
      }
klao@946
   322
    }
klao@946
   323
klao@946
   324
deba@1414
   325
    /// \brief Notifies all the registered observers about all Items are 
deba@1414
   326
    /// erased.
deba@1414
   327
    ///
klao@946
   328
    /// Notifies all the registered observers about all Items are erased
klao@946
   329
    /// from the container.
klao@946
   330
    void clear() {
klao@946
   331
      typename Container::iterator it;
klao@946
   332
      for (it = container.begin(); it != container.end(); ++it) {
klao@946
   333
	(*it)->clear();
klao@946
   334
      }
klao@946
   335
    }
klao@946
   336
  };
klao@946
   337
klao@946
   338
klao@962
   339
  /// \brief Class to extend a graph with the functionality of alteration
klao@962
   340
  /// observing.
klao@962
   341
  ///
klao@962
   342
  /// AlterableGraphExtender extends the _Base graphs functionality with
klao@962
   343
  /// the possibility of alteration observing. It defines two observer
klao@962
   344
  /// registrys for the nodes and mapes.
klao@962
   345
  /// 
klao@962
   346
  /// \todo Document what "alteration observing" is. And probably find a
klao@962
   347
  /// better (shorter) name.
klao@946
   348
  ///
klao@946
   349
  /// \param _Base is the base class to extend.
klao@946
   350
  ///
klao@946
   351
  /// \pre _Base is conform to the BaseGraphComponent concept.
klao@946
   352
  ///
klao@962
   353
  /// \post AlterableGraphExtender<_Base> is conform to the
klao@962
   354
  /// AlterableGraphComponent concept.
klao@946
   355
  ///
klao@946
   356
  /// \author Balazs Dezso
klao@946
   357
klao@946
   358
  template <typename _Base> 
klao@946
   359
  class AlterableGraphExtender : public _Base {
klao@946
   360
  public:
klao@946
   361
klao@946
   362
    typedef AlterableGraphExtender Graph;
klao@946
   363
    typedef _Base Parent;
klao@946
   364
klao@946
   365
    typedef typename Parent::Node Node;
klao@946
   366
    typedef typename Parent::Edge Edge;
klao@946
   367
klao@962
   368
    /// The edge observer registry.
deba@1039
   369
    typedef AlterationNotifier<Edge> EdgeNotifier;
klao@946
   370
    /// The node observer registry.
deba@1039
   371
    typedef AlterationNotifier<Node> NodeNotifier;
klao@946
   372
klao@946
   373
klao@946
   374
  protected:
klao@946
   375
deba@1040
   376
    mutable EdgeNotifier edge_notifier;
klao@946
   377
deba@1040
   378
    mutable NodeNotifier node_notifier;
klao@946
   379
klao@946
   380
  public:
klao@946
   381
deba@1134
   382
    /// \brief Gives back the edge alteration notifier.
deba@1134
   383
    ///
deba@1134
   384
    /// Gives back the edge alteration notifier.
deba@1134
   385
    EdgeNotifier& getNotifier(Edge) const {
deba@1040
   386
      return edge_notifier;
klao@946
   387
    }
klao@946
   388
deba@1134
   389
    /// \brief Gives back the node alteration notifier.
deba@1134
   390
    ///
deba@1134
   391
    /// Gives back the node alteration notifier.
deba@1134
   392
    NodeNotifier& getNotifier(Node) const {
deba@1040
   393
      return node_notifier;
klao@946
   394
    }
klao@946
   395
klao@946
   396
    ~AlterableGraphExtender() {
deba@1040
   397
      node_notifier.clear();
deba@1040
   398
      edge_notifier.clear();
klao@946
   399
    }
klao@946
   400
    
klao@946
   401
  };
klao@946
   402
klao@962
   403
  /// \brief Class to extend an undirected graph with the functionality of
klao@962
   404
  /// alteration observing.
klao@962
   405
  ///
klao@962
   406
  /// \todo Document.
klao@962
   407
  ///
klao@962
   408
  /// \sa AlterableGraphExtender
klao@962
   409
  ///
klao@962
   410
  /// \bug This should be done some other way. Possibilities: template
klao@962
   411
  /// specialization (not very easy, if at all possible); some kind of
klao@962
   412
  /// enable_if boost technique?
klao@962
   413
klao@962
   414
  template <typename _Base> 
klao@962
   415
  class AlterableUndirGraphExtender
klao@962
   416
    : public AlterableGraphExtender<_Base> {
klao@962
   417
  public:
klao@962
   418
klao@962
   419
    typedef AlterableUndirGraphExtender Graph;
klao@962
   420
    typedef AlterableGraphExtender<_Base> Parent;
klao@962
   421
klao@962
   422
    typedef typename Parent::UndirEdge UndirEdge;
klao@962
   423
klao@962
   424
    /// The edge observer registry.
deba@1039
   425
    typedef AlterationNotifier<UndirEdge> UndirEdgeNotifier;
klao@962
   426
klao@962
   427
  protected:
klao@962
   428
deba@1040
   429
    mutable UndirEdgeNotifier undir_edge_notifier;
klao@962
   430
klao@1022
   431
  public:
klao@1022
   432
deba@1038
   433
    using Parent::getNotifier;
deba@1039
   434
    UndirEdgeNotifier& getNotifier(UndirEdge) const {
deba@1040
   435
      return undir_edge_notifier;
klao@962
   436
    }
klao@962
   437
klao@962
   438
    ~AlterableUndirGraphExtender() {
deba@1040
   439
      undir_edge_notifier.clear();
klao@962
   440
    }
klao@962
   441
  };
klao@946
   442
  
klao@946
   443
/// @}
klao@946
   444
  
klao@946
   445
klao@946
   446
}
klao@946
   447
klao@946
   448
#endif