This repository serve as a backup for my Maxwell-TD code
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

47 lines
1.7 KiB

/////////////////////////////////////////////////////////////////////////
/////// ///////
/////// This file is just a place to save the different tests ///////
/////// DO NOT COMPILE!!!!! ///////
/////// ///////
/////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
//// TEST TO CHECK IF THE TETRAS ARE CORRECTLY ORDERED ////
///////////////////////////////////////////////////////////
tetra* tet;
for(int i = 0; i < N_class; i++){
cout << endl << "Class " << i << endl;
int ex = 0;
for(int j = 0; j < ClassTetraCnt[i]; j ++){
if(tet->ExcitationFlag)
ex++;
tet = &(tetARRAY[ClassTetraIndex[i][j]]);
cout << j << " Tetra " << tet->getcnt() << ": Class " << tet->get_LTS_Flag() << " - Neighbors " << tet->get_NeighNum() << " - Excitation " << tet->ExcitationFlag << endl;
}
cout << "Ex: " << ex << endl;
}
///////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////
//// TEST TO CHECK IF THE MATRICES ARE CORRECTLY FILLED ////
////////////////////////////////////////////////////////////
int test = 1673;
int localPosition = mapIdLoc[test] * localMatrixSize;
int couplingPosition = NeighboursOffset_h[mapIdLoc[test]] * neighMatrixSize;
cout.precision(5);
for (int i = 0; i < TetPolyOrderDim[PolyFlag]; i++){
for (int j = 0; j < FacePolyOrderDim[PolyFlag]; j++){
cout << Neigh1E_h[couplingPosition + j * TetPolyOrderDim[PolyFlag] + i] << " ";
}
cout << endl;
}
///////////////////////////////////////////////////////////