Givaro
File List
Here is a list of all files with brief descriptions:
o*all_field.C
o*bstruct.doxy
o*config.h
o*domain_to_operatorstyle.C
o*dummy.C
o*exponentiation.C
o*ff_arith.C
o*GaloisFields.C
o*GF128.C
o*GFirreducible.C
o*gfq_atomic.C
o*giv_randiter.hNO DOC Givaro field Elements generator
o*givarithmetics.h
o*givaro-config.h
o*givaro.doxy
o*givaromm.C
o*givaromm.hMemory management in Givaro two memory managers:
o*givarray0.hArray of type T with reference mecanism
o*givarray0.inl
o*givarrayallocator.hNO DOC
o*givarrayfixed.hArrayFixed of type T with fixed dimension
o*givbasictype.C
o*givbasictype.hNO DOC
o*givbits.C
o*givbits.hField of n bits, for any n
o*givbits.inl
o*givcaster.hNO DOC
o*givcategory.h
o*givconfig.hConfiguration file for Givaro
o*givcra.hChinese Remainder Algorithm for 2 Elements
o*givdegree.C
o*givdegree.hNO DOC opaque class for Degree of polynomial
o*givelem.hDefinition of a reference to an object
o*giverror.C
o*giverror.hError exception
o*givextension.hNO DOX
o*givfixedtrunc.h
o*givfractiondomain.h
o*givgenarith.hDomain definition for basic type of the language
o*givgfq.hArithmetic on GF(p^k), with p a prime number less than 2^16
o*givgfq.inl
o*givgfqext.hArithmetic on GF(p^k), with p a prime number less than 2^15
o*givgfqkron.hArithmetic on GF(p^k), with dynamic Kronecker substitution
o*givhashtable.hHash table
o*givhashtable.inl
o*givhighorder.h
o*givindeter.C
o*givindeter.hIndeterminates for polynomial manipulation
o*givinit.C
o*givinit.hNO DOC
o*givinteger.hInteger Domain class definition
o*givinterp.hNO DOC
o*givinterpgeom-multip.hInterpolation at geometric points
o*givinterpgeom.hInterpolation at geometric points
o*givintfactor.hFactorisation
o*givintfactor.inl
o*givintnumtheo.hNum theory
o*givintnumtheo.inl
o*givintprime.C
o*givintprime.hPrimes
o*givintprime.inl
o*givintrns.hArithmetic for RNS representations
o*givintrns_convert.inl
o*givintrns_cstor.inlNO DOC
o*givintrsa.hRSA scheme
o*givintrsa.inl
o*givintsqrootmod.hModular square roots
o*givintsqrootmod.inl
o*giviterator.h
o*givlist0.hList of type T with double link and various insert/get/rmv method
o*givlist0.inl
o*givmatdense.h
o*givmatdenseops.inl
o*givmatrix.C
o*givmatrix.h
o*givmatsparse.h
o*givmatsparseops.inl
o*givmatstorage.h
o*givmatstoragedense.h
o*givmatstoragesparse.h
o*givmodule.C
o*givmodule.hNO DOC
o*givmontg32.C
o*givmontg32.hNO DOC
o*givmontg32.inl
o*givops.C
o*givops.h
o*givperf.hPerformance analysis
o*givpointer.hAuto ptr management
o*givpoly1.hNO DOC
o*givpoly1addsub.inl
o*givpoly1axpy.inl
o*givpoly1crt.hPolynomial Chinese Remaindering of degree 1
o*givpoly1crtconvert.inl
o*givpoly1crtcstor.inl
o*givpoly1cstor.inl
o*givpoly1cyclo.inl
o*givpoly1dense.hUnivariate polynomial over T
o*givpoly1denseops.inl
o*givpoly1factor.hNO DOC
o*givpoly1factor.inl
o*givpoly1gcd.inl
o*givpoly1io.inl
o*givpoly1kara.inl
o*givpoly1misc.inl
o*givpoly1muldiv.inl
o*givpoly1padic.hNO DOC
o*givpoly1proot.inl
o*givpoly1ratrecon.inl
o*givpoly1sqrfree.inl
o*givpower.hNO DOC
o*givprimes16.C
o*givprimes16.hSet of primes less than 2^16
o*givquotientdomain.h
o*givrandom.hNO DOC
o*givrataddsub.C
o*givratcompare.C
o*givratcpy.C
o*givratcstor.C
o*givratio.C
o*givrational.hRationals (and domain) NO DOC
o*givrational.inl
o*givratmisc.C
o*givratmuldiv.C
o*givratreconstruct.C
o*givref_count.hDefinition of the Counter class, Counter
o*givrns.hModular arithmetic for GIVARO
o*givrnsconvert.inl
o*givrnscstor.inl
o*givrnsfixed.hChinese Remainder Algorithm
o*givrnsfixed.inl
o*givstack.hNo doc
o*givstack.inl
o*givstorage.h
o*givstoragedense.h
o*givtablelimits.C
o*givtablelimits.hZech extension
o*givtimer.C
o*givtimer.hTimer
o*givtruncdomain.h
o*givtruncdomain.inl
o*givvectdenseops.inl
o*givvectdensespe.inl
o*givvector.h
o*givvectordense.inl
o*givvectorsparse.h
o*givvectorsparse.inl
o*givvectsparseops.inl
o*givzpz.hFamily of arithmetics over Zpz ( $\mathbf{Z}/p\mathbf{Z}$)
o*givzpz16std.C
o*givzpz16std.hArithmetic on Z/pZ, with p a prime number less than 2^14
o*givzpz16std.inl
o*givzpz16table1.C
o*givzpz16table1.hArithmetic on Z/pZ, with tabulation of operations
o*givzpz16table1.inl
o*givzpz32std.C
o*givzpz32std.hArithmetic on Z/pZ, with p a prime number less than $2^32$
o*givzpz32std.inl
o*givzpz32uns.C
o*givzpz32uns.hArithmetic on Z/pZ, with p a prime number less than 2^32
o*givzpz32uns.inl
o*givzpz64std.C
o*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
o*givzpz64std.inl
o*givzpzGen.h
o*givzpzGen.inl
o*givzpzInt.hArithmetic on Z/pZ, with p a prime number in arbitrary precision
o*givzpzInt.inl
o*givzpztypes.hFamily of types for arithmetic over Zpz
o*gmp++.doxy
o*gmp++.h
o*gmp++_int.C
o*gmp++_int.hCore gmp++_int.h
o*gmp++_int_add.CAdding stuff
o*gmp++_int_compare.CRoutines to compare integers
o*gmp++_int_cstor.CCstoring stuff
o*gmp++_int_div.CDiving stuff
o*gmp++_int_gcd.CGcding stuff
o*gmp++_int_io.CIoing stuff
o*gmp++_int_lib.CLibing stuff
o*gmp++_int_misc.CMiscing stuff
o*gmp++_int_mod.CModing stuff
o*gmp++_int_mul.CMuling stuff
o*gmp++_int_pow.CPowing stuff
o*gmp++_int_rand.inlRanding stuff
o*gmp++_int_sub.CSubing stuff
o*gmp++_rat.C
o*gmp++_rat.hCore Rationel from GMP
o*gmp++_rat.inl
o*gmp++_rat_add.C
o*gmp++_rat_compare.CRoutines to compare integers
o*gmp++_rat_cstor.C
o*gmp++_rat_io.C
o*gmp++_rat_misc.C
o*highorder.C
o*iexponentiation.C
o*ifactor.C
o*ifactor_lenstra.C
o*igcd.C
o*igcdext.C
o*ilcm.C
o*integer.doxy
o*interpolate.C
o*iratrecon.C
o*isirred.C
o*ispower.C
o*isprime.C
o*isprimitive.C
o*isproot.C
o*lambda.C
o*lambda_inv.C
o*mainpage.doxy
o*memory.doxy
o*ModularSquareRoot.C
o*nb_primes.C
o*nextprime.C
o*order.C
o*phi.C
o*pol_arith.C
o*pol_eval.C
o*pol_factor.C
o*polydouble.C
o*PolynomialCRT.C
o*prevprime.C
o*primitiveelement.C
o*primitiveroot.C
o*probable_primroot.C
o*ProbLucas.C
o*rational.doxy
o*RSA_breaking.C
o*RSA_decipher.C
o*RSA_encipher.C
o*RSA_keys_generator.C
o*StaticElement.hNO DOC
o*system.doxy
o*test-conversion.C
o*test-crt.CNO DOC
o*test-ffarith.C
o*test-geom.C
o*test-ifactor.C
o*test-integer.CTests integer.h fucntions not tested elsewhere
o*test-mod.C
o*test-modsqroot.CNO DOC
o*test-random.CWe test bounds for random Integers
o*test-ratrecon.C
o*test-ringarith.C
o*test-trunc.C
o*Test_Extension.C
o*trunc_arith.C
o*zpz.doxy
\*zpz_atomic.C