Tulip  5.2.0
Large graphs analysis and drawing
SizeProperty.h
1 /*
2  *
3  * This file is part of Tulip (http://tulip.labri.fr)
4  *
5  * Authors: David Auber and the Tulip development Team
6  * from LaBRI, University of Bordeaux
7  *
8  * Tulip is free software; you can redistribute it and/or modify
9  * it under the terms of the GNU Lesser General Public License
10  * as published by the Free Software Foundation, either version 3
11  * of the License, or (at your option) any later version.
12  *
13  * Tulip is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
16  * See the GNU General Public License for more details.
17  *
18  */
19 
20 #ifndef TULIP_SIZES_H
21 #define TULIP_SIZES_H
22 
23 #include <tulip/tuliphash.h>
24 #include <tulip/PropertyTypes.h>
25 #include <tulip/AbstractProperty.h>
26 #include <tulip/PropertyAlgorithm.h>
27 
28 namespace tlp {
29 
30 class PropertyContext;
31 
32 typedef AbstractProperty<tlp::SizeType, tlp::SizeType> AbstractSizeProperty;
33 
34 /**
35  * @ingroup Graph
36  * @brief A graph property that maps a tlp::Size value to graph elements.
37  */
38 class TLP_SCOPE SizeProperty : public AbstractSizeProperty {
39 
40 public:
41  SizeProperty(Graph *, const std::string &n = "");
42 
43  Size getMax(const Graph *sg = nullptr);
44  Size getMin(const Graph *sg = nullptr);
45  void scale(const tlp::Vector<float, 3> &, const Graph *sg = nullptr);
46  void scale(const tlp::Vector<float, 3> &, Iterator<node> *, Iterator<edge> *);
47 
48  // redefinition of some PropertyInterface methods
49  PropertyInterface *clonePrototype(Graph *, const std::string &) const override;
50  static const std::string propertyTypename;
51  const std::string &getTypename() const override {
52  return propertyTypename;
53  }
54 
55  // redefinition of some AbstractProperty methods
56  void setNodeValue(const node n, tlp::StoredType<Size>::ReturnedConstValue v) override;
57  void setAllNodeValue(tlp::StoredType<Size>::ReturnedConstValue v) override;
58  void setValueToGraphNodes(tlp::StoredType<Size>::ReturnedConstValue v,
59  const Graph *graph) override;
60 
61  int compare(const node n1, const node n2) const override;
62 
63  _DEPRECATED void setAllNodeValue(tlp::StoredType<Size>::ReturnedConstValue v,
64  const Graph *graph) override;
65 
66 protected:
67  void resetMinMax();
68 
69 private:
70  TLP_HASH_MAP<unsigned int, Size> max, min;
71  TLP_HASH_MAP<unsigned int, bool> minMaxOk;
72  void computeMinMax(const Graph *sg = nullptr);
73 };
74 
75 /**
76  * @ingroup Graph
77  * @brief A graph property that maps a std::vector<tlp::Size> value to graph elements.
78  */
79 class TLP_SCOPE SizeVectorProperty
80  : public AbstractVectorProperty<tlp::SizeVectorType, tlp::SizeType> {
81 public:
82  SizeVectorProperty(Graph *g, const std::string &n = "")
83  : AbstractVectorProperty<SizeVectorType, SizeType>(g, n) {}
84 
85  // redefinition of some PropertyInterface methods
86  PropertyInterface *clonePrototype(Graph *, const std::string &) const override;
87  static const std::string propertyTypename;
88  const std::string &getTypename() const override {
89  return propertyTypename;
90  }
91 };
92 }
93 #endif
Interface for Tulip iterators. Allows basic iteration operations only.
Definition: Graph.h:41
PropertyInterface describes the interface of a graph property.
The node struct represents a node in a Graph object.
Definition: Node.h:40
A graph property that maps a tlp::Size value to graph elements.
Definition: SizeProperty.h:38
A graph property that maps a std::vector<tlp::Size> value to graph elements.
Definition: SizeProperty.h:79