-
Notifications
You must be signed in to change notification settings - Fork 0
/
aemutil.cpp
122 lines (102 loc) · 2.82 KB
/
aemutil.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
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
//
// AEM Invert : Software for inversion of AEM data using the
// trans-dimensional tree method and forward modelling code
// written by Ross Brodie from Geoscience Australia. See
//
// R Hawkins, R Brodie and M Sambridge, "Bayesian trans-dimensional inversion of
// Airborne Electromagnetic 2D Conductivity profiles", Exploration Geophysics, 2017
// https://doi.org/10.1071/EG16139
//
// Copyright (C) 2014 - 2018 Rhys Hawkins
//
// 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 3 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, see <http://www.gnu.org/licenses/>.
//
//
#include <stdarg.h>
#include <string.h>
#include <ctype.h>
#include "aemutil.hpp"
std::string mkfilename(const char *prefix, const char *file)
{
if (prefix == nullptr) {
return std::string(file);
} else {
return std::string(prefix) + file;
}
}
std::string mkfilenamerank(const char *prefix, const char *file, int rank)
{
char buffer[16];
sprintf(buffer, "-%03d", rank);
if (prefix == nullptr) {
return std::string(file) + buffer;
} else {
return std::string(prefix) + file + buffer;
}
}
std::string mkformatstring(const char *fmt, ...)
{
static char *buffer = nullptr;
static int buffer_size = -1;
if (buffer == nullptr) {
buffer_size = 512;
buffer = new char[buffer_size];
}
va_list ap;
int size;
va_start(ap, fmt);
size = vsnprintf(buffer, buffer_size, fmt, ap);
while (size >= buffer_size) {
delete [] buffer;
buffer_size *= 2;
buffer = new char[buffer_size];
size = vsnprintf(buffer, buffer_size, fmt, ap);
}
va_end(ap);
return std::string(buffer);
}
std::string stripwhitespaceandquotes(const char *s)
{
int i = 0;
int j = strlen(s);
while (i < j && (isspace(s[i]) || s[i] == '"' || s[j] == '\'')) {
i ++;
}
while (j > i && (isspace(s[j]) || s[j] == '"' || s[j] == '\'')) {
j --;
}
return std::string(s + i, j - i - 1);
}
bool loadhierarchicallambda(const char *filename, std::vector<double> &lambda)
{
FILE *fp;
fp = fopen(filename, "r");
if (fp == NULL) {
return false;
}
while (!feof(fp)) {
double d;
if (fscanf(fp, "%lf\n", &d) != 1) {
if (!feof(fp)) {
return false;
} else {
break;
}
} else {
lambda.push_back(d);
}
}
fclose(fp);
return true;
}