  __giv_map_less_ith< T, UNARYOP, ith > | Map opcode on all Elements less or requal that ith |
| __givdom_trait_name< T > | Give a name for /read/write |
 _perfArray0< T > | Defined by marco GIVARO_PERF_DEFCLASS. ref counting and stuff |
  Array0< T > | NODOC |
  ArrayAllocatort< T, Tag > | ArrayAllocator: class for allocation of arrays |
| Array0< Bits::base > | |
| Array0< Domain > | |
| Array0< Indice_t > | |
| Array0< Modular< Ints > > | |
| Array0< modulo > | |
| Array0Tag | Array0Tag |
| ArrayFixed< T, SIZE > | ArrayFixed |
| BaseDomain< T > | Base Domain |
| BaseTimer | Base for class RealTimer; class SysTimer; class UserTimer; |
| RealTimer | Real timer |
| SysTimer | Sys timer |
| UserTimer | User timer |
| Bits | Bits |
| BlocFreeList | Data structure of a bloc |
| ChineseRemainder< Ring, Domain, REDUCE > | CRA |
| ChineseRemainder< Ring, Domain, false > | CRA2 |
| Degree | Degree type for polynomials |
| ElemConstRef< T > | Elem const Ref |
| ElemRef< T > | Elem Ref |
| Extension< BaseField > | Extension |
| GeneralRingNonZeroRandIter< Ring, RandIter > | Random iterator for nonzero random numbers |
| GeneralRingRandIter< Ring > | UnparametricRandIter |
| GF2 | Integers modulo 2 |
| GFqDom< TT > | Class GFqDom |
| GFqExtFast< TT > | GFq Ext |
| GFqExt< TT > | GFq Ext (other) |
| GFqKronecker< TT, Ints > | GFqKronecker |
| GFqDom< int64_t > | |
| GIV_ExtensionrandIter< ExtensionField, Type > | Extension rand iters |
| GIV_randIter< Ring, Type > | Random ring Element generator |
| GivaroMain | Initialisation of GIVARO |
| GivaroAppli | Main application class Could be not used |
| GivaroMM< T > | Memory manager that allocates array of object of type T for |
| GivaroNoInit | GivaroNoInit |
| GivError | Base class for exeception handling in Givaro |
| GivBadFormat | Exception thrown in input of data structure |
| GivMathDivZero | Div by 0 |
| GivMathError | Math error |
| GivMMFreeList | Implementation of a memory manager with free-lists |
| GivMMInfo | Static informations of memory allocation |
| GivMMRefCount | Memory management with reference counter on allocated data |
| GivModule | GivModule |
| givNoCopy | Used to call cstor without copy |
| givNoInit | Used to build no initialized object as static object |
| GivRandom | GivRandom |
| givWithCopy | Used to call cstor with copy |
| HashTable< T, Key > | Hash table |
| HashTable< T, Givaro::Key > | |
| Indeter | Indeterminate |
| InitAfter | InitAfter |
| Integer | This is the Integer class |
| IntegerDom | Integer Domain |
| FermatDom | Fermat numbers |
| IntPrimeDom | Primality tests |
| IntFactorDom< MyRandIter > | Integer Factor Domain |
| IntNumTheoDom< MyRandIter > | Num theory Domain |
| IntRSADom< MyRandIter > | RSA domain |
| IntSqrtModDom< MyRandIter > | Modular square roots |
| IntRNSsystem< Container, Alloc > | RNS system class. No doc |
| Poly1PadicDom< Domain, Dense > | Poly1 p-adic |
| Key< T > | The class Key |
| List0< T > | ListO |
| Modular< Storage_t, COMP > | Forward declaration for Givaro::Modular |
| Modular< int16_t, COMP > | This class implement the standard arithmetic with Modulo Elements |
| Modular< int32_t, COMP > | This class implement the standard arithmetic with Modulo Elements |
| Modular< int64_t, COMP > | This class implement the standard arithmetic with Modulo Elements |
| Modular< int8_t, COMP > | This class implement the standard arithmetic with Modulo Elements |
| Modular< Integer, Integer > | This class implement the standard arithmetic with Modulo Elements |
| Modular< Ints > | |
| Modular< Log16, Log16 > | This class implement the standard arithmetic with Modulo Elements |
| Modular< RecInt::ruint< K >, RecInt::ruint< K > > | The standard arithmetic in modular rings using fixed size precision |
| Modular< uint16_t, COMP > | Specialization of Modular to uint64_t element type with efficient dot product |
| Modular< uint32_t, COMP > | This class implement the standard arithmetic with Modulo Elements |
| Modular< uint64_t, COMP > | Specialization of Modular to uint64_t element type with efficient dot product |
| ModularRandIter< Ring > | Random ring Element generator |
| Montgomery< int32_t > | This class implements the standard arithmetic with Modulo Elements |
| Montgomery< RecInt::ruint< K > > | The recint-based Montgomery ring |
| Neutral | Neutral type |
| NewtonInterpGeom< Domain, REDUCE > | Newton |
| NewtonInterpGeomMultip< Domain, REDUCE > | Newton (multip) |
| ObjectInit | GivModule |
| OMPTimer | OMP timer |
| Pair< T1, T2 > | Pair |
| Poly1CRT< Field > | Poly1 CRT |
| Poly1Dom< Domain, Dense > | Class Poly1Dom |
| Interpolation< Domain, REDUCE > | Interpolation |
| Poly1PadicDom< Domain, Dense > | Poly1 p-adic |
| Poly1FactorDom< Domain, Tag, RandomIterator > | Poly1FactorDom |
| Poly1FactorDom< BFT, Dense > | |
| Poly1FactorDom< Domain, Tag > | |
| CyclotomicTable< Domain, Tag > | CyclotomicTable |
| Primes16 | Class Primes16 |
| QField< Rational > | Rational Domain |
| RandomIntegerIterator< _Unsigned, _Exact_Size > | Random Integer Iterator |
| Rational | Rationals. No doc |
| RefCounter | Ref counter |
| RefCountPtr< T > | Refcount Pointer |
| RNSsystem< RING, Domain > | Class RNSsystem |
| RNSsystem< Ints, Modular< Ints > > | |
| RNSsystemFixed< Ints > | NO DOC |
| Stack< THING > | Stack |
| StaticElement< DomainStyle > | Static Element |
| StaticElement< Field > | |
| Timer | Timer |
| vector< T > | STL class |
| givvector< T, A > | Givvector |
| VectorDom< Domain, StorageTag > | VectorDom<Domain,StorageTag> |
| VectorDom< Domain, Dense > | |
| ZRing< Element > | Class ZRing |
1.8.5