/usr/include/tulip/Face.h is in libtulip-dev 4.4.0dfsg2-2.
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 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
///@cond DOXYGEN_HIDDEN
#ifndef Tulip_FACE_H
#define Tulip_FACE_H
#include <tulip/tulipconf.h>
#include <tulip/tuliphash.h>
#include <climits>
namespace tlp {
struct Face {
unsigned int id;
Face():id(UINT_MAX) {}
explicit Face(unsigned int j):id(j) {}
bool operator!=(const Face f) const {
return id!=f.id;
}
bool operator==(const Face f) const {
return id==f.id;
}
bool isValid() const {
return id!=UINT_MAX;
}
};
}
#ifndef DOXYGEN_NOTFOR_DEVEL
TLP_BEGIN_HASH_NAMESPACE {
template<> struct hash<tlp::Face> {
size_t operator()(const tlp::Face f) const {return f.id;}
};
}
TLP_END_HASH_NAMESPACE
namespace std {
template<> struct equal_to<tlp::Face> {
size_t operator()(const tlp::Face f,const tlp::Face f2) const {
return f.id == f2.id;
}
};
template<> struct less<tlp::Face> {
size_t operator()(const tlp::Face f,const tlp::Face f2) const {
return f.id < f2.id;
}
};
}
#endif // DOXYGEN_NOTFOR_DEVEL
#endif
///@endcond
|