00001 /* 00002 00003 Copyright (C) University of Oxford, 2005-2010 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 #ifndef ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_ 00029 #define ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_ 00030 00031 #include <map> 00032 #include <set> 00033 #include "AbstractBoundaryCondition.hpp" 00034 #include "Node.hpp" 00035 //#include "ConstBoundaryCondition.hpp" 00036 //#include "TetrahedralMesh.hpp" 00037 //#include "LinearSystem.hpp" 00038 //#include "PetscException.hpp" 00039 00044 template<unsigned SPACE_DIM> 00045 struct LessThanNode 00046 { 00053 bool operator()(const Node<SPACE_DIM> * const &n1, const Node<SPACE_DIM> * const &n2) 00054 { 00055 return (n1->GetIndex() < n2->GetIndex() ); 00056 } 00057 }; 00058 00062 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM> 00063 class AbstractBoundaryConditionsContainer 00064 { 00065 protected: 00067 typedef typename std::map< const Node<SPACE_DIM> *, const AbstractBoundaryCondition<SPACE_DIM>*, LessThanNode<SPACE_DIM> > 00068 DirichletMapType; 00069 DirichletMapType* mpDirichletMap[PROBLEM_DIM]; 00072 typedef typename std::map< const Node<SPACE_DIM> *, const AbstractBoundaryCondition<SPACE_DIM>*, LessThanNode<SPACE_DIM> >::const_iterator 00073 DirichletIteratorType; 00074 DirichletIteratorType mDirichIterator; 00077 bool mHasDirichletBCs; 00079 bool mCheckedAndCommunicatedIfDirichletBcs; 00080 00088 void DeleteDirichletBoundaryConditions(std::set<const AbstractBoundaryCondition<SPACE_DIM>*> alreadyDeletedConditions 00089 = std::set<const AbstractBoundaryCondition<SPACE_DIM>*>()); 00090 00091 public: 00095 AbstractBoundaryConditionsContainer(); 00096 00100 ~AbstractBoundaryConditionsContainer(); 00101 00108 bool HasDirichletBoundaryConditions(); 00109 00120 double GetDirichletBCValue(const Node<SPACE_DIM>* pBoundaryNode, unsigned indexOfUnknown = 0); 00121 00128 bool HasDirichletBoundaryCondition(const Node<SPACE_DIM>* pNode, unsigned indexOfUnknown = 0); 00129 00135 void ResetDirichletCommunication() 00136 { 00137 mCheckedAndCommunicatedIfDirichletBcs = false; 00138 } 00139 }; 00140 00141 #endif /*ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_*/