1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
#include "AMRreaderPlus.h"
#include <stdio.h>
#include <stdlib.h>
#include <iostream.h>
#include <algorithm>
AMRreaderPlus::AMRreaderPlus(IObase &f) : AMRgridreaderPlus(f), grids(),
activeset(), timemask(), levelmask(), realtimes()
{
init();
selectTimeStep(0);
for (int ii=0;ii<=maxlevel;ii++) showLevel(ii);
modflag=1;
}
AMRreaderPlus::~AMRreaderPlus(){
}
void AMRreaderPlus::init(){
maxlevel=maxtimeres=maxtime=0;
smin=smax=0.0;
numgrids=0;
build_info();
}
void AMRreaderPlus::build_info(){
AMRgridPlus *res, newg;
res=getGridInfo(newg, 0);
if (res==NULL) return;
maxlevel=0;
maxtime=0;
numgrids=0;
smin=newg.scalarmin;
smax=newg.scalarmax;
datatype=newg.datatype;
while (res!=NULL){ //Load all grid info
grids.append(newg);
realtimes.insert(newg.time);
maxlevel=(maxlevel>newg.level)?maxlevel:newg.level;
maxtime=(maxtime>newg.timestep)?maxtime:newg.timestep;
smax=smax>newg.scalarmax?smax:newg.scalarmax;
smin=smin<newg.scalarmin?smin:newg.scalarmin;
numgrids++;
res=getGridInfo(newg, numgrids);
}
levelmask.fill(0, maxlevel+1);
timemask.fill(0, maxtime+1);
leveltimes= new flexmatrix<IdxArray> (maxlevel+1, maxtime+1);
AMRgridPlus *g= grids.getData(0);
for(int ii=0;ii<grids.getSize();ii++){//Extract basic info
for (int jj=g->timestep;jj<g->timestep+g->persistence;jj++){
if (jj<=maxtime){
idxrec trec(ii);
(*leveltimes)(g->level, jj).append(trec.idx);
}
}
g++;
}
cout<<realtimes.getSize()<<" "<<numgrids<<endl<<endl;
}
void AMRreaderPlus::build_active(){
IdxSet newset, delset;
//Calculate what the set should be
for (int ii=0;ii<=maxtime;ii++)
for (int jj=0;jj<=maxlevel;jj++)
if (timemask[ii]&&levelmask[jj]){
for (int kk=0;kk<(*leveltimes)(jj, ii).getSize();kk++){
newset.insert((*leveltimes)(jj, ii)[kk]);
}
}
//remove all the unneeded grids
setdifference(activeset, newset, delset);
for (ii=0;ii<delset.getSize();ii++)
if (grids[delset[ii].idx].data!=NULL){
free(grids[delset[ii].idx].data);
grids[delset[ii].idx].data=NULL;
}
activeset=newset;
}
void AMRreaderPlus::modify(){modflag=1;}
void AMRreaderPlus::getActive(IdxSet &grids){
if (modflag!=0){
build_active();
modflag=0;
}
grids=activeset;
}
void AMRreaderPlus::loadData(IdxSet &loadset){
if (modflag!=0){
build_active();
modflag=0;
}
if (!activeset.contains(loadset)){
cout<<"Trying to load non-active grids. Hmmmm."<<endl;
}
for (int ii=0;ii<loadset.getSize();ii++){
if (grids[loadset[ii].idx].data==NULL){
cout<<"Loaded "<<loadset[ii].idx<<endl;
getGridData(grids[loadset[ii].idx], loadset[ii].idx);
}
}
}
|