Here is a list of all files with brief descriptions:

[detail level 1234]

▼ benchmarks
benchmark-recint_exp.C
benchmark-recint_inadd.C
benchmark-recint_inmul.C
benchmark-recint_inv_arazi.C
benchmark-recint_inv_naive.C
benchmark-recint_mul.C
benchmark-recint_mulm.C
benchmark-recint_tmul.C
▼ examples
► FiniteField
all_field.C
domain_to_operatorstyle.C
exponentiation.C
ff_arith.C
GaloisFields.C
GF128.C
GFirreducible.C
gfq_atomic.C
kronecker.C
Test_Extension.C
zpz_atomic.C
► Integer
Fibonacci.C
givaro-ssh-keygen.C
iexponentiation.C
ifactor.C
ifactor_lenstra.C
igcd.C
igcdext.C
ilcm.C
ispower.C
isprime.C
isproot.C
lambda.C
lambda_inv.C
ModularSquareRoot.C
nb_primes.C
nextprime.C
order.C
phi.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
► Matrix
f4n3.cpp
► Polynomial
AES_SubBytes.C
bivariate.C
highorder.C
interpolate.C
isgenerator.C
isirred.C
isprimitive.C
pol_arith.C
pol_eval.C
pol_factor.C
PolynomialCRT.C
trunc_arith.C
► Rational
iratrecon.C
polydouble.C
► RecInt
extended-int-types.C
recint-iterator.C
rsa.C
▼ src
► kernel
► bstruct
bstruct.doxy
givarray0.h	Array of type T with reference mecanism
givarray0.inl
givarrayallocator.h	NO DOC
givarrayfixed.h	ArrayFixed of type T with fixed dimension
givbits.C
givbits.h	Field of n bits, for any n
givbits.inl
givelem.h	Definition of a reference to an object
givhashtable.h	Hash table
givhashtable.inl
givlist0.h	List of type T with double link and various insert/get/rmv method
givlist0.inl
givstack.h	No doc
givstack.inl
► field
chineseremainder.h	Chinese Remainder Algorithm for 2 Elements
extension.h	NO DOX
field.doxy
gf2.h
gf2.inl
gfq.h	Arithmetic on GF(p^k), with p a prime number less than 2^16
gfq.inl
gfqext.h	Arithmetic on GF(p^k), with p a prime number less than 2^15
gfqkronecker.h	Arithmetic on GF(p^k), with dynamic Kronecker substitution
givprimes16.C
givprimes16.h	Set of primes less than 2^16
givrns.h	Modular arithmetic for GIVARO
givrnsconvert.inl
givrnscstor.inl
givrnsfixed.h	Chinese Remainder Algorithm
givrnsfixed.inl
givtablelimits.C
givtablelimits.h
qfield.h	Specialization of Rational Domain NO DOC
StaticElement.h	NO DOC
► gmp++
gmp++.doxy
gmp++.h
gmp++_int.C
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
► integer
givinteger.C
givinteger.h	Integer Domain class specialization
givintfactor.h	Factorisation
givintfactor.inl
givintnumtheo.h	Num theory
givintnumtheo.inl
givintprime.C
givintprime.h	Primes
givintprime.inl
givintrns.h	Arithmetic for RNS representations
givintrns_convert.inl
givintrns_cstor.inl	NO DOC
givintrsa.h	RSA scheme
givintrsa.inl
givintsqrootmod.h	Modular square roots
givintsqrootmod.inl
givspyinteger.h
integer.doxy
random-integer.h
► memory
givaromm.C
givaromm.h	Memory management in Givaro two memory managers:
givmemorer.h
givpointer.h	Auto ptr management
givref_count.h	Definition of the Counter class, Counter
memory.doxy
► rational
givrataddsub.C
givratcompare.C
givratcpy.C
givratcstor.C
givratio.C
givrational.h	Rationals (and domain), composed of an integer (numerator), and a positive integer (denominator) NO DOC
givrational.inl
givratmisc.C
givratmuldiv.C
givratreconstruct.C
rational.doxy
► recint
radd.h
rcmp.h
rconvert.h
rdisplay.h
rdiv.h
recdefine.h
recint.doxy
recint.h
reclonglong.h
rfiddling.h
rint.h
rmadd.h
rmbaddmul.h
rmbexp.h
rmbinv.h
rmbmodule.h
rmbmul.h
rmbreduc.h
rmbrmint.h
rmcmp.h
rmconvert.h
rmdefine.h
rmdisplay.h
rmdiv.h
rmextra.h
rmgaddmul.h
rmgexp.h
rmginv.h
rmgmodule.h
rmgmul.h
rmgreduc.h
rmgrmint.h
rmint.h
rmintmg.h
rmmanip.h
rmmul.h
rmneg.h
rmrandom.h
rmsub.h
rmul.h
rrandom.h
rrint.h
rsub.h
ruadd.h
ruaddmul.h
rucmp.h
ruconvert.h
rudisplay.h
rudiv.h
ruexp.h
rufiddling.h
rugcd.h
ruint.h
ruinvmod.h
rumanip.h
rumul.h
rurandom.h
ruruint.h
rushift.h
rusub.h
rutools.h
► ring
modular-balanced-double.h
modular-balanced-double.inl
modular-balanced-float.h
modular-balanced-float.inl
modular-balanced-int32.h
modular-balanced-int32.inl
modular-balanced-int64.h
modular-balanced-int64.inl
modular-balanced.h
modular-extended.h
modular-extended.inl
modular-floating.h
modular-floating.inl
modular-general.h
modular-general.inl
modular-implem.h	Generic implementation of Modular
modular-integer.h
modular-integer.inl
modular-integral.h	Representation of `Z/mZ` over int types
modular-integral.inl
modular-inttype.h
modular-inttype.inl
modular-log16.h
modular-log16.inl
modular-mulprecomp.inl
modular-ruint.h	The standard arithmetic in modular rings using fixed size precision
modular-ruint.inl
modular.h	Family of arithmetics over Zpz ( \(\mathbf{Z}/p\mathbf{Z}\))
montgomery-int32.h
montgomery-int32.inl
montgomery-ruint.h
montgomery-ruint.inl
montgomery.h	Family of arithmetics over Zpz ( \(\mathbf{Z}/p\mathbf{Z}\))
ring-interface.h
ring.doxy
unparametric-operations.h
zring.h
► system
givbasictype.C
givbasictype.h	NO DOC
givcaster.h	NO DOC
givconfig.h	Configuration file for Givaro
giverror.C
giverror.h	Error exception
givgenarith.h	Domain definition for basic type of the language
givinit.C
givinit.h	NO DOC
givmodule.C
givmodule.h	NO DOC
givomptimer.h
givperf.h	Performance analysis
givpower.h	NO DOC
givprint.h	Helper print for containers
givranditer.h	NO DOC Givaro ring Elements generator
givrandom.h	NO DOC
givtimer.C
givtimer.h	Timer
givtypestring.h
system.doxy
udl.h
► library
► matrix
givmatdense.h
givmatdenseops.inl
givmatrix.C
givmatrix.h
givmatsparse.h
givmatsparseops.inl
givmatstorage.h
givmatstoragedense.h
givmatstoragesparse.h
► poly1
givdegree.C
givdegree.h	NO DOC opaque class for Degree of polynomial
givindeter.C
givindeter.h	Indeterminates for polynomial manipulation
givinterp.h	NO DOC
givinterpgeom-multip.h	Interpolation at geometric points
givinterpgeom.h	Interpolation at geometric points
givpoly1.h	NO DOC
givpoly1addsub.inl
givpoly1axpy.inl
givpoly1crt.h	Polynomial Chinese Remaindering of degree 1
givpoly1crtconvert.inl
givpoly1crtcstor.inl
givpoly1cstor.inl
givpoly1cyclo.inl
givpoly1dense.h	Univariate polynomial over T
givpoly1denseops.inl
givpoly1factor.h	NO DOC
givpoly1factor.inl
givpoly1gcd.inl
givpoly1io.inl
givpoly1kara.inl
givpoly1midmul.inl
givpoly1misc.inl
givpoly1muldiv.inl
givpoly1padic.h	NO DOC
givpoly1proot.inl
givpoly1ratrecon.inl
givpoly1sqrfree.inl
givpoly1tabcycl.h	Tabulation of factors of cyclotomic polynomials of degree expo modulo mod
givpoly1tabcycl.inl
► tools
givarithmetics.h
givblas.h
givcategory.h
givfixedtrunc.h
givfractiondomain.h
givhighorder.h
giviterator.h
givops.C
givops.h
givquotientdomain.h
givtruncdomain.h
givtruncdomain.inl
► vector
givstorage.h
givstoragedense.h
givstoragesparse.h
givvectdenseops.inl
givvectdensespe.inl
givvector.C
givvector.h
givvectordense.h
givvectordense.inl
givvectorsparse.h
givvectorsparse.inl
givvectsparseops.inl
dummy.C
▼ tests
test-brillhart.C
test-conversion.C
test-crt.C	NO DOC
test-extension.C
test-ffarith.C
test-fieldarith.h
test-geom.C
test-ifactor.C
test-integer.C	Tests integer.h fucntions not tested elsewhere
test-matrix.C
test-midmul.C
test-mod.C
test-modsqroot.C	NO DOC
test-modularmulprecomp.C
test-poly.C
test-qfield.C
test-random.C	We test bounds for random Integers
test-rational-class.C
test-ratrecon.C
test-recint_cast.C
test-recint_convert.C
test-recint_exp.C
test-recint_extra.C
test-recint_rand.C
test-regression.C
test-ringarith.C
test-rint_arith.C
test-rmint_arith.C
test-rmint_comparisons.C
test-rmint_complex.C
test-rmint_constructors.C
test-rmint_inv_div.C
test-rmint_montgomery.C
test-rmint_neg.C
test-ruint_arazi.C
test-ruint_arith.C
test-ruint_comparisons.C
test-ruint_complex.C
test-ruint_constructors.C
test-ruint_fiddling.C
test-ruint_lmul.C
test-ruint_operators.C
test-ruint_shift.C
test-ruint_square.C
test-trunc.C
config.h
mainpage.doxy
givaro-config.h
givaro.doxy