Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

GFFT	Main namespace
DFTk_x_Im_T	In-place scaled FFT algorithm
InTime	In-place decimation-in-time FFT version
InTimeOOP	Out-of-place decimation-in-time FFT version
InFreq	Danielson-Lanczos section of the decimation-in-frequency FFT version
Caller	Calls member function apply() in every type of the typelist
StaticCaller	Calls static member function apply() in every type of the typelist
Transform	Generic Fast Fourier transform in-place class
DefineTransform	Takes types from TList as parameters to define Transform class
GenerateTransform	MAIN CLASS TO USE! Generates a set of transform classes
InTimeOMP	OpenMP parallelized Danielson-Lanczos section of the decimation-in-time FFT version
InFreqOMP	OpenMP parallelized Danielson-Lanczos section of the decimation-in-time FFT version
ValueTypeGroup	Lists all acceptable value types and the default one
TransformTypeGroup	Lists all acceptable types of Fast Fourier transform
ParallelizationGroup	Lists all acceptable parallelization methods
DecimationGroup	Lists all acceptable decimation versions
PlaceGroup	Lists in-place and out-of-place FFT algorithms
AbstractFFT_inp	Abstract interface class to build GFFT object factory
Empty	Abstract empty base class
DOUBLE	Double precision type representation
FLOAT	Single precision type representation
COMPLEX_DOUBLE	Complex number of double precision type representation
COMPLEX_FLOAT	Complex number of single precision type representation
INTIME	Decimation in-time
INFREQ	Decimation in-frequency
IN_PLACE	In-place algorithm
OUT_OF_PLACE	Out-of-place algorithm
DFT	Forward compex-valued discrete Fourier transform
IDFT	Inverse compex-valued discrete Fourier transform
RDFT	Forward real-valued discrete Fourier transform
IRDFT	Inverse real-valued discrete Fourier transform
Serial	Serial (single-core) implementation of transform
OpenMP	Transform is parallelized using OpenMP standard
ComputeTwiddles	Twiddle factors computation
DFTk_inp	In-place DFT
DFTk	Out-of-place DFT
DFTk_inp< N, M, Complex< T >, S >	In-place DFT for "complex" types like std::complex
DFTk< N, SI, DI, Complex< T >, S >	Out-of-place DFT for "complex" types like std::complex
SwapNR	Binary reordering of array elements
GFFTswap2	Binary reordering of array elements
SwapNR< M, P, Complex< T > >	Binary reordering of array elements
Separate	Reordering of data for real-valued transforms
Separate< N, Complex< T >, S >	Reordering of data for real-valued transforms
ListGenerator	Generates all different combinations of given parameters
GenNumList	Generates Typelist with types Holder<N>, N = Begin,...,End
GenPowerList	Generates Typelist with types Holder<N>, N = Begin,...,End
GFFTswap2OMP	Binary reordering parallelized by OpenMP
Loki
TL
Append< UnitType, UnitType >	A complement of a class template Loki::TL::Append to handle typelists, which end with UnitType
Replace< Typelist< T, Tail >, T, Typelist< Head1, Tail1 > >	A complement of a class template Loki::TL::Replace, which substitutes Typelist<Head1,Tail1> instead of the type T in Typelist<T, Tail>
Repeat	Builds a typelist, which includes type T N times
Print	Prints a typelist as compiler messages at compile-time
Next	Makes N steps into Typelist recursive structure and returns the next Typelist or Nulltype, if the end has been reached
BitsetSelect	Selects a subset from TList corresponding to the Bitset
UnitType	Another empty class, which can also end a typelist
MF	Metafunctions template classes
SinCosSeries	Common series to compile-time calculation of sine and cosine functions
Sin	Sine function
Cos	Cosine function
NL
Max	Calculates the maximum value of a numlist
Min	Calculates the minimum value of a numlist
AddConst	Adds a constant integer to all elements of a numlist
AddAt	Adds an integer to the element with given index of a numlist
Add	Adds two numlists even then if their lengths are different
SubConst	Subtracts a constant integer to all elements of a numlist
SubAt	Subtracts an integer to the element with given index of a numlist
Sub	Subtracts two numlists even then if their lengths are different
MultConst	Multiplies all elements of a numlist by a constant integer
MultAt	Multiplies an element with given index of a numlist by an integer
Mult	Multiplies element by element of two numlists even with different lengths
Sum	Computes the sum of elements in a numlist
Compare	Compares elements in the numlist NList1 with NList2
Sort	Sorts a numlist applying consequent the operation Min
__GCD	Greatest common divisor of A and B
Abs< SBigInt< S, NList, Base > >	Absolute value of a big integer
Abs< SInt< N > >	Absolute value of an integer
Add< SInt< N1 >, SInt< N2 > >	Compile-time addition of two integers
Align	Division of every element in NList by Base. Reminder is assigned to a digit and quotient is added to a higher digit. This common operation is needed after addition and multiplication of big integers
Div< SInt< N1 >, SInt< N2 > >	Quotient from division of two integers
FactoryInit< Loki::Typelist< H, T > >	Object factory initialization class
Mod< SInt< N1 >, SInt< N2 > >	Reminder from division of two integers
Mult< SInt< N1 >, SInt< N2 > >	Compile-time multiplication of two integers
Mult< SRational< N1, D1 >, SRational< N2, D2 > >	Multiplication of two compile-time Rationals
Negate< SBigInt< S, NList, Base > >	Compile-time negation of a big integer
Negate< SInt< N > >	Compile-time negation of an integer
SBigInt	Big integer number metacontainer
SInt	Integer number metacontainer
SIntID	Static unsigned integer class holder with additional definition of ID
Sub< SInt< N1 >, SInt< N2 > >	Compile-time subtraction of two integers