First version of mpc_pow. Seems to run ok, but we have problems with large

exponents, since it is doubly-exponential wrt the maximal exponent!
I let Philippe fill the special cases, and add some more tests in pow.dat.
The algorithm is documented both in algorithms.tex and in the source code.


git-svn-id: svn://scm.gforge.inria.fr/svn/mpc/trunk@552 211d60ee-9f03-0410-a15a-8952a2c7a4e4

1 files changed, 4 insertions, 4 deletions

diff --git a/tests/Makefile.am b/tests/Makefile.am
index 5d88ad5..653b346 100644
--- a/tests/Makefile.am
+++ b/tests/Makefile.am
@@ -5,8 +5,8 @@ LDADD = libmpc-tests.la $(top_builddir)/src/libmpc.la
 
 check_PROGRAMS = tabs tadd tadd_fr tadd_ui targ tconj tcos tcosh tdiv         \
 tdiv_2exp tdiv_fr tdiv_ui texp tfr_div tfr_sub tget_version timag tio_str     \
-tlog tmul tmul_2exp tmul_fr tmul_i tmul_si tmul_ui tneg tnorm tprec tproj     \
-treal treimref tset tsin tsinh tsqr tsqrt tstrtoc tsub tsub_fr tsub_ui        \
+tlog tmul tmul_2exp tmul_fr tmul_i tmul_si tmul_ui tneg tnorm tpow tprec      \
+tproj treal treimref tset tsin tsinh tsqr tsqrt tstrtoc tsub tsub_fr tsub_ui  \
 ttan ttanh tui_div tui_ui_sub 
 
 check_LTLIBRARIES=libmpc-tests.la
@@ -15,8 +15,8 @@ comparisons.c
 
 EXTRA_DIST = abs.dat add.dat add_fr.dat arg.dat conj.dat cos.dat cosh.dat     \
 div.dat div_fr.dat exp.dat fr_div.dat fr_sub.dat inp_str.dat log.dat mul.dat  \
-mul_fr.dat neg.dat norm.dat proj.dat sin.dat sinh.dat sqr.dat sqrt.dat	      \
-strtoc.dat sub.dat sub_fr.dat tan.dat tanh.dat
+mul_fr.dat neg.dat norm.dat pow.dat proj.dat sin.dat sinh.dat sqr.dat         \
+sqrt.dat strtoc.dat sub.dat sub_fr.dat tan.dat tanh.dat
 
 TESTS = $(check_PROGRAMS)
 CLEANFILES = mpc_test