File size: 9,987 Bytes
5a600cf | 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 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2026 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM 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.
OpenFOAM 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 OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
Class
Foam::UnaryExpression
Description
Unary expression class. Wraps a single sub-type which may be another
expression or an expressionable container or a constant value. Applies a
unary operation to the output of this sub-expression.
Note the specialisation of this class. This stores the sub-expression if it
is provided as an r-value, thereby ensuring that it remains in scope as
long as the outer expression does. And it takes a constant reference if the
sub-expression is provided as a reference, which ensures that copies are
not made unnecessarily.
\*---------------------------------------------------------------------------*/
#ifndef UnaryExpression_H
#define UnaryExpression_H
#include "expressionContainers.H"
#include "expressionOperate.H"
#include "expressionName.H"
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace Foam
{
/*---------------------------------------------------------------------------*\
Class UnaryExpression Declaration
\*---------------------------------------------------------------------------*/
template<class X, class Op>
struct UnaryExpression
:
public expression::expression
{
X x;
UnaryExpression(X&& x)
:
x(std::move(x))
{}
};
template<class X, class Op>
class UnaryExpression<const X&, Op>
:
public expression::expression
{
const ConditionalIfBaseOf<refCount, X, tmp<X>, nil> tx_;
public:
const X& x;
UnaryExpression(const X& x)
:
x(x)
{}
UnaryExpression(const tmp<X>& tx)
:
tx_(tx, true),
x(tx_())
{
tx.clear();
}
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
namespace expression
{
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
//- Helper type definitions and functions for forwarding the sub-expression as
// an argument. If the type is a unary expression, then forward the
// sub-expression, otherwise forward the type itself.
template<class Type>
struct ArgX
{
using type = Type;
};
template<class X, class Op>
struct ArgX<UnaryExpression<X, Op>>
{
using type = X;
};
template<class Type>
using ArgXType = typename ArgX<Type>::type;
template<class Type>
const Type& argX(const Type& t)
{
return t;
}
template<class Type>
Type& argX(Type& t)
{
return t;
}
template<class X, class Op>
const X& argX(const UnaryExpression<X, Op>& e)
{
return e.x;
}
template<class X, class Op>
X& argX(UnaryExpression<X, Op>& e)
{
return e.x;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
//- Specialise Expressionable for the unary expression. A unary expression is
// considered expressionable if it's sub-expression is expressionable.
template<class X, class Op>
struct Expressionable<UnaryExpression<X, Op>>
:
public Expressionable<std::decay_t<X>>
{};
template<class X, class Op, class ... Args>
struct Expressionable<UnaryExpression<X, Op>, Arguments<Args ...>>
:
public Expressionable<std::decay_t<X>, Arguments<ArgXType<Args> ...>>
{};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
//- Specialise AllContainers and TypeContainers for the unary expression so
// that access is forwarded to the sub-expression
template<class X, class Op>
struct AllContainers
<
UnaryExpression<X, Op>,
EnableIfExpressionable<UnaryExpression<X, Op>>
>
{
using allContainersX = AllContainers<std::decay_t<X>>;
static const unsigned n = allContainersX::n;
using type = typename allContainersX::type;
template<class Property, unsigned I>
static typename Property::type get
(
const UnaryExpression<X, Op>& e
)
{
return allContainersX::template get<Property, I>(e.x);
}
template<class Property, unsigned I, unsigned N>
static void get
(
const UnaryExpression<X, Op>& e,
FixedList<typename Property::type, N>& result
)
{
allContainersX::template get<Property, I>(e.x, result);
}
};
template<class X, class Op, class Type>
struct TypeContainers
<
UnaryExpression<X, Op>,
Type,
EnableIfNotBaseOf<Type, UnaryExpression<X, Op>>
>
{
using typeContainersX = TypeContainers<std::decay_t<X>, Type>;
static const unsigned n = typeContainersX::n;
template<class Property, unsigned I>
static typename Property::type get
(
const UnaryExpression<X, Op>& e
)
{
return typeContainersX::template get<Property, I>(e.x);
}
template<class Property, unsigned I, unsigned N>
static void get
(
const UnaryExpression<X, Op>& e,
FixedList<typename Property::type, N>& result
)
{
typeContainersX::template get<Property, I>(e.x, result);
}
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
//- Specialise Operate for the unary expression so that operations are
// forwarded to the sub-expression.
//
// Note different specialisations for expressionable and non-expressionable
// unary expressions. The non-expressionable specialisation access returns a
// value as calculated by the operation, whilst the expressionable
// specialisation returns another expression containing the accessed
// sub-types. In this way, the expressions can be nested, with each level
// generating an appropriate type to which an element of an expressionable
// container (container of containers, etc...) can be assigned.
template<class X, class Op, class ... Args>
struct UnaryExpressionOperateBase
{
using operateX =
Operate<std::decay_t<X>, Arguments<ArgXType<Args> ...>>;
static bool compare
(
const UnaryExpression<X, Op>& e,
const Args& ... args
)
{
return operateX::compare(e.x, argX(args) ...);
}
static void advance
(
const UnaryExpression<X, Op>& e,
Args& ... args
)
{
operateX::advance(e.x, argX(args) ...);
}
};
template<class X, class Op, class ... Args>
struct Operate
<
UnaryExpression<X, Op>,
Arguments<Args ...>,
EnableIfNotExpressionable<UnaryExpression<X, Op>, Args ...>
>
:
public UnaryExpressionOperateBase<X, Op, Args ...>
{
using operateX =
typename UnaryExpressionOperateBase<X, Op, Args ...>::operateX;
using type =
decltype(Op::value(std::declval<typename operateX::type>()));
static type access
(
const UnaryExpression<X, Op>& e,
const Args& ... args
)
{
return Op::value(operateX::access(e.x, argX(args) ...));
}
};
template<class X, class Op, class ... Args>
struct Operate
<
UnaryExpression<X, Op>,
Arguments<Args ...>,
EnableIfExpressionable<UnaryExpression<X, Op>, Args ...>
>
:
public UnaryExpressionOperateBase<X, Op, Args ...>
{
using operateX =
typename UnaryExpressionOperateBase<X, Op, Args ...>::operateX;
using type = UnaryExpression<typename operateX::type, Op>;
static type access
(
const UnaryExpression<X, Op>& e,
const Args& ... args
)
{
return type(operateX::access(e.x, argX(args) ...));
}
};
//- Specialise Operation for the unary expression. Take the base operator type
// and precedence from the operation parameter.
template<class X, class Op>
struct Operation<UnaryExpression<X, Op>>
{
using type = Op;
static const signed char precedence = Op::precedence;
};
//- Specialise Name for the unary expression. Wraps the name of the
// sub-expression in the name of the operation, adding brackets if the
// relative precedence of the operations requires it.
template<class X, class Op>
struct Name
<
UnaryExpression<X, Op>,
EnableIfExpressionable<UnaryExpression<X, Op>>
>
{
using nameX = Name<std::decay_t<X>>;
static word& append(word& name, const UnaryExpression<X, Op>& e)
{
name.append(Op::prefix);
if
(
Op::precedence != Operation<void>::precedence
&& Operation<X>::precedence != Operation<void>::precedence
&& Op::precedence > Operation<X>::precedence
)
{
name.append('(');
nameX::append(name, e.x);
name.append(')');
}
else
{
nameX::append(name, e.x);
}
return name.append(Op::postfix);
}
static word value(const UnaryExpression<X, Op>& e)
{
word name;
return append(name, e);
}
};
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
} // End namespace expression
} // End namespace Foam
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
#endif
// ************************************************************************* //
|