SundanceUnaryMinus.hpp
Go to the documentation of this file.
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_UNARYMINUS_H
00043 #define SUNDANCE_UNARYMINUS_H
00044 
00045 #include "SundanceDefs.hpp"
00046 #include "SundanceUnaryExpr.hpp"
00047 #include "SundanceUnaryMinusEvaluator.hpp"
00048 
00049 
00050 namespace Sundance
00051 {
00052   using namespace Sundance;
00053   using namespace Teuchos;
00054   
00055 
00056       /** */
00057       class UnaryMinus : public UnaryExpr,
00058                          GenericEvaluatorFactory<UnaryMinus, UnaryMinusEvaluator>
00059         {
00060         public:
00061           /** construct with the argument */
00062           UnaryMinus(const RCP<ScalarExpr>& arg);
00063 
00064           /** virtual dtor */
00065           virtual ~UnaryMinus() {;}
00066 
00067 
00068           /** */
00069           virtual std::ostream& toText(std::ostream& os, bool paren) const ;
00070 
00071           /** */
00072           virtual XMLObject toXML() const ;
00073 
00074           /** */
00075           virtual bool isLinear() const {return true;}
00076 
00077           /** 
00078            * Indicate whether the expression is linear 
00079            * with respect to test functions 
00080            */
00081           virtual bool isLinearInTests() const 
00082             {return evaluatableArg()->isLinearInTests();}
00083           
00084 
00085           /** Indicate whether the expression is linear in the given 
00086            * functions */
00087           virtual bool isLinearForm(const Expr& u) const 
00088             {
00089               return evaluatableArg()->isLinearForm(u);
00090             }
00091 
00092           /** Indicate whether the expression is at most 
00093            * quadratic in the given functions */
00094           virtual bool isQuadraticForm(const Expr& u) const
00095             {
00096               return evaluatableArg()->isQuadraticForm(u);
00097             }
00098 
00099           /** */
00100           virtual Set<MultiSet<int> > internalFindQ_W(int order, 
00101                                                    const EvalContext& context) const ;
00102 
00103           /** */
00104           virtual RCP<ExprBase> getRcp() {return rcp(this);}
00105 
00106         };
00107     }
00108 
00109 #endif

Site Contact