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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
#include "fff_routines.h"
#include "fff_base.h"
#include <randomkit.h>
#include <stdlib.h>
#include <stdio.h>
/* Draw k different values in the range [0..N-1] */
extern void fff_rng_draw_noreplace (size_t *list, long k, long N)
{
int i;
rk_state state;
rk_seed(1, &state);
for (i=0; i<k ; i++)
list[i] = floor(N*rk_double(&state));
}
typedef struct{
double x;
long i;
} dummy_struct;
static int _dummy_struct_geq(const void * x, const void * y)
{
int ans = -1;
dummy_struct xx = *((dummy_struct*)x);
dummy_struct yy = *((dummy_struct*)y);
if ( xx.x > yy.x ) {
ans = 1;
return ans;
}
if ( xx.x == yy.x )
ans = 0;
return ans;
}
extern void sort_ascending_and_get_permutation( double* x, long* idx, long n )
{
long i;
double *bufx;
dummy_struct* xx = (dummy_struct*)calloc( n, sizeof(dummy_struct) );
dummy_struct* buf_xx;
long* buf_idx;
bufx = x;
buf_idx = idx;
buf_xx = xx;
for ( i=0; i<n; i++, bufx++, buf_xx++ ) {
(*buf_xx).x = *bufx;
(*buf_xx).i = i;
}
qsort ( xx, n, sizeof(dummy_struct), &_dummy_struct_geq );
bufx = x;
buf_idx = idx;
buf_xx = xx;
for ( i=0; i<n; i++, bufx++, buf_idx++, buf_xx++ ) {
*bufx = (*buf_xx).x;
*buf_idx = (*buf_xx).i;
}
free( xx );
return;
}
extern void sort_ascending(double *x, int n)
{
long *idx = (long *) calloc (n,sizeof(long));
sort_ascending_and_get_permutation( x, idx,n);
free(idx);
}
extern long fff_array_argmax1d(const fff_array *farray)
{
/* returns the index of the max value on a supposedly 1D array */
/* quick and dirty implementation */
long i,n = farray->dimX;
long idx = 0;
double val,max = (double) fff_array_get1d(farray,idx);
for (i=0 ; i<n ; i++){
val = (double) fff_array_get1d(farray,i);
if (val>max){
max = val;
idx = i;
}
}
return idx;
}
extern long fff_array_argmin1d(const fff_array *farray)
{
/*
returns the index of the max value on a supposedly 1D array
quick and dirty implementation
*/
long i,n = farray->dimX;
long idx = 0;
double val,min = (double) fff_array_get1d(farray,idx);
for (i=0 ; i<n ; i++){
val = (double) fff_array_get1d(farray,i);
if (val<min){
min = val;
idx = i;
}
}
return idx;
}
extern double fff_array_min1d(const fff_array *farray)
{
/*
returns the index of the max value on a supposedly 1D array
quick and dirty implementation
*/
long i,n = farray->dimX;
double val,min = (double) fff_array_get1d(farray,0);
for (i=0 ; i<n ; i++){
val = (double) fff_array_get1d(farray,i);
if (val<min)
min = val;
}
return min;
}
extern double fff_array_max1d(const fff_array *farray)
{
/*
returns the index of the max value on a supposedly 1D array
quick and dirty implementation
*/
long i,n = farray->dimX;
double val,max = (double) fff_array_get1d(farray,0);
for (i=0 ; i<n ; i++){
val = (double) fff_array_get1d(farray,i);
if (val>max)
max = val;
}
return max;
}
extern int generate_normals(fff_matrix* nvariate, const fff_matrix * means, const fff_matrix * precision)
{
rk_state state;
int i,j;
double x,s,m;
rk_seed(1, &state);
for (i=0 ; i<nvariate->size1 ; i++)
for (j=0 ; j<nvariate->size2 ; j++){
s = 1.0/sqrt(fff_matrix_get(precision,i,j));
m = fff_matrix_get(means,i,j);
x = m + s*rk_gauss(&state);
fff_matrix_set(nvariate,i,j,x);
}
return(0);
}
|
