-
Notifications
You must be signed in to change notification settings - Fork 2
/
meridionalsolvercase_experiemental.h
270 lines (241 loc) · 8.97 KB
/
meridionalsolvercase_experiemental.h
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
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
#pragma once
#include "meridionalsolvercase.h"
namespace yams
{
template <typename T>
class MeridionalGridConnection
{
std::shared_ptr< SolverCase<T> > m_left;
std::shared_ptr< SolverCase<T> > m_right;
size_t j1_left;
size_t j2_left;
size_t j1_right;
size_t j2_right;
public:
MeridionalGridConnection( const std::shared_ptr< SolverCase<T> > &left, const std::shared_ptr< SolverCase<T> > &right, const std::array<size_t, 4> &connection_spans) :
m_left{left},
m_right{right},
j1_left{connection_spans[0]},
j2_left{connection_spans[1]},
j1_right{connection_spans[2]},
j2_right{connection_spans[3]}
{
if( (j1_left - j2_left) != (j1_right - j2_right) )
{
throw std::invalid_argument("Default connection requires same stream lines number.");
}
}
MeridionalGridConnection( const std::shared_ptr< SolverCase<T> > &left, const std::shared_ptr< SolverCase<T> > &right) :
MeridionalGridConnection<T>{left, right, {0, left->nRows()-1, 0, right->nRows()-1}} {}
auto isLeft(const std::shared_ptr< SolverCase<T> > &solver_case)
{
return m_left == solver_case;
}
auto isRight(const std::shared_ptr< SolverCase<T> > &solver_case)
{
return m_right == solver_case;
}
// auto copyLeftToRightGhost() -> void
// {
// std::copy(
// std::next( m_left->begin(m_left->nRows()-1), j1_left),
// std::next( m_left->end(m_left->nRows()-1), j2_left),
// std::next( m_right->begin(0), j1_right)
// );
// std::copy(
// std::next( m_left->begin(m_left->nRows()-2), j1_left),
// std::next( m_left->end(m_left->nRows()-2), j2_left),
// std::next( m_right->begin(-1), j1_right)
// );
// std::copy(
// std::next( m_right->begin(1), j1_right),
// std::next( m_right->begin(1), j2_right),
// std::next( m_left->begin(m_left->nRows()), j1_left)
// );
// }
auto getIterators(size_t i_left, size_t i_right)
{
auto g_left = m_left->gi->g ;
auto g_right = m_right->gi->g;
auto to_begin = std::next( g_right->begin(i_right), j1_right);
auto to_end = std::next( g_right->begin(i_right), j2_right+1);
auto from_begin = std::next( g_left->begin(i_left), j1_left);
auto from_end = std::next( g_left->begin(i_left), j2_left+1);
return std::make_tuple(to_begin, to_end, from_begin, from_end);
}
auto copyLeftToRight() -> void
{
auto [ to_begin, to_end, from_begin, from_end ] = getIterators(m_left->gi->ni - 1, 0);
std::copy(
from_begin,
from_end,
to_begin
);
}
auto interpolateCurvature() -> void
{
auto [ to_begin, to_end, from_begin, from_end ] = getIterators(m_left->gi->ni - 2, 1);
// std::vector<T> cur(size());
// std::transform(
// from_begin, from_end,
// to_begin,
// cur.begin(),
// [](const auto &gp_left, const auto &gp_right)
// {
// return (gp_left.cur+gp_right.cur) / 2;
// }
// );
std::vector<MeridionalGridPoint<T>> cur(size());
std::transform(
from_begin, from_end,
to_begin,
cur.begin(),
[](const auto &gp_left, const auto &gp_right)
{
auto gp{gp_left };
gp.cur= (gp_left.cur+gp_right.cur) / 2;
gp.gam= (gp_left.gam+gp_right.gam) / 2;
gp.phi= (gp_left.phi+gp_right.phi) / 2;
return gp;
}
);
auto [ to_right_begin, to_right_end, to_left_begin, to_left_end ] = getIterators(m_left->gi->ni - 1, 0);
std::transform(
cur.begin(),
cur.end(),
to_right_begin,
to_right_begin,
[](const auto &gp_, const auto &gp_orig )
{
auto gp{gp_orig };
gp.cur = gp_.cur;
gp.gam = gp_.gam;
gp.phi = gp_.phi;
return gp;
}
);
std::transform(
cur.begin(),
cur.end(),
to_left_begin,
to_left_begin,
[](const auto &gp_, const auto &gp_orig )
{
auto gp{gp_orig };
gp.cur = gp_.cur;
gp.gam = gp_.gam;
gp.phi = gp_.phi;
return gp;
}
);
// std::transform(
// cur.begin(),
// cur.end(),
// to_right_begin,
// to_right_begin,
// [](auto cur, const auto &gp )
// {
// auto gp_{gp};
// gp_.cur = cur;
// return gp_;
// }
// );
// std::transform(
// cur.begin(),
// cur.end(),
// to_left_begin,
// to_left_begin,
// [](auto cur, const auto &gp )
// {
// auto gp_{gp};
// gp_.cur = cur;
// return gp_;
// }
// );
}
auto setBoth(size_t i,T v, const auto &f)
{
// f()
}
auto size() const { return j2_left - j1_left + 1;}
};
template <typename T>
class SolverCaseSet
{
std::list< std::shared_ptr< SolverCase<T> > > m_cases;
std::list< MeridionalGridConnection<T> > m_connections;
auto containsCase(const std::shared_ptr< SolverCase<T> > &solver_case) -> bool
{
return std::end(m_cases) != std::find(m_cases.begin(), m_cases.end(), solver_case);
}
public:
// SolverCaseSet() = default;
SolverCaseSet() = delete;
SolverCaseSet(const std::shared_ptr< SolverCase<T> > & inlet) : m_cases{inlet} {}
auto addCases(const std::shared_ptr< SolverCase<T> > &left, const std::shared_ptr< SolverCase<T> > &right, const std::array<size_t, 4> &connection_spans)
{
left->mf_ref_span = left->gi->ni - 1;
right->mf_ref_span = 0;
auto has_left = containsCase(left);
auto has_right= containsCase(right);
if( has_right && has_left)
{
throw std::invalid_argument("Channels already connected.");
}
MeridionalGridConnection<T> connection{left, right, connection_spans};
m_connections.push_back( connection );
if(!has_left)
{
m_cases.push_back(left);
}
if(!has_right)
{
m_cases.push_back(right);
}
}
auto addCases(const std::shared_ptr< SolverCase<T> > &left, const std::shared_ptr< SolverCase<T> > &right )// -> bool
{
if( left->gi->nj != right->gi->nj)
{
throw std::invalid_argument("Default connection requires same stream lines number.");
}
addCases(left, right, {0, left->gi->nj-1, 0, right->gi->nj-1});
}
auto & cases() {return m_cases;}
auto & connections() {return m_connections;}
const auto & cases() const {return m_cases;}
const auto & connections() const {return m_connections;}
};
template <typename T>
class SolverCaseBiPass
{
std::shared_ptr<SolverCase<T> > m_prim;
std::shared_ptr<SolverCase<T> > m_sec;
SolverCase<T> m_inlet;
size_t m_i_bip;
void computeInletGrid(){
auto ni = m_i_bip + 1;
auto nj_prim = m_prim->gi->nj;
auto nj_sec = m_sec->gi->nj;
auto nj = nj_prim + nj_prim - 1;
gbs::points_vector<T,2> pts(ni*nj);
for(size_t i{}; i <= m_i_bip; i++)
{
}
}
public:
// InletBC<T> inlet;
auto & primary(){return *m_prim;}
auto & secondary(){return *m_sec;}
auto & inlet(){return m_inlet;}
auto iBip(){return m_i_bip;}
T BPR = 2.;
SolverCaseBiPass(
const std::shared_ptr< SolverCase<T> > &prim,
const std::shared_ptr< SolverCase<T> > &sec, size_t iBip
) : m_prim{prim}, m_sec{sec}, m_i_bip{iBip}
{
computeInletGrid();
}
};
}