/usr/include/tulip/ForEach.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 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 | /*
*
* 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.
*
*/
#ifndef Tulip_FOREACH_H
#define Tulip_FOREACH_H
#include <cassert>
#include <tulip/Iterator.h>
#include <tulip/StableIterator.h>
#include <tulip/tulipconf.h>
#ifndef DOXYGEN_NOTFOR_DEVEL
namespace tlp {
/**
* @brief Encapsulation of a Tulip Iterator intended to be allocated on the stack instead of the heap,
* so it gets deleted when out of scope.
*
**/
template<typename TYPE>
struct _TLP_IT {
_TLP_IT(Iterator<TYPE> *_it) : _it(_it) {
}
~_TLP_IT() {
delete _it;
}
Iterator<TYPE> *_it;
};
/**
* @brief
**/
template<typename TYPE>
inline bool _tlp_if_test(TYPE &n, _TLP_IT<TYPE> &_it) {
assert(_it._it != NULL);
if(_it._it->hasNext()) {
n = _it._it->next();
return true;
}
else {
return false;
}
}
}
#endif //DOXYGEN_NOTFOR_DEVEL
/**
* @brief Allows to iterate the nodes or edges of a Graph in a clear and concise way.
* It also avoid having to manage a tulip Iterator, whose deletion is often forgotten.
*
* This code shows how forEach can be used instead of an Iterator to iterate a Graph's nodes
* @code
* node n;
* forEach(n, graph->getNodes()) {
* // Do something with node n
* }
* @endcode
*
* This macro can be used with any Iterator subclass as it's based on the existence of the next() and hasNext() methods
*/
#define forEach(A, B) \
for(tlp::_TLP_IT<TYPEOF(A) > _it_foreach(B); tlp::_tlp_if_test(A, _it_foreach);)
/**
* @brief Allows to iterate the nodes or edges of a copy of a Graph in a clear and concise way.
* The stable Iterator creates a copy of the Graph, and iterates on the said copy.
* It allows deletion operations to be performed without invalidating the iterator.
* It also avoid having to manage a tulip Iterator, whose deletion is often forgotten.
*/
#define stableForEach(A, B) \
for(tlp::_TLP_IT<TYPEOF(A) > _it_foreach(new StableIterator<TYPEOF(A) >(B)); tlp::_tlp_if_test(A, _it_foreach);)
#if defined(__GXX_EXPERIMENTAL_CXX0X__)
namespace tlp {
template<typename T>
class iterator_t {
public:
enum IteratorType {
Begin = 0,
End = 1
};
iterator_t(tlp::Iterator<T>* it, IteratorType begin = End) : _finished(false), _iteratorType(begin), _it(it) {
if(_iteratorType == Begin) {
if(_it->hasNext()) {
_current = _it->next();
}
else {
_finished = true;
}
}
}
~iterator_t() {
if(_iteratorType == Begin) {
delete _it;
}
}
bool operator!=(const iterator_t&) const {
return !_finished;
}
const iterator_t& operator++() {
_finished = !_it->hasNext();
if(!_finished)
_current = _it->next();
return *this;
}
T operator*() const {
return _current;
}
protected:
bool _finished;
IteratorType _iteratorType;
tlp::Iterator<T>* _it;
T _current;
};
template<typename T>
iterator_t<T> begin(tlp::Iterator<T>* it) {
return iterator_t<T>(it, iterator_t<T>::Begin);
}
template<typename T>
iterator_t<T> end(tlp::Iterator<T>* it) {
return iterator_t<T>(it);
}
}
#endif //__GXX_EXPERIMENTAL_CXX0X__
#endif
|