/usr/include/tulip/FaceIterator.h is in libtulip-dev 4.6.0dfsg-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 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* 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 FACEITERATOR2_H
#define FACEITERATOR2_H
#include <vector>
#include <tulip/Iterator.h>
#include <tulip/Face.h>
#include <tulip/Node.h>
#include <tulip/Edge.h>
#ifndef DOXYGEN_NOTFOR_DEVEL
//============================================================
/// Face iterator for PlanarConMap
namespace tlp {
class PlanarConMap;
class FaceIterator : public Iterator<Face> {
public:
FaceIterator(PlanarConMap* m);
virtual ~FaceIterator() {}
Face next();
bool hasNext();
private:
unsigned int i;
PlanarConMap* mgraph;
};
//============================================================
/// Adjacente Face iterator for PlanarConMap
class FaceAdjIterator : public Iterator<Face> {
public:
FaceAdjIterator(PlanarConMap* m, const node n);
virtual ~FaceAdjIterator() {}
Face next();
bool hasNext();
private:
std::vector<Face> facesAdj;
unsigned int i;
};
//============================================================
/// Node of face iterator for PlanarConMap
class NodeFaceIterator : public Iterator<node> {
public :
NodeFaceIterator(PlanarConMap *m, const Face );
virtual ~NodeFaceIterator() {}
node next();
bool hasNext();
private :
/** contains the set of computed nodes */
std::vector<node> nodes;
unsigned int i;
};
//============================================================
/// Edge of face iterator for PlanarConMap
class EdgeFaceIterator : public Iterator<edge> {
public :
EdgeFaceIterator(PlanarConMap *m, const Face );
virtual ~EdgeFaceIterator() {}
edge next();
bool hasNext();
private :
/** reference on the current face */
std::vector<edge> ve;
unsigned int i;
};
}
#endif
#endif
///@endcond
|