"Bill Page" <[EMAIL PROTECTED]> writes:
> On Mon, Sep 1, 2008 at 2:30 PM, Martin Rubey wrote:
> > ...
> > Yes, it's not caught under FriCAS/sbcl, too, where we also get an
> > infinite loop. The responsible part is in ILIST, where we have
> >
> > #x == LENGTH(x)$Lisp
> >...
> > I have no idea how clisp checks whether a list is cyclic.
> > ...
>
> Probably we should be calling
>
> #x == integer(LIST_-LENGTH(x)$Lisp)
Great! Well, shouldn't that be
#x ==
if null?(l := LIST_-LENGTH(x)$Lisp)
then error "cyclic list"
else integer l
? Maybe it would make sense to compare speed with the definition taken from
URAGG. Well, no, I think it's best to fix this and move ahead. I add an issue
on MathAction, so we can fix it.
Martin
-------------------------------------------------------------------------
This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
Build the coolest Linux based applications with Moblin SDK & win great prizes
Grand prize is a trip for two to an Open Source event anywhere in the world
http://moblin-contest.org/redirect.php?banner_id=100&url=/
_______________________________________________
open-axiom-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/open-axiom-devel