Here is a list of all documented files with brief descriptions:
| all_field.C | |
| domain_to_operatorstyle.C | |
| exponentiation.C | |
| ff_arith.C | |
| GF128.C | |
| GFirreducible.C | |
| gfq_atomic.C | |
| giv_randiter.h | NO DOC Givaro field Elements generator |
| givaromm.h | Memory management in Givaro two memory managers: |
| givarray0.h | Array of type T with reference mecanism |
| givarrayallocator.h | NO DOC |
| givarrayfixed.h | ArrayFixed of type T with fixed dimension |
| givbasictype.h | NO DOC |
| givbits.h | Field of n bits, for any n |
| givcaster.h | NO DOC |
| givconfig.h | Configuration file for Givaro |
| givcra.h | Chinese Remainder Algorithm for 2 Elements |
| givdegree.h | NO DOC opaque class for Degree of polynomial |
| givelem.h | Definition of a reference to an object |
| giverror.h | Error exception |
| givextension.h | NO DOX |
| givgenarith.h | Domain definition for basic type of the language |
| givgfq.h | Arithmetic on GF(p^k), with p a prime number less than 2^16 |
| givgfqext.h | Arithmetic on GF(p^k), with p a prime number less than 2^15 |
| givgfqkron.h | Arithmetic on GF(p^k), with dynamic Kronecker substitution |
| givhashtable.h | Hash table |
| givindeter.h | Indeterminates for polynomial manipulation |
| givinit.h | NO DOC |
| givinteger.h | Integer Domain class definition |
| givinterp.h | NO DOC |
| givinterpgeom-multip.h | Interpolation at geometric points |
| givinterpgeom.h | Interpolation at geometric points |
| givintfactor.h | Factorisation |
| givintnumtheo.h | Num theory |
| givintprime.h | Primes |
| givintrns.h | Arithmetic for RNS representations |
| givintrsa.h | RSA scheme |
| givintsqrootmod.h | Modular square roots |
| givlist0.h | List of type T with double link and various insert/get/rmv method |
| givmodule.h | NO DOC |
| givmontg32.h | NO DOC |
| givperf.h | Performance analysis |
| givpointer.h | Auto ptr management |
| givpoly1.h | NO DOC |
| givpoly1crt.h | Polynomial Chinese Remaindering of degree 1 |
| givpoly1dense.h | Univariate polynomial over T |
| givpoly1factor.h | NO DOC |
| givpoly1padic.h | NO DOC |
| givpower.h | NO DOC |
| givprimes16.h | Set of primes less than 2^16 |
| givrandom.h | NO DOC |
| givrational.h | Rationals (and domain) NO DOC |
| givref_count.h | Definition of the Counter class, Counter |
| givrns.h | Modular arithmetic for GIVARO |
| givrnsfixed.h | Chinese Remainder Algorithm |
| givstack.h | No doc |
| givtablelimits.h | Zech extension |
| givtimer.h | Timer |
| givzpz.h | Family of arithmetics over Zpz (  ) |
| givzpz16std.h | Arithmetic on Z/pZ, with p a prime number less than 2^14 |
| givzpz16table1.h | Arithmetic on Z/pZ, with tabulation of operations |
| givzpz32std.h | Arithmetic on Z/pZ, with p a prime number less than  |
| givzpz32uns.h | Arithmetic on Z/pZ, with p a prime number less than 2^32 |
| givzpz64std.h | Zpz on 64bit words Arithmetic on Z/pZ, with p a prime number less than 2^64 Modulo typedef is a signed long number |
| givzpzInt.h | Arithmetic on Z/pZ, with p a prime number in arbitrary precision |
| givzpztypes.h | Family of types for arithmetic over Zpz |
| gmp++_int.h | Core gmp++_int.h |
| gmp++_int_add.C | Adding stuff |
| gmp++_int_compare.C | Routines to compare integers |
| gmp++_int_cstor.C | Cstoring stuff |
| gmp++_int_div.C | Diving stuff |
| gmp++_int_gcd.C | Gcding stuff |
| gmp++_int_io.C | Ioing stuff |
| gmp++_int_lib.C | Libing stuff |
| gmp++_int_misc.C | Miscing stuff |
| gmp++_int_mod.C | Moding stuff |
| gmp++_int_mul.C | Muling stuff |
| gmp++_int_pow.C | Powing stuff |
| gmp++_int_rand.inl | Randing stuff |
| gmp++_int_sub.C | Subing stuff |
| gmp++_rat.h | Core Rationel from GMP |
| gmp++_rat_compare.C | Routines to compare integers |
| highorder.C | |
| iexponentiation.C | |
| ifactor.C | |
| ifactor_lenstra.C | |
| igcd.C | |
| igcdext.C | |
| ilcm.C | |
| interpolate.C | |
| iratrecon.C | |
| isirred.C | |
| ispower.C | |
| isprimitive.C | |
| isproot.C | |
| lambda.C | |
| lambda_inv.C | |
| ModularSquareRoot.C | |
| nb_primes.C | |
| nextprime.C | |
| order.C | |
| phi.C | |
| pol_arith.C | |
| pol_eval.C | |
| pol_factor.C | |
| polydouble.C | |
| PolynomialCRT.C | |
| prevprime.C | |
| primitiveelement.C | |
| primitiveroot.C | |
| probable_primroot.C | |
| ProbLucas.C | |
| RSA_breaking.C | |
| RSA_decipher.C | |
| RSA_encipher.C | |
| RSA_keys_generator.C | |
| StaticElement.h | NO DOC |
| test-crt.C | NO DOC |
| test-integer.C | Tests integer.h fucntions not tested elsewhere |
| test-modsqroot.C | NO DOC |
| test-random.C | We test bounds for random Integers |
| Test_Extension.C | |
| trunc_arith.C | |
| zpz_atomic.C |
