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 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
|
// Astrophysics Science Division,
// NASA/ Goddard Space Flight Center
// HEASARC
// http://heasarc.gsfc.nasa.gov
// e-mail: ccfits@legacy.gsfc.nasa.gov
//
// Original author: Ben Dorman
#ifdef _MSC_VER
#include "MSconfig.h" // for truncation warning
#endif
// FITSUtil
#include "FITSUtil.h"
#include "FitsError.h"
#include "FITS.h"
#include <algorithm>
#include <cstring>
#include <cctype>
using std::string;
namespace CCfits {
const unsigned long USBASE = 1 << 15;
const unsigned long ULBASE = (unsigned long)1 << 31;
namespace FITSUtil {
InvalidConversion::InvalidConversion (const string& diag, bool silent)
: FitsException(string("Fits Error: Attempt to perform invalid implicit conversion "),silent)
{
addToMessage(diag);
if (FITS::verboseMode() || !silent) std::cerr << diag << '\n';
}
char** CharArray (const std::vector<string>& inArray)
{
size_t n = inArray.size();
if (n == 0) return 0;
char** c = new char*[n];
for (size_t i = 0; i < n; ++i)
{
size_t m(inArray[i].length());
c[i] = new char[m+1];
strncpy(c[i],inArray[i].c_str(),m + 1);
}
return c;
}
#if TEMPLATE_AMBIG_DEFECT || TEMPLATE_AMBIG7_DEFECT
void fillMSvsvs (std::vector<string>& outArray, const std::vector<string>& inArray, size_t first, size_t last)
{
// recall behavior of iterators: last has to be one-past-the-last entry.
// if last == first, this will still do something. the "first-1" is a zero based indexing
// correction.
outArray.assign(inArray.begin()+first-1,inArray.begin()+last);
}
#endif
void fill (std::vector<string>& outArray, const std::vector<string>& inArray, size_t first, size_t last)
{
// recall behavior of iterators: last has to be one-past-the-last entry.
// if last == first, this will still do something. the "first-1" is a zero based indexing
// correction.
outArray.assign(inArray.begin()+first-1,inArray.begin()+last);
}
string lowerCase(const string& inputString)
{
const size_t n(inputString.length());
string outputString(n,' ');
for (size_t l = 0 ; l < n; ++l)
{
outputString[l] = tolower(inputString[l]);
}
return outputString;
}
string upperCase(const string& inputString)
{
const size_t n(inputString.length());
string outputString(n,' ');
for (size_t l = 0 ; l < n; ++l)
{
outputString[l] = toupper(inputString[l]);
}
return outputString;
}
string::size_type checkForCompressString(const string& fileName)
{
// Simply look for the first occurrence of the form "[compress....".
const string leadIndicator("[compress");
string::size_type start = fileName.find(leadIndicator);
return start;
}
string FITSType2String ( int typeInt )
{
string keyString("");
switch (typeInt)
{
default:
case Tnull:
keyString = "Unknown";
break;
case Tbit:
keyString = "bit";
break;
case Tbyte:
keyString = "byte";
break;
case Tlogical:
keyString = "logical";
break;
case Tstring:
keyString = "string";
break;
case Tushort:
keyString = "unsigned short";
break;
case Tshort:
keyString = "short";
break;
case Tuint:
keyString = "unsigned integer";
break;
case Tint:
keyString = "integer";
break;
case Tulong:
keyString = "unsigned long";
break;
case Tlong:
keyString = "long";
break;
case Tlonglong:
keyString = "long long";
case Tfloat:
keyString = "float";
break;
case Tdouble:
keyString = "double";
break;
case Tcomplex:
keyString = "float complex";
break;
case Tdblcomplex:
keyString = "double complex";
break;
}
return keyString;
}
bool MatchStem::operator()(const string& left, const string& right) const
{
static const string DIGITS("0123456789");
size_t n(left.find_last_not_of(DIGITS));
if ( n != string::npos ) return (left.substr(0,n) == right);
else return (left == right);
}
// VF<-VF
#ifdef TEMPLATE_AMBIG_DEFECT
void
fillMSvfvf(std::vector<std::complex<float> >& outArray, const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = inArray[j];
}
}
#else
void
fill(std::vector<std::complex<float> >& outArray, const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = inArray[j];
}
}
#endif
#ifdef TEMPLATE_AMBIG_DEFECT
// VF<-VD
void
fillMSvfvd(std::vector<std::complex<float> >& outArray, const std::vector<std::complex<double> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = std::complex<float>(inArray[j].real(),
inArray[j].imag());
}
}
#else
// VF<-VD
void
fill(std::vector<std::complex<float> >& outArray, const std::vector<std::complex<double> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = std::complex<float>(inArray[j].real(),
inArray[j].imag());
}
}
#endif
// VD<-VD
#ifdef TEMPLATE_AMBIG_DEFECT
void
fillMSvdvd(std::vector<std::complex<double> >& outArray, const std::vector<std::complex<double> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = inArray[j];
}
}
#else
void
fill(std::vector<std::complex<double> >& outArray, const std::vector<std::complex<double> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = inArray[j];
}
}
#endif
// VD<-VF
#ifdef TEMPLATE_AMBIG_DEFECT
void
fillMSvdvf(std::vector<std::complex<double> >& outArray, const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = std::complex<double>(inArray[j].real(),
inArray[j].imag());
}
}
#else
void
fill(std::vector<std::complex<double> >& outArray, const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = std::complex<double>(inArray[j].real(),
inArray[j].imag());
}
}
#endif
// AF<-VF
// AF<-VF
#ifdef TEMPLATE_AMBIG_DEFECT
void
fillMSafvf(std::valarray<std::complex<float> >& outArray,
const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1 ] = inArray[j];
}
}
#else
void
fill(std::valarray<std::complex<float> >& outArray,
const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1 ] = inArray[j];
}
}
#endif
// AF<-VD
void
fill(std::valarray<std::complex<float> >& outArray,
const std::vector<std::complex<double> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1 ]
= std::complex<float>(inArray[j].real(),inArray[j].imag());
}
}
// AD<-VD
#ifdef TEMPLATE_AMBIG_DEFECT
void
fillMSadvd(std::valarray<std::complex<double> >& outArray,
const std::vector<std::complex<double> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = inArray[j];
}
}
#else
void
fill(std::valarray<std::complex<double> >& outArray,
const std::vector<std::complex<double> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1] = inArray[j];
}
}
#endif
// AD<-VF
#ifdef TEMPLATE_AMBIG_DEFECT
void
fillMSadvf(std::valarray<std::complex<double> >& outArray,
const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1 ]
= std::complex<float>(inArray[j].real(),inArray[j].imag());
}
}
#else
void
fill(std::valarray<std::complex<double> >& outArray,
const std::vector<std::complex<float> >& inArray,
size_t first, size_t last)
{
// vector to vector assign. stdlib takes care of deletion.
size_t range = last - first + 1;
if (outArray.size() != range) outArray.resize(range);
for (size_t j = first - 1; j < last; ++j)
{
outArray[j - first + 1 ]
= std::complex<float>(inArray[j].real(),inArray[j].imag());
}
}
#endif
// AF<-AF
void
fill(std::valarray<std::complex<float> >& outArray,
const std::valarray<std::complex<float> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
outArray = inArray;
}
// AD<-AD
void
fill(std::valarray<std::complex<double> >& outArray,
const std::valarray<std::complex<double> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
outArray = inArray;
}
// AF<-AD
void
fill(std::valarray<std::complex<float> >& outArray,
const std::valarray<std::complex<double> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
for (size_t j = 0; j < N; ++j )
{
outArray[j] = std::complex<float>(inArray[j].real(),inArray[j].imag());
}
}
// AD<-AF
void
fill(std::valarray<std::complex<double> >& outArray,
const std::valarray<std::complex<float> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
for (size_t j = 0; j < N; ++j )
{
outArray[j] = std::complex<double>(inArray[j].real(),inArray[j].imag());
}
}
// VF<-AF
void
fill(std::vector<std::complex<float> >& outArray,
const std::valarray<std::complex<float> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
for (size_t j = 0; j < N; ++j) outArray[j] = inArray[j];
}
// VD<-AD
void
fill(std::vector<std::complex<double> >& outArray,
const std::valarray<std::complex<double> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
for (size_t j = 0; j < N; ++j) outArray[j] = inArray[j];
}
// VF<-AD
void
fill(std::vector<std::complex<float> >& outArray,
const std::valarray<std::complex<double> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
for (size_t j = 0; j < N; ++j )
{
outArray[j] = std::complex<float>(inArray[j].real(),inArray[j].imag());
}
}
// VD<-AF
void
fill(std::vector<std::complex<double> >& outArray,
const std::valarray<std::complex<float> >& inArray)
{
// vector to vector assign. stdlib takes care of deletion.
size_t N (inArray.size());
if (outArray.size() != N) outArray.resize(N);
for (size_t j = 0; j < N; ++j )
{
outArray[j] = std::complex<double>(inArray[j].real(),inArray[j].imag());
}
}
// Parameterized Class CCfits::FITSUtil::FitsNullValue
// Class CCfits::FITSUtil::UnrecognizedType
UnrecognizedType::UnrecognizedType (string diag, bool silent)
: FitsException(" Invalid type for FITS I/O ",silent)
{
addToMessage(diag);
std::cerr << diag << '\n';
}
} // namespace FITSUtil
} // namespace CCfits
|