SundanceEvalVectorArray.cpp
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 
00043 #include "SundanceEvalVectorArray.hpp"
00044 #include "SundanceSparsitySuperset.hpp"
00045 #include "PlayaTabs.hpp"
00046 
00047 using namespace Sundance;
00048 using namespace Sundance;
00049 
00050 using namespace Teuchos;
00051 
00052 EvalVectorArray::EvalVectorArray()
00053   : Array<RCP<EvalVector> >()
00054 {;}
00055 
00056 void EvalVectorArray::copy(const RCP<EvalVectorArray>& other)
00057 {
00058   resize(other->size());
00059 
00060   for (int i=0; i<other->size(); i++)
00061     {
00062       (*this)[i]->copy((*other)[i]);
00063     }
00064 }
00065 
00066 void EvalVectorArray::steal(const RCP<EvalVectorArray>& other)
00067 {
00068   resize(other->size());
00069 
00070   for (int i=0; i<other->size(); i++)
00071     {
00072       (*this)[i] = (*other)[i];
00073     }
00074 }
00075 
00076 ostream& EvalVectorArray::print(std::ostream& os, 
00077                                 const SparsitySuperset* derivs) const
00078 {
00079   Tabs tab;
00080   TEUCHOS_TEST_FOR_EXCEPTION(derivs->numDerivs() != this->size(),
00081                      std::logic_error,
00082                      "mismatch between deriv set size=" << derivs->numDerivs()
00083                      << "and result vector size " << this->size()
00084                      << "in EvalVectorArray::print");
00085 
00086   int maxlen = 25;
00087   for (int i=0; i<derivs->numDerivs(); i++)
00088     {
00089       int s = derivs->deriv(i).toString().length();
00090       if (s > maxlen) maxlen = s;
00091     }
00092   
00093   for (int i=0; i<derivs->numDerivs(); i++)
00094     {
00095       os << tab;
00096       os.width(maxlen);
00097       os.setf(ios_base::left, ios_base::adjustfield);
00098       os << derivs->deriv(i).toString() << "\t\t";
00099       (*this)[i]->print(os);
00100       os << std::endl;
00101     }
00102   return os;
00103 }

Site Contact