Givaro
File List
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.hNO DOC Givaro field Elements generator
givaromm.hMemory management in Givaro two memory managers:
givarray0.hArray of type T with reference mecanism
givarrayallocator.hNO DOC
givarrayfixed.hArrayFixed of type T with fixed dimension
givbasictype.hNO DOC
givbits.hField of n bits, for any n
givcaster.hNO DOC
givconfig.hConfiguration file for Givaro
givcra.hChinese Remainder Algorithm for 2 Elements
givdegree.hNO DOC opaque class for Degree of polynomial
givelem.hDefinition of a reference to an object
giverror.hError exception
givextension.hNO DOX
givgenarith.hDomain definition for basic type of the language
givgfq.hArithmetic on GF(p^k), with p a prime number less than 2^16
givgfqext.hArithmetic on GF(p^k), with p a prime number less than 2^15
givgfqkron.hArithmetic on GF(p^k), with dynamic Kronecker substitution
givhashtable.hHash table
givindeter.hIndeterminates for polynomial manipulation
givinit.hNO DOC
givinteger.hInteger Domain class definition
givinterp.hNO DOC
givinterpgeom-multip.hInterpolation at geometric points
givinterpgeom.hInterpolation at geometric points
givintfactor.hFactorisation
givintnumtheo.hNum theory
givintprime.hPrimes
givintrns.hArithmetic for RNS representations
givintrsa.hRSA scheme
givintsqrootmod.hModular square roots
givlist0.hList of type T with double link and various insert/get/rmv method
givmodule.hNO DOC
givmontg32.hNO DOC
givperf.hPerformance analysis
givpointer.hAuto ptr management
givpoly1.hNO DOC
givpoly1crt.hPolynomial Chinese Remaindering of degree 1
givpoly1dense.hUnivariate polynomial over T
givpoly1factor.hNO DOC
givpoly1padic.hNO DOC
givpower.hNO DOC
givprimes16.hSet of primes less than 2^16
givrandom.hNO DOC
givrational.hRationals (and domain) NO DOC
givref_count.hDefinition of the Counter class, Counter
givrns.hModular arithmetic for GIVARO
givrnsfixed.hChinese Remainder Algorithm
givstack.hNo doc
givtablelimits.hZech extension
givtimer.hTimer
givzpz.hFamily of arithmetics over Zpz ( $\mathbf{Z}/p\mathbf{Z}$)
givzpz16std.hArithmetic on Z/pZ, with p a prime number less than 2^14
givzpz16table1.hArithmetic on Z/pZ, with tabulation of operations
givzpz32std.hArithmetic on Z/pZ, with p a prime number less than $2^32$
givzpz32uns.hArithmetic on Z/pZ, with p a prime number less than 2^32
givzpz64std.hZpz on 64bit words Arithmetic on Z/pZ, with p a prime number less than 2^64 Modulo typedef is a signed long number
givzpzInt.hArithmetic on Z/pZ, with p a prime number in arbitrary precision
givzpztypes.hFamily of types for arithmetic over Zpz
gmp++_int.hCore gmp++_int.h
gmp++_int_add.CAdding stuff
gmp++_int_compare.CRoutines to compare integers
gmp++_int_cstor.CCstoring stuff
gmp++_int_div.CDiving stuff
gmp++_int_gcd.CGcding stuff
gmp++_int_io.CIoing stuff
gmp++_int_lib.CLibing stuff
gmp++_int_misc.CMiscing stuff
gmp++_int_mod.CModing stuff
gmp++_int_mul.CMuling stuff
gmp++_int_pow.CPowing stuff
gmp++_int_rand.inlRanding stuff
gmp++_int_sub.CSubing stuff
gmp++_rat.hCore Rationel from GMP
gmp++_rat_compare.CRoutines 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.hNO DOC
test-crt.CNO DOC
test-integer.CTests integer.h fucntions not tested elsewhere
test-modsqroot.CNO DOC
test-random.CWe test bounds for random Integers
Test_Extension.C
trunc_arith.C
zpz_atomic.C