/usr/include/casacore/casa/Arrays/Cube.tcc is in casacore-dev 2.2.0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | //# Cube.cc: A 3-D Specialization of the Array Class
//# Copyright (C) 1993,1994,1995,1996,1997,1998,1999,2000,2001,2002,2003
//# 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$
#ifndef CASA_CUBE_TCC
#define CASA_CUBE_TCC
#include <casacore/casa/Arrays/Cube.h>
#include <casacore/casa/Arrays/Matrix.h>
#include <casacore/casa/Arrays/Slice.h>
#include <casacore/casa/Arrays/MaskedArray.h>
#include <casacore/casa/Arrays/ArrayError.h>
#include <casacore/casa/Utilities/Assert.h>
#include <casacore/casa/iostream.h>
namespace casacore { //#Begin casa namespace
template<class T> Cube<T>::Cube()
: Array<T>(IPosition(3, 0))
{
makeIndexingConstants();
DebugAssert(ok(), ArrayError);
}
template<class T> Cube<T>::Cube(size_t l1, size_t l2, size_t l3)
: Array<T>(IPosition(3, l1, l2, l3))
{
makeIndexingConstants();
DebugAssert(ok(), ArrayError);
}
template<class T> Cube<T>::Cube(size_t l1, size_t l2, size_t l3, ArrayInitPolicy initPolicy)
: Array<T>(IPosition(3, l1, l2, l3), initPolicy)
{
makeIndexingConstants();
DebugAssert(ok(), ArrayError);
}
template<class T> Cube<T>::Cube(size_t l1, size_t l2, size_t l3,
const T &initialValue)
: Array<T>(IPosition(3, l1, l2, l3), initialValue)
{
makeIndexingConstants();
DebugAssert(ok(), ArrayError);
}
template<class T> Cube<T>::Cube(const IPosition &len)
: Array<T>(len)
{
makeIndexingConstants();
AlwaysAssert(len.nelements() == 3, ArrayError);
}
template<class T> Cube<T>::Cube(const IPosition &len, ArrayInitPolicy initPolicy)
: Array<T>(len, initPolicy)
{
makeIndexingConstants();
AlwaysAssert(len.nelements() == 3, ArrayError);
}
template<class T> Cube<T>::Cube(const IPosition &len, const T &initialValue)
: Array<T>(len, initialValue)
{
makeIndexingConstants();
AlwaysAssert(len.nelements() == 3, ArrayError);
}
template<class T> Cube<T>::Cube(const Cube<T> &other)
: Array<T>(other),
xinc_p (other.xinc_p),
yinc_p (other.yinc_p),
zinc_p (other.zinc_p)
{
DebugAssert(ok(), ArrayError);
}
// <thrown>
// <item> ArrayNDimError
// </thrown>
template<class T> Cube<T>::Cube(const Array<T> &other)
: Array<T>(other)
{
this->checkCubeShape();
makeIndexingConstants();
DebugAssert(ok(), ArrayError);
}
template<class T> Cube<T>::~Cube()
{}
template<class T> void Cube<T>::resize()
{
resize (IPosition(3,0));
}
template<class T> void Cube<T>::resize(const IPosition &len, Bool copyValues, ArrayInitPolicy policy)
{
DebugAssert(ok(), ArrayError);
if (len.nelements() != 3)
throw(ArrayConformanceError("Cube<T>::resize() - attempt to form "
"non-Cube"));
Array<T>::resize(len, copyValues, policy);
makeIndexingConstants();
}
template<class T> void Cube<T>::resize(size_t nx, size_t ny, size_t nz,
Bool copyValues, ArrayInitPolicy policy)
{
DebugAssert(ok(), ArrayError);
IPosition l(3);
l(0) = nx; l(1) = ny; l(2) = nz;
Cube<T>::resize(l, copyValues, policy);
}
// <thrown>
// <item> ArrayNDimError
// </thrown>
template<class T> void Cube<T>::assign (const Array<T>& other)
{
DebugAssert(ok(), ArrayError);
if (other.ndim() != 3)
throw(ArrayNDimError(3, other.ndim(), "Cube<T>::assign()"
" - attempt to assign from non-cube"));
Array<T>::assign (other);
}
// <thrown>
// <item> ArrayNDimError
// </thrown>
template<class T> void Cube<T>::reference(const Array<T> &other)
{
DebugAssert(ok(), ArrayError);
if (other.ndim() != 3)
throw(ArrayNDimError(3, other.ndim(), "Cube<T>::reference()"
" - attempt to reference non-Cube"));
Array<T>::reference(other);
makeIndexingConstants();
}
template<class T> Cube<T> &Cube<T>::operator=(const Cube<T> &other)
{
DebugAssert(ok(), ArrayError);
if (this == &other)
return *this;
Bool Conform = this->conform(other);
Array<T>::operator=(other);
if (!Conform) {
makeIndexingConstants();
}
return *this;
}
template<class T> Array<T> &Cube<T>::operator=(const Array<T> &a)
{
DebugAssert(ok(), ArrayError);
if (a.ndim() == 3) {
Bool Conform = this->conform(a);
Array<T>::operator=(a);
if (!Conform) {
makeIndexingConstants();
}
} else {
// This might work if a.ndim == 1 or 2
Cube<T> tmp(a);
(*this) = tmp;
}
return *this;
}
// <thrown>
// <item> ArrayError
// </thrown>
template<class T> Cube<T> Cube<T>::operator()(const Slice &sliceX,
const Slice &sliceY,
const Slice &sliceZ)
{
DebugAssert(ok(), ArrayError);
Int64 b1, l1, s1, b2, l2, s2, b3,s3,l3; // begin length step
if (sliceX.all()) {
b1 = 0;
l1 = this->length_p(0);
s1 = 1;
} else {
b1 = sliceX.start();
l1 = sliceX.length();
s1 = sliceX.inc();
}
if (sliceY.all()) {
b2 = 0;
l2 = this->length_p(1);
s2 = 1;
} else {
b2 = sliceY.start();
l2 = sliceY.length();
s2 = sliceY.inc();
}
if (sliceZ.all()) {
b3 = 0;
l3 = this->length_p(2);
s3 = 1;
} else {
b3 = sliceZ.start();
l3 = sliceZ.length();
s3 = sliceZ.inc();
}
// Check that the selected slice is valid
if (s1 < 1 || s2 < 1 || s3 < 1) {
throw(ArrayError("Cube<T>::operator()(Slice,Slice,Slice) : step < 1"));
} else if (l1 < 0 || l2 < 0 || l3 < 0) {
throw(ArrayError("Cube<T>::operator()(Slice,Slice,Slice): length < 0"));
} else if ((b1+(l1-1)*s1 >= this->length_p(0)) ||
(b2+(l2-1)*s2 >= this->length_p(1)) ||
(b3+(l3-1)*s3 >= this->length_p(2))) {
throw(ArrayError("Cube<T>::operator()(Slice,Slice,Slice) : "
"Desired slice extends beyond the end of the array"));
} else if (b1 < 0 || b2 < 0 || b3 < 0) {
throw(ArrayError("Cube<T>::operator()(Slice,Slice,Slice) : "
"start of slice before beginning of cube"));
}
// For simplicity, just use the Array<T> slicing. If this is found to be
// a performance drag, we could special case this as we do for Vector.
IPosition blc(3,b1,b2,b3);
IPosition trc(3,b1+(l1-1)*s1,b2+(l2-1)*s2,b3+(l3-1)*s3);
IPosition incr(3,s1,s2,s3);
return this->operator()(blc,trc,incr);
}
template<class T> const Cube<T> Cube<T>::operator()
(const Slice &sliceX, const Slice &sliceY, const Slice &sliceZ) const
{
return const_cast<Cube<T>*>(this)->operator() (sliceX, sliceY, sliceZ);
}
template<class T> void Cube<T>::makeIndexingConstants()
{
// No lAssert since the Cube often isn't constructed yet when
// calling this
xinc_p = this->inc_p(0);
yinc_p = this->inc_p(1)*this->originalLength_p(0);
zinc_p = this->inc_p(2)*this->originalLength_p(0)*this->originalLength_p(1);
}
template<class T>
void Cube<T>::doNonDegenerate (const Array<T> &other,
const IPosition &ignoreAxes)
{
Array<T> tmp(*this);
tmp.nonDegenerate (other, ignoreAxes);
if (tmp.ndim() != 1) {
throw (ArrayError ("Cube::nonDegenerate (other, ignoreAxes) - "
"removing degenerate axes from other "
"does not result in cube"));
}
reference (tmp);
}
// <thrown>
// <item> ArrayConformanceError
// </thrown>
template<class T> Matrix<T> Cube<T>::xyPlane(size_t which)
{
DebugAssert(ok(), ArrayError);
if (Int64(which) >= this->length_p(2)) {
throw(ArrayConformanceError("Cube<T>::xyPlane - plane > end"));
}
Cube<T> tmp((*this)(Slice(), Slice(), which));
tmp.ndimen_p = 2;
tmp.length_p.resize (2);
tmp.inc_p.resize (2);
tmp.originalLength_p.resize (2);
tmp.makeSteps();
return tmp; // should match Matrix<T>(const Array<T> &)
}
template<class T> const Matrix<T> Cube<T>::xyPlane(size_t which) const
{
Cube<T> *This = const_cast<Cube<T>*>(this);
// Cast away constness, but the return type is a const Matrix<T>, so
// this should still be safe.
return This->xyPlane(which);
}
template<class T> Matrix<T> Cube<T>::xzPlane(size_t which)
{
DebugAssert(ok(), ArrayError);
if (Int64(which) >= this->length_p(1)) {
throw(ArrayConformanceError("Cube<T>::xzPlane - plane > end"));
}
Cube<T> tmp((*this)(Slice(), which, Slice()));
// Keep axes 0 and 2, even if they have length 1.
return tmp.nonDegenerate(IPosition(2,0,2));
}
template<class T> const Matrix<T> Cube<T>::xzPlane(size_t which) const
{
Cube<T> *This = const_cast<Cube<T>*>(this);
// Cast away constness, but the return type is a const Matrix<T>, so
// this should still be safe.
cout << "test" << endl;
return This->xzPlane(which);
}
template<class T> Matrix<T> Cube<T>::yzPlane(size_t which)
{
DebugAssert(ok(), ArrayError);
if (Int64(which) >= this->length_p(0)) {
throw(ArrayConformanceError("Cube<T>::yzPlane - plane > end"));
}
Cube<T> tmp((*this)(which, Slice(), Slice()));
// Keep axes 1 and 2, even if they have length 1.
return tmp.nonDegenerate(IPosition(2,1,2));
}
template<class T> const Matrix<T> Cube<T>::yzPlane(size_t which) const
{
Cube<T> *This = const_cast<Cube<T>*>(this);
// Cast away constness, but the return type is a const Matrix<T>, so
// this should still be safe.
return This->yzPlane(which);
}
template<class T> Bool Cube<T>::ok() const
{
return ( (this->ndim() == 3) ? (Array<T>::ok()) : False );
}
template<class T>
Cube<T>::Cube(const IPosition &shape, T *storage,
StorageInitPolicy policy)
: Array<T>(shape, storage, policy)
{
AlwaysAssert(shape.nelements() == 3, ArrayError);
makeIndexingConstants();
}
template<class T>
Cube<T>::Cube(const IPosition &shape, T *storage,
StorageInitPolicy policy, AbstractAllocator<T> const &allocator)
: Array<T>(shape, storage, policy, allocator)
{
AlwaysAssert(shape.nelements() == 3, ArrayError);
makeIndexingConstants();
}
template<class T>
Cube<T>::Cube(const IPosition &shape, const T *storage)
: Array<T>(shape, storage)
{
AlwaysAssert(shape.nelements() == 3, ArrayError);
makeIndexingConstants();
}
template<class T>
void Cube<T>::preTakeStorage(const IPosition &shape)
{
Array<T>::preTakeStorage(shape);
AlwaysAssert(shape.nelements() == 3, ArrayError);
}
template<class T>
void Cube<T>::postTakeStorage()
{
Array<T>::postTakeStorage();
makeIndexingConstants();
}
} //#End casa namespace
#endif
|