| ... |
... |
@@ -107,25 +107,25 @@
|
| 107 |
107 |
typedef typename Parent::Key Key;
|
| 108 |
108 |
typedef typename Parent::Value Value;
|
| 109 |
109 |
|
| 110 |
110 |
/// Default constructor
|
| 111 |
111 |
|
| 112 |
112 |
/// Default constructor.
|
| 113 |
113 |
/// The value of the map will be default constructed.
|
| 114 |
114 |
ConstMap() {}
|
| 115 |
115 |
|
| 116 |
116 |
/// Constructor with specified initial value
|
| 117 |
117 |
|
| 118 |
118 |
/// Constructor with specified initial value.
|
| 119 |
|
/// \param v is the initial value of the map.
|
|
119 |
/// \param v The initial value of the map.
|
| 120 |
120 |
ConstMap(const Value &v) : _value(v) {}
|
| 121 |
121 |
|
| 122 |
122 |
/// Gives back the specified value.
|
| 123 |
123 |
Value operator[](const Key&) const { return _value; }
|
| 124 |
124 |
|
| 125 |
125 |
/// Absorbs the value.
|
| 126 |
126 |
void set(const Key&, const Value&) {}
|
| 127 |
127 |
|
| 128 |
128 |
/// Sets the value that is assigned to each key.
|
| 129 |
129 |
void setAll(const Value &v) {
|
| 130 |
130 |
_value = v;
|
| 131 |
131 |
}
|
| ... |
... |
@@ -134,24 +134,29 @@
|
| 134 |
134 |
ConstMap(const ConstMap<K, V1> &, const Value &v) : _value(v) {}
|
| 135 |
135 |
};
|
| 136 |
136 |
|
| 137 |
137 |
/// Returns a \ref ConstMap class
|
| 138 |
138 |
|
| 139 |
139 |
/// This function just returns a \ref ConstMap class.
|
| 140 |
140 |
/// \relates ConstMap
|
| 141 |
141 |
template<typename K, typename V>
|
| 142 |
142 |
inline ConstMap<K, V> constMap(const V &v) {
|
| 143 |
143 |
return ConstMap<K, V>(v);
|
| 144 |
144 |
}
|
| 145 |
145 |
|
|
146 |
template<typename K, typename V>
|
|
147 |
inline ConstMap<K, V> constMap() {
|
|
148 |
return ConstMap<K, V>();
|
|
149 |
}
|
|
150 |
|
| 146 |
151 |
|
| 147 |
152 |
template<typename T, T v>
|
| 148 |
153 |
struct Const {};
|
| 149 |
154 |
|
| 150 |
155 |
/// Constant map with inlined constant value.
|
| 151 |
156 |
|
| 152 |
157 |
/// This \ref concepts::ReadMap "readable map" assigns a specified
|
| 153 |
158 |
/// value to each key.
|
| 154 |
159 |
///
|
| 155 |
160 |
/// In other aspects it is equivalent to \ref NullMap.
|
| 156 |
161 |
/// So it conforms the \ref concepts::ReadWriteMap "ReadWriteMap"
|
| 157 |
162 |
/// concept, but it absorbs the data written to it.
|
| ... |
... |
@@ -604,25 +609,25 @@
|
| 604 |
609 |
/// a functor typically does not provide \c argument_type and
|
| 605 |
610 |
/// \c result_type typedefs.
|
| 606 |
611 |
/// Parameter \c F is the type of the used functor.
|
| 607 |
612 |
///
|
| 608 |
613 |
/// The simplest way of using this map is through the functorToMap()
|
| 609 |
614 |
/// function.
|
| 610 |
615 |
///
|
| 611 |
616 |
/// \sa MapToFunctor
|
| 612 |
617 |
template<typename F,
|
| 613 |
618 |
typename K = typename F::argument_type,
|
| 614 |
619 |
typename V = typename F::result_type>
|
| 615 |
620 |
class FunctorToMap : public MapBase<K, V> {
|
| 616 |
|
const F &_f;
|
|
621 |
F _f;
|
| 617 |
622 |
public:
|
| 618 |
623 |
typedef MapBase<K, V> Parent;
|
| 619 |
624 |
typedef typename Parent::Key Key;
|
| 620 |
625 |
typedef typename Parent::Value Value;
|
| 621 |
626 |
|
| 622 |
627 |
/// Constructor
|
| 623 |
628 |
FunctorToMap(const F &f = F()) : _f(f) {}
|
| 624 |
629 |
/// \e
|
| 625 |
630 |
Value operator[](const Key &k) const { return _f(k); }
|
| 626 |
631 |
};
|
| 627 |
632 |
|
| 628 |
633 |
/// Returns a \ref FunctorToMap class
|