-
Notifications
You must be signed in to change notification settings - Fork 0
/
analysis.cpp
72 lines (64 loc) · 1.75 KB
/
analysis.cpp
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
#include <iostream>
#include "OMFContainer.h"
void minmax(array_ptr array, float &min, float &max) {
float minSearch = (float)(*array)[0][0][0][0];;
float maxSearch = (float)(*array)[0][0][0][0];;
const long unsigned int *size = array->shape();
int xnodes = size[0];
int ynodes = size[1];
int znodes = size[2];
for(int i=0; i<xnodes; i++)
{
for(int j=0; j<ynodes; j++)
{
for(int k=0; k<znodes; k++)
{
for(int v=0; v<3; v++) {
if ((*array)[i][j][k][v] < minSearch) {
minSearch = (float)(*array)[i][j][k][v];
}
if ((*array)[i][j][k][v] > maxSearch) {
maxSearch = (float)(*array)[i][j][k][v];
}
}
}
}
}
max = maxSearch;
min = minSearch;
// std::cout << "Max value\t" << max << std::endl;
// std::cout << "Min value\t" << min << std::endl;
}
void minmaxmag(array_ptr array, float &min, float &max) {
float mag = sqrt( (*array)[0][0][0][0] * (*array)[0][0][0][0] +
(*array)[0][0][0][1] * (*array)[0][0][0][1] +
(*array)[0][0][0][2] * (*array)[0][0][0][2]);
float minSearch = mag;
float maxSearch = mag;
const long unsigned int *size = array->shape();
int xnodes = size[0];
int ynodes = size[1];
int znodes = size[2];
for(int i=0; i<xnodes; i++)
{
for(int j=0; j<ynodes; j++)
{
for(int k=0; k<znodes; k++)
{
mag = sqrt( (*array)[i][j][k][0] * (*array)[i][j][k][0] +
(*array)[i][j][k][1] * (*array)[i][j][k][1] +
(*array)[i][j][k][2] * (*array)[i][j][k][2]);
if (mag < minSearch) {
minSearch = (float)mag;
}
if (mag > maxSearch) {
maxSearch = (float)mag;
}
}
}
}
max = maxSearch;
min = minSearch;
// std::cout << "Max value\t" << max << std::endl;
// std::cout << "Min value\t" << min << std::endl;
}