blob: 9d268af3ad32c29e6ee2a8479dee982d2b317632 (
plain)
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
|
/* This file is part of the Gudhi Library. The Gudhi library
* (Geometric Understanding in Higher Dimensions) is a generic C++
* library for computational topology.
*
* Author: Francois Godi
*
* Copyright (C) 2015 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#ifndef INTERNAL_POINT_H_
#define INTERNAL_POINT_H_
namespace Gudhi {
namespace persistence_diagram {
/** \internal \brief Returns the used index for encoding none of the points */
int null_point_index();
/** \internal \typedef \brief Internal_point is the internal points representation, indexes used outside. */
struct Internal_point {
double vec[2];
int point_index;
Internal_point() { }
Internal_point(double x, double y, int p_i) {
vec[0] = x;
vec[1] = y;
point_index = p_i;
}
double x() const {
return vec[ 0 ];
}
double y() const {
return vec[ 1 ];
}
double& x() {
return vec[ 0 ];
}
double& y() {
return vec[ 1 ];
}
bool operator==(const Internal_point& p) const {
return point_index == p.point_index;
}
bool operator!=(const Internal_point& p) const {
return !(*this == p);
}
};
inline int null_point_index() {
return -1;
}
struct Construct_coord_iterator {
typedef const double* result_type;
const double* operator()(const Internal_point& p) const {
return p.vec;
}
const double* operator()(const Internal_point& p, int) const {
return p.vec + 2;
}
};
} // namespace persistence_diagram
} // namespace Gudhi
#endif // INTERNAL_POINT_H_
|
