- GiNaC-devel - ginac.de

Re: [GiNaC-devel] [GiNaC-list] GiNaC Licensing.
by Richard B. Kreckel 22 Oct '08

22 Oct '08

Hi! Alexei Sheplyakov wrote: > I really dislike dual licensing thing, especially if the second license > is BSD. I don't want to be a free (as in `free beer') employee of every > company making proprietary software. Remembering Bruno Haible's stance regarding the issue of dual-licensing CLN, there is no point considering this option further. So, I've placed a new entry in the FAQ. Cheers -richy. -- Richard B. Kreckel <http://www.ginac.de/~kreckel/>

1 0

New tinfo mechanism
by Vladimir V. Kisil 22 Oct '08

22 Oct '08

Dear All, I wish to identify an object by the new tinfo mechanism. I used the naive expression ex_to<basic>(other).return_type_tinfo() However for ncmul, for example, it still returns the type of the first non-commutative factor, not make_return_type_t<ncmul>() as may be expected from basic::return_type_info(). What is most correct way to get the ncmul identified? Many thanks and best wishes, Vladimir -- Vladimir V. Kisil email: kisilv(a)maths.leeds.ac.uk -- www: http://maths.leeds.ac.uk/~kisilv/

2 2

[SCM] GiNaC -- a C++ library for symbolic computations branch, master, updated. release_1-4-0-146-g4fb48e2
by git＠ginac.de 20 Oct '08

20 Oct '08

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 4fb48e28063e08c613a773378cfa5de608560a84 (commit) via d327f3f00c66a79d42855939866047b3e8caa630 (commit) via 434e5582627a91aa4d8fdb5156d975482a7f350c (commit) via 8fdf123fe6dac43ad7b8020d7bb7446c51cf75e7 (commit) via 94e5076a9ad0d142ee4604e9b078a10083efd24c (commit) via 32209e57010f19f080cc25e527347bcaa36053ec (commit) via def26469ff96228c66e877bb5594e7d9a24b638f (commit) via 09988aee53a2bfef87fc887a434b4c78d6326c47 (commit) via 12fefbca9b424cb8e9ae05d83883b96e17c7b96e (commit) via b573b0146341709649f373e0fc5c0d440877ebaf (commit) via e858ebe524f9beac33d492b9a4e614666819c3ab (commit) via 11fcbe7ea462936b79807a1f12273e5685f3f744 (commit) via e9b5729311fcd5572d806f5df2e645e1845603e5 (commit) via ce9053c15affb2a1a99d1157b85266d70aec601b (commit) via c7d9b624cb4bd5658a36fbcac2f73dbdb99edd5f (commit) via 47b7f9c9b4a5bd91c7c83b12bac8481b55bf4b92 (commit) via 55fcb39a1209898ec43694f7e25ffb4572b0c4d1 (commit) via 62923ac249c7e4f7e824bc37030ac79bab3675f3 (commit) via d5c76f155cfbd25ccfd14735b6d1041e23214a86 (commit) via ceb63120f43b41b62dcb0328231a3137d666161b (commit) from a377cee53b71348235ec36f83afeced7e10288a8 (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 4fb48e28063e08c613a773378cfa5de608560a84 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Oct 19 20:21:33 2008 +0400 tutorial: simplify the instructions on writing extension classes. Don't mention (un)archiving while describing the `mystring' class (the minimalistic extension class), so readers have less chances to get confused. commit d327f3f00c66a79d42855939866047b3e8caa630 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Oct 19 19:39:30 2008 +0400 Don't force every algebraic class to implement archiving/unarchiving. So people who don't use (un)archiving don't need to bother with it. commit 434e5582627a91aa4d8fdb5156d975482a7f350c Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Oct 17 17:57:27 2008 +0400 tutorial: don't mention custom RTTI any more (as it does not exist). commit 8fdf123fe6dac43ad7b8020d7bb7446c51cf75e7 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Thu Oct 16 15:43:32 2008 +0400 symbol: make get_domain() a virtual method, remove symbol::domain. This cuts yet another 4 bytes from GiNaC::symbol. While at it, fix a memory leak in ginsh. commit 94e5076a9ad0d142ee4604e9b078a10083efd24c Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Thu Oct 16 15:43:32 2008 +0400 symbol: don't bother to set TeX name if user did not specified one. Same for the usual name. As a result we use less memory (and the output is exactly the same). commit 32209e57010f19f080cc25e527347bcaa36053ec Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Oct 17 14:56:54 2008 +0400 symbol: remove return_type_tinfo() and return_type() (shrink symbol by 8 bytes) Bloating symbol to the state sizeof(symbol) == 64 is not appreciated at all. If someone needs/wants non-commutative symbols or other fancy stuff, please derive from class symbol and do whatever you want. commit def26469ff96228c66e877bb5594e7d9a24b638f Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Oct 17 13:41:01 2008 +0400 Wipe out remnants of custom RTTI. Custom RTTI considered harmful, final part. commit 09988aee53a2bfef87fc887a434b4c78d6326c47 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Wed Oct 15 15:32:11 2008 +0400 registered_class_info: use typeid() instead of tinfo_static. (Custom RTTI considered harmful, part 5). Since custom RTTI is going to be removed, registered_class_info needs to be re-organazied. Now tinfo_key is a (const) pointer to std::type_info. commit 12fefbca9b424cb8e9ae05d83883b96e17c7b96e Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Oct 17 13:15:03 2008 +0400 A better return_type_tinfo() mechanism. return_type_tinfo() is used in order to distingish between non-commutative objects of different type. However, often it's necessary to distingish between non-commutative objects of the same type, for example, between gamma matrices with different representation label. return_type_tinfo() does not provide any clean way to do that. Hence, introduce return_type_t type which holds representation label along with type information, and use it for return_type_tinfo(). commit b573b0146341709649f373e0fc5c0d440877ebaf Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Wed Oct 15 15:32:11 2008 +0400 calchash(): use type_info::name() instead of tinfo(). Custom RTTI considered harmful, part 4. The hash value of the object of different types should be different whenever possible. Hence calcash() needs a unique per type number. Previously we used tinfo_key for this. typeinfo::name() (a *pointer* to implementation dependent string) is also unique for each class, so it's just as good as tinfo() is. commit e858ebe524f9beac33d492b9a4e614666819c3ab Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Wed Oct 15 15:32:11 2008 +0400 indexed::eval: use standard C++ RTTI. Custom RTTI considered harmful, part 3. commit 11fcbe7ea462936b79807a1f12273e5685f3f744 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Wed Oct 15 15:32:11 2008 +0400 basic, expairseq: use standard C++ RTTI in compare(), is_equal(), match(), etc. Custom RTTI considered harmful, part 2. * basic.cpp: use standard C++ RTTI in compare(), is_equal(), operator=(), match(). * expairseq.cpp: use standard C++ RTTI in match(), make_flat(), construct_from_2_ex(). commit e9b5729311fcd5572d806f5df2e645e1845603e5 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Wed Oct 15 15:32:11 2008 +0400 is_exactly_a: use typeid() to check the type of expression. Custom RTTI considered harmful, part 1. Custom run time type information (RTTI) system implemented in GiNaC have several serious drawbacks, such as 1. It makes writing GiNaC classes unnecessary cumbersome. 2. It wastes sizeof(void *) bytes per object, for small objects like symbol, numeric, etc. this overhead is considerable. It turns out that GiNaC's RTTI is not any faster than the standard one (at least on GNU/Linux and Solaris with GNU C++ library and compiler). So, GiNaC RTTI have no reasons to exit any more. commit ce9053c15affb2a1a99d1157b85266d70aec601b Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Wed Oct 15 10:16:07 2008 +0400 ptr.h: use unsigned int to store reference counts (in order to save memory). We'll hardly ever get more than 2^32 references to the same object. So using size_t to store reference count only wastes 4 bytes per object (on 64-bit architecture). Use unsigned int instead. commit c7d9b624cb4bd5658a36fbcac2f73dbdb99edd5f Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Oct 19 21:27:14 2008 +0400 Rewritten heuristic and PRS GCD for univariate polynomials, added benchmark. Using a better data structure for univariate polynomials makes GCD 10 -- 300 times faster (and less memory hungry). commit 47b7f9c9b4a5bd91c7c83b12bac8481b55bf4b92 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Tue Oct 14 10:44:07 2008 +0400 polynomial: introduce a helper function to divide polynomial by ring element. commit 55fcb39a1209898ec43694f7e25ffb4572b0c4d1 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Tue Oct 14 10:37:42 2008 +0400 mod_gcd: naive hack to chose a 'good' prime (to speed up gcd computation). commit 62923ac249c7e4f7e824bc37030ac79bab3675f3 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Mon Sep 29 09:58:35 2008 +0400 [bugfix] remainder_in_ring: using exact division is plain wrong. commit d5c76f155cfbd25ccfd14735b6d1041e23214a86 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Mon Sep 29 09:53:46 2008 +0400 [bugfix] normalize_in_ring: don't set the leading coefficient to 1. The coefficient ring is not a field, so the leading coefficient don't have to be 1. commit ceb63120f43b41b62dcb0328231a3137d666161b Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Thu Sep 25 13:19:57 2008 +0400 [trivial] excompiler.cpp: shut up some silly compiler warnings. GCC warns about 'comparison between signed and unsigned integer expressions'. In this case such comparison is harmless, but still it's a bit annoying. ----------------------------------------------------------------------- Summary of changes: check/Makefile.am | 4 + check/exam_archive.cpp | 3 +- check/test_runner.h | 67 + check/time_uvar_gcd.cpp | 1877 +++++++++++++++++++++++++++++ doc/examples/mystring.cpp | 24 +- doc/tutorial/ginac.texi | 195 +--- ginac/Makefile.am | 6 + ginac/add.cpp | 12 +- ginac/add.h | 3 +- ginac/archive.cpp | 46 +- ginac/archive.h | 80 ++ ginac/basic.cpp | 47 +- ginac/basic.h | 31 +- ginac/clifford.cpp | 40 +- ginac/clifford.h | 25 +- ginac/color.cpp | 34 +- ginac/color.h | 12 +- ginac/constant.cpp | 20 +- ginac/constant.h | 7 +- ginac/container.h | 104 +- ginac/ex.h | 3 +- ginac/excompiler.cpp | 6 +- ginac/expairseq.cpp | 38 +- ginac/expairseq.h | 3 + ginac/exprseq.h | 3 - ginac/fail.cpp | 3 +- ginac/fail.h | 2 + ginac/fderivative.cpp | 9 +- ginac/fderivative.h | 3 + ginac/function.pl | 40 +- ginac/idx.cpp | 29 +- ginac/idx.h | 12 +- ginac/indexed.cpp | 22 +- ginac/indexed.h | 7 +- ginac/integral.cpp | 12 +- ginac/integral.h | 8 +- ginac/lst.cpp | 3 + ginac/lst.h | 4 +- ginac/matrix.cpp | 20 +- ginac/matrix.h | 6 + ginac/mul.cpp | 17 +- ginac/mul.h | 3 +- ginac/ncmul.cpp | 23 +- ginac/ncmul.h | 4 +- ginac/numeric.cpp | 24 +- ginac/numeric.h | 6 + ginac/polynomial/eval_uvar.h | 38 + ginac/polynomial/gcd_uvar.cpp | 33 + ginac/polynomial/heur_gcd_uvar.h | 66 + ginac/polynomial/interpolate_padic_uvar.h | 40 + ginac/polynomial/mod_gcd.cpp | 12 +- ginac/polynomial/normalize.tcc | 3 +- ginac/polynomial/prem_uvar.h | 47 + ginac/polynomial/remainder.tcc | 2 +- ginac/polynomial/ring_traits.hpp | 13 + ginac/polynomial/sr_gcd_uvar.h | 95 ++ ginac/polynomial/upoly.hpp | 31 + ginac/power.cpp | 11 +- ginac/power.h | 12 +- ginac/pseries.cpp | 10 +- ginac/pseries.h | 5 + ginac/ptr.h | 10 +- ginac/registrar.cpp | 10 - ginac/registrar.h | 75 +- ginac/relational.cpp | 16 +- ginac/relational.h | 8 +- ginac/structure.h | 35 +- ginac/symbol.cpp | 231 ++-- ginac/symbol.h | 79 +- ginac/symmetry.cpp | 15 +- ginac/symmetry.h | 6 + ginac/tensor.cpp | 26 +- ginac/tensor.h | 19 +- ginac/utils.cpp | 2 + ginac/utils.h | 16 +- ginac/wildcard.cpp | 15 +- ginac/wildcard.h | 6 + ginsh/ginsh.h | 2 +- ginsh/ginsh_lexer.ll | 8 +- 79 files changed, 3121 insertions(+), 823 deletions(-) create mode 100644 check/test_runner.h create mode 100644 check/time_uvar_gcd.cpp create mode 100644 ginac/polynomial/eval_uvar.h create mode 100644 ginac/polynomial/gcd_uvar.cpp create mode 100644 ginac/polynomial/heur_gcd_uvar.h create mode 100644 ginac/polynomial/interpolate_padic_uvar.h create mode 100644 ginac/polynomial/prem_uvar.h create mode 100644 ginac/polynomial/sr_gcd_uvar.h hooks/post-receive -- GiNaC -- a C++ library for symbolic computations

1 0

Please pull from git://ffmssmsc.jinr.ru:443/varg/ginac.git master
by Alexei Sheplyakov 19 Oct '08

19 Oct '08

Dear Jens, please pull from git://ffmssmsc.jinr.ru:443/varg/ginac.git master The following changes since commit a377cee53b71348235ec36f83afeced7e10288a8: Jens Vollinga (1): Merge branch 'master' of git://ffmssmsc.jinr.ru:443/varg/ginac are available: Alexei Sheplyakov (20): [trivial] excompiler.cpp: shut up some silly compiler warnings. [bugfix] normalize_in_ring: don't set the leading coefficient to 1. [bugfix] remainder_in_ring: using exact division is plain wrong. mod_gcd: naive hack to chose a 'good' prime (to speed up gcd computation). polynomial: introduce a helper function to divide polynomial by ring element. Rewritten heuristic and PRS GCD for univariate polynomials, added benchmark. ptr.h: use unsigned int to store reference counts (in order to save memory). is_exactly_a: use typeid() to check the type of expression. basic, expairseq: use standard C++ RTTI in compare(), is_equal(), match(), etc. indexed::eval: use standard C++ RTTI. calchash(): use type_info::name() instead of tinfo(). A better return_type_tinfo() mechanism. registered_class_info: use typeid() instead of tinfo_static. Wipe out remnants of custom RTTI. symbol: remove return_type_tinfo() and return_type() (shrink symbol by 8 bytes) symbol: don't bother to set TeX name if user did not specified one. symbol: make get_domain() a virtual method, remove symbol::domain. tutorial: don't mention custom RTTI any more (as it does not exist). Don't force every algebraic class to implement archiving/unarchiving. tutorial: simplify the instructions on writing extension classes. check/Makefile.am | 4 + check/exam_archive.cpp | 3 +- check/test_runner.h | 67 + check/time_uvar_gcd.cpp | 1877 +++++++++++++++++++++++++++++ doc/examples/mystring.cpp | 24 +- doc/tutorial/ginac.texi | 195 +--- ginac/Makefile.am | 6 + ginac/add.cpp | 12 +- ginac/add.h | 3 +- ginac/archive.cpp | 46 +- ginac/archive.h | 80 ++ ginac/basic.cpp | 47 +- ginac/basic.h | 31 +- ginac/clifford.cpp | 40 +- ginac/clifford.h | 25 +- ginac/color.cpp | 34 +- ginac/color.h | 12 +- ginac/constant.cpp | 20 +- ginac/constant.h | 7 +- ginac/container.h | 104 +- ginac/ex.h | 3 +- ginac/excompiler.cpp | 6 +- ginac/expairseq.cpp | 38 +- ginac/expairseq.h | 3 + ginac/exprseq.h | 3 - ginac/fail.cpp | 3 +- ginac/fail.h | 2 + ginac/fderivative.cpp | 9 +- ginac/fderivative.h | 3 + ginac/function.pl | 40 +- ginac/idx.cpp | 29 +- ginac/idx.h | 12 +- ginac/indexed.cpp | 22 +- ginac/indexed.h | 7 +- ginac/integral.cpp | 12 +- ginac/integral.h | 8 +- ginac/lst.cpp | 3 + ginac/lst.h | 4 +- ginac/matrix.cpp | 20 +- ginac/matrix.h | 6 + ginac/mul.cpp | 17 +- ginac/mul.h | 3 +- ginac/ncmul.cpp | 23 +- ginac/ncmul.h | 4 +- ginac/numeric.cpp | 24 +- ginac/numeric.h | 6 + ginac/polynomial/eval_uvar.h | 38 + ginac/polynomial/gcd_uvar.cpp | 33 + ginac/polynomial/heur_gcd_uvar.h | 66 + ginac/polynomial/interpolate_padic_uvar.h | 40 + ginac/polynomial/mod_gcd.cpp | 12 +- ginac/polynomial/normalize.tcc | 3 +- ginac/polynomial/prem_uvar.h | 47 + ginac/polynomial/remainder.tcc | 2 +- ginac/polynomial/ring_traits.hpp | 13 + ginac/polynomial/sr_gcd_uvar.h | 95 ++ ginac/polynomial/upoly.hpp | 31 + ginac/power.cpp | 11 +- ginac/power.h | 12 +- ginac/pseries.cpp | 10 +- ginac/pseries.h | 5 + ginac/ptr.h | 10 +- ginac/registrar.cpp | 10 - ginac/registrar.h | 75 +- ginac/relational.cpp | 16 +- ginac/relational.h | 8 +- ginac/structure.h | 35 +- ginac/symbol.cpp | 231 ++-- ginac/symbol.h | 79 +- ginac/symmetry.cpp | 15 +- ginac/symmetry.h | 6 + ginac/tensor.cpp | 26 +- ginac/tensor.h | 19 +- ginac/utils.cpp | 2 + ginac/utils.h | 16 +- ginac/wildcard.cpp | 15 +- ginac/wildcard.h | 6 + ginsh/ginsh.h | 2 +- ginsh/ginsh_lexer.ll | 8 +- 79 files changed, 3121 insertions(+), 823 deletions(-) create mode 100644 check/test_runner.h create mode 100644 check/time_uvar_gcd.cpp create mode 100644 ginac/polynomial/eval_uvar.h create mode 100644 ginac/polynomial/gcd_uvar.cpp create mode 100644 ginac/polynomial/heur_gcd_uvar.h create mode 100644 ginac/polynomial/interpolate_padic_uvar.h create mode 100644 ginac/polynomial/prem_uvar.h create mode 100644 ginac/polynomial/sr_gcd_uvar.h Best regards, Alexei -- All science is either physics or stamp collecting.

1 0

Re: [GiNaC-devel] GiNaC-devel Digest, Vol 43, Issue 2
by Sam Iam 10 Oct '08

10 Oct '08

On Friday October 10 2008 06:00:02 am ginac-devel-request(a)ginac.de wrote: Dear Alexei, Thanks for the info. > 1. (The esiest) don't use -ftracer That's what I do now. > 2. (A little bit more difficult) use my version of CLN, you can get it from > git://ffmssmsc.jinr.ru:443/varg/cln.git > WARNING: it's binary incompatible with original version (the API > is the same, though). Since Gentoo is a source based distribution, this should work. I'll suggest it on Gentoo bug tracker. But, this might not be easy or even necessary as this is really a very minor issue. Gentoo build scripts can easily filter out -ftracer flag. > 3. (Hard) convince CLN developers to wipe out CL_REQUIRE/CL_PROVIDE stuff. That's where I went wrong. I thought (mistakenly it appears) CLN is also developed by this group. I'll give it a try with CLN developers anyway. Thanks again for the prompt response. -- Sam PS: GiNaC is a very cool piece of software. I stumbled on to it by accident, but I'm glad I did :)

1 0

Compilation of cln fails with gcc 4.1.2 with -O2 and -ftracer
by Sam Iam 09 Oct '08

09 Oct '08

Hi, Sorry if this has been reported before. When I try to compile cln (both 1.1.13 and 1.2.2) using gcc 4.1.2 with options -O2 and -ftracer, compilation fails. -- session log -- localhost # cd /var/tmp/portage/sci-libs/cln-1.1.13/work/cln-1.1.13/src localhost src # g++ -march=pentium4 -mtune=pentium4 -O2 -pipe -ftracer -I../include -I./base -c base/random cl_random_def.cc -o cl_random_def.o {standard input}: Assembler messages: {standard input}:65: Error: symbol `cl_module__cl_random_def__ctorend' is already defined ---- This was reported on Gentoo bug tracker: http://bugs.gentoo.org/show_bug.cgi?id=237451 I found a post that might describe a similar problem. But I'm not sure. http://lists.gforge.info.ucl.ac.be/pipermail/mozart-hackers/2003/001164.html -- Sam

2 1

Switch UniPoly to cl_UP_MI
by Jens Vollinga 30 Sep '08

30 Sep '08

Dear all, with the latest commit 2a5d912dc940... the polynomial factorization now uses the cln class cl_UP_MI instead of the ad-hoc invented UniPoly class. Maybe it is interesting to note that my benchmarks show no improvements in speed at all (rather some tiny change for the worse). This is kind of disappointing, because I expected some decent improvement due to the inefficient and times stupid ways UniPoly was set up. Maybe this recent remark on the cln mailing list gives a good explanation for that finding: Alexei Sheplyakov schrieb: > For example, the same univariate GCD code works about 3 -- 10 times > faster (and uses less memory) if I use std::vector<cl_I> instead of > cl_UP. Well, at least the line count in factor.cpp has decreased. Regards, Jens

2 2

[SCM] GiNaC -- a C++ library for symbolic computations branch, master, updated. release_1-4-0-126-ga377cee
by git＠ginac.de 30 Sep '08

30 Sep '08

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 a377cee53b71348235ec36f83afeced7e10288a8 (commit) via 546bababce8ef2b3c5ed3011cb7e49bd78016844 (commit) via 8c732512ca284f2a586694c7c33f1a0a4a68cef7 (commit) via b84032466e31ff23d4be3b81a3f535b2c70202e5 (commit) via 6f64b39dd25e4d2dcc869995b3d19724fa72afa6 (commit) via 95bec2b8af126412b2e27b51e6bfd8d9ab18d5d7 (commit) via 3324b2f0f035490940b1a9d7cf5dc210776f6d87 (commit) via 1261c54df6548cf558405a118b2134805f63376d (commit) via d4593e1981a168677f98e4d3b098696bd31088e2 (commit) via 05157f89a3db97fff79e33fd53156b380107011f (commit) via dbe5029ed72f406f45ec2a9d3584a828653ab34a (commit) via 14d8318d10eb608300e006af3bc261690c14d041 (commit) via ef06261c6354bea6d35e8bcdb89806056d4cccb9 (commit) via 58a84c0adac7cbaa63a50c06815aed9c7a0bcdcc (commit) via 949508429ea9850b8ec36d862f4e4d291773c313 (commit) via 4cbc8e8bdf06fd91ec652e9645965a5f1a808d76 (commit) via 1f7f3c85ec1b8063f475789544e9392ce59beb40 (commit) via bd3ecf75ed2a77b9f56fc31f7923fc0f4d1982d4 (commit) via 5d367f84b43b0636f943fe239f7a58b4d147f002 (commit) via 502e76319b484c32246707e33e70a428ac5dc6ad (commit) via 4f596b14ac1cdb03163c74e210cab493358ababf (commit) via 3918e4767063fb45e5728bd9b3a09dd8ac30d055 (commit) from 2a5d912dc9407c6bd1dbee6cb99cfdc206c4e42c (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 a377cee53b71348235ec36f83afeced7e10288a8 Merge: 2a5d912dc9407c6bd1dbee6cb99cfdc206c4e42c 546bababce8ef2b3c5ed3011cb7e49bd78016844 Author: Jens Vollinga <jensv(a)nikhef.nl> Date: Tue Sep 30 11:47:25 2008 +0200 Merge branch 'master' of git://ffmssmsc.jinr.ru:443/varg/ginac commit 546bababce8ef2b3c5ed3011cb7e49bd78016844 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sat Sep 20 23:18:46 2008 +0400 Implemented modular GCD algorithm for univariate polynomials. commit 8c732512ca284f2a586694c7c33f1a0a4a68cef7 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 07:13:01 2008 +0400 Wipe out the old (bison/flex generated) parser. Bison generated parser has a number of problems: 1. Bad performance. Parsing a sum seems to be O(N^{2 + a}) (a > 0). For example, parsing a sum (actually, a univariate polynomial) of 32768 terms takes about 90 sec. on my box, parsing a sum of 10^6 terms takes "eternity". 2. The user is expected to provide list of all symbols in the expression. Often this is very annoying (and useless), sometimes it is not possible at all. 3. Parser is not reentrant (bison *can* produce reentrant parsers, but that won't solve other problems). 4. Parser is difficult to extend. Since the new parser handles almost everything (useful) as the old one, let's remove the latter. commit b84032466e31ff23d4be3b81a3f535b2c70202e5 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 06:57:21 2008 +0400 check: time_parser.cpp: don't run the same benchmark twice. Since ex(const string&, lst&) ctor uses the new parser now comparing its performance (and result) with one of direct invocation of the parser is pointless. commit 6f64b39dd25e4d2dcc869995b3d19724fa72afa6 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 06:41:12 2008 +0400 Document the new parser, provide an example. commit 95bec2b8af126412b2e27b51e6bfd8d9ab18d5d7 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 06:24:29 2008 +0400 Use the new parser in the ex(const string&, lst&) ctor. Note: this is certainly not the optimal way to use the parser. It's provided for backward compatibility only. commit 3324b2f0f035490940b1a9d7cf5dc210776f6d87 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 06:01:53 2008 +0400 Parser can parse (some) floating point numbers now. commit 1261c54df6548cf558405a118b2134805f63376d Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 03:26:33 2008 +0400 parser: add necessary checks to operator() to stop accepting nonsense. Since the parser is recursive parse_* methods (in particular, parse_binop_rhs()) does NOT check if the last unparsed token is valid. Thus parse_expression() stops if it encounters an unknown token. That's why parser::operator() needs to make sure nothing is left in the input stream. commit d4593e1981a168677f98e4d3b098696bd31088e2 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 02:36:16 2008 +0400 [bugfix] parser::parse_literal_expr(): don't forget to consume the token... ... so parser won't process it twice (and get either spurious error or wrong result). commit 05157f89a3db97fff79e33fd53156b380107011f Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sun Sep 14 03:19:05 2008 +0400 [bugfix]: parser::parse_unary_expr() parses '-a-b' correctly now. Also added regression test. commit dbe5029ed72f406f45ec2a9d3584a828653ab34a Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sat Sep 13 05:12:31 2008 +0400 ginac.h: include parser.hpp commit 14d8318d10eb608300e006af3bc261690c14d041 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sat Sep 13 04:55:23 2008 +0400 parser: change order of the constructor optional arguments. Functions/methods having multiple optional arguments are not very convenient to use in C++ (to put it mildly). Shuffle parser ctor arguments so not so frequently used argument is the last one. commit ef06261c6354bea6d35e8bcdb89806056d4cccb9 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sat Sep 13 04:40:12 2008 +0400 parser: allow read/write access to symbol table and strictness. Intended usage: parser reader; ifstream input_file1, input_file2; // read the first file... ex e1 = reader(input_file1); // ... add extra entry into the symbol table used by parser symbol x; parser.get_syms()["x"] = x; // Disable the parser to introduce new symbols, e.g. to ensure the expression // in input_file2 contains the same symbols as e1 (read from input_file1). parser.strict = true; ex e2; try { e2 = reader(input_file2); } catch (...) { abort(); } commit 58a84c0adac7cbaa63a50c06815aed9c7a0bcdcc Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sat Sep 13 04:30:22 2008 +0400 parser: map input strings onto arbitrary expressions (not only symbols). So it's possible to make abbreviations, e.g. symbol x; symtab table; table["x"] = x + log(x) + 1; parser reader(table); ex e = reader("1 + x^2 + 5*x^3"); commit 949508429ea9850b8ec36d862f4e4d291773c313 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Sat Sep 13 04:21:27 2008 +0400 [BUGFIX] parser.hpp: fix include guard so the header is actually usable. commit 4cbc8e8bdf06fd91ec652e9645965a5f1a808d76 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Sep 12 19:55:36 2008 +0400 [nitpick] power::expand_add(): don't use int instead of std::size_t. This shuts a few 'comparison between signed and unsigned integer expressions' warnings. commit 1f7f3c85ec1b8063f475789544e9392ce59beb40 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Sep 12 19:55:36 2008 +0400 [nitpick] inifcns_nstdsums: don't use int instead of std::size_t. This shuts up quite a number of 'comparison between signed and unsigned integer expressions' warnings. commit bd3ecf75ed2a77b9f56fc31f7923fc0f4d1982d4 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Sep 12 19:55:36 2008 +0400 [nitpick] don't use int instead of std::size_t. This shuts up (some of) 'comparison between signed and unsigned integer expressions' warnings. commit 5d367f84b43b0636f943fe239f7a58b4d147f002 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Thu Sep 11 15:16:21 2008 +0400 G_numeric: use cl_N and int to manipulate numbers (instead of ex). Convert helper functions G_do_hoelder and G_do_trafo in the same manner, update all call sites. This should speed up numerical calculation of multiple polylogarithms a little bit, and reduce the memory usage. commit 502e76319b484c32246707e33e70a428ac5dc6ad Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Wed Sep 10 15:43:35 2008 +0400 G_numeric: put convergence/acceleration transofrmations into helper functions. This is simple code move, everything else should be considered a bug. The helper functions (as well as G_numeric itself) will be improved by subsequent patches. commit 4f596b14ac1cdb03163c74e210cab493358ababf Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Fri Sep 12 14:55:42 2008 +0400 match() (find()): use exmap (exset) to store matched subexpressions. There's no need to re-invent associative arrays and wrap them into a GiNaC class. commit 3918e4767063fb45e5728bd9b3a09dd8ac30d055 Author: Alexei Sheplyakov <varg(a)theor.jinr.ru> Date: Thu Sep 11 16:59:30 2008 +0400 expairseq::match(): remove the code which works around basic::match bug. basic::match() used to have side effects in a case of a failed match. As a result of that bug exparsed::match did not work correctly in some cases, see [1] for more details. These false negatives were worked around by [2]. Now that match() has no unwanted side effects [3] we don't need any work arounds any more. Just in a case add a regression test (from [1]). [1] http://www.ginac.de/pipermail/ginac-devel/2006-April/000942.html [2] Commit 73f0ce4cf8d91f073f35a45443f5fbe886921c5c ("Fixed bugs in ::match"). [3] Commit 192ed7390b7b2b705ad100e3db0a92eedd2b20ad ("match: don't modify subexpression list if expression doesn't match the pattern."). ----------------------------------------------------------------------- Summary of changes: check/Makefile.am | 19 ++- check/error_report.hpp | 17 ++ check/exam_cra.cpp | 120 ++++++++++ check/exam_mod_gcd.cpp | 85 +++++++ check/match_bug.cpp | 66 +++++ check/parser_bugs.cpp | 94 ++++++++ check/time_parser.cpp | 40 +--- doc/examples/Makefile.am | 2 +- doc/examples/derivative.cpp | 30 +++ doc/examples/ginac-examples.texi | 7 + doc/tutorial/ginac.texi | 102 ++++++-- ginac/Makefile.am | 25 ++- ginac/basic.cpp | 23 +- ginac/basic.h | 2 +- ginac/ex.cpp | 20 +-- ginac/ex.h | 8 +- ginac/expairseq.cpp | 20 +-- ginac/expairseq.h | 2 +- ginac/ginac.h | 6 + ginac/indexed.cpp | 4 +- ginac/inifcns_nstdsums.cpp | 488 ++++++++++++++++++++----------------- ginac/input_lexer.h | 69 ------ ginac/input_lexer.ll | 211 ---------------- ginac/input_parser.yy | 201 ---------------- ginac/matrix.cpp | 2 +- ginac/mul.cpp | 22 +- ginac/ncmul.cpp | 8 +- ginac/parser/lexer.cpp | 12 +- ginac/parser/parse_context.cpp | 21 +- ginac/parser/parse_context.hpp | 9 +- ginac/parser/parser.cpp | 45 +++-- ginac/parser/parser.hpp | 16 +- ginac/parser/parser_compat.cpp | 49 ++++ ginac/polynomial/cra_garner.cpp | 88 +++++++ ginac/polynomial/cra_garner.hpp | 12 + ginac/polynomial/debug.hpp | 29 +++ ginac/polynomial/gcd_euclid.tcc | 45 ++++ ginac/polynomial/mod_gcd.cpp | 165 +++++++++++++ ginac/polynomial/mod_gcd.hpp | 11 + ginac/polynomial/normalize.tcc | 93 +++++++ ginac/polynomial/remainder.tcc | 116 +++++++++ ginac/polynomial/ring_traits.hpp | 32 +++ ginac/polynomial/upoly.hpp | 129 ++++++++++ ginac/polynomial/upoly_io.cpp | 53 ++++ ginac/polynomial/upoly_io.hpp | 12 + ginac/power.cpp | 34 ++- ginac/structure.h | 2 +- ginac/wildcard.cpp | 2 +- ginac/wildcard.h | 2 +- ginsh/ginsh_parser.yy | 18 +- tools/Makefile.am | 2 +- 51 files changed, 1792 insertions(+), 898 deletions(-) create mode 100644 check/error_report.hpp create mode 100644 check/exam_cra.cpp create mode 100644 check/exam_mod_gcd.cpp create mode 100644 check/match_bug.cpp create mode 100644 check/parser_bugs.cpp create mode 100644 doc/examples/derivative.cpp delete mode 100644 ginac/input_lexer.h delete mode 100644 ginac/input_lexer.ll delete mode 100644 ginac/input_parser.yy create mode 100644 ginac/parser/parser_compat.cpp create mode 100644 ginac/polynomial/cra_garner.cpp create mode 100644 ginac/polynomial/cra_garner.hpp create mode 100644 ginac/polynomial/debug.hpp create mode 100644 ginac/polynomial/gcd_euclid.tcc create mode 100644 ginac/polynomial/mod_gcd.cpp create mode 100644 ginac/polynomial/mod_gcd.hpp create mode 100644 ginac/polynomial/normalize.tcc create mode 100644 ginac/polynomial/remainder.tcc create mode 100644 ginac/polynomial/ring_traits.hpp create mode 100644 ginac/polynomial/upoly.hpp create mode 100644 ginac/polynomial/upoly_io.cpp create mode 100644 ginac/polynomial/upoly_io.hpp hooks/post-receive -- GiNaC -- a C++ library for symbolic computations

1 0

Please pull from git://ffmssmsc.jinr.ru:443/varg/ginac.git master
by Alexei Sheplyakov 30 Sep '08

30 Sep '08

Dear Jens, Could you please pull from git://ffmssmsc.jinr.ru:443/varg/ginac.git master The following changes since commit 4ee761760b3db8649b8b616256cd7466fe2cd033: Jens Vollinga (1): Fixed various bugs in multivariate factorization. are available: Alexei Sheplyakov (21): expairseq::match(): remove the code which works around basic::match bug. match() (find()): use exmap (exset) to store matched subexpressions. G_numeric: put convergence/acceleration transofrmations into helper functions. G_numeric: use cl_N and int to manipulate numbers (instead of ex). [nitpick] don't use int instead of std::size_t. [nitpick] inifcns_nstdsums: don't use int instead of std::size_t. [nitpick] power::expand_add(): don't use int instead of std::size_t. [BUGFIX] parser.hpp: fix include guard so the header is actually usable. parser: map input strings onto arbitrary expressions (not only symbols). parser: allow read/write access to symbol table and strictness. parser: change order of the constructor optional arguments. ginac.h: include parser.hpp [bugfix]: parser::parse_unary_expr() parses '-a-b' correctly now. [bugfix] parser::parse_literal_expr(): don't forget to consume the token... parser: add necessary checks to operator() to stop accepting nonsense. Parser can parse (some) floating point numbers now. Use the new parser in the ex(const string&, lst&) ctor. Document the new parser, provide an example. check: time_parser.cpp: don't run the same benchmark twice. Wipe out the old (bison/flex generated) parser. Implemented modular GCD algorithm for univariate polynomials. check/Makefile.am | 19 ++- check/error_report.hpp | 17 ++ check/exam_cra.cpp | 120 ++++++++++ check/exam_mod_gcd.cpp | 85 +++++++ check/match_bug.cpp | 66 +++++ check/parser_bugs.cpp | 94 ++++++++ check/time_parser.cpp | 40 +--- doc/examples/Makefile.am | 2 +- doc/examples/derivative.cpp | 30 +++ doc/examples/ginac-examples.texi | 7 + doc/tutorial/ginac.texi | 102 ++++++-- ginac/Makefile.am | 25 ++- ginac/basic.cpp | 23 +- ginac/basic.h | 2 +- ginac/ex.cpp | 20 +-- ginac/ex.h | 8 +- ginac/expairseq.cpp | 20 +-- ginac/expairseq.h | 2 +- ginac/ginac.h | 6 + ginac/indexed.cpp | 4 +- ginac/inifcns_nstdsums.cpp | 488 ++++++++++++++++++++----------------- ginac/input_lexer.h | 69 ------ ginac/input_lexer.ll | 211 ---------------- ginac/input_parser.yy | 201 ---------------- ginac/matrix.cpp | 2 +- ginac/mul.cpp | 22 +- ginac/ncmul.cpp | 8 +- ginac/parser/lexer.cpp | 12 +- ginac/parser/parse_context.cpp | 21 +- ginac/parser/parse_context.hpp | 9 +- ginac/parser/parser.cpp | 45 +++-- ginac/parser/parser.hpp | 16 +- ginac/parser/parser_compat.cpp | 49 ++++ ginac/polynomial/cra_garner.cpp | 88 +++++++ ginac/polynomial/cra_garner.hpp | 12 + ginac/polynomial/debug.hpp | 29 +++ ginac/polynomial/gcd_euclid.tcc | 45 ++++ ginac/polynomial/mod_gcd.cpp | 165 +++++++++++++ ginac/polynomial/mod_gcd.hpp | 11 + ginac/polynomial/normalize.tcc | 93 +++++++ ginac/polynomial/remainder.tcc | 116 +++++++++ ginac/polynomial/ring_traits.hpp | 32 +++ ginac/polynomial/upoly.hpp | 129 ++++++++++ ginac/polynomial/upoly_io.cpp | 53 ++++ ginac/polynomial/upoly_io.hpp | 12 + ginac/power.cpp | 34 ++- ginac/structure.h | 2 +- ginac/wildcard.cpp | 2 +- ginac/wildcard.h | 2 +- ginsh/ginsh_parser.yy | 18 +- tools/Makefile.am | 2 +- 51 files changed, 1792 insertions(+), 898 deletions(-) create mode 100644 check/error_report.hpp create mode 100644 check/exam_cra.cpp create mode 100644 check/exam_mod_gcd.cpp create mode 100644 check/match_bug.cpp create mode 100644 check/parser_bugs.cpp create mode 100644 doc/examples/derivative.cpp delete mode 100644 ginac/input_lexer.h delete mode 100644 ginac/input_lexer.ll delete mode 100644 ginac/input_parser.yy create mode 100644 ginac/parser/parser_compat.cpp create mode 100644 ginac/polynomial/cra_garner.cpp create mode 100644 ginac/polynomial/cra_garner.hpp create mode 100644 ginac/polynomial/debug.hpp create mode 100644 ginac/polynomial/gcd_euclid.tcc create mode 100644 ginac/polynomial/mod_gcd.cpp create mode 100644 ginac/polynomial/mod_gcd.hpp create mode 100644 ginac/polynomial/normalize.tcc create mode 100644 ginac/polynomial/remainder.tcc create mode 100644 ginac/polynomial/ring_traits.hpp create mode 100644 ginac/polynomial/upoly.hpp create mode 100644 ginac/polynomial/upoly_io.cpp create mode 100644 ginac/polynomial/upoly_io.hpp Best regards, Alexei -- All science is either physics or stamp collecting.

3 14

[SCM] GiNaC -- a C++ library for symbolic computations branch, master, updated. release_1-4-0-104-g2a5d912
by git＠ginac.de 29 Sep '08

29 Sep '08

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 2a5d912dc9407c6bd1dbee6cb99cfdc206c4e42c (commit) via 1b735625b2759c1627046f9cb1baf834f4d26f5d (commit) from 4ee761760b3db8649b8b616256cd7466fe2cd033 (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 2a5d912dc9407c6bd1dbee6cb99cfdc206c4e42c Author: Jens Vollinga <jensv(a)nikhef.nl> Date: Mon Sep 29 17:38:46 2008 +0200 Replaced class UniPoly by cl_UP_MI. commit 1b735625b2759c1627046f9cb1baf834f4d26f5d Author: Jens Vollinga <jensv(a)nikhef.nl> Date: Fri Sep 26 11:07:02 2008 +0200 - Added options argument to factor(). Added flag factor_options::all that lets factor() act on all polynomial subexpressions. - Added more comments. ----------------------------------------------------------------------- Summary of changes: ginac/factor.cpp | 1287 ++++++++++++++++++++++-------------------------------- ginac/factor.h | 5 +- ginac/flags.h | 8 + 3 files changed, 521 insertions(+), 779 deletions(-) hooks/post-receive -- GiNaC -- a C++ library for symbolic computations

1 0