iframe-proxy | Sunbelt Computer Software

History

282 lines (250 loc) · 8.24 KB

Raw

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

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

// Non-Degree Granting Education License -- for use at non-degree

// granting, nonprofit, education, and research organizations only. Not

// for commercial or industrial use.

// boundaryHandling.cpp

// Code generation for function 'boundaryHandling'

// Include files

#include "boundaryHandling.h"

#include "find.h"

#include "rand.h"

#include "repmat.h"

#include "rt_nonfinite.h"

#include "strcmp.h"

#include "coder_array.h"

// Function Declarations

namespace RAT

{

static void binary_expand_op(::coder::array<real_T, 2U> &in1, const ::coder::

array<int32_T, 1U> &in2, const ::coder::array<real_T, 2U> &in3, const ::

coder::array<real_T, 1U> &in4, const ::coder::array<real_T, 2U> &in5);

}

// Function Definitions

namespace RAT

{

static void binary_expand_op(::coder::array<real_T, 2U> &in1, const ::coder::

array<int32_T, 1U> &in2, const ::coder::array<real_T, 2U> &in3, const ::

coder::array<real_T, 1U> &in4, const ::coder::array<real_T, 2U> &in5)

{

int32_T i;

int32_T loop_ub;

int32_T stride_0_0;

int32_T stride_1_0;

int32_T stride_2_0;

stride_0_0 = (in2.size(0) != 1);

stride_1_0 = (in4.size(0) != 1);

stride_2_0 = (in2.size(0) != 1);

if (in2.size(0) == 1) {

i = in4.size(0);

} else {

i = in2.size(0);

}

if (i == 1) {

loop_ub = in2.size(0);

} else if (in2.size(0) == 1) {

loop_ub = in4.size(0);

} else {

loop_ub = in2.size(0);

}

for (i = 0; i < loop_ub; i++) {

int32_T i1;

i1 = in2[i * stride_2_0] - 1;

in1[in2[i] - 1] = in3[in2[i * stride_0_0] - 1] + in4[i * stride_1_0] *

(in5[i1] - in3[i1]);

}

void boundaryHandling(::coder::array<real_T, 2U> &x, const ::coder::array<

real_T, 2U> &Par_info_min, const ::coder::array<real_T,

2U> &Par_info_max, const char_T

Par_info_boundhandling_data[], const int32_T

Par_info_boundhandling_size[2])

{

::coder::array<real_T, 2U> max_d;

::coder::array<real_T, 2U> min_d;

::coder::array<real_T, 1U> b_max_d;

::coder::array<int32_T, 1U> ii_low;

::coder::array<int32_T, 1U> ii_up;

::coder::array<boolean_T, 2U> b_x;

real_T b_ii_low[2];

int32_T b_loop_ub;

int32_T i;

int32_T loop_ub;

// Function to check whether parameter values remain within prior bounds

// First determine the size of new

// Now replicate min and max

coder::repmat(Par_info_min, static_cast<real_T>(x.size(0)), min_d);

coder::repmat(Par_info_max, static_cast<real_T>(x.size(0)), max_d);

// Now find which elements of x are smaller than their respective bound

if ((x.size(0) == min_d.size(0)) && (x.size(1) == min_d.size(1))) {

b_x.set_size(x.size(0), x.size(1));

loop_ub = x.size(1);

for (i = 0; i < loop_ub; i++) {

b_loop_ub = x.size(0);

for (int32_T i1{0}; i1 < b_loop_ub; i1++) {

b_x[i1 + b_x.size(0) * i] = (x[i1 + x.size(0) * i] < min_d[i1 +

min_d.size(0) * i]);

}

coder::c_eml_find(b_x, ii_up);

} else {

c_binary_expand_op(ii_up, x, min_d);

}

ii_low.set_size(ii_up.size(0));

loop_ub = ii_up.size(0);

for (i = 0; i < loop_ub; i++) {

ii_low[i] = ii_up[i];

}

// Now find which elements of x are larger than their respective bound

if ((x.size(0) == max_d.size(0)) && (x.size(1) == max_d.size(1))) {

b_x.set_size(x.size(0), x.size(1));

loop_ub = x.size(1);

for (i = 0; i < loop_ub; i++) {

b_loop_ub = x.size(0);

for (int32_T i1{0}; i1 < b_loop_ub; i1++) {

b_x[i1 + b_x.size(0) * i] = (x[i1 + x.size(0) * i] > max_d[i1 +

max_d.size(0) * i]);

}

coder::c_eml_find(b_x, ii_up);

} else {

binary_expand_op(ii_up, x, max_d);

}

// Reflection

if (coder::internal::y_strcmp(Par_info_boundhandling_data,

Par_info_boundhandling_size)) {

// reflect in min

b_max_d.set_size(ii_low.size(0));

loop_ub = ii_low.size(0);

for (i = 0; i < loop_ub; i++) {

b_max_d[i] = 2.0 * min_d[ii_low[i] - 1] - x[ii_low[i] - 1];

}

loop_ub = b_max_d.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_low[i] - 1] = b_max_d[i];

}

// reflect in max

b_max_d.set_size(ii_up.size(0));

loop_ub = ii_up.size(0);

for (i = 0; i < loop_ub; i++) {

b_max_d[i] = 2.0 * max_d[ii_up[i] - 1] - x[ii_up[i] - 1];

}

loop_ub = b_max_d.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_up[i] - 1] = b_max_d[i];

}

// Bound

if (coder::internal::ab_strcmp(Par_info_boundhandling_data,

Par_info_boundhandling_size)) {

// set lower values to min

loop_ub = ii_low.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_low[i] - 1] = min_d[ii_low[i] - 1];

}

// set upper values to max

loop_ub = ii_up.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_up[i] - 1] = max_d[ii_up[i] - 1];

}

// Folding

if (coder::internal::bb_strcmp(Par_info_boundhandling_data,

Par_info_boundhandling_size)) {

// Fold parameter space lower values

b_max_d.set_size(ii_low.size(0));

loop_ub = ii_low.size(0);

for (i = 0; i < loop_ub; i++) {

b_max_d[i] = max_d[ii_low[i] - 1] - (min_d[ii_low[i] - 1] - x[ii_low[i]

- 1]);

}

loop_ub = b_max_d.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_low[i] - 1] = b_max_d[i];

}

// Fold parameter space upper values

b_max_d.set_size(ii_up.size(0));

loop_ub = ii_up.size(0);

for (i = 0; i < loop_ub; i++) {

b_max_d[i] = min_d[ii_up[i] - 1] + (x[ii_up[i] - 1] - max_d[ii_up[i] - 1]);

}

loop_ub = b_max_d.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_up[i] - 1] = b_max_d[i];

}

// Now double check in case elements are still out of bound -- this is

// theoretically possible if values are very small or large

// Now double check if all elements are within bounds

if ((x.size(0) == min_d.size(0)) && (x.size(1) == min_d.size(1))) {

b_x.set_size(x.size(0), x.size(1));

loop_ub = x.size(1);

for (i = 0; i < loop_ub; i++) {

b_loop_ub = x.size(0);

for (int32_T i1{0}; i1 < b_loop_ub; i1++) {

b_x[i1 + b_x.size(0) * i] = (x[i1 + x.size(0) * i] < min_d[i1 +

min_d.size(0) * i]);

}

coder::c_eml_find(b_x, ii_up);

} else {

c_binary_expand_op(ii_up, x, min_d);

}

ii_low.set_size(ii_up.size(0));

loop_ub = ii_up.size(0);

for (i = 0; i < loop_ub; i++) {

ii_low[i] = ii_up[i];

}

b_ii_low[0] = ii_low.size(0);

b_ii_low[1] = 1.0;

coder::b_rand(b_ii_low, b_max_d);

if (b_max_d.size(0) == 1) {

i = ii_low.size(0);

} else {

i = b_max_d.size(0);

}

if ((b_max_d.size(0) == ii_low.size(0)) && (ii_low.size(0) == i)) {

loop_ub = ii_low.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_low[i] - 1] = min_d[ii_low[i] - 1] + b_max_d[i] * (max_d[ii_low[i]

- 1] - min_d[ii_low[i] - 1]);

}

} else {

binary_expand_op(x, ii_low, min_d, b_max_d, max_d);

}

if ((x.size(0) == max_d.size(0)) && (x.size(1) == max_d.size(1))) {

b_x.set_size(x.size(0), x.size(1));

loop_ub = x.size(1);

for (i = 0; i < loop_ub; i++) {

b_loop_ub = x.size(0);

for (int32_T i1{0}; i1 < b_loop_ub; i1++) {

b_x[i1 + b_x.size(0) * i] = (x[i1 + x.size(0) * i] > max_d[i1 +

max_d.size(0) * i]);

}

coder::c_eml_find(b_x, ii_up);

} else {

binary_expand_op(ii_up, x, max_d);

}

b_ii_low[0] = ii_up.size(0);

b_ii_low[1] = 1.0;

coder::b_rand(b_ii_low, b_max_d);

if (b_max_d.size(0) == 1) {

i = ii_up.size(0);

} else {

i = b_max_d.size(0);

}

if ((b_max_d.size(0) == ii_up.size(0)) && (ii_up.size(0) == i)) {

loop_ub = ii_up.size(0);

for (i = 0; i < loop_ub; i++) {

x[ii_up[i] - 1] = min_d[ii_up[i] - 1] + b_max_d[i] * (max_d[ii_up[i] - 1]

- min_d[ii_up[i] - 1]);

}

} else {

binary_expand_op(x, ii_up, min_d, b_max_d, max_d);

}

// End of code generation (boundaryHandling.cpp)

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

boundaryHandling.cpp

Latest commit

History

boundaryHandling.cpp

File metadata and controls