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 <algorithm> 00037 00038 #include "CellPropertyRegistry.hpp" 00039 #include "Exception.hpp" 00040 00041 CellPropertyRegistry* CellPropertyRegistry::mpInstance = NULL; 00042 00043 CellPropertyRegistry* CellPropertyRegistry::Instance() 00044 { 00045 if (mpInstance == NULL) 00046 { 00047 mpInstance = new CellPropertyRegistry; 00048 } 00049 return mpInstance; 00050 } 00051 00052 const std::vector<boost::shared_ptr<AbstractCellProperty> >& CellPropertyRegistry::rGetAllCellProperties() 00053 { 00054 return mCellProperties; 00055 } 00056 00057 void CellPropertyRegistry::Clear() 00058 { 00059 mCellProperties.clear(); 00060 mOrderingHasBeenSpecified = false; 00061 } 00062 00063 CellPropertyRegistry::CellPropertyRegistry() 00064 : mOrderingHasBeenSpecified(false) 00065 { 00066 } 00067 00068 CellPropertyRegistry* CellPropertyRegistry::TakeOwnership() 00069 { 00070 mpInstance = NULL; 00071 return this; 00072 } 00073 00074 void CellPropertyRegistry::SpecifyOrdering(const std::vector<boost::shared_ptr<AbstractCellProperty> >& rOrdering) 00075 { 00076 if (mOrderingHasBeenSpecified) 00077 { 00078 EXCEPTION("An ordering has already been specified."); 00079 } 00080 00081 std::vector<boost::shared_ptr<AbstractCellProperty> > temp_vector = rOrdering; 00082 for (unsigned i=0; i<mCellProperties.size(); i++) 00083 { 00084 std::vector<boost::shared_ptr<AbstractCellProperty> >::const_iterator it 00085 = find(rOrdering.begin(), rOrdering.end(), mCellProperties[i]); 00086 if (it == rOrdering.end()) 00087 { 00088 temp_vector.push_back(mCellProperties[i]); 00089 } 00090 } 00091 mCellProperties = temp_vector; 00092 00093 mOrderingHasBeenSpecified = true; 00094 } 00095 00096 bool CellPropertyRegistry::HasOrderingBeenSpecified() 00097 { 00098 return mOrderingHasBeenSpecified; 00099 }