source: Sophya/trunk/SophyaPI/PIext/nomtarradapter.cc@ 3335

Last change on this file since 3335 was 3335, checked in by ansari, 18 years ago

forcage conversion Norm2() en double ds NomAdapter array/matrices, Reza 02/10/2007

File size: 14.1 KB
Line 
1#include "sopnamsp.h"
2#include "machdefs.h"
3#include <stdlib.h>
4#include <typeinfo>
5#include <iostream>
6#include <string>
7#include <complex>
8
9#include "datatype.h"
10
11#include "nomtarradapter.h"
12#include "tvector.h"
13#include "pitvmaad.h"
14#include "piyfxdrw.h"
15
16#include "fioarr.h"
17
18#include "nobjmgr.h"
19
20
21//----------------------------------------------------------------
22// Class Adaptateur d'objet (Pour NamedObjMgr) d'objet TMatrix<T>
23//----------------------------------------------------------------
24
25
26/* --Methode-- */
27template <class T>
28NOMAdapter_TArray<T>::NOMAdapter_TArray(TArray<T>* o)
29 : NObjMgrAdapter(o)
30{
31mArr = o;
32}
33
34/* --Methode-- */
35template <class T>
36NOMAdapter_TArray<T>::~NOMAdapter_TArray()
37{
38}
39
40/* --Methode-- */
41template <class T>
42NObjMgrAdapter* NOMAdapter_TArray<T>::Clone(AnyDataObj* o)
43{
44TArray<T>* a = dynamic_cast<TArray<T> *>(o);
45if (a) return ( new NOMAdapter_TArray<T>(a) );
46return ( new NObjMgrAdapter(o) );
47}
48
49/* --Methode-- */
50template <class T>
51string NOMAdapter_TArray<T>::GetDataObjType()
52{
53string type = "TArray< ";
54
55// type += DecodeTypeIdName(typeid(T).name());
56type += DataTypeInfo<T>::getTypeName();
57type += " > ";
58return(type);
59}
60
61/* --Methode-- */
62template <class T>
63AnyDataObj* NOMAdapter_TArray<T>::CloneDataObj(bool share)
64{
65return ( new TArray<T>(*mArr, share) );
66}
67
68/* --Methode-- */
69template <class T>
70string NOMAdapter_TArray<T>::GetInfoString(vector<string>& opts)
71{
72 if (opts.size() == 0) return mArr->InfoString();
73 else {
74 char buff[128];
75 if (opts[0] == "rank") {
76 sprintf(buff,"%d", (int)mArr->Rank());
77 return string(buff);
78 }
79 if (opts[0] == "sizes") {
80 string rs;
81 for(int_4 kd=0; kd<mArr->Rank(); kd++) {
82 sprintf(buff, "%ld ", (long)mArr->Size(kd));
83 rs += buff;
84 }
85 return rs;
86 }
87 else if ((opts[0] == "size") || (opts[0] == "nelts")) {
88 sprintf(buff, "%ld", (long)mArr->Size());
89 return string(buff);
90 }
91 else if (opts[0] == "sum") {
92 MuTyV mtv(mArr->Sum());
93 string s;
94 return mtv.Convert(s);
95 }
96 else if (opts[0] == "sumsq") {
97 MuTyV mtv(mArr->SumSq());
98 string s;
99 return mtv.Convert(s);
100 }
101 else if (opts[0] == "norm2") {
102 MuTyV mtv(mArr->Norm2());
103 r_8 nrm2 = mtv.Convert(nrm2); // we force the conversion to double
104 mtv = nrm2;
105 string s;
106 return mtv.Convert(s);
107 }
108 else if ((opts[0] == "min")||(opts[0] == "max")||(opts[0] == "minmax")) {
109 T amin, amax;
110 MuTyV mtv;
111 string s;
112 mArr->MinMax(amin, amax);
113 if (opts[0] == "minmax") {
114 mtv = amin; mtv.Convert(s);
115 s += " ";
116 string mms;
117 mtv = amax; mtv.Convert(mms);
118 s += mms;
119 }
120 else {
121 if (opts[0] == "min") mtv = amin;
122 else if (opts[0] == "max") mtv = amax;
123 mtv.Convert(s);
124 }
125 return s;
126 }
127 else if (opts[0] == "info") { // Acces aux valeurs stockes ds le DVList Info()
128 if (opts.size() < 2) return string("");
129 else if (mArr->Info().HasKey(opts[1]) == false) return string("");
130 else return mArr->Info().GetS(opts[1]);
131 }
132 else return "TArray.Att: rank sizes size/nelts sum sumsq/norm2 min max minmax";
133 }
134}
135
136/* --Methode-- */
137template <class T>
138int NOMAdapter_TArray<T>::PerformOperation(vector<string>& opts)
139{
140 bool ok = false;
141 if ((mArr->Rank() >= 3) && (opts.size() >= 2)) {
142 int_4 ks = atoi(opts[1].c_str());
143 TMatrix<T> * slice = new TMatrix<T>;
144 char buff[40];
145 if (opts[0] == "slicexy") {
146 slice->Share(mArr->SubArray(Range::all(), Range::all(), Range(ks),
147 Range::first(), Range::first()) );
148 ok = true;
149 sprintf(buff,"slicexy_%ld",(long)ks);
150 cout << "PerformOperation(): Extracting SliceXY(" << ks << ") from array" << endl;
151 }
152 else if (opts[0] == "sliceyz") {
153 slice->Share(mArr->SubArray(Range(ks), Range::all(), Range::all(), Range::first(),
154 Range::first()).CompactAllDimensions() );
155 ok = true;
156 sprintf(buff,"sliceyz_%ld",(long)ks);
157 cout << "PerformOperation(): Extracting SliceYZ(" << ks << ") from array" << endl;
158 }
159 else if (opts[0] == "slicexz") {
160 slice->Share(mArr->SubArray(Range::all(), Range(ks), Range::all(), Range::first(),
161 Range::first()).CompactAllDimensions() );
162 ok = true;
163 sprintf(buff,"slicexz_%ld",(long)ks);
164 cout << "PerformOperation(): Extracting SliceYZ(" << ks << ") from array" << endl;
165 }
166 if (ok) {
167 string nslice;
168 if (opts.size() > 2) nslice = opts[2];
169 else nslice = buff;
170 NamedObjMgr omg;
171 omg.AddObj(slice, nslice, true);
172 return 0;
173 }
174 }
175
176 cout << "NOMAdapter_TArray<T>::PerformOperation(): Error operation/arguments !" << endl;
177 cout << "...Valid args: slicexy idxZ [slicename], sliceyz idxX [nm] slicexz idxY [nm]" << endl;
178 return 1;
179}
180
181/* --Methode-- */
182template <class T>
183void NOMAdapter_TArray<T>::SavePPF(POutPersist& pos, string const & nom)
184{
185FIO_TArray<T> fio(mArr);
186fio.Write(pos, nom);
187}
188
189/* --Methode-- */
190template <class T>
191void NOMAdapter_TArray<T>::Print(ostream& os, int lev)
192{
193if (lev < 3) mArr->Show(os, false);
194else mArr->Show(os, true);
195if (lev > 0) mArr->Print(os, 10*lev);
196}
197
198/* --Methode-- */
199template <class T>
200PIDrawer * NOMAdapter_TArray<T>::GetDrawer(string & dopt)
201{
202if (mArr->NbDimensions() == 1) {
203 // On peut en faire un vecteur ...
204 TVector<T>* v = new TVector<T>(*mArr, true); // on partage les donnees
205 dopt = "thinline," + dopt;
206 return( new PIYfXDrawer( new POTVectorAdapter<T>(v, true), NULL, true) );
207}
208 else return(NULL);
209}
210
211/* --Methode-- */
212template <class T>
213P2DArrayAdapter* NOMAdapter_TArray<T>::Get2DArray(string &)
214{
215if (mArr->NbDimensions() <= 2) {
216 // On peut en faire un tableau 2-D ...
217 TMatrix<T>* m = new TMatrix<T>(*mArr, true); // on partage les donnees
218 return ( new POTMatrixAdapter<T>(m, true) );
219}
220else return(NULL);
221}
222
223/* --Methode-- */
224template <class T>
225NTupleInterface* NOMAdapter_TArray<T>::GetNTupleInterface(bool& adel)
226{
227adel = true;
228return( new NTupInt_TArray<T>(mArr) );
229}
230
231
232
233
234// -------------------------------------------------------------
235
236/* --Methode-- */
237template <class T>
238NTupInt_TArray<T>::NTupInt_TArray(TArray<T>* a)
239{
240mArr = a;
241}
242
243/* --Methode-- */
244template <class T>
245NTupInt_TArray<T>::~NTupInt_TArray()
246{
247}
248
249/* --Methode-- */
250template <class T>
251sa_size_t NTupInt_TArray<T>::NbLines() const
252{
253return( mArr->Size() );
254}
255
256/* --Methode-- */
257template <class T>
258sa_size_t NTupInt_TArray<T>::NbColumns() const
259{
260return(11);
261}
262
263/* --Methode-- */
264template <class T>
265r_8 NTupInt_TArray<T>::GetCell(sa_size_t n, sa_size_t k) const
266{
267 if ((n < 0) || (n >= (int)(mArr->Size()) ) )
268 return 0.;
269 if ((k < 0) || (k > 10)) return 0.;
270 GetLineD(n);
271 return mRet[k];
272}
273
274/* --Methode-- */
275template <class T>
276sa_size_t NTupInt_TArray<T>::ColumnIndex(string const & nom) const
277{
278string vardec = "double n,x,y,z,t,u,val,real,imag,mod,phas; \n";
279 if (nom == "n") return 0;
280 else if (nom == "x") return 1;
281 else if (nom == "y") return 2;
282 else if (nom == "z") return 3;
283 else if (nom == "t") return 4;
284 else if (nom == "u") return 5;
285 else if (nom == "val") return 6;
286 else if (nom == "real") return 7;
287 else if (nom == "imag") return 8;
288 else if (nom == "mod") return 9;
289 else if (nom == "phase") return 10;
290 else return -1;
291}
292
293/* --Methode-- */
294template <class T>
295void NTupInt_TArray<T>::GetMinMax(sa_size_t k, double& min, double& max) const
296{
297 if (k == 0) {
298 min = 0.; max = (r_8)(mArr->Size()); }
299 else if (k == 1) {
300 min = 0.; max = (r_8)(mArr->SizeX()); }
301 else if (k == 2) {
302 min = 0.; max = (r_8)(mArr->SizeY()); }
303 else if (k == 3) {
304 min = 0.; max = (r_8)(mArr->SizeZ()); }
305 else if (k == 4) {
306 min = 0.; max = (r_8)(mArr->Size(3)); }
307 else if (k == 5) {
308 min = 0.; max = (r_8)(mArr->Size(4)); }
309 else if ((k == 6) || (k == 7) || (k == 9)) {
310 T tmin, tmax;
311 mArr->MinMax(tmin, tmax);
312 min = (r_8)(tmin);
313 max = (r_8)(tmax);
314 }
315 else { min = max = 0.; }
316 return;
317}
318
319/* --Methode-- */
320template <class T>
321r_8* NTupInt_TArray<T>::GetLineD(sa_size_t n) const
322{
323if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
324 mRet[0] = n;
325 for(int i=1; i<11; i++) mRet[i] = 0.;
326}
327else {
328 sa_size_t ix, iy, iz, it, iu;
329 mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
330 mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
331 mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
332 mRet[6] = (*mArr)(ix,iy,iz,it,iu);
333 mRet[7] = mRet[6]; mRet[8] = 0.;
334 mRet[9] = mRet[6]; mRet[10] = 0.;
335 }
336return(mRet);
337}
338
339/* --Methode-- */
340template <class T>
341string NTupInt_TArray<T>::VarList_C(const char* nx) const
342{
343string nomx;
344if (nx) nomx = nx;
345else nomx = "_xh_";
346string vardec = "double n,x,y,z,t,u,val,real,imag,mod,phas; \n";
347vardec += "n = " + nomx + "[0]; x = " + nomx + "[1]; y = " + nomx + "[2]; \n";
348vardec += "z = " + nomx + "[3]; t = " + nomx + "[4]; u = " + nomx + "[5]; \n";
349vardec += "val = " + nomx + "[6]; \n";
350vardec += "real = " + nomx + "[7]; imag = " + nomx + "[8]; \n";
351vardec += "mod = " + nomx + "[9]; phas = " + nomx + "[10]; \n";
352return(vardec);
353}
354
355/* --Methode-- */
356DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
357r_8* NTupInt_TArray< complex<r_4> >::GetLineD(sa_size_t n) const
358{
359if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
360 mRet[0] = n;
361 for(int i=1; i<11; i++) mRet[i] = 0.;
362}
363else {
364 sa_size_t ix, iy, iz, it, iu;
365 mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
366 mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
367 mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
368 mRet[7] = (*mArr)(ix,iy,iz,it,iu).real();
369 mRet[8] = (*mArr)(ix,iy,iz,it,iu).imag();
370 mRet[6] = mRet[9] = sqrt(mRet[7]*mRet[7]+mRet[8]*mRet[8]);
371 mRet[10] = atan2(mRet[8], mRet[7]);
372}
373return(mRet);
374}
375
376DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
377r_8* NTupInt_TArray< complex<r_8> >::GetLineD(sa_size_t n) const
378{
379if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
380 mRet[0] = n;
381 for(int i=1; i<11; i++) mRet[i] = 0.;
382}
383else {
384 sa_size_t ix, iy, iz, it, iu;
385 mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
386 mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
387 mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
388 mRet[7] = (*mArr)(ix,iy,iz,it,iu).real();
389 mRet[8] = (*mArr)(ix,iy,iz,it,iu).imag();
390 mRet[6] = mRet[9] = sqrt(mRet[7]*mRet[7]+mRet[8]*mRet[8]);
391 mRet[10] = atan2(mRet[8], mRet[7]);
392}
393return(mRet);
394}
395
396DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
397void NTupInt_TArray< complex<r_4> >::GetMinMax(sa_size_t k, double& min, double& max) const
398{
399 if (k == 0) {
400 min = 0.; max = (r_8)(mArr->Size()); }
401 else if (k == 1) {
402 min = 0.; max = (r_8)(mArr->SizeX()); }
403 else if (k == 2) {
404 min = 0.; max = (r_8)(mArr->SizeY()); }
405 else if (k == 3) {
406 min = 0.; max = (r_8)(mArr->SizeZ()); }
407 else if (k == 4) {
408 min = 0.; max = (r_8)(mArr->Size(3)); }
409 else if (k == 5) {
410 min = 0.; max = (r_8)(mArr->Size(4)); }
411 else if ((k >= 6) || (k <= 9)) {
412 r_8 tmin[3] = {9.e39,9.e39,9.e39};
413 r_8 tmax[3] = {-9.e39,-9.e39,-9.e39};
414 for(sa_size_t jj=0; jj<mArr->Size(); jj++) {
415 sa_size_t ix, iy, iz, it, iu;
416 mArr->IndexAtPosition(jj, ix, iy, iz, it, iu);
417 r_8 cv[3];
418 cv[0] = (*mArr)(ix,iy,iz,it,iu).real();
419 cv[1] = (*mArr)(ix,iy,iz,it,iu).imag();
420 cv[2] = sqrt(cv[0]*cv[0]+cv[1]*cv[1]);
421 for(int i=0; i<3; i++) {
422 if (cv[i] < tmin[i]) tmin[i] = cv[i];
423 if (cv[i] > tmax[i]) tmax[i] = cv[i];
424 }
425 }
426 if (k == 7) { min = tmin[0]; max = tmax[0]; }
427 else if (k == 8) { min = tmin[0]; max = tmax[0]; }
428 else { min = tmin[2]; max = tmax[2]; }
429 }
430 else { min = max = 0.; }
431 return;
432}
433DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
434void NTupInt_TArray< complex<r_8> >::GetMinMax(sa_size_t k, double& min, double& max) const
435{
436 if (k == 0) {
437 min = 0.; max = (r_8)(mArr->Size()); }
438 else if (k == 1) {
439 min = 0.; max = (r_8)(mArr->SizeX()); }
440 else if (k == 2) {
441 min = 0.; max = (r_8)(mArr->SizeY()); }
442 else if (k == 3) {
443 min = 0.; max = (r_8)(mArr->SizeZ()); }
444 else if (k == 4) {
445 min = 0.; max = (r_8)(mArr->Size(3)); }
446 else if (k == 5) {
447 min = 0.; max = (r_8)(mArr->Size(4)); }
448 else if ((k >= 6) || (k <= 9)) {
449 r_8 tmin[3] = {9.e39,9.e39,9.e39};
450 r_8 tmax[3] = {-9.e39,-9.e39,-9.e39};
451 for(sa_size_t jj=0; jj<mArr->Size(); jj++) {
452 sa_size_t ix, iy, iz, it, iu;
453 mArr->IndexAtPosition(jj, ix, iy, iz, it, iu);
454 r_8 cv[3];
455 cv[0] = (*mArr)(ix,iy,iz,it,iu).real();
456 cv[1] = (*mArr)(ix,iy,iz,it,iu).imag();
457 cv[2] = sqrt(cv[0]*cv[0]+cv[1]*cv[1]);
458 for(int i=0; i<3; i++) {
459 if (cv[i] < tmin[i]) tmin[i] = cv[i];
460 if (cv[i] > tmax[i]) tmax[i] = cv[i];
461 }
462 }
463 if (k == 7) { min = tmin[0]; max = tmax[0]; }
464 else if (k == 8) { min = tmin[0]; max = tmax[0]; }
465 else { min = tmin[2]; max = tmax[2]; }
466 }
467 else { min = max = 0.; }
468 return;
469}
470
471#ifdef __CXX_PRAGMA_TEMPLATES__
472#pragma define_template NOMAdapter_TArray<uint_2>
473#pragma define_template NOMAdapter_TArray<int_2>
474#pragma define_template NOMAdapter_TArray<int_4>
475#pragma define_template NOMAdapter_TArray<int_8>
476#pragma define_template NOMAdapter_TArray<r_4>
477#pragma define_template NOMAdapter_TArray<r_8>
478#pragma define_template NOMAdapter_TArray< complex<r_4> >
479#pragma define_template NOMAdapter_TArray< complex<r_8> >
480#pragma define_template NTupInt_TArray<uint_2>
481#pragma define_template NTupInt_TArray<int_2>
482#pragma define_template NTupInt_TArray<int_4>
483#pragma define_template NTupInt_TArray<int_8>
484#pragma define_template NTupInt_TArray<r_4>
485#pragma define_template NTupInt_TArray<r_8>
486#pragma define_template NTupInt_TArray< complex<r_4> >
487#pragma define_template NTupInt_TArray< complex<r_8> >
488#endif
489
490#if defined(ANSI_TEMPLATES)
491template class NOMAdapter_TArray<uint_2>;
492template class NOMAdapter_TArray<int_2>;
493template class NOMAdapter_TArray<int_4>;
494template class NOMAdapter_TArray<int_8>;
495template class NOMAdapter_TArray<r_4>;
496template class NOMAdapter_TArray<r_8>;
497template class NOMAdapter_TArray< complex<r_4> >;
498template class NOMAdapter_TArray< complex<r_8> >;
499template class NTupInt_TArray<uint_2>;
500template class NTupInt_TArray<int_2>;
501template class NTupInt_TArray<int_4>;
502template class NTupInt_TArray<int_8>;
503template class NTupInt_TArray<r_4>;
504template class NTupInt_TArray<r_8>;
505template class NTupInt_TArray< complex<r_4> >;
506template class NTupInt_TArray< complex<r_8> >;
507#endif
Note: See TracBrowser for help on using the repository browser.