1.1 --- a/lemon/maps.h Sun Jul 13 16:46:56 2008 +0100
1.2 +++ b/lemon/maps.h Sun Jul 13 19:51:02 2008 +0100
1.3 @@ -1,6 +1,6 @@
1.4 -/* -*- C++ -*-
1.5 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
1.6 *
1.7 - * This file is a part of LEMON, a generic C++ optimization library
1.8 + * This file is a part of LEMON, a generic C++ optimization library.
1.9 *
1.10 * Copyright (C) 2003-2008
1.11 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.12 @@ -404,27 +404,27 @@
1.13 Reference operator[](const Key &k) {
1.14 typename Map::iterator it = _map.lower_bound(k);
1.15 if (it != _map.end() && !_map.key_comp()(k, it->first))
1.16 - return it->second;
1.17 + return it->second;
1.18 else
1.19 - return _map.insert(it, std::make_pair(k, _value))->second;
1.20 + return _map.insert(it, std::make_pair(k, _value))->second;
1.21 }
1.22
1.23 ///\e
1.24 ConstReference operator[](const Key &k) const {
1.25 typename Map::const_iterator it = _map.find(k);
1.26 if (it != _map.end())
1.27 - return it->second;
1.28 + return it->second;
1.29 else
1.30 - return _value;
1.31 + return _value;
1.32 }
1.33
1.34 ///\e
1.35 void set(const Key &k, const Value &v) {
1.36 typename Map::iterator it = _map.lower_bound(k);
1.37 if (it != _map.end() && !_map.key_comp()(k, it->first))
1.38 - it->second = v;
1.39 + it->second = v;
1.40 else
1.41 - _map.insert(it, std::make_pair(k, v));
1.42 + _map.insert(it, std::make_pair(k, v));
1.43 }
1.44
1.45 ///\e
1.46 @@ -544,7 +544,7 @@
1.47 ///
1.48 /// \todo Check the requirements.
1.49 template<typename M1, typename M2, typename F,
1.50 - typename V = typename F::result_type>
1.51 + typename V = typename F::result_type>
1.52 class CombineMap : public MapBase<typename M1::Key, V> {
1.53 const M1 &_m1;
1.54 const M2 &_m2;
1.55 @@ -615,8 +615,8 @@
1.56 ///
1.57 /// \sa MapToFunctor
1.58 template<typename F,
1.59 - typename K = typename F::argument_type,
1.60 - typename V = typename F::result_type>
1.61 + typename K = typename F::argument_type,
1.62 + typename V = typename F::result_type>
1.63 class FunctorToMap : public MapBase<K, V> {
1.64 F _f;
1.65 public:
1.66 @@ -1317,7 +1317,7 @@
1.67 }
1.68
1.69 /// @}
1.70 -
1.71 +
1.72 // Logical maps and map adaptors:
1.73
1.74 /// \addtogroup maps
1.75 @@ -1715,7 +1715,7 @@
1.76 template <typename It, typename Ke>
1.77 #else
1.78 template <typename It,
1.79 - typename Ke=typename _maps_bits::IteratorTraits<It>::Value>
1.80 + typename Ke=typename _maps_bits::IteratorTraits<It>::Value>
1.81 #endif
1.82 class LoggerBoolMap {
1.83 public:
1.84 @@ -1741,7 +1741,7 @@
1.85 /// The set function of the map
1.86 void set(const Key& key, Value value) {
1.87 if (value) {
1.88 - *_end++ = key;
1.89 + *_end++ = key;
1.90 }
1.91 }
1.92
1.93 @@ -1749,7 +1749,7 @@
1.94 Iterator _begin;
1.95 Iterator _end;
1.96 };
1.97 -
1.98 +
1.99 /// Returns a \ref LoggerBoolMap class
1.100
1.101 /// This function just returns a \ref LoggerBoolMap class.