| BaseTimer | Copyright (C) 1994-1997 Givaro Team |
| basicNumber< TScalar > | BasicNumber represents elements of F_q and F_q[epsilon]. Limitations |
| 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::CenterFocusOptions | Centerfocus options class draft |
| nCenterFocus::CenterfocusParams | Centerfocus options parser and manager |
| nCenterFocus::CoeffList | Bear some monoms (x^x_exp*y^y_exp) in P, Q polynoms of the centerfocus problem in mind |
| nCenterFocus::CoeffListEntry | Able to bear a given monom (x^x_exp*y^y_exp) in P or Q polynom of the centerfocus problem in mind |
| Counters | |
| nCenterFocus::fast_Frommer< TRing, t > | Implemets the Frommer algorithm. The code is more or less optimized, therefore see nCenterFocus::Frommer for human readable implementation |
| 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/field with small characteristic; For all operations the user must enshure that the operators are regular represantants of ring elements, in doubt by calling the Convert() function. Currently all represantant values mus 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 |
| fieldScalar< TScalar > | Class representing elements of F_q. Limitation: |
| nCenterFocus::Frommer< TNum > | Implemets the Frommer algorithm |
| kdefs_zahl_x< CHAR, EPSPREC > | Template parameter definition for fast_Ring class, parametrized by static field characteristik during compile time |
| matrixdefs< CHAR > | Template parameter definition for matrix classes (simulated by fast_polynomxy), parametrized by char(field) during compile time |
| needbits< NUM > | Needbits<x>::value computes number of required bits to represent integer x during compile time |
| needbits< 1 > | Needbits<1>::value computes number of required bits to represent integer 1 during compile time |
| nextpow2num< CHAR > | Nextpow2num<x>::value berechet zur Compilezeit die kleinstsmoegliche Zweierpotenz value (vaue=2^a), so dass noch (2^x kleinergleich value) gilt, wenn x die Anzahl der Bits ist, die benoetigt wird, um die Zahl CHAR darzustellen |
| 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 |
| Parameterlist | Stores parsed program parameters from input file in Macaulay-style |
| 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 |
| polynompairdefs< DEGREE > | Polynompair traits |
| polynomx< TNum > | Polynom in one variable |
| polynomxy< TNum > | Class used to store the coefficients of a polynom in (x,y) |
| pow2< NN > | Pow2<x>::value computes 2 to power of x during compile time |
| pow2< 0 > | Pow2<0>::value computes 2 to power of 0during compile time |
| nCenterFocus::RankStatistic | Designed to hold statistics of a single centerfocus experiment, namely distribution of jacobian rank for different numbers of vanished focal values |
| rationalNumber | Rational number. Value range of the numerator and nominator is shrinked to a range of an 'int' |
| RealTimer | |
| nCenterFocus::Statistic | Designed to store centerfocus experiment trial counts and trial counts statistics about the number of first at least vanished focal values |
| SysTimer | |
| tBlockPos | |
| Timer | Copyright (C) 1994-1997 Givaro Team |
| TMatrix< TRing > | Template matrix. Supports rank and kernel computations over a finite field (naive implementation, very slow - use FFPACK instead) Matrix size is shrinked to 'int'. Data layout is row-by-row |
| tPos | Matrix element position |
| TVector< TRing > | Template vector class. May filled with elements of TRing. Vectorsize is shrinked to size_t |
| UserTimer | |
| xyExpPair | Exponents of monom in (x,y)-> negative exponets not allowed! |
| xyMonom< ccoeff > | Represents a monom template in two variables. Therefore negative exponents are not allowed |
1.5.6