/usr/include/tulip/MapIterator.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 59 60 61 62 63 64 65 66 67 68 69 70 | //-*-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.
*/
#include <tulip/Iterator.h>
#include <tulip/Graph.h>
#include <tulip/tulipconf.h>
#include <list>
#include <vector>
#ifndef DOXYGEN_NOTFOR_DEVEL
#ifndef TULIP_NODEMAPITERATOR_H
#define TULIP_NODEMAPITERATOR_H
namespace tlp {
/** \addtogroup graphs */
/*@{*/
TLP_SCOPE edge nextFaceEdge(Graph* g, edge e, node n);
/**
*
*/
struct TLP_SCOPE NodeMapIterator : public Iterator<node> {
///
NodeMapIterator(Graph *sg, node source, node target);
~NodeMapIterator();
///Return the next element
node next();
///Return true if it exist a next element
bool hasNext();
private :
std::list<node> cloneIt;
std::list<node>::iterator itStl;
};
/**
*
*/
struct TLP_SCOPE EdgeMapIterator : public Iterator<edge> {
///
EdgeMapIterator(Graph *sg, edge source, node target);
///
~EdgeMapIterator();
///Return the next element
edge next();
///Return true if it exist a next element
bool hasNext();
private :
std::vector<edge> adj;
edge start;
int treat;
unsigned int pos;
bool finished;
};
/*@}*/
}
#endif
#endif //DOXYGEN_NOTFOR_DEVEL
|