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