- GiNaC-devel - ginac.de

Release often, release early
by Alexei Sheplyakov 16 Feb '09

16 Feb '09

Dear GiNaC developers, I think we can release now unless someone has a very urgent patch or a bug report. Best regards, Alexei

1 0

[PATCH] Polished NEWS a little bit.
by Alexei Sheplyakov 16 Feb '09

16 Feb '09

--- NEWS | 7 ++++--- 1 files changed, 4 insertions(+), 3 deletions(-) diff --git a/NEWS b/NEWS index c8b40f9..31bacaf 100644 --- a/NEWS +++ b/NEWS @@ -2,11 +2,12 @@ This file records noteworthy changes. 1.5.0 (<date>) * Added polynomial factorization. -* Added an additional (recursive descent) expression parser. +* New, faster (recursive descent) expression parser. * Faster GCD computation. * gcd() now allows the user to override (some of the) heuristics. -* Replaced custum RTTI by standard C++ RTTI. -* Definition of archiving methods now optional when declaring a new GiNaC class. +* Writing extensions classes is simpler now: + - Replaced custom RTTI by standard C++ RTTI. + - Definition of archiving methods now optional when declaring a new GiNaC class. * Fixed recursion in polynomial divide that caused a significant slowdown in sqrfree(). * Improved lsolve() of systems containing non-numeric coefficients. -- 1.5.6.5

1 0

some questions
by Jens Vollinga 09 Feb '09

09 Feb '09

Hi, commit 45b1e47372090352ac5af655b32473df2abab23b had some compiling issues and I fixed it. Still, make check does not complete. The timings timing univariate GCD GCD of relatively prime polynomials a and b degree(a) = 100, degree(b) = 50 mod_gcd : 1 1.36e-02 heur_gcd : 1 1.82e-03 sr_gcd: : 1 1.43e+00 Non-trivial GCD, degree(a) = 100, degree(b) = 100 mod_gcd : 51 1.36e-02 heur_gcd : 51 3.64e-03 heur_gcd (old) : 51 5.73e-02 sr_gcd: : 51 2.31e-01 seem to stop at that last output ... I didn't put it through a debugger yet, maybe the test is just too expensive? @Alexei: Is it okay if I put the new files under the copyright of the University of Mainz (as all other files are)? And is it okay if I change the suffices .hpp .tcc? With respect to Richy's "solution" in http://www.ginac.de/pipermail/ginac-devel/2009-February/001544.html, should we do a 1.5 release now/soon? Regards, Jens

4 18

[SCM] GiNaC -- a C++ library for symbolic computations branch, master, updated. release_1-4-0-182-gfc16eff
by git＠ginac.de 06 Feb '09

06 Feb '09

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "GiNaC -- a C++ library for symbolic computations". The branch, master has been updated via fc16effeefb35845d77d98b2173160131bafa9b3 (commit) via 0d22af8982798509662a897ce72f546fe2149d0c (commit) via 2251ede3f4b3e7066f83fbedba53181c03f633f7 (commit) via bf08e105894751acc66f337074be6a5b9e738220 (commit) via 1602530f716ba1d425a0667b897182b99c374823 (commit) from 3627c2c0f2fe8fe04816703c5fc6dad9c96fb0a6 (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- commit fc16effeefb35845d77d98b2173160131bafa9b3 Author: Jens Vollinga <jensv(a)balin.nikhef.nl> Date: Fri Feb 6 16:49:47 2009 +0100 Adjusted NEWS and INSTALL documentation. commit 0d22af8982798509662a897ce72f546fe2149d0c Author: Jens Vollinga <jensv(a)balin.nikhef.nl> Date: Fri Feb 6 16:35:22 2009 +0100 Missed to change one date in function.pl. commit 2251ede3f4b3e7066f83fbedba53181c03f633f7 Author: Jens Vollinga <jensv(a)balin.nikhef.nl> Date: Fri Feb 6 16:24:58 2009 +0100 Changed name of debugging macro (to avoid warning cause by multiple definition). commit bf08e105894751acc66f337074be6a5b9e738220 Author: Jens Vollinga <jensv(a)balin.nikhef.nl> Date: Fri Feb 6 16:22:58 2009 +0100 Fixed returning of test result (++result was +result). commit 1602530f716ba1d425a0667b897182b99c374823 Author: Jens Vollinga <jensv(a)balin.nikhef.nl> Date: Fri Feb 6 16:07:10 2009 +0100 Prettified source code. - Added copyright and GPL licencing to new files. - Increased year to 2009. - Changed guarding macros in header to uniform pattern without leading or trailing __ (double underscores). - Put includes of system wide header consistently below own includes (help a tiny bit to clarify dependencies). ----------------------------------------------------------------------- Summary of changes: INSTALL | 2 +- NEWS | 3 +- check/bugme_chinrem_gcd.cpp | 36 ++++++++++++++----- check/check_inifcns.cpp | 9 +++-- check/check_lsolve.cpp | 9 +++-- check/check_matrices.cpp | 9 +++-- check/check_numeric.cpp | 9 +++-- check/error_report.h | 33 ++++++++++++++--- check/exam_archive.cpp | 9 +++-- check/exam_clifford.cpp | 7 ++-- check/exam_color.cpp | 7 ++-- check/exam_cra.cpp | 34 ++++++++++++++--- check/exam_differentiation.cpp | 7 ++-- check/exam_factor.cpp | 7 ++-- check/exam_hashmap.cpp | 9 +++-- check/exam_indexed.cpp | 7 ++-- check/exam_inifcns.cpp | 7 ++-- check/exam_inifcns_nstdsums.cpp | 8 ++-- check/exam_inifcns_nstdsums.h | 22 +++++++++++ check/exam_lsolve.cpp | 7 ++-- check/exam_matrices.cpp | 9 +++-- check/exam_misc.cpp | 7 ++-- check/exam_mod_gcd.cpp | 33 ++++++++++++++--- check/exam_normalization.cpp | 7 ++-- check/exam_numeric.cpp | 8 ++-- check/exam_paranoia.cpp | 7 ++-- check/exam_polygcd.cpp | 7 ++-- check/exam_powerlaws.cpp | 7 ++-- check/exam_pseries.cpp | 7 ++-- check/exam_structure.cpp | 6 ++-- check/genex.cpp | 7 ++-- check/heur_gcd_bug.cpp | 33 +++++++++++++---- check/match_bug.cpp | 33 +++++++++++++---- check/mul_eval_memleak.cpp | 31 ++++++++-------- check/numeric_archive.cpp | 38 +++++++++++++++----- check/parser_bugs.cpp | 31 +++++++++++++--- check/parser_memleak.cpp | 37 +++++++++++++++---- check/randomize_serials.cpp | 30 +++++++++++++-- check/test_runner.h | 33 ++++++++++++++--- check/time_antipode.cpp | 17 +++++---- check/time_dennyfliegner.cpp | 9 +++-- check/time_fateman_expand.cpp | 7 ++-- check/time_gammaseries.cpp | 9 +++-- check/time_hashmap.cpp | 9 +++-- check/time_lw_A.cpp | 9 +++-- check/time_lw_B.cpp | 9 +++-- check/time_lw_C.cpp | 9 +++-- check/time_lw_D.cpp | 9 +++-- check/time_lw_E.cpp | 9 +++-- check/time_lw_F.cpp | 9 +++-- check/time_lw_G.cpp | 9 +++-- check/time_lw_H.cpp | 9 +++-- check/time_lw_IJKL.cpp | 9 +++-- check/time_lw_M1.cpp | 7 ++-- check/time_lw_M2.cpp | 7 ++-- check/time_lw_N.cpp | 9 +++-- check/time_lw_O.cpp | 9 +++-- check/time_lw_P.cpp | 9 +++-- check/time_lw_Pprime.cpp | 9 +++-- check/time_lw_Q.cpp | 9 +++-- check/time_lw_Qprime.cpp | 9 +++-- check/time_parser.cpp | 40 ++++++++++++++++---- check/time_toeplitz.cpp | 9 +++-- check/time_uvar_gcd.cpp | 42 ++++++++++++++++----- check/time_vandermonde.cpp | 9 +++-- check/timer.cpp | 8 ++-- check/timer.h | 3 +- doc/tutorial/ginac.texi | 6 ++-- ginac/add.cpp | 12 +++--- ginac/add.h | 8 ++-- ginac/archive.cpp | 8 ++-- ginac/archive.h | 11 +++--- ginac/assertion.h | 8 ++-- ginac/basic.cpp | 10 +++--- ginac/basic.h | 24 ++++++------ ginac/class_info.h | 16 ++++---- ginac/clifford.cpp | 6 ++-- ginac/clifford.h | 9 ++--- ginac/color.cpp | 8 ++-- ginac/color.h | 10 ++--- ginac/compiler.h | 28 +++++++++++++-- ginac/constant.cpp | 10 +++--- ginac/constant.h | 11 +++--- ginac/container.h | 23 ++++++------ ginac/ex.cpp | 8 ++-- ginac/ex.h | 17 ++++----- ginac/excompiler.cpp | 23 ++++++------ ginac/excompiler.h | 16 ++++----- ginac/expair.cpp | 6 ++-- ginac/expair.h | 8 ++-- ginac/expairseq.cpp | 13 +++---- ginac/expairseq.h | 20 +++++----- ginac/exprseq.cpp | 2 +- ginac/exprseq.h | 12 +++--- ginac/factor.cpp | 2 +- ginac/factor.h | 12 +++---- ginac/fail.cpp | 6 ++-- ginac/fail.h | 8 ++-- ginac/fderivative.cpp | 6 ++-- ginac/fderivative.h | 13 +++---- ginac/flags.h | 8 ++-- ginac/function.pl | 31 ++++++++-------- ginac/ginac.h | 8 ++-- ginac/hash_map.h | 13 +++---- ginac/idx.cpp | 10 +++--- ginac/idx.h | 9 ++--- ginac/indexed.cpp | 12 +++--- ginac/indexed.h | 13 +++---- ginac/inifcns.cpp | 8 ++-- ginac/inifcns.h | 8 ++-- ginac/inifcns_gamma.cpp | 8 ++-- ginac/inifcns_nstdsums.cpp | 11 +++--- ginac/inifcns_trans.cpp | 8 ++-- ginac/integral.cpp | 2 +- ginac/integral.h | 8 ++-- ginac/lst.cpp | 2 +- ginac/lst.h | 12 +++--- ginac/matrix.cpp | 16 ++++---- ginac/matrix.h | 14 ++++---- ginac/mul.cpp | 12 +++--- ginac/mul.h | 8 ++-- ginac/ncmul.cpp | 10 +++--- ginac/ncmul.h | 8 ++-- ginac/normal.cpp | 8 ++-- ginac/normal.h | 8 ++-- ginac/numeric.cpp | 14 ++++---- ginac/numeric.h | 14 +++---- ginac/operators.cpp | 8 ++-- ginac/operators.h | 8 ++-- ginac/parser/debug.h | 34 +++++++++++++++--- ginac/parser/lexer.cpp | 34 ++++++++++++++--- ginac/parser/lexer.h | 34 ++++++++++++++--- ginac/parser/parse_binop_rhs.cpp | 31 +++++++++++++--- ginac/parser/parse_context.cpp | 30 +++++++++++++-- ginac/parser/parse_context.h | 40 ++++++++++++++++----- ginac/parser/parser.cpp | 30 +++++++++++++-- ginac/parser/parser.h | 35 ++++++++++++++---- ginac/parser/parser_compat.cpp | 34 ++++++++++++++---- ginac/polynomial/chinrem_gcd.cpp | 27 ++++++++++++-- ginac/polynomial/chinrem_gcd.h | 31 +++++++++++++--- ginac/polynomial/collect_vargs.cpp | 39 +++++++++++++++----- ginac/polynomial/collect_vargs.h | 35 +++++++++++++++--- ginac/polynomial/cra_garner.cpp | 34 ++++++++++++++--- ginac/polynomial/cra_garner.h | 34 +++++++++++++++--- ginac/polynomial/debug.h | 57 ++++++++++++++++++++--------- ginac/polynomial/divide_in_z_p.cpp | 28 +++++++++++++-- ginac/polynomial/divide_in_z_p.h | 29 +++++++++++++-- ginac/polynomial/euclid_gcd_wrap.h | 28 +++++++++++++-- ginac/polynomial/eval_point_finder.h | 32 ++++++++++++++--- ginac/polynomial/eval_uvar.h | 33 ++++++++++++++--- ginac/polynomial/gcd_euclid.h | 33 ++++++++++++++--- ginac/polynomial/gcd_uvar.cpp | 29 +++++++++++++-- ginac/polynomial/heur_gcd_uvar.h | 34 ++++++++++++++--- ginac/polynomial/interpolate_padic_uvar.h | 37 +++++++++++++++---- ginac/polynomial/mgcd.cpp | 29 +++++++++++++-- ginac/polynomial/mod_gcd.cpp | 32 ++++++++++++++--- ginac/polynomial/mod_gcd.h | 35 +++++++++++++++--- ginac/polynomial/newton_interpolate.h | 32 ++++++++++++++-- ginac/polynomial/normalize.h | 33 ++++++++++++++--- ginac/polynomial/optimal_vars_finder.cpp | 35 ++++++++++++++---- ginac/polynomial/optimal_vars_finder.h | 36 ++++++++++++++++--- ginac/polynomial/pgcd.cpp | 26 ++++++++++++-- ginac/polynomial/pgcd.h | 28 +++++++++++++-- ginac/polynomial/poly_cra.h | 32 ++++++++++++++--- ginac/polynomial/prem_uvar.h | 35 ++++++++++++++---- ginac/polynomial/primes_factory.h | 34 ++++++++++++++--- ginac/polynomial/primpart_content.cpp | 26 ++++++++++++-- ginac/polynomial/remainder.h | 35 +++++++++++++++--- ginac/polynomial/ring_traits.h | 34 ++++++++++++++--- ginac/polynomial/smod_helpers.h | 31 ++++++++++++++-- ginac/polynomial/sr_gcd_uvar.h | 36 +++++++++++++++---- ginac/polynomial/upoly.h | 48 ++++++++++++++++++------- ginac/polynomial/upoly_io.cpp | 50 ++++++++++++++++++------- ginac/polynomial/upoly_io.h | 39 ++++++++++++++++---- ginac/power.cpp | 12 +++--- ginac/power.h | 8 ++-- ginac/print.cpp | 6 ++-- ginac/print.h | 15 ++++---- ginac/pseries.cpp | 10 +++--- ginac/pseries.h | 8 ++-- ginac/ptr.h | 13 +++---- ginac/registrar.cpp | 8 ++-- ginac/registrar.h | 18 +++++----- ginac/relational.cpp | 8 ++-- ginac/relational.h | 8 ++-- ginac/remember.cpp | 6 ++-- ginac/remember.h | 10 +++--- ginac/structure.h | 14 +++---- ginac/symbol.cpp | 10 +++--- ginac/symbol.h | 13 ++++--- ginac/symmetry.cpp | 12 +++--- ginac/symmetry.h | 13 +++---- ginac/tensor.cpp | 10 +++--- ginac/tensor.h | 9 ++--- ginac/tostring.h | 8 ++-- ginac/utils.cpp | 2 +- ginac/utils.h | 14 +++---- ginac/wildcard.cpp | 6 ++-- ginac/wildcard.h | 9 ++--- ginsh/ginsh.1.in | 2 +- ginsh/ginsh.h | 2 +- ginsh/ginsh_extensions.h | 2 +- ginsh/ginsh_lexer.ll | 2 +- ginsh/ginsh_parser.yy | 4 +- tools/viewgar.1.in | 2 +- tools/viewgar.cpp | 11 +++--- 206 files changed, 2366 insertions(+), 1039 deletions(-) hooks/post-receive -- GiNaC -- a C++ library for symbolic computations

1 0

[SCM] GiNaC -- a C++ library for symbolic computations branch, master, updated. release_1-4-0-174-gb9dc3d7
by git＠ginac.de 03 Feb '09

03 Feb '09

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "GiNaC -- a C++ library for symbolic computations". The branch, master has been updated via b9dc3d71083fe1a2f90a34db24b57b06ad51ebde (commit) via 45b1e47372090352ac5af655b32473df2abab23b (commit) via 3f0b0165865bbb297901e9542fced88a0e32298e (commit) via e79c1f6f914b7be886a19c8d7cdd3603405cda2a (commit) from 38f3143eee71d942f40ab47f5a561dc9736203fc (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- commit b9dc3d71083fe1a2f90a34db24b57b06ad51ebde Author: Jens Vollinga <jensv(a)balin.nikhef.nl> Date: Tue Feb 3 13:50:33 2009 +0100 Fixed compile errors introduced in previous commit 45b1e47372090352ac5af655b32473df2abab23b. commit 45b1e47372090352ac5af655b32473df2abab23b Author: Alexei Sheplyakov <varg(a)metalica.kh.ua> Date: Mon Jan 19 08:45:38 2009 +0200 Implement modular multivariate GCD (based on chinese remaindering algorithm). Both algorithm and implementation are a bit inefficient: * algorithm does not make use of sparseness of inputs (and most of multivariate polynomials are quite sparse) * GiNaC's expressions are essentially immutable. Thus some simple operations (i.e. multiplying a polynomial by an element of the base ring) are prohibitively expensive. * All numbers (i.e. GiNaC::numeric objects) are heap allocated. Still it's much faster (~5x on bivariate polynomials, ~100x on 3-variate ones) than (subresultant) PRS algorithm, so gcd() uses modular algorithm by default. commit 3f0b0165865bbb297901e9542fced88a0e32298e Author: Alexei Sheplyakov <varg(a)metalica.kh.ua> Date: Mon Jan 19 08:44:36 2009 +0200 Improve (fix?) smod: now it really converts into symmetric representation... ... instead of clumsy convention inspirited by some proprietary CAS. commit e79c1f6f914b7be886a19c8d7cdd3603405cda2a Author: Alexei Sheplyakov <varg(a)metalica.kh.ua> Date: Mon Jan 19 08:43:50 2009 +0200 Fix copy-paste error in GINACLIB_MICRO_VERSION. ----------------------------------------------------------------------- Summary of changes: configure.ac | 2 +- doc/tutorial/ginac.texi | 2 +- ginac/Makefile.am | 18 +++ ginac/normal.cpp | 10 ++- ginac/normal.h | 17 +++- ginac/numeric.cpp | 19 ++-- ginac/polynomial/chinrem_gcd.cpp | 14 +++ ginac/polynomial/chinrem_gcd.h | 19 ++++ ginac/polynomial/collect_vargs.cpp | 167 ++++++++++++++++++++++++++++++ ginac/polynomial/collect_vargs.h | 34 ++++++ ginac/polynomial/debug.hpp | 1 + ginac/polynomial/divide_in_z_p.cpp | 90 ++++++++++++++++ ginac/polynomial/divide_in_z_p.h | 27 +++++ ginac/polynomial/euclid_gcd_wrap.h | 60 +++++++++++ ginac/polynomial/eval_point_finder.h | 51 +++++++++ ginac/polynomial/mgcd.cpp | 97 +++++++++++++++++ ginac/polynomial/newton_interpolate.h | 36 +++++++ ginac/polynomial/optimal_vars_finder.cpp | 134 ++++++++++++++++++++++++ ginac/polynomial/optimal_vars_finder.h | 20 ++++ ginac/polynomial/pgcd.cpp | 136 ++++++++++++++++++++++++ ginac/polynomial/pgcd.h | 27 +++++ ginac/polynomial/poly_cra.h | 38 +++++++ ginac/polynomial/primes_factory.h | 60 +++++++++++ ginac/polynomial/primpart_content.cpp | 78 ++++++++++++++ ginac/polynomial/smod_helpers.h | 72 +++++++++++++ 25 files changed, 1215 insertions(+), 14 deletions(-) create mode 100644 ginac/polynomial/chinrem_gcd.cpp create mode 100644 ginac/polynomial/chinrem_gcd.h create mode 100644 ginac/polynomial/collect_vargs.cpp create mode 100644 ginac/polynomial/collect_vargs.h create mode 100644 ginac/polynomial/divide_in_z_p.cpp create mode 100644 ginac/polynomial/divide_in_z_p.h create mode 100644 ginac/polynomial/euclid_gcd_wrap.h create mode 100644 ginac/polynomial/eval_point_finder.h create mode 100644 ginac/polynomial/mgcd.cpp create mode 100644 ginac/polynomial/newton_interpolate.h create mode 100644 ginac/polynomial/optimal_vars_finder.cpp create mode 100644 ginac/polynomial/optimal_vars_finder.h create mode 100644 ginac/polynomial/pgcd.cpp create mode 100644 ginac/polynomial/pgcd.h create mode 100644 ginac/polynomial/poly_cra.h create mode 100644 ginac/polynomial/primes_factory.h create mode 100644 ginac/polynomial/primpart_content.cpp create mode 100644 ginac/polynomial/smod_helpers.h hooks/post-receive -- GiNaC -- a C++ library for symbolic computations

1 0

Shared lib calls exit
by Fabian Affolter 01 Feb '09

01 Feb '09

Hi, I'm packaging ginac for the Fedora Package Collection. Now I have the following rpmlint warning on ginac 1.4.4. Can you have a look at it and have it fixed for the next release, please? [fab@laptop24 i386]$ rpmlint -i ginac* ginac.i386: W: shared-lib-calls-exit /usr/lib/libginac-1.4.so.0.0.4 exit(a)GLIBC_2.0 This library package calls exit() or _exit(), probably in a non-fork() context. Doing so from a library is strongly discouraged - when a library function calls exit(), it prevents the calling program from handling the error, reporting it to the user, closing files properly, and cleaning up any state that the program has. It is preferred for the library to return an actual error code and let the calling program decide how to handle the situation. Perhaps the intention was to *return* something, and perhaps non-zero? Thanks in advance and kind regards, Fabian -- Fingerprint: 2F6C 930F D3C4 7E38 6AFA 4EB4 E23C D2DD 36A4 397F Fedora always leads and never follows.

2 1

ginac
by Fabian Affolter 01 Feb '09

01 Feb '09

Hi, I'm packaging ginac for the Fedora Package Collection. Now I have the following rpmlint warning on ginac 1.4.4. Can you have a look at it and have it fixed for the next release, please? [fab@laptop24 i386]$ rpmlint -i ginac* ginac.i386: W: shared-lib-calls-exit /usr/lib/libginac-1.4.so.0.0.4 exit(a)GLIBC_2.0 This library package calls exit() or _exit(), probably in a non-fork() context. Doing so from a library is strongly discouraged - when a library function calls exit(), it prevents the calling program from handling the error, reporting it to the user, closing files properly, and cleaning up any state that the program has. It is preferred for the library to return an actual error code and let the calling program decide how to handle the situation. Perhaps the intention was to *return* something, and perhaps non-zero? Thanks in advance and kind regards, Fabian -- Fingerprint: 2F6C 930F D3C4 7E38 6AFA 4EB4 E23C D2DD 36A4 397F Fedora always leads and never follows.

1 0

git updated on server
by Richard B. Kreckel 27 Jan '09

27 Jan '09

Hi! I changed the git installation on www.ginac.de from self-built 1.5.4.3 to the version provided by openSuSE 11.1 RPM packages, which is git 1.6.0.2. As far as I can see, everything should be working at least as well as before. Please contact me, if something behaves in an unexpected way. Cheers -richy. -- Richard B. Kreckel <http://www.ginac.de/~kreckel/>

1 0

[PATCH] Improve (fix?) smod: now it really converts into symmetric representation...
by Alexei Sheplyakov 20 Jan '09

20 Jan '09

... instead of clumsy convention inspirited by some proprietary CAS. --- doc/tutorial/ginac.texi | 2 +- ginac/numeric.cpp | 19 +++++++++++-------- 2 files changed, 12 insertions(+), 9 deletions(-) diff --git a/doc/tutorial/ginac.texi b/doc/tutorial/ginac.texi index 3207a96..fe7a264 100644 --- a/doc/tutorial/ginac.texi +++ b/doc/tutorial/ginac.texi @@ -1479,7 +1479,7 @@ evaluated immediately: @tab modulus in positive representation (in the range @code{[0, abs(b)-1]} with the sign of b, or zero) @cindex @code{mod()} @item @code{smod(a, b)} -@tab modulus in symmetric representation (in the range @code{[-iquo(abs(b)-1, 2), iquo(abs(b), 2)]}) +@tab modulus in symmetric representation (in the range @code{[-iquo(abs(b), 2), iquo(abs(b), 2)]}) @cindex @code{smod()} @item @code{irem(a, b)} @tab integer remainder (has the sign of @math{a}, or is zero) diff --git a/ginac/numeric.cpp b/ginac/numeric.cpp index 91721e1..50d873a 100644 --- a/ginac/numeric.cpp +++ b/ginac/numeric.cpp @@ -2337,15 +2337,18 @@ const numeric mod(const numeric &a, const numeric &b) /** Modulus (in symmetric representation). - * Equivalent to Maple's mods. * - * @return a mod b in the range [-iquo(abs(b)-1,2), iquo(abs(b),2)]. */ -const numeric smod(const numeric &a, const numeric &b) -{ - if (a.is_integer() && b.is_integer()) { - const cln::cl_I b2 = cln::ceiling1(cln::the<cln::cl_I>(b.to_cl_N()) >> 1) - 1; - return numeric(cln::mod(cln::the<cln::cl_I>(a.to_cl_N()) + b2, - cln::the<cln::cl_I>(b.to_cl_N())) - b2); + * @return a mod b in the range [-iquo(abs(b),2), iquo(abs(b),2)]. */ +const numeric smod(const numeric &a_, const numeric &b_) +{ + if (a_.is_integer() && b_.is_integer()) { + const cln::cl_I a = cln::the<cln::cl_I>(a_.to_cl_N()); + const cln::cl_I b = cln::the<cln::cl_I>(b_.to_cl_N()); + const cln::cl_I b2 = b >> 1; + const cln::cl_I m = cln::mod(a, b); + const cln::cl_I m_b = m - b; + const cln::cl_I ret = m > b2 ? m_b : m; + return numeric(ret); } else return *_num0_p; } -- 1.5.6.5

2 1

symbolic matrix
by Luis Rivera 19 Jan '09

19 Jan '09

Hello, I have some problem accessing the elements of a symbolic matrix. For example the code below creates a 2x2 symbolic matrix 'A' but I can't access the individual elements. The output I get when I run the small program below is: [luis@urubamba ~/GiNaC]#87 ./AA A(0,0) = [[A00,A01],[A10,A11]] matrix::operator(): index out of range What am I making wrong? Thanks for any hint. Luis #############################33 #include #include #include using namespace std; using namespace GiNaC; int main() { int j,k,n=2; try{ matrix A; A = symbolic_matrix(n,n, "A"); cout << "A(0,0) = " << A(0,0) << endl; cout << "A(0,1) = " << A(0,1) << endl; cout << "A(1,0) = " << A(1,0) << endl; cout << "A(1,1) = " << A(1,1) << endl; } catch (exception &z) { cerr << z.what() << endl; return 1; } return 0; } ######################### Créez votre adresse électronique prenom.nom(a)laposte.net 1 Go d'espace de stockage, anti-spam et anti-virus intégrés.

1 0