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