Changeset 1703:eb90e3d6bddc in lemon-0.x for lemon/bits/vector_map.h
- Timestamp:
- 10/05/05 15:15:47 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2230
- File:
-
- 1 edited
-
lemon/bits/vector_map.h (modified) (10 diffs)
Legend:
- Unmodified
- Added
- Removed
-
lemon/bits/vector_map.h
r1669 r1703 45 45 /// 46 46 /// \param Registry The AlterationNotifier that will notify this map. 47 /// \param I dMap The IdMaptype of the graph items.47 /// \param Item The item type of the graph items. 48 48 /// \param Value The value type of the map. 49 49 /// 50 50 /// \author Balazs Dezso 51 51 52 53 52 template < 54 53 typename _Graph, … … 58 57 class VectorMap : public AlterationNotifier<_Item>::ObserverBase { 59 58 public: 59 60 typedef True AdaptibleTag; 60 61 61 62 /// The graph type of the map. … … 94 95 typedef True FullTypeTag; 95 96 96 /// Constructor to attach the new map into the registry.97 98 /// It constru ates 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. 99 100 /// It adds all the items of the graph to the map. 100 101 101 VectorMap(const Graph& _g) : graph(&_g) { 102 102 attach(_g.getNotifier(_Item())); … … 104 104 } 105 105 106 /// Constructor uses given value to initialize the map.107 108 /// It constru ates 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. 109 109 /// It adds all the items of the graph to the map. 110 111 110 VectorMap(const Graph& _g, const Value& _v) : graph(&_g) { 112 111 attach(_g.getNotifier(_Item())); … … 114 113 } 115 114 115 /// \brief Copy constructor 116 /// 117 /// Copy constructor. 116 118 VectorMap(const VectorMap& _copy) 117 119 : Parent(), graph(_copy.getGraph()) { … … 122 124 } 123 125 126 /// \brief Destrcutor 127 /// 128 /// Destructor. 124 129 virtual ~VectorMap() { 125 130 if (attached()) { … … 145 150 public: 146 151 147 /// The subcript operator.148 152 /// \brief The subcript operator. 153 /// 149 154 /// The subscript operator. The map can be subscripted by the 150 /// actual items of the graph. 151 155 /// actual items of the graph. 152 156 Reference operator[](const Key& key) { 153 157 return container[graph->id(key)]; 154 158 } 155 159 156 /// The const subcript operator.157 160 /// \brief The const subcript operator. 161 /// 158 162 /// The const subscript operator. The map can be subscripted by the 159 163 /// actual items of the graph. 160 161 164 ConstReference operator[](const Key& key) const { 162 165 return container[graph->id(key)]; … … 164 167 165 168 166 /// The setter function of the map.167 169 /// \brief The setter function of the map. 170 /// 168 171 /// It the same as operator[](key) = value expression. 169 ///170 172 void set(const Key& key, const Value& value) { 171 173 (*this)[key] = value; … … 177 179 /// 178 180 /// 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) { 182 183 int id = graph->id(key); 183 184 if (id >= (int)container.size()) { … … 186 187 } 187 188 188 /// Erasesa key from the map.189 189 /// \brief Erase a key from the map. 190 /// 190 191 /// Erase a key from the map. It called by the observer registry 191 192 /// and it overrides the erase() member function of the observer base. 192 v oid erase(const Key&) {}193 194 /// Buildes the map.195 193 virtual void erase(const Key&) {} 194 195 /// \brief Buildes the map. 196 /// 196 197 /// It buildes the map. It called by the observer registry 197 198 /// and it overrides the build() member function of the observer base. 198 199 void build() { 199 virtual void build() { 200 200 container.resize(graph->maxId(_Item()) + 1); 201 201 } 202 202 203 /// Clear the map.204 203 /// \brief Clear the map. 204 /// 205 205 /// It erase all items from the map. It called by the observer registry 206 206 /// and it overrides the clear() member function of the observer base. 207 v oid clear() {207 virtual void clear() { 208 208 container.clear(); 209 209 }
Note: See TracChangeset
for help on using the changeset viewer.
