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 #include "DistributedVector.hpp" 00037 #include "DistributedVectorFactory.hpp" 00038 00039 bool DistributedVector::IsGlobalIndexLocal(unsigned globalIndex) 00040 { 00041 return (mLo<=globalIndex && globalIndex<mHi); 00042 } 00043 00044 DistributedVector::DistributedVector(Vec vec, DistributedVectorFactory* pFactory) 00045 : mVec(vec), 00046 mpFactory(pFactory) 00047 { 00048 assert(pFactory != NULL); 00049 00050 // Set local copies of problem size, etc. 00051 mProblemSize = pFactory->GetProblemSize(); 00052 mLo = pFactory->GetLow(); 00053 mHi = pFactory->GetHigh(); 00054 00055 // Set mSizeMultiplier by reading the vec size. 00056 VecGetArray(vec, &mpVec); 00057 PetscInt size; 00058 VecGetSize(vec, &size); 00059 mSizeMultiplier = (unsigned) size / mProblemSize; 00060 assert ((mSizeMultiplier * mProblemSize) == (unsigned)size); 00061 } 00062 00063 double& DistributedVector::operator[](unsigned globalIndex) throw (DistributedVectorException) 00064 { 00065 assert(mSizeMultiplier == 1); 00066 if (mLo<=globalIndex && globalIndex<mHi) 00067 { 00068 return mpVec[globalIndex - mLo]; 00069 } 00070 throw DistributedVectorException(); 00071 } 00072 00073 double& DistributedVector::operator[](Iterator index) throw (DistributedVectorException) 00074 { 00075 assert(mSizeMultiplier==1); 00076 return mpVec[index.Local]; 00077 } 00078 00079 void DistributedVector::Restore() 00080 { 00081 VecRestoreArray(mVec, &mpVec); 00082 00083 #if (PETSC_VERSION_MAJOR == 3 && PETSC_VERSION_MINOR >= 2) //PETSc 3.2 or later 00084 00087 VecGetArray(mVec, &mpVec); 00088 #endif 00089 00090 } 00091 00092 // Iterator class 00093 00094 bool DistributedVector::Iterator::operator!=(const Iterator& rOther) 00095 { 00096 return(Global != rOther.Global); 00097 } 00098 00099 DistributedVector::Iterator& DistributedVector::Iterator::operator++() 00100 { 00101 Local++; 00102 Global++; 00103 return(*this); 00104 } 00105 00106 // Iterator creation 00107 00108 DistributedVector::Iterator DistributedVector::Begin() 00109 { 00110 Iterator index; 00111 index.Local = 0; 00112 index.Global = mLo; 00113 return index; 00114 } 00115 00116 DistributedVector::Iterator DistributedVector::End() 00117 { 00118 Iterator index; 00119 index.Local = mHi-mLo; 00120 index.Global = mHi; 00121 return index; 00122 }