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
|
//# MArray.h: Class to handle an Array with an optional mask
//# Copyright (C) 2012
//# 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
#ifndef CASA_MARRAY_H
#define CASA_MARRAY_H
//# Includes
#include <casacore/casa/aips.h>
#include <casacore/tables/TaQL/MArrayBase.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
// <summary>
// Class to handle an Array with an optional mask
// </summary>
// <use visibility=local>
// <reviewed reviewer="UNKNOWN" date="before2004/08/25" tests="">
// </reviewed>
// <prerequisite>
//# Classes you should understand before using this one.
// <li> <linkto class=Array>Array</linkto>
// <li> <linkto class=MArrayBase>MArrayBase</linkto>
// </prerequisite>
// <synopsis>
// This class makes it easier to handle arrays with ot without mask.
// The array is always present, but the mask is optional. The mask is
// contained in the non-templated base class MArrayBase and functions
// to operate on the mask are defined there.
// <br> The class is primarily developed for TaQL masked arrays, but
// could be used elsewhere as well.
//
// A mask value True means that the corresponding value is masked off, thus
// not taken into account in reduction functions like <src>sum</src>. This
// is the same as the numpy masked array.
//
// MArrayMath.h contains many functions to operate on MArray objects
// (addition, sin, etc.).
// </synopsis>
template <typename T>
class MArray: public MArrayBase
{
public:
// Default constructor creates a null array.
MArray()
: MArrayBase (True)
{}
// Construct from an array without a mask.
// It references the given array.
explicit MArray (const Array<T>& array)
: MArrayBase (False),
itsArray (array)
{
resizeBase (array, False);
}
// Construct from an array and a mask.
// It references the given arrays.
// <src>isNull=True</src> requires the arrays to be empty.
MArray (const Array<T>& array, const Array<Bool>& mask, Bool isNull=False)
: MArrayBase (array, mask, isNull),
itsArray (array)
{}
// Construct from an array with the mask and null from another MArray.
// It references the given arrays.
// The shapes of both arrays must match.
MArray (const Array<T>& array, const MArrayBase& marray)
: MArrayBase (array, marray),
itsArray (array)
{}
// Construct from two MArrays, one the array, the other the mask.
// If one of them is null, the constructed MArray is null.
MArray (const MArray<T>& array, const MArray<Bool>& mask)
: MArrayBase (array.isNull() || mask.isNull())
{
if (! isNull()) {
itsArray.reference (array.array());
setBase (itsArray, mask.array());
}
}
// Reference another array.
void reference (const MArray<T>& other)
{
itsArray.reference (other.itsArray);
referenceBase (other);
}
// Resize the array and optionally the mask.
// It always sets the MArray to non-null.
void resize (const IPosition& shape, Bool useMask)
{
itsArray.resize (shape);
resizeBase (itsArray, useMask);
}
// Copy the array data and possible mask from another one.
// The shapes do not need to match.
// The array data is copied, but the new mask references the possible
// mask in <src>from</src>.
template <typename U>
void fill (const MArray<U>& from)
{
itsArray.resize (from.shape());
convertArray (itsArray, from.array());
setBase (itsArray, from.mask());
}
// Copy the array from a normal Array. The possible mask is removed.
// The shapes do not need to match.
// The array data is always copied.
template <typename U>
void fill (const Array<U>& from)
{
itsArray.resize (from.shape());
convertArray (itsArray, from);
resizeBase (itsArray, False);
}
// Get access to the array.
// <group>
const Array<T>& array() const
{ return itsArray; }
Array<T>& array()
{ return itsArray; }
// </group>
// Flatten the unmasked elements of the array to a vector.
Vector<T> flatten() const;
// Copy the unmasked elements to the out. The argument <src>size</src>
// gives the size of the output buffer which should be at least the
// size of the array. It returns the nr of unmasked elements.
size_t flatten (T* out, size_t size) const;
// Get a subset of the array.
MArray<T> operator() (const IPosition& start, const IPosition& end,
const IPosition& stride)
{
if (hasMask()) {
return MArray<T> (itsArray(start, end, stride),
mask()(start, end, stride));
}
return MArray<T> (itsArray(start, end, stride));
}
private:
Array<T> itsArray;
};
//# Implement functions.
template<typename T>
Vector<T> MArray<T>::flatten() const
{
Vector<T> vec(nvalid());
// We lie about the size, because we know the buffer has the right size.
flatten (vec.data(), itsArray.size());
return vec;
}
template<typename T>
size_t MArray<T>::flatten (T* out, size_t size) const
{
if (size < itsArray.size()) {
throw ArrayError ("MArray::flatten - size " + std::to_string(size) +
" of output buffer is too small");
}
size_t nr = 0;
if (!hasMask()) {
// No mask, so copy all elements.
Array<T> arr(itsArray.shape(), out, SHARE);
arr = itsArray;
nr = arr.size();
} else {
// Copy only the valid elements.
if (itsArray.contiguousStorage() && mask().contiguousStorage()) {
typename Array<Bool>::const_contiter miter = mask().cbegin();
typename Array<T>::const_contiter iterEnd = itsArray.cend();
for (typename Array<T>::const_contiter iter=itsArray.cbegin();
iter!=iterEnd; ++iter, ++miter) {
if (!*miter) out[nr++] = *iter;
}
} else {
typename Array<Bool>::const_iterator miter = mask().begin();
typename Array<T>::const_iterator iterEnd = itsArray.end();
for (typename Array<T>::const_iterator iter=itsArray.begin();
iter!=iterEnd; ++iter, ++miter) {
if (!*miter) out[nr++] = *iter;
}
}
}
return nr;
}
} //# NAMESPACE CASACORE - END
#endif
|