/usr/include/tulip/Edge.h is in libtulip-dev 3.1.2-2.3ubuntu3.
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 | //-*-c++-*-
/**
Authors: David Auber, Patrick Mary, Morgan Mathiaut
from the LaBRI Visualization Team
Email : auber@tulip-software.org
Last modification : 13/03/2009
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
*/
#ifndef Tulip_EDGE_H
#define Tulip_EDGE_H
#if (__GNUC__ < 3)
#include <hash_map>
#else
#include <ext/hash_map>
#endif
#include <climits>
/**
* \addtogroup graphs
*/
namespace tlp {
/*@{*/
/// class edge
struct edge {
unsigned int id;
edge():id(UINT_MAX){}
explicit edge(unsigned int j):id(j){}
bool operator==(const edge e) const{return id==e.id;}
bool operator!=(const edge e) const{return id!=e.id;}
bool isValid() const {return id!=UINT_MAX;}
};
/*@}*/
}
#ifndef DOXYGEN_NOTFOR_DEVEL
namespace stdext {
template<>
struct hash<tlp::edge>{
size_t operator()(const tlp::edge e) const {return e.id;}
};
}
namespace std {
template<>
struct equal_to<tlp::edge>{size_t operator()(const tlp::edge e,const tlp::edge e2) const {
return e.id==e2.id;}
};
template<>
struct less<tlp::edge>{size_t operator()(const tlp::edge e,const tlp::edge e2) const {
return e.id<e2.id;}
};
}
#endif
#endif
|