FEI Version of the Day
fei_Dof.hpp
00001 /*
00002 // @HEADER
00003 // ************************************************************************
00004 //             FEI: Finite Element Interface to Linear Solvers
00005 //                  Copyright (2005) Sandia Corporation.
00006 //
00007 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, the
00008 // 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 Alan Williams (william@sandia.gov) 
00038 //
00039 // ************************************************************************
00040 // @HEADER
00041 */
00042 
00043 #ifndef _fei_Dof_hpp_
00044 #define _fei_Dof_hpp_
00045 
00046 #include <fei_macros.hpp>
00047 
00048 namespace fei {
00049 
00073 template<class LocalOrdinal, class GlobalOrdinal>
00074 class Dof {
00075  public:
00077   Dof(LocalOrdinal rank, GlobalOrdinal id, LocalOrdinal field)
00078    : m_rank(rank), m_id(id), m_field(field) {}
00079 
00081   ~Dof(){}
00082 
00083   LocalOrdinal rank() const { return m_rank; }
00084   GlobalOrdinal id() const { return m_id; }
00085   LocalOrdinal field() const { return m_field; }
00086 
00087  private:
00088   LocalOrdinal m_rank;
00089   GlobalOrdinal m_id;
00090   LocalOrdinal m_field;
00091 };//class Dof
00092 
00095 template<class LocalOrdinal, class GlobalOrdinal>
00096 struct less_rank_id_field {
00097   bool operator()(const Dof<LocalOrdinal,GlobalOrdinal>& dof1,
00098                  const Dof<LocalOrdinal,GlobalOrdinal>& dof2) const
00099   {
00100     if (dof1.rank()==dof2.rank()) {
00101       if (dof1.id() == dof2.id()) return dof1.field() < dof2.field();
00102       else return dof1.id() < dof2.id();
00103     }
00104     else {
00105       return dof1.rank() < dof2.rank();
00106     }
00107   }
00108 
00109   bool operator()(const Dof<LocalOrdinal,GlobalOrdinal>* dof1,
00110                  const Dof<LocalOrdinal,GlobalOrdinal>* dof2) const
00111   {
00112     if (dof1->rank()==dof2->rank()) {
00113       if (dof1->id() == dof2->id()) return dof1->field() < dof2->field();
00114       else return dof1->id() < dof2->id();
00115     }
00116     else {
00117       return dof1->rank() < dof2->rank();
00118     }
00119   }
00120 };
00121 
00124 template<class LocalOrdinal, class GlobalOrdinal>
00125 struct less_field_rank_id {
00126   bool operator()(const Dof<LocalOrdinal,GlobalOrdinal>& dof1,
00127                  const Dof<LocalOrdinal,GlobalOrdinal>& dof2) const
00128   {
00129     if (dof1.field()==dof2.field()) {
00130       if (dof1.rank() == dof2.rank()) return dof1.id() < dof2.id();
00131       else return dof1.rank() < dof2.rank();
00132     }
00133     else {
00134       return dof1.field() < dof2.field();
00135     }
00136   }
00137 
00138   bool operator()(const Dof<LocalOrdinal,GlobalOrdinal>* dof1,
00139                  const Dof<LocalOrdinal,GlobalOrdinal>* dof2) const
00140   {
00141     if (dof1->field()==dof2->field()) {
00142       if (dof1->rank() == dof2->rank()) return dof1->id() < dof2->id();
00143       else return dof1->rank() < dof2->rank();
00144     }
00145     else {
00146       return dof1->field() < dof2->field();
00147     }
00148   }
00149 };
00150 
00151 }//namespace fei
00152 #endif
00153 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Friends