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