/usr/include/vigra/graph_maps.hxx is in libvigraimpex-dev 1.10.0+git20160211.167be93+dfsg-2+b5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 | /************************************************************************/
/* */
/* Copyright 2014 by Ullrich Koethe and Thorsten Beier */
/* */
/* This file is part of the VIGRA computer vision library. */
/* The VIGRA Website is */
/* http://hci.iwr.uni-heidelberg.de/vigra/ */
/* Please direct questions, bug reports, and contributions to */
/* ullrich.koethe@iwr.uni-heidelberg.de or */
/* vigra@informatik.uni-hamburg.de */
/* */
/* Permission is hereby granted, free of charge, to any person */
/* obtaining a copy of this software and associated documentation */
/* files (the "Software"), to deal in the Software without */
/* restriction, including without limitation the rights to use, */
/* copy, modify, merge, publish, distribute, sublicense, and/or */
/* sell copies of the Software, and to permit persons to whom the */
/* Software is furnished to do so, subject to the following */
/* conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the */
/* Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES */
/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND */
/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT */
/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, */
/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING */
/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR */
/* OTHER DEALINGS IN THE SOFTWARE. */
/* */
/************************************************************************/
#ifndef VIGRA_GRAPH_MAPS
#define VIGRA_GRAPH_MAPS
/*vigra*/
#include "multi_array.hxx"
#include "graph_generalization.hxx"
#include "graphs.hxx"
namespace vigra{
// base class for basic implementation
// of a class for node,edge and arc maps.
template<class T,class KEY,class REF,class CREF>
class DenseReferenceMap
: public MultiArray<1,T>
{
public:
typedef KEY Key;
typedef T Value;
typedef REF Reference;
typedef CREF ConstReference;
typedef Key key_type;
typedef Value value_type;
typedef Reference reference;
typedef ConstReference const_reference;
typedef boost_graph::read_write_property_map_tag category;
typedef typename MultiArray<1,T>::difference_type Shape1Type;
DenseReferenceMap()
: MultiArray<1,T>(){
}
DenseReferenceMap(const size_t maxKey)
: MultiArray<1,T>(Shape1Type(maxKey+1)){
}
DenseReferenceMap(const size_t maxKey,ConstReference value)
: MultiArray<1,T>(Shape1Type(maxKey+1),value){
}
ConstReference operator[](const KEY & key)const{
//return this->operator[](key.id());
return MultiArray<1,T>::operator()(key.id());
}
Reference operator[](const KEY & key){
return MultiArray<1,T>::operator()(key.id());
}
size_t size()const{
return this->shape(0);
}
protected:
void assign(const size_t maxKey){
this->reshape(Shape1Type(maxKey+1));
}
private:
// NONE
};
// basic implementation
// of a class for node,edge and arc maps.
template<class GRAPH,class ITEM,class T,class REF,class CREF>
class DenseGraphItemReferenceMap
: public DenseReferenceMap<T,ITEM,REF,CREF>
{
typedef GRAPH Graph;
typedef ITEM Item;
typedef DenseReferenceMap<T,ITEM,REF,CREF> DenseReferenceMapType;
typedef GraphItemHelper<Graph,ITEM> ItemHelper;
typedef typename ItemHelper::ItemIt ItemIt;
public:
DenseGraphItemReferenceMap()
: DenseReferenceMapType(){
}
DenseGraphItemReferenceMap(const Graph & g)
: DenseReferenceMapType(ItemHelper::itemNum(g)==0 ? 0: ItemHelper::maxItemId(g) ){
}
DenseGraphItemReferenceMap(const Graph & g,typename DenseReferenceMapType::ConstReference value)
: DenseReferenceMapType(ItemHelper::itemNum(g)==0 ? 0: ItemHelper::maxItemId(g)){
}
void assign(const Graph & g){
DenseReferenceMapType::assign(ItemHelper::itemNum(g)==0 ? 0: ItemHelper::maxItemId(g));
}
};
// basic class for node-maps
template<class GRAPH,class T,class REF= T & ,class CREF = const T & >
class DenseNodeReferenceMap
: public DenseGraphItemReferenceMap<GRAPH,typename GRAPH::Node,T,REF,CREF>
{
typedef typename GRAPH::Node Node;
typedef DenseGraphItemReferenceMap<GRAPH,Node,T,REF,CREF> DenseGraphItemReferenceMapType;
public:
DenseNodeReferenceMap()
: DenseGraphItemReferenceMapType(){
}
DenseNodeReferenceMap(const GRAPH & g)
: DenseGraphItemReferenceMapType(g){
}
DenseNodeReferenceMap(const GRAPH & g,typename DenseGraphItemReferenceMapType::ConstReference value)
: DenseGraphItemReferenceMapType(g,value){
}
};
// basic class for edge-maps
template<class GRAPH,class T,class REF= T & ,class CREF = const T & >
class DenseEdgeReferenceMap
: public DenseGraphItemReferenceMap<GRAPH,typename GRAPH::Edge,T,REF,CREF>
{
typedef typename GRAPH::Edge Edge;
typedef DenseGraphItemReferenceMap<GRAPH,Edge,T,REF,CREF> DenseGraphItemReferenceMapType;
public:
DenseEdgeReferenceMap()
: DenseGraphItemReferenceMapType(){
}
DenseEdgeReferenceMap(const GRAPH & g)
: DenseGraphItemReferenceMapType(g){
}
DenseEdgeReferenceMap(const GRAPH & g,typename DenseGraphItemReferenceMapType::ConstReference value)
: DenseGraphItemReferenceMapType(g,value){
}
};
// basic class for arc-maps
template<class GRAPH,class T,class REF= T & ,class CREF = const T & >
class DenseArcReferenceMap
: public DenseGraphItemReferenceMap<GRAPH,typename GRAPH::Arc,T,REF,CREF>
{
typedef typename GRAPH::Arc Arc;
typedef DenseGraphItemReferenceMap<GRAPH,Arc,T,REF,CREF> DenseGraphItemReferenceMapType;
public:
DenseArcReferenceMap()
: DenseGraphItemReferenceMapType(){
}
DenseArcReferenceMap(const GRAPH & g)
: DenseGraphItemReferenceMapType(g){
}
DenseArcReferenceMap(const GRAPH & g,typename DenseGraphItemReferenceMapType::ConstReference value)
: DenseGraphItemReferenceMapType(g,value){
}
};
// implicit edge map:
// the values of a node map are converted
// to an edge map.
// FUNCTOR is used to convert the two
// node map values corresponding to an edge to
// an edge map value
template<class G,class NODE_MAP,class FUNCTOR,class RESULT>
class OnTheFlyEdgeMap{
public:
typedef G Graph;
typedef typename Graph::Node Node;
typedef NODE_MAP NodeMap;
typedef typename Graph::Edge Key;
typedef RESULT Value;
typedef RESULT ConstReference;
typedef Key key_type;
typedef Value value_type;
typedef ConstReference const_reference;
typedef boost_graph::readable_property_map_tag category;
OnTheFlyEdgeMap(const Graph & graph,const NodeMap & nodeMap,FUNCTOR & f)
: graph_(graph),
nodeMap_(nodeMap),
f_(f){
}
ConstReference operator[](const Key & key){
const Node u(graph_.u(key));
const Node v(graph_.v(key));
return f_(nodeMap_[u],nodeMap_[v]);
}
ConstReference operator[](const Key & key)const{
const Node u(graph_.u(key));
const Node v(graph_.v(key));
return f_(nodeMap_[u],nodeMap_[v]);
}
private:
const Graph & graph_;
const NodeMap & nodeMap_;
FUNCTOR & f_;
};
// node map that returns zero (specifically, <tt>RESULT()</tt>) for all keys
template<class G, class RESULT>
class ZeroNodeMap
{
public:
typedef G Graph;
typedef typename Graph::Node Key;
typedef RESULT Value;
typedef RESULT ConstReference;
typedef Key key_type;
typedef Value value_type;
typedef ConstReference const_reference;
typedef boost_graph::readable_property_map_tag category;
ZeroNodeMap()
{}
value_type operator[](const Key & key) const
{
return value_type();
}
};
template<class T_OUT>
struct MeanFunctor{
template<class T>
T_OUT operator()(const T & a, const T & b)const{
return static_cast<T_OUT>(a+b)/static_cast<T_OUT>(2.0);
}
};
// implicit edge map:
// the values of a node map are converted
// to an edge map.
// FUNCTOR is used to convert the two
// node map values corresponding to an edge to
// an edge map value
template<class G,class NODE_MAP,class FUNCTOR,class RESULT>
class OnTheFlyEdgeMap2{
public:
typedef G Graph;
typedef typename Graph::Node Node;
typedef NODE_MAP NodeMap;
typedef typename Graph::Edge Key;
typedef RESULT Value;
typedef RESULT ConstReference;
typedef Key key_type;
typedef Value value_type;
typedef ConstReference const_reference;
typedef boost_graph::readable_property_map_tag category;
OnTheFlyEdgeMap2(const Graph & graph,const NodeMap & nodeMap,FUNCTOR f)
: graph_(graph),
nodeMap_(nodeMap),
f_(f){
}
ConstReference operator[](const Key & key){
const Node u(graph_.u(key));
const Node v(graph_.v(key));
return f_(nodeMap_[u],nodeMap_[v]);
}
ConstReference operator[](const Key & key)const{
const Node u(graph_.u(key));
const Node v(graph_.v(key));
return f_(nodeMap_[u],nodeMap_[v]);
}
private:
const Graph & graph_;
const NodeMap nodeMap_;
FUNCTOR f_;
};
// convert 2 edge maps with a functor into a single edge map
template<class G,class EDGE_MAP_A,class EDGE_MAP_B,class FUNCTOR,class RESULT>
class BinaryOpEdgeMap{
public:
typedef G Graph;
typedef typename Graph::Edge Key;
typedef RESULT Value;
typedef RESULT ConstReference;
typedef Key key_type;
typedef Value value_type;
typedef ConstReference const_reference;
typedef boost_graph::readable_property_map_tag category;
BinaryOpEdgeMap(const Graph & graph,const EDGE_MAP_A & edgeMapA,const EDGE_MAP_B & edgeMapB,FUNCTOR & f)
: graph_(graph),
edgeMapA_(edgeMapA),
edgeMapB_(edgeMapB),
f_(f){
}
ConstReference operator[](const Key & key){
return f_(edgeMapA_[key],edgeMapB_[key]);
}
ConstReference operator[](const Key & key)const{
return f_(edgeMapA_[key],edgeMapB_[key]);
}
private:
const Graph & graph_;
const EDGE_MAP_A & edgeMapA_;
const EDGE_MAP_B & edgeMapB_;
FUNCTOR & f_;
};
// encapsulate a MultiArrayView indexed by node/edge ID
template<class T,class GRAPH, class KEY>
struct ArrayMap{
typedef MultiArrayView<1, T> View;
typedef KEY Key;
typedef typename View::value_type Value;
typedef typename View::const_reference ConstReference;
typedef typename View::reference Reference;
ArrayMap(const GRAPH & graph)
: graph_(graph),
view_(){
}
ArrayMap(const GRAPH & graph, const View & view)
: graph_(graph),
view_(view){
}
void setArray(const MultiArrayView<1, T> & view){
view_ = view;
}
Reference operator[](const Key & key){
return view_(graph_.id(key));
}
ConstReference operator[](const Key & key)const{
return view_(graph_.id(key));
}
const GRAPH & graph_;
MultiArrayView<1, T> view_;
};
} // end namespace vigra
#endif // VIGRA_GRAPH_MAPS
|