"fastfib" in the gf package faster than "fib"

>
> On the balance, I think the trouble of doing that outweighs the benefit.
> So I'm not in favor. Feel free to try to convince me otherwise.
>

I'm quite disappointed by that.
There is just to compile("fastfib"), take the LISP code, clean it.

I see no reason to write code in/for Maxima and being part
of the developers community, if no-one cares for efficiency.

In that behaviour, I see no reason to implement sophisticated
tools like Artin symbols or Bessel functions, too.
If the point is only to have a good symbolic manipulator, I mean.

I've presented my fast Fibonacci calculator in WAIFI just
two days ago, it's been fully successful.
For its efficiency.

Lots of algorithms have running times shorter than 1sec:
multiply two integers of 100 digits with the school algorithm, just to say.
However, having a "general-purpose CAS" with the school-multiplication
algorithm for big integers seems to me -really- silly.

(end of paradoxical speech)

     Jacopo D'Aurizio

PS: Sorry for my rudeness and my awful English. Feel free to blame me.