Bug report ID: 643254 "orderlessp([rat(x)], [rat(x)])"



I suggest that before anyone makes "great" slower, even a little, that 
you find out how much time is taken by great.
It is considerable.   Substantial time and effort were spent on making 
great as fast as possible within the constraints
of its specifications.

Speeding up  great and more generally speeding up sorting in the 
simplifier can make Maxima's simplifier run
many times faster on medium to large expressions. Barton and I have 
examples and patches for this.
Unfortunately, the speedup depends on some tricks that do not work as 
well on some systems as others
(depending on hash table speed), and there are some glitches that have 
to be ironed out before
inserting these fixes into Maxima.

RJF




Robert Dodier wrote:
> On 3/14/10, Dieter Kaiser <drdieterkaiser at web.de> wrote:
>
>   
>> 4. Modify great to handle special representations.
>>     
>
> This is my preference. I don't know how it should be accomplished.
>
> best
>
> Robert Dodier
> _______________________________________________
> Maxima mailing list
> Maxima at math.utexas.edu
> http://www.math.utexas.edu/mailman/listinfo/maxima
>