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 #include "AbstractCryptStatistics.hpp" 00036 #include "CellPropertyRegistry.hpp" 00037 00038 AbstractCryptStatistics::AbstractCryptStatistics(MeshBasedCellPopulation<2>& rCrypt) 00039 : mrCrypt(rCrypt) 00040 { 00041 } 00042 00043 AbstractCryptStatistics::~AbstractCryptStatistics() 00044 { 00045 } 00046 00047 void AbstractCryptStatistics::LabelSPhaseCells() 00048 { 00049 for (AbstractCellPopulation<2>::Iterator cell_iter = mrCrypt.Begin(); 00050 cell_iter != mrCrypt.End(); 00051 ++cell_iter) 00052 { 00053 if (cell_iter->GetCellCycleModel()->GetCurrentCellCyclePhase()== S_PHASE) 00054 { 00055 // This should only be done for wild type cells (at the moment anyway) 00056 assert(cell_iter->GetMutationState()->IsType<WildTypeCellMutationState>()); 00057 00058 // Label this cell 00059 if (!cell_iter->HasCellProperty<CellLabel>()) 00060 { 00061 /* 00062 * This method is usually called after mrCrypt has called CellPropertyRegistry::TakeOwnership(). 00063 * This means that were we to call CellPropertyRegistry::Instance() here when adding the CellLabel, 00064 * we would be creating a new CellPropertyRegistry. In this case the CellLabel's cell count would 00065 * be incorrect. We therefore access the CellLabel via mrCrypt.GetCellPropertyRegistry(). 00066 */ 00067 cell_iter->AddCellProperty(mrCrypt.GetCellPropertyRegistry()->Get<CellLabel>()); 00068 } 00069 } 00070 } 00071 } 00072 00073 void AbstractCryptStatistics::LabelAllCellsAsHealthy() 00074 { 00075 for (AbstractCellPopulation<2>::Iterator cell_iter = mrCrypt.Begin(); 00076 cell_iter != mrCrypt.End(); 00077 ++cell_iter) 00078 { 00079 cell_iter->SetMutationState(mrCrypt.GetCellPropertyRegistry()->Get<WildTypeCellMutationState>()); 00080 cell_iter->RemoveCellProperty<CellLabel>(); 00081 } 00082 } 00083 00084 std::vector<bool> AbstractCryptStatistics::AreCryptSectionCellsLabelled(std::vector<CellPtr>& rCryptSection) 00085 { 00086 std::vector<bool> crypt_section_labelled(rCryptSection.size()); 00087 00088 for (unsigned vector_index=0; vector_index<rCryptSection.size(); vector_index++) 00089 { 00090 if (rCryptSection[vector_index]->HasCellProperty<CellLabel>()) 00091 { 00092 crypt_section_labelled[vector_index] = true; 00093 } 00094 else 00095 { 00096 crypt_section_labelled[vector_index] = false; 00097 } 00098 } 00099 00100 return crypt_section_labelled; 00101 }