>
> It's defined in UnaryRecursiveAggregate of aggcat.spad:
> last : (%, NonNegativeInteger) -> %
> ++ last(u, n) returns a copy of the last n (\spad{n >= 0}) nodes of u.
> ++ Note: \spad{last(u, n)} is a list of n elements.
>
>
> However, I think this signature is more suitable for tail,
> after all, we already have:
>
> last : D -> D1 from D if D has URAGG(D1) and D1 has TYPE
> tail : D -> D from D if D has URAGG(D1) and D1 has TYPE
>
>
> So the reasonable extension is last(a,n) returns the nth last
> element and tail(a,n) returns the list of last n elements.
Yes it is resonable. My only doubts is that as you
noticed there is only one place that currently uses
two argument 'last', so I am not sure how useful
is extending this functionality by adding new 'last'.
--
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.
