Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
nCenterFocus::BaseQuadricsStatisticHold statistics of a single centerfocus experiment : distribution of jacobian rank for different numbers of vanished focal values and different ranks of corresponding quadrics list
nCenterFocus::BaseRankStatisticDesigned to hold statistics of a single centerfocus experiment, namely distribution of jacobian rank for different numbers of vanished focal values
BaseTimerCopyright (C) 1994-1997 Givaro Team
basicNumber< TScalar >BasicNumber represents elements of finite Field F_q and finite Ring F_q[epsilon].
Limitation: field element representatives assumed as positive and only values between {0...characterristic-1}
BlockMatrix< TRing >Temlate block matrix data. The matrix is composed by submatrix blocks. These blocks are stored line by line. The data in submatrices is also stored line-by-line. Matrixsize is shrinked to 'int'
nCenterFocus::CenterFocusExperiment< variant >
nCenterFocus::CenterFocusOptionsCenterfocus options class draft
nCenterFocus::CenterfocusParams< TPolynomXY, TRing >Centerfocus options parser and manager
CFilterStrategy
nCenterFocus::CFJacobianInfo< Matrix_Type >
CFPointFilter
nCenterFocus::CFQuadricsResult< MatrixType, Matrix3DType >
nCenterFocus::CFRandomExperiment< variant, TPolynomXY, TFrommer1, TFrommer2 >
nCenterFocus::CFSingleResult< PolynomXY_Type, FocalValuesInfoType, CFJacobianInfoType, CFQuadricsResultType, CPointLiftInfoType >
nCenterFocus::CoeffListKeeps some monoms (x^x_exp*y^y_exp) in P, Q polynoms of the centerfocus problem in mind
nCenterFocus::CoeffListEntryAble to bear a given monom (x^x_exp*y^y_exp) in P or Q polynom of the centerfocus problem in mind
nCenterFocus::CPointLiftInfo< EpsFrommerType, CFLiftPointType >
dynamicPolynomdefsNoShift
dynamicPolynomdefsNoShiftNoMemoryHoles
dynamicQuadraticMatrixDefsNoShift
nCenterFocus::EmptyFailedLiftStatistic
ExperimentDefs< TInfEpsFrommer, TFrommer1, TFrommer2 >
nCenterFocus::ExtendedFailedLiftStatistic
nCenterFocus::FailedLiftStatistic
nCenterFocus::fast_Frommer< TFrommerDefs, variant >Besserer test wäre frommer je mit doitOld und doitNew aufzurufen und dann die Matrizen A und B zu vergleichen
fast_polynomx< TNum >Manages fast access to coefficients of a polynom in x
fast_polynomXY< defs, TNum >This class manages coefficients of a polynom in (x,y) with template type TNum, see detailed description. Limitations: exponent is bounded to a 'short int', maxDegree is bounded to a 'short int'
fast_polynomXY_pair< defs, TNum >This class manages coefficient pairs of a polynom in (x,y) with template type TNum, see detailed description, Designed for (dxA, dyA)-Pair, but there is no performance gain..
fast_Ring< TNum, kdefs >Implements some fast basic operations for elemens of a ring F_q[epsilon] or field F_q with small characteristic;
For all operations the user must be sure that the operators are regular represantants of ring elements, in doubt by calling the Convert() function. Currently all represantant values must lie between 0 and (characteristic-1). Allowed 'eps' precisions are 0 (is a field) and 1 (is a ring)
Parametrized with element Type (TNum) and characteristic of the field the ring is based on during compile time
FFpackMatrix< Field >Wrapper around FFPACK matrices with some additional functionality. Matrix data_m is stored row-by row. \*Namenskonsistenz zwischen Dateinamen und Klassennamen wiederherstellen
fieldScalar< TScalar >Class representing elements of F_q.
Limitation: field element representatives assumed as positive and only values between {0...characterristic-1}
CFPointFilter::FilterRateCounterPairPair of a filter pass rate and a point counter. everytime
nCenterFocus::FocalValuesInfo< FocalValueType >
nCenterFocus::Frommer< TFrommerDefs, variant >Implemets the Frommer algorithm
FrommerDefs< TRing, TPolynomXY, TTMatrixXY, TTMatrixXY_0, TPolynomXYPair, TTMatrixXYPair >
kdefs_zahl_x< CHAR, EPSPREC >Template parameter definition for fast_Ring class, parametrized by static field characteristik during compile time
nCenterFocus::LiftAndQuadricsStatisticHold statistics of a single centerfocus experiment : distribution of jacobian rank for different numbers of vanished focal values , different ranks of corresponding quadrics list separately for non-smooth and potential smooth points. For non-smooth points the observed minimal failed lift nr is logged
Matrix3D< TMatrix2D >Stores a set of ordinatry matrices
matrixdefs< CHAR >Template parameter definition for matrix classes (simulated by fast_polynomXY), parametrized by char(field) during compile time
MtcpCheckpointManager
needbits< NUM >Needbits<x>::value computes number of required bits to represent unsigned integer x during compile time
needbits< 0 >
needbits< 1 >Needbits<1>::value computes number of required bits to represent integer 1 during compile time
nextpow2num< CHAR >Nextpow2num<x>::value computes (at compile time) a power of 2 -value such that $ \mbox { \large $ 2^x < value=2^a $ } $ is valid, where x is the minimal number of bits to represent the unsigned integer CHAR
number_eps0< CHAR, TScalar >Datatype for an element of an finite field with characteristik 'CHAR'
number_eps1< CHAR, TScalar, TScalarPair >Class representing elements of F_q[epsilon];
compact datatype for (x,eps)-Pair; field characteristic is parametrized during compile time
ParameterStores triple (paramater name, value, comment) and print order information order_m. It is also possible to mark used parameters with markUsed(). An application is for example detecting typing errors in input parameters
ParameterlistStores parsed program parameters from input file in Macaulay-style
PointFilterKeyRepresents a key for a PointFilterRule
PointFilterRuleA single Point Filter Rule Config
polynomdefs< DEGREE >Template parameter definition for fast_polynomXY (Traits), parametrized by characteristic(field) during compile time. The design was more try and error than applying common metaprogramming concepts, but this schould be the right way
polynomdefsNew< DEGREE >Polynom traits
polynomdefsNoShift< DEGREE >PolynomdefsNoShift: bei dieser Datenstruktur liegen die Polynomkoeffizienten noch nicht hintereinander
PolynomialRing< TPolynomXY, TRing >
polynompairdefs< DEGREE >Polynompair traits
polynomx< TNum >Polynom in one variable
polynomXY< TNum, TIndex >Class used to store the coefficients of a polynom in (x,y)
pow2< NN >Pow2<x>::value computes $ \mbox {\large $ 2^x $ } $ during compile time
the computation is recursive and there are some compiler-depending recursion limits, usually 256
pow2< 0 >Pow2<0>::value represents $ \mbox {\large $ 2^0=1 $ } $ during compile time
nCenterFocus::PrintCenterFocusResults
nCenterFocus::QuadricsStatisticHold statistics of a single centerfocus experiment : distribution of jacobian rank for different numbers of vanished focal values and different ranks of corresponding quadrics list separately for non-smooth and potential smooth points
nCenterFocus::RankAndLiftStatistic
rationalNumberRational number. Value range of the numerator and nominator is shrinked to a range of an 'int'
RealTimer
rule_term_scanned
fast_Ring< TNum, kdefs >::sqrtInf
nCenterFocus::Statistic< safe >Designed to store centerfocus experiment trial counts and trial count statistics about the number of first at least vanished focal values
SysTimer
tBlockPos
TimerTimer, copyright (C) 1994-1997 Givaro Team; License: LGPL
TMatrix< TRing >Template matrix. Supports rank and kernel computations over a finite field (naive implementation, very slow - use FFPACK Matrices for faster computation) Matrix size is shrinked to 'int'. Data layout is row-by-row
tPosMatrix element position
TVector< TRing >Template vector class. May filled with elements of TRing. Vectorsize is shrinked to size_t
UserTimer
xyExpPairExponents of monom in (x,y)-> negative exponets not allowed!
xyMonom< ccoeff >Represents a monom template in two variables. Therefore negative exponents are not allowed
xyOneForm< PolynomXYType >
xyOneFormTerm< xyMonomType >
Generated on Tue Nov 23 13:10:53 2010 for centerfocus by  doxygen 1.6.3