00001 /* @HEADER@ */ 00002 // ************************************************************************ 00003 // 00004 // Sundance 00005 // Copyright 2011 Sandia Corporation 00006 // 00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, 00008 // the U.S. Government retains certain rights in this software. 00009 // 00010 // Redistribution and use in source and binary forms, with or without 00011 // modification, are permitted provided that the following conditions are 00012 // met: 00013 // 00014 // 1. Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // 00017 // 2. Redistributions in binary form must reproduce the above copyright 00018 // notice, this list of conditions and the following disclaimer in the 00019 // documentation and/or other materials provided with the distribution. 00020 // 00021 // 3. Neither the name of the Corporation nor the names of the 00022 // contributors may be used to endorse or promote products derived from 00023 // this software without specific prior written permission. 00024 // 00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00036 // 00037 // Questions? Contact Kevin Long (kevin.long@ttu.edu) 00038 // 00039 00040 /* @HEADER@ */ 00041 00042 #ifndef SUNDANCE_SUMEXPR_H 00043 #define SUNDANCE_SUMEXPR_H 00044 00045 #include "SundanceBinaryExpr.hpp" 00046 #include "SundanceSumEvaluator.hpp" 00047 00048 namespace Sundance 00049 { 00050 using namespace Sundance; 00051 using namespace Teuchos; 00052 00053 00054 00055 /** 00056 * SumExpr is the internal representation of an addition or subtraction 00057 * node in the expression tree. 00058 */ 00059 class SumExpr : public BinaryExpr, 00060 public GenericEvaluatorFactory<SumExpr, SumEvaluator> 00061 { 00062 public: 00063 /** */ 00064 SumExpr(const RCP<ScalarExpr>& a, 00065 const RCP<ScalarExpr>& b, int sign); 00066 00067 /** virtual dtor */ 00068 virtual ~SumExpr() {;} 00069 00070 /** */ 00071 virtual bool isHungryDiffOp() const ; 00072 00073 /** */ 00074 virtual bool isLinear() const {return true;} 00075 00076 00077 00078 /** 00079 * Indicate whether the expression is linear 00080 * with respect to test functions */ 00081 virtual bool isLinearInTests() const ; 00082 00083 /** 00084 * Indicate whether every term in the expression contains test functions */ 00085 virtual bool everyTermHasTestFunctions() const ; 00086 00087 00088 /** Indicate whether the expression is linear in the given 00089 * functions */ 00090 virtual bool isLinearForm(const Expr& u) const ; 00091 00092 /** Indicate whether the expression is a 00093 * quadratic form in the given functions */ 00094 virtual bool isQuadraticForm(const Expr& u) const ; 00095 00096 /** */ 00097 virtual RCP<ExprBase> getRcp() {return rcp(this);} 00098 00099 /** */ 00100 const Map<Expr, int>& getSumTree() const {return sumTree_;} 00101 00102 protected: 00103 /** */ 00104 virtual bool parenthesizeSelf() const {return true;} 00105 /** */ 00106 virtual bool parenthesizeOperands() const {return false;} 00107 /** */ 00108 virtual const std::string& xmlTag() const ; 00109 /** */ 00110 virtual const std::string& opChar() const ; 00111 00112 private: 00113 Map<Expr, int> sumTree_; 00114 00115 00116 }; 00117 } 00118 #endif