iframe-proxy | Sunbelt Computer Software

History

212 lines (191 loc) · 5.41 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

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

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

// for commercial or industrial use.

// RATMain_internal_types.h

// Code generation for function 'RATMain'

#ifndef RATMAIN_INTERNAL_TYPES_H

#define RATMAIN_INTERNAL_TYPES_H

// Include files

#include "RATMain_types.h"

#include "rtwtypes.h"

#include "coder_array.h"

#include "coder_bounded_array.h"

// Type Definitions

namespace RAT

{

struct struct_T

{

real_T LogZ;

::coder::bounded_array<real_T, 2U, 2U> nestSamples;

::coder::bounded_array<real_T, 2U, 2U> postSamples;

};

struct b_struct_T

{

::coder::array<real_T, 3U> allChains;

struct12_T dreamOutput;

struct_T nestOutput;

};

struct cell_wrap_12

{

::coder::array<cell_wrap_8, 1U> f1;

};

struct cell_wrap_14

{

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

};

struct c_struct_T

{

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

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

::coder::bounded_array<char_T, 10000U, 2U> TF;

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

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

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

real_T numberOfContrasts;

::coder::bounded_array<char_T, 10000U, 2U> geometry;

boolean_T useImaginary;

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

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

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

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

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

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

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

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

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

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

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

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

real_T numberOfLayers;

::coder::bounded_array<char_T, 10000U, 2U> modelType;

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

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

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

real_T numberOfDomainContrasts;

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

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

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

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

};

struct cell_11

{

::coder::array<cell_wrap_2, 2U> f1;

::coder::array<cell_wrap_8, 2U> f2;

::coder::array<cell_wrap_2, 2U> f3;

::coder::array<cell_wrap_2, 2U> f4;

::coder::array<cell_wrap_8, 2U> f5;

::coder::array<cell_wrap_8, 1U> f6;

::coder::array<cell_wrap_1, 2U> f7;

::coder::array<cell_wrap_1, 2U> f8;

::coder::array<cell_wrap_1, 2U> f9;

::coder::array<cell_wrap_1, 2U> f10;

::coder::array<cell_wrap_1, 2U> f11;

::coder::array<cell_wrap_1, 2U> f12;

::coder::array<cell_wrap_1, 2U> f13;

::coder::array<cell_wrap_1, 2U> f14;

::coder::array<cell_wrap_1, 2U> f15;

::coder::array<cell_wrap_1, 2U> f16;

::coder::array<cell_wrap_8, 2U> f17;

::coder::array<cell_wrap_2, 2U> f18;

::coder::array<cell_wrap_8, 2U> f19;

::coder::array<cell_wrap_1, 2U> f20;

};

struct d_struct_T

{

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

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

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

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

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

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

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

struct6_T calculations;

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

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

};

struct cell_wrap_34

{

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

};

struct cell_wrap_20

{

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

};

struct cell_wrap_35

{

cell_wrap_8 f1[2];

};

struct e_struct_T

{

::coder::array<cell_wrap_8, 2U> ref;

::coder::array<cell_wrap_8, 2U> sld;

real_T chi;

::coder::array<cell_wrap_8, 2U> data;

};

struct f_struct_T

{

::coder::array<cell_wrap_48, 1U> refPredInts;

::coder::array<cell_wrap_48, 2U> sldPredInts;

::coder::array<cell_wrap_22, 2U> refXdata;

::coder::array<cell_wrap_22, 2U> sldXdata;

real_T sampleChi[1000];

};

struct g_struct_T

{

struct8_T bestFitsMean;

struct9_T predlims;

struct10_T parConfInts;

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

b_struct_T bayesRes;

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

};

struct i_struct_T

{

real_T iterations;

real_T funcCount;

char_T algorithm[33];

::coder::array<char_T, 2U> message;

};

struct j_struct_T

{

::coder::bounded_array<real_T, 1U, 1U> I_lentol;

::coder::bounded_array<real_T, 50U, 2U> FVr_x;

::coder::bounded_array<real_T, 50U, 2U> FVr_lim_up;

::coder::bounded_array<real_T, 50U, 2U> FVr_lim_lo;

real_T I_NP;

real_T fWeight;

real_T F_CR;

real_T I_D;

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

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

real_T I_bnd_constr;

real_T I_itermax;

real_T F_VTR;

real_T I_strategy;

real_T I_refresh;

real_T I_plotting;

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

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

};

struct cell_25

{

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

};

struct k_struct_T

{

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

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

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

};

struct l_struct_T

{

real_T I_no;

real_T FVr_oa;

};

}

#endif

// End of code generation (RATMain_internal_types.h)

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

RATMain_internal_types.h

Latest commit

History

RATMain_internal_types.h

File metadata and controls