[906] | 1 | /* -*- C++ -*- |
---|
[1435] | 2 | * lemon/default_map.h - Part of LEMON, a generic C++ optimization library |
---|
[906] | 3 | * |
---|
[1164] | 4 | * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
[1359] | 5 | * (Egervary Research Group on Combinatorial Optimization, EGRES). |
---|
[906] | 6 | * |
---|
| 7 | * Permission to use, modify and distribute this software is granted |
---|
| 8 | * provided that this copyright notice appears in all copies. For |
---|
| 9 | * precise terms see the accompanying LICENSE file. |
---|
| 10 | * |
---|
| 11 | * This software is provided "AS IS" with no warranty of any kind, |
---|
| 12 | * express or implied, and with no claim as to its suitability for any |
---|
| 13 | * purpose. |
---|
| 14 | * |
---|
| 15 | */ |
---|
| 16 | |
---|
[921] | 17 | #ifndef LEMON_DEFAULT_MAP_H |
---|
| 18 | #define LEMON_DEFAULT_MAP_H |
---|
[822] | 19 | |
---|
| 20 | |
---|
[1307] | 21 | #include <lemon/bits/array_map.h> |
---|
| 22 | #include <lemon/bits/vector_map.h> |
---|
[822] | 23 | |
---|
[1587] | 24 | ///\ingroup graphmapfactory |
---|
[822] | 25 | ///\file |
---|
[946] | 26 | ///\brief Graph maps that construct and destruct |
---|
[822] | 27 | ///their elements dynamically. |
---|
| 28 | |
---|
[921] | 29 | namespace lemon { |
---|
[822] | 30 | |
---|
| 31 | |
---|
[1267] | 32 | template <typename _Graph, typename _Item, typename _Value> |
---|
[946] | 33 | struct DefaultMapSelector { |
---|
[1267] | 34 | typedef ArrayMap<_Graph, _Item, _Value> Map; |
---|
[946] | 35 | }; |
---|
[822] | 36 | |
---|
[946] | 37 | // bool |
---|
[1267] | 38 | template <typename _Graph, typename _Item> |
---|
| 39 | struct DefaultMapSelector<_Graph, _Item, bool> { |
---|
[980] | 40 | typedef VectorMap<_Graph, _Item, bool> Map; |
---|
[946] | 41 | }; |
---|
[822] | 42 | |
---|
[946] | 43 | // char |
---|
[1267] | 44 | template <typename _Graph, typename _Item> |
---|
| 45 | struct DefaultMapSelector<_Graph, _Item, char> { |
---|
[980] | 46 | typedef VectorMap<_Graph, _Item, char> Map; |
---|
[946] | 47 | }; |
---|
[822] | 48 | |
---|
[1267] | 49 | template <typename _Graph, typename _Item> |
---|
| 50 | struct DefaultMapSelector<_Graph, _Item, signed char> { |
---|
[980] | 51 | typedef VectorMap<_Graph, _Item, signed char> Map; |
---|
[946] | 52 | }; |
---|
[822] | 53 | |
---|
[1267] | 54 | template <typename _Graph, typename _Item> |
---|
| 55 | struct DefaultMapSelector<_Graph, _Item, unsigned char> { |
---|
[980] | 56 | typedef VectorMap<_Graph, _Item, unsigned char> Map; |
---|
[946] | 57 | }; |
---|
[822] | 58 | |
---|
| 59 | |
---|
[946] | 60 | // int |
---|
[1267] | 61 | template <typename _Graph, typename _Item> |
---|
| 62 | struct DefaultMapSelector<_Graph, _Item, signed int> { |
---|
[980] | 63 | typedef VectorMap<_Graph, _Item, signed int> Map; |
---|
[946] | 64 | }; |
---|
[822] | 65 | |
---|
[1267] | 66 | template <typename _Graph, typename _Item> |
---|
| 67 | struct DefaultMapSelector<_Graph, _Item, unsigned int> { |
---|
[980] | 68 | typedef VectorMap<_Graph, _Item, unsigned int> Map; |
---|
[946] | 69 | }; |
---|
[822] | 70 | |
---|
| 71 | |
---|
[946] | 72 | // short |
---|
[1267] | 73 | template <typename _Graph, typename _Item> |
---|
| 74 | struct DefaultMapSelector<_Graph, _Item, signed short> { |
---|
[980] | 75 | typedef VectorMap<_Graph, _Item, signed short> Map; |
---|
[946] | 76 | }; |
---|
[822] | 77 | |
---|
[1267] | 78 | template <typename _Graph, typename _Item> |
---|
| 79 | struct DefaultMapSelector<_Graph, _Item, unsigned short> { |
---|
[980] | 80 | typedef VectorMap<_Graph, _Item, unsigned short> Map; |
---|
[946] | 81 | }; |
---|
| 82 | |
---|
| 83 | |
---|
| 84 | // long |
---|
[1267] | 85 | template <typename _Graph, typename _Item> |
---|
| 86 | struct DefaultMapSelector<_Graph, _Item, signed long> { |
---|
[980] | 87 | typedef VectorMap<_Graph, _Item, signed long> Map; |
---|
[946] | 88 | }; |
---|
| 89 | |
---|
[1267] | 90 | template <typename _Graph, typename _Item> |
---|
| 91 | struct DefaultMapSelector<_Graph, _Item, unsigned long> { |
---|
[980] | 92 | typedef VectorMap<_Graph, _Item, unsigned long> Map; |
---|
[946] | 93 | }; |
---|
| 94 | |
---|
| 95 | // \todo handling long long type |
---|
| 96 | |
---|
| 97 | |
---|
| 98 | // float |
---|
[1267] | 99 | template <typename _Graph, typename _Item> |
---|
| 100 | struct DefaultMapSelector<_Graph, _Item, float> { |
---|
[980] | 101 | typedef VectorMap<_Graph, _Item, float> Map; |
---|
[946] | 102 | }; |
---|
| 103 | |
---|
| 104 | |
---|
| 105 | // double |
---|
[1267] | 106 | template <typename _Graph, typename _Item> |
---|
| 107 | struct DefaultMapSelector<_Graph, _Item, double> { |
---|
[980] | 108 | typedef VectorMap<_Graph, _Item, double> Map; |
---|
[946] | 109 | }; |
---|
| 110 | |
---|
| 111 | |
---|
| 112 | // long double |
---|
[1267] | 113 | template <typename _Graph, typename _Item> |
---|
| 114 | struct DefaultMapSelector<_Graph, _Item, long double> { |
---|
[980] | 115 | typedef VectorMap<_Graph, _Item, long double> Map; |
---|
[946] | 116 | }; |
---|
| 117 | |
---|
| 118 | |
---|
| 119 | // pointer |
---|
[1267] | 120 | template <typename _Graph, typename _Item, typename _Ptr> |
---|
| 121 | struct DefaultMapSelector<_Graph, _Item, _Ptr*> { |
---|
[980] | 122 | typedef VectorMap<_Graph, _Item, _Ptr*> Map; |
---|
[946] | 123 | }; |
---|
| 124 | |
---|
[1669] | 125 | /// \e |
---|
[1267] | 126 | template < |
---|
| 127 | typename _Graph, |
---|
| 128 | typename _Item, |
---|
| 129 | typename _Value> |
---|
| 130 | class DefaultMap |
---|
| 131 | : public DefaultMapSelector<_Graph, _Item, _Value>::Map { |
---|
[946] | 132 | public: |
---|
[1267] | 133 | typedef typename DefaultMapSelector<_Graph, _Item, _Value>::Map Parent; |
---|
| 134 | typedef DefaultMap<_Graph, _Item, _Value> Map; |
---|
[946] | 135 | |
---|
| 136 | typedef typename Parent::Graph Graph; |
---|
[987] | 137 | typedef typename Parent::Value Value; |
---|
[946] | 138 | |
---|
[980] | 139 | DefaultMap(const Graph& _g) : Parent(_g) {} |
---|
[987] | 140 | DefaultMap(const Graph& _g, const Value& _v) : Parent(_g, _v) {} |
---|
[1669] | 141 | |
---|
[946] | 142 | }; |
---|
| 143 | |
---|
| 144 | |
---|
[1669] | 145 | /// \e |
---|
[946] | 146 | template <typename _Base> |
---|
[1669] | 147 | class MappableGraphExtender : public _Base { |
---|
[946] | 148 | public: |
---|
| 149 | |
---|
[1669] | 150 | typedef MappableGraphExtender<_Base> Graph; |
---|
[946] | 151 | typedef _Base Parent; |
---|
| 152 | |
---|
| 153 | typedef typename Parent::Node Node; |
---|
| 154 | typedef typename Parent::NodeIt NodeIt; |
---|
| 155 | |
---|
| 156 | typedef typename Parent::Edge Edge; |
---|
| 157 | typedef typename Parent::EdgeIt EdgeIt; |
---|
| 158 | |
---|
| 159 | |
---|
| 160 | template <typename _Value> |
---|
[1267] | 161 | class NodeMap |
---|
| 162 | : public IterableMapExtender<DefaultMap<Graph, Node, _Value> > { |
---|
[946] | 163 | public: |
---|
[1669] | 164 | typedef MappableGraphExtender Graph; |
---|
[1267] | 165 | typedef IterableMapExtender<DefaultMap<Graph, Node, _Value> > Parent; |
---|
[946] | 166 | |
---|
[980] | 167 | NodeMap(const Graph& _g) |
---|
| 168 | : Parent(_g) {} |
---|
[1022] | 169 | NodeMap(const Graph& _g, const _Value& _v) |
---|
[980] | 170 | : Parent(_g, _v) {} |
---|
[1669] | 171 | |
---|
[1672] | 172 | NodeMap& operator=(const NodeMap& cmap) { |
---|
| 173 | return operator=<NodeMap>(cmap); |
---|
| 174 | } |
---|
| 175 | |
---|
| 176 | |
---|
[1669] | 177 | /// \brief Template assign operator. |
---|
| 178 | /// |
---|
| 179 | /// The given parameter should be conform to the ReadMap |
---|
| 180 | /// concecpt and could be indiced by the current item set of |
---|
| 181 | /// the NodeMap. In this case the value for each item |
---|
| 182 | /// is assigned by the value of the given ReadMap. |
---|
| 183 | template <typename CMap> |
---|
| 184 | NodeMap& operator=(const CMap& cmap) { |
---|
| 185 | checkConcept<concept::ReadMap<Node, _Value>, CMap>(); |
---|
| 186 | const typename Parent::Graph* graph = Parent::getGraph(); |
---|
| 187 | Node it; |
---|
| 188 | for (graph->first(it); it != INVALID; graph->next(it)) { |
---|
| 189 | Parent::set(it, cmap[it]); |
---|
| 190 | } |
---|
| 191 | return *this; |
---|
| 192 | } |
---|
| 193 | |
---|
[946] | 194 | }; |
---|
| 195 | |
---|
| 196 | template <typename _Value> |
---|
[1267] | 197 | class EdgeMap |
---|
| 198 | : public IterableMapExtender<DefaultMap<Graph, Edge, _Value> > { |
---|
[946] | 199 | public: |
---|
[1669] | 200 | typedef MappableGraphExtender Graph; |
---|
[1267] | 201 | typedef IterableMapExtender<DefaultMap<Graph, Edge, _Value> > Parent; |
---|
[946] | 202 | |
---|
[980] | 203 | EdgeMap(const Graph& _g) |
---|
| 204 | : Parent(_g) {} |
---|
[1022] | 205 | EdgeMap(const Graph& _g, const _Value& _v) |
---|
[980] | 206 | : Parent(_g, _v) {} |
---|
[1669] | 207 | |
---|
[1672] | 208 | EdgeMap& operator=(const EdgeMap& cmap) { |
---|
| 209 | return operator=<EdgeMap>(cmap); |
---|
| 210 | } |
---|
| 211 | |
---|
[1669] | 212 | template <typename CMap> |
---|
| 213 | EdgeMap& operator=(const CMap& cmap) { |
---|
| 214 | checkConcept<concept::ReadMap<Edge, _Value>, CMap>(); |
---|
| 215 | const typename Parent::Graph* graph = Parent::getGraph(); |
---|
| 216 | Edge it; |
---|
| 217 | for (graph->first(it); it != INVALID; graph->next(it)) { |
---|
| 218 | Parent::set(it, cmap[it]); |
---|
| 219 | } |
---|
| 220 | return *this; |
---|
| 221 | } |
---|
[946] | 222 | }; |
---|
| 223 | |
---|
| 224 | }; |
---|
| 225 | |
---|
[1669] | 226 | /// \e |
---|
[1022] | 227 | template <typename _Base> |
---|
| 228 | class MappableUndirGraphExtender : |
---|
[1669] | 229 | public MappableGraphExtender<_Base> { |
---|
[1022] | 230 | public: |
---|
| 231 | |
---|
| 232 | typedef MappableUndirGraphExtender Graph; |
---|
[1669] | 233 | typedef MappableGraphExtender<_Base> Parent; |
---|
[1022] | 234 | |
---|
| 235 | typedef typename Parent::UndirEdge UndirEdge; |
---|
| 236 | |
---|
| 237 | template <typename _Value> |
---|
[1267] | 238 | class UndirEdgeMap |
---|
| 239 | : public IterableMapExtender<DefaultMap<Graph, UndirEdge, _Value> > { |
---|
[1022] | 240 | public: |
---|
| 241 | typedef MappableUndirGraphExtender Graph; |
---|
[1267] | 242 | typedef IterableMapExtender< |
---|
| 243 | DefaultMap<Graph, UndirEdge, _Value> > Parent; |
---|
[1022] | 244 | |
---|
| 245 | UndirEdgeMap(const Graph& _g) |
---|
| 246 | : Parent(_g) {} |
---|
| 247 | UndirEdgeMap(const Graph& _g, const _Value& _v) |
---|
| 248 | : Parent(_g, _v) {} |
---|
[1669] | 249 | |
---|
[1672] | 250 | UndirEdgeMap& operator=(const UndirEdgeMap& cmap) { |
---|
| 251 | return operator=<UndirEdgeMap>(cmap); |
---|
| 252 | } |
---|
| 253 | |
---|
[1669] | 254 | template <typename CMap> |
---|
| 255 | UndirEdgeMap& operator=(const CMap& cmap) { |
---|
| 256 | checkConcept<concept::ReadMap<UndirEdge, _Value>, CMap>(); |
---|
| 257 | const typename Parent::Graph* graph = Parent::getGraph(); |
---|
| 258 | UndirEdge it; |
---|
| 259 | for (graph->first(it); it != INVALID; graph->next(it)) { |
---|
| 260 | Parent::set(it, cmap[it]); |
---|
| 261 | } |
---|
| 262 | return *this; |
---|
| 263 | } |
---|
[1022] | 264 | }; |
---|
| 265 | |
---|
| 266 | |
---|
| 267 | }; |
---|
[822] | 268 | |
---|
| 269 | } |
---|
| 270 | |
---|
| 271 | #endif |
---|