openEMS/FDTD/processing.cpp

107 lines
2.6 KiB
C++
Raw Normal View History

2010-03-11 15:47:40 +00:00
/*
* Copyright (C) 2010 Thorsten Liebig (Thorsten.Liebig@gmx.de)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "processing.h"
Processing::Processing(Operator* op, Engine* eng)
{
Op=op;
Eng=eng;
2010-03-04 15:54:16 +00:00
Enabled = true;
}
Processing::~Processing()
{
}
bool Processing::CheckTimestep()
{
if (Eng->GetNumberOfTimesteps()%ProcessInterval==0) return true;
return false;
}
int Processing::GetNextInterval()
{
if (Enabled==false) return -1;
return ProcessInterval - Eng->GetNumberOfTimesteps()%ProcessInterval;
}
void Processing::DefineStartStopCoord(double* dstart, double* dstop)
{
2010-03-03 07:00:25 +00:00
if (Op->SnapToMesh(dstart,start)==false) cerr << "Processing::DefineStartStopCoord: Warning: Snapping problem, check start value!!" << endl;
if (Op->SnapToMesh(dstop,stop)==false) cerr << "Processing::DefineStartStopCoord: Warning: Snapping problem, check stop value!!" << endl;
}
2010-03-11 09:48:00 +00:00
double Processing::CalcLineIntegral(unsigned int* start, unsigned int* stop, int field)
{
double result=0;
FDTD_FLOAT**** array;
if (field==0)
array=Eng->volt;
else if (field==1)
array=Eng->curr;
else return 0.0;
unsigned int pos[3]={start[0],start[1],start[2]};
// cerr << Eng->volt[1][pos[0]][pos[1]][pos[2]] << endl;
for (int n=0;n<3;++n)
{
if (start[n]<stop[n])
{
for (;pos[n]<stop[n];++pos[n])
{
result+=array[n][pos[0]][pos[1]][pos[2]];
// cerr << n << " " << pos[0] << " " << pos[1] << " " << pos[2] << " " << Eng->volt[n][pos[0]][pos[1]][pos[2]] << endl;
}
}
else
{
for (;pos[n]>stop[n];--pos[n])
result-=array[n][pos[0]][pos[1]][pos[2]];
}
}
return result;
}
void ProcessingArray::AddProcessing(Processing* proc)
{
ProcessArray.push_back(proc);
}
void ProcessingArray::DeleteAll()
{
for (size_t i=0;i<ProcessArray.size();++i)
{
delete ProcessArray.at(i);
}
ProcessArray.clear();
}
int ProcessingArray::Process()
{
int nextProcess=maxInterval;
//this could be done nicely in parallel??
for (size_t i=0;i<ProcessArray.size();++i)
{
int step = ProcessArray.at(i)->Process();
if ((step>0) && (step<nextProcess))
nextProcess=step;
}
return nextProcess;
}