[2615] | 1 | #include "sopnamsp.h"
|
---|
[1315] | 2 | #include "machdefs.h"
|
---|
| 3 | #include <stdlib.h>
|
---|
| 4 | #include <typeinfo>
|
---|
[2322] | 5 | #include <iostream>
|
---|
[1315] | 6 | #include <string>
|
---|
| 7 | #include <complex>
|
---|
| 8 |
|
---|
| 9 | #include "datatype.h"
|
---|
| 10 |
|
---|
| 11 | #include "nomtarradapter.h"
|
---|
[1321] | 12 | #include "tvector.h"
|
---|
| 13 | #include "pitvmaad.h"
|
---|
[1905] | 14 | #include "piyfxdrw.h"
|
---|
[1315] | 15 |
|
---|
| 16 | #include "fioarr.h"
|
---|
| 17 |
|
---|
[2999] | 18 | #include "nobjmgr.h"
|
---|
[1315] | 19 |
|
---|
| 20 |
|
---|
| 21 | //----------------------------------------------------------------
|
---|
| 22 | // Class Adaptateur d'objet (Pour NamedObjMgr) d'objet TMatrix<T>
|
---|
| 23 | //----------------------------------------------------------------
|
---|
| 24 |
|
---|
| 25 |
|
---|
| 26 | /* --Methode-- */
|
---|
| 27 | template <class T>
|
---|
| 28 | NOMAdapter_TArray<T>::NOMAdapter_TArray(TArray<T>* o)
|
---|
| 29 | : NObjMgrAdapter(o)
|
---|
| 30 | {
|
---|
| 31 | mArr = o;
|
---|
| 32 | }
|
---|
| 33 |
|
---|
| 34 | /* --Methode-- */
|
---|
| 35 | template <class T>
|
---|
| 36 | NOMAdapter_TArray<T>::~NOMAdapter_TArray()
|
---|
| 37 | {
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | /* --Methode-- */
|
---|
| 41 | template <class T>
|
---|
| 42 | NObjMgrAdapter* NOMAdapter_TArray<T>::Clone(AnyDataObj* o)
|
---|
| 43 | {
|
---|
| 44 | TArray<T>* a = dynamic_cast<TArray<T> *>(o);
|
---|
| 45 | if (a) return ( new NOMAdapter_TArray<T>(a) );
|
---|
| 46 | return ( new NObjMgrAdapter(o) );
|
---|
| 47 | }
|
---|
| 48 |
|
---|
| 49 | /* --Methode-- */
|
---|
| 50 | template <class T>
|
---|
| 51 | string NOMAdapter_TArray<T>::GetDataObjType()
|
---|
| 52 | {
|
---|
| 53 | string type = "TArray< ";
|
---|
| 54 |
|
---|
| 55 | // type += DecodeTypeIdName(typeid(T).name());
|
---|
| 56 | type += DataTypeInfo<T>::getTypeName();
|
---|
| 57 | type += " > ";
|
---|
| 58 | return(type);
|
---|
| 59 | }
|
---|
| 60 |
|
---|
| 61 | /* --Methode-- */
|
---|
| 62 | template <class T>
|
---|
| 63 | AnyDataObj* NOMAdapter_TArray<T>::CloneDataObj(bool share)
|
---|
| 64 | {
|
---|
| 65 | return ( new TArray<T>(*mArr, share) );
|
---|
| 66 | }
|
---|
| 67 |
|
---|
[2999] | 68 | /* --Methode-- */
|
---|
| 69 | template <class T>
|
---|
| 70 | string 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") {
|
---|
[3033] | 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;
|
---|
[2999] | 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 | }
|
---|
[3333] | 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());
|
---|
[3335] | 103 | r_8 nrm2 = mtv.Convert(nrm2); // we force the conversion to double
|
---|
| 104 | mtv = nrm2;
|
---|
[3333] | 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 | }
|
---|
[3221] | 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 | }
|
---|
[3333] | 132 | else return "TArray.Att: rank sizes size/nelts sum sumsq/norm2 min max minmax";
|
---|
[2999] | 133 | }
|
---|
| 134 | }
|
---|
[1321] | 135 |
|
---|
| 136 | /* --Methode-- */
|
---|
| 137 | template <class T>
|
---|
[2999] | 138 | int 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") {
|
---|
[3004] | 153 | slice->Share(mArr->SubArray(Range(ks), Range::all(), Range::all(), Range::first(),
|
---|
| 154 | Range::first()).CompactAllDimensions() );
|
---|
[2999] | 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") {
|
---|
[3004] | 160 | slice->Share(mArr->SubArray(Range::all(), Range(ks), Range::all(), Range::first(),
|
---|
| 161 | Range::first()).CompactAllDimensions() );
|
---|
[2999] | 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;
|
---|
[3448] | 168 | if(opts.size() > 2) nslice = opts[2];
|
---|
[2999] | 169 | else nslice = buff;
|
---|
| 170 | NamedObjMgr omg;
|
---|
| 171 | omg.AddObj(slice, nslice, true);
|
---|
| 172 | }
|
---|
[3448] | 173 | else delete slice;
|
---|
| 174 | return 0;
|
---|
[2999] | 175 | }
|
---|
[3448] | 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 | }
|
---|
[2999] | 195 | }
|
---|
| 196 |
|
---|
| 197 | /* --Methode-- */
|
---|
| 198 | template <class T>
|
---|
[1315] | 199 | void NOMAdapter_TArray<T>::SavePPF(POutPersist& pos, string const & nom)
|
---|
| 200 | {
|
---|
| 201 | FIO_TArray<T> fio(mArr);
|
---|
| 202 | fio.Write(pos, nom);
|
---|
| 203 | }
|
---|
| 204 |
|
---|
| 205 | /* --Methode-- */
|
---|
| 206 | template <class T>
|
---|
[2975] | 207 | void NOMAdapter_TArray<T>::Print(ostream& os, int lev)
|
---|
[1315] | 208 | {
|
---|
[2975] | 209 | if (lev < 3) mArr->Show(os, false);
|
---|
| 210 | else mArr->Show(os, true);
|
---|
| 211 | if (lev > 0) mArr->Print(os, 10*lev);
|
---|
[1315] | 212 | }
|
---|
| 213 |
|
---|
[1321] | 214 | /* --Methode-- */
|
---|
| 215 | template <class T>
|
---|
| 216 | PIDrawer * NOMAdapter_TArray<T>::GetDrawer(string & dopt)
|
---|
| 217 | {
|
---|
[3453] | 218 | TArray<T> arr(*mArr, true); // on partage les donnees
|
---|
[3454] | 219 | arr.CompactAllDimensions();
|
---|
[3453] | 220 | if (arr.NbDimensions() == 1) {
|
---|
[1321] | 221 | // On peut en faire un vecteur ...
|
---|
[3453] | 222 | TVector<T>* v = new TVector<T>(arr, true); // on partage les donnees
|
---|
[1321] | 223 | dopt = "thinline," + dopt;
|
---|
| 224 | return( new PIYfXDrawer( new POTVectorAdapter<T>(v, true), NULL, true) );
|
---|
| 225 | }
|
---|
[3454] | 226 | else {
|
---|
| 227 | cout << "NOMAdapter_TArray<T>::GetDrawer() NDim[Size>1]>1 -> No PIDrawer" << endl;
|
---|
| 228 | return(NULL);
|
---|
[1321] | 229 | }
|
---|
[3454] | 230 | }
|
---|
[1315] | 231 |
|
---|
| 232 | /* --Methode-- */
|
---|
| 233 | template <class T>
|
---|
[1321] | 234 | P2DArrayAdapter* NOMAdapter_TArray<T>::Get2DArray(string &)
|
---|
| 235 | {
|
---|
[3453] | 236 | TArray<T> arr(*mArr, true); // on partage les donnees
|
---|
[3454] | 237 | arr.CompactAllDimensions();
|
---|
[3453] | 238 | if (arr.NbDimensions() <= 2) {
|
---|
[1321] | 239 | // On peut en faire un tableau 2-D ...
|
---|
[3453] | 240 | TMatrix<T>* m = new TMatrix<T>(arr, true); // on partage les donnees
|
---|
[1321] | 241 | return ( new POTMatrixAdapter<T>(m, true) );
|
---|
| 242 | }
|
---|
[3454] | 243 | else {
|
---|
| 244 | cout << "NOMAdapter_TArray<T>::Get2DArray() NDim[Size>1]>2 -> No 2DArrAdapt" << endl;
|
---|
| 245 | return(NULL);
|
---|
[1321] | 246 | }
|
---|
[3454] | 247 | }
|
---|
[1321] | 248 |
|
---|
| 249 | /* --Methode-- */
|
---|
| 250 | template <class T>
|
---|
[1315] | 251 | NTupleInterface* NOMAdapter_TArray<T>::GetNTupleInterface(bool& adel)
|
---|
| 252 | {
|
---|
| 253 | adel = true;
|
---|
| 254 | return( new NTupInt_TArray<T>(mArr) );
|
---|
| 255 | }
|
---|
| 256 |
|
---|
| 257 |
|
---|
| 258 |
|
---|
| 259 |
|
---|
| 260 | // -------------------------------------------------------------
|
---|
| 261 |
|
---|
| 262 | /* --Methode-- */
|
---|
| 263 | template <class T>
|
---|
| 264 | NTupInt_TArray<T>::NTupInt_TArray(TArray<T>* a)
|
---|
| 265 | {
|
---|
| 266 | mArr = a;
|
---|
| 267 | }
|
---|
| 268 |
|
---|
| 269 | /* --Methode-- */
|
---|
| 270 | template <class T>
|
---|
| 271 | NTupInt_TArray<T>::~NTupInt_TArray()
|
---|
| 272 | {
|
---|
| 273 | }
|
---|
| 274 |
|
---|
| 275 | /* --Methode-- */
|
---|
| 276 | template <class T>
|
---|
[2683] | 277 | sa_size_t NTupInt_TArray<T>::NbLines() const
|
---|
[1315] | 278 | {
|
---|
| 279 | return( mArr->Size() );
|
---|
| 280 | }
|
---|
| 281 |
|
---|
| 282 | /* --Methode-- */
|
---|
| 283 | template <class T>
|
---|
[2683] | 284 | sa_size_t NTupInt_TArray<T>::NbColumns() const
|
---|
[1315] | 285 | {
|
---|
| 286 | return(11);
|
---|
| 287 | }
|
---|
| 288 |
|
---|
| 289 | /* --Methode-- */
|
---|
| 290 | template <class T>
|
---|
[3004] | 291 | r_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-- */
|
---|
| 301 | template <class T>
|
---|
| 302 | sa_size_t NTupInt_TArray<T>::ColumnIndex(string const & nom) const
|
---|
| 303 | {
|
---|
| 304 | if (nom == "n") return 0;
|
---|
| 305 | else if (nom == "x") return 1;
|
---|
| 306 | else if (nom == "y") return 2;
|
---|
| 307 | else if (nom == "z") return 3;
|
---|
| 308 | else if (nom == "t") return 4;
|
---|
| 309 | else if (nom == "u") return 5;
|
---|
| 310 | else if (nom == "val") return 6;
|
---|
| 311 | else if (nom == "real") return 7;
|
---|
| 312 | else if (nom == "imag") return 8;
|
---|
| 313 | else if (nom == "mod") return 9;
|
---|
[3478] | 314 | else if (nom == "phas") return 10;
|
---|
[3004] | 315 | else return -1;
|
---|
| 316 | }
|
---|
| 317 |
|
---|
| 318 | /* --Methode-- */
|
---|
| 319 | template <class T>
|
---|
| 320 | void NTupInt_TArray<T>::GetMinMax(sa_size_t k, double& min, double& max) const
|
---|
| 321 | {
|
---|
| 322 | if (k == 0) {
|
---|
| 323 | min = 0.; max = (r_8)(mArr->Size()); }
|
---|
| 324 | else if (k == 1) {
|
---|
| 325 | min = 0.; max = (r_8)(mArr->SizeX()); }
|
---|
| 326 | else if (k == 2) {
|
---|
| 327 | min = 0.; max = (r_8)(mArr->SizeY()); }
|
---|
| 328 | else if (k == 3) {
|
---|
| 329 | min = 0.; max = (r_8)(mArr->SizeZ()); }
|
---|
| 330 | else if (k == 4) {
|
---|
| 331 | min = 0.; max = (r_8)(mArr->Size(3)); }
|
---|
| 332 | else if (k == 5) {
|
---|
| 333 | min = 0.; max = (r_8)(mArr->Size(4)); }
|
---|
| 334 | else if ((k == 6) || (k == 7) || (k == 9)) {
|
---|
| 335 | T tmin, tmax;
|
---|
| 336 | mArr->MinMax(tmin, tmax);
|
---|
| 337 | min = (r_8)(tmin);
|
---|
| 338 | max = (r_8)(tmax);
|
---|
| 339 | }
|
---|
| 340 | else { min = max = 0.; }
|
---|
| 341 | return;
|
---|
| 342 | }
|
---|
| 343 |
|
---|
| 344 | /* --Methode-- */
|
---|
| 345 | template <class T>
|
---|
[2683] | 346 | r_8* NTupInt_TArray<T>::GetLineD(sa_size_t n) const
|
---|
[1315] | 347 | {
|
---|
| 348 | if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
|
---|
| 349 | mRet[0] = n;
|
---|
| 350 | for(int i=1; i<11; i++) mRet[i] = 0.;
|
---|
| 351 | }
|
---|
| 352 | else {
|
---|
| 353 | sa_size_t ix, iy, iz, it, iu;
|
---|
| 354 | mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
|
---|
| 355 | mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
|
---|
| 356 | mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
|
---|
| 357 | mRet[6] = (*mArr)(ix,iy,iz,it,iu);
|
---|
[3004] | 358 | mRet[7] = mRet[6]; mRet[8] = 0.;
|
---|
| 359 | mRet[9] = mRet[6]; mRet[10] = 0.;
|
---|
[1315] | 360 | }
|
---|
| 361 | return(mRet);
|
---|
| 362 | }
|
---|
| 363 |
|
---|
| 364 | /* --Methode-- */
|
---|
| 365 | template <class T>
|
---|
| 366 | string NTupInt_TArray<T>::VarList_C(const char* nx) const
|
---|
| 367 | {
|
---|
| 368 | string nomx;
|
---|
| 369 | if (nx) nomx = nx;
|
---|
| 370 | else nomx = "_xh_";
|
---|
| 371 | string vardec = "double n,x,y,z,t,u,val,real,imag,mod,phas; \n";
|
---|
| 372 | vardec += "n = " + nomx + "[0]; x = " + nomx + "[1]; y = " + nomx + "[2]; \n";
|
---|
| 373 | vardec += "z = " + nomx + "[3]; t = " + nomx + "[4]; u = " + nomx + "[5]; \n";
|
---|
| 374 | vardec += "val = " + nomx + "[6]; \n";
|
---|
| 375 | vardec += "real = " + nomx + "[7]; imag = " + nomx + "[8]; \n";
|
---|
| 376 | vardec += "mod = " + nomx + "[9]; phas = " + nomx + "[10]; \n";
|
---|
| 377 | return(vardec);
|
---|
| 378 | }
|
---|
| 379 |
|
---|
| 380 | /* --Methode-- */
|
---|
[2343] | 381 | DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
|
---|
[2689] | 382 | r_8* NTupInt_TArray< complex<r_4> >::GetLineD(sa_size_t n) const
|
---|
[1315] | 383 | {
|
---|
| 384 | if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
|
---|
| 385 | mRet[0] = n;
|
---|
| 386 | for(int i=1; i<11; i++) mRet[i] = 0.;
|
---|
| 387 | }
|
---|
| 388 | else {
|
---|
| 389 | sa_size_t ix, iy, iz, it, iu;
|
---|
| 390 | mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
|
---|
| 391 | mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
|
---|
| 392 | mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
|
---|
| 393 | mRet[7] = (*mArr)(ix,iy,iz,it,iu).real();
|
---|
| 394 | mRet[8] = (*mArr)(ix,iy,iz,it,iu).imag();
|
---|
[3004] | 395 | mRet[6] = mRet[9] = sqrt(mRet[7]*mRet[7]+mRet[8]*mRet[8]);
|
---|
| 396 | mRet[10] = atan2(mRet[8], mRet[7]);
|
---|
[1315] | 397 | }
|
---|
| 398 | return(mRet);
|
---|
| 399 | }
|
---|
| 400 |
|
---|
[2343] | 401 | DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
|
---|
[2689] | 402 | r_8* NTupInt_TArray< complex<r_8> >::GetLineD(sa_size_t n) const
|
---|
[1315] | 403 | {
|
---|
| 404 | if ((n < 0) || (n >= (int)(mArr->Size()) ) ) {
|
---|
| 405 | mRet[0] = n;
|
---|
| 406 | for(int i=1; i<11; i++) mRet[i] = 0.;
|
---|
| 407 | }
|
---|
| 408 | else {
|
---|
| 409 | sa_size_t ix, iy, iz, it, iu;
|
---|
| 410 | mArr->IndexAtPosition(n, ix, iy, iz, it, iu);
|
---|
| 411 | mRet[0] = n; mRet[1] = ix; mRet[2] = iy;
|
---|
| 412 | mRet[3] = iz; mRet[4] = it; mRet[5] = iu;
|
---|
| 413 | mRet[7] = (*mArr)(ix,iy,iz,it,iu).real();
|
---|
| 414 | mRet[8] = (*mArr)(ix,iy,iz,it,iu).imag();
|
---|
[3004] | 415 | mRet[6] = mRet[9] = sqrt(mRet[7]*mRet[7]+mRet[8]*mRet[8]);
|
---|
| 416 | mRet[10] = atan2(mRet[8], mRet[7]);
|
---|
[1315] | 417 | }
|
---|
| 418 | return(mRet);
|
---|
| 419 | }
|
---|
| 420 |
|
---|
[3004] | 421 | DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
|
---|
| 422 | void NTupInt_TArray< complex<r_4> >::GetMinMax(sa_size_t k, double& min, double& max) const
|
---|
| 423 | {
|
---|
| 424 | if (k == 0) {
|
---|
| 425 | min = 0.; max = (r_8)(mArr->Size()); }
|
---|
| 426 | else if (k == 1) {
|
---|
| 427 | min = 0.; max = (r_8)(mArr->SizeX()); }
|
---|
| 428 | else if (k == 2) {
|
---|
| 429 | min = 0.; max = (r_8)(mArr->SizeY()); }
|
---|
| 430 | else if (k == 3) {
|
---|
| 431 | min = 0.; max = (r_8)(mArr->SizeZ()); }
|
---|
| 432 | else if (k == 4) {
|
---|
| 433 | min = 0.; max = (r_8)(mArr->Size(3)); }
|
---|
| 434 | else if (k == 5) {
|
---|
| 435 | min = 0.; max = (r_8)(mArr->Size(4)); }
|
---|
| 436 | else if ((k >= 6) || (k <= 9)) {
|
---|
| 437 | r_8 tmin[3] = {9.e39,9.e39,9.e39};
|
---|
| 438 | r_8 tmax[3] = {-9.e39,-9.e39,-9.e39};
|
---|
| 439 | for(sa_size_t jj=0; jj<mArr->Size(); jj++) {
|
---|
| 440 | sa_size_t ix, iy, iz, it, iu;
|
---|
| 441 | mArr->IndexAtPosition(jj, ix, iy, iz, it, iu);
|
---|
| 442 | r_8 cv[3];
|
---|
| 443 | cv[0] = (*mArr)(ix,iy,iz,it,iu).real();
|
---|
| 444 | cv[1] = (*mArr)(ix,iy,iz,it,iu).imag();
|
---|
| 445 | cv[2] = sqrt(cv[0]*cv[0]+cv[1]*cv[1]);
|
---|
| 446 | for(int i=0; i<3; i++) {
|
---|
| 447 | if (cv[i] < tmin[i]) tmin[i] = cv[i];
|
---|
| 448 | if (cv[i] > tmax[i]) tmax[i] = cv[i];
|
---|
| 449 | }
|
---|
| 450 | }
|
---|
| 451 | if (k == 7) { min = tmin[0]; max = tmax[0]; }
|
---|
| 452 | else if (k == 8) { min = tmin[0]; max = tmax[0]; }
|
---|
| 453 | else { min = tmin[2]; max = tmax[2]; }
|
---|
| 454 | }
|
---|
| 455 | else { min = max = 0.; }
|
---|
| 456 | return;
|
---|
| 457 | }
|
---|
| 458 | DECL_TEMP_SPEC /* equivalent a template <> , pour SGI-CC en particulier */
|
---|
| 459 | void NTupInt_TArray< complex<r_8> >::GetMinMax(sa_size_t k, double& min, double& max) const
|
---|
| 460 | {
|
---|
| 461 | if (k == 0) {
|
---|
| 462 | min = 0.; max = (r_8)(mArr->Size()); }
|
---|
| 463 | else if (k == 1) {
|
---|
| 464 | min = 0.; max = (r_8)(mArr->SizeX()); }
|
---|
| 465 | else if (k == 2) {
|
---|
| 466 | min = 0.; max = (r_8)(mArr->SizeY()); }
|
---|
| 467 | else if (k == 3) {
|
---|
| 468 | min = 0.; max = (r_8)(mArr->SizeZ()); }
|
---|
| 469 | else if (k == 4) {
|
---|
| 470 | min = 0.; max = (r_8)(mArr->Size(3)); }
|
---|
| 471 | else if (k == 5) {
|
---|
| 472 | min = 0.; max = (r_8)(mArr->Size(4)); }
|
---|
| 473 | else if ((k >= 6) || (k <= 9)) {
|
---|
| 474 | r_8 tmin[3] = {9.e39,9.e39,9.e39};
|
---|
| 475 | r_8 tmax[3] = {-9.e39,-9.e39,-9.e39};
|
---|
| 476 | for(sa_size_t jj=0; jj<mArr->Size(); jj++) {
|
---|
| 477 | sa_size_t ix, iy, iz, it, iu;
|
---|
| 478 | mArr->IndexAtPosition(jj, ix, iy, iz, it, iu);
|
---|
| 479 | r_8 cv[3];
|
---|
| 480 | cv[0] = (*mArr)(ix,iy,iz,it,iu).real();
|
---|
| 481 | cv[1] = (*mArr)(ix,iy,iz,it,iu).imag();
|
---|
| 482 | cv[2] = sqrt(cv[0]*cv[0]+cv[1]*cv[1]);
|
---|
| 483 | for(int i=0; i<3; i++) {
|
---|
| 484 | if (cv[i] < tmin[i]) tmin[i] = cv[i];
|
---|
| 485 | if (cv[i] > tmax[i]) tmax[i] = cv[i];
|
---|
| 486 | }
|
---|
| 487 | }
|
---|
| 488 | if (k == 7) { min = tmin[0]; max = tmax[0]; }
|
---|
| 489 | else if (k == 8) { min = tmin[0]; max = tmax[0]; }
|
---|
| 490 | else { min = tmin[2]; max = tmax[2]; }
|
---|
| 491 | }
|
---|
| 492 | else { min = max = 0.; }
|
---|
| 493 | return;
|
---|
| 494 | }
|
---|
[1315] | 495 |
|
---|
| 496 | #ifdef __CXX_PRAGMA_TEMPLATES__
|
---|
[2930] | 497 | #pragma define_template NOMAdapter_TArray<uint_2>
|
---|
[3528] | 498 | #pragma define_template NOMAdapter_TArray<uint_4>
|
---|
| 499 | #pragma define_template NOMAdapter_TArray<uint_8>
|
---|
[2930] | 500 | #pragma define_template NOMAdapter_TArray<int_2>
|
---|
[1315] | 501 | #pragma define_template NOMAdapter_TArray<int_4>
|
---|
[2930] | 502 | #pragma define_template NOMAdapter_TArray<int_8>
|
---|
[1315] | 503 | #pragma define_template NOMAdapter_TArray<r_4>
|
---|
| 504 | #pragma define_template NOMAdapter_TArray<r_8>
|
---|
| 505 | #pragma define_template NOMAdapter_TArray< complex<r_4> >
|
---|
| 506 | #pragma define_template NOMAdapter_TArray< complex<r_8> >
|
---|
[2930] | 507 | #pragma define_template NTupInt_TArray<uint_2>
|
---|
[3528] | 508 | #pragma define_template NTupInt_TArray<uint_4>
|
---|
| 509 | #pragma define_template NTupInt_TArray<uint_8>
|
---|
[2930] | 510 | #pragma define_template NTupInt_TArray<int_2>
|
---|
[1315] | 511 | #pragma define_template NTupInt_TArray<int_4>
|
---|
[2930] | 512 | #pragma define_template NTupInt_TArray<int_8>
|
---|
[1315] | 513 | #pragma define_template NTupInt_TArray<r_4>
|
---|
| 514 | #pragma define_template NTupInt_TArray<r_8>
|
---|
| 515 | #pragma define_template NTupInt_TArray< complex<r_4> >
|
---|
| 516 | #pragma define_template NTupInt_TArray< complex<r_8> >
|
---|
| 517 | #endif
|
---|
| 518 |
|
---|
| 519 | #if defined(ANSI_TEMPLATES)
|
---|
[2930] | 520 | template class NOMAdapter_TArray<uint_2>;
|
---|
[3528] | 521 | template class NOMAdapter_TArray<uint_4>;
|
---|
| 522 | template class NOMAdapter_TArray<uint_8>;
|
---|
[2930] | 523 | template class NOMAdapter_TArray<int_2>;
|
---|
[1315] | 524 | template class NOMAdapter_TArray<int_4>;
|
---|
[2930] | 525 | template class NOMAdapter_TArray<int_8>;
|
---|
[1315] | 526 | template class NOMAdapter_TArray<r_4>;
|
---|
| 527 | template class NOMAdapter_TArray<r_8>;
|
---|
| 528 | template class NOMAdapter_TArray< complex<r_4> >;
|
---|
| 529 | template class NOMAdapter_TArray< complex<r_8> >;
|
---|
[2930] | 530 | template class NTupInt_TArray<uint_2>;
|
---|
[3528] | 531 | template class NTupInt_TArray<uint_4>;
|
---|
| 532 | template class NTupInt_TArray<uint_8>;
|
---|
[2930] | 533 | template class NTupInt_TArray<int_2>;
|
---|
[1315] | 534 | template class NTupInt_TArray<int_4>;
|
---|
[2930] | 535 | template class NTupInt_TArray<int_8>;
|
---|
[1315] | 536 | template class NTupInt_TArray<r_4>;
|
---|
| 537 | template class NTupInt_TArray<r_8>;
|
---|
| 538 | template class NTupInt_TArray< complex<r_4> >;
|
---|
| 539 | template class NTupInt_TArray< complex<r_8> >;
|
---|
| 540 | #endif
|
---|