AbstractOnLatticeCellPopulation.cpp

00001 /*
00002 
00003 Copyright (c) 2005-2015, 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 "AbstractOnLatticeCellPopulation.hpp"
00037 
00038 template<unsigned DIM>
00039 AbstractOnLatticeCellPopulation<DIM>::AbstractOnLatticeCellPopulation(AbstractMesh<DIM, DIM>& rMesh,
00040                                                                     std::vector<CellPtr>& rCells,
00041                                                                   const std::vector<unsigned> locationIndices,
00042                                                                   bool deleteMesh)
00043     : AbstractCellPopulation<DIM>(rMesh, rCells, locationIndices),
00044       mDeleteMesh(deleteMesh),
00045       mUpdateNodesInRandomOrder(true),
00046       mIterateRandomlyOverUpdateRuleCollection(false)
00047 {
00048     std::list<CellPtr>::iterator it = this->mCells.begin();
00049     for (unsigned i=0; it != this->mCells.end(); ++it, ++i)
00050     {
00051         unsigned index = locationIndices.empty() ? i : locationIndices[i]; // assume that the ordering matches
00052         AbstractCellPopulation<DIM>::AddCellUsingLocationIndex(index, *it);
00053     }
00054 }
00055 
00056 template<unsigned DIM>
00057 AbstractOnLatticeCellPopulation<DIM>::AbstractOnLatticeCellPopulation(AbstractMesh<DIM, DIM>& rMesh)
00058     : AbstractCellPopulation<DIM>(rMesh),
00059       mDeleteMesh(true),
00060       mUpdateNodesInRandomOrder(true),
00061       mIterateRandomlyOverUpdateRuleCollection(false)
00062 {
00063 }
00064 
00065 template<unsigned DIM>
00066 AbstractOnLatticeCellPopulation<DIM>::~AbstractOnLatticeCellPopulation()
00067 {
00068 }
00069 
00070 template<unsigned DIM>
00071 bool AbstractOnLatticeCellPopulation<DIM>::GetUpdateNodesInRandomOrder()
00072 {
00073     return mUpdateNodesInRandomOrder;
00074 }
00075 
00076 template<unsigned DIM>
00077 void AbstractOnLatticeCellPopulation<DIM>::SetUpdateNodesInRandomOrder(bool updateNodesInRandomOrder)
00078 {
00079     mUpdateNodesInRandomOrder = updateNodesInRandomOrder;
00080 }
00081 
00082 template<unsigned DIM>
00083 void AbstractOnLatticeCellPopulation<DIM>::SetIterateRandomlyOverUpdateRuleCollection(bool iterateRandomly)
00084 {
00085     mIterateRandomlyOverUpdateRuleCollection = iterateRandomly;
00086 }
00087 
00088 template<unsigned DIM>
00089 bool AbstractOnLatticeCellPopulation<DIM>::GetIterateRandomlyOverUpdateRuleCollection()
00090 {
00091     return mIterateRandomlyOverUpdateRuleCollection;
00092 }
00093 
00094 template<unsigned DIM>
00095 void AbstractOnLatticeCellPopulation<DIM>::SetNode(unsigned nodeIndex, ChastePoint<DIM>& rNewLocation)
00096 {
00097     EXCEPTION("SetNode() cannot be called on a subclass of AbstractOnLatticeCellPopulation.");
00098 }
00099 
00100 template<unsigned DIM>
00101 std::set<unsigned> AbstractOnLatticeCellPopulation<DIM>::GetNeighbouringNodeIndices(unsigned index)
00102 {
00103     EXCEPTION("Cannot call GetNeighbouringNodeIndices() on a subclass of AbstractOnLatticeCellPopulation, need to go through the PottsMesh instead");
00104     std::set<unsigned> neighbouring_node_indices;
00105     return neighbouring_node_indices;
00106 }
00107 
00108 template<unsigned DIM>
00109 void AbstractOnLatticeCellPopulation<DIM>::OutputCellPopulationParameters(out_stream& rParamsFile)
00110 {
00111     *rParamsFile << "\t\t<UpdateNodesInRandomOrder>" << mUpdateNodesInRandomOrder << "</UpdateNodesInRandomOrder>\n";
00112     *rParamsFile << "\t\t<IterateRandomlyOverUpdateRuleCollection>" << mIterateRandomlyOverUpdateRuleCollection << "</IterateRandomlyOverUpdateRuleCollection>\n";
00113 
00114     // Call method on direct parent class
00115     AbstractCellPopulation<DIM>::OutputCellPopulationParameters(rParamsFile);
00116 }
00117 
00119 // Explicit instantiation
00121 
00122 template class AbstractOnLatticeCellPopulation<1>;
00123 template class AbstractOnLatticeCellPopulation<2>;
00124 template class AbstractOnLatticeCellPopulation<3>;

Generated by  doxygen 1.6.2