SundancePositionalCellPredicate.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 "SundancePositionalCellPredicate.hpp"
00032 
00033 using namespace Sundance;
00034 using namespace Sundance;
00035 using namespace Sundance;
00036 using namespace Teuchos;
00037 
00038 bool PositionalCellPredicate::lessThan(const CellPredicateBase* other) const
00039 {
00040   TEUCHOS_TEST_FOR_EXCEPTION(dynamic_cast<const PositionalCellPredicate*>(other) == 0,
00041                      std::logic_error,
00042                      "argument " << other->toXML() 
00043                      << " to PositionalCellPredicate::lessThan() should be "
00044                      "a PositionalCellPredicate pointer.");
00045 
00046   return func_.get() < dynamic_cast<const PositionalCellPredicate*>(other)->func_.get();
00047 }
00048 
00049 void PositionalCellPredicate::testBatch(const Array<int>& cellLID,
00050                                         Array<int>& results) const
00051 {
00052   results.resize(cellLID.size());
00053 
00054   if (cellDim()==0)
00055     {
00056       for (int i=0; i<cellLID.size(); i++)
00057         {
00058           results[i] = (*func_)(mesh().nodePosition(cellLID[i]));
00059         }
00060     }
00061   else
00062     {
00063       Array<int> facetLIDs;
00064       Array<int> facetSigns;
00065       int nf = mesh().numFacets(cellDim(), cellLID[0], 0);
00066       mesh().getFacetLIDs(cellDim(), cellLID, 0, facetLIDs, facetSigns);
00067       for (int c=0; c<cellLID.size(); c++)
00068         {
00069           results[c] = true;
00070           for (int f=0; f<nf; f++)
00071             {
00072               int fLID = facetLIDs[c*nf + f];
00073               if ((*func_)(mesh().nodePosition(fLID)) == false)
00074                 {
00075                   results[c] = false;
00076                   continue;
00077                 }
00078             }
00079         }
00080     }
00081 }
00082 
00083 XMLObject PositionalCellPredicate::toXML() const 
00084 {
00085   XMLObject rtn("PositionalCellPredicate");
00086   return rtn;
00087 }
00088 
00089 bool PointCellPredicateFunctor::operator()(const Point& x) const
00090 {
00091   for (int i=0; i<x_.dim(); i++)
00092   {
00093     if (fabs(x[i]-x_[i]) > tol_) return false;
00094   }
00095   return true;
00096 }
00097 
00098 
00099 bool CoordinateValueCellPredicateFunctor::operator()(const Point& x) const
00100 {
00101   return (fabs(x[direction_]-value_) < tol_);
00102 }

Site Contact