SundanceEvaluator.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 #include "SundanceEvaluator.hpp"
00043 #include "SundanceEvalManager.hpp"
00044 #include "SundanceCoordExpr.hpp"
00045 #include "SundanceZeroExpr.hpp"
00046 #include "SundanceSpatiallyConstantExpr.hpp"
00047 #include "SundanceSymbolicFuncElement.hpp"
00048 #include "SundanceDiscreteFuncElement.hpp"
00049 #include "SundanceSet.hpp"
00050 #include "PlayaTabs.hpp"
00051 #include "SundanceOut.hpp"
00052 
00053 using namespace Sundance;
00054 using namespace Sundance;
00055 
00056 using namespace Sundance;
00057 using namespace Teuchos;
00058 
00059 
00060 
00061 
00062 Evaluator::Evaluator()
00063   : numClients_(0),
00064     numCalls_(0),
00065     vectorResultCache_(),
00066     constantResultCache_(),
00067     constantIndexMap_(),
00068     vectorIndexMap_(),
00069     vectorIndices_(),
00070     constantIndices_()
00071 {}
00072 
00073 
00074 
00075 void Evaluator::eval(const EvalManager& mgr,
00076                      Array<double>& constantResults,
00077                      Array<RCP<EvalVector> >& vectorResults) const
00078 {
00079   Tabs tabs;
00080 
00081   if (numCalls_ == 0)
00082     {
00083       internalEval(mgr, constantResultCache_, vectorResultCache_);
00084     }
00085   
00086   numCalls_++;
00087 
00088   /* Go ahead and copy the constant results every time, 
00089    * since this is cheap */
00090   if (constantResultCache_.size() > 0) constantResults = constantResultCache_;
00091 
00092   /* If all clients have called, we can return the original data
00093    * which can then be changed by the client. */
00094   if (numCalls_ == numClients_)
00095     {
00096       SUNDANCE_VERB_MEDIUM(tabs << "surrendering cached results");
00097       vectorResults = vectorResultCache_;
00098     }
00099   else /* Otherwise, make a copy of the data */
00100     {
00101       SUNDANCE_VERB_MEDIUM(tabs << "cloning cached results");
00102       vectorResults.resize(vectorResultCache_.size());
00103       for (int i=0; i < vectorResults.size(); i++)
00104         {
00105           vectorResults[i] = vectorResultCache_[i]->clone();
00106         }
00107     }
00108 }
00109 
00110 
00111 void Evaluator::addConstantIndex(int index, int constantIndex)
00112 {
00113   TEUCHOS_TEST_FOR_EXCEPTION(constantIndexMap_.containsKey(index), std::logic_error,
00114                      "duplicate index " << index 
00115                      << " found in Evaluator::addConstantIndex");
00116   constantIndexMap_.put(index, constantIndex);
00117   constantIndices_.append(index);
00118 }
00119 
00120 void Evaluator::addVectorIndex(int index, int vectorIndex)
00121 {
00122   TEUCHOS_TEST_FOR_EXCEPTION(vectorIndexMap_.containsKey(index), std::logic_error,
00123                      "duplicate index " << index 
00124                      << " found in Evaluator::addVectorIndex");
00125   vectorIndexMap_.put(index, vectorIndex);
00126   vectorIndices_.append(index);
00127 }
00128 

Site Contact