mirror of
https://github.com/justinethier/cyclone.git
synced 2025-05-29 15:05:04 +02:00
d3f7262414
Enforce a maximum C recursion depth when printing data structures. This protects against cases where a circular data structure may produce infinite output, blowing the stack. The recursive limit is sufficiently large such that a non-circular structure should not be impacted.
32 lines
724 B
Scheme
32 lines
724 B
Scheme
;; TODO: Temporary test file
|
|
(import (scheme base) (scheme write))
|
|
(define v1 (vector #f))
|
|
(define v2 (vector v1))
|
|
(vector-set! v1 0 v2)
|
|
(display v1)
|
|
;(equal? v1 v2)
|
|
|
|
(define v1 (vector 1 2 3))
|
|
(define v2 (vector 1 v1 3))
|
|
(vector-set! v1 1 v2)
|
|
(display v1)
|
|
|
|
(define l1 (list #f))
|
|
(define l2 (list l1))
|
|
(set-cdr! l1 l2)
|
|
(display l1)
|
|
|
|
(define l1 (list 1 2 3))
|
|
(define l2 (list 1 l1 3))
|
|
(set-cdr! (cdr l1) l2)
|
|
(write l1)
|
|
|
|
; TODO: need to compare pointers to prevent this sort of thing:
|
|
;
|
|
; cyclone> (display #(1 1 1 1 1 1 1 1))
|
|
; #(... ... ... ... ... ... ... ...)
|
|
;
|
|
; for equalp of pairs we track progress using cdr, cddr
|
|
; proves that if pointers are equal we are traversing the same list
|
|
;
|
|
; how to handle vector traversal?
|