/usr/include/tulip/IntegerProperty.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 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 | /*
*
* 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_INT_H
#define TULIP_INT_H
#include <tulip/tuliphash.h>
#include <tulip/PropertyTypes.h>
#include <tulip/AbstractProperty.h>
#include <tulip/PropertyAlgorithm.h>
#include <tulip/Observable.h>
#include <tulip/minmaxproperty.h>
#include <tulip/NumericProperty.h>
namespace tlp {
class Graph;
class PropertyContext;
typedef MinMaxProperty<tlp::IntegerType, tlp::IntegerType, tlp::NumericProperty> IntegerMinMaxProperty;
/**
* @ingroup Graph
* @brief A graph property that maps an integer value to graph elements.
*/
class TLP_SCOPE IntegerProperty : public IntegerMinMaxProperty {
public :
IntegerProperty(Graph *, std::string n = "");
PropertyInterface* clonePrototype(Graph *, const std::string& );
static const std::string propertyTypename;
std::string getTypename() const {
return propertyTypename;
}
virtual void setNodeValue(const node n, const int &v);
virtual void setEdgeValue(const edge e, const int &v);
virtual void setAllNodeValue(const int &v);
virtual void setAllEdgeValue(const int &v);
int compare(const node n1, const node n2) const;
int compare(const edge e1, const edge e2) const;
// NumericProperty interface
virtual double getNodeDoubleValue(const node n) const {
return (double) getNodeValue(n);
}
virtual double getNodeDoubleDefaultValue() const {
return (double) getNodeDefaultValue();
}
virtual double getNodeDoubleMin(Graph* g = NULL) {
return (double) getNodeMin(g);
}
virtual double getNodeDoubleMax(Graph* g = NULL) {
return (double) getNodeMax(g);
}
virtual double getEdgeDoubleValue(const edge e) const {
return (double) getEdgeValue(e);
}
virtual double getEdgeDoubleDefaultValue() const {
return (double) getEdgeDefaultValue();
}
virtual double getEdgeDoubleMin(Graph* g = NULL) {
return (double) getEdgeMin(g);
}
virtual double getEdgeDoubleMax(Graph* g = NULL) {
return (double) getEdgeMax(g);
}
void nodesUniformQuantification(unsigned int);
void edgesUniformQuantification(unsigned int);
NumericProperty* copyProperty(Graph *g) {
IntegerProperty* newProp = new IntegerProperty(g);
newProp->copy(this);
return newProp;
}
protected:
virtual void clone_handler(AbstractProperty<tlp::IntegerType, tlp::IntegerType, tlp::NumericProperty> &);
private:
// override Observable::treatEvent
void treatEvent(const Event&);
};
/**
* @ingroup Graph
* @brief A graph property that maps a std::vector<int> value to graph elements.
*/
class TLP_SCOPE IntegerVectorProperty:public AbstractVectorProperty<tlp::IntegerVectorType, tlp::IntegerType> {
public :
IntegerVectorProperty(Graph *g, std::string n =""):AbstractVectorProperty<IntegerVectorType, tlp::IntegerType>(g, n) {}
// redefinition of some PropertyInterface methods
PropertyInterface* clonePrototype(Graph *, const std::string& );
static const std::string propertyTypename;
std::string getTypename() const {
return propertyTypename;
}
};
}
#endif
///@endcond
|