Changes in lemon/maps.h [694:71939d63ae77:721:99124ea4f048] in lemon-1.2
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/maps.h
r694 r721 1826 1826 /// the items stored in the graph, which is returned by the \c id() 1827 1827 /// function of the graph. This map can be inverted with its member 1828 /// class \c InverseMap or with the \c operator() member.1828 /// class \c InverseMap or with the \c operator()() member. 1829 1829 /// 1830 1830 /// \tparam GR The graph type. … … 1902 1902 1903 1903 /// This class provides simple invertable graph maps. 1904 /// It wraps an arbitrary \ref concepts::ReadWriteMap "ReadWriteMap" 1905 /// and if a key is set to a new value then store it 1906 /// in the inverse map. 1904 /// It wraps a standard graph map (\c NodeMap, \c ArcMap or \c EdgeMap) 1905 /// and if a key is set to a new value, then stores it in the inverse map. 1907 1906 /// The values of the map can be accessed 1908 1907 /// with stl compatible forward iterator. 1909 1908 /// 1910 1909 /// This type is not reference map, so it cannot be modified with 1911 /// the subscript ionoperator.1910 /// the subscript operator. 1912 1911 /// 1913 1912 /// \tparam GR The graph type. … … 1925 1924 template Map<V>::Type Map; 1926 1925 1927 typedef std::m ap<V, K> Container;1926 typedef std::multimap<V, K> Container; 1928 1927 Container _inv_map; 1929 1928 … … 1950 1949 /// iterator on the values of the map. The values can 1951 1950 /// be accessed in the <tt>[beginValue, endValue)</tt> range. 1951 /// They are considered with multiplicity, so each value is 1952 /// traversed for each item it is assigned to. 1952 1953 class ValueIterator 1953 1954 : public std::iterator<std::forward_iterator_tag, Value> { … … 2002 2003 void set(const Key& key, const Value& val) { 2003 2004 Value oldval = Map::operator[](key); 2004 typename Container::iterator it = _inv_map.find(oldval); 2005 if (it != _inv_map.end() && it->second == key) { 2006 _inv_map.erase(it); 2005 typename Container::iterator it; 2006 for (it = _inv_map.equal_range(oldval).first; 2007 it != _inv_map.equal_range(oldval).second; ++it) { 2008 if (it->second == key) { 2009 _inv_map.erase(it); 2010 break; 2011 } 2007 2012 } 2008 2013 _inv_map.insert(std::make_pair(val, key)); … … 2018 2023 } 2019 2024 2020 /// \brief Gives back the item by its value. 2021 /// 2022 /// Gives back the item by its value. 2023 Key operator()(const Value& key) const { 2024 typename Container::const_iterator it = _inv_map.find(key); 2025 /// \brief Gives back an item by its value. 2026 /// 2027 /// This function gives back an item that is assigned to 2028 /// the given value or \c INVALID if no such item exists. 2029 /// If there are more items with the same associated value, 2030 /// only one of them is returned. 2031 Key operator()(const Value& val) const { 2032 typename Container::const_iterator it = _inv_map.find(val); 2025 2033 return it != _inv_map.end() ? it->second : INVALID; 2034 } 2035 2036 /// \brief Returns the number of items with the given value. 2037 /// 2038 /// This function returns the number of items with the given value 2039 /// associated with it. 2040 int count(const Value &val) const { 2041 return _inv_map.count(val); 2026 2042 } 2027 2043 … … 2034 2050 virtual void erase(const Key& key) { 2035 2051 Value val = Map::operator[](key); 2036 typename Container::iterator it = _inv_map.find(val); 2037 if (it != _inv_map.end() && it->second == key) { 2038 _inv_map.erase(it); 2052 typename Container::iterator it; 2053 for (it = _inv_map.equal_range(val).first; 2054 it != _inv_map.equal_range(val).second; ++it) { 2055 if (it->second == key) { 2056 _inv_map.erase(it); 2057 break; 2058 } 2039 2059 } 2040 2060 Map::erase(key); … … 2048 2068 for (int i = 0; i < int(keys.size()); ++i) { 2049 2069 Value val = Map::operator[](keys[i]); 2050 typename Container::iterator it = _inv_map.find(val); 2051 if (it != _inv_map.end() && it->second == keys[i]) { 2052 _inv_map.erase(it); 2070 typename Container::iterator it; 2071 for (it = _inv_map.equal_range(val).first; 2072 it != _inv_map.equal_range(val).second; ++it) { 2073 if (it->second == keys[i]) { 2074 _inv_map.erase(it); 2075 break; 2076 } 2053 2077 } 2054 2078 } … … 2086 2110 /// \brief Subscript operator. 2087 2111 /// 2088 /// Subscript operator. It gives back the item 2089 /// that was last assigned to the given value. 2112 /// Subscript operator. It gives back an item 2113 /// that is assigned to the given value or \c INVALID 2114 /// if no such item exists. 2090 2115 Value operator[](const Key& key) const { 2091 2116 return _inverted(key); … … 2105 2130 }; 2106 2131 2107 /// \brief Provides continuous and unique IDfor the2132 /// \brief Provides continuous and unique id for the 2108 2133 /// items of a graph. 2109 2134 /// 2110 2135 /// RangeIdMap provides a unique and continuous 2111 /// IDfor each item of a given type (\c Node, \c Arc or2136 /// id for each item of a given type (\c Node, \c Arc or 2112 2137 /// \c Edge) in a graph. This id is 2113 2138 /// - \b unique: different items get different ids, … … 2120 2145 /// the \c id() function of the graph or \ref IdMap. 2121 2146 /// This map can be inverted with its member class \c InverseMap, 2122 /// or with the \c operator() member.2147 /// or with the \c operator()() member. 2123 2148 /// 2124 2149 /// \tparam GR The graph type.
Note: See TracChangeset
for help on using the changeset viewer.