/usr/include/tulip/uniqueiterator.h is in libtulip-dev 4.8.0dfsg-2build2.
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 | /*
*
* 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 UNIQUEITERATOR_H
#define UNIQUEITERATOR_H
#include <set>
#include <tulip/memorypool.h>
//===============================================================================
namespace tlp {
/**
* \brief that class implement a default functor that always return true
*
* @see UniqueIterator
*/
template <typename TYPE>
class CheckAllFunctor {
bool operator()(const TYPE &) {
return true;
}
};
/**
* @class UniqueIterator
* @ingroup Iterators
*
* @brief UniqueIterator enables to remove duplicated elements in an iterator
*
* @param it the iterator in which we want to filter out duplicated elements
* @param checkFuncor a functor that enable to indicate wheter or not the element could be duplicated (default test all elements)
*
* The functor function shoul have the following form
* @code
* class ACheckFunctor {
* bool operator(TYPE a) {
* return true if a could be duplicated else false;
* }
* };
* @endcode
* checkFunctor are used for optimization purpose to prevent to log(n) test for all elements when not necessary.
*/
template <typename TYPE, typename TOCHECKFUNCTOR = CheckAllFunctor<TYPE> >
class UniqueIterator : public Iterator<TYPE> {
public:
UniqueIterator(Iterator<TYPE> *it, TOCHECKFUNCTOR checkFunctor = TOCHECKFUNCTOR()):_it(it), _checkFunctor(checkFunctor) {
update();
}
//================================================
~UniqueIterator() {
delete _it;
}
//================================================
TYPE next() {
TYPE tmp = curVal;
update();
return tmp;
}
//================================================
inline bool hasNext() {
return _hasNext;
}
//================================================
void update() {
_hasNext = false;
while(_it->hasNext()) {
curVal = _it->next();
if (_checkFunctor(curVal) ) {
if (_flag.find(curVal) == _flag.end()) {
_hasNext = true;
_flag.insert(curVal);
return;
}
}
else {
_hasNext = true;
return;
}
}
}
private:
std::set<TYPE> _flag;
bool _hasNext;
Iterator<TYPE> *_it;
TYPE curVal;
TOCHECKFUNCTOR _checkFunctor;
};
/**
* @class MPUniqueIterator
* @ingroup Iterators
* @brief MPUniqueIterator implements memory pool for UniqueIterator
* @warning never inherit from that class
* @see UniqueIterator
*/
template <typename TYPE, typename TOCHECKFUNCTOR = CheckAllFunctor<TYPE> >
class MPUniqueIterator : public UniqueIterator<TYPE, TOCHECKFUNCTOR> ,
public MemoryPool<MPUniqueIterator<TYPE, TOCHECKFUNCTOR> > {
public:
MPUniqueIterator(Iterator<TYPE> *it, TOCHECKFUNCTOR checkFunctor = TOCHECKFUNCTOR()):
UniqueIterator<TYPE, TOCHECKFUNCTOR>(it, checkFunctor) {
}
};
}
#endif // UNIQUEITERATOR_H
///@endcond
|