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
|
/*
*
* utilityLHS_R.h: A C++ header used in the LHS package
* Copyright (C) 2012 Robert Carnell
*
* 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#ifndef UTILITYLHS_R
#define UTILITYLHS_R
#include <vector>
class utilityLHS
{
public:
static int lhsCheck(int N, int K, int * result, int bTranspose);
static void rank(std::vector<double> & toRank, std::vector<int> & ranks);
static void rankColumns(std::vector<double> & toRank, std::vector<int> & ranks, int nrow);
/* static template class definitions added to class definition to prevent solaris error
* multiple declaration for utilityLHS */
template <class T>
static void lhsPrint(int N, int K, T* result, int bTranspose)
{
if (bTranspose == 0)
{
for (int row = 0; row < K; row++)
{
for (int col = 0; col < N; col++)
{
PRINT_MACRO("%g ", result[row * N + col]);
}
PRINT_MACRO("\n");
}
}
else
{
for (int row = 0; row < N; row++)
{
for (int col = 0; col < K; col++)
{
PRINT_MACRO("%d ", result[row * K + col]);
}
PRINT_MACRO("\n");
}
}
};
template <class T>
static double sumInvDistance(T * Tmatrix, int nr, int nc)
{
T oneDistance = static_cast<T>(0);
double totalInvDistance = 0.0;
/* iterate the row of the first point from 0 to N-2 */
for (int i = 0; i < nr - 1; i++)
{
/* iterate the row the second point from i+1 to N-1 */
for (int j = (i + 1); j < nr; j++)
{
oneDistance = 0;
/* iterate through the columns, summing the squared differences */
for (int k = 0; k < nc; k++)
{
/* calculate the square of the difference in one dimension between the
* points */
oneDistance += (Tmatrix[i * nc + k] - Tmatrix[j * nc + k]) * (Tmatrix[i * nc + k] - Tmatrix[j * nc + k]);
}
/* sum the inverse distances */
totalInvDistance += (1.0 / std::sqrt(static_cast<double>(oneDistance)));
}
}
return(totalInvDistance);
};
template <class T>
static double sumInvDistance(std::vector<T> & Vmatrix, size_t nr, size_t nc)
{
T oneDistance = static_cast<T>(0);
double totalInvDistance = 0.0;
/* iterate the row of the first point from 0 to N-2 */
for (size_t i = 0; i < nr - 1; i++)
{
/* iterate the row the second point from i+1 to N-1 */
for (size_t j = (i + 1); j < nr; j++)
{
oneDistance = 0;
/* iterate through the columns, summing the squared differences */
for (size_t k = 0; k < nc; k++)
{
/* calculate the square of the difference in one dimension between the
* points */
oneDistance += (Vmatrix[i * nc + k] - Vmatrix[j * nc + k]) * (Vmatrix[i * nc + k] - Vmatrix[j * nc + k]);
}
/* sum the inverse distances */
totalInvDistance += (1.0 / std::sqrt(static_cast<double>(oneDistance)));
}
}
return(totalInvDistance);
};
}; // end class utilityLHS
#endif
|
