I am still struggling a bit.
Is there a way to profile/snapshot/inspect memory?
What is the canonical way to find a memory leak in a Racket program?
Best regards,
Nicolas.
_
For list-related administrative tasks:
http://lists.racket-lang.org/l
Thank you so much for the very quick answer.
Best,
Nicolas.
_
For list-related administrative tasks:
http://lists.racket-lang.org/listinfo/users
At Wed, 26 Oct 2011 17:27:02 +0100, "nicolas.o...@gmail.com" wrote:
> 1)
> (define (f x y)
> (lambda () x))
> (define g (f 2 veryBigObject) )
>
> Can I be sure that g does not retain a pointer to veryBigObject?
Yes.
> 2) (g is a function)
>
> (define (f)
>(let ([x veryBigObject])
>
Dear all,
I am struggling to find the origin of a memory leak in a small program I
wrote.
In order to help me searching, I would like to know a few details on the
implementation of Racket.
1)
(define (f x y)
(lambda () x))
(define g (f 2 veryBigObject) )
Can I be sure that g does not retain
4 matches
Mail list logo