/usr/include/tulip/SortIterator.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 73 74 75 76 77 78 79 80 81 82 83 84 85 86 | /*
*
* 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_SORTITERATOR_H
#define TULIP_SORTITERATOR_H
#include <vector>
#include <algorithm>
#include <tulip/Iterator.h>
#include <tulip/StableIterator.h>
#include <tulip/DoubleProperty.h>
namespace tlp {
class Graph;
#ifndef DOXYGEN_NOTFOR_DEVEL
struct LessThan {
LessThan(DoubleProperty* m): metric(m) {
}
DoubleProperty* metric;
bool operator() (node n1,node n2) {
return (metric->getNodeValue(n1) < metric->getNodeValue(n2));
}
};
struct LessThanEdgeTargetMetric {
LessThanEdgeTargetMetric(Graph *sg, DoubleProperty* metric):
metric(metric), sg(sg) {
}
bool operator() (edge e1,edge e2) {
return (metric->getNodeValue(sg->target(e1)) < metric->getNodeValue(sg->target(e2)));
}
private:
DoubleProperty* metric;
Graph *sg;
};
#endif // DOXYGEN_NOTFOR_DEVEL
/**
* @brief This Iterator sorts the nodes in a sequence based on their values in a DoubleProperty.
**/
struct SortNodeIterator : public StableIterator<tlp::node> {
///
SortNodeIterator(Iterator<tlp::node> *itIn, DoubleProperty* metric):StableIterator<tlp::node>(itIn) {
LessThan tmp(metric);
sort(sequenceCopy.begin(),sequenceCopy.end(),tmp);
copyIterator=sequenceCopy.begin();
}
///
~SortNodeIterator() {}
};
/**
* @brief This Iterator sorts the edges based on the values of their target nodes in a DoubleProperty.
**/
struct SortTargetEdgeIterator : public StableIterator<tlp::edge> {
///
SortTargetEdgeIterator(Iterator<tlp::edge> *itIn, Graph* sg, DoubleProperty* metric):StableIterator<tlp::edge>(itIn) {
LessThanEdgeTargetMetric tmp(sg,metric);
sort(sequenceCopy.begin(),sequenceCopy.end(),tmp);
copyIterator=sequenceCopy.begin();
}
///
~SortTargetEdgeIterator() {}
};
}
#endif
///@endcond
|