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

[detail level 12345]

▼Ncapd
►Nautodiff
CAbstractNode
CDagIndexer
CInt4
CMaskIterator
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
CNode
►Nbasicalg
Ca_diee
Ca_fiee
Cinterval_io_exception
CPrimitive
Cwhitespace
►Ncovrel	Covering relations, H-sets, cones conditions
CCheckCoveringRelation2DParameters
CGraphicsHSet3D
CGraphicsTripleSet
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
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
CBaseSolutionCurve	This file defines class that represents parametric curve in
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
CC1TimeJet
CC2Curve	This class provides methods for evaluation of the parametric curve for a given parameter value
CC2Curve< BaseCurveT, true >
CC2TimeJet
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	This class provides a trait of being set of a given type, i.e
CCoeffTraits< C0TimeJet< VectorT > >
CCoeffTraits< C1TimeJet< MatrixT > >
CCoeffTraits< C2TimeJet< MatrixT > >
CCoeffTraits< CnTimeJet< MatrixT, DEGREE > >
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 $R^D\to R^M$
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
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
CDiffInclusionCW	Class for rigorous integration of differential inclusions
CDiffInclusionLN	Class for rigorous integration of differential inclusions
CDiffInclusionSetMove
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 + Cr0 + Br; and is moved by the following method
CC0EnclosureHolder	These classes are used as base classes for all types of C^0-C^n sets
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)
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;
CC1DoubletonData
CC1DoubletonSet	The C1 set is represented as doubleton: x + Cr0 + Br;
CC1EnclosureHolder
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)
CC2DoubletonSet	C2 set in doubleton form
CC2EnclosureHolder
CC2Set	Common interface of all sets that store C2 information (set position and first and second derivatives)
CCanonicalReorganization	During reorganization we set C and B to Identity and put everything into r0
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)
CCoordinateSystem	Defines coordinate system
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
CDefaultPolicy
CDoubletonData	This class is a data structure used in implementation of all types of Doubleton and Tripleton sets
CFactorPolicy
CFactorReorganization	Factor based reorganization
CFullQRWithPivoting
CHOData	This class is a data structure used in implementation of all types of HO sets
CIdQRPolicy
CInvBByCFactorReorganization	Factor based reorganization for C1 sets
CInverseQRPolicy
CNoReorganization	Reorganization that does nothing
CPartialQRWithPivoting
CQRReorganization	During reorganization we orthogonalize B
CSelectiveQRWithPivoting	Vectors are orthogonalized only if they are close to be parallel
CSetTraits	This class provides a trait of being set of a given type, i.e
CSetTraits< C0Set< MatrixT > >	Specialization of Traits class
CSetTraits< C1Set< MatrixT > >
CSetTraits< C2Set< MatrixT > >
CSetTraits< CnSet< MatrixT, DEGREE > >
CSwapReorganization	Reorganization is performed if r is bigger than r0 but in coordinate system of r
CTripletonData
►Ndynsys
CBasicC2OdeSolver
CBasicCnOdeSolver
CBasicFadOdeSolver
CBasicOdeSolver	MapT constraints: type definitions:
CC1DynSys
CC1JetMove
CC1JetMove< T, JetT, false >
CC1SetMove
CC1SetMove< T, SetT, false >
CC2DynSys
CC2JetMove
CC2JetMove< T, JetT, false >
CC2OdeSolver
CC2SetMove
CC2SetMove< T, SetT, false >
CCnDynSys
CCnJetMove
CCnJetMove< T, JetT, false >
CCnOdeSolver
CCnSetMove
CCnSetMove< T, SetT, false >
CDiscreteDynSys	DiscreteDynSys is a proxy to convert any Map into discrete Dynamical System
CDLastTermsStepControl
CDynSys	Class dynsys is an abstract class representing a discrete dynamical system
CDynSysMap	DynSysMap is a proxy to convert any Map into discrete Dynamical System
CFadFunction
CFadMap
CFadOdeSolver
CFirstOrderEnclosure
CFixedStepControl
CFlowballSet
CHighOrderEnclosure	This file defines class for computation of [C0-C2] rough enclosure to an ODE by high order Taylor method
CHOSolver
CIEncFoundStepControl
CILastTermsStepControl
CLinear2d
CLinear3d
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
CMpLastTermsStepControl
CNoStepControl	This class provides an empty time step control for the solutions to ODEs. It contains an interface for other implementations of TSC
CNoStepControlInterface
COdeNumTaylor
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
CStepControlInterface< MpLastTermsStepControl, Scalar >	This class is a common interface for StepControl used in PoincareMap and TimeMap. Both classes inherit this interface
CStepControlInterface< NoStepControl, double >
CVLin3D
►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 + Cr0 + Br 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 + Cr0 + Br
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
CIntervalIOTraits
CIntervalIOTraits< double >
CIntervalIOTraits< float >
CIntervalIOTraits< MpReal >
CIntervalTraits
CIntervalTraits< double >
CIntervalTraits< float >
CIntervalTraits< long double >
►Ninvset
CCubicalMap
CForbiddenSet	Class that defines forbidden set
CGetKey
CGraph	It defines a graph that in each node can store additional data
CGraphNode
Cless
Cless< capd::vectalg::Vector< short int, 2 > >
CMapGraph
CMapGraphNodeData
CScope	Class that defines set of regions it can be used do define domain, range, allowed sets for graphs
►Nkrak
►NwxWin
CBuffer
CKrakApp
CKrakFrame
CKrakThread
CAt
Catom
Cbasic_job
CBgColor
Ccolstring
Cconst_string
CCoord3D
Cdel_ins_job
Ced_rec_job
CFgColor
Cfield
Cflexstring
CFrame
Cfrstring
Chlink
CIFrame
CIsomCoord3D	This is a class for isomteric 3D drawing
Citem
Cjob
Clink
Clist
Cmenu_job
CPoint3D	This is a base class for 3D drawing functions
Cpointing_field
CPxl
CRct
Crecord
Csel_job
CTab
CUserMove
Cvar
Cview_job
►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 $R^n\to R$
CMap	This class is used to represent a map
►NmatrixAlgorithms	Matrix algorithms: Gauss elimination, orthonormalization, QR decomposition etc
C_CreateSmithForm_
C_CreateSmithForm_< Matrix< Scalar, 0, 0 > >
►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, false >
CGetExpRemainder< T, true >
CGetPARISmithFormTraits
CIInvert
►CIntMatrixAlgorithmsFactory
CQuotientBaseMatrix
►CSmithForm
CSmithFormThroughFactory
CSolveLinearEquation
CInvert
CPARIInterface
►CPARIIntMatrixAlgorithms
CQuotientBaseMatrix
CSmithForm
CSolveLinearEquation
CPARISmithForm
CQuotientBaseMatrix
CSmithForm
CSmithFormFactory
CSmithFormTraits
CSolveLinearEquation
►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
►Npdes
CC0DoubletonSetGeometricTail
CC0HODoubletonSetGeometricTail	This class uses representation of subset of R^n inherited from template parameter
CC1DoubletonSetGeometricTail
CComputeOneStepSectionEnclosure
CComputeOneStepSectionEnclosure< false >
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
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
►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< int >
CRoundingTraits< long double >
►Nthreading
CBaseTPMap
CDefaultSolverFactory
CLambdaTask
CPMap
CPMapFactory
CSolverFactory	This is an interface of an abstract factory wich creates new instances of a specific solver;
CSolverPool
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
CTMap
CTMapFactory
►Nvectalg
CColumnIterator
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
Cconst_ColumnIterator
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, false >
CConvert< ResultType, ScalarType, true >
CEuclLNorm	Euclidean Logarithmic Norm
CEuclNorm	Euclidean norm
►CMatrix
Crebind
CMatrixContainer	This class inherits form general Container class and provides constructors and methods specific for two dimensional data
CMatrixContainer< Scalar, 0, 0 >
CMaxLNorm	$L_\infty$ Logarithmic Norm
CMaxNorm	$L_\infty$ norm (max norm)
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
CMultipointer	Multipointer always contains nondecreasing list of indexes of variables
CNorm	A general abstract 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
CSumLNorm	Logarytmic norm
CSumNorm	norm
►CVector
Crebind
CBinomial
CBinomial< 0, 0 >
CBinomial< 0, K >
CBinomial< N, 0 >
CBinomial< N, N >
CFactorial
CFactorial< 0 >
CFactorial< 1 >
CFloatingTypeTraits
CIntegralTypeTraits
CNewton
CTexWriter
CTypeTraits	Defines type traits such as their values zero, one etc
CTypeTraits< ::capd::intervals::Interval< T, RT > >	Specialization of TypeTraits for intervals
CTypeTraits< capd::cxsc::Interval >	Specialization for intervals
CTypeTraits< capd::filib::Interval< T, R, M > >	Specialization for intervals
CTypeTraits< capd::multiPrec::MpInt >
CTypeTraits< capd::multiPrec::MpReal >
CTypeTraits< double >	Traits of type double
CTypeTraits< fields::Complex< T > >
CTypeTraits< float >	Traits of type float
CTypeTraits< int >	Traits of type int
CTypeTraits< long >	Traits of type long
CTypeTraits< long double >	Traits of type long double
CTypeTraits< long long >	Traits of type long long
CTypeTraits< short >	Traits of type short
CTypeTraits< T * >
CTypeTraits< Z2 >	Traits of type Z2
CTypeTraits< Zp >	Traits of type Zp
▼Nfadbad
COp< capd::filib::Interval< BoundType, R, M > >
CBaseData
CBaseSetT
CMemberFactorPolicy
Cconst_MatrixIterator
CEmptyIntersectionException
CGraphicalOutput
CGraphT
CHSetT
Clogtwo
Clogtwo< 0 >
CMapIterator
CMatrixIterator
CMatrixSlice	This class represents a matrix without own container and data it is used for operations on submatrices
CNaNException
CNodeData
COde
COdeNum
CpowerThree
CpowerThree< 0 >
CrationalNumber
CRotatedHenonMap
CwxApp
CwxFrame
CwxThread
CZ2
CZp