00001 /* 00002 00003 Copyright (C) University of Oxford, 2005-2011 00004 00005 University of Oxford means the Chancellor, Masters and Scholars of the 00006 University of Oxford, having an administrative office at Wellington 00007 Square, Oxford OX1 2JD, UK. 00008 00009 This file is part of Chaste. 00010 00011 Chaste is free software: you can redistribute it and/or modify it 00012 under the terms of the GNU Lesser General Public License as published 00013 by the Free Software Foundation, either version 2.1 of the License, or 00014 (at your option) any later version. 00015 00016 Chaste is distributed in the hope that it will be useful, but WITHOUT 00017 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 00018 FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public 00019 License for more details. The offer of Chaste under the terms of the 00020 License is subject to the License being interpreted in accordance with 00021 English Law and subject to any action against the University of Oxford 00022 being under the jurisdiction of the English Courts. 00023 00024 You should have received a copy of the GNU Lesser General Public License 00025 along with Chaste. If not, see <http://www.gnu.org/licenses/>. 00026 00027 */ 00028 00029 #ifndef ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_ 00030 #define ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_ 00031 00032 #include <map> 00033 #include <set> 00034 #include "AbstractBoundaryCondition.hpp" 00035 #include "Node.hpp" 00036 //#include "ConstBoundaryCondition.hpp" 00037 //#include "TetrahedralMesh.hpp" 00038 //#include "LinearSystem.hpp" 00039 //#include "PetscException.hpp" 00040 00045 template<unsigned SPACE_DIM> 00046 struct LessThanNode 00047 { 00054 bool operator()(const Node<SPACE_DIM> * const &n1, const Node<SPACE_DIM> * const &n2) 00055 { 00056 return (n1->GetIndex() < n2->GetIndex() ); 00057 } 00058 }; 00059 00063 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM> 00064 class AbstractBoundaryConditionsContainer 00065 { 00066 protected: 00067 00069 typedef typename std::map< const Node<SPACE_DIM> *, const AbstractBoundaryCondition<SPACE_DIM>*, LessThanNode<SPACE_DIM> > 00070 DirichletMapType; 00071 DirichletMapType* mpDirichletMap[PROBLEM_DIM]; 00074 typedef typename std::map< const Node<SPACE_DIM> *, const AbstractBoundaryCondition<SPACE_DIM>*, LessThanNode<SPACE_DIM> >::const_iterator 00075 DirichletIteratorType; 00076 DirichletIteratorType mDirichIterator; 00079 bool mHasDirichletBCs; 00080 00082 bool mCheckedAndCommunicatedIfDirichletBcs; 00083 00085 bool mDeleteConditions; 00086 00095 void DeleteDirichletBoundaryConditions(std::set<const AbstractBoundaryCondition<SPACE_DIM>*> alreadyDeletedConditions 00096 = std::set<const AbstractBoundaryCondition<SPACE_DIM>*>()); 00097 00098 public: 00099 00105 AbstractBoundaryConditionsContainer(bool deleteConditions=true); 00106 00110 ~AbstractBoundaryConditionsContainer(); 00111 00118 bool HasDirichletBoundaryConditions(); 00119 00130 double GetDirichletBCValue(const Node<SPACE_DIM>* pBoundaryNode, unsigned indexOfUnknown = 0); 00131 00138 bool HasDirichletBoundaryCondition(const Node<SPACE_DIM>* pNode, unsigned indexOfUnknown = 0); 00139 00145 void ResetDirichletCommunication() 00146 { 00147 mCheckedAndCommunicatedIfDirichletBcs = false; 00148 } 00149 }; 00150 00151 #endif /*ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_*/