▼Ncapd | |
Nalglib | Computation of the eigenvalues and the eigenvectors using the alglib library |
►Nautodiff | |
NAcos | |
NAcosConst | |
NAcosFunTime | |
NAcosTime | |
NAdd | |
NAsin | |
NAsinConst | |
NAsinFunTime | |
NAsinTime | |
NAtan | |
NAtanConst | |
NAtanFunTime | |
NAtanTime | |
NConstMinusConst | |
NConstMinusFunTime | |
NConstMinusTime | |
NConstMinusVar | |
NConstPlusConst | |
NConstPlusFunTime | |
NConstPlusTime | |
NConstPlusVar | |
NCube | |
NCubeConst | |
NCubeFunTime | |
NCubeTime | |
NDiv | |
NDivConstByConst | |
NDivFunTimeByConst | |
NDivFunTimeByFunTime | |
NDivFunTimeByTime | |
NDivTimeByConst | |
NDivVarByConst | |
NDivVarByFunTime | |
NDivVarByTime | |
NExp | |
NExpConst | |
NExpFunTime | |
NExpTime | |
NFunTimeMinusConst | |
NFunTimeMinusFunTime | |
NFunTimeMinusTime | |
NFunTimeMinusVar | |
NFunTimePlusFunTime | |
NFunTimePlusVar | |
NHalfIntPow | |
NHalfIntPowConst | |
NHalfIntPowFunTime | |
NHalfIntPowTime | |
NLog | |
NLogConst | |
NLogFunTime | |
NLogTime | |
NMul | |
NMulConstByConst | |
NMulConstByFunTime | |
NMulConstByTime | |
NMulConstByVar | |
NMulFunTimeByFunTime | |
NMulFunTimeByVar | |
NMulTimeByFunTime | |
NMulTimeByVar | |
NNaturalPow | |
NNaturalPowConst | |
NNaturalPowFunTime | |
NNaturalPowTime | |
NNegIntPow | |
NNegIntPowConst | |
NNegIntPowFunTime | |
NNegIntPowTime | |
NOneMinusSqr | |
NOneMinusSqrConst | |
NOneMinusSqrFunTime | |
NOneMinusSqrTime | |
NPow | |
NPowConst | |
NPowFunTime | |
NPowTime | |
NQuartic | |
NQuarticConst | |
NQuarticFunTime | |
NQuarticTime | |
NSin | |
NSinConst | |
NSinFunTime | |
NSingularNaturalPow | Natural powers x^c for c=2,3,4 are hand optimized and implemented in EvalSqr.h, EvalCubePow.h and EvalQuarticPow.h, respectively |
NSinTime | |
NSqr | |
NSqrConst | |
NSqrFunTime | |
NSqrt | |
NSqrtConst | |
NSqrtFunTime | |
NSqrTime | |
NSqrtTime | |
NSub | |
NTimeMinusConst | |
NTimeMinusFunTime | |
NTimeMinusVar | |
NTimePlusFunTime | |
NTimePlusVar | |
NUnaryMinus | |
NUnaryMinusConst | |
NUnaryMinusFunTime | |
NUnaryMinusTime | |
NVarMinusConst | |
NVarMinusFunTime | |
NVarMinusTime | |
CMultiindexData | Stores information about decomposition of a Multiinex 'z' into possible sums of x+y=z Used to optimizs convolutions. All the data here is redundant and precomputed to avoid extra runtime computation |
CDagIndexer | |
CAcosNode | |
CAcosConstNode | |
CAcosTimeNode | |
CAcosFunTimeNode | |
CAddNode | |
CConstPlusVarNode | |
CConstPlusConstNode | |
CConstPlusTimeNode | |
CConstPlusFunTimeNode | |
CTimePlusVarNode | |
CTimePlusFunTimeNode | |
CFunTimePlusVarNode | |
CFunTimePlusFunTimeNode | |
CAsinNode | |
CAsinConstNode | |
CAsinTimeNode | |
CAsinFunTimeNode | |
CAtanNode | |
CAtanConstNode | |
CAtanTimeNode | |
CAtanFunTimeNode | |
CDivNode | |
CDivVarByConstNode | |
CDivVarByTimeNode | |
CDivVarByFunTimeNode | |
CDivTimeByConstNode | |
CDivFunTimeByConstNode | |
CDivFunTimeByTimeNode | |
CDivFunTimeByFunTimeNode | |
CDivConstByConstNode | |
CExpNode | |
CExpConstNode | |
CExpTimeNode | |
CExpFunTimeNode | |
CHalfIntPowNode | |
CHalfIntPowConstNode | |
CHalfIntPowTimeNode | |
CHalfIntPowFunTimeNode | |
CLogNode | |
CLogConstNode | |
CLogTimeNode | |
CLogFunTimeNode | |
CMulNode | |
CMulConstByVarNode | |
CMulConstByConstNode | |
CMulConstByTimeNode | |
CMulConstByFunTimeNode | |
CMulTimeByVarNode | |
CMulTimeByFunTimeNode | |
CMulFunTimeByVarNode | |
CMulFunTimeByFunTimeNode | |
CNaturalPowConstNode | |
CNaturalPowTimeNode | |
CNaturalPowNode | |
CNaturalPowFunTimeNode | |
CNegIntPowNode | |
CNegIntPowConstNode | |
CNegIntPowTimeNode | |
CNegIntPowFunTimeNode | |
COneMinusSqrNode | |
COneMinusSqrTimeNode | |
COneMinusSqrFunTimeNode | |
COneMinusSqrConstNode | |
CPowNode | |
CPowConstNode | |
CPowTimeNode | |
CPowFunTimeNode | |
CQuarticNode | |
CQuarticTimeNode | |
CQuarticFunTimeNode | |
CQuarticConstNode | |
CSinNode | |
CSinConstNode | |
CSinTimeNode | |
CSinFunTimeNode | |
CSqrNode | |
CSqrTimeNode | |
CSqrFunTimeNode | |
CSqrConstNode | |
CSqrtNode | |
CSqrtConstNode | |
CSqrtTimeNode | |
CSqrtFunTimeNode | |
CSubNode | |
CConstMinusVarNode | |
CConstMinusFunTimeNode | |
CConstMinusTimeNode | |
CConstMinusConstNode | |
CTimeMinusConstNode | |
CTimeMinusFunTimeNode | |
CTimeMinusVarNode | |
CFunTimeMinusConstNode | |
CFunTimeMinusTimeNode | |
CFunTimeMinusFunTimeNode | |
CFunTimeMinusVarNode | |
CVarMinusConstNode | |
CVarMinusTimeNode | |
CVarMinusFunTimeNode | |
CCubeNode | |
CCubeTimeNode | |
CCubeFunTimeNode | |
CCubeConstNode | |
CUnaryMinusNode | |
CUnaryMinusConstNode | |
CUnaryMinusTimeNode | |
CUnaryMinusFunTimeNode | |
CMaskIterator | |
CInt4 | |
CNode | |
CAbstractNode | |
►Nauxil | |
CApplicationDesc | |
Cargflags | This is a helper class which defines specific flags indicating various types of command-line arguments and the state of interpreting them |
Cargelement | This is a helper class which defines common properties of a command-line argument bound with any type of a variable |
Cargunit | This is a helper class which defines one command-line argument which is bound with some specific variable. It is an extension of the "argelement" class defined in terms of a template whose parameter is the type of the variable which is to be set based on the value provided in the command line |
Carguments | The objects of this class gather the expected command-line arguments and decode them. It is recommended that you use the various functions called "arg" to enqueue the arguments into the list of arguments. When the list is complete, one just calls the "analyze" method of the class. Detailed instructions are gathered in the "arg.txt" file. The program "argtest.cpp" and most CHomP programs very well illustrate how to use various features of this class |
CBuildInfo | |
CCAPDConfig | |
►CConfigFileReader | |
CCAPD_LOGGER | |
CCounter | Counter add to each object of given class unique id and also counts number of objects created and existing |
CComposedFunctor | |
CFunctor | |
CLogger | |
►COutputStream | This class defines an output stream for replacing the standard 'cout'. It has the additional features of flushing the output after every operation, suppressing the output, or logging the output to a file |
Cmute | Local mute of the stream. This class defines an object which makes the stream mute by suppressing output to both the screen and the log file and restores its setting when the object is destroyed |
CRemoveConst | |
CRemoveConst< const T > | |
Ctimeused | A class that stores the time at which it was initialized and then returns or displays the time used since the initialization. It displays this time when the destructor is invoked, e.g., at the end of program run. This class is used in most of the CHomP programs to measure the time used for the computations |
►Nbasicalg | |
Cinterval_io_exception | |
Ca_diee | |
Ca_fiee | |
CPrimitive | |
Cwhitespace | |
►Ncovrel | Covering relations, H-sets, cones conditions |
CGridSet | This class is used to store a grid of a sets in the form center[i] + M * r |
CGridSets | This class is used to store a grid of a sets in the form center[i] + M * r |
CHSet | This is an abstract class for h-sets - from paper by Gidea-Zgliczynski 'Covering relations ...' http://www.im.uj.edu.pl/~zgliczyn |
CHSet2D | This class provides a h-set in R^2 with one unstable and one stable direction |
CCheckCoveringRelation2DParameters | |
CHSet3D | The class HSet3D provides a h-set in R^3 with one unstable direction and two stable directions |
CHSetMD | This class provides a h-set in an arbitrary dimension |
CHSetND | This class provides a h-set in an arbitrary dimension |
CHSetWithCones | |
CQuadraticForm | |
CTripleSet | TripleSet - a planar h-set with one unstable direction Authors: Implementation of derived classes and functions: Jaroslaw Dulak and Daniel Wilczak |
►Ncxsc | Fast interval library |
CInterval | CAPD interface for interval library cxsc |
►NdiffAlgebra | |
CBasicC2Curve | This class is a data structure for storing of a parametric curve together with first and second order derivatives with respect to initial point |
CBasicCnCurve | This class is a data structure for storing of a parametric curve together with its partial derivatives with respect to initial point up to desired order |
CBasicCurve | This class is a data structure for storing of a parametric curve together with first order derivatives with respect to initial point |
CC0TimeJet | |
CCoeffTraits< C0TimeJet< VectorT > > | |
CC1TimeJet | |
CCoeffTraits< C1TimeJet< MatrixT > > | |
CC2Curve | This class provides methods for evaluation of the parametric curve for a given parameter value |
CC2Curve< BaseCurveT, true > | |
CC2TimeJet | |
CCoeffTraits< C2TimeJet< MatrixT > > | |
CCnContainer | The class is used to store coefficients of a multivariate polynomial of degree D Coefficients themselves can be polynomials as well |
CCnCurve | This class provides methods for evaluation of the parametric curve for a given parameter value |
CCnCurve< BaseCurveT, true > | |
CCnTimeJet | The class represent a jet of solution to a nonautomnomous ODE |
CCoeffTraits< CnTimeJet< MatrixT, DEGREE > > | |
CCoeffTraits | This class provides a trait of being set of a given type, i.e |
CCurve | This class provides methods for evaluation of the parametric curve for a given parameter value |
CCurve< BaseCurveT, true > | Specialization for interval types |
CCurveInterface | This class provides common interface for all types of curves |
CFadCurve | |
CHessian | This class is used to store second order partial derivatives of a function |
CHomogenousPolynomial | Class HomogenousPolynomial provides indexing and some algorithms for multivariate homogenous polynomials. It does not store the coefficients of the polynomial. It is assumed that the memory is already allocated in a continuous block |
►CJet | The class is used to store coefficients of a truncated power series to degree D Coefficients area assumed to be of a numeric type |
Crebind | |
CParametricCurve | This file defines an abstract class that represents parametric curve in |
CBaseSolutionCurve | This file defines class that represents parametric curve in |
CSolutionCurve | |
CSolutionCurve< CurveT, true > | |
CTimeRange | TimeRange is a base class for all types of sets. It stores the current time in ODE case or number of iterations in the case of discrete dynamical system case |
►NdiffIncl | A rigorous integration of the differential inclusions |
CDiffInclusion | Base class for rigorous integration of differential inclusions |
CDiffInclusionSetMove | |
CDiffInclusionCW | Class for rigorous integration of differential inclusions |
CDiffInclusionLN | Class for rigorous integration of differential inclusions |
CInclRect2Set | Set representation for differential inclusions based on capd::dynset::Rect2Set class |
CMultiMap | A multi map for differential inclusions |
►Ndynset | Various set representations that can be moved with dynamical systems |
CAbstractSet | |
CAffineCoordinateChange | Affine Coordinate system Change y = y0 + B*(x-x0) |
CC0AffineSet | The set is represented as: x + B*r; and is moved by the following method |
CC0BallSet | Set is represented as: x + Ball(r) |
CC0DoubletonSet | The set is represented as doubleton: x + C*r0 + B*r; and is moved by the following method |
CC0FlowballSet | |
CC0GraphicalSet | C0GraphicalSet is an envelope class for any class derived from C0Set. It adds a possibility of an additional Output after each 'move' of the original set |
CC0HODoubletonSet | Class C0HODoubletonSet represents a subset of R^n as doubleton, i.e |
CC0HOSet | This class uses representation of subset of R^n inherited from template parameter |
CC0HOTripletonSet | Class C0HOTripletonSet represents a subset of in the following form |
CC0Set | Common interface of all sets that stores only C0 information (set position) |
CSetTraits< C0Set< MatrixT > > | Specialization of Traits class |
CC0TripletonSet | Class C0TripletonSet represents a subset of R^n in the following form |
CC11Rect2 | doubleton set with reorganization moved by QR decomposition (3rd method) |
CC11Rect2Set | |
CC1AffineSet | The C1 set is represented as doubleton: x + B*r; |
CC1DoubletonSet | The C1 set is represented as doubleton: x + C*r0 + B*r; |
CC1GraphicalSet | C1GraphicalSet is an envelope class for any class derived from C1Set. It adds a possibility of an additional Output after each 'move' of the original set |
CC1HOSet | This class uses representation of subset of R^n inherited from template parameter |
CC1Set | Common interface of all sets that store C1 informations (set position and first derivatives) |
CSetTraits< C1Set< MatrixT > > | |
CC2DoubletonSet | C2 set in doubleton form |
CC2Set | Common interface of all sets that store C2 information (set position and first and second derivatives) |
CSetTraits< C2Set< MatrixT > > | |
CCnDoubletonSet | This set stores vector of derivatives with respect to a multiindex alpha as a doubleton |
CCnRect2Set | Set that stores all derivatives to given order in doubleton form with reorganization moved by QR decomposition method |
CCnSet | Common interface of all sets that store Cn information (set position and derivatives to order n) |
CSetTraits< CnSet< MatrixT, DEGREE > > | |
CCoordinateSystem | Defines coordinate system |
CIdQRPolicy | |
CDefaultPolicy | |
CDoubletonData | This class is a data structure used in implementation of all types of Doubleton and Tripleton sets |
CTripletonData | |
CC1DoubletonData | |
CC0EnclosureHolder | These classes are used as base classes for all types of C^0-C^n sets |
CC1EnclosureHolder | |
CC2EnclosureHolder | |
CHOData | This class is a data structure used in implementation of all types of HO sets |
CInverseQRPolicy | |
CFullQRWithPivoting | |
CPartialQRWithPivoting | |
CSelectiveQRWithPivoting | Vectors are orthogonalized only if they are close to be parallel |
CCanonicalReorganization | During reorganization we set C and B to Identity and put everything into r0 |
CCoordWiseReorganization | In this reorganization policy column vector B_i corresponding to the biggest coordinate in r (r_i) replaces vector in C_j the 'closest' to B_i and the r_i is moved to r0 |
CFactorPolicy | |
CFactorReorganization | Factor based reorganization |
CInvBByCFactorReorganization | Factor based reorganization for C1 sets |
CNoReorganization | Reorganization that does nothing |
CQRReorganization | During reorganization we orthogonalize B |
CSwapReorganization | Reorganization is performed if r is bigger than r0 but in coordinate system of r |
CSetTraits | This class provides a trait of being set of a given type, i.e |
►Ndynsys | |
CBasicC2OdeSolver | |
CBasicCnOdeSolver | |
CBasicFadOdeSolver | |
CBasicOdeSolver | MapT constraints: type definitions: |
CC1DynSys | |
CC2DynSys | |
CC2OdeSolver | |
CCnDynSys | |
CCnOdeSolver | |
CLinear2d | |
CLinear3d | |
COdeNumTaylor | |
CVLin3D | |
CDiscreteDynSys | DiscreteDynSys is a proxy to convert any Map into discrete Dynamical System |
CFlowballSet | |
CDynSys | Class dynsys is an abstract class representing a discrete dynamical system |
CHOSolver | |
CDynSysMap | DynSysMap is a proxy to convert any Map into discrete Dynamical System |
CFadFunction | |
CFadMap | |
CLorenzFadMap | Sample implementation of FadMap. This class implements the vector field for the Lorenz system. Template parameters are: Scalar: double, interval, MpFloat, MpInterval, etc. D: in this case either 3 or 0. If D=3 then vectors and matrices are allocated on stack and the computations are much faster but we must know they dimension at compile time. This forces separate compilation of all the classes like vectors and matrices for this particular dimension. D=0 means that vectors and matrices are allocated on the storage and they can be of arbitrary dimension specified at runtime |
CLorenzSection | |
CFadOdeSolver | |
CFirstOrderEnclosure | |
CHighOrderEnclosure | This file defines class for computation of [C0-C2] rough enclosure to an ODE by high order Taylor method |
CC1SetMove | |
CC1SetMove< T, SetT, false > | |
CC2SetMove | |
CC2SetMove< T, SetT, false > | |
CCnSetMove | |
CCnSetMove< T, SetT, false > | |
CC1JetMove | |
CC1JetMove< T, JetT, false > | |
CC2JetMove | |
CC2JetMove< T, JetT, false > | |
CCnJetMove | |
CCnJetMove< T, JetT, false > | |
CMpLastTermsStepControl | |
CStepControlInterface< MpLastTermsStepControl, Scalar > | This class is a common interface for StepControl used in PoincareMap and TimeMap. Both classes inherit this interface |
COdeSolver | |
COdeTraits | Defines characteristic traits of ODE |
CSolverException | |
CStepControlInterface | This class is a common interface for StepControl used in PoincareMap and TimeMap. Both classes inherit this interface |
CNoStepControlInterface | |
CNoStepControl | This class provides an empty time step control for the solutions to ODEs. It contains an interface for other implementations of TSC |
CStepControlInterface< NoStepControl, double > | |
CFixedStepControl | |
CILastTermsStepControl | |
CDLastTermsStepControl | |
CIEncFoundStepControl | |
►Nfields | |
CComplex | Class Complex represents complex number |
CComplex< double > | |
CComplex< float > | |
CComplex< long double > | |
►Nfilib | Fast interval library |
CInterval | CAPD interface for fast interval library filib |
►Ngeomset | Definitions of sets as geometrical objects which can represent different shapes |
CAffineSet | Affine set representanion of the form x0 + B*r |
CCenteredAffineSet | Affine set representation of the form x + B * r which assures that r contains zero |
CCenteredDoubletonSet | Doubleton representation of the form x0 + C*r0 + B*r which checks if r0 and r contain 0 |
CCenteredTripletonSet | Class CenteredTripletonSet represents a subset of R^n in the following form |
CDoubletonSet | Doubleton representation of the form x0 + C*r0 + B*r |
CMatrixAffineSet | Set of matrices represented as D + Bjac * R |
CMatrixDoubletonSet | Set of matrices represented as D + Cjac * R0 + Bjac * R |
►Nintervals | Interval arithmetics |
CInterval | Definition of template class Interval |
CIntervalError | Instation of the IntervalError class is throwed by the Interval class on error |
CIntervalTraits | |
CIntervalTraits< double > | |
CIntervalTraits< float > | |
CIntervalTraits< long double > | |
CIntervalIOTraits | |
CIntervalIOTraits< double > | |
CIntervalIOTraits< float > | |
CIntervalIOTraits< MpReal > | |
►Ninvset | |
CCubicalMap | |
CForbiddenSet | Class that defines forbidden set |
CGraph | It defines a graph that in each node can store additional data |
CGraphNode | |
CGetKey | |
Cless | |
Cless< capd::vectalg::Vector< short int, 2 > > | |
CMapGraphNodeData | |
CMapGraph | |
CScope | Class that defines set of regions it can be used do define domain, range, allowed sets for graphs |
►Nmap | Functions and Maps |
CBasicFunction | This class is a basic for further protected inheritance to classes Function, Map .. |
CCnCoeffSlice | |
CFunction | Class Function represents a function |
CMap | This class is used to represent a map |
►NmatrixAlgorithms | Matrix algorithms: Gauss elimination, orthonormalization, QR decomposition etc |
►CCAPDIntMatrixAlgorithms | |
CQuotientBaseMatrix | |
CSmithForm | |
CSolveLinearEquation | |
CCAPDSmithForm | |
CGershgorin | |
CGershgorin< MatrixType, false > | Specialization for non-rigorous types |
CGershgorin< MatrixType, true > | Specialization for rigorous (interval) types |
CGetExpRemainder | |
CGetExpRemainder< T, true > | |
CGetExpRemainder< T, false > | |
►CIntMatrixAlgorithmsFactory | |
CQuotientBaseMatrix | |
►CSmithForm | |
CSmithFormThroughFactory | |
CSolveLinearEquation | |
CIInvert | |
CInvert | |
CPARIInterface | |
►CPARIIntMatrixAlgorithms | |
CQuotientBaseMatrix | |
CSmithForm | |
CSolveLinearEquation | |
CGetPARISmithFormTraits | |
CPARISmithForm | |
CQuotientBaseMatrix | |
CSmithFormTraits | |
CSmithForm | |
CSmithFormFactory | |
CSolveLinearEquation | |
C_CreateSmithForm_ | |
C_CreateSmithForm_< Matrix< Scalar, 0, 0 > > | |
C_CreateSmithForm_< Matrix< short, 0, 0 > > | |
C_CreateSmithForm_< Matrix< int, 0, 0 > > | |
C_CreateSmithForm_< Matrix< long, 0, 0 > > | |
C_CreateSmithForm_< Matrix< llong, 0, 0 > > | |
►NmultiPrec | |
CMpPrecision | Wrapper for mpfr precision type |
CMpReal | MpReal represents multiple precision real number with controlled rounding |
►Nnewton | |
CKrawczyk | |
CMapping | General function for Newton or Krawczyk method f:R^n -> R^n |
NnormalForms | |
►Npdes | |
CC0DoubletonSetGeometricTail | |
CC0HODoubletonSetGeometricTail | This class uses representation of subset of R^n inherited from template parameter |
CC1DoubletonSetGeometricTail | |
CDissipativeVectorField | The class provides a common interface for a dissipative vector required by the class PdeSolver |
CGeometricBound | The class is class represents a subset of a countable infinite dimensional space |
COneDimKSSineVectorField | The class implements vector field of the one-dimensional real Kuramoto-Shivashinsky PDE under the following assumptions 1 .The solutions are represented in the Fourier basis |
CPdeAbstractSection | |
CPdeAffineSection | TimeMap class provides class that serves as an affine Poincare section |
CPdeCoordinateSection | TimeMap class provides class that serves as Poincare section of the form x_i = c |
CPdeCurve | This class is a data structure for storing of a parametric curve together with first order derivatives with respect to initial point |
CComputeOneStepSectionEnclosure | |
CComputeOneStepSectionEnclosure< false > | |
CPdeSectionDerivativesEnclosure | |
CPdeSolver | |
CPolyLogBound | The class is class represents a subset of a countable infinite dimensional space |
CPolynomialBound | |
►Npoincare | This namespace contains classes to compute Poincare Maps and Time Maps |
CAbstractSection | PoicareSection is class that is default PoincareSection for class PoincareMap |
CAffineSection | TimeMap class provides class that serves as an affine Poincare section |
CBasicPoincareMap | BasicPoicareMap class is mainly used for non-rigorous computations of Poincare Map |
CCoordinateSection | TimeMap class provides class that serves as Poincare section of the form x_i = c |
CNonlinearSection | TimeMap class provides class that serves as Poincare section of the form x_i = c |
CPoincareException | |
CPoincareMap | PoicareMap class rigorously computes Poincare Map |
CSaveStepControl | It saves step and step control settings on construction and restores them on destruction |
CSectionDerivativesEnclosure | |
CTimeMap | TimeMap class provides methods for transport of sets (or points) by a given flow over some time interval |
Nrings | |
►Nrounding | |
CDoubleRounding | Definition of class that switches rounding modes of double numbers |
CIntRounding | Definition of class that virtually switches rounding modes of integer numbers because in this case no switching is needed (all operations are exact) |
CRoundingTraits | Class that for given type defines default class for rounding switching |
CRoundingTraits< double > | |
CRoundingTraits< float > | |
CRoundingTraits< long double > | |
CRoundingTraits< int > | |
►Nthreading | |
CSolverFactory | This is an interface of an abstract factory wich creates new instances of a specific solver; |
CDefaultSolverFactory | |
CBaseTPMap | |
CTMap | |
CPMap | |
CPMapFactory | |
CTMapFactory | |
CSolverPool | |
CLambdaTask | |
CTask | This class is an abstract Task to be executed in a thread pool |
CThreadPool | This class realizes a simple thread pool of fixed size |
►Nvectalg | |
CColumnIterator | |
Cconst_ColumnIterator | |
►CMatrix | |
Crebind | |
►CVector | |
Crebind | |
CColumnVector | This class realizes a vector without its own container, which is a reference to a subset of other object with his own container. A typical situation is a column of matrix which can be considered as a vector |
CContainer | Class Container together with suitable iterators The container has fixed size specified by a template argument 'capacity' |
CContainer< Scalar, 0 > | Specialization for capacity=0 This container allocates objects on a storage |
CConvert | |
CConvert< ResultType, ScalarType, true > | |
CConvert< ResultType, ScalarType, false > | |
CMatrixContainer | This class inherits form general Container class and provides constructors and methods specific for two dimensional data |
CMatrixContainer< Scalar, 0, 0 > | |
CMultipointer | Multipointer always contains nondecreasing list of indexes of variables |
CMultiindex | For a Multiindex mi, mi[p] is a number of differentiation with respect to i-th variable. For example, a Multipointer mp=(0,0,2,3) in 5-dimensional space corresponds to the Multiindex mi=(2,0,1,1,0). Hence, Multiindex agrees with standard notation and it contains an additional information about the dimension of the domain of the function |
CNorm | A general abstract norm |
CEuclNorm | Euclidean norm |
CMaxNorm | norm (max norm) |
CSumNorm | norm |
CEuclLNorm | Euclidean Logarithmic Norm |
CMaxLNorm | Logarithmic Norm |
CSumLNorm | Logarytmic norm |
►CRowVector | RowVector class realizes a vector without its own container. He is just a reference to a part of other object (i.e. Matrix of Vector) with his own container |
Crebind | |
CNewton | |
CBinomial | |
CBinomial< 0, K > | |
CBinomial< N, 0 > | |
CBinomial< N, N > | |
CBinomial< 0, 0 > | |
CFactorial | |
CFactorial< 1 > | |
CFactorial< 0 > | |
CTexWriter | |
CTypeTraits | Defines type traits such as their values zero, one etc |
CIntegralTypeTraits | |
CFloatingTypeTraits | |
CTypeTraits< int > | Traits of type int |
CTypeTraits< short > | Traits of type short |
CTypeTraits< long > | Traits of type long |
CTypeTraits< long long > | Traits of type long long |
CTypeTraits< double > | Traits of type double |
CTypeTraits< float > | Traits of type float |
CTypeTraits< long double > | Traits of type long double |
CTypeTraits< T * > | |
CTypeTraits< capd::cxsc::Interval > | Specialization for intervals |
CTypeTraits< fields::Complex< T > > | |
CTypeTraits< capd::filib::Interval< T, R, M > > | Specialization for intervals |
CTypeTraits< ::capd::intervals::Interval< T, RT > > | Specialization of TypeTraits for intervals |
CTypeTraits< capd::multiPrec::MpInt > | |
CTypeTraits< capd::multiPrec::MpReal > | |
CTypeTraits< Z2 > | Traits of type Z2 |
CTypeTraits< Zp > | Traits of type Zp |
▼Nfadbad | |
COp< capd::filib::Interval< BoundType, R, M > > | |
▼Nstd | |
Nimpl | |