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, 5 insertions, 5 deletions

diff --git a/src/Makefile.am b/src/Makefile.am
index 3584e8e..b44b4f9 100644
--- a/src/Makefile.am
+++ b/src/Makefile.am
@@ -6,8 +6,8 @@ libmpc_la_LDFLAGS = -version-info 1:0:0
 libmpc_la_SOURCES = mpc-impl.h abs.c add.c add_fr.c add_ui.c arg.c clear.c    \
 cmp.c cmp_si_si.c conj.c cos.c cosh.c div_2exp.c div.c div_fr.c div_ui.c      \
 exp.c fr_div.c fr_sub.c get_prec2.c get_prec.c get_str.c get_version.c imag.c \
-init2.c init3.c inp_str.c log.c mul_2exp.c mul.c mul_fr.c mul_i.c mul_si.c    \
-mul_ui.c neg.c norm.c out_str.c proj.c random2.c random.c real.c urandom.c    \
-set.c set_prec.c set_str.c set_x.c set_x_x.c sin.c sinh.c sqr.c sqrt.c	      \
-strtoc.c sub.c sub_fr.c sub_ui.c tan.c tanh.c uceil_log2.c ui_div.c	      \
-ui_ui_sub.c mem.c
+init2.c init3.c inp_str.c log.c mem.c mul_2exp.c mul.c mul_fr.c mul_i.c       \
+mul_si.c mul_ui.c neg.c norm.c out_str.c pow.c proj.c random2.c random.c      \
+real.c urandom.c set.c set_prec.c set_str.c set_x.c set_x_x.c sin.c sinh.c    \
+sqr.c sqrt.c strtoc.c sub.c sub_fr.c sub_ui.c tan.c tanh.c uceil_log2.c       \
+ui_div.c ui_ui_sub.c