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
|
//# Copyright (C) 1998,1999,2000,2001
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library 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 Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: casa-feedback@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
#include <casacore/ms/MSOper/MSKeys.h>
#include <casacore/casa/BasicSL/String.h>
namespace casacore {
Bool operator<(const SubScanKey& lhs, const SubScanKey& rhs) {
if (lhs.obsID < rhs.obsID) {
return True;
}
else if (lhs.obsID == rhs.obsID) {
if (lhs.arrayID < rhs.arrayID) {
return True;
}
else if (lhs.arrayID == rhs.arrayID) {
if (lhs.scan < rhs.scan) {
return True;
}
else if (lhs.scan == rhs.scan) {
if (lhs.fieldID < rhs.fieldID) {
return True;
}
}
}
}
return False;
}
String toString(const SubScanKey& subScanKey) {
return toString(scanKey(subScanKey)) + " fieldID="
+ String::toString(subScanKey.fieldID);
}
std::ostream& operator<<(std::ostream& os, const SubScanKey& subScanKey) {
os << toString(subScanKey) << endl;
return os;
}
String toString(const ScanKey& scanKey) {
return "observationID=" + String::toString(scanKey.obsID)
+ " arrayID=" + String::toString(scanKey.arrayID)
+ " scan number=" + String::toString(scanKey.scan);
}
Bool operator<(const ScanKey& lhs, const ScanKey& rhs) {
if (lhs.obsID < rhs.obsID) {
return True;
}
else if (lhs.obsID == rhs.obsID) {
if (lhs.arrayID < rhs.arrayID) {
return True;
}
else if (lhs.arrayID == rhs.arrayID) {
if (lhs.scan < rhs.scan) {
return True;
}
}
}
return False;
}
Bool operator==(const ScanKey& lhs, const ScanKey& rhs) {
return lhs.obsID == rhs.obsID && lhs.arrayID == rhs.arrayID
&& lhs.scan == rhs.scan;
}
std::set<Int> scanNumbers(const std::set<ScanKey>& scanKeys) {
std::set<Int> scanNumbers;
std::set<ScanKey>::const_iterator iter = scanKeys.begin();
std::set<ScanKey>::const_iterator end = scanKeys.end();
while (iter != end) {
scanNumbers.insert(iter->scan);
++iter;
}
return scanNumbers;
}
ostream& operator<<(ostream& os, const ScanKey& scanKey) {
os << toString(scanKey) << endl;
return os;
}
Bool operator<(const ArrayKey& lhs, const ArrayKey& rhs) {
if (lhs.obsID < rhs.obsID) {
return True;
}
else if (lhs.obsID == rhs.obsID) {
if (lhs.arrayID < rhs.arrayID) {
return True;
}
}
return False;
}
std::set<ScanKey> scanKeys(
const std::set<Int>& scans, const ArrayKey& arrayKey
) {
std::set<ScanKey> scanKeys;
std::set<Int>::const_iterator iter = scans.begin();
std::set<Int>::const_iterator end = scans.end();
ScanKey scanKey;
scanKey.obsID = arrayKey.obsID;
scanKey.arrayID = arrayKey.arrayID;
while (iter != end) {
scanKey.scan = *iter;
scanKeys.insert(scanKey);
++iter;
}
return scanKeys;
}
Bool operator<(const SourceKey& lhs, const SourceKey& rhs) {
if (lhs.id < rhs.id) {
return True;
}
else if (lhs.id == rhs.id && lhs.spw < rhs.spw) {
return True;
}
return False;
}
std::set<ArrayKey> uniqueArrayKeys(const std::set<ScanKey>& scanKeys) {
std::set<ArrayKey> arrayKeys;
std::set<ScanKey>::const_iterator iter = scanKeys.begin();
std::set<ScanKey>::const_iterator end = scanKeys.end();
ArrayKey akey;
while (iter != end) {
akey.arrayID = iter->arrayID;
akey.obsID = iter->obsID;
arrayKeys.insert(akey);
++iter;
}
return arrayKeys;
}
std::set<ScanKey> filter(const std::set<ScanKey> scans, const ArrayKey& arrayKey) {
std::set<ScanKey> subset;
std::set<ScanKey>::const_iterator iter = scans.begin();
std::set<ScanKey>::const_iterator end = scans.end();
ArrayKey arrayFromScan;
for (; iter!=end; ++iter) {
arrayFromScan.arrayID = iter->arrayID;
arrayFromScan.obsID = iter->obsID;
if (arrayFromScan == arrayKey) {
subset.insert(*iter);
}
else if (arrayKey < arrayFromScan) {
// take advantage of implicit sorting
break;
}
}
return subset;
}
}
|
