EqdifSim::EqdifSim(Matrix NumIn, Matrix DenIn)
{
this->Num = NumIn;
this->Den = DenIn;
// this->SampleTime = 0.1;
tf2ssc();
c2d(0.1);
ss2tfd();
this->typeModel = "TFContinuous";
}
void wriFile(char* file, cor* data, int num, char* mode)
{
FILE* fid = fopen(file, mode);
double* d = new double[3];
for (int i = 0; i < num; i++)
{
c2d(d, data[i]);
fwrite(d, sizeof(double), 3, fid);
}
fclose(fid);
}
EqdifSim<UsedType>::EqdifSim(Matrix<UsedType> AIn, Matrix<UsedType> BIn, Matrix<UsedType> CIn, Matrix<UsedType> DIn)
{
this->A = AIn;
this->B = BIn;
this->C = CIn;
this->D = DIn;
// this->SampleTime = 0.1;
ss2tfc();
c2d(0.1);
ss2tfd();
this->typeModel = "SSContinuous";
}
EqdifSim<UsedType>::EqdifSim(Matrix<UsedType> NumIn, Matrix<UsedType> DenIn)
{
this->TransferFunction = new Polynom<UsedType>*[1];
for(int i = 0; i < 1; i++)
this->TransferFunction[i] = new Polynom<UsedType>[1];
this->TransferFunction[0][0] = Polynom<UsedType>(NumIn, DenIn);
tf2ssc();
c2d(0.1);
ss2tfd();
this->typeModel = "TFContinuous";
}
EqdifSim::EqdifSim(Matrix AIn, Matrix BIn, Matrix CIn, Matrix DIn)
{
this->A = AIn;
this->B = BIn;
this->C = CIn;
this->D = DIn;
// this->SampleTime = 0.1;
ss2tfc();
c2d(0.1);
ss2tfd();
this->typeModel = "SSContinuous";
}
void SEExpansionMultiOrigin::setupArrivalTimes() {
vector<vector<double> >tempArrivalTimes;
for (vector<StartPos*>::iterator it = this->startPositions.begin();
it != this->startPositions.end(); ++it) {
vector<double> newArrivalTime = *(new vector<double>());
this->arrivalTimes = newArrivalTime;
this->arrivalTimes.reserve(width * height);
vector<Coords> unvisited;
vector<bool> visited;
visited.reserve(width * height);
// unvisited.resize(width*height);
for (int i = 0; i<this->width; i++) {
for (int j = 0; j<this->height; j++) {
this->arrivalTimes.push_back(0);
visited.push_back(false);
unvisited.push_back(Coords(i, j));
}
}
//start with starting pos
this->sp = (*it);
unvisited[0] = Coords(sp->startX, sp->startY);
unvisited[c1d(sp->startX, sp->startY)] = Coords(0, 0);
this->arrivalTimes[c1d(sp->startX, sp->startY)] = sp->tStart;
int nVisited = width*height;
while (nVisited > 0) {
nVisited--;
if (Parameters::verbose > 999)
cout << "[dj]: nodes left" << nVisited << endl;
Coords curPos = (*unvisited.begin());
visited[c1d(curPos)] = true;
unvisited.erase(unvisited.begin());
if (Parameters::verbose > 999) {
cout << "-------------------------------" << endl;
cout << "[dj]: visiting " << curPos << "time:" << this->arrivalTimes[c1d(curPos)] << endl;
}
//if (arrivalTimes[curPos] == 0) {
// cerr << "could not reach all demes:" << curNode.c <<endl;
//}
int x = curPos.first;
int y = curPos.second;
dCheckPos(curPos, Coords(x + 1, y), 1., visited, unvisited);
dCheckPos(curPos, Coords(x - 1, y), 1., visited, unvisited);
dCheckPos(curPos, Coords(x, y + 1), 1., visited, unvisited);
dCheckPos(curPos, Coords(x, y - 1), 1., visited, unvisited);
dCheckPos(curPos, Coords(x - 1, y - 1), sqrt(2), visited, unvisited);
dCheckPos(curPos, Coords(x - 1, y + 1), sqrt(2), visited, unvisited);
dCheckPos(curPos, Coords(x + 1, y + 1), sqrt(2), visited, unvisited);
dCheckPos(curPos, Coords(x + 1, y - 1), sqrt(2), visited, unvisited);
if (Parameters::verbose > 999)
cout << "-------------------------------" << endl;
}
tempArrivalTimes.push_back(this->arrivalTimes);
}
this->arrivalTimes = vector<double>();
for (int i = 0; i < tempArrivalTimes[0].size(); ++i) { //outer loops is over all demes
double curMax = 0;
if (Parameters::verbose > 499) {
Coords c = c2d(i);
cout << c << ":";
}
for (int j = 0; j < tempArrivalTimes.size(); ++j) { //inner loop over all startPos
if (Parameters::verbose > 499) {
cout << tempArrivalTimes[j][i] << "\t";
}
if (tempArrivalTimes[j][i] > curMax) {
curMax = tempArrivalTimes[j][i];
}
}
if (Parameters::verbose > 499) {
cout << "selected: " << curMax << endl;
}
this->arrivalTimes.push_back(curMax);
}
//this->arrivalTimes[c1d(Coords(this->sp->startX, this->sp->startY))] = 1e10;
}
