We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
When we have self-referential heap structures, the output loops infinitely and must be interrupted:
> (let ([v (make-vector 1 #t)]) (begin (vector-set! v 0 v) v)) #0='#(#0#) > (run (compile (parse '(let ([v (make-vector 1 #t)]) (begin (vector-set! v 0 v) v))))) ^Cuser break [,bt for context]
It'd be nice to implement a (simple) check for these cases and indicate the recursion somehow.
The text was updated successfully, but these errors were encountered:
It looks like Racket resolves these by printing out the recursive equations i.e. for this example it prints #0='#(#0#).
#0='#(#0#)
Sorry, something went wrong.
No branches or pull requests
When we have self-referential heap structures, the output loops infinitely and must be interrupted:
It'd be nice to implement a (simple) check for these cases and indicate the recursion somehow.
The text was updated successfully, but these errors were encountered: