freebsd-skq/gnu/lib/libgmp
1995-11-13 19:13:19 +00:00
..
doc Build the TeXinfo manual 1995-11-13 18:40:45 +00:00
tests Make the tests work. libmp and libgmp must be installed for this 1995-11-13 18:42:24 +00:00
_mpz_get_str.c
_mpz_set_str.c
alloca.c
ChangeLog
COPYING
cre-conv-tab.c
cre-mparam.c
cre-stddefh.c
gmp-impl.h
gmp.h
gmp.texi
INSTALL
itom.c
longlong.h
Makefile BBild libgmp from the sources already in ../libmp. 1995-11-13 19:13:19 +00:00
Makefile.GNU
mdiv.c
memory.c
mfree.c
min.c
mout.c
move.c
mp_clz_tab.c
mp_set_fns.c
mp.h
mpn_add.c
mpn_cmp.c
mpn_div.c
mpn_dm_1.c
mpn_lshift.c
mpn_mod_1.c
mpn_mul.c
mpn_rshift.c
mpn_rshiftci.c
mpn_sqrt.c
mpn_sub.c
mpq_add.c
mpq_clear.c
mpq_cmp.c
mpq_div.c
mpq_get_den.c
mpq_get_num.c
mpq_init.c
mpq_inv.c
mpq_mul.c
mpq_neg.c
mpq_set_den.c
mpq_set_num.c
mpq_set_si.c
mpq_set_ui.c
mpq_set.c
mpq_sub.c
mpz_abs.c
mpz_add_ui.c
mpz_add.c
mpz_and.c
mpz_clear.c
mpz_clrbit.c
mpz_cmp_si.c
mpz_cmp_ui.c
mpz_cmp.c
mpz_com.c
mpz_div_2exp.c
mpz_div_ui.c
mpz_div.c
mpz_dm_ui.c
mpz_dm.c
mpz_dmincl.c
mpz_fac_ui.c
mpz_gcd.c
mpz_gcdext.c
mpz_get_si.c
mpz_get_str.c
mpz_get_ui.c
mpz_init.c
mpz_inp_raw.c
mpz_inp_str.c
mpz_ior.c
mpz_iset_si.c
mpz_iset_str.c
mpz_iset_ui.c
mpz_iset.c
mpz_mdiv_ui.c
mpz_mdiv.c
mpz_mdm_ui.c
mpz_mdm.c
mpz_mmod_ui.c
mpz_mmod.c
mpz_mod_2exp.c
mpz_mod_ui.c
mpz_mod.c
mpz_mul_2exp.c
mpz_mul_ui.c
mpz_mul.c
mpz_neg.c
mpz_out_raw.c
mpz_out_str.c
mpz_perfsqr.c
mpz_pow_ui.c
mpz_powm_ui.c
mpz_powm.c
mpz_pprime_p.c
mpz_random2.c
mpz_random.c
mpz_realloc.c
mpz_set_si.c
mpz_set_str.c
mpz_set_ui.c
mpz_set.c
mpz_size.c
mpz_sizeinb.c
mpz_sqrt.c
mpz_sqrtrem.c
mpz_sub_ui.c
mpz_sub.c
mtox.c
README
sdiv.c
TODO
VERSION
xtom.c

			THE GNU MP LIBRARY


GNU MP is a library for arbitrary precision arithmetic, operating on
signed integers and rational numbers.  It has a rich set of functions,
and the functions have a regular interface.

I have tried to make these functions as fast as possible, both for small
operands and for huge operands.  The speed is achieved by using fullwords
as the basic arithmetic type, by using fast algorithms, by defining inline
assembler for mixed sized multiplication and division (i.e 32*32->64 bit
multiplication and 64/32->32,32 bit division), and by hacking the code
with emphasis on speed (and not simplicity and elegance).

The speed of GNU MP is about 5 to 100 times that of Berkeley MP for
small operands.  The speed-up increases with the operand sizes for
certain operations, for which GNU MP has asymptotically faster algorithms.


There are four classes of functions in GNU MP.

 1. Signed integer arithmetic functions, mpz_*.  The set of functions are
    intended to be easy to use, being rich and regular.

    To use these functions, include the file "gmp.h".

 2. Rational arithmetic functions, mpq_*.  For now, just a small set of
    functions necessary for basic rational arithmetics.

    To use these functions, include the file "gmp.h".

 3. Positive-integer, low-level, harder-to-use, but for small operands
    about twice as fast than the mpz_* functions are the functions in the
    mpn_* class.  No memory management is performed.  The caller must
    ensure enough space is available for the results.  The set of
    functions is not quite regular, nor is the calling interface.  These
    functions accept input arguments in the form of pairs consisting of a
    pointer to the least significant word, and a integral size telling how
    many limbs (= words) the pointer points to.

    Almost all calculations, in the entire package, are made in these
    low-level functions.

    These functions are not fully documented in this release.  They will
    probably be so in a future release.

 4. Berkeley MP compatible functions.

    To use these functions, include the file "mp.h".  You can test if you
    are using the GNU version by testing if the symbol __GNU_MP__ is
    defined.


			REPORTING BUGS

If you find a bug in the library, please make sure to tell us about it!

You can report bugs, and propose modifications and enhancements to
tege@gnu.ai.mit.edu.  How to report a bug is further described in
the texinfo documentation, see the file gmp.texi.