/usr/include/tulip/DoubleProperty.h is in libtulip-dev 3.1.2-2.3ubuntu3.
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 | //-*-c++-*-
/**
Authors: David Auber, Patrick Mary, Morgan Mathiaut
from the LaBRI Visualization Team
Email : auber@tulip-software.org
Last modification : 13/03/2009
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
*/
#ifndef TULIP_METRIC_H
#define TULIP_METRIC_H
#include "tulip/AbstractProperty.h"
#include "tulip/TemplateFactory.h"
#include "tulip/DoubleAlgorithm.h"
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
namespace tlp {
class PropertyContext;
/** \addtogroup properties */
/*\@{*/
class TLP_SCOPE DoubleProperty:public AbstractProperty<DoubleType,DoubleType,DoubleAlgorithm>, public PropertyObserver {
friend class DoubleAlgorithm;
public :
DoubleProperty (Graph *);
DoubleType::RealType getNodeMin(Graph *sg=0);
DoubleType::RealType getNodeMax(Graph *sg=0);
DoubleType::RealType getEdgeMin(Graph *sg=0);
DoubleType::RealType getEdgeMax(Graph *sg=0);
PropertyInterface* clonePrototype(Graph *, std::string );
void copy( const node, const node, PropertyInterface * );
void copy( const edge, const edge, PropertyInterface * );
void uniformQuantification(unsigned int);
void clone_handler(AbstractProperty<DoubleType,DoubleType> &);
// redefinition of some PropertyObserver methods
virtual void beforeSetNodeValue(PropertyInterface* prop, const node n);
virtual void beforeSetEdgeValue(PropertyInterface* prop, const edge e);
virtual void beforeSetAllNodeValue(PropertyInterface* prop);
virtual void beforeSetAllEdgeValue(PropertyInterface* prop);
private:
stdext::hash_map<unsigned long, double> maxN,minN,maxE,minE;
stdext::hash_map<unsigned long, bool> minMaxOkNode;
stdext::hash_map<unsigned long, bool> minMaxOkEdge;
void computeMinMaxNode(Graph *sg=0);
void computeMinMaxEdge(Graph *sg=0);
};
/*@}*/
}
#endif
|