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

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

Suite/Correction Affichage auto des tableaux avec NDim>2, mais ND<=2 avec tailles>1 , Reza 01/02/2008

File size: 15.0 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 }
173 else delete slice;
174 return 0;
175 }
176 else if (opts.size() >= 1) {
177 if (opts[0] == "compactalldim") {
178 mArr->CompactAllDimensions(); ok = true;
179 cout << "PerformOperation(): mArr->CompactAllDimensions() " << endl;
180 }
181 else if (opts[0] == "compactdim") {
182 mArr->CompactTrailingDimensions(); ok = true;
183 cout << "PerformOperation(): mArr->CompactTrailingDimensions() " << endl;
184 }
185 else ok = false;
186 if (ok) return 0;
187 }
188
189 if (!ok) {
190 cout << "NOMAdapter_TArray<T>::PerformOperation(): Error operation/arguments !" << endl;
191 cout << "...Valid args: slicexy idxZ [slicename], sliceyz idxX [nm] slicexz idxY [nm]" << endl;
192 cout << "... compactdim (=CompactTrailingDimensions()), compactalldim (=CompactAllDimensions())" << endl;
193 return 1;
194 }
195}
196
197/* --Methode-- */
198template <class T>
199void NOMAdapter_TArray<T>::SavePPF(POutPersist& pos, string const & nom)
200{
201FIO_TArray<T> fio(mArr);
202fio.Write(pos, nom);
203}
204
205/* --Methode-- */
206template <class T>
207void NOMAdapter_TArray<T>::Print(ostream& os, int lev)
208{
209if (lev < 3) mArr->Show(os, false);
210else mArr->Show(os, true);
211if (lev > 0) mArr->Print(os, 10*lev);
212}
213
214/* --Methode-- */
215template <class T>
216PIDrawer * NOMAdapter_TArray<T>::GetDrawer(string & dopt)
217{
218TArray<T> arr(*mArr, true); // on partage les donnees
219arr.CompactAllDimensions();
220if (arr.NbDimensions() == 1) {
221 // On peut en faire un vecteur ...
222 TVector<T>* v = new TVector<T>(arr, true); // on partage les donnees
223 dopt = "thinline," + dopt;
224 return( new PIYfXDrawer( new POTVectorAdapter<T>(v, true), NULL, true) );
225}
226else {
227 cout << "NOMAdapter_TArray<T>::GetDrawer() NDim[Size>1]>1 -> No PIDrawer" << endl;
228 return(NULL);
229}
230}
231
232/* --Methode-- */
233template <class T>
234P2DArrayAdapter* NOMAdapter_TArray<T>::Get2DArray(string &)
235{
236TArray<T> arr(*mArr, true); // on partage les donnees
237arr.CompactAllDimensions();
238if (arr.NbDimensions() <= 2) {
239 // On peut en faire un tableau 2-D ...
240 TMatrix<T>* m = new TMatrix<T>(arr, true); // on partage les donnees
241 return ( new POTMatrixAdapter<T>(m, true) );
242}
243else {
244 cout << "NOMAdapter_TArray<T>::Get2DArray() NDim[Size>1]>2 -> No 2DArrAdapt" << endl;
245 return(NULL);
246}
247}
248
249/* --Methode-- */
250template <class T>
251NTupleInterface* NOMAdapter_TArray<T>::GetNTupleInterface(bool& adel)
252{
253adel = true;
254return( new NTupInt_TArray<T>(mArr) );
255}
256
257
258
259
260// -------------------------------------------------------------
261
262/* --Methode-- */
263template <class T>
264NTupInt_TArray<T>::NTupInt_TArray(TArray<T>* a)
265{
266mArr = a;
267}
268
269/* --Methode-- */
270template <class T>
271NTupInt_TArray<T>::~NTupInt_TArray()
272{
273}
274
275/* --Methode-- */
276template <class T>
277sa_size_t NTupInt_TArray<T>::NbLines() const
278{
279return( mArr->Size() );
280}
281
282/* --Methode-- */
283template <class T>
284sa_size_t NTupInt_TArray<T>::NbColumns() const
285{
286return(11);
287}
288
289/* --Methode-- */
290template <class T>
291r_8 NTupInt_TArray<T>::GetCell(sa_size_t n, sa_size_t k) const
292{
293 if ((n < 0) || (n >= (int)(mArr->Size()) ) )
294 return 0.;
295 if ((k < 0) || (k > 10)) return 0.;
296 GetLineD(n);
297 return mRet[k];
298}
299
300/* --Methode-- */
301template <class T>
302sa_size_t NTupInt_TArray<T>::ColumnIndex(string const & nom) const
303{
304string vardec = "double n,x,y,z,t,u,val,real,imag,mod,phas; \n";
305 if (nom == "n") return 0;
306 else if (nom == "x") return 1;
307 else if (nom == "y") return 2;
308 else if (nom == "z") return 3;
309 else if (nom == "t") return 4;
310 else if (nom == "u") return 5;
311 else if (nom == "val") return 6;
312 else if (nom == "real") return 7;
313 else if (nom == "imag") return 8;
314 else if (nom == "mod") return 9;
315 else if (nom == "phase") return 10;
316 else return -1;
317}
318
319/* --Methode-- */
320template <class T>
321void NTupInt_TArray<T>::GetMinMax(sa_size_t k, double& min, double& max) const
322{
323 if (k == 0) {
324 min = 0.; max = (r_8)(mArr->Size()); }
325 else if (k == 1) {
326 min = 0.; max = (r_8)(mArr->SizeX()); }
327 else if (k == 2) {
328 min = 0.; max = (r_8)(mArr->SizeY()); }
329 else if (k == 3) {
330 min = 0.; max = (r_8)(mArr->SizeZ()); }
331 else if (k == 4) {
332 min = 0.; max = (r_8)(mArr->Size(3)); }
333 else if (k == 5) {
334 min = 0.; max = (r_8)(mArr->Size(4)); }
335 else if ((k == 6) || (k == 7) || (k == 9)) {
336 T tmin, tmax;
337 mArr->MinMax(tmin, tmax);
338 min = (r_8)(tmin);
339 max = (r_8)(tmax);
340 }
341 else { min = max = 0.; }
342 return;
343}
344
345/* --Methode-- */
346template <class T>
347r_8* NTupInt_TArray<T>::GetLineD(sa_size_t n) const
348{
349if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
350 mRet[0] = n;
351 for(int i=1; i<11; i++) mRet[i] = 0.;
352}
353else {
354 sa_size_t ix, iy, iz, it, iu;
355 mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
356 mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
357 mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
358 mRet[6] = (*mArr)(ix,iy,iz,it,iu);
359 mRet[7] = mRet[6]; mRet[8] = 0.;
360 mRet[9] = mRet[6]; mRet[10] = 0.;
361 }
362return(mRet);
363}
364
365/* --Methode-- */
366template <class T>
367string NTupInt_TArray<T>::VarList_C(const char* nx) const
368{
369string nomx;
370if (nx) nomx = nx;
371else nomx = "_xh_";
372string vardec = "double n,x,y,z,t,u,val,real,imag,mod,phas; \n";
373vardec += "n = " + nomx + "[0]; x = " + nomx + "[1]; y = " + nomx + "[2]; \n";
374vardec += "z = " + nomx + "[3]; t = " + nomx + "[4]; u = " + nomx + "[5]; \n";
375vardec += "val = " + nomx + "[6]; \n";
376vardec += "real = " + nomx + "[7]; imag = " + nomx + "[8]; \n";
377vardec += "mod = " + nomx + "[9]; phas = " + nomx + "[10]; \n";
378return(vardec);
379}
380
381/* --Methode-- */
382DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
383r_8* NTupInt_TArray< complex<r_4> >::GetLineD(sa_size_t n) const
384{
385if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
386 mRet[0] = n;
387 for(int i=1; i<11; i++) mRet[i] = 0.;
388}
389else {
390 sa_size_t ix, iy, iz, it, iu;
391 mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
392 mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
393 mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
394 mRet[7] = (*mArr)(ix,iy,iz,it,iu).real();
395 mRet[8] = (*mArr)(ix,iy,iz,it,iu).imag();
396 mRet[6] = mRet[9] = sqrt(mRet[7]*mRet[7]+mRet[8]*mRet[8]);
397 mRet[10] = atan2(mRet[8], mRet[7]);
398}
399return(mRet);
400}
401
402DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
403r_8* NTupInt_TArray< complex<r_8> >::GetLineD(sa_size_t n) const
404{
405if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
406 mRet[0] = n;
407 for(int i=1; i<11; i++) mRet[i] = 0.;
408}
409else {
410 sa_size_t ix, iy, iz, it, iu;
411 mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
412 mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
413 mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
414 mRet[7] = (*mArr)(ix,iy,iz,it,iu).real();
415 mRet[8] = (*mArr)(ix,iy,iz,it,iu).imag();
416 mRet[6] = mRet[9] = sqrt(mRet[7]*mRet[7]+mRet[8]*mRet[8]);
417 mRet[10] = atan2(mRet[8], mRet[7]);
418}
419return(mRet);
420}
421
422DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
423void NTupInt_TArray< complex<r_4> >::GetMinMax(sa_size_t k, double& min, double& max) const
424{
425 if (k == 0) {
426 min = 0.; max = (r_8)(mArr->Size()); }
427 else if (k == 1) {
428 min = 0.; max = (r_8)(mArr->SizeX()); }
429 else if (k == 2) {
430 min = 0.; max = (r_8)(mArr->SizeY()); }
431 else if (k == 3) {
432 min = 0.; max = (r_8)(mArr->SizeZ()); }
433 else if (k == 4) {
434 min = 0.; max = (r_8)(mArr->Size(3)); }
435 else if (k == 5) {
436 min = 0.; max = (r_8)(mArr->Size(4)); }
437 else if ((k >= 6) || (k <= 9)) {
438 r_8 tmin[3] = {9.e39,9.e39,9.e39};
439 r_8 tmax[3] = {-9.e39,-9.e39,-9.e39};
440 for(sa_size_t jj=0; jj<mArr->Size(); jj++) {
441 sa_size_t ix, iy, iz, it, iu;
442 mArr->IndexAtPosition(jj, ix, iy, iz, it, iu);
443 r_8 cv[3];
444 cv[0] = (*mArr)(ix,iy,iz,it,iu).real();
445 cv[1] = (*mArr)(ix,iy,iz,it,iu).imag();
446 cv[2] = sqrt(cv[0]*cv[0]+cv[1]*cv[1]);
447 for(int i=0; i<3; i++) {
448 if (cv[i] < tmin[i]) tmin[i] = cv[i];
449 if (cv[i] > tmax[i]) tmax[i] = cv[i];
450 }
451 }
452 if (k == 7) { min = tmin[0]; max = tmax[0]; }
453 else if (k == 8) { min = tmin[0]; max = tmax[0]; }
454 else { min = tmin[2]; max = tmax[2]; }
455 }
456 else { min = max = 0.; }
457 return;
458}
459DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
460void NTupInt_TArray< complex<r_8> >::GetMinMax(sa_size_t k, double& min, double& max) const
461{
462 if (k == 0) {
463 min = 0.; max = (r_8)(mArr->Size()); }
464 else if (k == 1) {
465 min = 0.; max = (r_8)(mArr->SizeX()); }
466 else if (k == 2) {
467 min = 0.; max = (r_8)(mArr->SizeY()); }
468 else if (k == 3) {
469 min = 0.; max = (r_8)(mArr->SizeZ()); }
470 else if (k == 4) {
471 min = 0.; max = (r_8)(mArr->Size(3)); }
472 else if (k == 5) {
473 min = 0.; max = (r_8)(mArr->Size(4)); }
474 else if ((k >= 6) || (k <= 9)) {
475 r_8 tmin[3] = {9.e39,9.e39,9.e39};
476 r_8 tmax[3] = {-9.e39,-9.e39,-9.e39};
477 for(sa_size_t jj=0; jj<mArr->Size(); jj++) {
478 sa_size_t ix, iy, iz, it, iu;
479 mArr->IndexAtPosition(jj, ix, iy, iz, it, iu);
480 r_8 cv[3];
481 cv[0] = (*mArr)(ix,iy,iz,it,iu).real();
482 cv[1] = (*mArr)(ix,iy,iz,it,iu).imag();
483 cv[2] = sqrt(cv[0]*cv[0]+cv[1]*cv[1]);
484 for(int i=0; i<3; i++) {
485 if (cv[i] < tmin[i]) tmin[i] = cv[i];
486 if (cv[i] > tmax[i]) tmax[i] = cv[i];
487 }
488 }
489 if (k == 7) { min = tmin[0]; max = tmax[0]; }
490 else if (k == 8) { min = tmin[0]; max = tmax[0]; }
491 else { min = tmin[2]; max = tmax[2]; }
492 }
493 else { min = max = 0.; }
494 return;
495}
496
497#ifdef __CXX_PRAGMA_TEMPLATES__
498#pragma define_template NOMAdapter_TArray<uint_2>
499#pragma define_template NOMAdapter_TArray<int_2>
500#pragma define_template NOMAdapter_TArray<int_4>
501#pragma define_template NOMAdapter_TArray<int_8>
502#pragma define_template NOMAdapter_TArray<r_4>
503#pragma define_template NOMAdapter_TArray<r_8>
504#pragma define_template NOMAdapter_TArray< complex<r_4> >
505#pragma define_template NOMAdapter_TArray< complex<r_8> >
506#pragma define_template NTupInt_TArray<uint_2>
507#pragma define_template NTupInt_TArray<int_2>
508#pragma define_template NTupInt_TArray<int_4>
509#pragma define_template NTupInt_TArray<int_8>
510#pragma define_template NTupInt_TArray<r_4>
511#pragma define_template NTupInt_TArray<r_8>
512#pragma define_template NTupInt_TArray< complex<r_4> >
513#pragma define_template NTupInt_TArray< complex<r_8> >
514#endif
515
516#if defined(ANSI_TEMPLATES)
517template class NOMAdapter_TArray<uint_2>;
518template class NOMAdapter_TArray<int_2>;
519template class NOMAdapter_TArray<int_4>;
520template class NOMAdapter_TArray<int_8>;
521template class NOMAdapter_TArray<r_4>;
522template class NOMAdapter_TArray<r_8>;
523template class NOMAdapter_TArray< complex<r_4> >;
524template class NOMAdapter_TArray< complex<r_8> >;
525template class NTupInt_TArray<uint_2>;
526template class NTupInt_TArray<int_2>;
527template class NTupInt_TArray<int_4>;
528template class NTupInt_TArray<int_8>;
529template class NTupInt_TArray<r_4>;
530template class NTupInt_TArray<r_8>;
531template class NTupInt_TArray< complex<r_4> >;
532template class NTupInt_TArray< complex<r_8> >;
533#endif
Note: See TracBrowser for help on using the repository browser.