 ltl | |
  ltl | |
   LTLException | Exception indicating problems with LTL |
   IOException | Exception indicating problems with ASCII I/O |
   RangeException | Exception for ltl::MArray<T ,N> range check errors |
   FitsException | Exception indicating problems with FITS I/O |
   LinearAlgebraException | Exception indicating problems within Linear Algebra |
   SingularMatrixException | Exception indicating a singular Matrix |
   DivergenceException | Exception indicating a divergent iterative algorithm |
   __ltl_type_name | |
   __ltl_type_name< char > | |
   __ltl_type_name< short > | |
   __ltl_type_name< int > | |
   __ltl_type_name< long > | |
   __ltl_type_name< unsigned char > | |
   __ltl_type_name< unsigned short > | |
   __ltl_type_name< unsigned int > | |
   __ltl_type_name< unsigned long > | |
   __ltl_type_name< float > | |
   __ltl_type_name< double > | |
   __ltl_type_name< long double > | |
   __ltl_type_name< std::complex< float > > | |
   __ltl_type_name< std::complex< double > > | |
   __ltl_type_name< std::complex< long double > > | |
   FVector | Vector whose length is known at compile time |
   ListInitializer | |
   ListInitializationSwitch | |
   FVMemory | Memory and data access interface for ltl::FVMemory |
   FVMemory< T, N, 0 > | |
   fviter_end_tag | |
   FVIterConst | |
   FVIterConst< T, N, 0 > | |
   FVIter | |
   FVIter< T, N, 0 > | |
   _et_fvector_parse_base | Just to keep everything together in class browsers .. |
   FVExprBinopNode | Binary operation node |
   FVExprUnopNode | Unary operation node |
   FVExprLiteralNode | Literal number |
   FVExprNode | The expression class itself |
   asFVExpr | We need a trait class to deal with literals |
   asFVExpr< FVExprNode< T, N > > | Already an expression template term |
   asFVExpr< FVector< T, N, S > > | An array operand |
   tNLoop | Template loop: |
   tFVSplitLoop | Wrapper to decide whether template loop is ok or simple C-loop does better |
   tFVLoop | |
   tFVSplitLoop< A, B, operation, N, true > | Template loop unrolling |
   tFVSplitLoop< A, B, operation, N, false > | We exceed the limit for template loop unrolling: Simple for-loop |
   tNLoop< A, B, operation, 0 > | End of recursion |
   tNSwap | |
   tFVSplitSwap | |
   tFVSwap | |
   tFVSplitSwap< A, B, N, true > | |
   tFVSplitSwap< A, B, N, false > | |
   tNSwap< A, B, 0 > | |
   precision_trait | |
   precision_trait< int > | |
   precision_trait< unsigned int > | |
   precision_trait< long > | |
   precision_trait< unsigned long > | |
   precision_trait< float > | |
   precision_trait< double > | |
   precision_trait< long double > | |
   precision_trait< std::complex< float > > | |
   precision_trait< std::complex< double > > | |
   precision_trait< std::complex< long double > > | |
   promote_smallint | |
   promote_smallint< bool > | |
   promote_smallint< char > | |
   promote_smallint< unsigned char > | |
   promote_smallint< short int > | |
   promote_smallint< short unsigned int > | |
   promote_to | |
   promote_to< T1, T2, 0 > | |
   promotion_trait | |
   sumtype_trait | |
   sumtype_trait< char > | |
   sumtype_trait< short > | |
   sumtype_trait< int > | |
   sumtype_trait< long > | |
   sumtype_trait< unsigned char > | |
   sumtype_trait< unsigned short > | |
   sumtype_trait< unsigned int > | |
   sumtype_trait< unsigned long > | |
   sumtype_trait< float > | |
   sumtype_trait< double > | |
   sumtype_trait< long double > | |
   _et_applic_base | This is just to keep everything together in class browsers |
   tVBoolLoop | |
   tVBoolSplitLoop | |
   tNBoolLoop | |
   FMatrix | Matrix with dimensions known at compile time |
   FMExprNode | Now the expression class itself |
   tVBoolSplitLoop< Expr, N, true > | |
   tVBoolSplitLoop< Expr, N, false > | |
   tNBoolLoop< Expr, 0 > | |
   tVAccumLoop | |
   tVAccumSplitLoop | |
   tNAccumLoop | Template loop |
   tVAccumSplitLoop< Expr, N, true > | Template loop unrolling |
   tVAccumSplitLoop< Expr, N, false > | We exceed the limit for template loop unrolling: Simple for-loop |
   tNAccumLoop< Expr, 0 > | End of recursion |
   _assignfv_base | Just to keep everything together in class browsers.. |
   fv_equ_assign | |
   fv_plu_assign | |
   fv_min_assign | |
   fv_mul_assign | |
   fv_div_assign | |
   fv_mod_assign | |
   fv_xor_assign | |
   fv_and_assign | |
   fv_bor_assign | |
   fv_sle_assign | |
   fv_sri_assign | |
   SynchronizedCounter | |
   MemoryBlock | |
   MemoryMapBlock | |
   Range | Class to enable referencing of ltl::MArray index ranges |
   MArray | A dynamic N-dimensional array storing objects of type T |
   Shape | |
   NoArgument | |
   RangeSliceArgument | |
   RangeSliceArgument< Range > | |
   RangeSliceArgument< int > | |
   RangeSliceArgument< NoArgument > | |
   SliceCounter | |
   FixedVector | Vector with known length at compile time, 1-based, STL-compatible |
   ExprBase | |
   LTLIterator | |
   MArrayIterConst | |
   MArrayIter | |
   ExprNode | Node in the expression parse tree. Every expression in ultimately represented by this class |
   ExprBinopNode | Binary operation node in the expression parse tree |
   ExprUnopNode | Unary operation node in the expression parse tree |
   ExprLiteralNode | Node in the expression parse tree representing a literal number |
   IndexIter | |
   cast | |
   FMIterConst | |
   FMIter | |
   _et_fmatrix_parse_base | Just to keep everything together in class browsers.. |
   FMExprBinopNode | Binary operation node |
   FMExprUnopNode | Unary operation node |
   FMExprLiteralNode | Literal number |
   asFMExpr | We need a trait class to deal with literals |
   asFMExpr< FMExprNode< T, M, N > > | Already an expression template term |
   asFMExpr< FMatrix< T, M, N > > | An array operand |
   tMNLoop | |
   tFMSplitLoop | |
   tFMLoop | |
   tFMSplitLoop< A, B, operation, M, N, true > | |
   tFMSplitLoop< A, B, operation, M, N, false > | |
   tMNLoop< A, B, operation, N, I, 1 > | |
   tMNLoop< A, B, operation, N, 1, 1 > | |
   tMBoolLoop | |
   tMBoolSplitLoop | |
   tMNBoolLoop | |
   tMBoolSplitLoop< Expr, M, N, true > | |
   tMBoolSplitLoop< Expr, M, N, false > | |
   tMNBoolLoop< Expr, N, I, 1 > | |
   tMNBoolLoop< Expr, N, 1, 1 > | |
   TMatTransposeFMExprOp | Unary operation node for matrix transpose |
   tMatVecLoop | |
   tNMatVecLoop | |
   tMatVecSplitLoop | |
   TMatVecFVExprOp | |
   tMatVecSplitLoop< A, B, T, N, true > | |
   tMatVecSplitLoop< A, B, T, N, false > | |
   tNMatVecLoop< A, B, T, N, 0 > | |
   tMatMatLoop | |
   tNMatMatLoop | |
   tMatMatSplitLoop | |
   TMatMatFMExprOp | |
   tMatMatSplitLoop< A, B, T, N, true > | |
   tMatMatSplitLoop< A, B, T, N, false > | |
   tNMatMatLoop< A, B, T, N, 1 > | |
   _assignfm_base | |
   fm_equ_assign | |
   fm_plu_assign | |
   fm_min_assign | |
   fm_mul_assign | |
   fm_div_assign | |
   fm_mod_assign | |
   fm_xor_assign | |
   fm_and_assign | |
   fm_bor_assign | |
   fm_sle_assign | |
   fm_sri_assign | |
   tNMatPivot | |
   tMatPivLoop | |
   tMatPivSplitLoop | |
   tNMatPivLoop | |
   tMatElimLoop | |
   tMatElimSplitLoop | |
   tNMatElimLoop | |
   tMatRestLoop | |
   tMatRestSplitLoop | |
   tNMatRestLoop | |
   GaussJ | Solve equation via Gauss-Jordan inversion or just do a Gauss-Jordan inversion |
  AscFile | Columns based interface to an ASCII data file |
  FitsIO | FitsIO mother class: things FitsIn and FitsOut have in common |
  FitsIn | Reading FITS data segment, reading and modifying FITS header |
  FitsOut | Writing FITS files |
  FitsExtension | Common methods for FitsExtensionIn/Out |
  FitsExtensionIn | Primary HDU and extensions in one object. Look into test/testfitsextensionio.cpp for examples |
  FitsExtensionOut | Create a FITS extension object. Look into test/testfitsextensionio.cpp for examples |
  emptyData_ | |
  BinTable | Class for binary tables IO |
  FitsBinTableIn | Class to read binary table from FITS extensions |
  MArray | A dynamic N-dimensional array storing objects of type T |
  MArrayIter | |
  Shape | |
  WCS | Base class for intermediate WCs calculation |
  CCS | Base CCS class, use to derive the different projection / CCS |
  CCS_TAN | Gnonomic CCS, TAN representation |
  FitsCCS | CCS interface class |
  less_nan | |
  LTLIterator | |
  MArrayIterConst | |
  IndexIter | |
  cast | |
  ExprNode | Node in the expression parse tree. Every expression in ultimately represented by this class |
  ExprBinopNode | Binary operation node in the expression parse tree |
  ExprUnopNode | Unary operation node in the expression parse tree |
  ExprLiteralNode | Node in the expression parse tree representing a literal number |
  FourierTransform | |
  Gnuplot | |
  FMatrix | Matrix with dimensions known at compile time |
  FVector | Vector whose length is known at compile time |
  FVMemory | Memory and data access interface for ltl::FVMemory |
  FVMemory< T, N, 0 > | |
  LTLException | Exception indicating problems with LTL |
  IOException | Exception indicating problems with ASCII I/O |
  RangeException | Exception for ltl::MArray<T ,N> range check errors |
  FitsException | Exception indicating problems with FITS I/O |
  LinearAlgebraException | Exception indicating problems within Linear Algebra |
  SingularMatrixException | Exception indicating a singular Matrix |
  DivergenceException | Exception indicating a divergent iterative algorithm |
  Range | Class to enable referencing of ltl::MArray index ranges |
  FitsHeader | Representation of a complete FITS header. Holds also header I/O methods |
  tNMatPivot | |
  tMatPivLoop | |
  tMatPivSplitLoop | |
  tNMatPivLoop | |
  tMatElimLoop | |
  tMatElimSplitLoop | |
  tNMatElimLoop | |
  tMatRestLoop | |
  tMatRestSplitLoop | |
  tNMatRestLoop | |
  GaussJ | Solve equation via Gauss-Jordan inversion or just do a Gauss-Jordan inversion |
  tMatHesse | |
  tMatHesseSplit | |
  tNMatHesse | |
  tMatFillHesse | |
  tMatFillHesseSplit | |
  tNMatFillHesse | |
  tMatClearHesse | |
  tMatClearHesseSplit | |
  tNMatClearHesse | |
  tMatHesseSplit< TPAR, NPAR, true > | |
  tMatHesseSplit< TPAR, NPAR, false > | |
  tNMatHesse< TPAR, NPAR, L, 1 > | |
  tNMatHesse< TPAR, NPAR, L, 0 > | |
  tNMatHesse< TPAR, NPAR, 0, 0 > | |
  tMatFillHesseSplit< TPAR, NPAR, true > | |
  tMatFillHesseSplit< TPAR, NPAR, false > | |
  tNMatFillHesse< TPAR, NPAR, L, 1 > | |
  tNMatFillHesse< TPAR, NPAR, L, 0 > | |
  tNMatFillHesse< TPAR, NPAR, 1, 0 > | |
  tMatClearHesseSplit< TPAR, NPAR, true > | |
  tMatClearHesseSplit< TPAR, NPAR, false > | |
  tNMatClearHesse< TPAR, NPAR, L, 1 > | |
  tNMatClearHesse< TPAR, NPAR, L, 0 > | |
  tNMatClearHesse< TPAR, NPAR, 0, 0 > | |
  MRQFunction | Mother (and example) for function class suitable for ltl::Marquardt |
  Gaussian | Approximation of a Gaussian function via Marquardt-Levenberg algorithm |
  Gaussian< TPAR, TDAT, 7, 2 > | |
  Gaussian< TPAR, TDAT, 5, 2 > | |
  Gaussian< TPAR, TDAT, 3, 2 > | |
  PolyGaussian | |
  PolyGaussian< TPAR, TDAT, 7, 2 > | |
  PolyGaussian< TPAR, TDAT, 5, 2 > | |
  Moffat | Approximation of a Moffat function via Marquardt-Levenberg algorithm |
  Moffat< TPAR, TDAT, 10, 2 > | |
  Moffat< TPAR, TDAT, 8, 2 > | |
  DegMoffat | Approximation of a Moffat function via Marquardt-Levenberg algorithm |
  DegMoffat< TPAR, TDAT, 10, 2 > | |
  DegMoffat< TPAR, TDAT, 8, 2 > | |
  Marquardt | Marquardt-Levenberg approximation of an arbitrary fitfunction TFUNC |
  PolynomFit | Class to fit a NPAR polynome to an NDIM ltl::MArray |
  PolynomFit< TPAR, TDAT, ORDER, EXT, 1 > | Specialisation for NDIM == 1 |
  PolynomFit< TPAR, TDAT, ORDER, false, 2 > | Specialisation for NDIM == 2 and restrict mixed terms to sum( exponents ) <= ORDER |
  PolynomFit< TPAR, TDAT, ORDER, true, 2 > | Specialisation for NDIM == 2 and any mixed terms |
  LMFit | Marquardt-Levenberg fit to a generic function |
  SVDecomposition | |
  LUDecomposition | |
  ExprBase | |
  _et_applic_base | This is just to keep everything together in class browsers |
 util | |
  CommandLineReader | Implementation of an util::OptionReader for command line processing |
  ConfigFileReader | Implementation of an OptionReader for config file processing |
  Option | The base class for all options |
  IntOption | Hold an integer number |
  FloatOption | Hold a single precision number |
  DoubleOption | Hold a double precision number |
  BoolOption | Hold a boolean. Default value is toggled when the option is given |
  StringOption | Hold a string |
  ShellOption | Hold a shell string |
  FloatArrayOption | Hold an array of N floats |
  DoubleArrayOption | Hold an array of N doubles |
  IntArrayOption | Hold an array of N ints |
  StringArrayOption | |
  RegionArrayOption | Hold a N-dim Region |
  OptionParser | Generic parser object for options |
  OptionReader | An abstract base class for sources feeding into util::OptionParser |
  Region | To represent geometries or subarrays of N-dimensional arrays |
  StringFactory | This class returns a number in the requested type |
  Timer | |
  UException | Standard exception for namespace util methods |
  UTDateException | Derived exception for Date conversion errors |
  StringException | Derived exception for impossible string formatting requests |
  UTDate | Representing UT as a wrapped time_t mother class |
  DCFDate | Convert from and to DCF-77 type string |
  FitsDate | Convert from and to FITS DATE type string |
  JulDate | Convert from and to Julian date |
  MJDate | Convert from and to modified Julian date |
  UTTime | |
  LSTime | |
  GSTime | |
 blas_gbmv_dispatch | |
 blas_gbmv_dispatch< double > | |
 blas_gbmv_dispatch< float > | |
 DegMoffat | Approximation of a Moffat function via Marquardt-Levenberg algorithm |
 DegMoffat< TPAR, TDAT, 10, 2 > | |
 DegMoffat< TPAR, TDAT, 8, 2 > | |
 fdostream | |
 Gaussian | Approximation of a Gaussian function via Marquardt-Levenberg algorithm |
 Gaussian< TPAR, TDAT, 3, 2 > | |
 Gaussian< TPAR, TDAT, 5, 2 > | |
 Gaussian< TPAR, TDAT, 7, 2 > | |
 lapack_sbev_dispatch | |
 lapack_sbev_dispatch< double > | |
 lapack_sbev_dispatch< float > | |
 lapack_syev_dispatch | |
 lapack_syev_dispatch< double > | |
 lapack_syev_dispatch< float > | |
 Moffat | Approximation of a Moffat function via Marquardt-Levenberg algorithm |
 Moffat< TPAR, TDAT, 10, 2 > | |
 Moffat< TPAR, TDAT, 8, 2 > | |
 MRQFunction | Mother (and example) for function class suitable for ltl::Marquardt |
 PolyGaussian | |
 PolyGaussian< TPAR, TDAT, 5, 2 > | |
 PolyGaussian< TPAR, TDAT, 7, 2 > | |