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 "S1S2Stimulus.hpp" 00037 #include "Exception.hpp" 00038 00039 S1S2Stimulus::S1S2Stimulus(double magnitude, double stimulusDuration, double s1Duration, double s1Period, double startTime, std::vector<double> s2Periods) 00040 : MultiStimulus() 00041 { 00042 mNumS2FrequencyValues = s2Periods.size(); 00043 for (unsigned i=0; i<mNumS2FrequencyValues; i++) 00044 { 00045 boost::shared_ptr<MultiStimulus> p_experiment_stimulus(new MultiStimulus()); 00046 00047 // The 0.5*(s1Period-stimulusDuration) taken off the stop time is to avoid getting a double stimulus at the instant s1Duration+startTime (#2442). 00048 boost::shared_ptr<RegularStimulus> p_s1(new RegularStimulus(magnitude, stimulusDuration, s1Period, startTime, s1Duration+startTime-0.5*(s1Period-stimulusDuration))); 00049 boost::shared_ptr<RegularStimulus> p_s2(new RegularStimulus(magnitude, stimulusDuration, s2Periods[i], s1Duration+startTime, s1Duration + 2*s2Periods[i]+startTime)); 00050 00051 p_experiment_stimulus->AddStimulus(p_s1); 00052 p_experiment_stimulus->AddStimulus(p_s2); 00053 00054 // We hijack the mStimulus of the MultiStimulus class to 00055 // record different stimuli for each S2 frequency. 00056 this->AddStimulus(p_experiment_stimulus); 00057 } 00058 mS2Index=0u; 00059 } 00060 00061 double S1S2Stimulus::GetStimulus(double time) 00062 { 00063 return this->mStimuli[mS2Index]->GetStimulus(time); 00064 } 00065 00066 void S1S2Stimulus::SetS2ExperimentPeriodIndex(unsigned index) 00067 { 00068 if (index < mNumS2FrequencyValues) 00069 { 00070 mS2Index = index; 00071 } 00072 else 00073 { 00074 EXCEPTION("There are fewer S2 frequency values than the one you have requested."); 00075 } 00076 } 00077 00078 unsigned S1S2Stimulus::GetNumS2FrequencyValues() 00079 { 00080 return mNumS2FrequencyValues; 00081 } 00082 00083 00084 #include "SerializationExportWrapperForCpp.hpp" 00085 CHASTE_CLASS_EXPORT(S1S2Stimulus) 00086 00087