SundanceUnaryMinus.cpp
Go to the documentation of this file.
00001 /* @HEADER@ */
00002 // ************************************************************************
00003 // 
00004 //                              Sundance
00005 //                 Copyright (2005) Sandia Corporation
00006 // 
00007 // Copyright (year first published) Sandia Corporation.  Under the terms 
00008 // of Contract DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government 
00009 // retains certain rights in this software.
00010 // 
00011 // This library is free software; you can redistribute it and/or modify
00012 // it under the terms of the GNU Lesser General Public License as
00013 // published by the Free Software Foundation; either version 2.1 of the
00014 // License, or (at your option) any later version.
00015 //  
00016 // This library is distributed in the hope that it will be useful, but
00017 // WITHOUT ANY WARRANTY; without even the implied warranty of
00018 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00019 // Lesser General Public License for more details.
00020 //                                                                                 
00021 // You should have received a copy of the GNU Lesser General Public
00022 // License along with this library; if not, write to the Free Software
00023 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
00024 // USA                                                                                
00025 // Questions? Contact Kevin Long (krlong@sandia.gov), 
00026 // Sandia National Laboratories, Livermore, California, USA
00027 // 
00028 // ************************************************************************
00029 /* @HEADER@ */
00030 
00031 #include "SundanceUnaryMinus.hpp"
00032 
00033 using namespace Sundance;
00034 using namespace Sundance;
00035 
00036 using namespace Sundance;
00037 using namespace Teuchos;
00038 
00039 UnaryMinus::UnaryMinus(const RCP<ScalarExpr>& arg)
00040   : UnaryExpr(arg)
00041 {}
00042 
00043 Set<MultiSet<int> > UnaryMinus::internalFindQ_W(int order, const EvalContext& context) const
00044 {
00045   int verb = context.setupVerbosity();
00046   Tabs tab(0);
00047   SUNDANCE_MSG2(verb, tab << "UnaryMinus::internalFindQ_W(" << order << ")");
00048   Set<MultiSet<int> > rtn;
00049   if (order > 1) return rtn;
00050 
00051   if (order==1)
00052   {
00053     /* first derivatives of the sum wrt the arguments are 
00054      * always nonzero */
00055     rtn.put(makeMultiSet<int>(0));
00056   }
00057   else 
00058   {
00059     /* zeroth derivatives are nonzero if terms are nonzero */
00060     const Set<MultipleDeriv>& w 
00061       = evaluatableArg()->findW(0, context);
00062     if (w.size() > 0)
00063     {
00064       rtn.put(makeMultiSet<int>(0));
00065     }
00066   }
00067   return rtn;
00068 }
00069 
00070 std::ostream& UnaryMinus::toText(std::ostream& os, bool paren) const 
00071 {
00072   if (paren) os << "(";
00073   os << "-" << arg().toString();
00074   if (paren) os << ")";
00075   return os;
00076 }
00077 
00078 XMLObject UnaryMinus::toXML() const
00079 {
00080   XMLObject rtn("UnaryMinus");
00081   rtn.addChild(arg().toXML());
00082   return rtn;
00083 }

Site Contact