/usr/include/casacore/scimath/Mathematics/ConstrainedRangeStatistics.h 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 | //# Copyright (C) 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: Array.h 21545 2015-01-22 19:36:35Z gervandiepen $
#ifndef SCIMATH_CONSTRAINEDRANGESTATISTICS_H
#define SCIMATH_CONSTRAINEDRANGESTATISTICS_H
#include <casacore/casa/aips.h>
#include <casacore/scimath/Mathematics/ClassicalStatistics.h>
#include <set>
#include <vector>
#include <utility>
namespace casacore {
// Abstract base class for statistics algorithms which are characterized by
// a range of good values. The range is usually calculated dynamically based on the entire distribution.
template <class AccumType, class DataIterator, class MaskIterator=const Bool*, class WeightsIterator=DataIterator>
class ConstrainedRangeStatistics
: public ClassicalStatistics<CASA_STATP> {
public:
virtual ~ConstrainedRangeStatistics();
// copy semantics
ConstrainedRangeStatistics<CASA_STATP>& operator=(
const ConstrainedRangeStatistics<CASA_STATP>& other
);
// <group>
// In the following group of methods, if the size of the composite dataset
// is smaller than
// <src>binningThreshholdSizeBytes</src>, the composite dataset
// will be (perhaps partially) sorted and persisted in memory during the
// call. In that case, and if <src>persistSortedArray</src> is True, this
// sorted array will remain in memory after the call and will be used on
// subsequent calls of this method when <src>binningThreshholdSizeBytes</src>
// is greater than the size of the composite dataset. If
// <src>persistSortedArray</src> is False, the sorted array will not be
// stored after this call completes and so any subsequent calls for which the
// dataset size is less than <src>binningThreshholdSizeBytes</src>, the
// dataset will be sorted from scratch. Values which are not included due to
// non-unity strides, are not included in any specified ranges, are masked,
// or have associated weights of zero are not considered as dataset members
// for quantile computations.
// If one has a priori information regarding
// the number of points (npts) and/or the minimum and maximum values of the data
// set, these can be supplied to improve performance. Note however, that if these
// values are not correct, the resulting median
// and/or quantile values will also not be correct (although see the following notes regarding
// max/min). Note that if this object has already had getStatistics()
// called, and the min and max were calculated, there is no need to pass these values in
// as they have been stored internally and used (although passing them in shouldn't hurt
// anything). If provided, npts, the number of points falling in the specified ranges which are
// not masked and have weights > 0, should be exactly correct. <src>min</src> can be less than
// the true minimum, and <src>max</src> can be greater than the True maximum, but for best
// performance, these should be as close to the actual min and max as possible.
// In order for quantile computations to occur over multiple datasets, all datasets
// must be available. This means that if setCalculateAsAdded()
// was previously called by passing in a value of True, these methods will throw
// an exception as the previous call indicates that there is no guarantee that
// all datasets will be available. If one uses a data provider (by having called
// setDataProvider()), then this should not be an issue.
// get the median of the distribution.
// For a dataset with an odd number of good points, the median is just the value
// at index int(N/2) in the equivalent sorted dataset, where N is the number of points.
// For a dataset with an even number of points, the median is the mean of the values at
// indices int(N/2)-1 and int(N/2) in the sorted dataset.
AccumType getMedian(
CountedPtr<uInt64> knownNpts=NULL, CountedPtr<AccumType> knownMin=NULL,
CountedPtr<AccumType> knownMax=NULL, uInt binningThreshholdSizeBytes=4096*4096,
Bool persistSortedArray=False, uInt64 nBins=10000
);
// get the median of the absolute deviation about the median of the data.
AccumType getMedianAbsDevMed(
CountedPtr<uInt64> knownNpts=NULL,
CountedPtr<AccumType> knownMin=NULL, CountedPtr<AccumType> knownMax=NULL,
uInt binningThreshholdSizeBytes=4096*4096, Bool persistSortedArray=False,
uInt64 nBins=10000
);
// If one needs to compute both the median and quantile values, it is better to call
// getMedianAndQuantiles() rather than getMedian() and getQuantiles() seperately, as the
// first will scan large data sets fewer times than calling the seperate methods.
// The return value is the median; the quantiles are returned in the <src>quantileToValue</src> map.
AccumType getMedianAndQuantiles(
std::map<Double, AccumType>& quantileToValue, const std::set<Double>& quantiles,
CountedPtr<uInt64> knownNpts=NULL, CountedPtr<AccumType> knownMin=NULL,
CountedPtr<AccumType> knownMax=NULL,
uInt binningThreshholdSizeBytes=4096*4096, Bool persistSortedArray=False,
uInt64 nBins=10000
);
// Get the specified quantiles. <src>quantiles</src> must be between 0 and 1,
// noninclusive.
std::map<Double, AccumType> getQuantiles(
const std::set<Double>& quantiles, CountedPtr<uInt64> knownNpts=NULL,
CountedPtr<AccumType> knownMin=NULL, CountedPtr<AccumType> knownMax=NULL,
uInt binningThreshholdSizeBytes=4096*4096, Bool persistSortedArray=False,
uInt64 nBins=10000
);
// </group>
// get the min and max of the data set
virtual void getMinMax(AccumType& mymin, AccumType& mymax);
// scan the dataset(s) that have been added, and find the number of good points.
// This method may be called even if setStatsToCaclulate has been called and
// NPTS has been excluded. If setCalculateAsAdded(True) has previously been
// called after this object has been (re)initialized, an exception will be thrown.
virtual uInt64 getNPts();
// see base class description
std::pair<Int64, Int64> getStatisticIndex(StatisticsData::STATS stat);
// reset object to initial state. Clears all private fields including data,
// accumulators, global range. It does not affect the fence factor (_f), which was
// set at object construction.
virtual void reset();
protected:
ConstrainedRangeStatistics();
// <group>
// scan through the data set to determine the number of good (unmasked, weight > 0,
// within range) points. The first with no mask, no
// ranges, and no weights is trivial with npts = nr in this class, but is implemented here
// so that derived classes may override it.
inline void _accumNpts(
uInt64& npts,
const DataIterator& dataStart, Int64 nr, uInt dataStride
) const;
void _accumNpts(
uInt64& npts,
const DataIterator& dataStart, Int64 nr, uInt dataStride,
const DataRanges& ranges, Bool isInclude
) const;
void _accumNpts(
uInt64& npts,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride
) const;
void _accumNpts(
uInt64& npts,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride, const DataRanges& ranges,
Bool isInclude
) const;
void _accumNpts(
uInt64& npts,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride
) const;
void _accumNpts(
uInt64& npts,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const DataRanges& ranges, Bool isInclude
) const;
void _accumNpts(
uInt64& npts,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
) const;
void _accumNpts(
uInt64& npts,
const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride
) const;
// </group>
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc,
const vector<AccumType>& maxLimit
) const;
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const DataRanges& ranges, Bool isInclude,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc, const vector<AccumType>& maxLimit
) const;
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc, const vector<AccumType>& maxLimit
) const;
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride, const DataRanges& ranges,
Bool isInclude,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc, const vector<AccumType>& maxLimit
) const;
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc, const vector<AccumType>& maxLimit
) const ;
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const DataRanges& ranges, Bool isInclude,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc, const vector<AccumType>& maxLimit
) const;
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc, const vector<AccumType>& maxLimit
) const;
virtual void _findBins(
vector<vector<uInt64> >& binCounts,
vector<CountedPtr<AccumType> >& sameVal, vector<Bool>& allSame,
const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const vector<typename StatisticsUtilities<AccumType>::BinDesc>& binDesc, const vector<AccumType>& maxLimit
) const;
// </group>
AccumType _getStatistic(StatisticsData::STATS stat);
StatsData<AccumType> _getStatistics();
inline Bool _isInRange(const AccumType& datum) const;
// <group>
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, Int64 nr, uInt dataStride
) const;
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const DataRanges& ranges, Bool isInclude
) const;
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride
) const;
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride, const DataRanges& ranges,
Bool isInclude
) const;
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride
) const;
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const DataRanges& ranges, Bool isInclude
) const;
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
) const;
virtual void _minMax(
CountedPtr<AccumType>& mymin, CountedPtr<AccumType>& mymax,
const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride
) const;
// </group>
//<group>
// populate an unsorted array with valid data. If <src>includeLimits</src> is defined,
// then restrict values that are entered in the array to those limits (inclusive of the
// minimum, exclusive of the maximum). <src>maxCount</src> and <src>currentCount</src> are
// used only if <src>includeLimits</src> is defined. In this case, the method will return
// when currentCount == maxCount, thus avoiding scanning remaining data unnecessarily.
// no weights, no mask, no ranges
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin, Int64 nr, uInt dataStride
) const;
// ranges
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const DataRanges& ranges, Bool isInclude
) const;
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin,
uInt maskStride
) const;
// mask and ranges
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
) const;
// weights
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
const WeightsIterator& weightsBegin, Int64 nr, uInt dataStride
) const;
// weights and ranges
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
const WeightsIterator& weightsBegin, Int64 nr, uInt dataStride,
const DataRanges& ranges, Bool isInclude
) const;
// weights and mask
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
const WeightsIterator& weightBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride
) const;
// weights, mask, ranges
void _populateArray(
vector<AccumType>& ary, const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
) const;
// no weights, no mask, no ranges
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
// ranges
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const DataRanges& ranges, Bool isInclude,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin,
uInt maskStride,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
// mask and ranges
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
// weights
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin,
const WeightsIterator& weightsBegin, Int64 nr, uInt dataStride,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
// weights and ranges
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin,
const WeightsIterator& weightsBegin, Int64 nr, uInt dataStride,
const DataRanges& ranges, Bool isInclude,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
// weights and mask
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin,
const WeightsIterator& weightBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
// weights, mask, ranges
virtual void _populateArrays(
vector<vector<AccumType> >& arys, uInt64& currentCount, const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude,
const vector<std::pair<AccumType, AccumType> > &includeLimits, uInt64 maxCount
) const;
// </group>
// <group>
// no weights, no mask, no ranges
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
Int64 nr, uInt dataStride, uInt maxElements
) const;
// ranges
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const DataRanges& ranges, Bool isInclude,
uInt maxElements
) const;
// mask
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin,
uInt maskStride, uInt maxElements
) const;
// mask and ranges
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude, uInt maxElements
) const;
// weights
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
const WeightsIterator& weightBegin, Int64 nr, uInt dataStride,
uInt maxElements
) const;
// weights and ranges
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
const WeightsIterator& weightsBegin, Int64 nr, uInt dataStride,
const DataRanges& ranges, Bool isInclude, uInt maxElements
) const;
// weights and mask
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin,
const WeightsIterator& weightBegin, Int64 nr,
uInt dataStride, const MaskIterator& maskBegin,
uInt maskStride, uInt maxElements
) const;
// weights, mask, ranges
Bool _populateTestArray(
vector<AccumType>& ary, const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude,
uInt maxElements
) const;
// </group>
inline void _setRange(CountedPtr<std::pair<AccumType, AccumType> > r) { this->_clearStats(); _range = r; }
// derived classes need to implement how to set their respective range
virtual void _setRange() = 0;
/*
// <group>
// no weights, no mask, no ranges
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, AccumType& mymin,
AccumType& mymax, Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, Int64 nr, uInt dataStride
);
// no weights, no mask
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, AccumType& mymin,
AccumType& mymax, Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const DataRanges& ranges, Bool isInclude
);
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, AccumType& mymin,
AccumType& mymax, Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride
);
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, AccumType& mymin,
AccumType& mymax, Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, Int64 nr, uInt dataStride,
const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
);
// </group>
// <group>
// has weights, but no mask, no ranges
void _weightedStats(
StatsData<AccumType>& stats, AccumType& mymin, AccumType& mymax,
Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride
);
void _weightedStats(
StatsData<AccumType>& stats, AccumType& mymin, AccumType& mymax,
Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const DataRanges& ranges, Bool isInclude
);
void _weightedStats(
StatsData<AccumType>& stats, AccumType& mymin, AccumType& mymax,
Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride
);
void _weightedStats(
StatsData<AccumType>& stats, AccumType& mymin, AccumType& mymax,
Int64& minpos, Int64& maxpos,
const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
);
// </group>
*/
// <group>
// no weights, no mask, no ranges
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, /* AccumType& mymin,
AccumType& mymax, LocationType& minpos, LocationType& maxpos, */
LocationType& location, const DataIterator& dataBegin, Int64 nr,
uInt dataStride
);
// no weights, no mask
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, /* AccumType& mymin,
AccumType& mymax, LocationType& minpos, LocationType& maxpos, */
LocationType& location, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const DataRanges& ranges, Bool isInclude
);
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, /* AccumType& mymin,
AccumType& mymax, LocationType& minpos, LocationType& maxpos, */
LocationType& location, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const MaskIterator& maskBegin, uInt maskStride
);
void _unweightedStats(
StatsData<AccumType>& stats, uInt64& ngood, /* AccumType& mymin,
AccumType& mymax, LocationType& minpos, LocationType& maxpos, */
LocationType& location, const DataIterator& dataBegin, Int64 nr,
uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
);
// </group>
// <group>
// has weights, but no mask, no ranges
void _weightedStats(
StatsData<AccumType>& stats, /* AccumType& mymin, AccumType& mymax,
LocationType& minpos, LocationType& maxpos, */LocationType& location,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride
);
void _weightedStats(
StatsData<AccumType>& stats, /* AccumType& mymin, AccumType& mymax,
LocationType& minpos, LocationType& maxpos, */ LocationType& location,
const DataIterator& dataBegin, const WeightsIterator& weightsBegin,
Int64 nr, uInt dataStride, const DataRanges& ranges, Bool isInclude
);
void _weightedStats(
StatsData<AccumType>& stats, /* AccumType& mymin, AccumType& mymax,
LocationType& minpos, LocationType& maxpos, */ LocationType& location,
const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride
);
void _weightedStats(
StatsData<AccumType>& stats, /* AccumType& mymin, AccumType& mymax,
LocationType& minpos, LocationType& maxpos, */ LocationType& location,
const DataIterator& dataBegin, const WeightsIterator& weightBegin,
Int64 nr, uInt dataStride, const MaskIterator& maskBegin, uInt maskStride,
const DataRanges& ranges, Bool isInclude
);
// </group>
private:
CountedPtr<std::pair<AccumType, AccumType> > _range;
Bool _doMedAbsDevMed;
};
}
#ifndef CASACORE_NO_AUTO_TEMPLATES
#include <casacore/scimath/Mathematics/ConstrainedRangeStatistics.tcc>
#endif
#endif
|