Re: how to speed up some lisp code?
From: John H Palmieri (palmieri_at_math.washington.edu)
Date: 02/19/04
- Next message: John H Palmieri: "Re: how to speed up some lisp code?"
- Previous message: John H Palmieri: "Re: how to speed up some lisp code?"
- In reply to: Richard Fateman: "Re: how to speed up some lisp code?"
- Next in thread: Rahul Jain: "Re: how to speed up some lisp code?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Thu, 19 Feb 2004 14:50:57 -0800
On Feb 19 2004, Richard Fateman <rfateman@sbcglobal.net> wrote:
> There is nothing in Macsyma to do these operations.
> Although you call them polynomials, the polynomials
> in Macsyma are not the same.
> .....
>
> After profiling, you should have an idea where the
> most time is being used. The bottlenecks should be
> considered carefully...
I'll look into profiling the code.
> Are you compiling for highest speed, least checking?
Yes.
> My guess is that you should not be using alists which
> are of length in the thousands, for
> anything, but sorting, probably in vectors.
>
> unsorted collections, if you can use them instead,
> can be stored very neatly in hashtables.
I'll think about whether I can get away with this. My initial
response is that I probably do need things to be sorted.
> Good luck.
-- J. H. Palmieri Dept of Mathematics, Box 354350 mailto:palmieri@math.washington.edu University of Washington http://www.math.washington.edu/~palmieri/ Seattle, WA 98195-4350
- Next message: John H Palmieri: "Re: how to speed up some lisp code?"
- Previous message: John H Palmieri: "Re: how to speed up some lisp code?"
- In reply to: Richard Fateman: "Re: how to speed up some lisp code?"
- Next in thread: Rahul Jain: "Re: how to speed up some lisp code?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]