Changeset 2258:741995f3dbc4 in lemon-0.x for lemon/maps.h
- Timestamp:
- 10/22/06 21:45:57 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3013
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/maps.h
r2248 r2258 1019 1019 1020 1020 ///This bool \ref concept::ReadWriteMap "read-write map" returns the 1021 ///logical negation of value returned by the given map. It is setted1022 ///the n the negation of the value be settedto the original map.1021 ///logical negation of value returned by the given map. When it is set, 1022 ///the opposite value is set to the original map. 1023 1023 ///Its \c Key and will be inherited from \c M, 1024 1024 ///its Value is <tt>bool</tt>. … … 1065 1065 /// \brief Writable bool map for store each true assigned elements. 1066 1066 /// 1067 /// Writable bool map forstore each true assigned elements. It will1068 /// copies all the true setted keysto the given iterator.1067 /// Writable bool map to store each true assigned elements. It will 1068 /// copies all the keys set to true to the given iterator. 1069 1069 /// 1070 1070 /// \note The container of the iterator should contain space … … 1101 1101 : _begin(it), _end(it), _functor(functor) {} 1102 1102 1103 /// Gives back the given first setted iterator.1103 /// Gives back the given iterator set for the first time. 1104 1104 Iterator begin() const { 1105 1105 return _begin; 1106 1106 } 1107 1107 1108 /// Gives back the iterator after the last set ted.1108 /// Gives back the iterator after the last set operation. 1109 1109 Iterator end() const { 1110 1110 return _end; … … 1127 1127 /// 1128 1128 /// Writable bool map for store each true assigned elements in a back 1129 /// insertable container. It will push back all the true setted keysinto1129 /// insertable container. It will push back all the keys set to true into 1130 1130 /// the container. It can be used to retrieve the items into a standard 1131 1131 /// container. The next example shows how can you store the undirected … … 1166 1166 /// 1167 1167 /// Writable bool map for store each true assigned elements in a front 1168 /// insertable container. It will push front all the true setted keysinto1168 /// insertable container. It will push front all the keys set to \c true into 1169 1169 /// the container. For example see the BackInserterBoolMap. 1170 1170 template <typename Container, … … 1197 1197 /// 1198 1198 /// Writable bool map for store each true assigned elements in an 1199 /// insertable container. It will insert all the true setted keysinto1199 /// insertable container. It will insert all the keys set to \c true into 1200 1200 /// the container. If you want to store the cut edges of the strongly 1201 1201 /// connected components in a set you can use the next code: … … 1237 1237 }; 1238 1238 1239 /// \brief Fill the true set tedelements with a given value.1240 /// 1241 /// Writable bool map for fill the true setted elementswith a given value.1242 /// The value can be setted1239 /// \brief Fill the true set elements with a given value. 1240 /// 1241 /// Writable bool map to fill the elements set to \c true with a given value. 1242 /// The value can set 1243 1243 /// the container. 1244 1244 /// … … 1363 1363 : map(_map), counter(0) {} 1364 1364 1365 /// Number of set ted keys.1365 /// Number of set operations. 1366 1366 int num() const { 1367 1367 return counter;
Note: See TracChangeset
for help on using the changeset viewer.