/usr/include/CLAM/TabFunct.hxx is in libclam-dev 1.4.0-6.
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 | /*
* Copyright (c) 2001-2004 MUSIC TECHNOLOGY GROUP (MTG)
* UNIVERSITAT POMPEU FABRA
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef __TABFUNCT__
#define __TABFUNCT__
#include "DataTypes.hxx"
#include "Assert.hxx"
#include <vector>
using std::vector;
namespace CLAM
{
/**
* Precalculated (tabulated) functor, for dealing with efficient version of
* expensive functions (with its associated cost in space and precision).
* The original function is passed as the template argument, requiring from
* the template, the same operator interface as the one that TabFunct offers:
* TData operator() (const TData).
*
* The only constructor available takes three parameters : table size, lower bound
* and upper bound.
*
*/
template <class OriginalFunction> class TabFunct : public OriginalFunction
{
private:
TabFunct() {};
public:
TData operator() (const TData arg) {
CLAM_DEBUG_ASSERT(arg>=mLowerBound && arg<=mUpperBound, "Tablulated functor argument out of bound");
int index = int((arg-mLowerBound) / mIncr);
CLAM_DEBUG_ASSERT(index<=mTableSize-2, "Bad index calculation");
TData x1 = mLowerBound+mIncr*index;
TData yIncr = mTable[index+1]-mTable[index];
return mTable[index] + ((arg-x1) * yIncr) * mInvIncr;
}
// constructor
TabFunct(const unsigned tableSize, const TData lowerBound, const TData upperBound) :
mLowerBound(lowerBound),
mUpperBound(upperBound),
mTableSize(tableSize)
{
CLAM_ASSERT(tableSize>=2, "Tabulating a function with less than 2 points.");
CLAM_ASSERT(lowerBound < upperBound, "No interval left to calculate values");
CalculateTable();
}
private:
void CalculateTable()
{
mTable.reserve(mTableSize);
mIncr = (mUpperBound - mLowerBound) / (mTableSize-1);
mInvIncr = 1/mIncr;
TData arg = mLowerBound;
for (int i=0; i<=mTableSize-1; arg+=mIncr, i++)
mTable[i] = OriginalFunction::operator() (arg);
}
// internal table
vector<TData> mTable;
TData mLowerBound;
TData mUpperBound;
unsigned mTableSize;
TData mIncr, mInvIncr;
};
} //namespace
#endif // TabFunct.hxx
|