/usr/include/tulip/TemplateAlgorithm.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 | /*
*
* 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_PROPERTY_H
#define TULIP_PROPERTY_H
#include <tulip/Algorithm.h>
#include <tulip/Graph.h>
#include <sstream>
namespace tlp {
class PluginContext;
static const std::string PROPERTY_ALGORITHM_CATEGORY = "Property";
/**
* @ingroup Plugins
* @brief A non-template interface for tlp::TemplateAlgorithm
* @see tlp::TemplateAlgorithm
**/
class TLP_SCOPE PropertyAlgorithm: public tlp::Algorithm {
public :
PropertyAlgorithm(const tlp::PluginContext* context):Algorithm(context) {}
virtual std::string category() const {
return PROPERTY_ALGORITHM_CATEGORY;
}
};
/**
* @ingroup Plugins
* @brief The TemplateAlgorithm class describes a plugin that can operate on a single graph's property.
* @param Property The property template arguments gives the type of the property the algorithm operates on.
*
* A TemplateAlgorithm takes a graph as input (plus additional parameters defined via tlp::WithParameter) and outputs its results in a tlp::PropertyInterface subclass.
* The output property is defined as an output parameter named "result" and as a class member called result.
*
* @warning Subclassing TemplateAlgorithm is not recommended since template specifications are available for every Tulip property types.
*
* @see tlp::BooleanAlgorithm
* @see tlp::StringAlgorithm
* @see tlp::DoubleAlgorithm
* @see tlp::IntegerAlgorithm
* @see tlp::LayoutAlgorithm
* @see tlp::SizeAlgorithm
*/
template<class Property>
class TLP_SCOPE TemplateAlgorithm : public PropertyAlgorithm {
public:
Property* result;
TemplateAlgorithm (const tlp::PluginContext* context) : tlp::PropertyAlgorithm(context), result(NULL) {
if (dataSet != NULL) {
if(!dataSet->exist("result")) {
std::stringstream propname;
propname << "result";
unsigned number = 0;
while(graph->existProperty(propname.str())) {
propname.clear();
propname << "result" << number;
++number;
}
result = graph->getProperty<Property>(propname.str());
}
else {
dataSet->get("result", result);
}
}
}
};
}
#endif
|