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 #include "SundanceUnaryMinus.hpp" 00043 00044 using namespace Sundance; 00045 using namespace Sundance; 00046 00047 using namespace Sundance; 00048 using namespace Teuchos; 00049 00050 UnaryMinus::UnaryMinus(const RCP<ScalarExpr>& arg) 00051 : UnaryExpr(arg) 00052 {} 00053 00054 Set<MultiSet<int> > UnaryMinus::internalFindQ_W(int order, const EvalContext& context) const 00055 { 00056 int verb = context.setupVerbosity(); 00057 Tabs tab(0); 00058 SUNDANCE_MSG2(verb, tab << "UnaryMinus::internalFindQ_W(" << order << ")"); 00059 Set<MultiSet<int> > rtn; 00060 if (order > 1) return rtn; 00061 00062 if (order==1) 00063 { 00064 /* first derivatives of the sum wrt the arguments are 00065 * always nonzero */ 00066 rtn.put(makeMultiSet<int>(0)); 00067 } 00068 else 00069 { 00070 /* zeroth derivatives are nonzero if terms are nonzero */ 00071 const Set<MultipleDeriv>& w 00072 = evaluatableArg()->findW(0, context); 00073 if (w.size() > 0) 00074 { 00075 rtn.put(makeMultiSet<int>(0)); 00076 } 00077 } 00078 return rtn; 00079 } 00080 00081 std::ostream& UnaryMinus::toText(std::ostream& os, bool paren) const 00082 { 00083 if (paren) os << "("; 00084 os << "-" << arg().toString(); 00085 if (paren) os << ")"; 00086 return os; 00087 } 00088 00089 XMLObject UnaryMinus::toXML() const 00090 { 00091 XMLObject rtn("UnaryMinus"); 00092 rtn.addChild(arg().toXML()); 00093 return rtn; 00094 }