NodeMap.cpp

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 #include "NodeMap.hpp"
00031 #include "Exception.hpp"
00032 
00033 
00035 // Implementation
00037 
00038 
00039 NodeMap::NodeMap(unsigned size)
00040 {
00041     // this used to be reserve, but this acts oddly:
00042     // eg: mMap.reserve(2); mMap[0]=1;
00043     // runs and mMap[0] returns 1, but mMap.size() returns 0
00044     mMap.resize(size);
00045 }
00046 
00047 void NodeMap::Resize(unsigned size)
00048 {
00049     mMap.resize(size);
00050 }
00051 
00052 void NodeMap::ResetToIdentity()
00053 {
00054     for (unsigned oldIndex=0; oldIndex<mMap.size(); oldIndex++)
00055     {
00056         mMap[oldIndex] = oldIndex;
00057     }
00058 }
00059 
00060 void NodeMap::SetNewIndex(unsigned oldIndex, unsigned newIndex)
00061 {
00062     mMap[oldIndex] = newIndex;
00063 }
00064 
00065 void NodeMap::SetDeleted(unsigned index)
00066 {
00067     mMap[index] = UINT_MAX;
00068 }
00069 
00070 bool NodeMap::IsDeleted(unsigned index)
00071 {
00072     return (mMap[index] == UINT_MAX);
00073 }
00074 
00075 unsigned NodeMap::GetNewIndex(unsigned oldIndex) const
00076 {
00077     if (mMap[oldIndex] == UINT_MAX)
00078     {
00079         EXCEPTION("Node has been deleted");
00080     }
00081     return (unsigned) mMap[oldIndex];
00082 }
00083 
00084 bool NodeMap::IsIdentityMap()
00085 {
00086     for (unsigned i=0; i<mMap.size(); i++)
00087     {
00088         if (mMap[i] != i)
00089         {
00090             return false;
00091         }
00092     }
00093     return true;
00094 }
00095 
00096 unsigned NodeMap::Size()
00097 {
00098     return mMap.size();
00099 }

Generated by  doxygen 1.6.2