On 09/13/2008 04:16 PM, Martin Rubey wrote: > Ralf Hemmecke <[EMAIL PROTECTED]> writes: > >>>>> Second: sbcl and especially ecl like it much better if you compile the lsp >>>>> files generated with the aldor compiler >>>> What does that mean? >>> ecl complains about "too large jump" in aldor-combinat, unless you compile >>> the >>> files. sbcl is *much* faster on compiled files. >> Does that just mean that instead of >> >> for f in $(ar t libcombinatax.al); do >> echo ")lib $f" >> combinat.input; >> done >> >> we should have something like >> >> for f in $(ar t libcombinatax.al); do >> n=$(basename $f .ao); >> echo ")compile $n.lsp" >> combinat.input; >> echo ")lib $n" >> combinat.input; >> done >> >> in Aldor-combinat? > > Not really, because it will fail for siprimes on machines with not enough > memory (eg., my laptop).
Na wat denn nu? In "Second" you say that the lsp file should be compiled and here you say, that it won't easily compile at all. If that is not confusing. Ralf (If you look at cssiprimes.lsp, you'll find a rather > long routine starting with > > (|SetAElt| > t6 > (the |SInt| 0) > (|CCall| > (|Lex| |Struct-cssiprimes-8-integer-3| 3 |l2|) > (|MakeLit| "2"))) > (|SetAElt| > t6 > (the |SInt| 1) > (|CCall| > (|Lex| |Struct-cssiprimes-8-integer-3| 3 |l2|) > (|MakeLit| "3"))) > (|SetAElt| > t6 > (the |SInt| 2) > (|CCall| > (|Lex| |Struct-cssiprimes-8-integer-3| 3 |l2|) > (|MakeLit| "5"))) > > and going on for quite a long time. It seems that not all compilers like it > equally well... > > Martin > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en -~----------~----~----~----~------~----~------~--~---
