AbstractBoundaryConditionsContainerImplementation.hpp

00001 /*
00002 
00003 Copyright (C) University of Oxford, 2005-2009
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 
00030 #ifndef ABSTRACTBOUNDARYCONDITIONSCONTAINERIMPLEMENTATION_HPP_
00031 #define ABSTRACTBOUNDARYCONDITIONSCONTAINERIMPLEMENTATION_HPP_
00032 
00033 #include "AbstractBoundaryConditionsContainer.hpp"
00034 
00035 template<unsigned ELEM_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00036 AbstractBoundaryConditionsContainer<ELEM_DIM,SPACE_DIM,PROBLEM_DIM>::AbstractBoundaryConditionsContainer()
00037 {
00038     for (unsigned index_of_unknown=0; index_of_unknown<PROBLEM_DIM; index_of_unknown++)
00039     {
00040         mpDirichletMap[index_of_unknown] =  new std::map< const Node<SPACE_DIM> *, const AbstractBoundaryCondition<SPACE_DIM>*, LessThanNode<SPACE_DIM> >;
00041     }
00042 }
00043 
00044 template<unsigned ELEM_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00045 AbstractBoundaryConditionsContainer<ELEM_DIM,SPACE_DIM,PROBLEM_DIM>::~AbstractBoundaryConditionsContainer()
00046 {
00047     DeleteDirichletBoundaryConditions();
00048 }
00049 
00050 template<unsigned ELEM_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00051 bool AbstractBoundaryConditionsContainer<ELEM_DIM,SPACE_DIM,PROBLEM_DIM>::HasDirichletBoundaryConditions()
00052 {
00053     for (unsigned i=0; i<PROBLEM_DIM; i++)
00054     {
00055         if (!mpDirichletMap[i]->empty())
00056         {
00057             return true;
00058         }
00059     }
00060     return false;
00061 }
00062 
00063 template<unsigned ELEM_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00064 void AbstractBoundaryConditionsContainer<ELEM_DIM,SPACE_DIM,PROBLEM_DIM>::DeleteDirichletBoundaryConditions(std::set<const AbstractBoundaryCondition<SPACE_DIM>*> deletedConditions)
00065 {
00066     for (unsigned i=0; i<PROBLEM_DIM; i++)
00067     {
00068         if (mpDirichletMap[i])
00069         {
00070             mDirichIterator = mpDirichletMap[i]->begin();
00071             while (mDirichIterator != mpDirichletMap[i]->end() )
00072             {
00073                 if (deletedConditions.count(mDirichIterator->second) == 0)
00074                 {
00075                     deletedConditions.insert(mDirichIterator->second);
00076                     delete mDirichIterator->second;
00077                 }
00078                 mDirichIterator++;
00079             }
00080 
00081             delete(mpDirichletMap[i]);
00082             mpDirichletMap[i] = NULL;
00083         }
00084     }
00085 }
00086 
00087 template<unsigned ELEM_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00088 double AbstractBoundaryConditionsContainer<ELEM_DIM,SPACE_DIM,PROBLEM_DIM>::GetDirichletBCValue(const Node<SPACE_DIM>* pBoundaryNode, unsigned indexOfUnknown)
00089 {
00090     assert(indexOfUnknown < PROBLEM_DIM);
00091     //assert(pBoundaryNode->IsBoundaryNode());
00092 
00093     mDirichIterator = mpDirichletMap[indexOfUnknown]->find(pBoundaryNode);
00094     assert(mDirichIterator != mpDirichletMap[indexOfUnknown]->end());
00095 
00096     return mDirichIterator->second->GetValue(pBoundaryNode->GetPoint());
00097 }
00098 
00099 template<unsigned ELEM_DIM, unsigned SPACE_DIM, unsigned PROBLEM_DIM>
00100 bool AbstractBoundaryConditionsContainer<ELEM_DIM,SPACE_DIM,PROBLEM_DIM>::HasDirichletBoundaryCondition(const Node<SPACE_DIM>* pNode, unsigned indexOfUnknown)
00101 {
00102     assert(indexOfUnknown < PROBLEM_DIM);
00103 
00104     this->mDirichIterator = this->mpDirichletMap[indexOfUnknown]->find(pNode);
00105 
00106     return (this->mDirichIterator != this->mpDirichletMap[indexOfUnknown]->end());
00107 }
00108 
00109 #endif /*ABSTRACTBOUNDARYCONDITIONSCONTAINERIMPLEMENTATION_HPP_*/

Generated on Tue Aug 4 16:10:24 2009 for Chaste by  doxygen 1.5.5