COIN-OR::LEMON - Graph Library

Changeset 1703:eb90e3d6bddc in lemon-0.x for lemon/bits/vector_map.h


Ignore:
Timestamp:
10/05/05 15:15:47 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2230
Message:

Proper sized map type

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/bits/vector_map.h

    r1669 r1703  
    4545  ///
    4646  /// \param Registry The AlterationNotifier that will notify this map.
    47   /// \param IdMap The IdMap type of the graph items.
     47  /// \param Item The item type of the graph items.
    4848  /// \param Value The value type of the map.
    4949  ///
    5050  /// \author Balazs Dezso
    5151       
    52 
    5352  template <
    5453    typename _Graph,
     
    5857  class VectorMap : public AlterationNotifier<_Item>::ObserverBase {
    5958  public:
     59
     60    typedef True AdaptibleTag;
    6061               
    6162    /// The graph type of the map.
     
    9495    typedef True FullTypeTag;
    9596
    96     /// Constructor to attach the new map into the registry.
    97 
    98     /// It construates a map and attachs it into the registry.
     97    /// \brief Constructor to attach the new map into the registry.
     98    ///
     99    /// It constructs a map and attachs it into the registry.
    99100    /// It adds all the items of the graph to the map.
    100      
    101101    VectorMap(const Graph& _g) : graph(&_g) {
    102102      attach(_g.getNotifier(_Item()));
     
    104104    }
    105105
    106     /// Constructor uses given value to initialize the map.
    107 
    108     /// It construates a map uses a given value to initialize the map.
     106    /// \brief Constructor uses given value to initialize the map.
     107    ///
     108    /// It constructs a map uses a given value to initialize the map.
    109109    /// It adds all the items of the graph to the map.
    110      
    111110    VectorMap(const Graph& _g, const Value& _v) : graph(&_g) {
    112111      attach(_g.getNotifier(_Item()));
     
    114113    }
    115114
     115    /// \brief Copy constructor
     116    ///
     117    /// Copy constructor.
    116118    VectorMap(const VectorMap& _copy)
    117119      : Parent(), graph(_copy.getGraph()) {
     
    122124    }
    123125
     126    /// \brief Destrcutor
     127    ///
     128    /// Destructor.
    124129    virtual ~VectorMap() {
    125130      if (attached()) {
     
    145150  public:
    146151
    147     /// The subcript operator.
    148 
     152    /// \brief The subcript operator.
     153    ///
    149154    /// The subscript operator. The map can be subscripted by the
    150     /// actual items of the graph.
    151      
     155    /// actual items of the graph.     
    152156    Reference operator[](const Key& key) {
    153157      return container[graph->id(key)];
    154158    }
    155159               
    156     /// The const subcript operator.
    157 
     160    /// \brief The const subcript operator.
     161    ///
    158162    /// The const subscript operator. The map can be subscripted by the
    159163    /// actual items of the graph.
    160      
    161164    ConstReference operator[](const Key& key) const {
    162165      return container[graph->id(key)];
     
    164167
    165168
    166     /// The setter function of the map.
    167 
     169    /// \brief The setter function of the map.
     170    ///
    168171    /// It the same as operator[](key) = value expression.
    169     ///
    170172    void set(const Key& key, const Value& value) {
    171173      (*this)[key] = value;
     
    177179    ///         
    178180    /// It adds a new key to the map. It called by the observer registry
    179     /// and it overrides the add() member function of the observer base.
    180      
    181     void add(const Key& key) {
     181    /// and it overrides the add() member function of the observer base.     
     182    virtual void add(const Key& key) {
    182183      int id = graph->id(key);
    183184      if (id >= (int)container.size()) {
     
    186187    }
    187188
    188     /// Erases a key from the map.
    189                
     189    /// \brief Erase a key from the map.
     190    ///
    190191    /// Erase a key from the map. It called by the observer registry
    191192    /// and it overrides the erase() member function of the observer base.     
    192     void erase(const Key&) {}
    193 
    194     /// Buildes the map.
    195                
     193    virtual void erase(const Key&) {}
     194
     195    /// \brief Buildes the map.
     196    ///
    196197    /// It buildes the map. It called by the observer registry
    197198    /// and it overrides the build() member function of the observer base.
    198 
    199     void build() {
     199    virtual void build() {
    200200      container.resize(graph->maxId(_Item()) + 1);
    201201    }
    202202
    203     /// Clear the map.
    204 
     203    /// \brief Clear the map.
     204    ///
    205205    /// It erase all items from the map. It called by the observer registry
    206206    /// and it overrides the clear() member function of the observer base.     
    207     void clear() {
     207    virtual void clear() {
    208208      container.clear();
    209209    }
Note: See TracChangeset for help on using the changeset viewer.