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
|
//# TableIterProxy.cc: Holder of table iterators for the table glish client.
//# Copyright (C) 1994,1995,1996
//# 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: aips2-request@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
//# $Id$
#include <casacore/tables/Tables/TableIterProxy.h>
#include <casacore/tables/Tables/TableProxy.h>
#include <casacore/tables/Tables/ScalarColumn.h>
#include <casacore/tables/Tables/TableError.h>
#include <casacore/casa/Containers/IterError.h>
#include <casacore/casa/Arrays/Vector.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
TableIterProxy::TableIterProxy()
: firstTime_p (True)
{}
TableIterProxy::TableIterProxy (const TableProxy& tab,
const Vector<String>& columns,
const String& order, const String& sortType,
const Vector<Double>& iterSteps)
: firstTime_p (True)
{
Block<String> names(columns.nelements());
for (uInt i=0; i<names.nelements(); i++) {
names[i] = columns(i);
}
String corder(order);
corder.downcase();
TableIterator::Order taborder = TableIterator::Ascending;
if (! corder.empty()) {
if (corder[0] == 'd' || corder[0] == 'D') {
taborder = TableIterator::Descending;
}
}
String csort(sortType);
csort.downcase();
TableIterator::Option tabsort = TableIterator::ParSort;
if (! csort.empty()) {
if (csort[0] == 'q') {
tabsort = TableIterator::QuickSort;
} else if (csort[0] == 'h') {
tabsort = TableIterator::HeapSort;
} else if (csort[0] == 'i') {
tabsort = TableIterator::InsSort;
} else if (csort[0] == 'p') {
tabsort = TableIterator::ParSort;
} else if (csort[0] == 'n') {
tabsort = TableIterator::NoSort;
}
}
if (iterSteps.empty() || tab.table().nrow() == 0) {
iter_p = TableIterator(tab.table(), names, taborder, tabsort);
} else {
makeStepIter (tab.table(), names, iterSteps, taborder, tabsort);
}
}
void TableIterProxy::makeStepIter (const Table& tab,
const Block<String>& columns,
const Vector<Double>& iterSteps,
TableIterator::Order order,
TableIterator::Option option)
{
// First determine if all columns are scalar and have a valid data type.
// Also find out if a case-insenstive string comparison is needed.
Block<CountedPtr<BaseCompare> > comps(columns.size());
Block<Int> orders (columns.size(), order);
for (uInt i=0; i<iterSteps.size(); ++i) {
if (i < columns.size() && iterSteps[i] > 0) {
const ColumnDesc& colDesc = tab.tableDesc()[columns[i]];
if (! colDesc.isScalar()) {
throw TableError ("Only scalar columns can be used in table "
"iteration");
}
DataType dtype = colDesc.dataType();
switch (dtype) {
// The following data types are valid.
case TpUChar:
case TpShort:
case TpUShort:
case TpInt:
case TpUInt:
case TpInt64:
case TpFloat:
case TpDouble:
break;
case TpString:
comps[i] = new CompareNoCase();
break;
default:
throw TableError ("No iteration step can be given for column " +
columns[i]);
}
}
}
// First sort the table to fully order the columns with an interval.
Table sortab(tab);
if (option != TableIterator::NoSort) {
Table sortab = tab.sort (columns, comps, orders, option);
}
// Now see if an interval comparison has to be done when iterating.
for (uInt i=0; i<iterSteps.size(); ++i) {
if (i < columns.size() && iterSteps[i] > 0) {
DataType dtype = sortab.tableDesc()[columns[i]].dataType();
switch (dtype) {
case TpUChar:
{
uChar start = ScalarColumn<uChar>(sortab, columns[i])(0);
comps[i] = new CompareIntervalInt<uChar>(iterSteps[i], start);
}
break;
case TpShort:
{
Short start = ScalarColumn<Short>(sortab, columns[i])(0);
comps[i] = new CompareIntervalInt<Short>(iterSteps[i], start);
}
break;
case TpUShort:
{
uShort start = ScalarColumn<uShort>(sortab, columns[i])(0);
comps[i] = new CompareIntervalInt<uShort>(iterSteps[i], start);
}
break;
case TpInt:
{
Int start = ScalarColumn<Int>(sortab, columns[i])(0);
comps[i] = new CompareIntervalInt<Int>(iterSteps[i], start);
}
break;
case TpUInt:
{
uInt start = ScalarColumn<uInt>(sortab, columns[i])(0);
comps[i] = new CompareIntervalInt<uInt>(iterSteps[i], start);
}
break;
case TpInt64:
{
Int64 start = ScalarColumn<Int64>(sortab, columns[i])(0);
comps[i] = new CompareIntervalInt<Int64>(iterSteps[i], start);
}
break;
case TpFloat:
{
Float start = ScalarColumn<Float>(sortab, columns[i])(0);
comps[i] = new CompareIntervalReal<Float>(iterSteps[i], start);
}
break;
case TpDouble:
{
Double start = ScalarColumn<Double>(sortab, columns[i])(0);
comps[i] = new CompareIntervalReal<Double>(iterSteps[i], start);
}
break;
default:
break;
}
}
}
// Iterate over the sorted table (and don't sort again).
iter_p = TableIterator(sortab, columns, comps, orders,
TableIterator::NoSort);
}
TableIterProxy::TableIterProxy (const TableIterProxy& that)
: iter_p (that.iter_p),
firstTime_p (that.firstTime_p)
{}
TableIterProxy::~TableIterProxy()
{}
TableIterProxy& TableIterProxy::operator= (const TableIterProxy& that)
{
if (this != &that) {
iter_p = that.iter_p;
firstTime_p = that.firstTime_p;
}
return *this;
}
Bool TableIterProxy::nextPart (TableProxy& table)
{
// The first iteration is already done by the TableIterator constructor.
if (firstTime_p) {
firstTime_p = False;
} else {
iter_p.next();
}
// Exit when no more subtables.
if (iter_p.pastEnd()) {
return False;
}
table = TableProxy (iter_p.table());
return True;
}
TableProxy TableIterProxy::next()
{
TableProxy tp;
Bool ok = nextPart (tp);
if (ok) {
return tp;
}
throw IterError();
}
void TableIterProxy::reset()
{
iter_p.reset();
firstTime_p = True;
}
} //# NAMESPACE CASACORE - END
|
