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
|
//# TableIter.cc: Iterate through a Table
//# Copyright (C) 1994,1995,1996,1997,1999,2000
//# 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/TableIter.h>
#include <casacore/tables/Tables/BaseTabIter.h>
#include <casacore/casa/Containers/Block.h>
#include <casacore/casa/BasicSL/String.h>
#include <casacore/tables/Tables/TableError.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
TableIterator::TableIterator()
: tabIterPtr_p (0)
{}
TableIterator::TableIterator (const Table& tab,
const String& key,
Order order,
Option option)
: tabIterPtr_p (0)
{
Block<String> keys(1, key);
Block<Int> ord(1, order);
Block<CountedPtr<BaseCompare> > cmpObj(1);
tabIterPtr_p = tab.baseTablePtr()->makeIterator (keys, cmpObj,
ord, option);
next(); // get first subtable
}
TableIterator::TableIterator (const Table& tab,
const Block<String>& keys,
Order order,
Option option)
: tabIterPtr_p (0)
{
Block<Int> ord(keys.nelements(), order);
Block<CountedPtr<BaseCompare> > cmpObj(keys.nelements());
tabIterPtr_p = tab.baseTablePtr()->makeIterator (keys, cmpObj,
ord, option);
next(); // get first subtable
}
TableIterator::TableIterator (const Table& tab,
const Block<String>& keys,
const Block<Int>& orders,
Option option)
: tabIterPtr_p (0)
{
Block<CountedPtr<BaseCompare> > cmpObj(keys.nelements());
tabIterPtr_p = tab.baseTablePtr()->makeIterator (keys, cmpObj,
orders, option);
next(); // get first subtable
}
TableIterator::TableIterator (const Table& tab,
const Block<String>& keys,
const Block<CountedPtr<BaseCompare> >& cmpObjs,
const Block<Int>& orders,
Option option,
bool cacheIterationBoundaries)
: tabIterPtr_p (0)
{
tabIterPtr_p = tab.baseTablePtr()->makeIterator (keys, cmpObjs,
orders, option,
cacheIterationBoundaries);
next(); // get first subtable
}
TableIterator::TableIterator (const TableIterator& iter)
: tabIterPtr_p (0)
{
operator= (iter);
}
TableIterator& TableIterator::operator= (const TableIterator& iter)
{
delete tabIterPtr_p;
tabIterPtr_p = 0;
subTable_p = Table();
if (iter.tabIterPtr_p != 0) {
tabIterPtr_p = iter.tabIterPtr_p->clone();
subTable_p = iter.table();
next(); // Get first subtable, as in constructor
}
return *this;
}
TableIterator::~TableIterator()
{ delete tabIterPtr_p; }
void TableIterator::reset()
{
tabIterPtr_p->reset();
next();
}
void TableIterator::throwIfNull() const
{
if (isNull()) {
throw (TableInvOper ("TableIterator is null"));
}
}
void TableIterator::next()
{
subTable_p = Table(tabIterPtr_p->next());
}
void
TableIterator::copyState(const TableIterator &other)
{
subTable_p = other.subTable_p;
tabIterPtr_p->copyState(*other.tabIterPtr_p);
}
// Report Name of slowest column that changes at end of current iteration
const String& TableIterator::keyChangeAtLastNext() const
{
return tabIterPtr_p->keyChangeAtLastNext();
}
} //# NAMESPACE CASACORE - END
|
