ChasteNodesList.hpp

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 
00029 
00030 #ifndef CHASTENODESLIST_HPP_
00031 #define CHASTENODESLIST_HPP_
00032 
00033 #include "AbstractChasteRegion.hpp"
00034 #include "Node.hpp"
00035 #include "ChastePoint.hpp"
00036 
00037 #include <vector>
00038 using namespace std;
00042 template <unsigned SPACE_DIM>
00043 class ChasteNodesList : public AbstractChasteRegion<SPACE_DIM>
00044 {
00045 private:
00046 
00048     std::vector< Node<SPACE_DIM>*> mListOfNodes;
00049 
00050 public:
00051 
00057     ChasteNodesList(const std::vector<Node<SPACE_DIM>*> rNodesList) :
00058         mListOfNodes (rNodesList)
00059     {
00060     }
00061 
00062 
00069     bool DoesContain(const ChastePoint<SPACE_DIM>& rPointToCheck) const
00070     {
00071         bool returned_value = false;
00072         for (unsigned index = 0; index < mListOfNodes.size(); index++)
00073         {
00074             if (mListOfNodes[index]->GetPoint().IsSamePoint(rPointToCheck))
00075             {
00076                 returned_value = true;
00077                 break;
00078             }
00079         }
00080 
00081         return returned_value;
00082     }
00083 
00084 
00085 };
00086 
00087 #endif /*CHASTENODESLIST_HPP_*/

Generated by  doxygen 1.6.2