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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/* This file is part of the hkl library.
*
* The hkl library 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 3 of the License, or
* (at your option) any later version.
*
* The hkl library 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.
*
* You should have received a copy of the GNU General Public License
* along with the hkl library. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright (C) 2003-2018 Synchrotron SOLEIL
* L'Orme des Merisiers Saint-Aubin
* BP 48 91192 GIF-sur-YVETTE CEDEX
*
* Authors: Picca Frédéric-Emmanuel <picca@synchrotron-soleil.fr>
*/
#include "hkl-macros-private.h"
#include "hkl-geometry-private.h"
#include "hkl-trajectory-private.h"
HklTrajectoryResult * hkl_trajectory_result_new(void)
{
HklTrajectoryResult *self = HKL_MALLOC(HklTrajectoryResult);
darray_init(self->geometries);
return self;
}
void hkl_trajectory_result_free(HklTrajectoryResult *self)
{
HklGeometry **geometry;
darray_foreach(geometry, self->geometries){
hkl_geometry_free(*geometry);
}
darray_free(self->geometries);
}
void hkl_trajectory_add_geometry(HklTrajectoryResult *self, const HklGeometry *geometry)
{
darray_append(self->geometries, hkl_geometry_new_copy(geometry));
}
/* HklTrajectoryStats */
HklTrajectoryStats *hkl_trajectory_stats_new(int n)
{
HklTrajectoryStats *self = HKL_MALLOC(HklTrajectoryStats);
self->n = 0;
darray_init(self->nb_solutions);
darray_init(self->axes_min);
darray_init(self->axes_max);
darray_init(self->axes_range);
darray_resize0(self->axes_range, n);
return self;
}
void hkl_trajectory_stats_free(HklTrajectoryStats *self)
{
darray_free(self->axes_range);
darray_free(self->axes_max);
darray_free(self->axes_min);
darray_free(self->nb_solutions);
free(self);
}
void hkl_trajectory_stats_add(HklTrajectoryStats *self, const HklGeometryList *geometries)
{
size_t i;
const HklGeometryListItem *item = hkl_geometry_list_items_first_get(geometries);
const HklGeometry *geometry = hkl_geometry_list_item_geometry_get(item);
size_t n = darray_size(*hkl_geometry_axis_names_get(geometry));
darray_append(self->nb_solutions, hkl_geometry_list_n_items_get(geometries));
if(self->n == 0){
darray_resize(self->axes_min, n);
darray_resize(self->axes_max, n);
darray_resize(self->axes_range, n);
hkl_geometry_axis_values_get(geometry,
&darray_item(self->axes_min, 0), n,
HKL_UNIT_USER);
hkl_geometry_axis_values_get(geometry,
&darray_item(self->axes_max, 0), n,
HKL_UNIT_USER);
}else{
double values[n];
hkl_geometry_axis_values_get(geometry, values, n, HKL_UNIT_USER);
for(i=0; i<n; ++i){
if (values[i] < darray_item(self->axes_min, i))
darray_item(self->axes_min, i) = values[i];
else if (values[i] > darray_item(self->axes_max, i))
darray_item(self->axes_max, i) = values[i];
}
}
for(i=0;i<n;++i)
darray_item(self->axes_range, i) = darray_item(self->axes_max, i) - darray_item(self->axes_min, i);
self->n += 1;
}
void hkl_trajectory_stats_fprintf(FILE *f, const HklTrajectoryStats *self)
{
size_t *p;
double *v;
fprintf(f, "Number of points of the trajectory: %zd\n", self->n);
fprintf(f, "Solutions per points:");
darray_foreach(p, self->nb_solutions){
fprintf(f, " %zd", *p);
}
fprintf(f, "\n");
fprintf(f, "Axes minium:");
darray_foreach(v, self->axes_min){
fprintf(f, " %f", *v);
}
fprintf(f, "\n");
fprintf(f, "Axes max:");
darray_foreach(v, self->axes_max){
fprintf(f, " %f", *v);
}
fprintf(f, "\n");
fprintf(f, "Axes range:");
darray_foreach(v, self->axes_range){
fprintf(f, " %f", *v);
}
fprintf(f, "\n");
}
|
