oldk1331 wrote:
>
> As for NRECONC, it's more efficient, no counterpart in Spad.
> It's implementation is interesting in sbcl:
>
> (defun nreconc (x y)
> (do ((1st (cdr x) (if (endp 1st) 1st (cdr 1st)))
> (2nd x 1st) ;2nd follows first down the list.
> (3rd y 2nd)) ;3rd follows 2nd down the list.
> ((atom 2nd) 3rd)
> (rplacd 2nd 3rd)))
>
> It does what the comment in fmecg says: PUSH and POP.
> Maybe we can add a function in STACK: pop a stack to
> empty and push its elements into another stack.
That NRECONC alone is faster is no wonder. The question was
if NRECONC make measurable difference in the whole picture.
Concerning implementation: if we really need something like
this we can add a function to List.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
