source: branches/Release2.1.1/src/MathUtils2.cpp@ 2937

Last change on this file since 2937 was 1033, checked in by mar637, 19 years ago

Fix for Ticket #33; was confusing mask and flag again. == flag svn diff ../python/scantable.py!

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 3.2 KB
Line 
1//#---------------------------------------------------------------------------
2//# MathUtilities.cc: General math operations
3//#---------------------------------------------------------------------------
4//# Copyright (C) 2004
5//# ATNF
6//#
7//# This program is free software; you can redistribute it and/or modify it
8//# under the terms of the GNU General Public License as published by the Free
9//# Software Foundation; either version 2 of the License, or (at your option)
10//# any later version.
11//#
12//# This program is distributed in the hope that it will be useful, but
13//# WITHOUT ANY WARRANTY; without even the implied warranty of
14//# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
15//# Public License for more details.
16//#
17//# You should have received a copy of the GNU General Public License along
18//# with this program; if not, write to the Free Software Foundation, Inc.,
19//# 675 Massachusetts Ave, Cambridge, MA 02139, USA.
20//#
21//# Correspondence concerning this software should be addressed as follows:
22//# Internet email: Malte.Marquarding@csiro.au
23//# Postal address: Malte Marquarding,
24//# Australia Telescope National Facility,
25//# P.O. Box 76,
26//# Epping, NSW, 2121,
27//# AUSTRALIA
28//#
29//# $Id:$
30//#---------------------------------------------------------------------------
31
32#include <casa/aips.h>
33#include <casa/Arrays/Array.h>
34#include <casa/Arrays/ArrayIter.h>
35#include <casa/Arrays/Vector.h>
36#include <casa/Arrays/VectorSTLIterator.h>
37
38#include "MathUtils.h"
39
40using namespace casa;
41
42template <class T>
43void mathutil::hanning(Vector<T>& out, Vector<Bool>& outmask,
44 const Vector<T>& in, const Vector<Bool>& mask,
45 Bool relaxed, Bool ignoreOther) {
46 Vector< Vector<T> > weights(8);
47 Vector<Float> vals(3);
48 vals = 0.0;weights[0] = vals;// FFF
49 vals[0] = 1.0; vals[1] = 0.0; vals[2] = 0.0; weights[1] = vals;// TFF
50 vals[0] = 0.0; vals[1] = 1.0; vals[2] = 0.0; weights[2] = vals;// FTF
51 vals[0] = 1.0/3.0; vals[1] = 2.0/3.0; vals[2] = 0.0; weights[3] = vals;// TTF
52 vals[0] = 0.0; vals[1] = 0.0; vals[2] = 1.0;weights[4] = vals;// FFT
53 vals[0] = 0.5; vals[1] = 0.0; vals[2] = 0.5; weights[5] = vals;// TFT
54 vals[0] = 0.0; vals[1] = 2.0/3.0; vals[2] = 1.0/3.0; weights[6] = vals;// FTT
55 vals[0] = 0.25; vals[1] = 0.5; vals[2] = 0.25; weights[7] = vals;// TTT
56 // Chris' case
57 Vector<Bool> weighted(8);
58 if (relaxed) {
59 weighted = False;
60 weighted[7] = True;
61
62 } else {
63 weighted = True;
64 weighted[0] = False;
65 }
66
67 out.resize(in.nelements());
68 outmask.resize(mask.nelements());
69 // make special case for first and last
70 /// ...here
71 // loop from 1..n-2
72 out.resize(in.nelements());
73 out[0] = in[0];out[out.nelements()-1] = in[in.nelements()-1];
74 outmask.resize(mask.nelements());
75 outmask = False;
76 uInt m;Vector<T>* w;
77 for (uInt i=1; i < out.nelements()-1;++i) {
78 m = mask[i-1] + 2*mask[i] + 4*mask[i+1];
79 w = &(weights[m]);
80 if (weighted[m]) {
81 out[i] = (*w)[0]*in[i-1] + (*w)[1]*in[i] + (*w)[2]*in[i+1];
82 outmask[i] = True;
83 } else { // mask it
84 out[i] = in[i];//use arbitrary value
85 outmask[i] = False;
86 }
87 }
88}
Note: See TracBrowser for help on using the repository browser.