Chaste Release::3.1
|
00001 /* 00002 00003 Copyright (c) 2005-2012, University of Oxford. 00004 All rights reserved. 00005 00006 University of Oxford means the Chancellor, Masters and Scholars of the 00007 University of Oxford, having an administrative office at Wellington 00008 Square, Oxford OX1 2JD, UK. 00009 00010 This file is part of Chaste. 00011 00012 Redistribution and use in source and binary forms, with or without 00013 modification, are permitted provided that the following conditions are met: 00014 * Redistributions of source code must retain the above copyright notice, 00015 this list of conditions and the following disclaimer. 00016 * Redistributions in binary form must reproduce the above copyright notice, 00017 this list of conditions and the following disclaimer in the documentation 00018 and/or other materials provided with the distribution. 00019 * Neither the name of the University of Oxford nor the names of its 00020 contributors may be used to endorse or promote products derived from this 00021 software without specific prior written permission. 00022 00023 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00024 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00025 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00026 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE 00027 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00028 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE 00029 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00030 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00031 LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 00032 OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00033 00034 */ 00035 00036 #ifndef ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_ 00037 #define ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_ 00038 00039 #include <map> 00040 #include <set> 00041 #include "AbstractBoundaryCondition.hpp" 00042 #include "Node.hpp" 00043 //#include "ConstBoundaryCondition.hpp" 00044 //#include "TetrahedralMesh.hpp" 00045 //#include "LinearSystem.hpp" 00046 //#include "PetscException.hpp" 00047 00052 template<unsigned SPACE_DIM> 00053 struct LessThanNode 00054 { 00061 bool operator()(const Node<SPACE_DIM> * const &n1, const Node<SPACE_DIM> * const &n2) 00062 { 00063 return (n1->GetIndex() < n2->GetIndex() ); 00064 } 00065 }; 00066 00070 template<unsigned ELEMENT_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM> 00071 class AbstractBoundaryConditionsContainer 00072 { 00073 protected: 00074 00076 typedef typename std::map< const Node<SPACE_DIM> *, const AbstractBoundaryCondition<SPACE_DIM>*, LessThanNode<SPACE_DIM> > 00077 DirichletMapType; 00078 DirichletMapType* mpDirichletMap[PROBLEM_DIM]; 00081 typedef typename std::map< const Node<SPACE_DIM> *, const AbstractBoundaryCondition<SPACE_DIM>*, LessThanNode<SPACE_DIM> >::const_iterator 00082 DirichletIteratorType; 00083 DirichletIteratorType mDirichIterator; 00086 bool mHasDirichletBCs; 00087 00089 bool mCheckedAndCommunicatedIfDirichletBcs; 00090 00092 bool mDeleteConditions; 00093 00102 void DeleteDirichletBoundaryConditions(std::set<const AbstractBoundaryCondition<SPACE_DIM>*> alreadyDeletedConditions 00103 = std::set<const AbstractBoundaryCondition<SPACE_DIM>*>()); 00104 00105 public: 00106 00112 AbstractBoundaryConditionsContainer(bool deleteConditions=true); 00113 00117 ~AbstractBoundaryConditionsContainer(); 00118 00125 bool HasDirichletBoundaryConditions(); 00126 00137 double GetDirichletBCValue(const Node<SPACE_DIM>* pBoundaryNode, unsigned indexOfUnknown = 0); 00138 00145 bool HasDirichletBoundaryCondition(const Node<SPACE_DIM>* pNode, unsigned indexOfUnknown = 0); 00146 00152 void ResetDirichletCommunication() 00153 { 00154 mCheckedAndCommunicatedIfDirichletBcs = false; 00155 } 00156 }; 00157 00158 #endif /*ABSTRACTBOUNDARYCONDITIONSCONTAINER_HPP_*/