This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12]
  __GCD< A, B, C > | Greatest common divisor of A and B |
| __GCD< SBigInt< S, N1, Base >, SInt< N2 >, 1 > | |
| __GCD< SBigInt< S2, N2, B2 >, SBigInt< S1, N1, B1 >, 1 > | |
| __GCD< SInt< N2 >, SBigInt< S, N1, Base >, 1 > | |
| __GCD< SInt< N2 >, SInt< N1 >, 1 > | |
| Abs< SBigInt< S, NList, Base > > | Absolute value of a big integer |
| Abs< SInt< N > > | Absolute value of an integer |
| GFFT::AbstractFFT_inp< T > | Abstract interface class to build GFFT object factory |
| NL::Add< NList1, NList2 > | Adds two numlists even then if their lengths are different |
| Add< SInt< N1 >, SInt< N2 > > | Compile-time addition of two integers |
| NL::AddAt< NList, index, Num > | Adds an integer to the element with given index of a numlist |
| NL::AddConst< NList, Num > | Adds a constant integer to all elements of a numlist |
| Align< NList, Base, Rest > | 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 |
| Loki::TL::Append< UnitType, UnitType > | A complement of a class template Loki::TL::Append to handle typelists, which end with UnitType |
| Loki::TL::BitsetSelect< Bitset, TList > | Selects a subset from TList corresponding to the Bitset |
| GFFT::Caller< TList > | Calls member function apply() in every type of the typelist |
| GFFT::Caller< Loki::Typelist< Parall, Alg > > | |
| GFFT::Caller< Tail > | |
| NL::Compare< NList1, NList2 > | Compares elements in the numlist NList1 with NList2 |
| NL::Compare< Abs< N1 >::Result, Abs< N2 >::Result > | |
| GFFT::COMPLEX_DOUBLE | Complex number of double precision type representation |
| GFFT::COMPLEX_FLOAT | Complex number of single precision type representation |
| GFFT::ComputeTwiddles< T, N, S, K > | Twiddle factors computation |
| MF::Cos< B, A, T > | Cosine function |
| GFFT::DecimationGroup | Lists all acceptable decimation versions |
| GFFT::DefineTransform< TList, ID > | Takes types from TList as parameters to define Transform class |
| GFFT::DFT | Forward compex-valued discrete Fourier transform |
| GFFT::DFTk< N, SI, DI, T, S > | Out-of-place DFT |
| GFFT::DFTk< N, LastK *2, 2, T, S > | |
| GFFT::DFTk< N, LastK, 1, Complex< T >, S > | |
| GFFT::DFTk< N, SI, DI, Complex< T >, S > | Out-of-place DFT for "complex" types like std::complex |
| GFFT::DFTk_inp< N, M, T, S > | In-place DFT |
| GFFT::DFTk_inp< 2, M, Complex< T >, S > | |
| GFFT::DFTk_inp< 2, N, T, S > | |
| GFFT::DFTk_inp< 3, M, Complex< T >, S > | |
| GFFT::DFTk_inp< 3, M2, T, S > | |
| GFFT::DFTk_inp< K, M, Complex< T >, S > | |
| GFFT::DFTk_inp< K, M2, T, S > | |
| GFFT::DFTk_inp< N, 1, Complex< T >, S > | |
| GFFT::DFTk_inp< N, 2, T, S > | |
| GFFT::DFTk_inp< N, M, Complex< T >, S > | In-place DFT for "complex" types like std::complex |
| GFFT::DFTk_x_Im_T< K, M, T, S, W, doStaticLoop > | In-place scaled FFT algorithm |
| GFFT::DFTk_x_Im_T< K, M, Complex< T >, S, W1, false > | |
| Div< SInt< N1 >, SInt< N2 > > | Quotient from division of two integers |
| GFFT::DOUBLE | Double precision type representation |
| GFFT::Empty | Abstract empty base class |
| FactoryInit< Loki::Typelist< H, T > > | Object factory initialization class |
| GFFT::FLOAT | Single precision type representation |
| GFFT::GenerateTransform< NList, T, TransType, Dim, Parall, Place > | MAIN CLASS TO USE! Generates a set of transform classes |
| GFFT::GenNumList< Begin, End, Holder > | Generates Typelist with types Holder<N>, N = Begin,...,End |
| GFFT::GenPowerList< PowerBegin, PowerEnd, M > | Generates Typelist with types Holder<N>, N = Begin,...,End |
| GFFT::GFFTswap2< M, P, T, I > | Binary reordering of array elements |
| GFFT::GFFTswap2< 2, P, Complex< T >, I+1 > | |
| GFFT::GFFTswap2< 2, P, T, I+1 > | |
| GFFT::GFFTswap2< M, P, Complex< T >, I+1 > | |
| GFFT::GFFTswap2OMP | Binary reordering parallelized by OpenMP |
| GFFT::IDFT | Inverse compex-valued discrete Fourier transform |
| GFFT::IN_PLACE | In-place algorithm |
| GFFT::INFREQ | Decimation in-frequency |
| GFFT::InFreq< N, NFact, T, S, W1, LastK > | Danielson-Lanczos section of the decimation-in-frequency FFT version |
| GFFT::InFreq< M, NFactNext, T, S, WK, K *LastK > | |
| GFFT::InFreq< N, Loki::Typelist< Head, Tail >, T, S, W1, LastK > | |
| GFFT::InFreq< N, Tail, T, S, W1, LastK > | |
| GFFT::InFreqOMP< NThreads, N, NFact, T, S, W1, LastK, C > | OpenMP parallelized Danielson-Lanczos section of the decimation-in-time FFT version |
| GFFT::InFreqOMP< NThreadsNext, M, NFactNext, T, S, WK, K *LastK > | |
| GFFT::INTIME | Decimation in-time |
| GFFT::InTime< N, NFact, T, S, W1, LastK > | In-place decimation-in-time FFT version |
| GFFT::InTime< M, NFactNext, Complex< T >, S, WK, K *LastK > | |
| GFFT::InTime< M, NFactNext, T, S, WK, K *LastK > | |
| GFFT::InTime< N, Loki::Typelist< Head, Tail >, T, S, W1, LastK > | |
| GFFT::InTime< N, Tail, Complex< T >, S, W1, LastK > | |
| GFFT::InTime< N, Tail, T, S, W1, LastK > | |
| GFFT::InTimeOMP< NThreads, N, NFact, T, S, W1, LastK, C > | OpenMP parallelized Danielson-Lanczos section of the decimation-in-time FFT version |
| GFFT::InTimeOMP< NThreadsNext, M, NFactNext, T, S, WK, K *LastK > | |
| GFFT::InTimeOOP< N, NFact, T, S, W1, LastK > | Out-of-place decimation-in-time FFT version |
| GFFT::InTimeOOP< M, NFactNext, Complex< T >, S, WK, K *LastK > | |
| GFFT::InTimeOOP< M, NFactNext, T, S, WK, K *LastK > | |
| GFFT::InTimeOOP< N, Loki::Typelist< Head, Tail >, T, S, W1, LastK > | |
| GFFT::InTimeOOP< N, Tail, Complex< T >, S, W1, LastK > | |
| GFFT::InTimeOOP< N, Tail, T, S, W1, LastK > | |
| GFFT::IRDFT | Inverse real-valued discrete Fourier transform |
| GFFT::ListGenerator< TList, TLenList, DefTrans, WorkingList, ID > | Generates all different combinations of given parameters |
| NL::Max< NList > | Calculates the maximum value of a numlist |
| NL::Min< NList > | Calculates the minimum value of a numlist |
| Mod< SInt< N1 >, SInt< N2 > > | Reminder from division of two integers |
| NL::Mult< NList1, NList2 > | Multiplies element by element of two numlists even with different lengths |
| Mult< SInt< N1 >, SInt< N2 > > | Compile-time multiplication of two integers |
| Mult< SRational< N1, D1 >, SRational< N2, D2 > > | Multiplication of two compile-time Rationals |
| NL::MultAt< NList, index, Num > | Multiplies an element with given index of a numlist by an integer |
| NL::MultConst< NList, Num > | Multiplies all elements of a numlist by a constant integer |
| Negate< SBigInt< S, NList, Base > > | Compile-time negation of a big integer |
| Negate< SInt< N > > | Compile-time negation of an integer |
| Loki::TL::Next< TList, N, I > | Makes N steps into Typelist recursive structure and returns the next Typelist or Nulltype, if the end has been reached |
| Loki::TL::Next< TList, N > | |
| GFFT::OpenMP< NT > | Transform is parallelized using OpenMP standard |
| GFFT::OUT_OF_PLACE | Out-of-place algorithm |
| GFFT::ParallelizationGroup | Lists all acceptable parallelization methods |
| GFFT::PlaceGroup | Lists in-place and out-of-place FFT algorithms |
| Loki::TL::Print< TList > | Prints a typelist as compiler messages at compile-time |
| GFFT::RDFT | Forward real-valued discrete Fourier transform |
| Loki::TL::Repeat< T, N > | Builds a typelist, which includes type T N times |
| Loki::TL::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> |
| SBigInt< S, NList, B > | Big integer number metacontainer |
| GFFT::Separate< N, T, S > | Reordering of data for real-valued transforms |
| GFFT::Separate< N, Complex< T >, S > | Reordering of data for real-valued transforms |
| GFFT::Serial | Serial (single-core) implementation of transform |
| MF::Sin< B, A, T > | Sine function |
| MF::SinCosSeries< M, N, B, A > | Common series to compile-time calculation of sine and cosine functions |
 SInt< N > | Integer number metacontainer |
| NL::Sort< NList > | Sorts a numlist applying consequent the operation Min |
| GFFT::StaticCaller< TList > | Calls static member function apply() in every type of the typelist |
| NL::Sub< NList1, NList2 > | Subtracts two numlists even then if their lengths are different |
| Sub< SInt< N1 >, SInt< N2 > > | Compile-time subtraction of two integers |
| NL::SubAt< NList, index, Num > | Subtracts an integer to the element with given index of a numlist |
| NL::SubConst< NList, Num > | Subtracts a constant integer to all elements of a numlist |
| NL::Sum< NList > | Computes the sum of elements in a numlist |
| GFFT::SwapNR< M, P, T > | Binary reordering of array elements |
| GFFT::SwapNR< M, P, Complex< T > > | Binary reordering of array elements |
| GFFT::Transform< N, VType, Type, Dim, Parall, Place, FactoryPolicy, IDN > | Generic Fast Fourier transform in-place class |
| GFFT::TransformTypeGroup | Lists all acceptable types of Fast Fourier transform |
| Loki::UnitType | Another empty class, which can also end a typelist |
 GFFT::ValueTypeGroup | Lists all acceptable value types and the default one |
