/usr/include/casacore/lattices/LatticeMath/LatticeApply.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 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 | //# LatticeApply.cc: Optimally iterate through lattices and apply supplied function
//# Copyright (C) 1997,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: aips2-request@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
//# $Id: LatticeApply.tcc 21563 2015-02-16 07:05:15Z gervandiepen $
#ifndef LATTICES_LATTICEAPPLY_TCC
#define LATTICES_LATTICEAPPLY_TCC
#include <casacore/lattices/Lattices/SubLattice.h>
#include <casacore/lattices/Lattices/LatticeStepper.h>
#include <casacore/lattices/LatticeMath/LineCollapser.h>
#include <casacore/lattices/LatticeMath/TiledCollapser.h>
#include <casacore/lattices/LatticeMath/LatticeProgress.h>
#include <casacore/lattices/Lattices/TiledLineStepper.h>
#include <casacore/lattices/Lattices/TileStepper.h>
#include <casacore/lattices/LatticeMath/LatticeApply.h>
#include <casacore/lattices/Lattices/LatticeIterator.h>
#include <casacore/lattices/LRegions/LatticeRegion.h>
#include <casacore/casa/Arrays/Slicer.h>
#include <casacore/casa/Arrays/IPosition.h>
#include <casacore/casa/Arrays/ArrayPosIter.h>
#include <casacore/casa/Arrays/Vector.h>
#include <casacore/casa/BasicMath/Math.h>
#include <casacore/casa/Utilities/Assert.h>
#include <casacore/casa/Exceptions/Error.h>
#include <casacore/casa/iostream.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
template <class T, class U>
void LatticeApply<T,U>::lineApply (MaskedLattice<U>& latticeOut,
const MaskedLattice<T>& latticeIn,
const LatticeRegion& region,
LineCollapser<T,U>& collapser,
uInt collapseAxis,
LatticeProgress* tellProgress)
{
lineApply (latticeOut, SubLattice<T>(latticeIn, region),
collapser, collapseAxis, tellProgress);
}
template <class T, class U>
void LatticeApply<T,U>::lineMultiApply (PtrBlock<MaskedLattice<U>*>& latticeOut,
const MaskedLattice<T>& latticeIn,
const LatticeRegion& region,
LineCollapser<T,U>& collapser,
uInt collapseAxis,
LatticeProgress* tellProgress)
{
lineMultiApply (latticeOut, SubLattice<T>(latticeIn, region),
collapser, collapseAxis, tellProgress);
}
template <class T, class U>
void LatticeApply<T,U>::tiledApply (MaskedLattice<U>& latticeOut,
const MaskedLattice<T>& latticeIn,
const LatticeRegion& region,
TiledCollapser<T,U>& collapser,
const IPosition& collapseAxes,
Int newOutAxis,
LatticeProgress* tellProgress)
{
tiledApply (latticeOut, SubLattice<T>(latticeIn, region),
collapser, collapseAxes, newOutAxis, tellProgress);
}
template <class T, class U>
void LatticeApply<T,U>::lineApply (MaskedLattice<U>& latticeOut,
const MaskedLattice<T>& latticeIn,
LineCollapser<T,U>& collapser,
uInt collapseAxis,
LatticeProgress* tellProgress)
{
// Make veracity check on input and output lattice
// and work out map to translate input and output axes.
IPosition ioMap = prepare (latticeIn.shape(), latticeOut.shape(),
IPosition(1,collapseAxis), -1);
// Does the input has a mask?
// If not, can the collapser handle a null mask.
Bool useMask = latticeIn.isMasked();
if (!useMask) {
useMask = (! collapser.canHandleNullMask());
}
// Input lines are extracted with the TiledLineStepper.
const IPosition& inShape = latticeIn.shape();
IPosition inTileShape = latticeIn.niceCursorShape();
TiledLineStepper inNav(inShape, inTileShape, collapseAxis);
RO_LatticeIterator<T> inIter(latticeIn, inNav);
const IPosition blc = IPosition(inShape.nelements(), 0);
const IPosition trc = inShape - 1;
const IPosition inc = IPosition(inShape.nelements(), 1);
const IPosition len = inShape;
const uInt outDim = latticeOut.ndim();
IPosition outPos(outDim, 0);
IPosition outShape(outDim, 1);
for (uInt i=0; i<outDim; ++i) {
if (ioMap(i) >= 0) {
outShape(i) = len(ioMap(i));
}
}
// See if the output lattice has a writable pixelmask.
// If so, it will later be used to write the resulting mask to.
Lattice<Bool>* maskOut = 0;
if (latticeOut.hasPixelMask()) {
maskOut = &(latticeOut.pixelMask());
if (! maskOut->isWritable()) {
maskOut = 0;
}
}
// Set the number of expected steps.
// This is the number of lines to process.
// Also give the number of resulting output pixels per line, so the
// collapser can check it.
Int nLine = outShape.product();
Int nResult = latticeOut.shape().product() / nLine;
AlwaysAssert (nResult==1, AipsError);
collapser.init (nResult);
if (tellProgress != 0) tellProgress->init (nLine);
// Iterate through all the lines.
// Per tile the lines (in the collapseAxis direction) are
// assembled into a single array, which is put thereafter.
while (! inIter.atEnd()) {
// Calculate output buffer shape. Has to be done inside the loop
// as the tile shape may not fit integrally into the lattice.
// It takes care of blc, trc, and inc.
IPosition pos = inIter.position();
for (uInt j=0; j<outDim; ++j) {
if (ioMap(j) >= 0) {
uInt i = ioMap(j);
uInt stPos = (pos(j) - blc(j)) % inc(j);
if (stPos != 0) {
stPos = inc(j) - stPos;
}
Int sz = inTileShape(i) - pos(i) % inTileShape(i);
sz = min (sz, 1 + trc(i) - pos(i)) - stPos;
AlwaysAssert (sz > 0, AipsError);
outShape(j) = (sz + inc(i) - 1) / inc(i);
outPos(j) = (pos(i) - blc(i)) / inc(i);
}
}
// cout << outShape << " put at " << outPos << endl;
// Put the collapsed lines into an output buffer
Array<U> array(outShape);
Array<Bool> arrayMask(outShape);
Bool deleteIt, deleteMask;
U* result = array.getStorage (deleteIt);
Bool* resultMask = arrayMask.getStorage (deleteMask);
uInt n = array.nelements() / nResult;
for (uInt i=0; i<n; ++i) {
DebugAssert (! inIter.atEnd(), AipsError);
const IPosition pos (inIter.position());
Vector<Bool> mask;
if (useMask) {
// Casting const away is innocent.
// Remove degenerate axes to get a 1D array.
Array<Bool> tmp;
((MaskedLattice<T>&)latticeIn).getMaskSlice
(tmp, Slicer(pos, inIter.cursorShape()), True);
mask.reference (tmp);
}
collapser.process (result[i], resultMask[i],
inIter.vectorCursor(), mask, pos);
++inIter;
if (tellProgress != 0) tellProgress->nstepsDone (inIter.nsteps());
}
array.putStorage (result, deleteIt);
arrayMask.putStorage (resultMask, deleteMask);
latticeOut.putSlice (array, outPos);
if (maskOut != 0) {
maskOut->putSlice (arrayMask, outPos);
}
}
if (tellProgress != 0) tellProgress->done();
}
template <class T, class U>
void LatticeApply<T,U>::lineMultiApply (PtrBlock<MaskedLattice<U>*>& latticeOut,
const MaskedLattice<T>& latticeIn,
LineCollapser<T,U>& collapser,
uInt collapseAxis,
LatticeProgress* tellProgress)
{
// First verify that all the output lattices have the same shape and tile shape
uInt i;
const uInt nOut = latticeOut.nelements();
AlwaysAssert(nOut > 0, AipsError);
const IPosition shape(latticeOut[0]->shape());
const uInt outDim = shape.nelements();
for (i=1; i<nOut; ++i) {
AlwaysAssert(latticeOut[i]->shape() == shape, AipsError);
}
// Make veracity check on input and first output lattice
// and work out map to translate input and output axes.
IPosition ioMap = prepare (latticeIn.shape(), shape,
IPosition(1,collapseAxis), -1);
// Does the input has a mask?
// If not, can the collapser handle a null mask.
Bool useMask = latticeIn.isMasked();
if (!useMask) {
useMask = (! collapser.canHandleNullMask());
}
// Input lines are extracted with the TiledLineStepper.
const IPosition& inShape = latticeIn.shape();
IPosition inTileShape = latticeIn.niceCursorShape();
TiledLineStepper inNav(inShape, inTileShape, collapseAxis);
RO_LatticeIterator<T> inIter(latticeIn, inNav);
const IPosition blc = IPosition(inShape.nelements(), 0);
const IPosition trc = inShape - 1;
const IPosition inc = IPosition(inShape.nelements(), 1);
const IPosition len = inShape;
IPosition outPos(outDim, 0);
IPosition outShape(outDim, 1);
for (i=0; i<outDim; ++i) {
if (ioMap(i) >= 0) {
outShape(i) = len(ioMap(i));
}
}
// Set the number of expected steps.
// This is the number of lines to process.
// Also give the number of resulting output pixels per line, so the
// collapser can it.
Int nLine = outShape.product();
Int nResult = shape.product() / nLine;
AlwaysAssert (nResult==1, AipsError);
collapser.init (nResult);
if (tellProgress != 0) tellProgress->init (nLine);
// Iterate through all the lines.
// Per tile the lines (in the collapseAxis) direction are
// assembled into a single array, which is put thereafter.
while (!inIter.atEnd()) {
// Calculate output buffer shape. Has to be done inside the loop
// as the tile shape may not fit integrally into the lattice.
// It takes care of blc, trc, and inc.
IPosition pos = inIter.position();
for (uInt j=0; j<outDim; ++j) {
if (ioMap(j) >= 0) {
i = ioMap(j);
uInt stPos = (pos(j) - blc(j)) % inc(j);
if (stPos != 0) {
stPos = inc(j) - stPos;
}
Int sz = inTileShape(i) - pos(i) % inTileShape(i);
sz = min (sz, 1 + trc(i) - pos(i)) - stPos;
AlwaysAssert (sz > 0, AipsError);
outShape(j) = (sz + inc(i) - 1) / inc(i);
outPos(j) = (pos(i) - blc(i)) / inc(i);
}
}
// cout << outShape << " put at " << outPos << endl;
// Put the collapsed lines into the output buffer
// The buffer contains nOut arrays (and is filled that way).
uInt n = outShape.product();
Block<U> block(n*nOut);
Block<Bool> blockMask(n*nOut);
U* data = block.storage();
Bool* dataMask = blockMask.storage();
Vector<U> result(nOut);
Vector<Bool> resultMask(nOut);
for (i=0; i<n; ++i) {
DebugAssert (! inIter.atEnd(), AipsError);
const IPosition pos (inIter.position());
Vector<Bool> mask;
if (useMask) {
// Casting const away is innocent.
// Remove degenerate axes to get a 1D array.
Array<Bool> tmp;
((MaskedLattice<T>&)latticeIn).getMaskSlice
(tmp, Slicer(pos, inIter.cursorShape()), True);
mask.reference (tmp);
}
collapser.multiProcess (result, resultMask,
inIter.vectorCursor(), mask, pos);
DebugAssert (result.nelements() == nOut, AipsError);
U* datap = data+i;
Bool* dataMaskp = dataMask+i;
for (uInt j=0; j<nOut; ++j) {
*datap = result(j);
datap += n;
*dataMaskp = resultMask(j);
dataMaskp += n;
}
++inIter;
if (tellProgress != 0) tellProgress->nstepsDone (inIter.nsteps());
}
// Write the arrays (one in each output lattice).
for (uInt k=0; k<nOut; ++k) {
Array<U> tmp (outShape, data + k*n, SHARE);
latticeOut[k]->putSlice (tmp, outPos);
if (latticeOut[k]->hasPixelMask()) {
Lattice<Bool>& maskOut = latticeOut[k]->pixelMask();
if (maskOut.isWritable()) {
Array<Bool> tmpMask (outShape, dataMask + k*n, SHARE);
maskOut.putSlice (tmpMask, outPos);
}
}
}
}
if (tellProgress != 0) tellProgress->done();
}
template <class T, class U>
void LatticeApply<T,U>::tiledApply (
MaskedLattice<U>& latticeOut,
const MaskedLattice<T>& latticeIn,
TiledCollapser<T,U>& collapser,
const IPosition& collapseAxes,
Int newOutAxis,
LatticeProgress* tellProgress
) {
// Make veracity check on input and first output lattice
// and work out map to translate input and output axes.
uInt i,j;
IPosition ioMap = prepare (
latticeIn.shape(), latticeOut.shape(),
collapseAxes, newOutAxis
);
// Does the input has a mask?
// If not, can the collapser handle a null mask.
Bool useMask = latticeIn.isMasked();
if (!useMask) {
useMask = (! collapser.canHandleNullMask());
}
// The input is traversed using a TileStepper.
const IPosition& inShape = latticeIn.shape();
const uInt inDim = inShape.nelements();
IPosition inTileShape = latticeIn.niceCursorShape(1024*1024);
TileStepper inNav(inShape, inTileShape, collapseAxes);
RO_LatticeIterator<T> inIter(latticeIn, inNav);
// Precalculate various variables.
const IPosition blc = IPosition(inShape.nelements(), 0);
const IPosition trc = inShape - 1;
const IPosition inc = IPosition(inShape.nelements(), 1);
const uInt collDim = collapseAxes.nelements();
const uInt iterDim = inDim - collDim;
IPosition iterAxes(iterDim);
IPosition outShape(latticeOut.shape());
const uInt outDim = outShape.nelements();
j = 0;
for (i=0; i<outDim; ++i) {
if (ioMap(i) >= 0) {
outShape(i) = 1;
iterAxes(j++) = i;
}
}
// Find the first collapse axis which is not immediately after
// the previous collapse axis.
uInt collStart;
for (collStart=1; collStart<collDim; ++collStart) {
if (collapseAxes(collStart) != 1+collapseAxes(collStart-1)) {
break;
}
}
// See if the output lattice has a writable pixelmask.
// If so, it will later be used to write the resulting mask to.
Lattice<Bool>* maskOut = 0;
if (latticeOut.hasPixelMask()) {
maskOut = &(latticeOut.pixelMask());
if (! maskOut->isWritable()) {
maskOut = 0;
}
}
// Set the number of expected steps.
// This is the number of tiles to process.
// Also give the number of resulting output pixels per line, so the
// collapser can check it.
uInt nsteps = 1;
for (j=0; j<inDim; ++j) {
nsteps *= 1 + trc(j)/inTileShape(j) - blc(j)/inTileShape(j);
}
collapser.init (outShape.product());
if (tellProgress != 0) {
tellProgress->init (nsteps);
}
// Determine the axis where the collapsed values are stored in the output.
// This is the first unmapped axis (the first axis when all axes are mapped).
uInt resultAxis = 0;
for (j=0; j<outDim; ++j) {
if (ioMap(j) < 0) {
resultAxis = j;
break;
}
}
// Iterate through all the tiles.
// TileStepper is set up in such a way that the collapse axes are iterated
// fastest. When all collapse axes are handled, thus when the iter axes
// position changes, we have to write that part.
Bool firstTime = True;
IPosition outPos(outDim, 0);
IPosition iterPos(outDim, 0);
while (! inIter.atEnd()) {
// Calculate the size of each chunk of output data.
// Each chunk contains the data of a tile in each IterAxis.
// Determine the index of the first element to take from the cursor.
const Array<T>& iterCursor = inIter.cursor();
// In order to use the pointers-to-array-data below, the array *must*
// be contiguous or the results will in general be incorrect.
// Ditto for the mask
const Array<T>& cursor = iterCursor.contiguousStorage()
? iterCursor : iterCursor.copy();
ThrowIf(
! cursor.contiguousStorage(), "cursor array is not contiguous"
);
const IPosition& cursorShape = cursor.shape();
IPosition pos = inIter.position();
IPosition latPos = pos;
Array<Bool> mask;
if (useMask) {
// Casting const away is innocent.
((MaskedLattice<T>&)latticeIn).getMaskSlice(mask, Slicer(pos, cursorShape));
if (! mask.contiguousStorage()) {
mask = mask.copy();
ThrowIf(
! mask.contiguousStorage(), "mask array is not contiguous"
);
}
}
for (j=0; j<outDim; ++j) {
if (ioMap(j) >= 0) {
uInt axis = ioMap(j);
iterPos(j) = pos(axis);
}
}
if (firstTime || outPos != iterPos) {
if (!firstTime) {
Array<U> result;
Array<Bool> resultMask;
collapser.endAccumulator (result, resultMask, outShape);
latticeOut.putSlice (result, outPos);
if (maskOut != 0) {
maskOut->putSlice (resultMask, outPos);
}
}
firstTime = False;
outPos = iterPos;
uInt64 n1 = 1;
uInt64 n3 = 1;
for (j=0; j<outDim; ++j) {
if (ioMap(j) >= 0) {
outShape(j) = cursorShape(ioMap(j));
if (j < resultAxis) {
n1 *= outShape(j);
}
else {
n3 *= outShape(j);
}
}
}
collapser.initAccumulator (n1, n3);
}
// Put the collapsed lines into an output buffer
// Initialize the cursor position needed in the loop.
IPosition curPos (inDim, 0);
// Determine the increment for the first collapse axes.
// This is done by taking the difference between the adresses of two pixels
// in the cursor (if there are 2 pixels).
IPosition chunkShape (inDim, 1);
for (j=0; j<collStart; ++j) {
const uInt axis = collapseAxes(j);
chunkShape(axis) = cursorShape(axis);
}
uInt nval = chunkShape.product();
const uInt axis = collapseAxes(0);
IPosition p0(inDim, 0);
IPosition p1(inDim, 0);
p1[axis] = 1;
// general for Arrays with contiguous or non-contiguous storage.
uInt dataIncr = &(cursor(p1)) - &(cursor(p0));
uInt maskIncr = useMask ? &(mask(p1)) - &(mask(p0)) : 0;
// Iterate in the outer loop through the iterator axes.
// Iterate in the inner loop through the collapse axes.
uInt index1 = 0;
uInt index3 = 0;
for (;;) {
for (;;) {
if (useMask) {
collapser.process (
index1, index3, &(cursor(curPos)), &(mask(curPos)),
dataIncr, maskIncr, nval, latPos, chunkShape
);
}
else {
collapser.process(
index1, index3,
&(cursor(curPos)), 0,
dataIncr, maskIncr, nval, latPos, chunkShape
);
}
// Increment a collapse axis until all axes are handled.
for (j=collStart; j<collDim; ++j) {
uInt axis = collapseAxes(j);
if (++curPos(axis) < cursorShape(axis)) {
break;
}
curPos(axis) = 0; // restart this axis
}
if (j == collDim) {
break; // all axes are handled
}
}
// Increment an iteration axis until all iteration axes are handled.
for (j=0; j<iterDim; ++j) {
uInt arraxis = iterAxes(j);
uInt axis = ioMap(arraxis);
++latPos(axis);
if (++curPos(axis) < cursorShape(axis)) {
if (arraxis < resultAxis) {
++index1;
}
else {
++index3;
index1 = 0;
}
break;
}
curPos(axis) = 0;
latPos(axis) = pos(axis);
}
if (j == iterDim) {
break;
}
}
++inIter;
if (tellProgress != 0) {
tellProgress->nstepsDone (inIter.nsteps());
}
}
// Write out the last output array.
Array<U> result;
Array<Bool> resultMask;
collapser.endAccumulator (result, resultMask, outShape);
latticeOut.putSlice (result, outPos);
if (maskOut != 0) {
maskOut->putSlice (resultMask, outPos);
}
if (tellProgress != 0) tellProgress->done();
}
template <class T, class U>
IPosition LatticeApply<T,U>::prepare (const IPosition& inShape,
const IPosition& outShape,
const IPosition& collapseAxes,
Int newOutAxis)
{
uInt i;
// Check if the dimensionality of input and output match.
const uInt inDim = inShape.nelements();
const uInt outDim = outShape.nelements();
const uInt collDim = collapseAxes.nelements();
uInt ndim = inDim - collDim;
if (outDim < ndim) {
throw (AipsError ("LatticeApply::prepare - dimensionalities mismatch"));
}
// Check the collapseAxes specification (using the makeAxisPath logic).
// Also check if they are ascending.
IPosition allAxes = IPosition::makeAxisPath (inDim, collapseAxes);
for (i=1; i<collDim; ++i) {
AlwaysAssert (collapseAxes(i) > collapseAxes(i-1), AipsError);
}
// Get the first new output axis (i.e. the axis containing
// the collapsed values). If not given, it is the first axis
// for which input and output length mismatch.
if (newOutAxis < 0) {
newOutAxis = 0;
for (i=collDim; i<inDim; ++i) {
uInt axis = allAxes(i);
if (inShape(axis) != outShape(newOutAxis)) {
break;
}
++newOutAxis;
}
}
if (newOutAxis > Int(ndim)) {
throw (AipsError ("LatticeApply::prepare - newOutAxis too high"));
}
// Make a little map of the input to the output axes.
// ioMap(j) is the axis of the input that goes on output axis j.
// -1 indicates that an output axis is a new axis (containing the
// result of the collapse).
// It checks if the length of axes match for input and output.
IPosition ioMap(outDim, -1);
uInt k=0;
for (i=collDim; i<inDim; ++i) {
uInt axis = allAxes(i);
if (Int(k) == newOutAxis) {
k += outDim-ndim;
}
if (inShape(axis) != outShape(k)) {
throw (AipsError ("LatticeApply::prepare - "
"non-collapsed input and output shape mismatch"));
}
ioMap(k) = axis;
++k;
}
return ioMap;
}
} //# NAMESPACE CASACORE - END
#endif
|