File List

Here is a list of all documented files with brief descriptions:

[detail level 1234]

examples
FiniteField
all_field.C
domain_to_operatorstyle.C
exponentiation.C
ff_arith.C
GF128.C
GFirreducible.C
gfq_atomic.C
Test_Extension.C
zpz_atomic.C
Integer
Fibonacci.C
iexponentiation.C
ifactor.C
ifactor_lenstra.C
igcd.C
igcdext.C
ilcm.C
ispower.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
Polynomial
highorder.C
interpolate.C
isirred.C
isprimitive.C
pol_arith.C
pol_eval.C
pol_factor.C
PolynomialCRT.C
trunc_arith.C
Rational
iratrecon.C
polydouble.C
src
kernel
bstruct
givarray0.h	Array of type T with reference mecanism
givarrayallocator.h	NO DOC
givarrayfixed.h	ArrayFixed of type T with fixed dimension
givbits.h	Field of n bits, for any n
givelem.h	Definition of a reference to an object
givhashtable.h	Hash table
givlist0.h	List of type T with double link and various insert/get/rmv method
givstack.h	No doc
field
chineseremainder.h	Chinese Remainder Algorithm for 2 Elements
extension.h	NO DOX
gfq.h	Arithmetic on GF(p^k), with p a prime number less than 2^16
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.h	Set of primes less than 2^16
givrns.h	Modular arithmetic for GIVARO
givrnsfixed.h	Chinese Remainder Algorithm
qfield.h	Specialization of Rational Domain NO DOC
StaticElement.h	NO DOC
gmp++
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.h	Integer Domain class specialization
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
memory
givaromm.h	Memory management in Givaro two memory managers:
givpointer.h	Auto ptr management
givref_count.h	Definition of the Counter class, Counter
rational
givrational.h	Rationals (and domain), composed of an integer (numerator), and a positive integer (denominator) NO DOC
ring
modular-implem.h	Generic implementation of Modular
modular-integral.h	Representation of Z/mZ over int types
modular-ruint.h	The standard arithmetic in modular rings using fixed size precision
modular.h	Family of arithmetics over Zpz ( )
montgomery.h	Family of arithmetics over Zpz ( )
system
givbasictype.h	NO DOC
givcaster.h	NO DOC
givconfig.h	Configuration file for Givaro
giverror.h	Error exception
givgenarith.h	Domain definition for basic type of the language
givinit.h	NO DOC
givmodule.h	NO DOC
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.h	Timer
library
poly1
givdegree.h	NO DOC opaque class for Degree of polynomial
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
givpoly1crt.h	Polynomial Chinese Remaindering of degree 1
givpoly1dense.h	Univariate polynomial over T
givpoly1factor.h	NO DOC
givpoly1padic.h	NO DOC
tests
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