You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
51 lines
1.2 KiB
C
51 lines
1.2 KiB
C
#include <stdio.h>
|
|
#include <stddef.h>
|
|
#include <string.h>
|
|
#include <stdarg.h>
|
|
#include <stdlib.h>
|
|
#include <math.h>
|
|
#include "geostat.h"
|
|
|
|
void clean_real2(struct realization_mod *realin,int n[3],struct grid_mod grid,int solver,double *vectorresult,struct realization_mod *realout)
|
|
{
|
|
int i,j,k,maille0,maille1;
|
|
double NTOT;
|
|
|
|
NTOT=n[0]*n[1]*n[2];
|
|
/*is the output realization already allocated?*/
|
|
/*if not, memory allocation*/
|
|
|
|
if ((*realout).vector == NULL || (*realout).n != (*realin).n)
|
|
{
|
|
(*realout).vector = (double *) malloc((*realin).n * sizeof(double));
|
|
if ((*realout).vector == NULL)
|
|
{
|
|
printf("Clean_real2.c: No memory available\n");
|
|
exit;
|
|
}
|
|
}
|
|
|
|
(*realout).n = (*realin).n;
|
|
(*realout).code = 1;
|
|
if (solver==1)
|
|
{
|
|
for ( k = 1; k <= NTOT;k++)
|
|
{
|
|
(*realout).vector[k-1] = vectorresult[k]/(double) NTOT;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for ( k = 1; k <= grid.NZ; k++) {
|
|
for (j = 1; j <= grid.NY; j++) {
|
|
for (i = 1; i <= grid.NX; i++) {
|
|
maille1 = i+(j-1+(k-1)*n[1])*n[0];
|
|
maille0 = i-1+(j-1+(k-1)*grid.NY)*grid.NX;
|
|
(*realout).vector[maille0] = vectorresult[maille1]/(double) NTOT;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return;
|
|
}
|