GGti.cpp
27 KB
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
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
/***************************************************************************
* GGti.cpp - Good time interval class *
* ----------------------------------------------------------------------- *
* copyright (C) 2008-2012 by Juergen Knoedlseder *
* ----------------------------------------------------------------------- *
* *
* This program is free software: you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation, either version 3 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program. If not, see <http://www.gnu.org/licenses/>. *
* *
***************************************************************************/
/**
* @file GGti.cpp
* @brief Good time interval class implementation.
* @author Juergen Knoedlseder
*/
/* __ Includes ___________________________________________________________ */
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "GException.hpp"
#include "GTools.hpp"
#include "GGti.hpp"
#include "GFits.hpp"
#include "GFitsTable.hpp"
#include "GFitsBinTable.hpp"
#include "GFitsTableDoubleCol.hpp"
/* __ Method name definitions ____________________________________________ */
#define G_TSTART "GGti::tstart(int&)"
#define G_TSTOP "GGti::tstop(int&)"
/* __ Macros _____________________________________________________________ */
/* __ Coding definitions _________________________________________________ */
/* __ Debug definitions __________________________________________________ */
/*==========================================================================
= =
= Constructors/destructors =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Void constructor
***************************************************************************/
GGti::GGti(void)
{
// Initialise class members
init_members();
// Return
return;
}
/***********************************************************************//**
* @brief Copy constructor
*
* @param[in] gti Good Time Intervals.
***************************************************************************/
GGti::GGti(const GGti& gti)
{
// Initialise class members
init_members();
// Copy members
copy_members(gti);
// Return
return;
}
/***********************************************************************//**
* @brief Time reference constructor
*
* @param[in] ref Time reference.
***************************************************************************/
GGti::GGti(const GTimeReference& ref)
{
// Initialise class members
init_members();
// Set time reference
this->reference(ref);
// Return
return;
}
/***********************************************************************//**
* @brief Destructor
***************************************************************************/
GGti::~GGti(void)
{
// Free members
free_members();
// Return
return;
}
/*==========================================================================
= =
= Operators =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Assignment operator
*
* @param[in] gti Good Time Intervals.
* @return Good Time Intervals.
***************************************************************************/
GGti& GGti::operator= (const GGti& gti)
{
// Execute only if object is not identical
if (this != >i) {
// Free members
free_members();
// Initialise private members
init_members();
// Copy members
copy_members(gti);
} // endif: object was not identical
// Return this object
return *this;
}
/*==========================================================================
= =
= Public methods =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Clear Good Time Intervals
***************************************************************************/
void GGti::clear(void)
{
// Free members
free_members();
// Initialise private members
init_members();
// Return
return;
}
/***********************************************************************//**
* @brief Clone Good Time Intervals
*
* @return Pointer to deep copy of GTIs.
***************************************************************************/
GGti* GGti::clone(void) const
{
// Clone this image
return new GGti(*this);
}
/***********************************************************************//**
* @brief Return number of intervals
*
* @return Number of intervals.
*
* Returns number of intervals.
***************************************************************************/
int GGti::size(void) const
{
// Return number of intervals
return m_num;
}
/***********************************************************************//**
* @brief Add one Good Time Interval
*
* @param[in] tstart Start time of interval.
* @param[in] tstop Stop time of interval.
*
* This method adds a new GTI to the object. Adding means that if the
* specified time interval overlaps with an existing time interval, the
* existing time interval will be extended. If overlap with more than a
* single interval exists, the intervals will be merged. Otherwise a new
* interval will be inserted, respecting the time ordering of the intervals.
*
* If the time interval is not valid (tstop <= tstart), nothing is done.
***************************************************************************/
void GGti::add(const GTime& tstart, const GTime& tstop)
{
// Continue only if time interval is valid
if (tstop > tstart) {
// Determine index at which GTI should be inserted
int inx = 0;
for (int i = 0; i < m_num; ++i) {
if (tstart < m_start[i]) {
break;
}
}
// Insert GTI
insert_gti(inx, tstart, tstop);
// Merge any overlapping GTIs
merge_gtis();
} // endif: Time interval was valid
// Return
return;
}
/***********************************************************************//**
* @brief Append one Good Time Interval
*
* @param[in] tstart Start time of interval.
* @param[in] tstop Stop time of interval.
*
* This method append a new GTI at the end of the object. In contrast to the
* add() method, no checking of time ordering or interval overlapping will be
* done.
*
* If the time interval is not valid (tstop <= tstart), nothing is done.
***************************************************************************/
void GGti::append(const GTime& tstart, const GTime& tstop)
{
// Continue only if time interval is valid
if (tstop > tstart) {
// Insert GTI at end of list
insert_gti(m_num, tstart, tstop);
} // endif: Time interval was valid
// Return
return;
}
/***********************************************************************//**
* @brief Insert one Good Time Interval
*
* @param[in] tstart Start time of interval.
* @param[in] tstop Stop time of interval.
*
* This method inserts a new GTI at the appropriate time ordered position in
* the object. Time ordering will be done based on the start time of the GTI.
* No check for interval overlap will be done.
*
* If the time interval is not valid (tstop <= tstart), nothing is done.
***************************************************************************/
void GGti::insert(const GTime& tstart, const GTime& tstop)
{
// Continue only if time interval is valid
if (tstop > tstart) {
// Determine index at which GTI should be inserted
int inx = 0;
for (int i = 0; i < m_num; ++i) {
if (tstart < m_start[i]) {
break;
}
}
// Insert GTI
insert_gti(inx, tstart, tstop);
} // endif: Time interval was valid
// Return
return;
}
/***********************************************************************//**
* @brief Reduce Good Time Intervals to specified interval
*
* @param[in] tstart Start time of interval.
* @param[in] tstop Stop time of interval.
*
* This method reduces the Good Time Intervals to the specified interval.
* Reducing means that all GTIs are dropped that fall outside the interval,
* and GTIs will be limited to within the interval if they overlap.
*
* If the time interval is not valid (tstop <= tstart), nothing is done.
***************************************************************************/
void GGti::reduce(const GTime& tstart, const GTime& tstop)
{
// Continue only if time interval is valid
if (tstop > tstart) {
// Adjust existing GTIs. This will limit all GTIs to [tstart,tstop].
// All GTIs outside [tstart,tstop] will have start > stop. The number
// of valid GTIs will also be determined.
int num = 0;
for (int i = 0; i < m_num; ++i) {
if (m_start[i] < tstart) {
m_start[i] = tstart;
}
if (m_stop[i] > tstop) {
m_stop[i] = tstop;
}
if (m_start[i] <= m_stop[i]) {
num++;
}
}
// If we still have valid GTIs then allocate memory for them, copy
// over the start and stop times, and update the attributes
if (num > 0) {
// Allocate new intervals
GTime* start = new GTime[num];
GTime* stop = new GTime[num];
// Copy valid intervals
for (int i = 0; i < m_num; ++i) {
if (m_start[i] <= m_stop[i]) {
start[i] = m_start[i];
stop[i] = m_stop[i];
}
}
// Free old memory
if (m_start != NULL) delete [] m_start;
if (m_stop != NULL) delete [] m_stop;
// Set new memory
m_start = start;
m_stop = stop;
// Set attributes
m_num = num;
set_attributes();
} // endif: there were still valid GTIs
// ... otherwise we remove all GTIs
else {
clear();
}
} // endif: Time interval was valid
// Return
return;
}
/***********************************************************************//**
* @brief Load GTIs from FITS file.
*
* @param[in] filename FITS filename.
* @param[in] extname GTI extension name (default is "GTI")
*
* This method loads the Good Time Intervals from a FITS file.
***************************************************************************/
void GGti::load(const std::string& filename, const std::string& extname)
{
// Allocate FITS file
GFits file;
// Open FITS file
file.open(filename);
// Get GTI HDU
GFitsTable* hdu = file.table(extname);
// Read GTI from HDU
read(hdu);
// Close FITS file
file.close();
// Return
return;
}
/***********************************************************************//**
* @brief Save GTI intervals to FITS file.
*
* @param[in] filename FITS filename.
* @param[in] clobber Overwrite any existing GTI extension?
* @param[in] extname GTI extension name (default is "GTI")
*
* The method saves GTI into a FITS file. If the file does not exist it is
* created. If the file exists the GTI is appended as extension. If another
* GTI exists already it is overwritten if clobber=true.
***************************************************************************/
void GGti::save(const std::string& filename, bool clobber,
const std::string& extname) const
{
// Allocate FITS file
GFits file;
// Write GTI to FITS file
write(&file, extname);
// Save to file
file.saveto(filename, clobber);
// Return
return;
}
/***********************************************************************//**
* @brief Read GTI time reference and intervals from FITS table
*
* @param[in] hdu Pointer to FITS table.
*
* Read the GTI time reference and time intervals from a FITS table
* extension.
***************************************************************************/
void GGti::read(const GFitsTable* hdu)
{
// Free members
free_members();
// Initialise attributes
init_members();
// Read time reference
m_reference.read(hdu);
// Extract GTI information from FITS file
m_num = hdu->integer("NAXIS2");
if (m_num > 0) {
// Set GTIs
m_start = new GTime[m_num];
m_stop = new GTime[m_num];
for (int i = 0; i < m_num; ++i) {
m_start[i].set((*hdu)["START"].real(i), m_reference);
m_stop[i].set((*hdu)["STOP"].real(i), m_reference);
}
// Set attributes
set_attributes();
}
// Return
return;
}
/***********************************************************************//**
* @brief Write GTI time reference and intervals into FITS file
*
* @param[in] file Pointer to FITS file.
* @param[in] extname GTI extension name (default is "GTI")
*
* The method saves GTI into a FITS file. If the file does not exist it is
* created. If the file exists the GTI is appended as extension. If another
* GTI exists already it is overwritten if clobber=true.
*
* @todo Implement clobber method for overwriting of existing GTIs.
***************************************************************************/
void GGti::write(GFits* file, const std::string& extname) const
{
// Create GTI columns
GFitsTableDoubleCol cstart = GFitsTableDoubleCol("START", m_num);
GFitsTableDoubleCol cstop = GFitsTableDoubleCol("STOP", m_num);
// Fill GTI columns in specified time reference
for (int i = 0; i < m_num; ++i) {
cstart(i) = m_start[i].convert(m_reference);
cstop(i) = m_stop[i].convert(m_reference);
}
// Create GTI table
GFitsBinTable* table = new GFitsBinTable(m_num);
table->append_column(cstart);
table->append_column(cstop);
table->extname(extname);
// Write time reference
m_reference.write(table);
// Write to FITS file
file->append(*table);
// Free table
delete table;
// Return
return;
}
/***********************************************************************//**
* @brief Returns earliest start time of GTI
*
* @return Earliest start time of GTI.
***************************************************************************/
const GTime& GGti::tstart(void) const
{
// Return
return m_tstart;
}
/***********************************************************************//**
* @brief Returns latest stop time of GTI
*
* @return Latest stop time of GTI.
***************************************************************************/
const GTime& GGti::tstop(void) const
{
// Return
return m_tstop;
}
/***********************************************************************//**
* @brief Returns start time of specific GTI
*
* @param[in] inx Index of GTI (0 ... size()-1).
*
* @exception GException::out_of_range
* Specified index is out of range.
***************************************************************************/
const GTime& GGti::tstart(const int& inx) const
{
#if defined(G_RANGE_CHECK)
// If index is outside boundary then throw an error
if (inx < 0 || inx >= m_num) {
throw GException::out_of_range(G_TSTART, inx, 0, m_num-1);
}
#endif
// Return
return (m_start[inx]);
}
/***********************************************************************//**
* @brief Returns stop time of specific GTI
*
* @param[in] inx Index of GTI (0 ... size()-1).
*
* @exception GException::out_of_range
* Specified index is out of range.
***************************************************************************/
const GTime& GGti::tstop(const int& inx) const
{
#if defined(G_RANGE_CHECK)
// If index is outside boundary then throw an error
if (inx < 0 || inx >= m_num) {
throw GException::out_of_range(G_TSTOP, inx, 0, m_num-1);
}
#endif
// Return
return (m_stop[inx]);
}
/***********************************************************************//**
* @brief Returns elapsed time
*
* @return Elapsed time [secs].
***************************************************************************/
const double& GGti::telapse(void) const
{
// Return
return m_telapse;
}
/***********************************************************************//**
* @brief Returns ontime
*
* @return Ontime [secs].
***************************************************************************/
const double& GGti::ontime(void) const
{
// Return
return m_ontime;
}
/***********************************************************************//**
* @brief Set GTI time reference
*
* @param[in] ref Time reference.
*
* Sets the time reference of the Good Time Intervals.
***************************************************************************/
void GGti::reference(const GTimeReference& ref)
{
// Set time reference
m_reference = ref;
// Return
return;
}
/***********************************************************************//**
* @brief Return GTI time reference
*
* @return Time reference.
*
* Returns the time reference of the Good Time Intervals.
***************************************************************************/
const GTimeReference& GGti::reference(void) const
{
// Return time reference
return m_reference;
}
/***********************************************************************//**
* @brief Tests whether GTI intervals contain the specified time
*
* @param[in] time Time.
*
* This methods checks whether a given time is contained within any of the
* GTI intervals. The method returns true once the first GTI interval
* comprising the time is found. It returns false if none of the intervals
* contains the time.
***************************************************************************/
bool GGti::contains(const GTime& time) const
{
// Initialise test
bool found = false;
// Test all GTIs
for (int i = 0; i < m_num; ++i) {
if (time >= m_start[i] && time <= m_stop[i]) {
found = true;
break;
}
}
// Return result
return found;
}
/***********************************************************************//**
* @brief Print Good Time Intervals
***************************************************************************/
std::string GGti::print(void) const
{
// Initialise result string
std::string result;
// Append header
result.append("=== GGti ===");
// Append GTI information
result.append("\n"+parformat("Number of intervals")+str(size()));
result.append("\n"+parformat("Ontime")+str(ontime())+" sec");
result.append("\n"+parformat("Elapsed time")+str(telapse())+" sec");
result.append("\n"+parformat("Time range"));
result.append(str(tstart().convert(m_reference)));
result.append(" - ");
result.append(str(tstop().convert(m_reference)));
result.append(" "+reference().timeunit());
result.append(" ("+reference().timesys()+")");
result.append("\n"+parformat("Reference MDJ"));
result.append(str(reference().mjdref()));
// Append time reference information
//result.append("\n"+reference().print());
// Return result
return result;
}
/*==========================================================================
= =
= Private methods =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Initialise class members
***************************************************************************/
void GGti::init_members(void)
{
// Initialise members
m_num = 0;
m_tstart.clear();
m_tstop.clear();
m_ontime = 0.0;
m_telapse = 0.0;
m_start = NULL;
m_stop = NULL;
// Initialise time reference with native reference
GTime time;
m_reference = time.reference();
// Return
return;
}
/***********************************************************************//**
* @brief Copy class members
*
* @param[in] gti GGti members which should be copied.
***************************************************************************/
void GGti::copy_members(const GGti& gti)
{
// Copy attributes
m_num = gti.m_num;
m_tstart = gti.m_tstart;
m_tstop = gti.m_tstop;
m_ontime = gti.m_ontime;
m_telapse = gti.m_telapse;
m_reference = gti.m_reference;
// Copy start/stop times
if (m_num > 0) {
m_start = new GTime[m_num];
m_stop = new GTime[m_num];
for (int i = 0; i < m_num; ++i) {
m_start[i] = gti.m_start[i];
m_stop[i] = gti.m_stop[i];
}
}
// Return
return;
}
/***********************************************************************//**
* @brief Delete class members
***************************************************************************/
void GGti::free_members(void)
{
// Free memory
if (m_start != NULL) delete [] m_start;
if (m_stop != NULL) delete [] m_stop;
// Signal free pointers
m_start = NULL;
m_stop = NULL;
// Return
return;
}
/***********************************************************************//**
* @brief Set class attributes
*
* Compute the following class attributes:
*
* m_tstart - Earliest start time of GTIs
* m_stop - Latest stop time of GTIs
* m_telapse - Latest stop time minus earliest start time of GTIs [sec]
* m_ontime - Sum of all intervals [sec]
***************************************************************************/
void GGti::set_attributes(void)
{
// Continue only if there are GTIs
if (m_num > 0) {
// Set attributes
m_tstart = m_start[0];
m_tstop = m_stop[m_num-1];
m_telapse = m_tstop.secs() - m_tstart.secs();
m_ontime = 0.0;
for (int i = 0; i < m_num; ++i) {
m_ontime += (m_stop[i].secs() - m_start[i].secs());
}
} // endif: there were GTIs
// Return
return;
}
/***********************************************************************//**
* @brief Insert Good Time Interval
*
* @param[in] inx Index at which GTI is to be inserted.
* @param[in] tstart Start time of interval to be inserted.
* @param[in] tstop Stop time of interval to be inserted.
*
* Inserts a GTI at a given position in the GTI array. This method does not
* assure the time ordering of the GTIs, this has to be done by the client
* that determines the appropriate value of inx.
* Invalid parameters do not produce any exception, but are handled
* transparently. If the GTI is invalid (tstop <= tstart), no interval
* will be inserted. If the index is out of the valid range, the index
* will be adjusted to either the first or the last element.
***************************************************************************/
void GGti::insert_gti(int inx, const GTime& tstart, const GTime& tstop)
{
// Continue only if time interval is valid
if (tstop > tstart) {
// If inx is out of range then adjust it
if (inx < 0) inx = 0;
if (inx > m_num) inx = m_num;
// Allocate new intervals
int num = m_num+1;
GTime* start = new GTime[num];
GTime* stop = new GTime[num];
// Copy intervals before GTI to be inserted
for (int i = 0; i < inx; ++i) {
start[i] = m_start[i];
stop[i] = m_stop[i];
}
// Insert GTI
start[inx] = tstart;
stop[inx] = tstop;
// Copy intervals after GTI to be inserted
for (int i = inx+1; i < num; ++i) {
start[i] = m_start[i-1];
stop[i] = m_stop[i-1];
}
// Free memory
if (m_start != NULL) delete [] m_start;
if (m_stop != NULL) delete [] m_stop;
// Set new memory
m_start = start;
m_stop = stop;
// Set attributes
m_num = num;
set_attributes();
} // endif: Time interval was valid
// Return
return;
}
/***********************************************************************//**
* @brief Merge all overlapping Good Time Intervals
*
* Merges all overlapping GTIs into a single GTI. This method assumes that
* the GTI are ordered correctly by start time. Note that the method does
* not actually reduce the memory size but just updates the information on
* the number of elements in the array.
***************************************************************************/
void GGti::merge_gtis(void)
{
// Find overlaps
int i = 0;
int num = m_num;
while (i < num-1) {
// If GTI overlaps with following one then merge both GTIs, move
// all remaining GTIs one position up, and reduce number of elements
if (m_start[i+1] <= m_stop[i]) {
m_start[i] = (m_start[i] < m_start[i+1]) ? m_start[i] : m_start[i+1];
m_stop[i] = (m_stop[i] > m_stop[i+1]) ? m_stop[i] : m_stop[i+1];
for (int k = i+2; k < num; ++k) {
m_start[k-1] = m_start[k];
m_stop[k-1] = m_stop[k];
}
num--;
}
// Otherwise increment GTI index
else
i++;
} // endwhile: there were still GTIs to check
// Update number of elements in GTI
m_num = num;
// Return
return;
}