/*---------------------------------------------------------------------------*\ ========= | \\ / 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 . 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 struct UnaryExpression : public expression::expression { X x; UnaryExpression(X&& x) : x(std::move(x)) {} }; template class UnaryExpression : public expression::expression { const ConditionalIfBaseOf, nil> tx_; public: const X& x; UnaryExpression(const X& x) : x(x) {} UnaryExpression(const tmp& 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 struct ArgX { using type = Type; }; template struct ArgX> { using type = X; }; template using ArgXType = typename ArgX::type; template const Type& argX(const Type& t) { return t; } template Type& argX(Type& t) { return t; } template const X& argX(const UnaryExpression& e) { return e.x; } template X& argX(UnaryExpression& e) { return e.x; } // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // //- Specialise Expressionable for the unary expression. A unary expression is // considered expressionable if it's sub-expression is expressionable. template struct Expressionable> : public Expressionable> {}; template struct Expressionable, Arguments> : public Expressionable, Arguments ...>> {}; // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // //- Specialise AllContainers and TypeContainers for the unary expression so // that access is forwarded to the sub-expression template struct AllContainers < UnaryExpression, EnableIfExpressionable> > { using allContainersX = AllContainers>; static const unsigned n = allContainersX::n; using type = typename allContainersX::type; template static typename Property::type get ( const UnaryExpression& e ) { return allContainersX::template get(e.x); } template static void get ( const UnaryExpression& e, FixedList& result ) { allContainersX::template get(e.x, result); } }; template struct TypeContainers < UnaryExpression, Type, EnableIfNotBaseOf> > { using typeContainersX = TypeContainers, Type>; static const unsigned n = typeContainersX::n; template static typename Property::type get ( const UnaryExpression& e ) { return typeContainersX::template get(e.x); } template static void get ( const UnaryExpression& e, FixedList& result ) { typeContainersX::template get(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 struct UnaryExpressionOperateBase { using operateX = Operate, Arguments ...>>; static bool compare ( const UnaryExpression& e, const Args& ... args ) { return operateX::compare(e.x, argX(args) ...); } static void advance ( const UnaryExpression& e, Args& ... args ) { operateX::advance(e.x, argX(args) ...); } }; template struct Operate < UnaryExpression, Arguments, EnableIfNotExpressionable, Args ...> > : public UnaryExpressionOperateBase { using operateX = typename UnaryExpressionOperateBase::operateX; using type = decltype(Op::value(std::declval())); static type access ( const UnaryExpression& e, const Args& ... args ) { return Op::value(operateX::access(e.x, argX(args) ...)); } }; template struct Operate < UnaryExpression, Arguments, EnableIfExpressionable, Args ...> > : public UnaryExpressionOperateBase { using operateX = typename UnaryExpressionOperateBase::operateX; using type = UnaryExpression; static type access ( const UnaryExpression& 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 struct Operation> { 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 struct Name < UnaryExpression, EnableIfExpressionable> > { using nameX = Name>; static word& append(word& name, const UnaryExpression& e) { name.append(Op::prefix); if ( Op::precedence != Operation::precedence && Operation::precedence != Operation::precedence && Op::precedence > Operation::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& e) { word name; return append(name, e); } }; // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // } // End namespace expression } // End namespace Foam // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * // #endif // ************************************************************************* //