SundanceCellReordererImplemBase.hpp
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 #ifndef SUNDANCE_CELLREORDERERIMPLEMBASE_H
00043 #define SUNDANCE_CELLREORDERERIMPLEMBASE_H
00044 
00045 
00046 #include "SundanceDefs.hpp"
00047 #include "SundanceNoncopyable.hpp"
00048 #include "SundanceObjectWithVerbosity.hpp"
00049 #include <typeinfo>
00050 
00051 namespace Sundance
00052 {
00053 class MeshBase;
00054 
00055 /**
00056  * Abstract interface for the low-level objects that 
00057  * implement cell reordering. 
00058  * 
00059  * <h4> Adding a new reordering algorithm </h4>
00060  *
00061  * To add a new reordering algorithm, you should create a new
00062  * subclass of CellReordererImplemBase. The only method you will
00063  * need to implement is
00064  * \code
00065  * virtual int advance(int currentLID) const 
00066  * \endcode
00067  * which should provide the maximal cell LID found after
00068  * the <tt>currentLID.</tt>
00069  * Depending on the algorithm , you may also want to override
00070  * the methods
00071  * \code
00072  * virtual int begin() const 
00073  * virtual int end() const 
00074  * \endcode
00075  * which return the index of the first cell to be processed,
00076  * and a past-the-end index. 
00077  */
00078 class CellReordererImplemBase 
00079   : public ObjectWithClassVerbosity<CellReordererImplemBase>
00080 {
00081 public:
00082   /** Construct with a pointer to a mesh */
00083   CellReordererImplemBase(const MeshBase* mesh);
00084       
00085   /** virtual dtor */
00086   virtual ~CellReordererImplemBase(){;}
00087 
00088   /** return a descriptive std::string */
00089   virtual std::string typeName() const {return typeid(*this).name();}
00090     
00091   /** */
00092   virtual int advance(int currentLID) const = 0 ;
00093       
00094   /** */
00095   virtual int begin() const {return 0;}
00096       
00097   /** */
00098   virtual int end() const ;
00099 protected:
00100   /** */
00101   const MeshBase* mesh() const {return mesh_;}
00102 
00103 private:
00104   /** Unmanaged pointer to a mesh. The mesh will contain a smart
00105    * pointer to this reorderer, so to avoid closed reference
00106    * graphs we store a raw pointer here.*/
00107   const MeshBase* mesh_;
00108       
00109 };
00110 
00111 }
00112 
00113 
00114 
00115 #endif

Site Contact